Code-aware quantizer design for finite-precision min-sum decoders

Classically, the quantization of the soft information supplied to a finite-precision decoder is chosen to optimize a certain criterion which does not depend on the characteristics of the existing code. This work studies code-aware quantizers, for finite-precision min-sum decoders, which optimize the noise threshold of the existing family of Low-Density Parity-Check (LDPC) codes. We propose a code-aware quantizer with lower complexity than that obtained by optimizing all decision levels and approaching its performance, for few quantization bits. We show that code-aware quantizers outperform code-independent quantizers in terms of noise threshold for both regular and irregular LDPC codes. To overcome the error floor behavior of LDPC codes, we propose the design of the quantizer for a target error probability at the decoder output. The results show that the quantizer optimized to get a zero error probability could lead to a very bad performance for practical range of signal to noise ratios. Finally, we propose to design jointly irregular LDPC codes and code-aware quantizers for finite-precision min-sum decoders. We show that they achieve significant decoding gains with respect to LDPC codes designed for infinite-precision belief propagation decoding, but decoded by finite-precision min-sum.

[1]  T. Richardson,et al.  Multi-Edge Type LDPC Codes , 2004 .

[2]  Gerald Matz,et al.  Quantization for soft-output demodulators in bit-interleaved coded modulation systems , 2009, 2009 IEEE International Symposium on Information Theory.

[3]  Wonyong Sung,et al.  Optimal Output Quantization of Binary Input AWGN Channel for Belief-Propagation Decoding of LDPC Codes , 2012, 2012 IEEE Workshop on Signal Processing Systems.

[4]  Evangelos Eleftheriou,et al.  Regular and irregular progressive edge-growth tanner graphs , 2005, IEEE Transactions on Information Theory.

[5]  Rüdiger L. Urbanke,et al.  Design of capacity-approaching irregular low-density parity-check codes , 2001, IEEE Trans. Inf. Theory.

[6]  David Declercq,et al.  Min-Sum-based decoders running on noisy hardware , 2013, 2013 IEEE Global Communications Conference (GLOBECOM).

[7]  Thomas J. Richardson,et al.  Error Floors of LDPC Codes , 2003 .

[8]  Lara Dolecek,et al.  GEN03-6: Investigation of Error Floors of Structured Low-Density Parity-Check Codes by Hardware Emulation , 2006, IEEE Globecom 2006.

[9]  Alexios Balatsoukas-Stimming,et al.  FPGA-based design and implementation of a multi-GBPS LDPC decoder , 2012, 22nd International Conference on Field Programmable Logic and Applications (FPL).

[10]  Lav R. Varshney,et al.  Performance of LDPC Codes Under Faulty Iterative Decoding , 2008, IEEE Transactions on Information Theory.

[11]  Costas N. Georghiades,et al.  On quantization of low-density parity-check coded channel measurements , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).

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