Generalized low-density codes with BCH constituents for full-diversity near-outage performance

Joseph Boutros, Gilles Zémor, Albert Guillén Albert, Ezio Biglieri

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

A new graph-based construction of generalized low density codes (GLD-Tanner) with binary BCH constituents is described. The proposed family of GLD codes is optimal on block erasure channels and quasi-optimal on block fading channels. Optimality is considered in the outage probability sense. A classical GLD code for ergodic channels (e.g., the AWGN channel, the i.i.d. Rayleigh fading channel, and the i.i.d. binary erasure channel) is built by connecting bitnodes and subcode nodes via a unique random edge permutation. In the proposed construction of full-diversity GLD codes (referred to as root GLD), bitnodes are divided into 4 classes, subcodes are divided into 2 classes, and finally both sides of the Tanner graph are linked via 4 random edge permutations. The study focuses on non-ergodic channels with two states and can be easily extended to channels with 3 states or more.

Original languageEnglish
Title of host publicationProceedings - 2008 IEEE International Symposium on Information Theory, ISIT 2008
Pages787-791
Number of pages5
DOIs
Publication statusPublished - 29 Sep 2008
Event2008 IEEE International Symposium on Information Theory, ISIT 2008 - Toronto, ON, Canada
Duration: 6 Jul 200811 Jul 2008

Other

Other2008 IEEE International Symposium on Information Theory, ISIT 2008
CountryCanada
CityToronto, ON
Period6/7/0811/7/08

Fingerprint

Outages
Fading channels
Rayleigh fading
Permutation
Binary
Rayleigh Fading Channel
Outage Probability
Graph in graph theory
Fading Channels
Optimality
Roots
Vertex of a graph
Class

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Modelling and Simulation
  • Applied Mathematics

Cite this

Boutros, J., Zémor, G., Albert, A. G., & Biglieri, E. (2008). Generalized low-density codes with BCH constituents for full-diversity near-outage performance. In Proceedings - 2008 IEEE International Symposium on Information Theory, ISIT 2008 (pp. 787-791). [4595094] https://doi.org/10.1109/ISIT.2008.4595094

Generalized low-density codes with BCH constituents for full-diversity near-outage performance. / Boutros, Joseph; Zémor, Gilles; Albert, Albert Guillén; Biglieri, Ezio.

Proceedings - 2008 IEEE International Symposium on Information Theory, ISIT 2008. 2008. p. 787-791 4595094.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Boutros, J, Zémor, G, Albert, AG & Biglieri, E 2008, Generalized low-density codes with BCH constituents for full-diversity near-outage performance. in Proceedings - 2008 IEEE International Symposium on Information Theory, ISIT 2008., 4595094, pp. 787-791, 2008 IEEE International Symposium on Information Theory, ISIT 2008, Toronto, ON, Canada, 6/7/08. https://doi.org/10.1109/ISIT.2008.4595094
Boutros J, Zémor G, Albert AG, Biglieri E. Generalized low-density codes with BCH constituents for full-diversity near-outage performance. In Proceedings - 2008 IEEE International Symposium on Information Theory, ISIT 2008. 2008. p. 787-791. 4595094 https://doi.org/10.1109/ISIT.2008.4595094
Boutros, Joseph ; Zémor, Gilles ; Albert, Albert Guillén ; Biglieri, Ezio. / Generalized low-density codes with BCH constituents for full-diversity near-outage performance. Proceedings - 2008 IEEE International Symposium on Information Theory, ISIT 2008. 2008. pp. 787-791
@inproceedings{cf12fb099ab74c58adef64937907c089,
title = "Generalized low-density codes with BCH constituents for full-diversity near-outage performance",
abstract = "A new graph-based construction of generalized low density codes (GLD-Tanner) with binary BCH constituents is described. The proposed family of GLD codes is optimal on block erasure channels and quasi-optimal on block fading channels. Optimality is considered in the outage probability sense. A classical GLD code for ergodic channels (e.g., the AWGN channel, the i.i.d. Rayleigh fading channel, and the i.i.d. binary erasure channel) is built by connecting bitnodes and subcode nodes via a unique random edge permutation. In the proposed construction of full-diversity GLD codes (referred to as root GLD), bitnodes are divided into 4 classes, subcodes are divided into 2 classes, and finally both sides of the Tanner graph are linked via 4 random edge permutations. The study focuses on non-ergodic channels with two states and can be easily extended to channels with 3 states or more.",
author = "Joseph Boutros and Gilles Z{\'e}mor and Albert, {Albert Guill{\'e}n} and Ezio Biglieri",
year = "2008",
month = "9",
day = "29",
doi = "10.1109/ISIT.2008.4595094",
language = "English",
isbn = "9781424422579",
pages = "787--791",
booktitle = "Proceedings - 2008 IEEE International Symposium on Information Theory, ISIT 2008",

}

TY - GEN

T1 - Generalized low-density codes with BCH constituents for full-diversity near-outage performance

AU - Boutros, Joseph

AU - Zémor, Gilles

AU - Albert, Albert Guillén

AU - Biglieri, Ezio

PY - 2008/9/29

Y1 - 2008/9/29

N2 - A new graph-based construction of generalized low density codes (GLD-Tanner) with binary BCH constituents is described. The proposed family of GLD codes is optimal on block erasure channels and quasi-optimal on block fading channels. Optimality is considered in the outage probability sense. A classical GLD code for ergodic channels (e.g., the AWGN channel, the i.i.d. Rayleigh fading channel, and the i.i.d. binary erasure channel) is built by connecting bitnodes and subcode nodes via a unique random edge permutation. In the proposed construction of full-diversity GLD codes (referred to as root GLD), bitnodes are divided into 4 classes, subcodes are divided into 2 classes, and finally both sides of the Tanner graph are linked via 4 random edge permutations. The study focuses on non-ergodic channels with two states and can be easily extended to channels with 3 states or more.

AB - A new graph-based construction of generalized low density codes (GLD-Tanner) with binary BCH constituents is described. The proposed family of GLD codes is optimal on block erasure channels and quasi-optimal on block fading channels. Optimality is considered in the outage probability sense. A classical GLD code for ergodic channels (e.g., the AWGN channel, the i.i.d. Rayleigh fading channel, and the i.i.d. binary erasure channel) is built by connecting bitnodes and subcode nodes via a unique random edge permutation. In the proposed construction of full-diversity GLD codes (referred to as root GLD), bitnodes are divided into 4 classes, subcodes are divided into 2 classes, and finally both sides of the Tanner graph are linked via 4 random edge permutations. The study focuses on non-ergodic channels with two states and can be easily extended to channels with 3 states or more.

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

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

U2 - 10.1109/ISIT.2008.4595094

DO - 10.1109/ISIT.2008.4595094

M3 - Conference contribution

SN - 9781424422579

SP - 787

EP - 791

BT - Proceedings - 2008 IEEE International Symposium on Information Theory, ISIT 2008

ER -