An Iterative Check Polytope Projection Algorithm for ADMM-Based LP Decoding of LDPC Codes

Alternating direction method of multipliers (ADMM) is a popular technique for linear-programming decoding of low-density parity-check codes. The computational complexity of ADMM is dominated by the Euclidean projection of a real-valued vector onto a parity-check polytope. Existing algorithms for such a projection all require sorting operations, which happen to be the most complex part of the projection. In this letter, we propose an iterative algorithm, without sorting operation, for projection onto the parity-check polytope. The proposed algorithm has a worst case complexity linear in the input dimension compared with the super-linear complexity of existing algorithms.

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

[2]  Paul H. Siegel,et al.  Efficient iterative LP decoding of LDPC codes with alternating direction method of multipliers , 2013, 2013 IEEE International Symposium on Information Theory.

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

[4]  Bertrand Le Gal,et al.  Multicore implementation of LDPC decoders based on ADMM algorithm , 2016, 2016 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

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

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

[7]  Xiaopeng Jiao,et al.  Reduced-Complexity Linear Programming Decoding Based on ADMM for LDPC Codes , 2015, IEEE Communications Letters.

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

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

[10]  Yu-Cheng He,et al.  Efficient ADMM Decoding of LDPC Codes Using Lookup Tables , 2017, IEEE Transactions on Communications.

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

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

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