Performance Analysis of Sliding Window Turbo Decoding Algorithms for 3GPP FDD Mode

In this paper we analyze the performance of a turbo decoder using two sliding window algorithms for the frequency division duplex (FDD) mode of the Third Generation Partnership Project (3GPP) standard. Focusing on the solution for the user equipment, we compare fixed-point realizations of the sliding window algorithms in terms of the computational complexity and memory requirements. We show that the bit and frame error rate performance of the sliding window scheme strongly depends on the guard window size. Furthermore, simulation results indicate that relatively small guard window sizes can significantly decrease the iteration gain for large frames. Finally, optimization of the windowing parameters achieves the desired trade-off between the performance degradation introduced by a windowing approach and the computational complexity and memory utilization.

[1]  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.

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

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

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

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