Generalized iteratieve decoding for linear block codes on the binary erasure channel

KAS Abdel-Ghaffar, JH Weber

    Research output: Chapter in Book/Conference proceedings/Edited volumeConference contributionScientificpeer-review


    The generalized iterative decoding concept offers attractive performances versus complexity trade-off oppurtunities in the spectrum between traditional iteratieve decoding and optimal decoding for linear block codes over the binary erasure channel. In each iteration, a system of equations is solved. The maximum number of equations to be solved in one iteration is called the order of the decoder. In case the order is just one, the generalized iterative decoder reduces to the traditional iterative decoder. On the ohter hand, if the order is set to the redundancy of the codes, the generalized iterative decoder gives the same performance as the optimal decoder. Varying the order between these two extremes allows for a better match to the system specifications. In this paper, we consider aspects regarding the implementation of generalized iterative decoding and we determine the minimum order (as a function of the girth) that can potentially lead to improvement over traditional iterative decoding.
    Original languageUndefined/Unknown
    Title of host publicationProceedings of the 2007 IEEE International Symposium on Information Theory
    Editors s.n.
    Place of Publication2007
    PublisherIEEE Society
    Number of pages5
    ISBN (Print)1424414296
    Publication statusPublished - 2007
    Event2007 IEEE International Symposium on Information Theory - Nice
    Duration: 24 Jun 200729 Jun 2007

    Publication series



    Conference2007 IEEE International Symposium on Information Theory


    • conference contrib. refereed
    • Conf.proc. > 3 pag

    Cite this