answersLogoWhite

0

FFT reduces the computation since no. of complex multiplications required in FFT are N/2(log2N). FFT is used to compute discrete Fourier transform.

What else can I help you with?