z-logo
open-access-imgOpen Access
On-grid Adaptive Compressive Sensing Framework for Underdetermined DOA Estimation by Employing Singular Value Decomposition
Author(s) -
K Raghu,
Prameela Kumari N
Publication year - 2019
Publication title -
international journal of innovative technology and exploring engineering
Language(s) - English
Resource type - Journals
ISSN - 2278-3075
DOI - 10.35940/ijitee.k2433.0981119
Subject(s) - direction of arrival , singular value decomposition , signal subspace , algorithm , underdetermined system , computer science , compressed sensing , signal (programming language) , sensor array , lasso (programming language) , antenna array , computational complexity theory , antenna (radio) , array processing , signal processing , mathematics , telecommunications , noise (video) , artificial intelligence , machine learning , world wide web , image (mathematics) , programming language , radar
In the field of Array Signal Processing, the problem of Direction of Arrival (DOA) estimation has attracted colossal attention of researchers in the past few years. The problem refers to estimating the angle of arrival of the incoming signals at the receiver end, from the knowledge of the received signal itself. Generally, an array of antenna/sensors is employed at the receiver for this purpose. In over-determined DOA estimation, the number of signal sources, whose direction needs to be estimated are usually lesser than half the number of antenna array elements, whereas the challenge is to estimate the DOAs in under-determined case, where the signal source number is quiet larger than the number of antenna array elements. This paper tackles such a problem by the application of multiple level nested array. Instead of subspace-based techniques for the estimation, sparse signal representation for Compressive Sensing (CS) framework is used, which eliminates the requirement of prior information about the source number and also the tedious task of computing the inverse of the covariance matrices. In this paper, we propose an adaptive approach for Least Absolute Shrinkage and Selection Operator (LASSO) with reduced number of computations by singular value decomposing of the received signal vector. The outcomes of this paper showcase that the presented algorithm achieves high degree of freedom (DOF), good resolution, minimum root mean square error and less computational complexity with increased speed of estimation.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here