# Low-complexity 8-point DCT Approximations Based on Integer Functions

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

## Key facts

- Cited by 6 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 29 Sep 2013.

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

- [Low-complexity Rounded KLT Approximation for Image Compression](https://mlsanity.com/paper/2111.14239/) (2021)
- [Low-complexity Approximate Convolutional Neural Networks](https://mlsanity.com/paper/2208.00087/) (2022)
- [Low-complexity Multidimensional DCT Approximations](https://mlsanity.com/paper/2306.11724/) (2023)
- [Low-Complexity Loeffler DCT Approximations for Image and Video Coding](https://mlsanity.com/paper/2207.14463/) (2022)
- [Fast Data-independent KLT Approximations Based on Integer Functions](https://mlsanity.com/paper/2410.09227/) (2024)
- [Extensions on Low-complexity DCT Approximations for Larger Blocklengths Based on Minimal Angle Similarity](https://mlsanity.com/paper/2410.15244/) (2024)

## Abstract (arXiv)

In this paper, we propose a collection of approximations for the 8-point discrete cosine transform (DCT) based on integer functions. Approximations could be systematically obtained and several existing approximations were identified as particular cases. Obtained approximations were compared with the DCT and assessed in the context of JPEG-like image compression.