DocumentCode :
1092696
Title :
Bounds on the minimum number of data transfers in WFTA and FFT programs
Author :
Nawab, Hamid ; McClellan, James H.
Author_Institution :
Massachusetts Institute of Technology, Cambridge, MA
Volume :
27
Issue :
4
fYear :
1979
fDate :
8/1/1979 12:00:00 AM
Firstpage :
394
Lastpage :
398
Abstract :
Bounds on the minimum number of data transfers (i.e., loads, stores, and copies) required by WFTA and FFT programs are presented. The analysis is applicable to those general-purpose computers with M general processor registers (e.g., the IBM 370, PDP-11, etc.) where 
transform length. It is shown that the 1008- point WFTA requires about 21 percent more data transfers than the 1024-point radix-4 FFT; on the other hand, the 120-point WFTA has about the same number of data transfers as the mixed radix (4 × 4 × 4 × 2) version of the 128-point FFT and 22 percent fewer than the radix-2 version. Finally, comparisons of the "total" program execution times (multiplications, additions, and data transfers, but not indexing or permutations) are presented.
transform length. It is shown that the 1008- point WFTA requires about 21 percent more data transfers than the 1024-point radix-4 FFT; on the other hand, the 120-point WFTA has about the same number of data transfers as the mixed radix (4 × 4 × 4 × 2) version of the 128-point FFT and 22 percent fewer than the radix-2 version. Finally, comparisons of the "total" program execution times (multiplications, additions, and data transfers, but not indexing or permutations) are presented.Keywords :
Arithmetic; Computer architecture; Helium; Indexing; Registers; Space technology;
fLanguage :
English
Journal_Title :
Acoustics, Speech and Signal Processing, IEEE Transactions on
Publisher :
ieee
ISSN :
0096-3518
Type :
jour
DOI :
10.1109/TASSP.1979.1163272
Filename :
1163272
Link To Document :
