BOUTROS, Joseph; ZÉMOR, Gilles; GUILLEN I FABREGAS, Albert; BIGLIERI, Ezio

doi:10.1109/ISIT.2008.4595094

Métadonnées

Afficher la notice complète

Licence d’utilisation du document

BOUTROS, Joseph
Texas A&M University System

ZÉMOR, Gilles
Institut de Mathématiques de Bordeaux [IMB]

GUILLEN I FABREGAS, Albert
Dept. of Engineering, university of Cambridge

Langue

Communication dans un congrès

Ce document a été publié dans

IEEE International Symposium on Information Theory 2008, ISIT 2008, IEEE International Symposium on Information Theory 2008, ISIT 2008, IEEE International Symposium on Information Theory 2008, ISIT 2008, 2008-07, Toronto. 2008-07p. 787-791

Résumé en anglais

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.< Réduire

Métadonnées

Partager cette publication !

Licence d’utilisation du document

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

Langue

Ce document a été publié dans

Résumé en anglais

URI

DOI

Origine

Unités de recherche