Low-complexity Scaling Methods for DCT-II Approximations

Abstract

This paper introduces a collection of scaling methods for generating $2N$-point DCT-II approximations based on $N$-point low-complexity transformations. Such scaling is based on the Hou recursive matrix factorization of the exact $2N$-point DCT-II matrix. Encompassing the widely employed Jridi-Alfalou-Meher scaling method, the proposed techniques are shown to produce DCT-II approximations that outperform the transforms resulting from the JAM scaling method according to total error energy and mean squared error. Orthogonality conditions are derived and an extensive error analysis based on statistical simulation demonstrates the good performance of the introduced scaling methods. A hardware implementation is also provided demonstrating the competitiveness of the proposed methods when compared to the JAM scaling method.

arXiv commentClarified definition of matrix ${\mathbf{U}}_N$. 20 pages, 3 figures, 14 tables

References in corpus (9)

• A DCT Approximation for Image Compression
• Improved 8-point Approximate DCT for Image and Video Compression Requiring Only 14 Additions
• Algebraic Signal Processing Theory: Cooley-Tukey Type Algorithms for DCTs and DSTs
• DCT-like Transform for Image Compression Requires 14 Additions Only
• A Class of DCT Approximations Based on the Feig-Winograd Algorithm
• Low-complexity 8-point DCT Approximation Based on Angle Similarity for Image and Video Coding
• An Orthogonal 16-point Approximate DCT for Image and Video Compression
• Low-Complexity Loeffler DCT Approximations for Image and Video Coding
• Signal Processing based on Stable radix-2 DCT Algorithms having Orthogonal Factors

Cited by in corpus (3)

• Low-complexity Rounded KLT Approximation for Image Compression
• Extensions on Low-complexity DCT Approximations for Larger Blocklengths Based on Minimal Angle Similarity
• Fast Data-independent KLT Approximations Based on Integer Functions