discrete Fourier transform

In mathematics, the discrete Fourier transform (DFT), occasionally called the finite Fourier transform, is a transform for Fourier analysis of finite-domain discrete-time signals. As with most Fourier analyses, it expresses an input function in terms of a sum of sinusoidal components by determining the amplitude and phase of each component. However, the DFT is distinguished by the fact that its input function is discrete and finite: the input to the DFT is a finite sequence of real or complex numbers, which makes the DFT ideal for processing information stored in computers. In particular, the DFT is 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.
See more at Wikipedia.org...

<mathematics> (DFT) A Fourier transform, specialized to the case where the abscissas are integers.
The DFT is central to many kinds of signal processing, including the analysis and compression of video and sound information.
A common implementation of the DFT is the Fast Fourier Transform (FFT).
See also discrete cosine transform.
(1997-03-10)

B: (Matematika) transformasi Fourier diskret
Built to Babylon by Hikmat Gumilar Visit my Website;