Low-complexity Image and Video Coding Based on an Approximate Discrete Tchebichef Transform

TL;DR

This paper introduces a low-complexity, multiplication-free approximation of the discrete Tchebichef transform for image and video coding, significantly reducing computational complexity and hardware resource usage while maintaining good compression performance.

Contribution

A novel low-complexity, multiplication-free approximation of the DTT with a fast algorithm suitable for real-time image and video compression applications.

Findings

Reduces FPGA logic blocks by 43.1%

Decreases ASIC area-time product by 57.7%

Maintains good compression performance in standard tests

Abstract

The usage of linear transformations has great relevance for data decorrelation applications, like image and video compression. In that sense, the discrete Tchebichef transform (DTT) possesses useful coding and decorrelation properties. The DTT transform kernel does not depend on the input data and fast algorithms can be developed to real time applications. However, the DTT fast algorithm presented in literature possess high computational complexity. In this work, we introduce a new low-complexity approximation for the DTT. The fast algorithm of the proposed transform is multiplication-free and requires a reduced number of additions and bit-shifting operations. Image and video compression simulations in popular standards shows good performance of the proposed transform. Regarding hardware resource consumption for FPGA shows 43.1% reduction of configurable logic blocks and ASIC place and route realization shows 57.7% reduction in the area-time figure when compared with the 2-D version of the exact DTT.