DocumentCode :
1107939
Title :
On the number of multiplications necessary to compute a length-2nDFT
Author :
Heideman, Michael T. ; Burrus, C. Sidney
Author_Institution :
Rice University, Houston, TX.
Volume :
34
Issue :
1
fYear :
1986
fDate :
2/1/1986 12:00:00 AM
Firstpage :
91
Lastpage :
95
Abstract :
The number of multiplications necessary and sufficient to compute a length-2nDFT is determined. The method of derivation is shown to apply to the multiplicative complexity results of Winograd for a length-pnDFT, for p an odd prime number. The multiplicative complexity of the one-dimensional DFT is summarized for many possible lengths.
Keywords :
Acoustic signal processing; Arithmetic; Computational complexity; Discrete Fourier transforms; Fast Fourier transforms; NASA; Roundoff errors; Signal processing algorithms; Speech processing;
fLanguage :
English
Journal_Title :
Acoustics, Speech and Signal Processing, IEEE Transactions on
Publisher :
ieee
ISSN :
0096-3518
Type :
jour
DOI :
10.1109/TASSP.1986.1164785
Filename :
1164785
Link To Document :
https://search.ricest.ac.ir/dl/search/defaultta.aspx?DTC=49&DC=1107939
بازگشت