An Efficient Hardware Implementation of 2D Convolution based on the Discrete Hirschman Transform

A highly efficient 2D convolutional algorithm based on the Discrete Hirschman Transform (DHT), known as DHT-Conv, has recently been developed. This method demonstrates superior performance compared to FFT-based convolution (FFT-Conv) in terms of computational complexity. In this paper, we implement DHTConv on Field Programmable Gate Arrays (FPGA) and evaluate its hardware performance on both Altera and Xilinx FPGA devices. The results from the Altera device indicate that our DHTConv significantly outperforms FFT-based convolution, yielding over 22% savings in real computations and approximately 5% in latency. Additionally, the results from the Xilinx FPGA board show that DHTConv requires fewer hardware resources compared to FFTConv, achieving over 16% savings in LUTs, 48% savings in flip-flops, and 61% savings in DSP blocks.

Authors

Publication Details

Published
2025-05-25
DOI
https://doi.org/10.1109/iscas56072.2025.11044061
Primary Topic
Image and Video Stabilization
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

An Efficient Hardware Implementation of 2D Convolution based on the Discrete Hirschman Transform

Linda S. DeBrunner, Victor DeBrunner, Weiwei Wang
Image and Video Stabilization
article

An Efficient Hardware Implementation of 2D Convolution based on the Discrete Hirschman Transform

Linda S. DeBrunner, Victor DeBrunner, Weiwei Wang
article en

Abstract

A highly efficient 2D convolutional algorithm based on the Discrete Hirschman Transform (DHT), known as DHT-Conv, has recently been developed. This method demonstrates superior performance compared to FFT-based convolution (FFT-Conv) in terms of computational complexity. In this paper, we implement DHTConv on Field Programmable Gate Arrays (FPGA) and evaluate its hardware performance on both Altera and Xilinx FPGA devices. The results from the Altera device indicate that our DHTConv significantly outperforms FFT-based convolution, yielding over 22% savings in real computations and approximately 5% in latency. Additionally, the results from the Xilinx FPGA board show that DHTConv requires fewer hardware resources compared to FFTConv, achieving over 16% savings in LUTs, 48% savings in flip-flops, and 61% savings in DSP blocks.

Openalex Percentile: Top 87%
Image and Video Stabilization
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.

An Efficient Hardware Implementation of 2D Convolution based on the Discrete Hirschman Transform — Linda S. DeBrunner, Victor DeBrunner, et al. · (2025) | TGRS Research Map | TGRS