Advanced Search

Query:

Fill in the form and click »Search«...

Format:

Display: entries per page entries

Zbl 0762.65103
Feig, Ephraim; Winograd, Shmuel
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

Comment on this Item PDF MathML XML ASCII DVI PS BibTeX Online Ordering Article Journal

	Scientific prize winners of the ICM 2010
	Overhang
	Lie groups, physics and geometry. An introduction for physicists, engineers and chemists.

Advanced Search

Zentralblatt MATH Berlin [Germany]