返回
An Improved Adaptive Subspace Tracking Algorithm Based on Approximated Power Iteration
DOI:10.1109/ACCESS.2018.2863557.png)
摘要
En 中文
A subspace tracking technique has drawn a lot of attentions due to its wide applications. The main objective of this approach is to estimate signal or noise subspace basis for the sample covariance matrix. In this paper, we focus on providing a fast, stable, and adaptive subspace tracking algorithm that is implemented with low computational complexity. An alternative realization of the fast approximate power iteration (FAPI) method, termed modified FAPI (MFAPI), is also presented. Rather than solving an inverse square root of a matrix employed in the FAPI, the MFAPI applies the matrix product directly to ensure the orthonormality of the subspace basis matrix at each recursion. This approach yields a simpler derivation and is numerically stable while maintaining a similar computational complexity as compared with that of the FAPI. Furthermore, we present a detailed mathematical proof of the numerical stability of our proposed algorithm. Computer simulation results indicate that the MFAPI outperforms many classical subspace tracking algorithms, particularly at the transient-state step.
Keyword:
Adaptive subspace tracking
approximated power iteration
orthonormal iteration
projection approximation
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
引用论文
Anatomy of regressive tracts in a regressive sequence set: Vilomara unit, Sant Llorenç del Munt, Ebro Basin, NE Spain退行性序列集中退行性通路的解剖:Vilomara单元,Sant Llorenç del Munt,Ebro Basin,NE Spain
Role of tacit knowledge management process and innovation capability for stimulating organizational performance: empirical analysis, PLS-SEM approach
Kybernetes
IF0
A unified convergence analysis of Normalized PAST algorithms for estimating principal and minor components用于估计主分量和次分量的归一化过去算法的统一收敛性分析
SIGNAL PROCESSING
IF3.6

