Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Multiplierless 16-point DCT Approximation for Low-complexity Image and Video Coding (1606.07414v1)

Published 23 Jun 2016 in cs.CV, cs.MM, cs.NA, and stat.ME

Abstract: An orthogonal 16-point approximate discrete cosine transform (DCT) is introduced. The proposed transform requires neither multiplications nor bit-shifting operations. A fast algorithm based on matrix factorization is introduced, requiring only 44 additions---the lowest arithmetic cost in literature. To assess the introduced transform, computational complexity, similarity with the exact DCT, and coding performance measures are computed. Classical and state-of-the-art 16-point low-complexity transforms were used in a comparative analysis. In the context of image compression, the proposed approximation was evaluated via PSNR and SSIM measurements, attaining the best cost-benefit ratio among the competitors. For video encoding, the proposed approximation was embedded into a HEVC reference software for direct comparison with the original HEVC standard. Physically realized and tested using FPGA hardware, the proposed transform showed 35% and 37% improvements of area-time and area-time-squared VLSI metrics when compared to the best competing transform in the literature.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (5)
  1. T. L. T. Silveira (2 papers)
  2. R. S. Oliveira (5 papers)
  3. F. M. Bayer (37 papers)
  4. R. J. Cintra (85 papers)
  5. A. Madanayake (22 papers)
Citations (20)

Summary

We haven't generated a summary for this paper yet.