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

TL;DR

This paper introduces two low-complexity, multiplierless pruned 8-point DCT approximations that outperform existing methods in complexity and are effective for image compression, with practical CMOS implementation.

Contribution

The paper presents novel pruned 8-point DCT approximations that are multiplierless and have lower complexity than current methods, suitable for efficient image encoding.

Findings

Demonstrated competitiveness in JPEG-like image compression simulations.

Achieved lower arithmetic complexity compared to state-of-the-art methods.

Successfully implemented in CMOS technology using BEE3 platform.

Abstract

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).