Abstract. Matrix method of constructing one-norm high integer cosine transform is proposed. The one-norm order-32 integer transform is constructed and its fast algorithms of low computational complexity are developed, whose computational complexity is 3.24 times less than that in the well-known algorithms and is 15.6 times less than one in standard H.265 and requires integer operations only. This transform is not only very close to the discrete cosine transform, but also has excellent coding performance.

Keywords: discrete cosine transform, integer cosine transform, scaled transform, factorization, fast transform, coding gain, computational complexity, compression ratio, video coding, Н.264, H.265,AVS.