An Orthogonal 16-point Approximate DCT for Image and Video Compression
arXiv:1606.05562 · doi:10.1007/s11045-014-0291-6
Abstract
A low-complexity orthogonal multiplierless approximation for the 16-point discrete cosine transform (DCT) was introduced. The proposed method was designed to possess a very low computational cost. A fast algorithm based on matrix factorization was proposed requiring only 60~additions. The proposed architecture outperforms classical and state-of-the-art algorithms when assessed as a tool for image and video compression. Digital VLSI hardware implementations were also proposed being physically realized in FPGA technology and implemented in 45 nm up to synthesis and place-route levels. Additionally, the proposed method was embedded into a high efficiency video coding (HEVC) reference software for actual proof-of-concept. Obtained results show negligible video degradation when compared to Chen DCT algorithm in HEVC.
arXiv comment18 pages, 7 figures, 6 tables
References in corpus (6)
- 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 Digital Hardware Fast Algorithm and FPGA-based Prototype for a Novel 16-point Approximate DCT for Image Compression Applications
Cited by in corpus (6)
- 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
- A Multiparametric Class of Low-complexity Transforms for Image and Video Coding
- Low-complexity Scaling Methods for DCT-II Approximations
- Low-complexity Three-dimensional Discrete Hartley Transform Approximations for Medical Image Compression
- Data-independent Low-complexity KLT Approximations for Image and Video Coding