Low-Power and Multiplier-Less 2-D DCT Architectures for Image Compression: A Comprehensive Survey

In transform-based image and video compression systems, the Discrete Cosine Transform (DCT) serves as a vital mathematical kernel responsible for compacting spatial correlation into a concentrated set of decorrelated transform coefficients. While mathematically elegant, direct hardware realization of the 2-D 8×8 DCT creates substantial architectural bottlenecks in power-constrained embedded systems, edge-vision sensors, and multimedia terminals. Conventional direct matrix evaluation requires extensive arrays of multi-bit multipliers and adders, causing severe dynamic power dissipation, silicon area bloat, and long propagation delays. This survey provides an exhaustive comparative review of low-power and multiplier-less architectural strategies designed to streamline arithmetic complexity. We examine fast orthogonal algorithmic factorizations (Chen and Loeffler formulations), custom circuit topologies (such as Gate Diffusion Input and Pass Transistor Logic Wallace Tree multipliers), Canonical Signed Digit (CSD) number systems, Common Subexpression Elimination (CSE) graph sharing, integer dyadic lifting architectures (BinDCT), and pruned approximate transforms. Particular analytical focus is directed toward two state-of-the-art implementations: a hybrid GDI-PTL Wallace Tree multiplier architecture tailored for DCT processing and an eight-stage pipelined Loeffler transform utilizing modified Booth arithmetic. These works are compared against earlier multiplier-less CSD-CSE topologies to evaluate critical design trade-offs across operator counts, critical-path timing, pipeline balancing, register allocation, word-length precision truncation, and transpose buffer storage overhead. Furthermore, we establish standardized benchmarking criteria across FPGA resources, ASIC cell area, power components, throughput, latency, and reconstructed visual fidelity (PSNR and SSIM) to establish a rigorous foundation for developing optimized, fully multiplier-less 8×8 2-D DCT accelerators.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-20
DOI
https://doi.org/10.5281/zenodo.24389708
Primary Topic
Digital Filter Design and Implementation
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Low-Power and Multiplier-Less 2-D DCT Architectures for Image Compression: A Comprehensive Survey

V. P. Krishnammal, Bhuvanesh S., Ashvath S., Gokul Raj K.
Zenodo (CERN European Organization for Nuclear Research)
Digital Filter Design and Implementation
article

Low-Power and Multiplier-Less 2-D DCT Architectures for Image Compression: A Comprehensive Survey

V. P. Krishnammal, Bhuvanesh S., Ashvath S., Gokul Raj K.
article en

Abstract

In transform-based image and video compression systems, the Discrete Cosine Transform (DCT) serves as a vital mathematical kernel responsible for compacting spatial correlation into a concentrated set of decorrelated transform coefficients. While mathematically elegant, direct hardware realization of the 2-D 8×8 DCT creates substantial architectural bottlenecks in power-constrained embedded systems, edge-vision sensors, and multimedia terminals. Conventional direct matrix evaluation requires extensive arrays of multi-bit multipliers and adders, causing severe dynamic power dissipation, silicon area bloat, and long propagation delays. This survey provides an exhaustive comparative review of low-power and multiplier-less architectural strategies designed to streamline arithmetic complexity. We examine fast orthogonal algorithmic factorizations (Chen and Loeffler formulations), custom circuit topologies (such as Gate Diffusion Input and Pass Transistor Logic Wallace Tree multipliers), Canonical Signed Digit (CSD) number systems, Common Subexpression Elimination (CSE) graph sharing, integer dyadic lifting architectures (BinDCT), and pruned approximate transforms. Particular analytical focus is directed toward two state-of-the-art implementations: a hybrid GDI-PTL Wallace Tree multiplier architecture tailored for DCT processing and an eight-stage pipelined Loeffler transform utilizing modified Booth arithmetic. These works are compared against earlier multiplier-less CSD-CSE topologies to evaluate critical design trade-offs across operator counts, critical-path timing, pipeline balancing, register allocation, word-length precision truncation, and transpose buffer storage overhead. Furthermore, we establish standardized benchmarking criteria across FPGA resources, ASIC cell area, power components, throughput, latency, and reconstructed visual fidelity (PSNR and SSIM) to establish a rigorous foundation for developing optimized, fully multiplier-less 8×8 2-D DCT accelerators.

Zenodo (CERN European Organization for Nuclear Research)
Digital Filter Design and Implementation
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon
Low-Power and Multiplier-Less 2-D DCT Architectures for Image Compression: A Comprehensive Survey — V. P. Krishnammal, Bhuvanesh S., et al. · Zenodo (CERN European Organization for Nuclear Research) (2026) | TGRS Research Map | TGRS