Low-density parity-check codes for nonergodic block-fading channels

Joseph Boutros, Albert Guillén I Fàbregas, Ezio Biglieri, Gilles Zémor

Research output: Contribution to journalArticle

69 Citations (Scopus)

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.

Original languageEnglish
Article number5550477
Pages (from-to)4286-4300
Number of pages15
JournalIEEE Transactions on Information Theory
Volume56
Issue number9
DOIs
Publication statusPublished - 1 Sep 2010

Fingerprint

Iterative decoding
Fading channels
Maximum likelihood
Decoding
Turbo codes
Outages
performance

Keywords

  • Block-fading (BF) channel
  • iterative decoding
  • low-density parity-check (LDPC) codes
  • maximum-distance separable (MDS) codes
  • maximum-likelihood (ML) decoding
  • outage probability

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences

Cite this

Low-density parity-check codes for nonergodic block-fading channels. / Boutros, Joseph; Guillén I Fàbregas, Albert; Biglieri, Ezio; Zémor, Gilles.

In: IEEE Transactions on Information Theory, Vol. 56, No. 9, 5550477, 01.09.2010, p. 4286-4300.

Research output: Contribution to journalArticle

Boutros, Joseph ; Guillén I Fàbregas, Albert ; Biglieri, Ezio ; Zémor, Gilles. / Low-density parity-check codes for nonergodic block-fading channels. In: IEEE Transactions on Information Theory. 2010 ; Vol. 56, No. 9. pp. 4286-4300.
@article{93784b6ebe0f42279a3d4b90d7bbcd9c,
title = "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.",
keywords = "Block-fading (BF) channel, iterative decoding, low-density parity-check (LDPC) codes, maximum-distance separable (MDS) codes, maximum-likelihood (ML) decoding, outage probability",
author = "Joseph Boutros and {Guill{\'e}n I F{\`a}bregas}, Albert and Ezio Biglieri and Gilles Z{\'e}mor",
year = "2010",
month = "9",
day = "1",
doi = "10.1109/TIT.2010.2053890",
language = "English",
volume = "56",
pages = "4286--4300",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "9",

}

TY - JOUR

T1 - Low-density parity-check codes for nonergodic block-fading channels

AU - Boutros, Joseph

AU - Guillén I Fàbregas, Albert

AU - Biglieri, Ezio

AU - Zémor, Gilles

PY - 2010/9/1

Y1 - 2010/9/1

N2 - 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.

AB - 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.

KW - Block-fading (BF) channel

KW - iterative decoding

KW - low-density parity-check (LDPC) codes

KW - maximum-distance separable (MDS) codes

KW - maximum-likelihood (ML) decoding

KW - outage probability

UR - http://www.scopus.com/inward/record.url?scp=77955748100&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77955748100&partnerID=8YFLogxK

U2 - 10.1109/TIT.2010.2053890

DO - 10.1109/TIT.2010.2053890

M3 - Article

AN - SCOPUS:77955748100

VL - 56

SP - 4286

EP - 4300

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 9

M1 - 5550477

ER -