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:
인용 양식
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!