A Fast Non-Unitary Joint Diagonalization Algorithm Based on Utilizations of Parametric Structures[J]. 2016, 50(12): 106-113.
DOI:
A Fast Non-Unitary Joint Diagonalization Algorithm Based on Utilizations of Parametric Structures[J]. 2016, 50(12): 106-113.DOI: 10.7652/xjtuxb201612017.
A Fast Non-Unitary Joint Diagonalization Algorithm Based on Utilizations of Parametric Structures
A parametric structures based fast joint diagonalization(PSJD)algorithm for non-unitary diagonalization of a set of complex target matrices is presented to cope with the problem that the blind source separation by fast Frobenius diagonalization(FFDIAG)algorithm is not applicable in the complex-valued space and its separation performance is lower. The algorithm firstly transforms the complex target matrices into real-symmetric ones. Secondly
the problem of simultaneous diagonalization of matrices is transformed into a series of linear least-squares problems through second-order approximation to contract functions
and the elements of the updating matrix are directly estimated. The computational complexity for estimating the diagonalizer and for updating the target matrices is significantly reduced by making full use of the structure information of the transformed target matrices. In order to overcome the drawback of fixed step size adopted in the FFDIAG that may not strike a balance between the convergence rate and strictly diagonally dominant property of the update matrix
the proposed algorithm uses the adaptive learning rate determined from the estimation of the update matrix in each iteration to improve the convergence property. Results of numerical simulations show that the convergence rate of PSJD algorithm is not very sensitive in a wide range of step-size values. When the step size is 0.1
the number of iterations required to reach convergence is 42% less than that of the fixed step-size method.
关键词
Keywords
references
CHABRIEL G, KLEINSTEUBER M, MOREAU E, et al. Joint matrices decompositions and blind source separation: a survey of methods, identification, and applications [J]. IEEE Signal Processing Magazine, 2014, 3(31): 34-43.
MESLOUB A, ABED-MERAIM K, BELOUCHRANI A. A new algorithm for complex non orthogonal joint diagonalization based on Shear and Givens rotations [J]. IEEE Transactions on Signal Processing, 2014, 62(8): 1913-1925.
ZIEHE A, LASKOV P, NOLTE G, et al. A fast algorithm for joint diagonalization with non-orthogonal transformations and its application to blind source separation [J]. Journal of Machine Learning Research, 2004, 5(3): 777-800.
XU Xianfeng, FENG Dazheng, ZHENG Weixing. A fast algorithm for nonunitary joint diagonalization and its application to blind source separation [J]. IEEE Transactions on Signal Processing, 2011, 59(7): 3457-3463.
NIE Weike, FENG Dazheng, LIU Jiangiang. Non-unitary joint diagonalization method for estimating two-dimension direction of arrival [J]. Journal of Xi'an Jiaotong University, 2008, 42(6): 747-750.
FENG Dazheng, ZHANG Hua, ZHENG Weixing. Bi-iterative algorithm for extracting independent components from array signals [J]. IEEE Transactions on Signal Processing, 2011, 59(8): 3636-3646.
ZENG Tiaojun, FENG Quanyuan. Non-orthogonal joint diagonalization algorithm based on hybrid trust region method and its application to blind source separation [J]. Neurocomputing, 2014, 133(8): 280-294.
LU Jiantao, CHENG Wei, ZI Yanyang, et al. Variable step-size algorithm for equivariant adaptive separation via independent [J]. Journal of Xi'an Jiaotong University, 2015, 49(12): 83-89.
TICHAVSKY P, YEREDOR A. Fast approximate joint diagonalization incorporating weight matrices [J]. IEEE Transactions on Signal Processing, 2009, 57(3): 878-891.
LASALLE J P. The stability of dynamical system [M]. Philadelphia, PA, USA: SIAM Press, 1976: 49-50.