NEW FAST DISCRETE HARTLEY TRANSFORM ALGORITHM

被引:11
|
作者
CHAN, YH [1 ]
SIU, WC [1 ]
机构
[1] HONG KONG POLYTECH,DEPT ELECTR ENGN,KOWLOON,HONG KONG
关键词
TRANSFORMS; ALGORITHMS;
D O I
10.1049/el:19910220
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
A new algorithm is proposed that enables the realisation of a discrete Hartley transform with the lowest number of multiplications yet reported. This algorithm also achieves the minimum number of additions compared with the reported algorithms achieving the same minimum number of multiplications.
引用
收藏
页码:347 / 349
页数:3
相关论文
共 50 条