论文部分内容阅读
本文采用时域分解和频域分解方法导出哈脱莱变换的一种新快速算法——分离基算法。利用离散哈脱莱变换和DFT之间的关系得出同样的结果。该算法所需乘法和加法次数在现有长度为N=2~m的算法中是最少的。文中给出了算法流图,并与其他算法作了运算量的比较。
In this paper, we derive a new fast algorithm of the Halei-Laplace transform-time-domain decomposition and frequency-domain decomposition. The same result is obtained using the relationship between the discrete Haleiotransform and DFT. The number of multiplications and additions required by this algorithm is the least among the existing algorithms of length N = 2 ~ m. The paper gives the flow chart of the algorithm and compares it with other algorithms.