SPLIT RADIX AIGORITHMS FOR LENGTH pm DHT s

Mao Yimin

Volume 12 Issue 6

Nov. 1990

Turn off MathJax

Article Contents

Article Navigation > Journal of Electronics & Information Technology > 1990 > 12(6): 584-592

Mao Yimin. SPLIT RADIX AIGORITHMS FOR LENGTH pm DHT s[J]. Journal of Electronics & Information Technology, 1990, 12(6): 584-592.

Citation:

Mao Yimin. SPLIT RADIX AIGORITHMS FOR LENGTH pm DHT s[J]. Journal of Electronics & Information Technology, 1990, 12(6): 584-592.

Mao Yimin. SPLIT RADIX AIGORITHMS FOR LENGTH pm DHT s[J]. Journal of Electronics & Information Technology, 1990, 12(6): 584-592.

Citation:

Mao Yimin. SPLIT RADIX AIGORITHMS FOR LENGTH pm DHT s[J]. Journal of Electronics & Information Technology, 1990, 12(6): 584-592.

PDF( 1146 KB)

SPLIT RADIX AIGORITHMS FOR LENGTH pm DHT s

Mao Yimin

Received Date: 1989-01-04
Rev Recd Date: 1990-07-23
Publish Date: 1990-11-19

Abstract

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.

FullText(HTML)

References(1)

References

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页.

Relative Articles

Supplements(0)

Cited By

Proportional views