DocumentCode :
1985874
Title :
Fast decoding reed solomon codes using properties of vandermonde matrices
Author :
Momenai, Abdolali ; Talebi, Siamak
Author_Institution :
Electr. Eng. Dept., Univ. of Kerman, Kerman
fYear :
2007
fDate :
12-15 Feb. 2007
Firstpage :
1
Lastpage :
4
Abstract :
Reed Solomon (RS) codes are one of the most practically used error recovery codes. This paper proposes a fast decoding algorithm for RS error recovery codes. The proposed method decomposes the matrix that arises in the recovery process. The matrix is decomposed into a Vandermonde matrix and a diagonal matrix. Then by using the properties of the Vandermonde matrices, the decoding is accelerated. It is also shown that the proposed algorithm has lower computational complexity compared to the other RS decoding algorithms.
Keywords :
Reed-Solomon codes; decoding; matrix decomposition; Reed Solomon code; Vandermonde matrix; computational complexity; decoding algorithm; diagonal matrix decomposition; error recovery code; Acceleration; Computational complexity; Decoding; Encoding; Error correction; Fourier transforms; Galois fields; Matrix decomposition; Polynomials; Reed-Solomon codes;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Signal Processing and Its Applications, 2007. ISSPA 2007. 9th International Symposium on
Conference_Location :
Sharjah
Print_ISBN :
978-1-4244-0778-1
Electronic_ISBN :
978-1-4244-1779-8
Type :
conf
DOI :
10.1109/ISSPA.2007.4555360
Filename :
4555360
Link To Document :
بازگشت