DFT verses FFT performance for non 2^ sizes

DFT verses FFT performance for non 2^ sizes

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?

1 envío / 0 nuevos
Para obtener más información sobre las optimizaciones del compilador, consulte el aviso sobre la optimización.