Improved 8-point Approximate DCT for Image and Video Compression Requiring Only 14 Additions
arXiv:1501.02995 · doi:10.1109/TCSI.2013.2295022
Abstract
Video processing systems such as HEVC requiring low energy consumption needed for the multimedia market has lead to extensive development in fast algorithms for the efficient approximation of 2-D DCT transforms. The DCT is employed in a multitude of compression standards due to its remarkable energy compaction properties. Multiplier-free approximate DCT transforms have been proposed that offer superior compression performance at very low circuit complexity. Such approximations can be realized in digital VLSI hardware using additions and subtractions only, leading to significant reductions in chip area and power consumption compared to conventional DCTs and integer transforms. In this paper, we introduce a novel 8-point DCT approximation that requires only 14 addition operations and no multiplications. The proposed transform possesses low computational complexity and is compared to state-of-the-art DCT approximations in terms of both algorithm complexity and peak signal-to-noise ratio. The proposed DCT approximation is a candidate for reconfigurable video standards such as HEVC. The proposed transform and several other DCT approximations are mapped to systolic-array digital architectures and physically realized as digital prototype circuits using FPGA technology and mapped to 45 nm CMOS technology.
30 pages, 7 figures, 5 tables
References in corpus (4)
- DCT-like Transform for Image Compression Requires 14 Additions Only
- An Integer Approximation Method for Discrete Sinusoidal Transforms
- A Row-parallel 88 2-D DCT Architecture Using Algebraic Integer Based Exact Computation
- A Digital Hardware Fast Algorithm and FPGA-based Prototype for a Novel 16-point Approximate DCT for Image Compression Applications
Cited by in corpus (17)
- Low-complexity Approximate Convolutional Neural Networks
- A Class of DCT Approximations Based on the Feig-Winograd Algorithm
- A Discrete Tchebichef Transform Approximation for Image and Video Coding
- 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 Multidimensional DCT Approximations
- A Class of Low-complexity DCT-like Transforms for Image and Video Coding
- Energy-efficient 8-point DCT Approximations: Theory and Hardware Architectures
- Low-complexity Pruned 8-point DCT Approximations for Image Encoding
- 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
- Low-complexity Rounded KLT Approximation for Image Compression
- Extensions on Low-complexity DCT Approximations for Larger Blocklengths Based on Minimal Angle Similarity
- Data-independent Low-complexity KLT Approximations for Image and Video Coding
- Reconfigurable and approximate computing for video coding
- Fast Data-independent KLT Approximations Based on Integer Functions