POLYNOMIAL TRANSFORM FAST HARTLEY TRANSFORM

被引:6
|
作者
CHAN, SC
HO, KL
机构
[1] Department of Electrical and Electronics Engineering, University of Hong Kong, Pokfulam Road
关键词
Transforms;
D O I
10.1049/el:19901233
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
A fast algorithm for computing the two-dimensional discrete Hartley transform (2D-DHT) based on the polynomial transform is presented. Using a simple relation between the discrete Fourier transform (DFT) and the DHT, it is found that the 2D-DHT can be mapped, by means of the polynomial transform, to a number of one-dimension type III discrete W transforms (DWT-III). An improved fast algorithm for computing the DWT-III is also proposed. © 1990, The Institution of Electrical Engineers. All rights reserved.
引用
收藏
页码:1914 / 1916
页数:3
相关论文
共 50 条