A Class of DCT Approximations Based on the Feig-Winograd Algorithm

Abstract

A new class of matrices based on a parametrization of the Feig-Winograd factorization of 8-point DCT is proposed. Such parametrization induces a matrix subspace, which unifies a number of existing methods for DCT approximation. By solving a comprehensive multicriteria optimization problem, we identified several new DCT approximations. Obtained solutions were sought to possess the following properties: (i) low multiplierless computational complexity, (ii) orthogonality or near orthogonality, (iii) low complexity invertibility, and (iv) close proximity and performance to the exact DCT. Proposed approximations were submitted to assessment in terms of proximity to the DCT, coding performance, and suitability for image compression. Considering Pareto efficiency, particular new proposed approximations could outperform various existing methods archived in literature.

26 pages, 4 figures, 5 tables, fixed arithmetic complexity in Table IV

References in corpus (5)

• Improved 8-point Approximate DCT for Image and Video Compression Requiring Only 14 Additions
• DCT-like Transform for Image Compression Requires 14 Additions Only
• An Integer Approximation Method for Discrete Sinusoidal Transforms
• A Digital Hardware Fast Algorithm and FPGA-based Prototype for a Novel 16-point Approximate DCT for Image Compression Applications
• A Single-Channel Architecture for Algebraic Integer Based 8$\times$8 2-D DCT Computation

Cited by in corpus (14)

• Low-complexity Image and Video Coding Based on an Approximate Discrete Tchebichef Transform
• Low-complexity Approximate Convolutional Neural Networks
• Low-complexity 8-point DCT Approximation Based on Angle Similarity for Image and Video Coding
• Multiplierless 16-point DCT Approximation for Low-complexity Image and Video Coding
• A Class of Low-complexity DCT-like Transforms for Image and Video Coding
• Efficient and Self-Recursive Delay Vandermonde Algorithm for Multi-Beam Antenna Arrays
• A Multiparametric Class of Low-complexity Transforms for Image and Video Coding
• Low-Complexity Loeffler DCT Approximations for Image and Video Coding
• Low-complexity Scaling Methods for DCT-II Approximations
• DCT Approximations Based on Chen's Factorization
• Efficient Computation of the 8-point DCT via Summation by Parts
• Extensions on Low-complexity DCT Approximations for Larger Blocklengths Based on Minimal Angle Similarity
• Multiplierless DFT Approximation Based on the Prime Factor Algorithm
• Low-complexity Architecture for AR(1) Inference