A Discrete Tchebichef Transform Approximation for Image and Video Coding
P. A. M. Oliveira, R. J. Cintra, F. M. Bayer, S. Kulasekera, A., Madanayake

TL;DR
This paper presents a low-complexity, multiplication-free approximation of the discrete Tchebichef transform that enhances image and video coding efficiency while reducing power consumption and hardware area.
Contribution
It introduces a novel approximation of the DTT that is multiplication-free and optimized for hardware implementation, improving efficiency over existing methods.
Findings
Reduces dynamic power consumption by 44.9%.
Lowers hardware area by 64.7%.
Maintains effective image and video compression performance.
Abstract
In this paper, we introduce a low-complexity approximation for the discrete Tchebichef transform (DTT). The proposed forward and inverse transforms are multiplication-free and require a reduced number of additions and bit-shifting operations. Numerical compression simulations demonstrate the efficiency of the proposed transform for image and video coding. Furthermore, Xilinx Virtex-6 FPGA based hardware realization shows 44.9% reduction in dynamic power consumption and 64.7% lower area when compared to the literature.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
