.png){kind=icon}
.png){kind=icon}
Return
Stable and Orthonormal OJA Algorithm With Low Complexity
.png){kind=icon}
PRE
AI
DOI：10.1109/LSP.2011.2108999.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this letter, a stable and orthonormal version of the OJA algorithm (SOOJA) is investigated for principal and minor subspace extraction and tracking. The new algorithm presented here guarantees the orthonormality of the weight matrix at each iteration through a novel orthonormalization method. Moreover, it obtains both a high numerical stability and a low computational complexity. The superiority of the proposed algorithm to some existing subspace tracking algorithms is demonstrated using a classical example. Simulation results confirm the veracity of the subspace tracking algorithm advocated.
Keywords:
Numerical stability
OJA algorithm
subspace tracking
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
9.6
Papers:
1.1W
Citations:
1.7W