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]);
引用格式
Friedrich (2024). mfft (https://www.mathworks.com/matlabcentral/fileexchange/67515-mfft), MATLAB Central File Exchange. 检索来源 .
MATLAB 版本兼容性
创建方式
R2015b
兼容任何版本
平台兼容性
Windows macOS Linux类别
- Signal Processing > Signal Processing Toolbox > Transforms, Correlation, and Modeling > Transforms > Discrete Fourier and Cosine Transforms >
在 Help Center 和 MATLAB Answers 中查找有关 Discrete Fourier and Cosine Transforms 的更多信息
标签
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!