On short-length error-correcting codes for 5G-NR

Abstract We compare the performance of a selection of short-length and very short-length linear binary error-correcting codes on the binary-input Gaussian noise channel, and on the fast and quasi-static flat Rayleigh fading channel. We use the probabilistic Ordered Statistics Decoder, that is universal to any code construction. As such we compare codes and not decoders. The word error rate versus the signal-to-noise ratio is found for LDPC, Reed–Muller, polar, turbo, Golay, random, and BCH codes at length 20, 32 and 256 bits. BCH and random codes outperform other codes in absence of a cyclic redundancy check concatenation. Under joint decoding, the concatenation of a cyclic redundancy check makes all codes perform very close to optimal lower bounds. Optimizations of the Ordered Statistics Decoder are discussed and revealed to bring near-ML performance with a notable complexity reduction, making the decoding complexity at very short length affordable.

[1]  Neil J. A. Sloane,et al.  The theory of error-correcting codes (north-holland , 1977 .

[2]  R. Blahut.  Algebraic Codes for Data Transmission , 2002 .

[3]  Stefania Sesia,et al.  LTE - The UMTS Long Term Evolution, Second Edition , 2011 .

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

[5]  Marc P. C. Fossorier,et al.  Probabilistic Sufficient Conditions on Optimality for Reliability Based Decoding of Linear Block Codes , 2006, 2006 IEEE International Symposium on Information Theory.

[6]  Joseph J. Boutros,et al.  On Constructions of Reed-Muller Subcodes , 2018, IEEE Communications Letters.

[7]  Tao Jiang,et al.  Parity-Check-Concatenated Polar Codes , 2016, IEEE Communications Letters.

[8]  Gianluigi Liva,et al.  Code Design for Short Blocks: A Survey , 2016, ArXiv.

[9]  Marc P. C. Fossorier.  Reliability-based soft-decision decoding with iterative information set reduction , 2002, IEEE Trans. Inf. Theory.

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

[11]  Rüdiger L. Urbanke,et al.  Modern Coding Theory , 2008 .

[12]  H. Vincent Poor,et al.  Channel Coding Rate in the Finite Blocklength Regime , 2010, IEEE Transactions on Information Theory.

[13]  Christoforos N. Hadjicostis,et al.  Soft-Decision Decoding of Linear Block Codes Using Preprocessing and Diversification , 2007, IEEE Transactions on Information Theory.

[14]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[15]  Toshiyuki Tanaka,et al.  Performance of polar codes with the construction using density evolution , 2009, IEEE Communications Letters.

[16]  Marc P. C. Fossorier,et al.  Soft-decision decoding using time and memory diversification , 2008, 2008 IEEE International Symposium on Information Theory.

[17]  John G. Proakis,et al.  Digital Communications , 1983 .

[18]  Shu Lin,et al.  Soft-decision decoding of linear block codes based on ordered statistics , 1994, IEEE Trans. Inf. Theory.

[19]  Marc P. C. Fossorier,et al.  Box and match techniques applied to soft-decision decoding , 2002, IEEE Transactions on Information Theory.

[20]  G. Battail.  Décodage pondéré optimal des codes linéaires en blocs , 1983 .

[21]  Ezio Biglieri,et al.  Coding for Wireless Channels , 2005 .

[22]  S. Dolinar,et al.  Weight distributions for turbo codes using random and nonrandom permutations , 1995 .

[23]  Ezio Biglieri,et al.  Low-Density Parity-Check Codes for Nonergodic Block-Fading Channels , 2007, IEEE Transactions on Information Theory.

[24]  Johannes Van Wonterghem,et al.  On performance and complexity of OSD for short error correcting codes in 5G-NR , 2017 .

[25]  Marc P. C. Fossorier,et al.  Reliability-Based Soft-Decision Decoding With Multiple Biases , 2007, IEEE Transactions on Information Theory.

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

[27]  Tomaso Erseghe,et al.  Coding in the Finite-Blocklength Regime: Bounds Based on Laplace Integrals and Their Asymptotic Approximations , 2015, IEEE Transactions on Information Theory.

[28]  John B. Shoven,et al.  I , Edinburgh Medical and Surgical Journal.

[29]  C. Shannon.  Probability of error for optimal codes in a Gaussian channel , 1959 .

[30]  Alain Glavieux,et al.  Reflections on the Prize Paper : "Near optimum error-correcting coding and decoding: turbo codes" , 1998 .

[31]  Tom Verhoeff,et al.  An updated table of minimum-distance bounds for binary linear codes , 1987, IEEE Trans. Inf. Theory.

[32]  Christoforos N. Hadjicostis,et al.  Soft-Decision Decoding Using Ordered Recodings on the Most Reliable Basis , 2007, IEEE Transactions on Information Theory.

[33]  F. MacWilliams,et al.  The Theory of Error-Correcting Codes , 1977 .

[34]  B. Dorsch,et al.  A decoding algorithm for binary block codes and J -ary output channels (Corresp.) , 1974, IEEE Trans. Inf. Theory.