Abstract

This paper presents an overview of the transform and quantization designs in H.264. Unlike the popular 8/spl times/8 discrete cosine transform used in previous standards, the 4/spl times/4 transforms in H.264 can be computed exactly in integer arithmetic, thus avoiding inverse transform mismatch problems. The new transforms can also be computed without multiplications, just additions and shifts, in 16-bit arithmetic, thus minimizing computational complexity, especially for low-end processors. By using short tables, the new quantization formulas use multiplications but avoid divisions.

Keywords

Discrete cosine transformQuantization (signal processing)Transform codingArithmeticAlgorithmComputational complexity theoryLapped transformMathematicsDiscrete Hartley transformDiscrete sine transformInverseComputer scienceDiscrete mathematicsFractional Fourier transformFourier transformImage (mathematics)Computer visionMathematical analysis

Affiliated Institutions

Related Publications

Publication Info

Year
2003
Type
article
Volume
13
Issue
7
Pages
598-603
Citations
640
Access
Closed

External Links

View on DOI.org

Social Impact

Altmetric
PlumX Metrics

Social media, news, blog, policy document mentions

Citation Metrics

640
OpenAlex

Cite This

H.S. Malvar, Antti Hallapuro, Marta Karczewicz et al. (2003). Low-complexity transform and quantization in H.264/AVC. IEEE Transactions on Circuits and Systems for Video Technology , 13 (7) , 598-603. https://doi.org/10.1109/tcsvt.2003.814964

Identifiers

DOI
10.1109/tcsvt.2003.814964