Premium
Sparse linear array in the estimation of AoA and AoD with high resolution and low complexity
Author(s) -
Angeline Beulah V,
Venkateswaran N
Publication year - 2020
Publication title -
transactions on emerging telecommunications technologies
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.366
H-Index - 47
ISSN - 2161-3915
DOI - 10.1002/ett.3840
Subject(s) - redundancy (engineering) , algorithm , computer science , subspace topology , computational complexity theory , radar , reduction (mathematics) , angle of arrival , wireless , mathematics , telecommunications , artificial intelligence , geometry , antenna (radio) , operating system
High resolution with low complexity angle of arrival and departure estimation in real‐time radar and wireless communication has been a topic of intensive research. In this paper, two novel algorithms are proposed, namely, minimum redundancy and minimum redundancy–reduced correlation algorithms, for finding the angles of arrival and departure with high resolution and low complexity. The first of the two proposed algorithms is meant for the reduction in the active number of antennas (minimum redundancy) without generating virtual angles. The second involves a reduction in subspace leakage to enable improvement of the peak power of the estimated true angles. The authors have assumed the users as coherent and the channel following Saleh‐Valenzuela model. This has been done for the validation of the performance of the proposed algorithms. Numerical simulations demonstrate the out performance of the existing sparse array subspace‐based methods in the estimation of angles by the proposed methods.