长度为pm的离散哈脱莱变换分离基算法
SPLIT RADIX AIGORITHMS FOR LENGTH pm DHT s
-
摘要: Soo-Chang Pei,Ja-Ling wu(1986)和茅一民(1987)提出了长度为2m的分离基2/4哈脱莱变换算法。本文将分离基算法推广到长度为pm的哈脱莱变换,并证明基p2算法实乘次数比基p算法少,而基p/p2算法实乘次数比前两者都少。作为例子,给出了长度为N=3m的基3/9哈脱莱变换快速算法和流图。
-
关键词:
- 正交变换; 离散哈脱莱变换; 分离基算法
Abstract: The split radix approach is generalized to length pm Discrete Hardy Transform (DHT). It is shown that the radix p/p2 algorithm is superior to the radix p2 and radix p algorithms in number of real multiplications. As an example, a radix 3/9 algorithm is developed for length-3m DHT, and the signal flowgraph is given. -
J. W. Cooley, J. W. Tukey, Moth. Comput., 19(1964)4, 297-301.[2]Soo-Chang Pei, Ja-Ling Wu, Electron. Lett., 22(1986)1, 26-27.[3]茅一民,数据采集与处理,1987年,第3期,第7-13页. -
计量
- 文章访问数: 2174
- HTML全文浏览量: 178
- PDF下载量: 359
- 被引次数: 0
下载:
