Discrete Fourier Transform of a finite sequence

A finite sequence is taken as an array input and its DFT is calculated.


Updated 6 Dec 2011

View License

DFT transforms one function into another, which is called the frequency domain representation, or simply the DFT, of the original function (which is often a function in the time domain). But the DFT requires an input function that is discrete and whose non-zero values have a limited (finite) duration.
Unlike the discrete-time Fourier transform (DTFT), it only evaluates enough frequency components to reconstruct the finite segment that was analyzed.

Cite As

Saurav Nandi (2023). Discrete Fourier Transform of a finite sequence (https://www.mathworks.com/matlabcentral/fileexchange/34088-discrete-fourier-transform-of-a-finite-sequence), MATLAB Central File Exchange. Retrieved .

MATLAB Release Compatibility
Created with R2010a
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