Conjugate gradient projection subspace tracking

Author

Fu, Zuqiang ; Dowling, Eric M.

Author_Institution

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

Volume

1

fYear

1994

fDate

31 Oct-2 Nov 1994

Firstpage

612

Abstract

We present a conjugate gradient subspace projection algorithm for subspace tracking. We base the algorithm on the subspace projection cost function introduced by B. Yang (see IEEE ICASSP, p.IV145-IV148, 1993 ), and use a conjugate gradient iteration to provide rapid convergence. The update complexity is O(r²m) where r is the dimension of the tracked subspace which is assumed to be much smaller than m. The algorithm has immediate application in radar and sonar array signal processing systems

Keywords

array signal processing; computational complexity; conjugate gradient methods; convergence of numerical methods; radar signal processing; sonar signal processing; tracking; conjugate gradient iteration; conjugate gradient subspace projection algorithm; radar signal processing systems; rapid convergence; sonar array signal processing systems; subspace projection cost function; subspace tracking; update complexity; Array signal processing; Computer science; Convergence; Cost function; Projection algorithms; Radar applications; Radar signal processing; Radar tracking; Signal processing algorithms; Sonar applications;

fLanguage

English

Publisher

ieee

Conference_Titel

Signals, Systems and Computers, 1994. 1994 Conference Record of the Twenty-Eighth Asilomar Conference on

Conference_Location

Pacific Grove, CA

ISSN

1058-6393

Print_ISBN

0-8186-6405-3

Type

conf

DOI

10.1109/ACSSC.1994.471525

Filename

471525