| 长度为p~m的离散哈脱莱变换分离基算法 |
| |
| 引用本文： | 茅一民.长度为p~m的离散哈脱莱变换分离基算法[J].电子与信息学报,1990(6). |
| |
| 作者姓名： | 茅一民 |
| |
| 作者单位： | 东南大学 南京 |
| |
| 摘 要： | Soo-Chang Pei,Ja-Ling wu(1986)和茅一民(1987)提出了长度为2(?)的分离基2/4哈脱莱变换算法。本文将分离基算法推广到长度为P(?)的哈脱莱变换,并证明基P~2算法实乘次数比基p算法少,而基P/P~2算法实乘次数比前两者都少。作为例子,给出了长度为N=3(?)的基3/9哈脱莱变换快速算法和流图。
|
| 关 键 词： | 正交变换 离散哈脱莱变换 分离基算法 |
SPLIT RADIX AIGORITHMS FOR LENGTH p~m DHT's |
| |
| Mao Yimin.SPLIT RADIX AIGORITHMS FOR LENGTH p~m DHT''''s[J].Journal of Electronics & Information Technology,1990(6). |
| |
| Authors: | Mao Yimin |
| |
| 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. |
| |
| Keywords: | Orthogonal transform Discrete Hartley transform Split radix algorithm |
| 本文献已被 CNKI 等数据库收录！ |
