Evaluation of low-density parity-check codes over block fading channels
- 7 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 3, 1183-1187 vol.3
- https://doi.org/10.1109/icc.2000.853686
Abstract
Richardson, Shokrollahi, Urbanke have proposed irregular low-density parity-check codes (LDPCCs) that outperform, on memoryless channels, the best known turbo-codes. These results have been obtained by allowing the degree of each node (variable or check) of a LDPCC to vary according to some distribution. In this paper we investigate the performance of such new codes over block fading channels (i.e. channels with memory), in terms of bit and codeword error rates adopting the standard decoding algorithm and a modified version which slightly improves performance. Also, a numerical comparison with conventional convolutional codes is carried out. For a code rate 1/2, it results that irregular LDPCCs are convenient only for large codeword size (greater than 500 bits), and that the gain with respect to a constraint length 7 convolutional code decreases considerably with the channel memory.Keywords
This publication has 6 references indexed in Scilit:
- Design of capacity-approaching irregular low-density parity-check codesIEEE Transactions on Information Theory, 2001
- Good error-correcting codes based on very sparse matricesIEEE Transactions on Information Theory, 1999
- Coded diversity on block-fading channelsIEEE Transactions on Information Theory, 1999
- Error probability for block codes over channels with block interferenceIEEE Transactions on Information Theory, 1998
- Channels with block interferenceIEEE Transactions on Information Theory, 1984
- Low-density parity-check codesIEEE Transactions on Information Theory, 1962