Approaching capacity at high rates with iterative hard-decision decoding

@article{Jian2012ApproachingCA,
  title={Approaching capacity at high rates with iterative hard-decision decoding},
  author={Y. Jian and H. Pfister and K. Narayanan},
  journal={2012 IEEE International Symposium on Information Theory Proceedings},
  year={2012},
  pages={2696-2700}
}
  • Y. Jian, H. Pfister, K. Narayanan
  • Published 2012
  • Computer Science, Mathematics
  • 2012 IEEE International Symposium on Information Theory Proceedings
  • A variety of low-density parity-check (LDPC) ensembles have now been observed to approach capacity with message-passing decoding. However, all of them use soft (i.e., non-binary) messages and a posteriori probability (APP) decoding of their component codes. In this paper, we analyze a class of spatially-coupled generalized LDPC codes and observe that, in the high-rate regime, they can approach capacity under iterative hard-decision decoding. These codes can be seen as generalized product codes… CONTINUE READING
    39 Citations

    Tables and Topics from this paper.

    Approaching Capacity at High Rates With Iterative Hard-Decision Decoding
    • 19
    Iterative hard-decision decoding of braided BCH codes for high-speed optical communication
    • 60
    A simple proof of threshold saturation for coupled scalar recursions
    • 81
    • PDF
    A simple proof of threshold saturation for coupled vector recursions
    • 26
    • PDF
    A proof of threshold saturation for spatially-coupled LDPC codes on BMS channels
    • 33
    • PDF
    A Probabilistic Peeling Decoder to Efficiently Analyze Generalized LDPC Codes Over the BEC
    • 2
    • PDF
    State-of-the-Art and Open Problems
    Block Markov Superposition Transmission of BCH Codes With Iterative Erasures-and-Errors Decoders
    • 2
    • PDF

    References

    SHOWING 1-10 OF 61 REFERENCES
    Time-varying periodic convolutional codes with low-density parity-check matrix
    • 626
    On the asymptotic performance of iterative decoders for product codes
    • M. Schwartz, P. Siegel, A. Vardy
    • Computer Science, Mathematics
    • Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.
    • 2005
    • 24
    • PDF
    Generalized low density (Tanner) codes
    • 184
    • PDF
    Iterative hard-decision decoding of braided BCH codes for high-speed optical communication
    • 60
    Analysis of Iterated Hard Decision Decoding of Product Codes with Reed-Solomon Component Codes
    • 30
    • Highly Influential
    • PDF
    On generalized low-density parity-check codes based on Hamming component codes
    • 172
    A simple proof of threshold saturation for coupled scalar recursions
    • 81
    • PDF
    Design of capacity-approaching irregular low-density parity-check codes
    • 3,083
    • PDF
    Braided Block Codes
    • 58
    Generalized LDPC codes and generalized stopping sets
    • 39
    • Highly Influential