ML Interference AoA Estimation Method

• The paper introduces a maximum likelihood formulation that caps the log-likelihood to exclude outlier AoA measurements, ensuring robust performance in multipath environments.
• It employs a sequential LMMSE update process that fuses distributed AoA data with low computational complexity, particularly under LOS conditions.
• The method integrates randomized bootstrapping and Bayesian data fusion to effectively suppress NLOS interference and achieve near-optimal localization accuracy.

The maximum likelihood (ML) interference angle-of-arrival (AoA) estimation method encompasses a suite of techniques for robust localization of a signal source using distributed AoA measurements, especially in environments exhibiting multipath and non-line-of-sight (NLOS) propagation. Rooted in a rigorous likelihood-based statistical framework, it is augmented by sequential estimation, outlier suppression, and Bayesian data fusion to achieve near-optimal localization accuracy at tractable computational cost in the presence of uncooperative interference and sporadic measurement corruption.

1. ML Formulation for AoA Measurements: LOS and NLOS Models

Under line-of-sight (LOS) conditions, each AoA measurement $\hat{\theta}_k$ at receiver $k$ is modeled as a Gaussian random variable centered at the true bearing $\theta_k(X)$ with known error variance $\sigma_k^2$:

$$p_{\mathrm{Gaus}}(\hat{\theta}_k \mid X) = \frac{1}{\sqrt{2\pi}\sigma_k(1 - 2Q(\pi/(2\sigma_k)))}\exp\left( -\frac{(\hat{\theta}_k - \theta_k(X))^2}{2\sigma_k^2} \right)$$

where $Q(\cdot)$ is the Gaussian tail probability. The joint log-likelihood for $N$ independent receivers is

$$L(\hat{\theta}_1, ..., \hat{\theta}_N \mid X) = -\sum_{k=1}^N \frac{(\hat{\theta}_k - \theta_k(X))^2}{\sigma_k^2}$$

resulting in an ML estimator for the source position: $$\widehat{X} = \underset{x}{\mathrm{argmin}} \sum_{k=1}^N \frac{(\hat{\theta}_k - \theta_k(x))^2}{\sigma_k^2}$$ This is a nonlinear least squares problem in $x$.

In NLOS conditions, a fraction $k$0 of AoA measurements are uniformly distributed outliers. The per-receiver likelihood becomes a mixture: $k$1 Approximating the mixture by $k$2, the log-likelihood is capped: $k$3 with

$k$4

This capping excludes outlier measurements (large residuals) from overwhelming the fit, yielding robustness in NLOS settings.

2. Sequential ML Estimation via LMMSE Updates

Direct minimization of the ML or capped-loss cost function has exponential complexity due to the subset selection problem in outlier presence. To address this, a low-complexity sequential algorithm is constructed:

• Initialization (“bootstrap”): Select two receivers and triangulate an initial source position.
• At receiver $k$5, transform the prior estimate $k$6 and covariance $k$7 into local polar coordinates.
• Update with new AoA measurement $k$8 via a linear MMSE (Kalman-type) update in polar coordinates:

$k$9

yielding explicit updates for range and angle:

$\theta_k(X)$0

$\theta_k(X)$1

• Transform updated estimates back to global Cartesian and proceed to the next receiver.

In LOS settings, this approach approximates the ML solution as the system accumulates measurements and updates only require $\theta_k(X)$2 cost per receiver, making the total complexity linear in $\theta_k(X)$3. Coordinate transformations between polar and Cartesian are computationally negligible relative to likelihood evaluations.

3. Randomized Bootstrapping and Outlier Suppression in NLOS

To mitigate outliers in NLOS environments, the sequential algorithm is randomized:

• Perform $\theta_k(X)$4 independent “bootstraps” by randomly selecting initiating receiver pairs. Probability of both being LOS is $\theta_k(X)$5.
• For each bootstrap, sequentially aggregate receivers, accepting a new AoA measurement only if all residuals $\theta_k(X)$6 for previously included measurements are below $\theta_k(X)$7.
• If a candidate measurement fails the threshold, it is ignored (outlier suppression).
• Number of bootstraps required for a failure probability $\theta_k(X)$8 is upper bounded as

$\theta_k(X)$9

• For each bootstrap, the cost is $\sigma_k^2$0, and over all bootstraps, $\sigma_k^2$1. With constant $\sigma_k^2$2, complexity is nearly linear in $\sigma_k^2$3.

This randomized sequential procedure ensures that, with high probability, at least one bootstrap aggregates only LOS receivers, causing the sequential update to track the optimal ML solution.

4. Bayesian Framework: Incorporation of Heterogeneous Measurements

The entire estimation process is cast within a Bayesian paradigm:

• At each receiver, the posterior (mean and covariance) about the source location comprises all prior information from earlier receivers’ data fusion.
• The LMMSE update is a Bayesian posterior mean given a Gaussian prior and new (possibly Gaussian-mixed) AoA measurement.
• When additional measurement types (e.g., RSS-based range estimates) are available, the extension is straightforward:

$\sigma_k^2$4

and updating

$\sigma_k^2$5

• Prior knowledge about source location, system constraints, or even additional modalities can be merged seamlessly in this framework.

The Bayesian mixture-likelihood update in NLOS handles outliers probabilistically, ensuring robustness without explicit outlier removal logic.

