Finite alphabet iterative decoders approaching maximum likelihood performance on the binary symmetric channel

David Declercq, Bane V Vasic, Shiva K. Planjery, Erbao Li

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

4 Citations (Scopus)

Abstract

We introduce a generic approach for improving the guaranteed error correction capability of regular low-density parity check codes. The method relies on operating (in serial or in parallel) a set of finite alphabet iterative decoders. The message passing update rules are judiciously chosen to ensure that decoders have different dynamics on a specific finite-length code. The idea is that for the Binary Symmetric Channel, if some error pattern cannot be corrected by one particular decoder, there exists in the set of decoders, another decoder which can correct this pattern. We show how to select a plurality of message update rules so that the set of decoders can collectively correct error patterns on the dominant trapping sets. We also show that a set of decoders with dynamic re-initializations can approach the performance of maximum likelihood decoding for finite-length regular column-weight three codes.

Original languageEnglish (US)
Title of host publication2012 Information Theory and Applications Workshop, ITA 2012 - Conference Proceedings
Pages23-32
Number of pages10
DOIs
StatePublished - 2012
Event2012 Information Theory and Applications Workshop, ITA 2012 - San Diego, CA, United States
Duration: Feb 5 2012Feb 10 2012

Other

Other2012 Information Theory and Applications Workshop, ITA 2012
CountryUnited States
CitySan Diego, CA
Period2/5/122/10/12

Fingerprint

Maximum likelihood
Message passing
Error correction
Decoding

ASJC Scopus subject areas

  • Computer Science Applications
  • Information Systems

Cite this

Declercq, D., Vasic, B. V., Planjery, S. K., & Li, E. (2012). Finite alphabet iterative decoders approaching maximum likelihood performance on the binary symmetric channel. In 2012 Information Theory and Applications Workshop, ITA 2012 - Conference Proceedings (pp. 23-32). [6181824] https://doi.org/10.1109/ITA.2012.6181824

Finite alphabet iterative decoders approaching maximum likelihood performance on the binary symmetric channel. / Declercq, David; Vasic, Bane V; Planjery, Shiva K.; Li, Erbao.

2012 Information Theory and Applications Workshop, ITA 2012 - Conference Proceedings. 2012. p. 23-32 6181824.

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

Declercq, D, Vasic, BV, Planjery, SK & Li, E 2012, Finite alphabet iterative decoders approaching maximum likelihood performance on the binary symmetric channel. in 2012 Information Theory and Applications Workshop, ITA 2012 - Conference Proceedings., 6181824, pp. 23-32, 2012 Information Theory and Applications Workshop, ITA 2012, San Diego, CA, United States, 2/5/12. https://doi.org/10.1109/ITA.2012.6181824
Declercq D, Vasic BV, Planjery SK, Li E. Finite alphabet iterative decoders approaching maximum likelihood performance on the binary symmetric channel. In 2012 Information Theory and Applications Workshop, ITA 2012 - Conference Proceedings. 2012. p. 23-32. 6181824 https://doi.org/10.1109/ITA.2012.6181824
Declercq, David ; Vasic, Bane V ; Planjery, Shiva K. ; Li, Erbao. / Finite alphabet iterative decoders approaching maximum likelihood performance on the binary symmetric channel. 2012 Information Theory and Applications Workshop, ITA 2012 - Conference Proceedings. 2012. pp. 23-32
@inproceedings{a6bc06cf71974a48818040b5db438945,
title = "Finite alphabet iterative decoders approaching maximum likelihood performance on the binary symmetric channel",
abstract = "We introduce a generic approach for improving the guaranteed error correction capability of regular low-density parity check codes. The method relies on operating (in serial or in parallel) a set of finite alphabet iterative decoders. The message passing update rules are judiciously chosen to ensure that decoders have different dynamics on a specific finite-length code. The idea is that for the Binary Symmetric Channel, if some error pattern cannot be corrected by one particular decoder, there exists in the set of decoders, another decoder which can correct this pattern. We show how to select a plurality of message update rules so that the set of decoders can collectively correct error patterns on the dominant trapping sets. We also show that a set of decoders with dynamic re-initializations can approach the performance of maximum likelihood decoding for finite-length regular column-weight three codes.",
author = "David Declercq and Vasic, {Bane V} and Planjery, {Shiva K.} and Erbao Li",
year = "2012",
doi = "10.1109/ITA.2012.6181824",
language = "English (US)",
isbn = "9781467314725",
pages = "23--32",
booktitle = "2012 Information Theory and Applications Workshop, ITA 2012 - Conference Proceedings",

}

TY - GEN

T1 - Finite alphabet iterative decoders approaching maximum likelihood performance on the binary symmetric channel

AU - Declercq, David

AU - Vasic, Bane V

AU - Planjery, Shiva K.

AU - Li, Erbao

PY - 2012

Y1 - 2012

N2 - We introduce a generic approach for improving the guaranteed error correction capability of regular low-density parity check codes. The method relies on operating (in serial or in parallel) a set of finite alphabet iterative decoders. The message passing update rules are judiciously chosen to ensure that decoders have different dynamics on a specific finite-length code. The idea is that for the Binary Symmetric Channel, if some error pattern cannot be corrected by one particular decoder, there exists in the set of decoders, another decoder which can correct this pattern. We show how to select a plurality of message update rules so that the set of decoders can collectively correct error patterns on the dominant trapping sets. We also show that a set of decoders with dynamic re-initializations can approach the performance of maximum likelihood decoding for finite-length regular column-weight three codes.

AB - We introduce a generic approach for improving the guaranteed error correction capability of regular low-density parity check codes. The method relies on operating (in serial or in parallel) a set of finite alphabet iterative decoders. The message passing update rules are judiciously chosen to ensure that decoders have different dynamics on a specific finite-length code. The idea is that for the Binary Symmetric Channel, if some error pattern cannot be corrected by one particular decoder, there exists in the set of decoders, another decoder which can correct this pattern. We show how to select a plurality of message update rules so that the set of decoders can collectively correct error patterns on the dominant trapping sets. We also show that a set of decoders with dynamic re-initializations can approach the performance of maximum likelihood decoding for finite-length regular column-weight three codes.

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

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

U2 - 10.1109/ITA.2012.6181824

DO - 10.1109/ITA.2012.6181824

M3 - Conference contribution

SN - 9781467314725

SP - 23

EP - 32

BT - 2012 Information Theory and Applications Workshop, ITA 2012 - Conference Proceedings

ER -