Sparsity-Aware Noise Subspace Fitting for DOA Estimation

We propose a sparsity-aware noise subspace fitting (SANSF) algorithm for direction-of-arrival (DOA) estimation using an array of sensors. The proposed SANSF algorithm is developed from the optimally weighted noise subspace fitting criterion. Our formulation leads to a convex linearly constrained quadratic programming (LCQP) problem that enjoys global convergence without the need of accurate initialization and can be easily solved by existing LCQP solvers. Combining the weighted quadratic objective function, the ℓ 1 norm, and the non-negative constraints, the proposed SANSF algorithm can enhance the sparsity of the solution. Numerical results based on simulations, using real measured ultrasonic, and radar data, show that, compared to existing sparsity-aware methods, the proposed SANSF can provide enhanced resolution with a lower computational burden.

Performance analysis of direction of arrival algorithms for Smart Antenna

<p>This paper presents the performance analysis of the direction of arrival estimation algorithms such as Estimation of Signal Parameters via Rotational Invariance Technique (ESPRIT), Multiple Signal Classification (MUSIC), Weighted Subspace Fitting (WSF), The Minimum Variance Distortionless Response (MVDR or capon) and beamspace. These algorithms are necessary to overcome the problem of detecting the arrival angles of the received signals in wireless communication. Therefore, these algorithms are evaluated and compared according to several constraints required in smart antenna system parameters, as the number of array elements, number of samples (snapshots), and number of the received signals. The main purpose of this study is to obtain the best estimation of the direction of arrival, which can be perfectly implemented in a smart antenna system. In this context, the ROOT-Weighted Subspace Fitting algorithm provides the most accurate detection of arrival angles in each of the proposed scenarios.</p>