Paper Info
Title
Binary Message Passing Decoding of Product-Like Codes
Abstract
We propose a novel binary message passing decoding algorithm for product-like codes based on bounded distance decoding (BDD) of the component codes. The algorithm, dubbed iterative BDD with scaled reliability (iBDD-SR), exploits the channel reliabilities and is therefore soft in nature. However, the messages exchanged by the component decoders are binary (hard) messages, which significantly reduces the decoder data flow. The exchanged binary messages are obtained by combining the channel reliability with the BDD decoder output reliabilities, properly conveyed by a scaling factor applied to the BDD decisions. We perform a density evolution analysis for generalized low-density parity-check (GLDPC) code ensembles and spatially coupled GLDPC code ensembles, from which the scaling factors of the iBDD-SR for product and staircase codes, respectively, can be obtained. For the white additive Gaussian noise channel, we show performance gains up to $0.29$ dB and $0.31$ dB for product and staircase codes compared to conventional iterative BDD (iBDD) with the same decoder data flow. Furthermore, we show that iBDD-SR approaches the performance of ideal iBDD that prevents miscorrections.
Year
DOI
Venue
2019
10.1109/TCOMM.2019.2940180
IEEE Transactions on Communications
Keywords
DocType
Volume
Decoding,Iterative decoding,Reliability,Complexity theory,Encoding,Message passing
Journal
67
Issue
ISSN
Citations 
12
0090-6778
3
PageRank 
References 
Authors
0.39
0
3
Name
Order
Citations
PageRank
Alireza Sheikh1144.05
Amat Alexandre Graell i245665.56
Gianluigi Liva386175.40