Abstract. A matrix method is proposed for constructing a simple order-32 integer cosine transform. Based on the method proposed, a one-norm simple order-32 integer transform is constructed and its fast algorithms of low computational complexity are developed that require only integer operations and whose computational complexity is 4.9 times less than those of the well-known algorithms and is 21.6 times less than that of the standard H.2 65. This transform is close to the discrete cosine transform and has good coding performance.
Keywords: discrete cosine transform, integer cosine transform, scaled transform, factorization, fast transform, coding gain, computational complexity, compression ratio, video coding, H.264, H.265, AVS.
1 V. M. Glushkov Institute of Cybernetics, National Academy of Sciences of Ukraine, Kyiv, Ukraine,
e-mail: levhnativ@gmail.com.