Language:   Search:   Contact
Zentralblatt MATH has released its new interface!
For an improved author identification, see the new author database of ZBMATH.

Query:
Fill in the form and click »Search«...
Format:
Display: entries per page entries
Zbl 0762.65103
Fast algorithms for the discrete cosine transform.
(English)
[J] IEEE Trans. Signal Process. 40, No.9, 2174-2193 (1992). ISSN 1053-587X

Authors' summary: We introduce several fast algorithms for computing discrete cosine transforms (DCT's) and their inverses on multidimensional inputs of sizes which are powers of 2. Because the one-dimensional 8- point DCT and the two-dimensional $8\times 8$-point DCT are so widely used, we discuss them in detail. We also present algorithms for computing scaled DCT's and their inverses; these have applications in compression of continuous tone image data, where the DCT is generally followed by scaling and quantization.
[U.Göhner (Leonberg)]
MSC 2000:
*65T50 Discrete and fast Fourier transforms

Keywords: fast algorithms; discrete cosine transforms; scaling; quantization

Highlights
Master Server