Discrete transform
In signal processing, discrete transforms are mathematical transforms, often linear transforms, of signals between discrete domains, such as between discrete time and discrete frequency.[1]
Many common integral transforms used in signal processing have their discrete counterparts. For example, for the Fourier transform the counterpart is the discrete Fourier transform.
In addition to spectral analysis of signals, discrete transforms play important role in data compression, signal detection, digital filtering and correlation analysis.[2] The discrete cosine transform (DCT) is the most widely used transform coding compression algorithm in digital media, followed by the discrete wavelet transform (DWT).
Transforms between a discrete domain and a continuous domain are not discrete transforms. For example, the discrete-time Fourier transform and the Z-transform, from discrete time to continuous frequency, and the Fourier series, from continuous time to discrete frequency, are outside the class of discrete transforms.
Classical signal processing deals with one-dimensional discrete transforms. Other application areas, such as image processing, computer vision, high-definition television, visual telephony, etc. make use of two-dimensional and in general, multidimensional discrete transforms.
See also
References
- ↑ Jerry C. Whitaker (2001). Television receivers. McGraw-Hill Professional. p. 147. ISBN 978-0-07-138042-3. https://books.google.com/books?id=n3hxYt1u8vwC&dq=%22discrete+transforms+are%22&pg=PA147.
- ↑ Graham Wade (1994). Signal coding and processing (2nd ed.). Cambridge University Press. p. 332. ISBN 978-0-521-42336-6. https://books.google.com/books?id=CJswCy7_W8YC&dq=%22discrete+transforms+are%22&pg=PA332.
 |  |
