Low-Complexity Loeffler DCT Approximations for Image and Video Coding
arXiv:2207.14463 · doi:10.3390/jlpea8040046
Abstract
This paper introduced a matrix parametrization method based on the Loeffler discrete cosine transform (DCT) algorithm. As a result, a new class of eight-point DCT approximations was proposed, capable of unifying the mathematical formalism of several eight-point DCT approximations archived in the literature. Pareto-efficient DCT approximations are obtained through multicriteria optimization, where computational complexity, proximity, and coding performance are considered. Efficient approximations and their scaled 16- and 32-point versions are embedded into image and video encoders, including a JPEG-like codec and H.264/AVC and H.265/HEVC standards. Results are compared to the unmodified standard codecs. Efficient approximations are mapped and implemented on a Xilinx VLX240T FPGA and evaluated for area, speed, and power consumption.
arXiv comment25 pages, 11 figures, 7 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
- Low-complexity Pruned 8-point DCT Approximations for Image Encoding