Partially Parallel Low-Complexity Chase Decoding of Reed-Solomon Codes
Jiwei Liang, Lijia Yang, Li Chen · 2022 IEEE Globecom Workshops (GC Wkshps) · 2022
This paper proposes the partially parallel low-complexity Chase (PPLCC) decoding for Reed-Solomon (RS) codes. With the formulated test-vectors, the Kötter’s interpolation based Chase decoding events are processed in a partially parallel manner, maintaining both low decoding complexity and latency. The decoding will be terminated once a codeword candidate that satisfies the maximum-likelihood (ML) criterion is found. Furthermore, a skipping rule is introduced to reduce the decoding complexity by assessing the Hamming distance between an estimated codeword and the test-vector. Simulation results show that the proposed PPLCC decoding achieves an improved tradeoff between decoding complexity and latency over several benchmark decoding schemes.