基于旋转变换的最小互信息量盲分离算法  

Blind Separation Algorithm of Minimal Mutual Information Based on Rotating Transform

作　　者：谢胜利[1] 章晋龙[1] 

机构地区：[1]华南理工大学无线电与自动控制研究所,广东广州510640

出　　处：《电子学报》2002年第5期628-631,共4页Acta Electronica Sinica

基　　金：国家自然科学基金 (No .69972 0 1 6);广东省自然科学基金 (No.990 892 );广东省优秀人才基金 (教研 [2 0 0 0 ] 69号 )

摘　　要：一种新的实时线性混叠信号盲分离算法在本文提出 .该算法先采取白化混叠信号将混叠矩阵转换为正交矩阵 ,然后基于QR分解理论 ,将混叠信号进行一系列初等旋转变换 ,并结合源信号相互独立时互信息量最小的特点 ,导出了一种新的自适应盲分离算法 .该方法回避了目前基于信息理论方法中 (如Torkkola 1996 ;Pham 1999;Lee 2 0 0 0以及谭 2 0 0 0等 )对“ln|detw|”的复杂计算 .我们不仅给出了详细的理论证明 ,而且也进行了仿真试验 ,理论分析与仿真结果表明该算法减少了分离时间 ,并具有很好的分离效果 .A new kind of blind separation algorithm for real time linear mixture signals is presented in this paper.At first,the mixture matrix is changed into orthogonal matrix by using whitened mixture signals.Then based on QR decomposing theory,a series of primary rotating transforms are performed for mixture signals.It is also considered that the mutual information is the least if source signals are independent and a new kind of adaptive blind separation algorithm is educed.This method avoids the complex calculation of |det w | with the present information theory method (e.g.Torkkola 1996,Pham 1999,Lee 2000,as well as Tang 2000).In the paper we not only give the theoretic proof in detail,but also carry out the simulation experiments.Both of theoretic analysis and simulation results show that this algorithm saves the separation time and has a good separation effect.

关 键 词：旋转变换 最小互信息量 盲分离算法 

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