Low density parity check codes are a popular class of linear block codes for forward error correction in communication channels. Recent years have seen a lot of work towards the hardware-oriented constructions for LDPC codes which have comparable error-correcting performance to random construction codes. This paper proposes a novel method called Iterative-filled (IF) to construct LDPC codes and a new kind of LDPC codes named IF-LDPC codes. Based on the properties of the method proved in this paper, we present a design of regular and quasi-regular IF-LDPC encoders which have linear encoding complexity, simple construction, low memory requirement and are suitable for partly parallel decoding. These advantages make them easy to hardware implementation. The IF-LDPC codes exhibit good performance in computer simulations and some even better than MacKay codes.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Design of Low-Complexity Well-Structured LDPC Codes Based on Iterative-Filled Approach


    Contributors:
    Zhang, Wei (author) / Zhu, Guangxi (author) / Peng, Li (author) / Shen, Qiongxia (author)


    Publication date :

    2008-05-01


    Size :

    671110 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Low-Complexity Concatenated LDPC-Staircase Codes

    Barakatain, M. / Kschischang, F. R. | British Library Online Contents | 2018




    Analysis of 5G LDPC Codes Rate-Matching Design

    Hamidi-Sepehr, Fatemeh / Nimbalker, Ajit / Ermolaev, Gregory | IEEE | 2018


    Full diversity random LDPC codes

    Duyck, D. / Boutros, J. J. / Moeneclaey, M. | IEEE | 2011