摘要
子空间分析方法广泛应用于信号处理领域,运算复杂度的高低,是决定算法实时性的关键。本文通过对DPM类、OJA类子空间跟踪方法的分析,在保证算法稳健的前提下,提出一类简化运算量的子空间跟踪方法(MFDPM、MFOO-JA)。实验仿真表明,MFDPM、MFOOJA与FDPM、FOOJA具有相似的收敛速度和稳态误差。在有限字长条件下,MFDPM、MFOOJA对舍入误差累积不敏感,具有很强的鲁棒性,并保证子空间基的标准正交收敛。
Subspace analysis is a frequently encountered method in many signal processing fields. Computational complexity is a very important point for real time implementation. Starting from analysis of DPM and OJA classes of subspaee tracking methods, we pro- posed modified methods for them, named as MFDPM and MFOOJA, which are numerically stable and less computational complexity. Simulation results verified that the proposed algorithms have similar convergence speed and steady-state error compared to FDPM or FOOJA. And the proposed algorithms are less sensitive to round-off error accumulation under the finite word length condition and guarantee orthonormality convergence, so which are robust.
出处
《信号处理》
CSCD
北大核心
2010年第5期741-745,共5页
Journal of Signal Processing
基金
武器装备预研项目(41901140401)
关键词
数据投影
子空间跟踪
运算复杂度
数值稳健
标准正交
data projection
subspace tracking
computational complexity
numerical stability
orthonormality
