DCT-like Transform for Image Compression Requires 14 Additions Only

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.

6 pages, 3 figures, 1 table

Cited by in corpus (2)

• Energy-efficient 8-point DCT Approximations: Theory and Hardware Architectures
• Low-complexity Pruned 8-point DCT Approximations for Image Encoding