Fast Fourier Transform

Version 1.0.0.0 (2.52 KB) by erinc topdemir
An fft algorithm using radix2.
3.5
(2)
5.8K Downloads
Updated 31 Jan 2006

No License

This function is written to understand and/or explain an fft algorithm and usage of radix2 procedure.

This function take the signal which you want to find FFT, for m bit

you can also call the function without entering a signal or number of points, because there is default values for y and m which are;
y = sin(2*pi*50*t)+sin(2*pi*120*t);
m=3;

you can see the steps of order reversing used as built-in function but non others. you will also see the taking butterfly tree steps.
for more information read the help file of function.

in future this can be improve as selective radix or any other feature you suggest please notice me for any sugestion.

Cite As

erinc topdemir (2024). Fast Fourier Transform (https://www.mathworks.com/matlabcentral/fileexchange/9809-fast-fourier-transform), MATLAB Central File Exchange. Retrieved .

MATLAB Release Compatibility
Created with R14
Compatible with any release
Platform Compatibility
Windows macOS Linux

Community Treasure Hunt

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

Start Hunting!

Version Published Release Notes
1.0.0.0

help is included
documentation for DFT,FFT,radix2,code steps,usage of function and understanding the result