BER comparison between Convolutional, Turbo, LDPC, and Polar codes

Channel coding is a fundamental building block in any communications system. High performance codes, with low complexity encoding and decoding are a must-have for future wireless systems, with requirements ranging from the operation in highly reliable scenarios, utilizing short information messages and low code rates, to high throughput scenarios, working with long messages, and high code rates. We investigate in this paper the performance of Convolutional, Turbo, Low-Density Parity-Check (LDPC), and Polar codes, in terms of the Bit-Error-Ratio (BER) for different information block lengths and code rates, spanning the multiple scenarios of reliability and high throughput. We further investigate their convergence behavior with respect to the number of iterations (turbo and LDPC), and list size (polar), as well as how their performance is impacted by the approximate decoding algorithms.

[1]  Dariush Divsalar,et al.  Coding theorems for 'turbo-like' codes , 1998 .

[2]  Naresh R. Shanbhag,et al.  Turbo decoder architectures for low-density parity-check codes , 2002, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.

[3]  Dong-Joon Shin,et al.  Design of rate-compatible RA-type low-density parity-check codes using splitting , 2009, IEEE Transactions on Communications.

[4]  Van Nostrand,et al.  Error Bounds for Convolutional Codes and an Asymptotically Optimum Decoding Algorithm , 1967 .

[5]  D.J.C. MacKay,et al.  Good error-correcting codes based on very sparse matrices , 1997, Proceedings of IEEE International Symposium on Information Theory.

[6]  Toby Berger,et al.  Coding for noisy channels with input-dependent insertions , 1977, IEEE Trans. Inf. Theory.

[7]  Kjetil Fagervik.  PERFORMANCE AND COMPLEXITY COMPARISON OF LOW DENSITY PARITY CHECK CODES AND TURBO CODES , 2003 .

[8]  Johannes B. Huber,et al.  LDPC codes and convolutional codes with equal structural delay: a comparison , 2009, IEEE Transactions on Communications.

[9]  Üstün Özgür.  A Performance comparision of polar codes with convolutional turbo codes , 2009 .

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

[11]  Michal Simko,et al.  LTE Rate Matching Performance with Code Block Balancing , 2011, EW.

[12]  Radford M. Neal,et al.  Near Shannon limit performance of low density parity check codes , 1996 .

[13]  Rüdiger L. Urbanke,et al.  Efficient encoding of low-density parity-check codes , 2001, IEEE Trans. Inf. Theory.

[14]  Alexander Vardy,et al.  List decoding of polar codes , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

[15]  Michael Lentmaier,et al.  Challenges and some new directions in channel coding , 2015, Journal of Communications and Networks.

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

[17]  P. Takis Mathiopoulos,et al.  Quasi-Cyclic Low-Density Parity-Check (QC-LDPC) codes for deep space and high data rate applications , 2009, 2009 International Workshop on Satellite and Space Communications.

[18]  Daniel J. Costello,et al.  Coding with a latency constraint: The benefits of sequential decoding , 2010, 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[19]  H. Kfir,et al.  Parallel versus sequential updating for belief propagation decoding , 2002, cond-mat/0207185.

[20]  Yi Hong,et al.  A Comparative Study of Polar Code Constructions for the AWGN Channel , 2015, ArXiv.

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

[22]  Alexios Balatsoukas-Stimming,et al.  LLR-Based Successive Cancellation List Decoding of Polar Codes , 2013, IEEE Transactions on Signal Processing.

[23]  William Ryan,et al.  Channel Codes by William Ryan , 2009 .

[24]  Hideki Imai,et al.  Reduced complexity iterative decoding of low-density parity check codes based on belief propagation , 1999, IEEE Trans. Commun..

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

[26]  Shu Lin,et al.  Channel Codes: Classical and Modern , 2009 .

[27]  Sang Joon Kim,et al.  A Mathematical Theory of Communication , 2006 .

[28]  William Ryan,et al.  Channel Codes: Classical and Modern , 2009 .

[29]  Kyeongcheol Yang,et al.  Lifting methods for quasi-cyclic LDPC codes , 2006, IEEE Communications Letters.

[30]  Erdal Arikan,et al.  Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels , 2008, IEEE Transactions on Information Theory.

[31]  Wolfgang Koch,et al.  Optimum and sub-optimum detection of coded data disturbed by time-varying intersymbol interference (applicable to digital mobile radio receivers) , 1990, [Proceedings] GLOBECOM '90: IEEE Global Telecommunications Conference and Exhibition.

[32]  Johannes Van Wonterghem,et al.  Performance comparison of short-length error-correcting codes , 2016, 2016 Symposium on Communications and Vehicular Technologies (SCVT).