An orthogonal 16-point approximate DCT for image and video compression

From MaRDI portal
Publication:2014160

DOI10.1007/S11045-014-0291-6zbMATH Open1380.94043DBLPjournals/mssp/SilveiraBCKMK16arXiv1606.05562OpenAlexW3122269616WikidataQ59162948 ScholiaQ59162948MaRDI QIDQ2014160FDOQ2014160

Fábio M. Bayer, Arjuna Madanayake, Renato J. Cintra, Alice J. Kozakevicius, Thiago L. T. da Silveira, Sunera Kulasekera

Publication date: 10 August 2017

Published in: Multidimensional Systems and Signal Processing (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1606.05562





Cites Work


Cited In (1)

Uses Software






This page was built for publication: An orthogonal 16-point approximate DCT for image and video compression

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2014160)