Discrete Fourier transform: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
(No difference)
|
Revision as of 23:43, 1 February 2007
Discrete Fourier transform (DFT), sometimes called the finite Fourier transform, is a Fourier transform widely employed in signal processing and related fields to analyze the frequencies contained in a sampled signal, to solve partial differential equations, and to perform other operations such as convolutions. The DFT can be computed efficiently in practice using a fast Fourier transform (FFT) algorithm.