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

Abstract

We propose a binary message passing decoding algorithm for product codes based on generalized minimum distance decoding (GMDD) of the component codes, where the last stage of the GMDD makes a decision based on the Hamming distance metric. The proposed algorithm closes half of the gap between conventional iterative bounded distance decoding (iBDD) and turbo product decoding based on the Chase--Pyndiah algorithm, at the expense of some increase in complexity. Furthermore, the proposed algorithm entails only a limited increase in data flow compared to iBDD.

Invited paper to the 53rd Annual Conference on Information Sciences and Systems (CISS), Baltimore, MD, March 2019. arXiv admin note: text overlap with arXiv:1806.10903

References in corpus (3)

• Staircase Codes: FEC for 100 Gb/s OTN
• Analysis and Design of Binary Message-Passing Decoders
• Decoding Staircase Codes with Marked Bits

Cited by in corpus (5)

• Refined Reliability Combining for Binary Message Passing Decoding of Product Codes
• Improved Soft-aided Decoding of Product Codes with Dynamic Reliability Scores
• On Product Codes with Probabilistic Amplitude Shaping for High-Throughput Fiber-Optic Systems
• On Parameter Optimization and Reach Enhancement for the Improved Soft-Aided Staircase Decoder
• Coding for Optical Communications -- Can We Approach the Shannon Limit With Low Complexity?