In decoding the turbo codes, the sliding window BCJR algorithm, derived from the BCJR algorithm, permits a continuous decoding of the coded sequence without requiring trellis termination of the constituent codes and uses reduced memory span. However, the number of computations required is greater than that of BCJR algorithm. In this paper, we propose an efficient sliding window type scheme which maintains the advantages of the conventional sliding window algorithm, reduces its computational burdens, and improves its BER performance by allowing the window to be forwarded in multi-step. Simulation results show that the proposed scheme outperforms the conventional sliding window BCJR algorithm with reduced complexity.
CITATION STYLE
Gwak, J., Shin, S. K., & Kim, H. M. (1999). Reduced complexity sliding window BCJR decoding algorithms for turbo codes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1746, pp. 179–184). Springer Verlag. https://doi.org/10.1007/3-540-46665-7_20
Mendeley helps you to discover research relevant for your work.