实值离散多窗Gabor变换窗函数求解快速算法  

Fast algorithm for window computation in multi-window real-valued discrete Gabor transform

作　　者：周高明[1] 陶亮[1] 王华彬[1] 李锐[1] 

机构地区：[1]安徽大学计算智能与信号处理教育部重点实验室,安徽合肥230039

出　　处：《安徽大学学报（自然科学版）》2015年第5期31-36,共6页Journal of Anhui University(Natural Science Edition)

基　　金：国家自然科学基金资助项目(61372137);安徽大学信息保障技术研究中心课题(ADXXBZ2014-11)

摘　　要：针对多窗实值离散Gabor变换(real-valued discrete Gabor transform,简称RDGT),综合窗簇与分析窗簇之间双正交性关系的窗函数计算复杂性高的问题,提出一种快速窗函数求解算法.该方法利用快速离散Hartley变换(discrete Hartley transform,简称DHT)及Hartley函数的正交性简化了窗函数的双正交条件关系式,从而降低窗函数计算复杂度.实验结果表明了该快速算法的高效性.To reduce the high complexity of the window computation using the biorthogonal relationship between the synthesis windows and the analysis windows in the multi-window real-valued discrete Gabor transform（M-RDGT）,this paper presented a fast algorithm.It made the bi-orthogonal condition of computing basic window functions simpler by using fast discrete Hartley transform（DHT）and the orthogonality of the Hartley functions so that the computational complexity could be reduced.The experimental results of the algorithm also indicated that the proposed fast algorithm was more effective.

关 键 词：实值离散GABOR变换 多窗 快速算法 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]