In particular, it is well known that any discontinuities in a function reduce the rate of convergence of the Fourier series, so that more sinusoids are needed to represent the function with a given accuracy.
This software attracted the attention of Chris Eddy, who had developed a technique for processing discrete cosine transforms (DCT) efficiently through software.
Fourier transform | Laplace transform | Fast Fourier transform | Extract, transform, load | Hilbert transform | Fourier transform infrared spectroscopy | fast Fourier transform | Discrete cosine transform | transform | Mellin transform | discrete cosine transform | Bilinear transform | Z-transform | Y-Δ transform | Wavelet transform modulus maxima method | Hough transform | Gabor–Wigner transform | Gabor transform | fractional Fourier transform | Fourier transform spectroscopy | Fourier Transform | fast fourier transform | Discrete Hartley transform | Adaptive Transform Acoustic Coding (ATRAC) | Adaptive Transform Acoustic Coding |
This design is conceptually similar to that of the well-known discrete cosine transform (DCT), introduced in 1974 by N. Ahmed, T.Natarajan and K.R.Rao, which is Citation 1 in Discrete cosine transform.
Next, each 8×8 block of each component (Y, Cb, Cr) is converted to a frequency-domain representation, using a normalized, two-dimensional type-II discrete cosine transform (DCT), which was introduced by N. Ahmed, T. Natarajan and K. R. Rao in 1974; see Citation 1 in Discrete cosine transform.
As another example, with appropriate normalization the discrete cosine transform (used in MP3 compression) is represented by an orthogonal matrix.