Decoding algorithm complexity influences the application of low-density parity-check (LDPC) codes. This article investigated the Belief-Propagation and improved decode algorithms for a subclass of binary LDPC that can be encoded linearly. Through the comparison of decoding performance, a low complexity one with good performance is preferred. It is shown that the incorporation of LDPC coding techniques into Digital Subscriber Line (DSL) systems appears to be possible.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Research of Low-Density Parity-Check Decode Algorithms for Digital Subscriber Lines


    Contributors:
    Xiang, Xing-Yu (author) / Xie, Jun (author)


    Publication date :

    2008-05-01


    Size :

    836466 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English





    Generalized Low-Density Parity-Check Codes for Optical Communication Systems

    Djordjevic, I. B. / Milenkovic, O. / Vasic, B. | British Library Online Contents | 2005



    Implementing Low-Density Parity-Check Codes in the Mars Relay Network

    Chamberlain, Neil / Allen, Steve / Andrews, Kenneth et al. | IEEE | 2022