Low-Complexity Chase Decoding of Reed-Solomon Codes Using Module
Low-Complexity Chase Decoding of Reed-Solomon Codes Using Module
复制标题
使用模块对 Reed-Solomon 码进行低复杂度 Chase 解码
DOI：
10.1109/tcomm.2020.3011991
复制
发表时间：
2020-10-01
影响因子：
8.3
通讯作者：
Bossert, Martin
中科院分区：
文献类型：
--
作者：
Xing, Jiongyue;Chen, Li;Bossert, Martin
The interpolation based algebraic soft decoding yields a high decoding performance for Reed-Solomon (RS) codes with a polynomial-time complexity. Its computationally expensive interpolation can be facilitated using the module structure. The desired Grobner basis can be achieved by reducing the basis of a module. This paper proposes the low-complexity Chase (LCC) decoding algorithm using this module basis reduction (BR) interpolation technique, namely the LCC-BR algorithm. By identifying eta unreliable symbols, 2(eta) decoding test-vectors will be formulated. The LCC-BR algorithm first constructs a common basis which will be shared by the decoding of all test-vectors. This eliminates the redundant computation in decoding each test-vector, resulting in a lower decoding complexity and latency. This paper further proposes the progressive LCC-BR algorithm that decodes the test-vectors sequentially and terminates once the maximum-likelihood decision decoding outcome is reached. Exploiting the difference between the adjacent test-vectors, this progressive decoding is realized without any additional memory cost. Complexity analysis shows that the LCC-BR algorithm yields a lower complexity and latency, especially for high rate codes, which will be validated by the numerical results.
