A novel approximate joint diagonalization algorithm

被引:0
作者
Klajman, M [1 ]
Chambers, JA [1 ]
机构
[1] Univ London Imperial Coll Sci Technol & Med, Commun & Signal Proc Res Grp, London SW7 2BT, England
来源
MATHEMATICS IN SIGNAL PROCESSING V | 2002年 / 71期
关键词
D O I
暂无
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Most existing blind source separation algorithms unmix the sources in two stages. First the data are decorrelated. Then, the transformation that relates the independent sources to the decorrelated mixture is found as a pure rotation since these two, the sources and the decorrelated data, are spatially white vectors. This rotation is found by jointly diagonalizing a set of covariance matrices, or alternatively a set of cumulant slices, by a unitary matrix. The fundamental problem is to retain the unitary property of the operators, and this is achieved in this paper via the Cayley transformation. Based on this approach, we present two novel joint unitary diagonalization algorithms. Simulation studies are undertaken to evaluate the proposed schemes.
引用
收藏
页码:69 / 77
页数:9
相关论文
共 5 条
[1]   A blind source separation technique using second-order statistics [J].
Belouchrani, A ;
AbedMeraim, K ;
Cardoso, JF ;
Moulines, E .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 1997, 45 (02) :434-444
[2]   Jacobi angles for simultaneous diagonalization [J].
Cardoso, JF ;
Souloumiac, A .
SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS, 1996, 17 (01) :161-164
[3]  
Horn R. A., 1986, Matrix analysis
[4]  
Horn R. A., 1999, TOPICS MATRIX ANAL
[5]  
KLAJMAN M, UNPUB VARIABLE COST