DocumentCode
934848
Title
A Simplified Step-by-Step Decoding Algorithm for Parallel Decoding of Reed–Solomon Codes
Author
Liu, Xiaobei ; Lu, Chao ; Cheng, Tee Hiang ; Koh, Soo Ngee
Author_Institution
Nanyang Technol. Univ.
Volume
55
Issue
6
fYear
2007
fDate
6/1/2007 12:00:00 AM
Firstpage
1103
Lastpage
1109
Abstract
A simplified parallel step-by-step decoding algorithm is proposed for decoding Reed-Solomon (RS) codes. It uses new method to calculate the determinants of the temporarily changed syndrome matrices, based on the property of these matrices determined in this paper. By using the proposed method, the calculations of the determinants of the temporarily changed syndrome matrices become much simpler and thus the computational complexity of the step-by-step decoding algorithm is significantly reduced.
Keywords
Reed-Solomon codes; computational complexity; decoding; Reed-Solomon codes; computational complexity; parallel decoding; step-by-step decoding algorithm; temporarily changed syndrome matrices; Chaotic communication; Communications Society; Computational complexity; Decoding; Delay; Error correction codes; Galois fields; Polynomials; Signal processing; Testing;
fLanguage
English
Journal_Title
Communications, IEEE Transactions on
Publisher
ieee
ISSN
0090-6778
Type
jour
DOI
10.1109/TCOMM.2007.898703
Filename
4237464
Link To Document