Binary Message Passing Decoding of Product Codes Based on Generalized Minimum Distance Decoding: (Invited Paper)
Paper in proceedings, 2019

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 a bit error rate of $10^{-7}$, at the expense of some increase in complexity. The proposed algorithm entails only a limited increase in data flow compared to iBDD.

Author

Alireza Sheikh

Chalmers, Electrical Engineering, Communication and Antenna Systems, Communication Systems

Alexandre Graell i Amat

Chalmers, Electrical Engineering, Communication and Antenna Systems, Communication Systems

Gianluigi Liva

German Aerospace Center (DLR)

53rd Annual Conference on Information Sciences and Systems (CISS). Invited paper

8692862

53rd Annual Conference on Information Sciences and Systems (CISS). Invited paper
Baltimore, MD, USA, USA,

Energy-efficient optical fibre communication

Knut and Alice Wallenberg Foundation, 2014-07-01 -- 2019-06-30.

Areas of Advance

Information and Communication Technology

Subject Categories

Telecommunications

Communication Systems

Infrastructure

C3SE (Chalmers Centre for Computational Science and Engineering)

DOI

10.1109/CISS.2019.8692862

More information

Latest update

9/15/2019