A Note on the FFT
This chapter gives a formula for the exact number of non-trival multipliers required in the basic N-point FFT algorithms, where N is an integral power of 2. Now proceed further, but not too far!
KeywordsFFT Computation Number of multipliers
- 1.A.V. Oppenheim, R.W. Schafer, Digital Signal Processing (Prentice Hall, New Jersey, 1975)Google Scholar
© Springer Nature Singapore Pte Ltd. 2018