Title :
Complexity Analysis of The GAO Algorithm
Author :
Chen, Ning ; Yan, Zhiyuan
Author_Institution :
Department of Electrical and Computer Engineering, Lehigh University, PA 18015, USA, E-mail: nic6@lehigh.edu
Abstract :
In this paper, we investigate the complexity of the Gao algorithm for decoding Reed-Solomon (RS) codes. We study both direct and fast implementations of the Gao algorithm and compare their complexities to those of traditional syndrome-based decoding algorithms. Our results show that, regardless of the implementation, the Gao algorithm has higher complexity than syndrome-based decoding algorithms for high rate RS codes that are used in practice.
Keywords :
Algorithm design and analysis; Complexity theory; Consumer electronics; Discrete Fourier transforms; Error correction; Galois fields; Iterative decoding; Polynomials; Reed-Solomon codes; Wireless communication; Complexity theory; Discrete Fourier transforms; Galois fields; Reed-Solomon codes;
Conference_Titel :
Signal Processing Systems, 2007 IEEE Workshop on
Conference_Location :
Shanghai, China
Print_ISBN :
978-1-4244-1222-8
Electronic_ISBN :
1520-6130
DOI :
10.1109/SIPS.2007.4387552
