(Basic) Recursive and Vectorized Fast Fourier Transform

版本 2.0.1 (3.5 KB) 作者: Marco Cococcioni
basicFFT is a basic implementation of the discrete FFT algorithm, for teaching purposes. It is recursive and vectorized, hence pretty fast.
0.0
(0)
71.0 次下载
更新时间 2022/3/10

查看许可证

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:
The Fast Fourier Transform (FFT): Most Ingenious Algorithm Ever? - YouTube
Fast Fourier transform - Competitive Programming Algorithms (cp-algorithms.com)

引用格式

Marco Cococcioni (2024). (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. 检索来源 .

MATLAB 版本兼容性
创建方式 R2021b
兼容任何版本
平台兼容性
Windows macOS Linux
标签 添加标签

Community Treasure Hunt

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

Start Hunting!

basicFFT_2.0_[vettorizzata]

版本 已发布 发行说明
2.0.1

Image changed.
2.0.0

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