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

Abstract

We solve the problem of designing 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. Unfortunately, optimal constructions for maximum-likelihood decoding do not perform well under iterative decoding. To overcome this limitation, we then 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 with multiplexed parallel turbo codes suitable for nonergodic channels and recently reported in the literature.

Submitted to the IEEE Transactions on Information Theory

References in corpus (1)

• A Tight Lower Bound to the Outage Probability of Discrete-Input Block-Fading Channels

Cited by in corpus (5)

• Low-Density Graph Codes for slow fading Relay Channels
• Finite-Length Analysis of Spatially-Coupled Regular LDPC Ensembles on Burst-Erasure Channels
• Irregular Turbo Codes in Block-Fading Channels
• Low-Complexity Integer-Forcing Methods for Block Fading MIMO Multiple-Access Channels
• Challenges and some new directions in channel coding