DocumentCode
2393726
Title
Implementation of prime-point DFTs with programable processors
Author
Liu, Zhenyu ; Wang, Hongkai ; Xie, Qunfang ; Zhang, Yanjun ; Zhou, Wenbiao ; Liu, Dake
Author_Institution
Sch. of Inf. & Electron., Beijing Inst. of Technol., Beijing, China
fYear
2012
fDate
19-20 May 2012
Firstpage
1693
Lastpage
1697
Abstract
Two existing DFT/FFT algorithms and a new prime-point Fast Fourier Transform algorithm are implemented with different serial and parallel processors. The evaluation results show that previous multiplication computational cost criterion is no longer applicable to the current parallel implementation. Total computational cost including add/subtract operation is one of the key factors affecting the speed and efficiency of implementation of parallel architecture.
Keywords
computational complexity; fast Fourier transforms; signal processing; DFT/FFT algorithms; parallel architecture; parallel processors; prime-point DFT; prime-point Fast Fourier Transform algorithm; programable processors; serial processors; Algorithm design and analysis; Clocks; Computer architecture; Discrete Fourier transforms; Program processors; Signal processing algorithms; DFT; FFT; SIMD; SISD; prime factor FFT;
fLanguage
English
Publisher
ieee
Conference_Titel
Systems and Informatics (ICSAI), 2012 International Conference on
Conference_Location
Yantai
Print_ISBN
978-1-4673-0198-5
Type
conf
DOI
10.1109/ICSAI.2012.6223367
Filename
6223367
Link To Document