Performance Bounds and Estimates for Quantized LDPC Decoders
Preprint
Abstract
The performance of low-density parity-check (LDPC) codes at high signal-to-noise ratios (SNRs) is known to be limited by the presence of certain sub-graphs that exist in the Tanner graph representation of the code, for example trapping sets and absorbing sets. This paper derives a lower bound on the frame error rate (FER) of any LDPC code containing a given problematic sub-graph, assuming a particular message passing decoder and decoder quantization. A crucial aspect of the lower bound is that it is code-independent, in the sense that it can be derived based only on a problematic sub-graph and then applied to any code containing it. Due to the complexity of evaluating the exact bound, assumptions are proposed to approximate it, from which we can estimate decoder performance. Simulated results obtained for both the quantized sum-product algorithm (SPA) and the quantized min-sum algorithm (MSA) are shown to be consistent with the approximate bound and the corresponding performance estimates. Different classes of LDPC codes, including both structured and randomly constructed codes, are used to demonstrate the robustness of the approach.Keywords
All Related Versions
This publication has 19 references indexed in Scilit:
- Quantized Iterative Message Passing Decoders with Low Error Floor for LDPC CodesIEEE Transactions on Communications, 2013
- Controlling the Error Floor in LDPC DecodingIEEE Transactions on Communications, 2013
- Error Rate Estimation of Low-Density Parity-Check Codes Decoded by Quantized Soft-Decision Iterative AlgorithmsIEEE Transactions on Communications, 2013
- Finding the Exhaustive List of Small Fully Absorbing Sets and Designing the Corresponding Low Error-Floor DecoderIEEE Transactions on Communications, 2012
- On the Number of Minimum Stopping Sets and Minimum Codewords of Array LDPC CodesIEEE Communications Letters, 2010
- Design of LDPC decoders for improved low error rate performance: quantization and algorithm choicesIEEE Transactions on Communications, 2009
- Predicting error floors of structured LDPC codes: deterministic bounds and estimatesIEEE Journal on Selected Areas in Communications, 2009
- Toward low LDPC-code floors: a case studyIEEE Transactions on Communications, 2009
- Weaknesses of Margulis and Ramanujan-Margulis Low-Density Parity-Check CodesElectronic Notes in Theoretical Computer Science, 2003
- Low-density parity-check codes based on finite geometries: a rediscovery and new resultsIEEE Transactions on Information Theory, 2001