mfft
This short bit of code is a full fledged radix-2 fast fourier transform.
It is kept short and easy to read to make it easy for students to learn and understand the fast fourier algorithm.
As this algorithm is recursive, it does not require the butterfly reordering of input or output data.
Length of the input must be a power of 2.
SYNTAX:
y = mfft(1:2^10)
EXAMPLE:
n = 2^10;
data = sind((1:n)*10)'+rand(n,1);
y = mfft(data);
subplot(2,1,1);
plot(data);
xlim([1 n]);
subplot(2,1,2);
plot(abs(y));
xlim([1 n]);
Cite As
Friedrich (2024). mfft (https://www.mathworks.com/matlabcentral/fileexchange/67515-mfft), 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 >
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.