IDEAS home Printed from https://ideas.repec.org/a/eee/phsmap/v302y2001i1p35-43.html
   My bibliography  Save this article

Iterative decoding of LDPC codes: some bounds and properties

Author

Listed:
  • Burshtein, David
  • Miller, Gadi

Abstract

We consider iterative message passing algorithms for decoding low-density parity-check codes, when applied to an arbitrary binary-input symmetric-output channel, and review some bounds and properties of these algorithms that we recently derived. We show that expander graph arguments may be used to prove that message passing algorithms can correct a linear number of erroneous messages. The implication of this result is that when the block length is sufficiently large, once a message passing algorithm has corrected a sufficiently large fraction of the errors, it will eventually correct all errors. The results hold for various message passing algorithms, including Gallager's hard decision and soft decision (with clipping) decoding algorithms. We also discuss some other properties of the iterative algorithm, such as the gap between maximum likelihood and iterative decoding as the connectivity of the parity-check matrix increases.

Suggested Citation

  • Burshtein, David & Miller, Gadi, 2001. "Iterative decoding of LDPC codes: some bounds and properties," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 302(1), pages 35-43.
    • Handle: RePEc:eee:phsmap:v:302:y:2001:i:1:p:35-43
    DOI: 10.1016/S0378-4371(01)00438-1
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437101004381
    Download Restriction: Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000
    File URL: https://libkey.io/10.1016/S0378-4371(01)00438-1?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:phsmap:v:302:y:2001:i:1:p:35-43. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/physica-a-statistical-mechpplications/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.