Question

4 point Radix 2 FFT algorithm requires how many complex addition and complex multiplication​

Answer 1

Answer:

Radix-2 decimation-in-time FFT

For example, a length-1024 DFT would require 1048576 complex multiplications and 1047552 complex additions with direct computation, but only 5120 complex multiplications and 10240 complex additions using the radix-2 FFT, a savings by a factor of 100 or more