On the error performance bound of ordered statistics decoding of linear block codes

In this paper, a novel simplified statistical approach to evaluate the error performance bound of Ordered Statistics Decoding (OSD) of Linear Block Codes (LBC) is investigated. First, we propose a novel statistic which depicts the number of errors contained in the ordered received noisy codeword. Then, simplified expressions for the probability mass function and cumulative distribution function are derived exploiting the implicit statistical independence property of the samples of the received noisy codeword before reordering. Second, we incorporate the properties of this new statistic to derive the simplified error performance bound of the OSD algorithm for all order-I reprocessing. Finally, with the proposed approach, we obtain computationally simpler error performance bounds of the OSD than those proposed in literature for all length LBCs.

[1]  Dong Zijian,et al.  Improved syndrome-based ordered statistic decoding algorithm for LDPC codes , 2010, 2010 2nd International Conference on Signal Processing Systems.

[2]  Christoforos N. Hadjicostis,et al.  Soft-decision decoding of linear block codes using efficient iterative G-space encodings , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[3]  Dwijendra K. Ray-Chaudhuri,et al.  Binary mixture flow with free energy lattice Boltzmann methods , 2022, arXiv.org.

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

[5]  G. David Forney,et al.  Generalized minimum distance decoding , 1966, IEEE Trans. Inf. Theory.

[6]  Ramesh Pyndiah,et al.  New Approach to Order Statistics Decoding of Long Linear Block Codes , 2007, IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference.

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

[8]  Alexander Vardy,et al.  Generalized minimum distance decoding in Euclidean space: Performance analysis , 1997, IEEE Trans. Inf. Theory.

[9]  Shu Lin,et al.  First-order approximation of the ordered binary-symmetric channel , 1996, IEEE Trans. Inf. Theory.

[10]  Xiao Ma,et al.  New Techniques for Upper-Bounding the ML Decoding Performance of Binary Linear Codes , 2011, IEEE Transactions on Communications.

[11]  Marc P. C. Fossorier,et al.  Iterative reliability-based decoding of low-density parity check codes , 2001, IEEE J. Sel. Areas Commun..

[12]  H.H. Nguyen,et al.  Iterative ordered-statistic decoding for LDPC coded modulation systems , 2005, Canadian Conference on Electrical and Computer Engineering, 2005..

[13]  Saif E. A. Alnawayseh,et al.  Complexity Reduction of Ordered Statistics Decoding Using Side Information , 2012, IEEE Communications Letters.

[14]  Shu Lin,et al.  Computationally efficient soft-decision decoding of linear block codes based on ordered statistics , 1996, IEEE Trans. Inf. Theory.

[15]  David Chase,et al.  Class of algorithms for decoding block codes with channel measurement information , 1972, IEEE Trans. Inf. Theory.

[16]  F. Moore,et al.  Polynomial Codes Over Certain Finite Fields , 2017 .

[17]  Jakov Snyders,et al.  Reliability-based code-search algorithms for maximum-likelihood decoding of block codes , 1997, IEEE Trans. Inf. Theory.

[18]  B. Sklar,et al.  The ABCs of linear block codes , 2004, IEEE Signal Processing Magazine.

[19]  Marc P. C. Fossorier,et al.  Iterative reliability-based decoding of linear block codes with adaptive belief propagation , 2005, IEEE Communications Letters.

[20]  Richard D. Wesel,et al.  Reliability-Output Decoding of Tail-Biting Convolutional Codes , 2013, IEEE Transactions on Communications.

[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]  Marc P. C. Fossorier,et al.  Box and match techniques applied to soft-decision decoding , 2002, IEEE Transactions on Information Theory.

[23]  Jack K. Wolf,et al.  Efficient maximum likelihood decoding of linear block codes using a trellis , 1978, IEEE Trans. Inf. Theory.

[24]  Shu Lin,et al.  Error performance analysis for reliability-based decoding algorithms , 2002, IEEE Trans. Inf. Theory.

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

[26]  N. J. A. Sloane,et al.  Soft decoding techniques for codes and lattices, including the Golay code and the Leech lattice , 1986, IEEE Trans. Inf. Theory.

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

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

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