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

Joseph J. Boutros, Albert Guillen i Fabregas, Ezio Biglieri, Gilles Zemor

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.

Knowledge Graph

arrow_drop_up

Comments

Sign up or login to leave a comment