基于广义协方差张量分解的欠定盲辨识算法  

Underdetermined Blind Identification Algorithm Based on Generalized Covariance and Tensor Decomposition

作　　者：骆忠强[1] 朱立东[1] 

机构地区：[1]电子科技大学通信抗干扰技术国家级重点实验室,成都611731

出　　处：《电子科技大学学报》2016年第6期893-897,共5页Journal of University of Electronic Science and Technology of China

基　　金：国家自然科学基金(61179006);国家863项目(2012AA01A502);四川省科技支撑计划(2014GZX0004)

摘　　要：针对欠定盲源分离中的混合矩阵估计问题,该文利用广义协方差的统计和结构性质以及塔克分解的压缩特征,提出了一种新的欠定盲辨识算法。首先基于广义协方差矩阵建立核函数,再将核函数堆叠成三阶张量模型,然后应用塔克分解求混合矩阵。该算法不仅具有优良的辨识性能,而且具有较低的实现复杂度。最后,仿真实验证明了该文算法的有效性。In view of the estimation problem of mixing matrix in the underdetermined blind source separation （UBSS）, a novel underdetermined blind identification algorithm is proposed. This proposed algorithm employs the statistical and structure properties of generalized covariance and the compressive characteristic of Tucker decomposition. Firstly, the core functions are built based on generalized covariance matrix. Then the core functions are stacked as a three-order tensor, and the tucker decomposition of constructed tensor is executed to estimate the mixing matrix. The proposed algorithm has not only the better identification performance, but also the lower computational complexity. At last, the simulation experiments demonstrate the effectiveness of the proposed algorithm.

关 键 词：盲源分离 累积量 广义协方差 张量分解 欠定盲辨识 

分 类 号：TN911.7[电子电信—通信与信息系统]