]*>","")" /> 二维离散W变换的快速算法及其应用

• 论文 •

### 二维离散W变换的快速算法及其应用

1. 国防科技大学七系;空军导弹学院
• 出版日期:1997-01-20 发布日期:1997-01-20

### A FAST ALGORITHM FOR 2D DISCRETE W TRANSFORM AND ITS APPLICATION

1. Zeng Yonghong (Department 7, National University of Defense Technology)Zhang Xiaoshi(Air Force Missile Technology Institute)
• Online:1997-01-20 Published:1997-01-20
In this paper, a 2D discrete W transform is turned to another 2D discrete transform.The kernel of the resulting transform is separable, thus it can be computed by the wellknown row-column algorithm. Therefore, a fast algorithm is obtained for 2D DWT witharbitrary length. Methods are also given in the paper for computing 2D cyclic convolutions,2D skew-cyclic convolutions and 2D generalized discrete Fourier transforms by 2D discreteW transform. Furthermore, running time of the algorithms on a kind of micro computeris given.
()
 [1] R. N. Bracewell, Discrete Hartley transform, J. Opt. Soc. Amer 73(1983), 1832—1835. [2] Z.D. Wang et al, The discrete W transform, Appl. Math. Comput, 16(1985), 19-48. [3] Proceedings of IEEE, Vol. 82, No. 3, 1994 (special section on the Hartley transform). [4] Y.H. Zeng, A fast algorithm for discrete Hartley transform of arbitrary length, Journal of Electronics10:3(1993),209-216. [5] Y.H. Zeng, A parallel algorithm for DWT and GFT, Proceedings of IEEE TECON’93, InternationalAcademic Publishers, Vol. 3, 361-364. [6] 曾泳泓,蒋增荣,任意长度W变换的统一算法及其实现,计算数学,18:3(1996),321—327 [7] 王中德,快速W变换——算法与程序,中国科学(A辑),1988年第5期, 549-560。 [8] 蒋增荣,曾泳泓,余品能,快速算法,国防科技大学出版社,1994. [9]付 彬,曾泳泓,任意长度GFT的W变换算法,数值计算与计算机应用,15 :3(1994),213—220 [10]曾泳泓,离散卷积的W变换算法,计算数学,17:1(1995),37-46。 [11]付彬,任意长度DFT的快速算法及并行算法,硕士学位论文,国防科大研究生院, 1992
 No related articles found!