How many complex multiplications are need to be performed for each FFT algorithm?
Answers
Answered by
1
Explanation:
Explanation: In the overlap add method, the N-point data block consists of L new data points and additional M-1 zeros and the number of complex multiplications required in FFT algorithm are (N/2)log2N. So, the number of complex multiplications per output data point is [Nlog22N]/L.
Similar questions