Intel® oneAPI Math Kernel Library
Ask questions and share information with other developers who use Intel® Math Kernel Library.

DFT verses FFT performance for non 2^ sizes

Intel_C_Intel
Employee
379 Views
I am migrating from the MKLFFT calls to the MKL DFT calls using C++. I have a fft size that is 700K long that requires me to use a fft length of 2^20th. With the DFT call in MKL vs the FFT call will I see a 25% speed increase because I can use the 700K sample fft in the DFT instead of the 2^20th for the MKL FFT?
0 Kudos
0 Replies
Reply