# A Multiplierless Pruned DCT-like Transformation for Image and Video Compression that Requires 10 Additions Only

arXiv: https://arxiv.org/abs/1402.5979 · HTML: https://mlsanity.com/paper/1402.5979/

## Key facts

- Cited by 2 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 24 Feb 2014.

## Built on by (most cited first, 2 of 2)

- [Low-complexity Multidimensional DCT Approximations](https://mlsanity.com/paper/2306.11724/) (2023)
- [Extensions on Low-complexity DCT Approximations for Larger Blocklengths Based on Minimal Angle Similarity](https://mlsanity.com/paper/2410.15244/) (2024)

## Abstract (arXiv)

A multiplierless pruned approximate 8-point discrete cosine transform (DCT) requiring only 10 additions is introduced. The proposed algorithm was assessed in image and video compression, showing competitive performance with state-of-the-art methods. Digital implementation in 45 nm CMOS technology up to place-and-route level indicates clock speed of 288 MHz at a 1.1 V supply. The 8x8 block rate is 36 MHz.The DCT approximation was embedded into HEVC reference software; resulting video frames, at up to 327 Hz for 8-bit RGB HEVC, presented negligible image degradation.
