Low-complexity 8-point DCT approximations based on integer functions

2013/09/30 by Renato J. Cintra, R. J. Cintra, F. M. Bayer +3
Computer Science · Mathematics · #Advanced Data Compression Techniques #Algorithm #Applied mathematics #Approximations of π #Artificial intelligence #Computer science #Data compression #Digital Filter Design and Implementation #Discrete cosine transform #Image (mathematics) #Image and Signal Denoising Methods #JPEG #Mathematics #Rounding #msc:65T40 #msc:65T50 #stat.ME

paper · pdf · doi:10.1016/j.sigpro.2013.12.027

published as Signal Processing 99 (2014) 201-214 · 21 pages, 4 figures, corrected typos

arxiv created 2013/10/03 · openalex publication_date 2014/01/02 · arxiv updated 2014/02/26 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05

Abstract

In this paper, we propose a collection of approximations for the 8-point discrete cosine transform (DCT) based on integer functions. Approximations could be systematically obtained and several existing approximations were identified as particular cases. Obtained approximations were compared with the DCT and assessed in the context of JPEG-like image compression.

Citations

• Fundamentals of Statistical Signal Processing: Estimation Theory
• Multiplier-free DCT approximations for RF multi-beam digital aperture-array space imaging and directional sensing
• Discrete Cosine Transform
• Scope of validity of PSNR in image/video quality assessment
• The JPEG still picture compression standard
• Overview of the H.264/AVC video coding standard
• Overview of the High Efficiency Video Coding (HEVC) Standard
• Fast algorithms for the discrete cosine transform