Discrete transforms of lengths 8, 16, and 32 with low arithmetic cost for image and video compression applications. Due to the increasing demand for high
data processing rates, the scientific and technological communities have been paying close attention to methodologies that require low computational cost. One way to reduce computational cost in
signal processing is to use transforms that have zero multiplicative cost. In the present invention, three new transforms of lengths 8, 16, and 32 are proposed. These transforms are approximations of the
discrete cosine transform (dct) and are very useful in image and video compression, such as in the
JPEG, MPEG-1, MPEG-2, H.261, H.263, H.264, and more recently, HEVC standards. The proposed scheme is based on an orthogonal approximation for the 8-length dct based on the series of approximations proposed by Ahmed, Bouguezel, and Swamy.The new 8-length transform was scaled up by the Jridi, Alfalou, and Meher method for lengths 16 and 32. Fast algorithms for these new approximations are also introduced. The proposed methods were evaluated using similarity
metrics with the DCT and encoding measures, as well as
image compression experiments, which establishes their good performance in applications for this purpose.