DocumentCode
3035370
Title
Parallelism in the computation of the FFT and the WFTA
Author
Nawab, Hamid ; McClellan, James H.
Author_Institution
Massachusetts Institute of Technology, Cambridge, Massachusetts
Volume
4
fYear
1979
fDate
28946
Firstpage
514
Lastpage
517
Abstract
Arithmetic concurrencies, such as those found in special-purpose fast Fourier transform (FFT) hard-ware, are surveyed and categorized. Similar structures are then derived for the Winograd Fourier transform algorithm (WFTA). Relative time-efficiency plots are obtained for the 1024-point radix-4 FFT and the 1008-point WFTA as a function of the number of real arithmetic operations executable in parallel. This comparison shows that the relative time efficiency of the two algorithms in sequential computations generally carries over to cases where arithmetic parallelism is exploited.
Keywords
Arithmetic; Concurrent computing; Costs; Fast Fourier transforms; Fourier transforms; Gold; Hardware; Laboratories; Parallel processing; Particle measurements;
fLanguage
English
Publisher
ieee
Conference_Titel
Acoustics, Speech, and Signal Processing, IEEE International Conference on ICASSP '79.
Type
conf
DOI
10.1109/ICASSP.1979.1170655
Filename
1170655
Link To Document