Skip to Main Content
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.
Acoustics, Speech and Signal Processing, IEEE Transactions on (Volume:34 , Issue: 1 )
Date of Publication: Feb 1986