Abstract. Matrix methods to construct simple fast integer order 16 type I, II cosine transforms of low complexity are considered. The new approach and a generalized method are proposed to construct fast integer order 8 cosine transforms and their fast algorithms without multiplication are developed. A new integer step transform with fast algorithm is introduced. Two transforms whose speed is 1.7 to 2.9 times greater and which provide higher quality of video coding than standard H.265 are proposed.

Keywords: discrete cosine transform, integer cosine transform, integer step transform, fast algorithms, coding efficiency, computational complexity, video coding standards.