Partial Fast Fourier Transform
No License
This program uses the fractional fourier transform to compute only part of the FFT. It is even faster if the signal is sparse (i.e. it contains only a few non-zero elements).
Example:
signal=rand(16,1);
ft=FPFT(signal,1024,64);
This computes the first 64 points of the FFT of signal, signal is padded with zeroes to length 1024 first. This is much faster than
ft=FFT(signal,1024);ft=ft(1:64);
FPFT uses a caching mechanism to improve speed for multiple calls.
Cite As
Gerbrand van der Zouw (2024). Partial Fast Fourier Transform (https://www.mathworks.com/matlabcentral/fileexchange/9200-partial-fast-fourier-transform), MATLAB Central File Exchange. Retrieved .
MATLAB Release Compatibility
Platform Compatibility
Windows macOS LinuxCategories
- Signal Processing > Signal Processing Toolbox > Transforms, Correlation, and Modeling > Transforms > Discrete Fourier and Cosine Transforms > Fast Fourier Transforms >
Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!Discover Live Editor
Create scripts with code, output, and formatted text in a single executable document.
Version | Published | Release Notes | |
---|---|---|---|
1.0.0.0 | For certain cases the speed has been increased by 30%. Also a small bug fix was applied. |