Performance analysis of turbo decoder for 3GPP standard using the sliding window algorithm

We analyze the performance of a fixed-point turbo decoder using two sliding window algorithms for the 3GPP standard. We show that the bit and frame error rate performance of the sliding window scheme strongly depends on the guard window size. Simulation results also indicate that small guard window sizes can significantly decrease the iteration gain for large frames.

[1]  Amir K. Khandani,et al.  On symbol-based turbo codes for cdma2000 , 1999, WCNC. 1999 IEEE Wireless Communications and Networking Conference (Cat. No.99TH8466).

[2]  Norbert Wehn,et al.  Turbo-decoding without SNR estimation , 2000, IEEE Communications Letters.

[3]  C. Berrou,et al.  Saving memory in turbo-decoders using the max-log-MAP algorithm , 1999 .

[4]  P. Robertson Improving decoder and code structure of parallel concatenated recursive systematic (turbo) codes , 1994, Proceedings of 1994 3rd IEEE International Conference on Universal Personal Communications.

[5]  John Cocke,et al.  Optimal decoding of linear codes for minimizing symbol error rate (Corresp.) , 1974, IEEE Trans. Inf. Theory.

[6]  Dariush Divsalar,et al.  A soft-input soft-output APP module for iterative decoding of concatenated codes , 1997, IEEE Communications Letters.