2018 · 20 citations · 20 references
EngineeringComputer EngineeringComputer ScienceAlgorithmsDigital CommunicationInformation TheoryCoding TheoryError-correcting CodesFiber OpticsFiber-optic CommunicationOptical Communication SystemsOptical FibersBit Error RateBit-error Rate AnalysisBounded Distance Decoding ProblemComplexityDecoding AlgorithmsDecoding ComplexityIterative DecodingProduct Codes
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 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">-5</sup> . 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.
20
Peter Eliaš · Transactions of the IRE Professional Group on Information Theory · 1954 · 631 citations
Generalized minimum distance decoding
G. David Forney · IEEE Transactions on Information Theory · 1966 · 568 citations
Staircase Codes: FEC for 100 Gb/s OTN
Benjamin P. Smith, Arash Farhood, Andrew J. Hunt et al. · Journal of Lightwave Technology · 2011 · 340 citations · Full text
Engineering, Computer Engineering, Electrical Engineering +14