时间平滑ML协方差矩阵估计算法及性能分析  

Time Smoothing ML Estimation of Convariance Matrix and Performance Analysis

作　　者：曾浩[1] 刘玲[1] 覃剑[1] 谭晓衡[1] 

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

出　　处：《系统仿真学报》2007年第19期4517-4520,共4页Journal of System Simulation

基　　金：重庆市自然科学基金(2005BB2195);重庆大学自然科学基金(CD2007056)。

摘　　要：以最少的快拍数得到最好性能的协方差矩阵估计是我们追求的目标,虽然这很难实现。由于对称阵列的协方差矩阵具有中央Hermitian性质,因而可以在协方差矩阵估计中加以利用。这种性质,体现在通过时间域平滑。分析给出了新算法的实现方法和概率密度函数,并通过MonteCarlo仿真,对算法的各种性能进行分析,表明该算法在相同快拍数时,比传统最大似然算法具有更小的误差性能。To get the best performance with the least snapshots is the ideal object when the covariance matrix is estimated, although it is not easy. However, the covariance matrix of a symmetrical array antenna has central Hermitian property. A new technique was developed to estimate the covariance matrix, which smoothes the estimated covariance matrix in time domain according to the central Hermitian properly. The density function was proposed. The Monte Carlo simulations show that this algorithm has the less estimation bias than general maximum likelihood estimation even with the same snapshots.

关 键 词：协方差矩阵 中央Hermitian矩阵 最大似然 波束合成器 

分 类 号：TN911[电子电信—通信与信息系统]