欠定线性瞬时混合盲分离矩阵求解算法  

Algorithm for Solving Underdetermined Linear Instantaneous Blind Separation Matrix

作　　者：刘永[1] 李晓花[1] 李小军[2] 

机构地区：[1]四川理工学院自动化与电子信息学院,四川自贡643000 [2]四川工程职业技术学院电气信息工程系,四川德阳618000

出　　处：《半导体光电》2014年第4期691-695,共5页Semiconductor Optoelectronics

基　　金：国家自然科学基金项目(61179006);四川理工学院科研基金项目(2011KY10);四川省人工智能重点实验室科研基金项目(2012RYJ09)

摘　　要：针对欠定线性瞬时混合中的混合矩阵条件数较大的情况,使用最小二乘估计算法求解源信号造成的噪声放大问题,研究了一种求解分离矩阵的算法。此方法基于最大信干噪比的原则建立代价函数,通过最优化此函数得到分离矩阵。仿真实验表明,该算法与最小二乘算法相比可以改善在混合矩阵条件数较大时噪声放大影响下的分离性能。For the case of larger condition number of mixing matrix in the underdetermined linear instantaneous mixtures,the noise amplification problem caused by the source signals was solved with the method of Least Squares（LS）Estimation,and an algorithm for solving the separation matrix was investigated.For this method,it establishes cost function based on the principle of maximizing signal to interference plus noise power ratio（SINR）,and then the separation matrix is derived by optimizing this cost function.Simulation results show that,compared to the LS method,the proposed algorithm can improve the separation performance under noise amplification with larger condition number of mixing matrix.

关 键 词：盲源分离 信干比 混合矩阵 分离矩阵 噪声放大 

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