A Multiplierless Pruned DCT-like Transformation for Image and Video Compression that Requires 10 Additions Only
arXiv:1402.5979 · doi:10.1007/s11554-015-0492-8
Abstract
A multiplierless pruned approximate 8-point discrete cosine transform (DCT) requiring only 10 additions is introduced. The proposed algorithm was assessed in image and video compression, showing competitive performance with state-of-the-art methods. Digital implementation in 45 nm CMOS technology up to place-and-route level indicates clock speed of 288 MHz at a 1.1 V supply. The 8x8 block rate is 36 MHz.The DCT approximation was embedded into HEVC reference software; resulting video frames, at up to 327 Hz for 8-bit RGB HEVC, presented negligible image degradation.
13 pages, 4 figures, 5 tables
References in corpus (7)
- A DCT Approximation for Image Compression
- Improved 8-point Approximate DCT for Image and Video Compression Requiring Only 14 Additions
- DCT-like Transform for Image Compression Requires 14 Additions Only
- Low-complexity 8-point DCT Approximations Based on Integer Functions
- An Integer Approximation Method for Discrete Sinusoidal Transforms
- A Class of DCT Approximations Based on the Feig-Winograd Algorithm
- Multiplierless Approximate 4-point DCT VLSI Architectures for Transform Block Coding
Cited by in corpus (4)
- Low-complexity 8-point DCT Approximation Based on Angle Similarity for Image and Video Coding
- Low-complexity Multidimensional DCT Approximations
- A Class of Low-complexity DCT-like Transforms for Image and Video Coding
- Extensions on Low-complexity DCT Approximations for Larger Blocklengths Based on Minimal Angle Similarity