DocumentCode
3345978
Title
Reduced-complexity implementation of algebraic soft-decision decoding of Reed-Solomon codes
Author
Xia, Haitao ; Cruz, J.R.
Author_Institution
Sch. of Electr. & Comput. Eng., Oklahoma Univ., Norman, OK, USA
Volume
5
fYear
2004
fDate
17-21 May 2004
Abstract
A reduced complexity implementation of a soft Chase algorithm for algebraic soft-decision decoding of Reed-Solomon (RS) codes, based on the recently proposed algorithm of Koetter and Vardy, is presented. The reduction in complexity is obtained at the algorithm level by integrating the re-encoding and Chase algorithms and at the architecture level by considering a backup mode which sharply reduces the average computational complexity of the hybrid decoder.
Keywords
Reed-Solomon codes; computational complexity; error correction codes; RS codes; Reed-Solomon codes; algebraic soft-decision decoding; computational complexity reduction; error-correcting codes; hybrid decoder backup mode; re-encoding; soft Chase algorithm; Computational complexity; Computer architecture; Data storage systems; Degradation; Error correction codes; Iterative decoding; Matrix converters; Parity check codes; Reed-Solomon codes; Wireless LAN;
fLanguage
English
Publisher
ieee
Conference_Titel
Acoustics, Speech, and Signal Processing, 2004. Proceedings. (ICASSP '04). IEEE International Conference on
ISSN
1520-6149
Print_ISBN
0-7803-8484-9
Type
conf
DOI
10.1109/ICASSP.2004.1327040
Filename
1327040
Link To Document