具有迭代结构的时频分布计算方法  

Computationally efficient time-frequency distribution with recursive structure

作　　者：李滔[1] 汤建龙[1] 杨绍全[1] 

机构地区：[1]西安电子科技大学电子工程学院,陕西西安710071

出　　处：《电路与系统学报》2006年第3期96-100,95,共6页Journal of Circuits and Systems

基　　金：国防预研资助项目(41101030103)

摘　　要：本文讨论了时频分布中的迭代算法的问题。通过选择特殊的计算窗口,时频分布的迭代运算形式能够有效地利用前面数据段的分析结果,从而避免了重复性的运算,使得计算效率得到提高。本文对原有的利用单边窗口的时频分布迭代算法的性能进行了分析,提出了采用对称型窗口的迭代计算形式。与单边窗口相比,双边形式的计算窗口不但可以有效地提高时频表示精度,同时还能够更为准确的表示信号的瞬时频率。文章对各项理论分析结果提供了相应的仿真实验结果。This paper discusses the application of iteration algorithm in time-frequency representation. With special computational window, recursive operations can be introduced which incorporate knowledge of the time-frequency distribution from previous data blocks into the current estimate and greatly increase the computation efficiency. The analysis shows that compared with time-frequency distributions using single-sided window, those with symmetrical computational window could improve the resolution and have more accurate representation of the instantaneous frequency. Finally corresponding simulations are provided.

关 键 词：迭代算法 时频分布 指数遗忘分布 

分 类 号：TN971.1[电子电信—信号与信息处理]