On Low-Complexity Decoding of Product Codes for High-Throughput Fiber-Optic Systems
Paper in proceeding, 2018

We study low-complexity iterative decoding algorithms for product codes. We revisit two algorithms recently proposed by the authors based on bounded distance decoding (BDD) of the component codes that improve the performance of conventional iterative BDD (iBDD). We then propose a novel decoding algorithm that is based on generalized minimum distance decoding of the component codes. The proposed algorithm closes over 50% of the performance gap between iBDD and turbo product decoding (TPD) based on the Chase-Pyndiah algorithm at a bit error rate of 10^-5. Moreover, the algorithm only leads to a limited increase in complexity with respect to iBDD and has significantly lower complexity than TPD. The studied algorithms are particularly interesting for high-throughput fiberoptic communications.

fiber-optic communications

product codes

bounded distance decoding

soft-aided decoders

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)

Christian Häger

Chalmers, Electrical Engineering, Communication, Antennas and Optical Networks

Henry D. Pfister

Duke University

International Symposium on Turbo Codes and Iterative Information Processing, ISTC

21654700 (ISSN) 21654719 (eISSN)

Vol. 2018-December 8625279

IEEE International Symposium on Turbo Codes & Iterative Information Processing (ISTC)
Hong Kong, Hong Kong,

Energy-efficient optical fibre communication

Knut and Alice Wallenberg Foundation (KAW2013.0021), 2014-07-01 -- 2019-06-30.

Coding for terabit-per-second fiber-optical communications (TERA)

European Commission (EC) (EC/H2020/749798), 2017-01-01 -- 2019-12-31.

Areas of Advance

Information and Communication Technology

Subject Categories

Telecommunications

Communication Systems

Embedded Systems

DOI

10.1109/ISTC.2018.8625279

More information

Latest update

7/17/2024