Fast discrete sine transform algorithms (Q2277805)

Several algorithms for the discrete sine transform (DST) have been developed in the last few years. The relationship between the discrete cosine transform (DCT) and DST which was established by the author [IEEE Trans. Acoust. Speech Signal Process. ASSP-30, 814-815 (1982; Zbl 0565.65090)] enables one to compute either of the foregoing discrete transforms via algorithms for the other. The algorithms given by \textit{P. Yip} and \textit{K. R. Rao} [Circuits Syst. Signal Process. 3, 387-408 (1984; Zbl 0572.65120)] possess a simple structure but they suffer from the disadvantage of using secant multipliers. The algorithm given by \textit{P. Yip} and \textit{K. R. Rao} [IEEE Trans. Commun., COM-28, 304-307 (1980; Zbl 0422.68008)] uses cosines and sines as multipliers but contains some errors [see the author, IEEE Trans. Commun., COM-34, 204-205 (1986; Zbl 0588.68016)] and is hard to implement. The author presents new algorithms for DST with very simple structure which require a minimum number of arithmetic operations.