| slovo | definícia |
fourier transform
(foldoc) | Fourier transform
A technique for expressing a waveform as a
weighted sum of sines and cosines.
Computers generally rely on the version known as {discrete
Fourier transform}.
Named after J. B. Joseph Fourier (1768 -- 1830).
See also wavelet, discrete cosine transform.
(1997-03-9)
|
| | podobné slovo | definícia |
discrete fourier transform
(foldoc) | discrete Fourier transform
DFT
(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)
|
fast fourier transform
(foldoc) | Fast Fourier Transform
FFT
(FFT) An algorithm for computing the {Fourier
transform} of a set of discrete data values. Given a finite
set of data points, for example a periodic sampling taken from
a real-world signal, the FFT expresses the data in terms of
its component frequencies. It also solves the essentially
identical inverse problem of reconstructing a signal from the
frequency data.
The FFT is a mainstay of numerical analysis. Gilbert Strang
described it as "the most important algorithm of our
generation". The FFT also provides the asymptotically fastest
known algorithm for multiplying two polynomials.
Versions of the algorithm (in C and Fortran) can be found
on-line from the GAMS server {here
(http://gams.nist.gov/cgi-bin/gams-serve/class/J1.html)}.
["Numerical Methods and Analysis", Buchanan and Turner].
(1994-11-09)
|
fourier transform
(foldoc) | Fourier transform
A technique for expressing a waveform as a
weighted sum of sines and cosines.
Computers generally rely on the version known as {discrete
Fourier transform}.
Named after J. B. Joseph Fourier (1768 -- 1830).
See also wavelet, discrete cosine transform.
(1997-03-9)
|
|