On symbol-based turbo codes for cdma2000
F. Khaleghi, Amir K. Khandani, N.P. Secord, A. Gutierrez
Abstract
F. Khaleghi, Amir K. Khandani, N.P. Secord, A. Gutierrez
Abstract
Turbo codes have enjoyed a great attention. Among different soft-output decoding algorithms of turbo codes only maximum a posteriori (MAP) decoding as an iterative soft-output decoder (BCJR) allows for achieving an acceptable BER performance at Eb/No levels within only 1 dB of the value corresponding to the Shannon capacity. The drawback of the MAP algorithm is the excessive memory required. Here, we investigate the so-called symbol-based turbo codes. These codes allow for a reduced required memory by 30% for the BCJR method.
OpenAlex reports 6 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Turbo codes have enjoyed a great attention. Among different soft-output decoding algorithms of turbo codes only maximum a posteriori (MAP) decoding as an iterative soft-output decoder (BCJR) allows for achieving an acceptable BER performance at Eb/No levels within only 1 dB of the value corresponding to the Shannon capacity. The drawback of the MAP algorithm is the excessive memory required. Here, we investigate the so-called symbol-based turbo codes. These codes allow for a reduced required memory by 30% for the BCJR method.
Key concepts: Turbo code, BCJR algorithm, Serial concatenated convolutional codes, Turbo equalizer, Concatenated error correction code, Computer science, Algorithm, Maximum a posteriori estimation