Iterative Bounded Distance Decoding of Product Codes with Scaled Reliability
Paper in proceeding, 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, Communication, Antennas and Optical Networks
Alexandre Graell i Amat
Chalmers, Electrical Engineering, Communication, Antennas and Optical Networks
Gianluigi Liva
German Aerospace Center (DLR)
European Conference on Optical Communication, ECOC
Vol. 2018-September
978-1-5386-4863-6 (ISBN)
European Conference on Optical Communication (ECOC)
Rome, Italy,
Rome, Italy,
Energy-efficient optical fibre communication
Knut and Alice Wallenberg Foundation (KAW2013.0021), 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