Low-Density Parity-Check Codes for Nonergodic Block-Fading Channels
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.
low-density parity-check (ldpc) codes iterative decoding block-fading (bf) channel maximum-likelihood (ml) decoding maximum-distance separable (mds) codes outage probability