Subspace-constrained SCORE algorithms

Author

Biedka, Thomas E.

Author_Institution

E-Syst. Inc., Greenville, TX, USA

fYear

1993

fDate

1-3 Nov 1993

Firstpage

716

Abstract

The SCORE algorithms have been shown to be capable of blindly extracting a desired signal in the presence of unknown noise and interference by exploiting the cyclostationarity of the signal of interest. An analysis of SCORE is presented which demonstrates that, for fixed collect time, the output SINR degrades as the number of sensors increases. The best performance is obtained when the number of sensors equals the number of incident signals. A solution to this problem is presented which involves solving for the SCORE weight vectors subject to the constraint that they lie in the signal subspace of the observed data correlation matrix. It is shown that incorporation of this constraint improves the convergence rate when the signal subspace exists and may be accurately estimated. The effect of rank estimation error is also considered

Keywords

adaptive signal detection; array signal processing; correlation methods; covariance matrices; eigenvalues and eigenfunctions; interference (signal); quadrature phase shift keying; blind extraction; convergence rate; cyclostationarity; data correlation matrix; interference; number of sensors; output SNR degradation; performance; rank estimation error; subspace-constrained SCORE algorithms; unknown noise; weight vectors; Array signal processing; Convergence; Degradation; Estimation error; Frequency estimation; Interference; Sensor arrays; Sensor phenomena and characterization; Signal to noise ratio; Subspace constraints; Vectors;

fLanguage

English

Publisher

ieee

Conference_Titel

Signals, Systems and Computers, 1993. 1993 Conference Record of The Twenty-Seventh Asilomar Conference on

Conference_Location

Pacific Grove, CA

ISSN

1058-6393

Print_ISBN

0-8186-4120-7

Type

conf

DOI

10.1109/ACSSC.1993.342614

Filename

342614