A fast algorithm for discrete sine transform using first-order moment

A fast algorithm for discrete sine transform (DST) is proposed. Through derivation the traditional DST is transformed into the computation of a first-order moment, which can be implemented by a simple parallel structure without multiplications. The comparison with some existing methods on the computation and the hardware complexity shows the advantage of our method under certain conditions. The approach is also applicable to other discrete sine transforms.