Recent advances in iteratively decoded channel codes such as low-density parity-check (LDPC) codes make it possible to operate close to channel capacity limits. The capacity of a coded modulation is therefore a very useful indicator when analyzing the performance of a near infinite-length code under maximum likelihood (ML) decoding. In this work, we analyze the behavior of LDPC codes of moderate lengths using belief propagation (BP) based decoding algorithms. We found that in many cases analyzing the capacity of the coded modulation is not enough to predict which constellation will yield the best error rate performance in a Gaussian noise channel. For the case of M-ary constellations with M=8 and 16 we show how a lower error rate can be achieved by making simple changes to constant envelope phase-shift keying (PSK) constellations. Modifying these constellations translates to an increase in the mean log-likelihood ratio of some of the received bits, resulting in an improvement in performance.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Constellation Design for Improved Iterative LDPC Decoding


    Contributors:


    Publication date :

    2008-03-01


    Size :

    3035287 byte





    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English




    Improved low-altitude constellation design methods

    HANSON, JOHN M. / LINDEN, ALEXANDER N. | AIAA | 1989


    Low-Latency Decoding of EG LDPC Codes

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


    Neural Adjusted Min-Sum Decoding for LDPC Codes

    Yu, Haochen / Zhao, Ming-Min / Lei, Ming et al. | IEEE | 2023


    Polysynchronous Constellation Design

    MCVICKER JOHN M (MICHAEL) / BROWNING PETERSON L / HAWKINS ROBERT A et al. | European Patent Office | 2017

    Free access