I found out that the Matlab built in function for FFT is compiled source code which probably runs faster.
How to efficiently implement algorithm similar to FFT?
1 visualización (últimos 30 días)
Mostrar comentarios más antiguos
I am implementing an algorithm similar to FFT. The only difference is that I'm using my own custom twiddle factors for the butterfly operation to combine smaller DFTs into larger DFTs which is implemented through multiplication of matrices.
However, I am not getting the same performance as the regular FFT built in function. Is it a function of how I'm writing my code?
3 comentarios
Respuesta aceptada
Más respuestas (0)
Ver también
Categorías
Más información sobre Fourier Analysis and Filtering en Help Center y File Exchange.
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!