Low-Density Parity-Check Codes for Nonergodic Block-Fading Channels

abstract

• We design powerful low-density parity-check (LDPC) codes with iterative decoding for the block-fading channel. We first study the case of maximum-likelihood decoding, and show that the design criterion is rather straightforward. Since optimal constructions for maximum-likelihood decoding do not perform well under iterative decoding, we introduce a new family of full-diversity LDPC codes that exhibit near-outage-limit performance under iterative decoding for all block-lengths. This family competes favorably with multiplexed parallel turbo codes for nonergodic channels. 2010 IEEE.

authors

• Boutros, Joseph

published proceedings

• IEEE TRANSACTIONS ON INFORMATION THEORY

altmetric score

• 9

author list (cited authors)

• Boutros, J. J., Guillen i Fabregas, A., Biglieri, E., & Zemor, G.

citation count

• 77

complete list of authors

• Boutros, Joseph Jean||Guillen i Fabregas, Albert||Biglieri, Ezio||Zemor, Gilles

publication date

• September 2010

publisher

• Institute of Electrical and Electronics Engineers (IEEE)  Publisher

published in

• IEEE TRANSACTIONS ON INFORMATION THEORY  Journal

keywords

• Block-fading (bf) Channel
• Iterative Decoding
• Low-density Parity-check (ldpc) Codes
• Maximum-distance Separable (mds) Codes
• Maximum-likelihood (ml) Decoding
• Outage Probability

Digital Object Identifier (DOI)

• 10.1109/TIT.2010.2053890

start page

• 4286

end page

• 4300

volume

• 56

issue

• 9

URL

• http://dx.doi.org/10.1109/tit.2010.2053890