A new radix-3 fast algorithm for computing the DST-II
Yiquan Wu, Zhaoda Zhu · 2002
In this paper a new radix-3 fast algorithm for the length-3/sup m/ Discrete Sine Transform (DST-II) is proposed, to further extend the applicability of the Fast Sine Transform (FST) algorithm. First, the basic 3-point DST is considered. Then, the formulae of the new radix-3 FST algorithm are derived. Next, a block diagram of the radix-3 FST algorithm is shown and the signal flowgraph for length-3/sup 2/ FST is given to illustrate the proposed algorithm. Finally, the computational complexity is analysed. The proposed algorithm requires arithmetic and allows in-place computation. The simple and regular structure makes it easy to implement. One can compute effectively the length-2/sup 1//spl middot/3/sup m/ DST-II using this length-3/sup m/ algorithm together with the existing length-2/sup 1/ algorithm by prime factor decomposition.