Toward low LDPC-code floors: a case study
Authors:
- 23 June 2009
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 57 (6) , 1566-1573
Abstract
While LDPC codes have been widely acclaimed in recent years for their near-capacity performance, they have not found their way into many important applications. For some cases, this is due to their increased decoding complexity relative to the classical coding techniques. For other cases, this is due to their inability to reach very low bit error rates (e.g., 10-12) at low signal-to-noise ratios (SNRs), a consequence of the error rate floor phenomenon associated with iterative LDPC decoders. In the present paper, we make strides in the low-floor problem by identifying the weaknesses of the code under study and applying compensatory counter-measures. These counter-measures include: modifying the code itself, modifying the decoder, or adding a properly designed outer algebraic code. Our results demonstrate that each of these techniques can successfully lower an LDPC code's floor, and that, for the code under study, an outer BCH code appears to be particularly effective. All of our results are based on FPGA decoder simulations and so they are reliable and repeatable.Keywords
This publication has 22 references indexed in Scilit:
- GEN03-6: Investigation of Error Floors of Structured Low-Density Parity-Check Codes by Hardware EmulationIEEE Globecom 2006, 2006
- A Performance Improvement and Error Floor Avoidance Technique for Belief Propagation Decoding of LDPC Codes2006
- 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
- Construction of Low-Density Parity-Check Codes by SuperpositionIEEE Transactions on Communications, 2005
- Weaknesses of Margulis and Ramanujan-Margulis Low-Density Parity-Check CodesElectronic Notes in Theoretical Computer Science, 2003
- Design and performance analysis of a high speed AWGN communication channel emulator2002
- Low-density parity-check codes based on finite geometries: a rediscovery and new resultsIEEE Transactions on Information Theory, 2001
- Efficient encoding of low-density parity-check codesIEEE Transactions on Information Theory, 2001
- Good error-correcting codes based on very sparse matricesIEEE Transactions on Information Theory, 1999