Number of computations in xcorr and fft

Hi all,

I want to know the complexity (number of additions and number of multiplications) of a program I run,so I want to know the number of computations (number of additions and number of multiplications)in xcorr and fft functions. can anyone help ?

Answer 1

[Honglei Chen]

I believe xcorr uses fft internally, so it is essentially two FFT and one IFFT. The computation complexity of FFT is well known to be n*log(n).

HTH