New Decoding of Reed-Solomon Codes Based on FFT and Modular Approach

Abstract

Decoding algorithms for Reed--Solomon (RS) codes are of great interest for both practical and theoretical reasons. In this paper, an efficient algorithm, called the modular approach (MA), is devised for solving the Welch--Berlekamp (WB) key equation. By taking the MA as the key equation solver, we propose a new decoding algorithm for systematic RS codes. For $(n,k)$ RS codes, where $n$ is the code length and $k$ is the code dimension, the proposed decoding algorithm has both the best asymptotic computational complexity $O(n\log (n-k)+(n-k){\log }^2(n-k))$ and the smallest constant factor achieved to date. By comparing the number of field operations required, we show that when decoding practical RS codes, the new algorithm is significantly superior to the existing methods in terms of computational complexity. When decoding the $(4096,3584)$ RS code defined over ${\mathbb{F}}_{2^{12}}$, the new algorithm is 10 times faster than a conventional syndrome-based method. Furthermore, the new algorithm has a regular architecture and is thus suitable for hardware implementation.

References in corpus (2)

• Finding roots of polynomials over finite fields
• New Decoding of Reed-Solomon Codes Based on FFT and Modular Approach

Cited by in corpus (1)

• New Decoding of Reed-Solomon Codes Based on FFT and Modular Approach