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.
fast algorithm DST first-order moment structure Ml structure M2
Tingting Luo J. G. Liu
Institute for Pattern Recognition and Artificial Intelligence, Huazhong University of Science and Technology Wuhan, China
国际会议
武汉
英文
10-15
2011-10-21(万方平台首次上网日期,不代表论文的发表时间)