A New Decoding Method for Reed-Solomon Codes Based on FFT and Modular Approach

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 pro...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on communications Vol. 70; no. 12; p. 1
Main Authors: Tang, Nianqi, Han, Yunghsiang S.
Format: Journal Article
Language:English
Published: New York IEEE 01.12.2022
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
ISSN:0090-6778, 1558-0857
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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 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.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0090-6778
1558-0857
DOI:10.1109/TCOMM.2022.3215998