Abstract:Gaussian mixture noise can model non-Gaussian noise and also be used when outliers are present in measurements. For deterministic maximum likelihood direction finding in Gaussian mixture noise, the Space-Alternating Generalized Expectation-maximization (SAGE) algorithm, an extension of the expectation-maximization algorithm, was applied and designed by Kozick and Sadler twenty odd years ago, which simultaneously updates DOA estimates at each iteration and cannot properly converge under unequal signal powers. In this paper, the Alternating Expectation-Conditional Maximization (AECM) algorithm, an extension of the SAGE algorithm, is applied and designed, which utilizes multiple less informative versions of the complete data and the golden section search method to update DOA estimates at each iteration sequentially (one by one). Theoretical analysis reveals that the AECM algorithm possesses nearly the same computational complexity of each iteration as the SAGE algorithm. However, simulation results prove that the AECM algorithm exhibits faster stable convergence and is more attractive in computation. Importantly, the AECM algorithm, unlike existing subspace based robust DOA estimation methods, can still be used when signals are coherent.
From: Mingyan Gong [view email]
[v1]
Mon, 4 May 2026 08:01:42 UTC (69 KB)
[v2]
Thu, 17 Sep 2026 00:42:02 UTC (248 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。