ippsFFT related - need number of operations

ippsFFT related - need number of operations

Hi,
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.
Thanks,
~SA

2 posts / 0 new
Last post
For more complete information about compiler optimizations, see our Optimization Notice.

Hi,

5Nlog2(N) is estimation for usual implementation of RADIX2 algorithm. With using SSE and RADIX4 algorithm we get closer to 2Nlog2(N)

Regards,
Vladimir

Leave a Comment

Please sign in to add a comment. Not a member? Join today