Loading [MathJax]/extensions/TeX/mhchem.js
Low-Complexity Chase Decoding of Reed-Solomon Codes Using Module | IEEE Journals & Magazine | IEEE Xplore

Low-Complexity Chase Decoding of Reed-Solomon Codes Using Module


Abstract:

The interpolation based algebraic soft decoding yields a high decoding performance for Reed-Solomon (RS) codes with a polynomial-time complexity. Its computationally expe...Show More

Abstract:

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 Gröbner 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 η unreliable symbols, 2η 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.
Published in: IEEE Transactions on Communications ( Volume: 68, Issue: 10, October 2020)
Page(s): 6012 - 6022
Date of Publication: 27 July 2020

ISSN Information:

Funding Agency:


References

References is not available for this document.