5. Performance, Complexity, and Scaling Considerations

Performance:

• In LOS environments, the sequential LMMSE update closely approximates ML and achieves near-optimal estimation error.
• In NLOS, the randomized bootstrap approach—by capping outliers and aggregating only consistent measurements—empirically converges to the ML solution as $\sigma_k^2$6 increases.
• For sufficient M (modest for practical outlier rates), performance is essentially as good as the full combinatorial ML search, but with managed complexity.

Complexity and Scalability:

• LOS: Complexity is $\sigma_k^2$7; dominated by sequential updates.
• NLOS: Complexity is $\sigma_k^2$8, with $\sigma_k^2$9 logarithmic in $$p_{\mathrm{Gaus}}(\hat{\theta}_k \mid X) = \frac{1}{\sqrt{2\pi}\sigma_k(1 - 2Q(\pi/(2\sigma_k)))}\exp\left( -\frac{(\hat{\theta}_k - \theta_k(X))^2}{2\sigma_k^2} \right)$$0 and independent of $$p_{\mathrm{Gaus}}(\hat{\theta}_k \mid X) = \frac{1}{\sqrt{2\pi}\sigma_k(1 - 2Q(\pi/(2\sigma_k)))}\exp\left( -\frac{(\hat{\theta}_k - \theta_k(X))^2}{2\sigma_k^2} \right)$$1.
• The algorithm is scalable to large receiver networks, provided enough diversity exists to regularly select consistent (LOS) pairs as initialization.

Implementation:

• Efficient coordinate transformations between polar (local) and Cartesian (global) representations are required.
• The threshold $$p_{\mathrm{Gaus}}(\hat{\theta}_k \mid X) = \frac{1}{\sqrt{2\pi}\sigma_k(1 - 2Q(\pi/(2\sigma_k)))}\exp\left( -\frac{(\hat{\theta}_k - \theta_k(X))^2}{2\sigma_k^2} \right)$$2 must be computed for each receiver, using relevant variances, mixture parameters, and the appropriating capping expression.
• Rao-Blackwellization (maintaining sufficient statistics) ensures that the only messages passed in a cooperative, distributed deployment are the location estimate and covariance.

6. Limitations, Deployment Strategies, and Extensions

Limitations:

• In highly correlated (clustered) NLOS settings, the fraction of consistently available LOS pairs may be diminished, raising the required number of bootstraps.
• Bayesian robustness may deteriorate if the mixture model poorly fits the actual outlier distribution.
• All performance guarantees rest on the accurate knowledge of measurement error variances and mixture parameters ($$p_{\mathrm{Gaus}}(\hat{\theta}_k \mid X) = \frac{1}{\sqrt{2\pi}\sigma_k(1 - 2Q(\pi/(2\sigma_k)))}\exp\left( -\frac{(\hat{\theta}_k - \theta_k(X))^2}{2\sigma_k^2} \right)$$3); adaptive estimation of these hyperparameters is required in operational systems.

Deployment:

• The algorithm is well-suited for sensor networks, cooperative localization in vehicular systems, and distributed radio interferometry where receivers collect directional measurements in the presence of spatially inhomogeneous multipath environments.
• Parallelization is inherent in the bootstrap process; receivers can asynchronously attempt different aggregations with minimal coordination.

Extensions:

• Integration with other modalities (e.g., broadcast time-of-arrival, vehicle odometry) is immediate via the Bayesian update formalism.
• For wideband systems, path resolution allows the algorithm to operate on per-path AoAs, exploiting the extra diversity in multipath for improved performance.
• The likelihood mixture model can be generalized beyond uniform outlier distributions to more complex, empirically derived contamination distributions.

7. Summary Table: ML Interference AoA Algorithmic Structure

Component	Operation	Complexity
LOS Sequential LMMSE	Sequential per-receiver fusion of AoA	$$p_{\mathrm{Gaus}}(\hat{\theta}_k \mid X) = \frac{1}{\sqrt{2\pi}\sigma_k(1 - 2Q(\pi/(2\sigma_k)))}\exp\left( -\frac{(\hat{\theta}_k - \theta_k(X))^2}{2\sigma_k^2} \right)$$4
NLOS Bootstrapping	Randomized initialization, LMMSE aggregation up to threshold	$$p_{\mathrm{Gaus}}(\hat{\theta}_k \mid X) = \frac{1}{\sqrt{2\pi}\sigma_k(1 - 2Q(\pi/(2\sigma_k)))}\exp\left( -\frac{(\hat{\theta}_k - \theta_k(X))^2}{2\sigma_k^2} \right)$$5
Bayesian Modal Fusion	Kalman update with prior+AoA/range/RSS	$$p_{\mathrm{Gaus}}(\hat{\theta}_k \mid X) = \frac{1}{\sqrt{2\pi}\sigma_k(1 - 2Q(\pi/(2\sigma_k)))}\exp\left( -\frac{(\hat{\theta}_k - \theta_k(X))^2}{2\sigma_k^2} \right)$$6 per update

This approach leverages robust likelihood modeling, efficient sequential data fusion, and outlier suppression via randomized bootstrapping to provide maximum-likelihood level accuracy for cooperative AoA-based source localization, even under adversarial multipath conditions, at computational cost compatible with large-scale deployments (Ananthasubramaniam et al., 2012).