Refined Reliability Combining for Binary Message Passing Decoding of Product Codes

Abstract

We propose a novel soft-aided iterative decoding algorithm for product codes (PCs). The proposed algorithm, named iterative bounded distance decoding with combined reliability (iBDD-CR), enhances the conventional iterative bounded distance decoding (iBDD) of PCs by exploiting some level of soft information. In particular, iBDD-CR can be seen as a modification of iBDD where the hard decisions of the row and column decoders are made based on a reliability estimate of the BDD outputs. The reliability estimates are derived using extrinsic message passing for generalized low-density-parity check (GLDPC) ensembles, which encompass PCs. We perform a density evolution analysis of iBDD-CR for transmission over the additive white Gaussian noise channel for the GLDPC ensemble. We consider both binary transmission and bit-interleaved coded modulation with quadrature amplitude modulation.We show that iBDD-CR achieves performance gains up to $0.51$ dB compared to iBDD with the same internal decoder data flow. This makes the algorithm an attractive solution for very high-throughput applications such as fiber-optic communications.

References in corpus (1)

• Binary Message Passing Decoding of Product Codes Based on Generalized Minimum Distance Decoding

Cited by in corpus (6)

• Zipper Codes
• Improved Soft-aided Decoding of Product Codes with Dynamic Reliability Scores
• A Soft-Aided Staircase Decoder Using Three-Level Channel Reliabilities
• Soft-Output Successive Cancellation List Decoding
• Soft-Information Post-Processing for Chase-Pyndiah Decoding Based on Generalized Mutual Information
• Improved Soft-aided Error-and-erasure Decoding of Product Codes with Dynamic Reliability Scores