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 requireme...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 fast algorithm is also discussed.展开更多
基金湖南省教育厅重点资助项目(09A002[2009])FEDER Funds through"Programa Operacional Factores de Competitividade COMPETE"+1 种基金Portuguese Funds through FCT within the Project PEstC/MAT/U10013/2011 and PTDC/MAT/112273/2009Portugal资助
基金This work is supported by National Natural Science Foundation of China No. 10271099.Received: Sep. 25, 2004.
文摘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 fast algorithm is also discussed.
