File Exchange

image thumbnail

FFT for input sequence of any length

version 1.0 (1.37 KB) by

This program can calculate FFT of a sequence of length 2^n, where n < ∞

1 Download

Updated

View License

This is a substitute of the function 'FFT'.

Comments and Ratings (2)

The screen shot is a graph in 3-D coordinate. X-axis defines k, y-axis and z-axis define real and imaginary parts of X(k). Here X(k) is the FFT output of x1(input). I did it in 3-D cause in simple stem the figure only contains imaginary part of X(K).

I've non idea which algorithm is used in MATLAB 'FFT'. There may be a difference in algorithm,but we can't see it.So I implemented my own.

Jan Simon

Jan Simon (view profile)

Please explain what we see in the screenshot and the differences between Matlab's fft and your implementation.

MATLAB Release
MATLAB 7.8 (R2009a)

Download apps, toolboxes, and other File Exchange content using Add-On Explorer in MATLAB.

» Watch video