Uniformly reweighted APP decoder for memory efficient decoding of LDPC Codes

Velimir Ilic, Elsa Dupraz, David Declercq, Bane V Vasic

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

2 Citations (Scopus)

Abstract

In this paper we propose a uniformly reweighted a posteriori probability (APP) decoder. The APP decoder is well-known to be suboptimal compared to the BP decoder. Here, we derive the APP decoder as an algorithm of approximate Bayesian inference on the LDPC code graph and introduce a correction parameter to overcome the suboptimaly of the APP decoder. We optimize numerically the correction parameter and show that it improves the BER performance of the APP decoder compared to its non-corrected version. In addition, the original APP decoder requires memory that is linear in the number of edges in the code graph. Here, we propose a memory efficient implementation of the algorithm that requires memory that is linear only in the codeword length.

Original languageEnglish (US)
Title of host publication2014 52nd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2014
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages1228-1232
Number of pages5
ISBN (Print)9781479980093
DOIs
StatePublished - Jan 30 2014
Event2014 52nd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2014 - Monticello, United States
Duration: Sep 30 2014Oct 3 2014

Other

Other2014 52nd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2014
CountryUnited States
CityMonticello
Period9/30/1410/3/14

Fingerprint

Decoding
Data storage equipment

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Computer Science Applications

Cite this

Ilic, V., Dupraz, E., Declercq, D., & Vasic, B. V. (2014). Uniformly reweighted APP decoder for memory efficient decoding of LDPC Codes. In 2014 52nd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2014 (pp. 1228-1232). [7028595] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ALLERTON.2014.7028595

Uniformly reweighted APP decoder for memory efficient decoding of LDPC Codes. / Ilic, Velimir; Dupraz, Elsa; Declercq, David; Vasic, Bane V.

2014 52nd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2014. Institute of Electrical and Electronics Engineers Inc., 2014. p. 1228-1232 7028595.

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

Ilic, V, Dupraz, E, Declercq, D & Vasic, BV 2014, Uniformly reweighted APP decoder for memory efficient decoding of LDPC Codes. in 2014 52nd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2014., 7028595, Institute of Electrical and Electronics Engineers Inc., pp. 1228-1232, 2014 52nd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2014, Monticello, United States, 9/30/14. https://doi.org/10.1109/ALLERTON.2014.7028595
Ilic V, Dupraz E, Declercq D, Vasic BV. Uniformly reweighted APP decoder for memory efficient decoding of LDPC Codes. In 2014 52nd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2014. Institute of Electrical and Electronics Engineers Inc. 2014. p. 1228-1232. 7028595 https://doi.org/10.1109/ALLERTON.2014.7028595
Ilic, Velimir ; Dupraz, Elsa ; Declercq, David ; Vasic, Bane V. / Uniformly reweighted APP decoder for memory efficient decoding of LDPC Codes. 2014 52nd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2014. Institute of Electrical and Electronics Engineers Inc., 2014. pp. 1228-1232
@inproceedings{155cc3337188453d9001eef1db8b7456,
title = "Uniformly reweighted APP decoder for memory efficient decoding of LDPC Codes",
abstract = "In this paper we propose a uniformly reweighted a posteriori probability (APP) decoder. The APP decoder is well-known to be suboptimal compared to the BP decoder. Here, we derive the APP decoder as an algorithm of approximate Bayesian inference on the LDPC code graph and introduce a correction parameter to overcome the suboptimaly of the APP decoder. We optimize numerically the correction parameter and show that it improves the BER performance of the APP decoder compared to its non-corrected version. In addition, the original APP decoder requires memory that is linear in the number of edges in the code graph. Here, we propose a memory efficient implementation of the algorithm that requires memory that is linear only in the codeword length.",
author = "Velimir Ilic and Elsa Dupraz and David Declercq and Vasic, {Bane V}",
year = "2014",
month = "1",
day = "30",
doi = "10.1109/ALLERTON.2014.7028595",
language = "English (US)",
isbn = "9781479980093",
pages = "1228--1232",
booktitle = "2014 52nd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2014",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - GEN

T1 - Uniformly reweighted APP decoder for memory efficient decoding of LDPC Codes

AU - Ilic, Velimir

AU - Dupraz, Elsa

AU - Declercq, David

AU - Vasic, Bane V

PY - 2014/1/30

Y1 - 2014/1/30

N2 - In this paper we propose a uniformly reweighted a posteriori probability (APP) decoder. The APP decoder is well-known to be suboptimal compared to the BP decoder. Here, we derive the APP decoder as an algorithm of approximate Bayesian inference on the LDPC code graph and introduce a correction parameter to overcome the suboptimaly of the APP decoder. We optimize numerically the correction parameter and show that it improves the BER performance of the APP decoder compared to its non-corrected version. In addition, the original APP decoder requires memory that is linear in the number of edges in the code graph. Here, we propose a memory efficient implementation of the algorithm that requires memory that is linear only in the codeword length.

AB - In this paper we propose a uniformly reweighted a posteriori probability (APP) decoder. The APP decoder is well-known to be suboptimal compared to the BP decoder. Here, we derive the APP decoder as an algorithm of approximate Bayesian inference on the LDPC code graph and introduce a correction parameter to overcome the suboptimaly of the APP decoder. We optimize numerically the correction parameter and show that it improves the BER performance of the APP decoder compared to its non-corrected version. In addition, the original APP decoder requires memory that is linear in the number of edges in the code graph. Here, we propose a memory efficient implementation of the algorithm that requires memory that is linear only in the codeword length.

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

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

U2 - 10.1109/ALLERTON.2014.7028595

DO - 10.1109/ALLERTON.2014.7028595

M3 - Conference contribution

SN - 9781479980093

SP - 1228

EP - 1232

BT - 2014 52nd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2014

PB - Institute of Electrical and Electronics Engineers Inc.

ER -