I could not find implementation details about ippsFFT. Basically I want to know how many numerical operations should I substitute for the ippsFFT.
I am aware that for a N element long array the FFT has order of Nlog2(N) operations and if it is radix 2 implementation it goes upto 5N log2(N). Please confirm.
So similarly for a N element long array, how many operations should I substitute for "ippsFFT"?
My guess based on some measurements is 2N log2(N). Can anyone please confirm this for me?
Any help in this regards will be highly appreciated.