快速子空间谱峰搜索方法  

New peak searching method in subspace spectrum

作　　者：曾浩[1] 张迎辉[1] 冯文江[1] 

机构地区：[1]重庆大学通信工程学院,重庆400030

出　　处：《计算机应用》2009年第9期2546-2547,2567,共3页journal of Computer Applications

基　　金：国家自然科学基金资助项目(60672097);重庆市自然科学基金资助项目(2008BB2310)

摘　　要：利用信号子空间和噪声子空间正交性,可以实现超分辨波达方向(DOA)估计。但实现过程中,谱峰搜索运算量相当大,影响了系统的实时性。新算法在谱峰搜索时,首先设置一个门限,然后通过大步进搜索,寻找出高于门限的谱峰所在一个邻域,再在该邻域内进行小步进搜索,寻找出准确谱峰。介绍了新算法的原理和步骤,并对算法性能进行分析。计算机仿真表明,新算法在实现相同分辨率的性能条件下,比传统谱峰搜索方法减少40%～50%的运算量。The orthogonality between the signal subspace and the noise subspace is widely employed to implement the Direction of Arrival （DOA） estimation. However, it is hard to seek the spectrum peak in real time due to the large computing load. The new algorithm configured a threshold firstly so that all intervals including the peaks could be located by large searching step. Furthermore, small searching step was proposed to find out the desired spectrum peaks in these intervals. The principle, implementation and performance of the new approach were addressed. Last but not least, the computer simulations illustrate that the new strategy reduces the computing load by 40% to 50%.

关 键 词：波达方向估计 子空间 空间谱 搜索步进 谱峰 

分 类 号：TN958[电子电信—信号与信息处理]