Beamspace direction finding based on the conjugate gradient and the auxiliary vector filtering algorithms

Authors:
Jens Steinwandt;Rodrigo C. De Lamare;Martin Haardt
Affiliations:
Communications Research Laboratory, Ilmenau University of Technology, P.O. Box 100565, 98684 Ilmenau, Germany;Communications Research Group, Department of Electronics, University of York, York YO10 5DD, United Kingdom;Communications Research Laboratory, Ilmenau University of Technology, P.O. Box 100565, 98684 Ilmenau, Germany
Venue:
Signal Processing
Year:
2013

Citing 12
Cited 0

On optimal dimension reduction for sensor array signal processing

Signal Processing
Matrix computations (3rd ed.)

Matrix computations (3rd ed.)
High-resolution source localization algorithm based on the conjugate gradient

EURASIP Journal on Advances in Signal Processing
Direction-of-arrival estimation for nonuniform sensor arrays: from manifold separation to Fourier domain MUSIC methods

IEEE Transactions on Signal Processing
Subspace Direction Finding With an Auxiliary-Vector Basis

IEEE Transactions on Signal Processing
Beamspace ESPRIT

IEEE Transactions on Signal Processing
An iterative algorithm for the computation of the MVDR filter

IEEE Transactions on Signal Processing
Convex optimization based beam-space preprocessing with improved robustness against out-of-sector sources

IEEE Transactions on Signal Processing
Stochastic Maximum-Likelihood DOA Estimation in the Presence of Unknown Nonuniform Noise

IEEE Transactions on Signal Processing - Part I
Blind Adaptive Constrained Reduced-Rank Parameter Estimation Based on Constant Modulus Design for CDMA Interference Suppression

IEEE Transactions on Signal Processing
Beamspace Root-MUSIC

IEEE Transactions on Signal Processing
On the equivalence of three reduced rank linear estimators with applications to DS-CDMA

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.08

Visualization

Abstract

Motivated by the performance of the direction finding algorithms based on the auxiliary vector filtering (AVF) method and the conjugate gradient (CG) method as well as the advantages of operating in beamspace (BS), we develop two novel direction finding algorithms for uniform linear arrays (ULAs) in the beamspace domain, which we refer to as the BS AVF and the BS CG methods. The recently proposed Krylov subspace-based CG and AVF algorithms for the direction of arrival (DOA) estimation utilize a non-eigenvector basis to generate the signal subspace and yield a superior resolution performance for closely spaced sources under severe conditions. However, their computational complexity is similar to the eigenvector-based methods. In order to save computational resources, we perform a dimension reduction through the linear transformation into the beamspace domain, which additionally leads to significant improvements in terms of the resolution capability and the estimation accuracy. A comprehensive complexity analysis and simulation results demonstrate the excellent performance of the proposed algorithms and show their computational requirements. As examples, we investigate the efficacy of the developed methods for the discrete Fourier transform (DFT) and the discrete prolate spheroidal sequences (DPSS) beamspace designs.