6 August 2018 in International Journal of Antennas and Propagation
Most popular techniques for super-resolution direction of arrival (DOA) estimation rely on an eigen-decomposition (EVD) or a singular value decomposition (SVD) computation to determine the signal/noise subspace, which is computationally expensive for real-time applications. A two-step root multiple signal classification (TS-root-MUSIC) algorithm is proposed to avoid the complex EVD/SVD computation using a uniform linear array (ULA) based on a mild assumption that the number of signals is less than half that of sensors. The ULA is divided into two subarrays, and three noise-free cross-correlation matrices are constructed using data collected by the two subarrays. A low-complexity linear operation is derived to obtain a rough noise subspace for a first-step DOA estimate. The performance is further enhanced in the second step by using the first-step result to renew the previous estimated noise subspace with a slightly increased complexity. The new technique can provide close root mean square error (RMSE) performance to root-MUSIC with reduced computational burden, which are verified by numerical simulations.
6 February 2025 in IEEE Signal Processing Letters
In this letter, we propose the Bi-nuclear Schatten-p norm minimization (BSNM) for coprime array to achieve the efficient direction of arrival (DOA) estimation. Specifically, BSNM factorizes a large Hermitian Toeplitz covariance matrix as the product of two small matrices, which not only improves the computational efficiency but also captures the low-rank property of the interpolated covariance matrix. This BSNM problem of the Hermitian Toeplitz matrix is then solved by a parallel alternating optimization algorithm. Finally, the recovered covariance matrix is applied to estimate the DOA via the MUSIC algorithm. Numerical simulation illustrates the superiority of the proposed BSNM method over state-of-the-art methods in terms of computational efficiency.
13 November 2024 in IEEE Transactions on Aerospace and Electronic Systems
The well-known minimum variance distortion-less response (MVDR) beamformer's computational complexity focuses on the inverse of sample covariance matrix (SCM), especially for the high-dimensional complex-valued SCM. To reduce the computational complexity of SCM's inversion in MVDR beamformer, we develop a multi-stage forward/backward (FB) averaging scheme for SCM, which will make the original complex-valued SCM progressively become a real-valued block diagonal matrix. In addition, this real-valued block diagonal matrix is composed of two half-dimensional sub- matrices. Therefore, we can transform the inverse of the entire complex-valued matrix into the half-dimensional and real-valued sub-matrix's inversion. Using this multi-stage FB averaging scheme, the two-stage FB averaging based unitary MVDR (TFB-U-MVDR) and the four-stage FB averaging based unitary MVDR (FFB-U-MVDR) beamforming algorithms are proposed in this paper, which are tailored for the special structure of centro-symmetric arrays (CSAs). Numerical simulation demonstrates that the proposed algorithms based on the multi-stage FB averaging scheme perform well in small snapshots support and have higher computational efficiency compared to exiting efficient MVDR beamformers
29 August 2025 in IEEE Transactions on Signal Processing
The performance of adaptive beamforming may degrade dramatically in a highly dynamic environment, because the directions of arrival (DOAs) of targets and interferences can change rapidly. To address this problem, we propose here to introduce additional mainlobe-level and sidelobe-level constraints in the design problem, with the goal to broaden the mainlobe and the nulls of the beampattern. However, the solution of the resulting optimization problem with non-convex constraints has high computational complexity. To reduce it, we propose to transform the complex-valued non-convex constrained optimization problem into a real-valued convex constrained one by performing a unitary transformation, which is suitable for centro-symmetric arrays (CSA). Then, the problem is decomposed into multiple unconstrained optimization sub-problems that can be solved iteratively using the standard alternating direction method of multipliers (S-ADMM) method. To improve further the convergence speed, we then develop an over-relaxed ADMM (OR-ADMM) by exploiting the principle of relaxation. Numerical simulation demonstrates the robustness and the convergence speed improvements of the proposed OR-ADMM in a highly dynamic environment.