DISCRETE FOURIER TRANSFORM
\dɪskɹˈiːt fˈɔːɹɪə tɹansfˈɔːm], \dɪskɹˈiːt fˈɔːɹɪə tɹansfˈɔːm], \d_ɪ_s_k_ɹ_ˈiː_t f_ˈɔː_ɹ_ɪ__ə t_ɹ_a_n_s_f_ˈɔː_m]\
Definitions of DISCRETE FOURIER TRANSFORM
Sort: Oldest first
(DFT) A Fourier transform, specialized to thecase where the abscissas are integers.The DFT is central to many kinds of signal processing,including the analysis and compression of video and soundinformation.A common implementation of the DFT is the Fast FourierTransform (FFT).See also discrete cosine transform.
By Denis Howe
Word of the day
- An English poet; born Greenwich, 29, 1821; died at Rowfant, May 30, 1895. He wrote "society verses", among them :"London Lyrics"(1857); "Lyra Elegantiarum"(1867); "Patchwork"(1879).