Hankel矩阵离散Sine变换的快速算法

Fast Discrete Sine Transform Algorithm for Hankel Matrices

利用Hankel矩阵的结构特点导出一递推关系式,给出了Hankel矩阵离散Sine变换(DST)的一个快速算法.该算法所需要的存贮空间为O(N),计算变换矩阵的M个元素所需的计算量为O (NlogN)+O(M).

In this paper, a fast algorithm for the discrete sine transform（DST）of a Hankel matrix of order N is derived. Only time is needed for the computation of M elements. The auxiliary storage is also required.