Stall Pattern Avoidance in Polynomial Product Codes
arXiv:1611.04834 · doi:10.1109/GlobalSIP.2016.7905932
Abstract
Product codes are a concatenated error-correction scheme that has been often considered for applications requiring very low bit-error rates, which demand that the error floor be decreased as much as possible. In this work, we consider product codes constructed from polynomial algebraic codes, and propose a novel low-complexity post-processing technique that is able to improve the error-correction performance by orders of magnitude. We provide lower bounds for the error rate achievable under post processing, and present simulation results indicating that these bounds are tight.
arXiv comment4 pages, 2 figures, GlobalSiP 2016
References in corpus (1)
Cited by in corpus (5)
- Improved Decoding of Staircase Codes: The Soft-aided Bit-marking (SABM) Algorithm
- Improved Decoding and Error Floor Analysis of Staircase Codes
- A 9.52 dB NCG FEC scheme and 164 bits/cycle low-complexity product decoder architecture
- Approaching Miscorrection-free Performance of Product and Generalized Product Codes
- Lattice Coding for Downlink Multiuser Transmission