DocumentCode
3502347
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
fYear
2011
fDate
July 31 2011-Aug. 5 2011
Firstpage
1200
Lastpage
1204
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;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory Proceedings (ISIT), 2011 IEEE International Symposium on
Conference_Location
St. Petersburg
ISSN
2157-8095
Print_ISBN
978-1-4577-0596-0
Electronic_ISBN
2157-8095
Type
conf
DOI
10.1109/ISIT.2011.6033725
Filename
6033725
Link To Document