๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Integer DCTs and fast algorithms

โœ Scribed by Yonghong Zeng; Lizhi Cheng; Guoan Bi; Kot, A.C.


Book ID
118691172
Publisher
IEEE
Year
2001
Tongue
English
Weight
201 KB
Volume
49
Category
Article
ISSN
1053-587X

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Invertible integer DCT algorithms
โœ Gerlind Plonka; Manfred Tasche ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 152 KB

Integer DCTs have important applications in lossless coding. In this paper, an integer DCT of radix-2 length n is understood to be a nonlinear, (left-)invertible mapping which acts on Z n and approximates the classical discrete cosine transform (DCT) of length n. In image compression, the DCT of typ

A Fast 8 ร— 8 Pruned DCT Algorithm
โœ Mohamed El-Sharkawy; Waleed Eshmawy ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 199 KB

Pruned DCT Algorithm, Digital Signal Processing 6 other important aspect of DCT is its ability to quan- (1996), 145-154. tize the DCT coefficients using visually weighted quantization values. A new algorithm that computes the 8 1 8 pruned Discrete The two-dimensional DCT can be computed using Cosi