Authors: Fossorier, Marc P. C.
Mihaljević, Miodrag J. 
Imai, Hideki
Affiliations: Mathematical Institute of the Serbian Academy of Sciences and Arts 
Title: Reduced complexity iterative decoding of low-density parity check codes based on belief propagation
Journal: IEEE Transactions on Communications
Volume: 47
Issue: 5
First page: 673
Last page: 680
Issue Date: 1-Jan-1999
Rank: M21
ISSN: 0090-6778
DOI: 10.1109/26.768759
In this paper, two simplified versions of the belief propagation algorithm for fast iterative decoding of low-density parity check codes on the additive white Gaussian noise channel are proposed. Both versions are implemented with real additions only, which greatly simplifies the decoding complexity of belief propagation in which products of probabilities have to be computed. Also, these two algorithms do not require any knowledge about the channel characteristics. Both algorithms yield a good performance-complexity tradeoff and can be efficiently implemented in software as well as in hardware, with possibly quantized received values.
Keywords: Algorithms | Communication channels (information theory) | Computational complexity | DecodingIterative methods | Spurious signal noise
Publisher: IEEE
Project: Japan Society for the Promotion of Science (JSPS) Postdoctoral Awards for United States Researchers 
National Science Foundation

Show full item record


checked on May 27, 2024

Page view(s)

checked on May 10, 2024

Google ScholarTM




Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.