Howtosignalprocessing
Additions
How many multiplications and additions does it take to compute an FFT of a signal?
Each pair requires 4 additions and 4 multiplications, giving a total number of computations equaling 8N4=N2. This number of computations does not chan...
The total no of complex additions required to compute n point dft by radix 2 fft is
For performing radix- 2 FFT, the value of N = 2m. Here the decimation can be performed m times where m = log2N. In direct computation of N-point DFT, ...