Implementation of adaptive array algorithms

IEEE Transactions on Acoustics Speech and Signal ProcessingPublished 1 October 1986

Robert Schreiber

DOI10.1109/tassp.1986.1164943

Citations115

TL;DR

Some new, efficient, and numerically stable algorithms for the recursive solution of matrix problems arising in optimal beam-forming and direction finding are described and analyzed.

Abstract

Some new, efficient, and numerically stable algorithms for the recursive solution of matrix problems arising in optimal beam-forming and direction finding are described and analyzed. The matrix problems considered are systems of linear equations and spectral decomposition. While recursive solution procedures based on the matrix inversion lemma may be unstable, ours are stable. Furthermore, these algorithms are extremely fast.

Keywords

Computer ScienceEarth and Planetary SciencesEngineering

Introduction to matrix computations

2,396 Citations1973G. W. Stewart

Rounding-Error Analysis of Solution of Triangular Systems and of Gaussian Elimination.

Institution of Engineering and Technology eBooksIntroduction to Adaptive Arrays

1,707 Citations2011Robert A. Monzingo, Randy L. Haupt +1 more

This second edition is an extensive modernization of the bestselling introduction to the subject of adaptive array sensor systems, taking the reader by the hand and leading them through the maze of jargon that often surrounds this highly technical subject.

Mathematics of ComputationMethods for modifying matrix factorizations

581 Citations1974Philip E. Gill, Gene H. Golub +2 more

Several methods are described for modifying Cholesky factors and a new algorithm is presented for modifying the complete orthogonal factorization of a general matrix, from which the conventional QR factors are obtained as a special case.

Numerische MathematikRank-one modification of the symmetric eigenproblem

490 Citations1978James R. Bunch, Christopher P. Nielsen +1 more

An algorithm is presented for computing the eigensystem of the rank-one modification of a symmetric matrix with known eIGensystem and the explicit computation of the updated eigenvectors and the treatment of multiple eigenvalues.

Numerische MathematikUpdating the singular value decomposition

285 Citations1978James R. Bunch, Christopher P. Nielsen

IEEE Transactions on Acoustics Speech and Signal ProcessingEstimating the covariance matrix by signal subspace averaging

129 Citations1986Ilkka Karasalo

An efficient algorithm is presented for estimating a covariance matrix consisting of a low-rank signal term and a full-rank noise term, indicating that the proposed algorithm reduces the variance of some commonly used spectral estimators in off-target directions, without impairing their detection and resolution properties.

BIT Numerical MathematicsOn systolic arrays for updating the Cholesky factorization

18 Citations1986Robert Schreiber, Wei-Pai Tang

A new algorithm is introduced for the case of a negative rank-k change and an attractive two-pass systolic implementation is provided for the Cholesky factorization is provided.

On updating the singular value decomposition

17 Citations2002Chang Wan Jeon, Hyoung Joong Kim +1 more

A parallel and recursive total least squares algorithm (PRTLS) for solving a time variant TLS problem is proposed, based on the updating technique of the GMRQI-JKL to update the SVD.

New Principle of Array Processing in Underwater Passive Listening

5 Citations1983G. Bienvenu, Henri Mermoz