Global InformationDiscrete cosine transform information
 | This article may misquote or misrepresent many of its sources. Please see the cleanup page for more information. (July 2022) |
A discrete cosine transform (DCT) expresses a finite sequence of data points in terms of a sum of cosine functions oscillating at different frequencies. The DCT, first proposed by Nasir Ahmed in 1972, is a widely used transformation technique in signal processing and data compression. It is used in most digital media, including digital images (such as JPEG and HEIF), digital video (such as MPEG and H.26x), digital audio (such as Dolby Digital, MP3 and AAC), digital television (such as SDTV, HDTV and VOD), digital radio (such as AAC+ and DAB+), and speech coding (such as AAC-LD, Siren and Opus). DCTs are also important to numerous other applications in science and engineering, such as digital signal processing, telecommunication devices, reducing network bandwidth usage, and spectral methods for the numerical solution of partial differential equations.
A DCT is a Fourier-related transform similar to the discrete Fourier transform (DFT), but using only real numbers. The DCTs are generally related to Fourier series coefficients of a periodically and symmetrically extended sequence whereas DFTs are related to Fourier series coefficients of only periodically extended sequences. 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), whereas in some variants the input 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. This was the original DCT as first proposed by Ahmed. 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. Multidimensional DCTs (MD DCTs) are developed to extend the concept of DCT to multidimensional signals. A variety of fast algorithms have been developed to reduce the computational complexity of implementing DCT. One of these is the integer DCT (IntDCT),[1] an integer approximation of the standard DCT,[2]: ix, xiii, 1, 141–304 used in several ISO/IEC and ITU-T international standards.[1][2]
DCT compression, also known as block compression, compresses data in sets of discrete DCT blocks.[3] DCT blocks sizes including 8x8 pixels for the standard DCT, and varied integer DCT sizes between 4x4 and 32x32 pixels.[1][4] The DCT has a strong energy compaction property,[5][6] capable of achieving high quality at high data compression ratios.[7][8] However, blocky compression artifacts can appear when heavy DCT compression is applied.
- ^ a b c Cite error: The named reference
Stankovicwas invoked but never defined (see the help page). - ^ a b Cite error: The named reference
Britanak2010was invoked but never defined (see the help page). - ^ Cite error: The named reference
Alikhaniwas invoked but never defined (see the help page). - ^ Cite error: The named reference
applewas invoked but never defined (see the help page). - ^ Cite error: The named reference
pubDCTwas invoked but never defined (see the help page). - ^ Cite error: The named reference
pubRaoYipwas invoked but never defined (see the help page). - ^ Cite error: The named reference
Barberowas invoked but never defined (see the help page). - ^ Lea, William (1994). "Video on demand: Research Paper 94/68". House of Commons Library. Retrieved 20 September 2019.