Performance Comparison Between Turbo Code and Rate-Compatible LDPC Code for Evolved Utra Downlink OFDM Radio Access

This paper compares the Release 6 turbo code and rate-compatible low-density parity-check (LDPC) codes based on the packet error rate (PER) performance and decoding complexity in order to clarify the most appropriate channel coding scheme in the OFDM based evolved UTRA (E-UTRA) downlink. Simulation results and manipulation of the decoding complexity show that although the rate-compatible/quasi-cyclic (RC/QC)-LDPC code employing a normalized layered belief propagation (BP) method can reduce the computational complexity by approximately 30% for the channel coding rate of R=3/4, the required average received signal energy per bit-to-noise power spectrum density ratio (Eb/N 0) is degraded by approximately 0.2-0.3 dB both for R=1/3 and 3/4 compared to that for the turbo code. Moreover, the decoding complexity level of the RC/QC-LDPC code with the delta-min algorithm is almost the same or higher than that for the turbo code with a slight degradation in the required received Eb/N0. Although the decoding complexity level of the ZigZag code is decreased compared to that of the turbo code, the code brings about a distinct loss in the required average received Eb/N0 of approximately 0.4 dB. Finally, the turbo single parity check (SPC) code improves the PER performance compared to the ZigZag code, i.e., achieves almost the same PER performance as that for the turbo code, at the cost of a two-fold increase in the decoding complexity. As a result, we conclude that the turbo code is more promising than the LDPC codes for prioritizing the achievable performance and as the channel coding scheme for the shared data channel in the E-UTRA

[1]  Dong-Joon Shin,et al.  Construction and analysis of rate-compatible punctured concatenated zigzag codes , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

[2]  Keshab K. Parhi,et al.  Overlapped message passing for quasi-cyclic low-density parity check codes , 2004, IEEE Transactions on Circuits and Systems I: Regular Papers.

[3]  A. Glavieux,et al.  Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1 , 1993, Proceedings of ICC '93 - IEEE International Conference on Communications.

[4]  D.E. Hocevar,et al.  A reduced complexity decoder architecture via layered decoding of LDPC codes , 2004, IEEE Workshop onSignal Processing Systems, 2004. SIPS 2004..

[5]  Jinghu Chen,et al.  Density evolution for two improved BP-Based decoding algorithms of LDPC codes , 2002, IEEE Communications Letters.

[6]  P.H.-Y. Wu,et al.  On the complexity of turbo decoding algorithms , 2001, IEEE VTS 53rd Vehicular Technology Conference, Spring 2001. Proceedings (Cat. No.01CH37202).

[7]  Rüdiger L. Urbanke,et al.  Design of capacity-approaching irregular low-density parity-check codes , 2001, IEEE Trans. Inf. Theory.

[8]  Robert Michael Tanner,et al.  A recursive approach to low complexity codes , 1981, IEEE Trans. Inf. Theory.

[9]  Joachim Hagenauer,et al.  Rate-compatible punctured convolutional codes (RCPC codes) and their applications , 1988, IEEE Trans. Commun..

[10]  Robert G. Gallager,et al.  Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.

[11]  Li Ping,et al.  An improved two-state turbo-SPC code for wireless communication systems , 2004, IEEE Transactions on Communications.

[12]  Li Ping,et al.  Zigzag codes and concatenated zigzag codes , 2001, IEEE Trans. Inf. Theory.

[13]  J. Vogt,et al.  Improving the max-log-MAP turbo decoder , 2000 .