# DCT-like Transform for Image Compression Requires 14 Additions Only

## TL;DR

This paper introduces a low-complexity 8-point orthogonal approximate DCT that requires only 14 additions, outperforming existing algorithms and the signed DCT in several image compression scenarios.

## Contribution

It presents a novel, multiplication-free DCT approximation with a highly efficient 14-addition algorithm, improving computational simplicity and performance.

## Key findings

- Requires only 14 additions, less than existing methods.
- Can outperform signed DCT in image compression.
- Offers a low-complexity alternative for practical applications.

## Abstract

A low-complexity 8-point orthogonal approximate DCT is introduced. The proposed transform requires no multiplications or bit-shift operations. The derived fast algorithm requires only 14 additions, less than any existing DCT approximation. Moreover, in several image compression scenarios, the proposed transform could outperform the well-known signed DCT, as well as state-of-the-art algorithms.