Discrete cosine-sine transform and fast 16-point integer cosine-sine transform low-complexity for video coding

arXiv:2610.32987v1 Announce Type: new Abstract: A matrix method for constructing a discrete cosine-sine transform of order N is proposed, upon which discrete and integer cosine-sine transforms of order 16 are constructed. A fast algorithm for computing an integer cosine-sine transform of order-16 with low multiplicative complexity, which is 8.25 times smaller and requires 115% more addition operations compared to the fast discrete cosine-sine transform algorithm, is presented.