The block fading (BF) channel is a useful model for various communication systems in urban environments. Full-diversity error-correcting codes are required to approach the physical limits of the performance on BF channels. Low-density parity-check (LDPC) codes are good error-correcting codes, but full-diversity standard random LDPC codes for the BF channel are not known yet. We design full-diversity random LDPC ensembles at infinite block length by optimizing the threshold in multiple points in the fading space, which takes into account the randomness of the fading. However, this is not sufficient to achieve full-diversity at finite block length, because of stopping sets. We therefore propose a method to generate full-diversity code instances at finite length so that stopping sets over information bits are avoided. The asymptotic and finite length word error rate performance is verified by means of density evolution and Monte Carlo simulations, respectively, confirming that full-diversity standard random LDPC codes exist and perform well.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Full diversity random LDPC codes


    Contributors:
    Duyck, D. (author) / Boutros, J. J. (author) / Moeneclaey, M. (author)


    Publication date :

    2011-11-01


    Size :

    173074 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


    Lower Error Floors for NASA LDPC Codes

    Hamkins, Jon | NTRS | 2011


    Low-Latency Decoding of EG LDPC Codes

    Zhang, J. / Yedidia, J. S. / Fossorier, M. | British Library Online Contents | 2007


    Quasi-Cyclic LDPC Codes for Short Block-Lengths

    Danish, Muhammad Nauman / Pasha, Syed Ahmed / Hashmi, Ali Javed | IEEE | 2021