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 | |
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