Design of LDPC decoders for improved low error rate performance: quantization and algorithm choices
- 20 November 2009
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 57 (11) , 3258-3268
Abstract
Many classes of high-performance low-density parity-check (LDPC) codes are based on parity check matrices composed of permutation submatrices. We describe the design of a parallel-serial decoder architecture that can be used to map any LDPC code with such a structure to a hardware emulation platform. High-throughput emulation allows for the exploration of the low bit-error rate (BER) region and provides statistics of the error traces, which illuminate the causes of the error floors of the (2048, 1723) Reed-Solomon based LDPC (RS-LDPC) code and the (2209, 1978) array-based LDPC code. Two classes of error events are observed: oscillatory behavior and convergence to a class of non-codewords, termed absorbing sets. The influence of absorbing sets can be exacerbated by message quantization and decoder implementation. In particular, quantization and the log-tanh function approximation in sum-product decoders strongly affect which absorbing sets dominate in the errorfloor region. We show that conventional sum-product decoder implementations of the (2209, 1978) array-based LDPC code allow low-weight absorbing sets to have a strong effect, and, as a result, elevate the error floor. Dually-quantized sum-product decoders and approximate sum-product decoders alleviate the effects of low-weight absorbing sets, thereby lowering the error floor.Keywords
This publication has 25 references indexed in Scilit:
- Reduced-Complexity Decoding of LDPC CodesIEEE Transactions on Communications, 2005
- On Implementation of Min-Sum Algorithm and Its Modifications for Decoding Low-Density Parity-Check (LDPC) CodesIEEE Transactions on Communications, 2005
- LDPC Block and Convolutional Codes Based on Circulant MatricesIEEE Transactions on Information Theory, 2004
- A Gaussian noise generator for hardware-based simulationsIEEE Transactions on Computers, 2004
- Iterative decoder architecturesIEEE Communications Magazine, 2003
- Finite-length analysis of low-density parity-check codes on the binary erasure channelIEEE Transactions on Information Theory, 2002
- A 690-mW 1-Gb/s 1024-b, rate-1/2 low-density parity-check code decoderIEEE Journal of Solid-State Circuits, 2002
- Codes on graphs: normal realizationsIEEE Transactions on Information Theory, 2001
- Reduced complexity iterative decoding of low-density parity check codes based on belief propagationIEEE Transactions on Communications, 1999
- Iterative decoding of binary block and convolutional codesIEEE Transactions on Information Theory, 1996