点击次数：

论文类型：会议论文

发表时间：2015-08-15

收录刊物：EI、Scopus

卷号：2016-January

页面范围：102-107

摘要：Canonical polyadic decomposition (CPD) has been extensively studied and used in solving blind source separation (BSS) problems, mainly due to its nice identifiability property in mild conditions. In over-determined BSS and joint BSS (J-BSS), CPD is shown to be equivalent to tensor diagonalization (TD). In this study, we propose an algorithm for non-orthogonal TD (NTD) based on LU decomposition and successive rotations, and examine its applications in BSS and J-BSS. We use LU decomposition to convert the overall optimization into L and U stages, and then the factor matrices in these stages can be appropriately parameterized by a sequence of simple elementary triangular matrices, which can be solved analytically. We compared the proposed algorithm with orthogonal TD,tensor DIAgonalization (TEDIA) and CPD with simulations, the results show that in the over-determined case, NTD generates improved accuracy over TEDIA, CPD and orthogonal TD, and faster convergence than TEDIA. ? 2015 IEEE.