系统工程与电子技术

• 电子技术 • 上一篇    下一篇

独立源与相干源并存的信源数估计

毛维平1, 李国林2, 谢鑫2, 王凌1   

  1. (1.海军航空工程学院研究生管理大队, 山东 烟台 264001;2. 海军航空工程学院七系, 山东 烟台 264001)
  • 出版日期:2014-03-24 发布日期:2010-01-03

Source number estimation of coexisting uncorrelated and coherent sources

MAO Weiping 1, LI Guolin2, XIE Xin2, WANG Ling 1   

  1. (1. Graduate Students’ Brigade, Naval Aeronautics and Astronautics University, Yantai 264001, China;
    2. Department 7, Naval Aeronautics and Astronautics University, Yantai 264001, China)
  • Online:2014-03-24 Published:2010-01-03

摘要:

大多数子空间类谱估计算法,需要预先估计信源个数,而且当信号源相干或强相关时,不能直接应用基于信息论的估计方法。针对接收信号为独立源与相干源并存的情况,提出一种新的基于矩阵重构的信源数估计算法。算法利用各个阵元接收数据与参考阵元接收数据的互相关信息,构造一个Toeplitz等效协方差矩阵解相干。理论分析证明,相比于复信号解相干的常规Toeplitz矩阵重构方法,算法节省一半的阵列孔径,而且对噪声发散性有一定抑制作用。基于此构造矩阵采用特征子空间投影与特征值加权的方法构造判决函数来估计信源个数,仿真结果表明,算法在独立源和相干源并存的情况下,能准确估计出信源个数,性能优于空间平滑Akaike信息论准则法和空间平滑最小描述长度法。

Abstract:

Detecting the source number is an important step to eigensubspace spatial spectrum estimation algorithms.Information theory methods are not applicable to cope with the situation where both uncorrelated and coherent sources exist.A novel method based on matrix reconstruction is proposed to solve this problem. A Toeplitz equivalent covariance matrix is reconstructed by using crosscorrelation information of the receiving data from arrays.To some extent,the constructed matrix can reduce the spreading of the noise eigenvalues.Compared with the conventional method using the first vector of the covariance matrix to construct a decoherence Toeplitz matrix,the proposed algorithm has better decoherence performance and avoids the loss of array physical aperture.Ultimately,the proposed algorithm utilizes weighted eigen subspace projection method to estimate the source number.Computer simulation confirms that the algorithm can accurately estimate the number of sources mixed with uncorrelated and coherent sources and has better performance compared with spatial smoothing Akaike information criterion and spatial smoothing minimum description length algorithms.