%0 Journal Article
%T Low-Complexity Loeffler DCT Approximations for Image and Video Coding
%A Arjuna Madanayake
%A Diego F. G. Coelho
%A F¨¢bio M. Bayer
%A Paulo Martinez
%A Ra¨ªza S. Oliveira
%A Renato J. Cintra
%A Sunera Kulasekera
%A Thiago L. T. Silveira
%A Vassil S. Dimitrov
%J -
%D 2018
%R https://doi.org/10.3390/jlpea8040046
%X Abstract This paper introduced a matrix parametrization method based on the Loeffler discrete cosine transform (DCT) algorithm. As a result, a new class of 8-point DCT approximations was proposed, capable of unifying the mathematical formalism of several 8-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. View Full-Tex
%K discrete cosine transform
%K approximation
%K multicriteria optimization
%K image/video compression
%U https://www.mdpi.com/2079-9268/8/4/46