.png){kind=icon}
Return
A constrained optimization approach for an adaptive generalized subspace tracking algorithm
.png){kind=icon}
OA
AI
DOI：10.1016/j.compeleceng.2008.11.015.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we present an orthonormal version of the generalized signal subspace tracking. It is based on an interpretation of the generalized signal subspace as the solution of a constrained minimization task This algorithm, referred to as the CGST algorithm, guarantees the C(x)-orthonormality of the estimated generalized signal subspace basis at each iteration which C(x) denotes the correlation matrix of the sequence x(t). An efficient implementation of the proposed algorithm enhances applicability of it in real time applications. (C) 2008 Elsevier Ltd. All rights reserved.
Keywords:
Generalized subspace
Projection approximation
Generalized eigen-decomposition
Constrained optimization
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
4.9
Papers:
6.7K
Citations:
1.3W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveHigh-Resolution Electronic Spectroscopy of the Doorway States to Intramolecular Charge Transfer
PREAI
ShareSaveShareSaveShareSaveShareSaveAnsa-[(2,2-bis-η-cyclopentadienyl)propane]-molybdenum and -tungsten chemistry and related studies
PREAI
ShareSave
View more