Scribd
Upload
83 views1 page

A Discrete Cosine Transform

A discrete cosine transform (DCT) expresses a sequence of data points as a sum of cosine functions oscillating at different frequencies. DCTs are used in lossy audio and image compression by discarding small high-frequency components, and in solving partial differential equations by expressing a choice of boundary conditions. The most common variant is the type-II DCT, also called "the DCT", while its inverse is the type-III DCT or "the inverse DCT". DCTs are similar to discrete Fourier transforms but use only real numbers.

Uploaded by

adarshs587
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
83 views1 page

A Discrete Cosine Transform

A discrete cosine transform (DCT) expresses a sequence of data points as a sum of cosine functions oscillating at different frequencies. DCTs are used in lossy audio and image compression by discarding small high-frequency components, and in solving partial differential equations by expressing a choice of boundary conditions. The most common variant is the type-II DCT, also called "the DCT", while its inverse is the type-III DCT or "the inverse DCT". DCTs are similar to discrete Fourier transforms but use only real numbers.

Uploaded by

adarshs587
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

A discrete cosine transform (DCT) expresses a sequence of finitely many data points in

terms of a sum of cosine functions oscillating at different frequencies. DCTs are important to
numerous applications in science and engineering, from lossy compression of audio and
images (where small high-frequency components can be discarded), to spectral methods for
the numerical solution of partial differential equations. The use of cosine rather than sine
functions is critical in these applications: for compression, it turns out that cosine functions
are much more efficient (as explained below, fewer are needed to approximate a typical
signal), whereas for differential equations the cosines express a particular choice of boundary
conditions.

In particular, a DCT is a Fourier-related transform similar to the discrete Fourier transform


(DFT), but using only real numbers. DCTs are equivalent to DFTs of roughly twice the
length, operating on real data with even symmetry (since the Fourier transform of a real and
even function is real and even), where in some variants the input and/or output data are
shifted by half a sample. There are eight standard DCT variants, of which four are common.

The most common variant of discrete cosine transform is the type-II DCT, which is often
called simply "the DCT"; its inverse, the type-III DCT, is correspondingly often called
simply "the inverse DCT" or "the IDCT". Two related transforms are the discrete sine
transform (DST), which is equivalent to a DFT of real and odd functions, and the modified
discrete cosine transform (MDCT), which is based on a DCT of overlapping data.

In mathematics, a wavelet series is a representation of a square-integrable (real- or complex-valued)


function by a certain orthonormal series generated by a wavelet. This article provides a formal,
mathematical definition of an orthonormal wavelet and of the integral wavelet transform

You might also like