Improved 8-point Approximate DCT for Image and Video Compression Requiring Only 14 Additions
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 6 papers in the map (data through 14 Oct 2026). First posted on arXiv 13 Jan 2015.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 2; 2023: 1; 2024: 2.
6 papers.
- 2021Low-complexity Rounded KLT Approximation for Image Compressioncited by 2
- 2022Low-complexity Approximate Convolutional Neural Networkscited by 1
- 2023Low-complexity Multidimensional DCT Approximationscited by 1
- 2022Low-Complexity Loeffler DCT Approximations for Image and Video Codingcited by 0
- 2024Fast Data-independent KLT Approximations Based on Integer Functionscited by 0
- 2024Extensions on Low-complexity DCT Approximations for Larger Blocklengths Based on Minimal Angle Similaritycited by 0
- 2024Extensions on Low-complexity DCT Approximations for Larger Blocklengths Based on Minimal Angle Similarity20 Oct 2024
- 2024Fast Data-independent KLT Approximations Based on Integer Functions11 Oct 2024
- 2023Low-complexity Multidimensional DCT Approximations20 Jun 2023
- 2022Low-complexity Approximate Convolutional Neural Networks29 Jul 2022
- 2022Low-Complexity Loeffler DCT Approximations for Image and Video Coding29 Jul 2022
- 2021Low-complexity Rounded KLT Approximation for Image Compression28 Nov 2021