快速Hartley变换的一种新算法  

A new fast Hartley transform algorithm

作　　者：吴一全[1] 王厚枢[1] 

机构地区：[1]南京航空航天大学电子学工程系信号处理组,南京210016

出　　处：《声学学报》1993年第5期386-390,共5页Acta Acustica

摘　　要：快速Hartley变换(FHT)可取代FFT而广泛用于声信号的分析与处理.本文提出了FHT的一种新算法,并与现有的其他几种FHT算法作了运算量的比较.本文提出的算法所需运算量最少,数值稳定,结构简单规则,易于实现.该算法已用软件实现,并在实际中得到应用.The fast Hartley transform can replace FFT to find wide applications in acoustic signal analysis and processing. A new FHT algorithm is proposed in this paper and a comparison is made with other existing FHT algorithms. The proposed algorithm requires the minimum number of arithmetic operations and it is numerically stable. Its simple and regular structure make it easy to be implemented. This algorithm has been implemented by software and has been finding practical applications.

关 键 词：HARTLEY变换 算法 音响信号 

分 类 号：TN912.16[电子电信—通信与信息系统]