Iterative Bounded Distance Decoding of Product Codes with Scaled Reliability
Paper in proceedings, 2018

We propose a modified iterative bounded distance decoding of product codes. The proposed algorithm is based on exchanging hard messages iteratively and exploiting channel reliabilities to make hard decisions at each iteration. Performance improvements up to 0.26 dB are achieved.

Author

Alireza Sheikh

Chalmers, Electrical Engineering, Kommunikationssystem, informationsteori och antenner, Communication Systems

Alexandre Graell i Amat

Chalmers, Electrical Engineering, Kommunikationssystem, informationsteori och antenner, Communication Systems

Gianluigi Liva

German Aerospace Center (DLR)

European Conference on Optical Communication (ECOC)

European Conference on Optical Communication (ECOC)
Rome, Italy,

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

Signal Processing

Infrastructure

C3SE (Chalmers Centre for Computational Science and Engineering)

DOI

10.1109/ECOC.2018.8535240

More information

Latest update

12/21/2018