Improved random redundant iterative HDPC decoding

An iterative algorithm for soft-input soft-output (SISO) decoding of classical algebraic cyclic block codes is presented below. Inspired by other approaches for high performance belief propagation (BP) decoding, this algorithm requires up to 10 times less computational complexity than other methods that achieve similar performance. By utilizing multiple BP decoders, and using random permutation taken from the permutation group of the code, this algorithm reaches near maximum likelihood performance. A computational complexity comparison of the proposed algorithm versus other methods is presented as well. This includes complexity versus performance analysis, allowing one to trade between the former and the latter, according to ones needs.

[1]  Johannes B. Huber,et al.  Multiple-Bases Belief-Propagation for Decoding of Short Block Codes , 2007, 2007 IEEE International Symposium on Information Theory.

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

[3]  P. Vontobel,et al.  Graph-Cover Decoding and Finite-Length Analysis of Message-Passing Iterative Decoding of LDPC Codes , 2005, ArXiv.

[4]  Deepak Sridhara,et al.  Pseudocodewords of Tanner Graphs , 2005, IEEE Transactions on Information Theory.

[5]  Krishna R. Narayanan,et al.  Iterative Soft-Input Soft-Output Decoding of Reed–Solomon Codes by Adapting the Parity-Check Matrix , 2005, IEEE Transactions on Information Theory.

[6]  Martin J. Wainwright,et al.  Using linear programming to Decode Binary linear codes , 2005, IEEE Transactions on Information Theory.

[7]  Keith M. Chugg,et al.  The Extraction and Complexity Limits of Graphical Models for Linear Codes , 2006, IEEE Transactions on Information Theory.

[8]  Thomas J. Richardson,et al.  The geometry of turbo-decoding dynamics , 2000, IEEE Trans. Inf. Theory.

[9]  Krishna R. Narayanan,et al.  Iterative soft decision decoding of Reed Solomon codes based on adaptive parity check matrices , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

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

[11]  Keith M. Chugg,et al.  Transactions Letters - Random Redundant Iterative Soft-in Soft-out Decoding , 2008, IEEE Transactions on Communications.

[12]  Jon Feldman,et al.  Decoding error-correcting codes via linear programming , 2003 .

[13]  Chung-Chin Lu,et al.  On automorphism groups of binary primitive BCH codes , 1994, Proceedings of 1994 IEEE International Symposium on Information Theory.