一种基于乘幂法的信号子空间快速求解算法  

An Algorithm for Fast Finding Signal Subspace Based on Power Algorithm

作　　者：韩玲展[1] 方明[2] 

机构地区：[1]惠州市广播电视大学,广东惠州516001 [2]西安电子科技大学,陕西西安710071

出　　处：《广东技术师范学院学报》2006年第6期47-49,共3页Journal of Guangdong Polytechnic Normal University

摘　　要：基于子空间分解的阵列信号处理技术可以突破瑞利限的约束,具有极高的角度分辨能力,但由于要作特征分解,需付出巨大的运算量代价。乘幂法是近代数值分析中快速得到矩阵特征值与特征向量的迭代算法,本文将两者有机结合,得到了一种快速求解信号子空间的迭代算法。仿真结果验证了该算法的有效性。Subspace decomposition based array signal processing technologies can break through the Rayleigh- limit with very high degree resolvability. However, due to the eigen - decomposition a large amount of computation power algortm is an iterative algorthm for fast finding eigen - values and eigen - vectors of some matrices analysis. In this paper,we integrate the above two technologies organically, obtaining an efficient iterative must be paid. While in modem numerical algorithm for finding the signal subspace. Some simulation results are provided to verify the effectiveness of the proposed algorithm.

关 键 词：超分辨 乘幂法 子空间 特征分解 迭代 

分 类 号：O241[理学—计算数学]