# Low-complexity Pruned 8-point DCT Approximations for Image Encoding

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

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 11 Dec 2016.

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

- [Low-Complexity Loeffler DCT Approximations for Image and Video Coding](https://mlsanity.com/paper/2207.14463/) (2022)

## Abstract (arXiv)

Two multiplierless pruned 8-point discrete cosine transform (DCT) approximation are presented. Both transforms present lower arithmetic complexity than state-of-the-art methods. The performance of such new methods was assessed in the image compression context. A JPEG-like simulation was performed, demonstrating the adequateness and competitiveness of the introduced methods. Digital VLSI implementation in CMOS technology was also considered. Both presented methods were realized in Berkeley Emulation Engine (BEE3).
