On Low-Complexity Decoding of Product Codes for High-Throughput Fiber-Optic Systems

06/28/2018
by   Alireza Sheikh, et al.
0

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 turbo product decoding (TPD) based on the Chase-Pyndiah algorithm. 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 fiber-optic communications.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset