TOPICS
Search

Discrete Cosine Transform


The discrete cosine transform, abbreviated DCT, expresses a finite real sequence using sampled cosine functions. The commonly used type-II DCT of x_0, ..., x_(N-1) is

 X_k=alpha_ksum_(n=0)^(N-1)x_ncos(pi/N(n+1/2)k),

where k=0, ..., N-1, alpha_0=1/sqrt(N), and alpha_k=sqrt(2/N) for k>0. With this normalization the transformation is orthogonal, and its inverse is

 x_n=sum_(k=0)^(N-1)alpha_kX_kcos(pi/N(n+1/2)k).

The DCT is closely related to the discrete Fourier transform of an even extension of the sequence and is widely used for data compression.


See also

Cosine Transform, Discrete Fourier Transform, Fourier Transform

Explore with Wolfram|Alpha

References

Rao, K. R. and Yip, P. Discrete Cosine Transform: Algorithms, Advantages, Applications. Boston, MA: Academic Press, 1990.

Cite this as:

Weisstein, Eric W. "Discrete Cosine Transform." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/DiscreteCosineTransform.html

Subject classifications