(Basic) Recursive and Vectorized Fast Fourier Transform

basicFFT is a basic implementation of the discrete FFT algorithm, for teaching purposes. It is recursive and vectorized, hence pretty fast.


Updated Thu, 10 Mar 2022 13:16:19 +0000

View License

This is a very simple, yet easy to read, imlementation of the (discrete)
Fast Fourier Transform.
Still, the code is easy to read (being it the recursive version of the FFT),
and fast (being it vectorized, i.e., it does not use for loops).
WARNING! This algorithm works only when the input vector has length equal to a power of 2.
If the length of your input is not a power of two, or you want a better speed,
then use the Matlab builtin function 'fft'.
This implementation is mainly intented for teaching purposes, even if is rather fast
due to vectorization.
More info at:

Cite As

Marco Cococcioni (2023). (Basic) Recursive and Vectorized Fast Fourier Transform (https://www.mathworks.com/matlabcentral/fileexchange/104570-basic-recursive-and-vectorized-fast-fourier-transform), MATLAB Central File Exchange. Retrieved .

MATLAB Release Compatibility
Created with R2021b
Compatible with any release
Platform Compatibility
Windows macOS Linux
Tags Add Tags

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!


Version Published Release Notes

Image changed.


This new version is much faster, being it vectorized (no for loops, only recursion)