VIA THE ALTERNATING DIRECTION METHOD OF MULTIPLIERS

We detail a field-programmable gate array (FPGA) based implementation of linear programming (LP) decoding. LP decoding frames error correction as an optimization problem. This is in contrast to variants of belief propagation (BP) that view error correction as a problem of graphical inference. LP decoding, when implemented with standard LP solvers, does not easily scale to the blocklengths of modern error-correction codes. This is the main challenge we surmount in this paper. In earlier work we demonstrated how to draw on decomposition methods from optimization theory to build an LP decoding solver competitive with BP, in terms of both performance and speed, but only in double-precision floating point. In this paper we translate the novel computational primitives of our new LP decoding technique into fixed-point. Using our FPGA implementation, we demonstrate that error-rate performance very close to double-precision is possible with 10-bit fixed-point messages.

[1]  Stark C. Draper,et al.  Decomposition methods for large scale LP decoding , 2011, Allerton.

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

[3]  David Burshtein.  Iterative approximate linear programming decoding of LDPC codes with linear complexity , 2009, IEEE Trans. Inf. Theory.

[4]  Stark C. Draper,et al.  Hardware-Based Linear Program Decoding With the Alternating Direction Method of Multipliers , 2016, IEEE Transactions on Signal Processing.

[5]  Shoab Ahmed Khan,et al.  Digital Design of Signal Processing Systems: A Practical Approach , 2011 .

[6]  Paul H. Siegel,et al.  Adaptive Methods for Linear Programming Decoding , 2008, IEEE Transactions on Information Theory.

[7]  Yoram Singer,et al.  Efficient projections onto the l1-ball for learning in high dimensions , 2008, ICML '08.

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

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

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

[11]  Stark C. Draper,et al.  ADMM decoding on trapping sets , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).

[12]  Kenneth E. Batcher,et al.  Sorting networks and their applications , 1968, AFIPS Spring Joint Computing Conference.

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

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

[15]  Stark C. Draper,et al.  Hierarchical and High-Girth QC LDPC Codes , 2011, IEEE Transactions on Information Theory.

[16]  Bertrand Le Gal,et al.  Analysis of ADMM-LP algorithm for LDPC decoding, a first step to hardware implementation , 2015, 2015 IEEE International Conference on Electronics, Circuits, and Systems (ICECS).

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

[18]  Ralf Koetter,et al.  Towards Low-Complexity Linear-Programming Decoding , 2006, ArXiv.

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

[20]  Stark C. Draper,et al.  Instanton search algorithm for the ADMM penalized decoder , 2014, 2014 IEEE International Symposium on Information Theory.

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

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

[23]  Shu Lin,et al.  Low-density parity-check codes based on finite geometries: A rediscovery and new results , 2001, IEEE Trans. Inf. Theory.

[24]  Paul H. Siegel,et al.  Error Floor Approximation for LDPC Codes in the AWGN Channel , 2014, IEEE Trans. Inf. Theory.

[25]  Manabu Hagiwara,et al.  Quasicyclic low-density parity-check codes from circulant permutation matrices , 2009, IEEE Transactions on Information Theory.

[26]  D.E. Hocevar,et al.  A reduced complexity decoder architecture via layered decoding of LDPC codes , 2004, IEEE Workshop onSignal Processing Systems, 2004. SIPS 2004..

[27]  Vikram Arkalgud Chandrasetty,et al.  A multi-level Hierarchical Quasi-Cyclic matrix for implementation of flexible partially-parallel LDPC decoders , 2011, 2011 IEEE International Conference on Multimedia and Expo.