Efficient direction-finding methods employing forward/backward averaging

Author

Linebarger, Darel A. ; DeGroat, Ronald D. ; Dowling, Eric M.

Author_Institution

Erik Jonsson Sch. of Eng. & Comput. Sci., Texas Univ., Dallas, TX, USA

Volume

42

Issue

8

fYear

1994

fDate

8/1/1994 12:00:00 AM

Firstpage

2136

Lastpage

2145

Abstract

In this paper, we develop a general approach for reducing the computational complexity of any direction finding method implemented with forward/backward (FB) averaging. We develop simplified FB data matrices in a manner paralleling previous work related to centrohermitian (correlation) matrices. Based on these simplified data matrices, efficient construction and updating of the FB correlation matrix is developed. In addition, efficient FB FFT, FB beamspace, FB EVD updating, FB SVD, and FB SVD updating methods are derived. In most cases, FB-based direction-finding methods can be simplified so that the computational complexity is reduced below that of an analogous forward only implementation. Thus, effectively twice the amount of data is processed with less total computation

Keywords

array signal processing; computational complexity; correlation methods; fast Fourier transforms; matrix algebra; FFT; SVD updating methods; beamspace; centrohermitian matrices; computational complexity; correlation matrices; data matrices; direction-finding methods; forward/backward averaging; Array signal processing; Computational complexity; Discrete cosine transforms; Discrete transforms; Geometry; Matrix converters; Navigation; Signal processing; Spectral analysis; Speech processing;

fLanguage

English

Journal_Title

Signal Processing, IEEE Transactions on

Publisher

ieee

ISSN

1053-587X

Type

jour

DOI

10.1109/78.301848

Filename

301848