長(zhǎng)度為pm的離散哈脫萊變換分離基算法
SPLIT RADIX AIGORITHMS FOR LENGTH pm DHT s
-
摘要: Soo-Chang Pei,Ja-Ling wu(1986)和茅一民(1987)提出了長(zhǎng)度為2m的分離基2/4哈脫萊變換算法。本文將分離基算法推廣到長(zhǎng)度為pm的哈脫萊變換,并證明基p2算法實(shí)乘次數(shù)比基p算法少,而基p/p2算法實(shí)乘次數(shù)比前兩者都少。作為例子,給出了長(zhǎng)度為N=3m的基3/9哈脫萊變換快速算法和流圖。
-
關(guān)鍵詞:
- 正交變換; 離散哈脫萊變換; 分離基算法
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]茅一民,數(shù)據(jù)采集與處理,1987年,第3期,第7-13頁(yè). -
計(jì)量
- 文章訪問(wèn)數(shù): 2187
- HTML全文瀏覽量: 182
- PDF下載量: 359
- 被引次數(shù): 0
下載:
