- Mark as New
- Bookmark
- Subscribe
- Mute
- Subscribe to RSS Feed
- Permalink
- Report Inappropriate Content
Hi
I'm implementing convolution using FFT and am looking for faster implementations.I had a guestion about algorithm used in FFT (real samples) for IPP . Is it possible to know what algorithm it uses (radix 2/4, split radix ) ?
Thanks
I'm implementing convolution using FFT and am looking for faster implementations.I had a guestion about algorithm used in FFT (real samples) for IPP . Is it possible to know what algorithm it uses (radix 2/4, split radix ) ?
Thanks
Link Copied
1 Reply
- Mark as New
- Bookmark
- Subscribe
- Mute
- Subscribe to RSS Feed
- Permalink
- Report Inappropriate Content
Hi Navals,
I recalled, Intel IPP FFT is Radix - 2 FFT and the DFT have arbitrary radix support. Additionally, Intel Math Kernel Library (Intel MKL) has none Radix-2 DFT functions .
Here is onearticle about FFT in IPP and MKL
http://software.intel.com/en-us/articles/mkl-ipp-choosing-an-fft/
But both IPP and MKL include convolution functionalities,whichare implementedusing FFT and general convoluation.
Please See ipp manual or MKL manual by visit the Intel MKL web site and the Intel IPP web site.
You may use them directly and see if they can meet your requirement.
Regards,
Ying
Reply
Topic Options
- Subscribe to RSS Feed
- Mark Topic as New
- Mark Topic as Read
- Float this Topic for Current User
- Bookmark
- Subscribe
- Printer Friendly Page