Uniformly reweighted APP decoder for memory efficient decoding of LDPC Codes

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

doi:10.1109/ALLERTON.2014.7028595

Uniformly reweighted APP decoder for memory efficient decoding of LDPC Codes

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

Electrical and Computer Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

2 Scopus citations

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 language	English (US)
Title of host publication	2014 52nd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2014
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	1228-1232
Number of pages	5
ISBN (Print)	9781479980093
DOIs	https://doi.org/10.1109/ALLERTON.2014.7028595
State	Published - Jan 30 2014
Event	2014 52nd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2014 - Monticello, United States Duration: Sep 30 2014 → Oct 3 2014

Other

Other	2014 52nd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2014
Country	United States
City	Monticello
Period	9/30/14 → 10/3/14

ASJC Scopus subject areas

Computer Networks and Communications
Computer Science Applications

Access to Document

10.1109/ALLERTON.2014.7028595

Fingerprint Dive into the research topics of 'Uniformly reweighted APP decoder for memory efficient decoding of LDPC Codes'. Together they form a unique fingerprint.

Cite this

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 proceeding › Conference 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

@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 = jan,

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.",

note = "2014 52nd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2014 ; Conference date: 30-09-2014 Through 03-10-2014",

}

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

AN - SCOPUS:84946685314

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.

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

Y2 - 30 September 2014 through 3 October 2014

ER -