Abstract
This paper presents an efficient optimization technique for super-resolution two-dimensional (2D) direction of arrival (DOA) estimation by introducing a new formulation of atomic norm minimization (ANM). ANM allows gridless angle estimation for correlated sources even when the number of snapshots is far less than the antenna size, yet it incurs huge computational cost in 2D processing. This paper introduces a novel formulation of ANM via semi-definite programming, which expresses the original high-dimensional problem by two decoupled Toeplitz matrices in one dimension, followed by 1D angle estimation with automatic angle pairing. Compared with the state-of-the-art 2D ANM, the proposed technique reduces the computational complexity by several orders of magnitude with respect to the antenna size, while retaining the benefits of ANM in terms of super-resolution performance.
Introduction
Determining the 2D direction (azimuth and elevation) of incoming signals is a fundamental task in wireless communications and radio astronomy. Traditional subspace methods like MUSIC or ESPRIT require a large number of signal snapshots and struggle with highly correlated or "coherent" signals. Atomic Norm Minimization (ANM) emerged as a "gridless" compressed sensing technique capable of resolving angles with super-resolution from even a single snapshot. However, standard 2D ANM is computationally prohibitive; its Semi-Definite Programming (SDP) formulation involves matrix sizes that scale with the product of the number of antennas ($N \times M$), making it intractable for real-time large-scale systems like massive MIMO.
Proposed Method: Decoupled ANM (D-ANM)
To overcome this bottleneck, the authors propose Decoupled Atomic Norm Minimization (D-ANM). The core innovation lies in mathematically decoupling the 2D optimization problem into two smaller 1D problems:
- Decoupled Atom Set: A new atom set is introduced that separates the $x$ and $y$ dimensions of the 2D array manifold.
- SDP Reformulation: The authors prove that the 2D atomic norm can be computed using two decoupled, one-level Toeplitz matrices. This reduces the SDP constraint size from $(NM + 1) \times (NM + 1)$ to $(N + M) \times (N + M)$, shifting complexity from $O(N^{3.5}M^{3.5})$ to approximately $O((N+M)^{3.5})$.
- 1D Processing & Pairing: Once the optimization is solved, angles are extracted via 1D Vandermonde decomposition. An automatic angle pairing technique based on maximum correlation ensures correct azimuth-elevation matching.
Experimental Evaluation
The proposed D-ANM was validated using synthetic datasets in Monte Carlo simulations. Square antenna arrays (up to $22 \times 22$) received signals from $K=4$ far-field sources. Performance was measured by computational run time and Mean Square Error (MSE) relative to the Cramer-Rao Bound (CRB).
Computational Efficiency
The primary advantage of D-ANM is its dramatic reduction in processing time. As shown in the run time analysis, the computational cost for D-ANM remains significantly lower than the traditional vectorized approach as the number of antennas increases. For a $22 \times 22$ array, D-ANM achieved a solution in approximately 1.49 seconds, compared to 733.18 seconds for vectorized ANM—a speedup of nearly 500x.
Estimation Accuracy
Crucially, this gain in efficiency does not come at the cost of precision. D-ANM maintains the gridless accuracy of standard ANM, avoiding the "off-grid" errors typical of traditional compressed sensing. As illustrated in the MSE performance plot, the accuracy of D-ANM estimates closely tracks both the vectorized ANM results and the theoretical CRB across a wide range of Signal-to-Noise Ratios (SNR).
Conclusion
D-ANM transforms 2D DOA estimation from a computationally "near intractable" problem into a feasible real-time task for large-scale antenna systems. By leveraging the power of decoupling, it provides super-resolution performance with massive speedups. Future work will involve testing the algorithm on real-world RF hardware and exploring its application in higher-dimensional sensing and compressed data environments.
Summary updated