Low-Density Parity-Check Codes for Nonergodic Block-Fading Channels
Information Theory
2016-11-18 v1 math.IT
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.
Cite
@article{arxiv.0710.1182,
title = {Low-Density Parity-Check Codes for Nonergodic Block-Fading Channels},
author = {Joseph J. Boutros and Albert Guillen i Fabregas and Ezio Biglieri and Gilles Zemor},
journal= {arXiv preprint arXiv:0710.1182},
year = {2016}
}
Comments
Submitted to the IEEE Transactions on Information Theory