排序方式： 共有1条查询结果，搜索用时 15 毫秒
1
1.
A fast algorithm for the discrete cosine transform (DCT) 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 storage requirement is O (N ). The method carries over to other transforms (DFT, DST) and to Hankel or circulant matrices. Some applications of the algorithm are discussed 相似文献
1