# Multiplierless 16-point DCT Approximation for Low-complexity Image and Video Coding

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

## Key facts

- Cited by 3 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 23 Jun 2016.

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

- [Low-complexity Rounded KLT Approximation for Image Compression](https://mlsanity.com/paper/2111.14239/) (2021)
- [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)

An orthogonal 16-point approximate discrete cosine transform (DCT) is introduced. The proposed transform requires neither multiplications nor bit-shifting operations. A fast algorithm based on matrix factorization is introduced, requiring only 44 additions---the lowest arithmetic cost in literature. To assess the introduced transform, computational complexity, similarity with the exact DCT, and coding performance measures are computed. Classical and state-of-the-art 16-point low-complexity transforms were used in a comparative analysis. In the context of image compression, the proposed approximation was evaluated via PSNR and SSIM measurements, attaining the best cost-benefit ratio among the competitors. For video encoding, the proposed approximation was embedded into a HEVC reference software for direct comparison with the original HEVC standard. Physically realized and tested using FPGA hardware, the proposed transform showed 35% and 37% improvements of area-time and area-time-squared VLSI metrics when compared to the best competing transform in the literature.