Title :
The discrete Fourier transform over a finite field with reduced multiplicative complexity
Author :
Fedorenko, Sergei V.
Author_Institution :
Inf. Syst. security Dept., St.Petersburg State Univ. of Aerosp. Instrum., St. Petersburg, Russia
fDate :
July 31 2011-Aug. 5 2011
Abstract :
A novel method for computation of the discrete Fourier transform over a finite field with reduced multiplicative complexity is described. The theorem about the multiplicative complexity coincidence of the Goertzel and cyclotomic algorithms is proved.
Keywords :
Reed-Solomon codes; discrete Fourier transforms; error correction codes; Goertzel multiplicative complexity coincidence; Reed-Solomon codes; cyclotomic algorithms; discrete Fourier transform; error correction codes; finite field; reduced multiplicative complexity; Complexity theory; Convolution; Discrete Fourier transforms; Educational institutions; Heuristic algorithms; Polynomials; Signal processing algorithms;
Conference_Titel :
Information Theory Proceedings (ISIT), 2011 IEEE International Symposium on
Conference_Location :
St. Petersburg
Print_ISBN :
978-1-4577-0596-0
Electronic_ISBN :
2157-8095
DOI :
10.1109/ISIT.2011.6033725
