DocumentCode :
805058
Title :
FFT-based fast Reed-Solomon codes with arbitrary block lengths and rates
Author :
Dianat, R. ; Marvasti, F.
Author_Institution :
Electr. Dept., Sharif Univ. of Technol., Tehran, Iran
Volume :
152
Issue :
2
fYear :
2005
fDate :
4/8/2005 12:00:00 AM
Firstpage :
151
Lastpage :
156
Abstract :
By puncturing Reed-Solomon codes with the block lengths of 2m, it is possible to design systematic and nonsystematic codes with arbitrary block lengths and rates that can be decoded using FFT. Because Reed-Solomon (RS) codes are maximum distance separable (MDS), the resultant codes keep this property as well. The codes are constructed over prime fields as opposed to the conventional practice of extension fields, and hence additions and multiplications are simple mod operations and there is no need to use polynomials and look-up tables.
Keywords :
Reed-Solomon codes; decoding; error correction codes; fast Fourier transforms; transform coding; FFT-based Reed-Solomon codes; addition; arbitrary block lengths; arbitrary rates; decoding; error correction codes; extension fields; fast Reed-Solomon codes; look-up tables; maximum distance separable codes; multiplication; polynomials; prime fields;
fLanguage :
English
Journal_Title :
Communications, IEE Proceedings-
Publisher :
iet
ISSN :
1350-2425
Type :
jour
DOI :
10.1049/ip-com:20045171
Filename :
1430587
Link To Document :
بازگشت