Low complexity FEC scheme based on the intersection of interleaved block codes

Olivier Pothier, Loic Brunel, Joseph Boutros

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

14 Citations (Scopus)

Abstract

We describe a class of asymptotically good codes built from the intersection of randomly permuted binary BCH codes. This family of pseudo-random error correcting codes, called Generalized Low Density (GLD) codes, is a direct generalization of Gallager's Low Density Parity Check (LDPC) codes. GLD codes belong to the larger family of Tanner codes based on a random bipartite graph. We study the GLD ensemble performance and prove the asymptotically good property. We also compare GLD codes minimum distance and performance to the Varshamov-Gilbert bound and BSC capacity respectively. The results show that Maximum-Likelihood decoding of GLD codes achieves near capacity efficiency. The suboptimal iterative decoding of GLD codes is briefly presented. Experimental results of small and large blocklength codes are finally illustrated on both AWGN and Rayleigh fading channels.

Original languageEnglish
Title of host publicationIEEE VTS 50th Vehicular Technology Conference, VTC 1999-Fall
Pages274-278
Number of pages5
Volume1
Publication statusPublished - 1 Jan 1999
Externally publishedYes
EventIEEE VTS 50th Vehicular Technology Conference, VTC 1999-Fall - Houston, TX, USA
Duration: 19 Sep 199922 Sep 1999

Other

OtherIEEE VTS 50th Vehicular Technology Conference, VTC 1999-Fall
CityHouston, TX, USA
Period19/9/9922/9/99

Fingerprint

Iterative decoding
Binary codes
Random errors
Block Codes
Block codes
Rayleigh fading
Fading channels
Low Complexity
Maximum likelihood
Decoding
Intersection
BCH Codes
Iterative Decoding
Low-density Parity-check (LDPC) Codes
Rayleigh Fading Channel
Random Error
Error-correcting Codes
Binary Code
Minimum Distance
Random Graphs

ASJC Scopus subject areas

  • Computer Science Applications
  • Electrical and Electronic Engineering
  • Applied Mathematics

Cite this

Pothier, O., Brunel, L., & Boutros, J. (1999). Low complexity FEC scheme based on the intersection of interleaved block codes. In IEEE VTS 50th Vehicular Technology Conference, VTC 1999-Fall (Vol. 1, pp. 274-278)

Low complexity FEC scheme based on the intersection of interleaved block codes. / Pothier, Olivier; Brunel, Loic; Boutros, Joseph.

IEEE VTS 50th Vehicular Technology Conference, VTC 1999-Fall. Vol. 1 1999. p. 274-278.

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

Pothier, O, Brunel, L & Boutros, J 1999, Low complexity FEC scheme based on the intersection of interleaved block codes. in IEEE VTS 50th Vehicular Technology Conference, VTC 1999-Fall. vol. 1, pp. 274-278, IEEE VTS 50th Vehicular Technology Conference, VTC 1999-Fall, Houston, TX, USA, 19/9/99.
Pothier O, Brunel L, Boutros J. Low complexity FEC scheme based on the intersection of interleaved block codes. In IEEE VTS 50th Vehicular Technology Conference, VTC 1999-Fall. Vol. 1. 1999. p. 274-278
Pothier, Olivier ; Brunel, Loic ; Boutros, Joseph. / Low complexity FEC scheme based on the intersection of interleaved block codes. IEEE VTS 50th Vehicular Technology Conference, VTC 1999-Fall. Vol. 1 1999. pp. 274-278
@inproceedings{4e69ebf055514f59ab894d49351e23fa,
title = "Low complexity FEC scheme based on the intersection of interleaved block codes",
abstract = "We describe a class of asymptotically good codes built from the intersection of randomly permuted binary BCH codes. This family of pseudo-random error correcting codes, called Generalized Low Density (GLD) codes, is a direct generalization of Gallager's Low Density Parity Check (LDPC) codes. GLD codes belong to the larger family of Tanner codes based on a random bipartite graph. We study the GLD ensemble performance and prove the asymptotically good property. We also compare GLD codes minimum distance and performance to the Varshamov-Gilbert bound and BSC capacity respectively. The results show that Maximum-Likelihood decoding of GLD codes achieves near capacity efficiency. The suboptimal iterative decoding of GLD codes is briefly presented. Experimental results of small and large blocklength codes are finally illustrated on both AWGN and Rayleigh fading channels.",
author = "Olivier Pothier and Loic Brunel and Joseph Boutros",
year = "1999",
month = "1",
day = "1",
language = "English",
isbn = "0780354354",
volume = "1",
pages = "274--278",
booktitle = "IEEE VTS 50th Vehicular Technology Conference, VTC 1999-Fall",

}

TY - GEN

T1 - Low complexity FEC scheme based on the intersection of interleaved block codes

AU - Pothier, Olivier

AU - Brunel, Loic

AU - Boutros, Joseph

PY - 1999/1/1

Y1 - 1999/1/1

N2 - We describe a class of asymptotically good codes built from the intersection of randomly permuted binary BCH codes. This family of pseudo-random error correcting codes, called Generalized Low Density (GLD) codes, is a direct generalization of Gallager's Low Density Parity Check (LDPC) codes. GLD codes belong to the larger family of Tanner codes based on a random bipartite graph. We study the GLD ensemble performance and prove the asymptotically good property. We also compare GLD codes minimum distance and performance to the Varshamov-Gilbert bound and BSC capacity respectively. The results show that Maximum-Likelihood decoding of GLD codes achieves near capacity efficiency. The suboptimal iterative decoding of GLD codes is briefly presented. Experimental results of small and large blocklength codes are finally illustrated on both AWGN and Rayleigh fading channels.

AB - We describe a class of asymptotically good codes built from the intersection of randomly permuted binary BCH codes. This family of pseudo-random error correcting codes, called Generalized Low Density (GLD) codes, is a direct generalization of Gallager's Low Density Parity Check (LDPC) codes. GLD codes belong to the larger family of Tanner codes based on a random bipartite graph. We study the GLD ensemble performance and prove the asymptotically good property. We also compare GLD codes minimum distance and performance to the Varshamov-Gilbert bound and BSC capacity respectively. The results show that Maximum-Likelihood decoding of GLD codes achieves near capacity efficiency. The suboptimal iterative decoding of GLD codes is briefly presented. Experimental results of small and large blocklength codes are finally illustrated on both AWGN and Rayleigh fading channels.

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

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

M3 - Conference contribution

SN - 0780354354

VL - 1

SP - 274

EP - 278

BT - IEEE VTS 50th Vehicular Technology Conference, VTC 1999-Fall

ER -