Concatenated decoding with a reduced-search BCJR algorithm
V. Franz, John B. Anderson · IEEE Journal on Selected Areas in Communications · 1998
We apply two reduced-computation variants of the BCJR algorithm to the decoding of serial and parallel concatenated convolutional codes. One computes its recursions at only M states per trellis stage; one computes only at states with values above a threshold. The threshold scheme is much more efficient, and it greatly reduces the computation of the BCJR algorithm. By computing only when the channel demands it, the threshold scheme reduces the turbo decoder computation to one-four nodes per trellis stage after the second iteration.
Cited by 186 works. doi:10.1109/49.661107
Authors
References
- Optimal decoding of linear codes for minimizing symbol error rate (Corresp.)
- Optimal decoding of linear codes for minimizing symbol error rate
- Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1
- Near Shannon limit error-correcting coding and decoding : Turbo-codes
- A Viterbi algorithm with soft-decision outputs and its applications
- Near Shannon limit error-correcting coding and decoding
- A comparison of optimal and sub-optimal MAP decoding algorithms operating in the log domain
- Serial concatenation of interleaved codes: performance analysis, design, and iterative decoding
- Serial concatenation of interleaved codes: performance analysis, design and iterative decoding
- Improved decoding with the SOVA in a parallel concatenated (Turbo-code) scheme