A Low Complexity Adaptive Algorithm for Eigenspace-Based Two-Dimensional Direction of Arrival Tracking

DOI Web Site 24 References
  • WU Kuo-Hsiung
    Dept. of Electronic Engineering, National Taiwan University of Science and Technology
  • FANG Wen-Hsien
    Dept. of Electronic Engineering, National Taiwan University of Science and Technology

Search this article

Abstract

In this paper, we present a low complexity, yet accurate adaptive algorithm for the tracking of two-dimensional (2-D) direction of arrival (DOAs) based on a uniform rectangular array (URA). The new algorithm is a novel hybrid of tracking and beamforming processes by making use of three stages of one-dimensional (1-D) DOA tracking algorithms — in a hierarchical tree structure — to determine the two DOA components iteratively in a coarse-fine manner. In between every other 1-D DOA tracking algorithm, a complementary orthogonal beamforming process is invoked to partition the incoming signals into appropriate groups to enhance the tracking accuracy. Since the new algorithm only involves the 1-D subspace-based DOA tracking algorithm, the overall complexity is substantially less than the direct two-dimensional (2-D) extension of the existing 1-D DOA tracking algorithms, which requires an update of higher-dimensional vectors followed by a higher-dimensional eigendecomposition or a 2-D search. Furthermore, with the tree-structured DOA tracking scheme, the tracked 2-D DOA components are automatically paired without extra computational overhead. Furnished simulations show that the new algorithm can provide satisfactory tracking performance in various scenarios.

Journal

References(24)*help

See more

Keywords

Details 詳細情報について

Report a problem

Back to top