Reduced complexity ADMM-based schedules for LP decoding of LDPC convolutional codes

The ADMM based linear programming (LP) technique shows interesting error correction performance when decoding binary LDPC block codes. Nonetheless, it's applicability to decode LDPC convolutional codes (LDPC-CC) has not been yet investigated. In this paper, a first flooding based formulation of the ADMM-LP for decoding LDPC-CCs is described. In addition, reduced complexity decoding schedules to lessen the storage requirements and improve the convergence speed of an ADMM-LP based LDPC-CC decoder without significant loss in error correction performances are proposed and assessed from an algorithmic and computational/memory complexity perspectives.

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

[2]  Chao Chen,et al.  Improved ADMM Penalized Decoder for Irregular Low-Density Parity-Check Codes , 2015, IEEE Communications Letters.

[3]  Stephen P. Boyd,et al.  Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers , 2011, Found. Trends Mach. Learn..

[4]  Kamil Sh. Zigangirov,et al.  Time-varying periodic convolutional codes with low-density parity-check matrix , 1999, IEEE Trans. Inf. Theory.

[5]  Bertrand Le Gal,et al.  Fast Converging ADMM-Penalized Algorithm for LDPC Decoding , 2016, IEEE Communications Letters.

[6]  Richard Heusdens,et al.  Large Scale LP Decoding with Low Complexity , 2013, IEEE Communications Letters.

[7]  Xiaopeng Jiao,et al.  Reduced Complexity Node-Wise Scheduling of ADMM Decoding for LDPC Codes , 2017, IEEE Communications Letters.

[8]  Nadia Khouja,et al.  Hardware complexity reduction of LDPC-CC decoders based on message-passing approaches , 2016, 2016 17th International Conference on Sciences and Techniques of Automatic Control and Computer Engineering (STA).

[9]  Stark C. Draper,et al.  Suppressing pseudocodewords by penalizing the objective of LP decoding , 2012, 2012 IEEE Information Theory Workshop.

[10]  Stark C. Draper,et al.  The ADMM Penalized Decoder for LDPC Codes , 2014, IEEE Transactions on Information Theory.

[11]  Michael Lentmaier,et al.  Reduced complexity decoding strategies for LDPC convolutional codes , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[12]  Stark C. Draper,et al.  Decomposition methods for large scale LP decoding , 2011, 2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[13]  Badih Ghazi,et al.  Linear programming decoding of spatially coupled codes , 2013, 2013 IEEE International Symposium on Information Theory.

[14]  Michael Lentmaier,et al.  Implementation aspects of LDPC convolutional codes , 2008, IEEE Transactions on Communications.

[15]  Changsheng Zhou,et al.  An efficient multi-rate LDPC-CC decoder with layered decoding algorithm , 2013, 2013 IEEE International Conference on Communications (ICC).

[16]  Paul H. Siegel,et al.  Adaptive Cut Generation Algorithm for Improved Linear Programming Decoding of Binary Linear Codes , 2011, IEEE Transactions on Information Theory.

[17]  Stark C. Draper,et al.  Hardware based projection onto the parity polytope and probability simplex , 2015, 2015 49th Asilomar Conference on Signals, Systems and Computers.

[18]  Ali Emre Pusane,et al.  Construction of Irregular LDPC Convolutional Codes with Fast Encoding , 2006, 2006 IEEE International Conference on Communications.