Low-complexity Pruned 8-point DCT Approximations for Image Encoding
This work addresses the problem of reducing computational complexity for image compression, particularly in hardware implementations, but it is incremental as it builds on existing DCT approximations.
The authors introduced two multiplierless pruned 8-point DCT approximations for image encoding, which achieve lower arithmetic complexity than state-of-the-art methods and demonstrate competitiveness in JPEG-like compression simulations, with digital VLSI implementations realized in BEE3.
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).