Abstract

Due to the intensive use of the discrete transforms in picture coding, the search for fast and power-efficient approaches for their hardware implementation gains importance. The DTT (Discrete Tchebichef Transform) represents a discrete class of the Chebyshev orthogonal polynomials and it is an alternative for the DCT (Discrete Cosine Transform), commonly used in picture coding. High energy compaction, and decorrelation are the main properties of the DTT. The state-of-the-art approximate DTT matrix is composed of 0, 1 −1, 2, −2 values. In this work, we propose a new approximation for the integer DTT, with better quality and power-efficiency exploring truncation, whose values are 1/16, −1/16, 1/8, −1/8. Considering operations with integers, the smaller values of coefficients causes truncation in the internal transform calculations and lead to lower values for the non-diagonal residues, which reduces non-orthogonality. We have also selectively pruned the rows of the state-of-the-art approximate DTT matrix. The results show that the proposed pruned approximate DTT hardwired solutions increases the maximum frequency about 10.78%, minimizes cells area by 50.2%, with savings up to 55.9% of power dissipation with more compression ratio and less quality losses in the compressed image, when compared with state-of-the-art approximate DTT hardware designs.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.