论文部分内容阅读
In this paper, a fast algorithm for the discrete sine transform(DST) of a Toeplitz matrix of order N is derived. Only O(N log N) + O(M) time is needed for the computation of M elements. The auxiliary storage requirement is O(N). An application of the new