两相干源情况下的简化最大似然算法研究  

A Research on Simplified Maximum Likelihood Algorithm with Two Coherent Sources

作　　者：佘彩云[1] 陶海红[1] 廖桂生[1] 

机构地区：[1]西安电子科技大学雷达信号处理国家重点实验室,西安710071

出　　处：《弹箭与制导学报》2010年第3期169-172,共4页Journal of Projectiles,Rockets,Missiles and Guidance

基　　金：国家自然科学基金(60502045);国家自然科学基金(60736009);国家杰出青年科学基金(60825104)资助

摘　　要：简化最大似然算法通过快速傅里叶变换处理,大大降低了传统最大似然算法运算量,但存在相干源时运算量仍然很大。为了降低其运算量,文中研究了两相干源情况下的简化最大似然算法:在强弱相干源的情况下分离相干源;在等幅或幅度相差较小的两相干源情况下,利用均匀L+1阵,直接降维扫描,有效降低了两相干源情况下的简化最大似然法的运算量。仿真结果和性能分析验证了该方法的有效性和可行性。With the simplified maximum likelihood algorithm, the computing complexity of the traditional maximum likelihood mehod is reduced by fast Fourier transform （FFT）, but its computing complexity is still large when coherent sources exist. In this paper, the simplified maximum likelihood algorithm in the situation of the two coherent sources was researched to reduce the computing complexity. The two coherent sources can be distinguished when one is strong and the other is week. When the two sources with equal amplitude or nearly equal amplitude, they can be classified directly by using the L＋1 even array. The simulation results and performance analysis demonstrate that the algorithm is effective and feasible.

关 键 词：简化最大似然法 相干源 强弱信号 均匀L+1阵 

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