Problem Of Joint Blind Source Separation Research Articles

A unitary joint diagonalization algorithm for nonsymmetric higher‐order tensors based on Givens‐like rotations

SummaryBased on Givens‐like rotations, we present a unitary joint diagonalization algorithm for a set of nonsymmetric higher‐order tensors. Each unitary rotation matrix only depends on one unknown parameter which can be analytically obtained in an independent way following a reasonable assumption and a complex derivative technique. It can serve for the canonical polyadic decomposition of a higher‐order tensor with orthogonal factors. Furthermore, based on cross‐high‐order cumulants of observed signals, we show that the proposed algorithm can be applied to solve the joint blind source separation problem. The simulation results reveal that the proposed algorithm has a competitive performance compared with those of several existing related methods.

On Extending the Noncircular Fast Independent Vector Analysis Algorithm to the Noisy Model

The noncircular fast independent vector analysis (nc-FastIVA) algorithm is an effective approach to achieve the joint blind source separation (JBSS) problem. However, the original nc-FastIVA algorithm does not take noise into account. In this letter, a new fixed-point algorithm is proposed for more realistic cases when noise is present. Simulations show that the proposed method can have better performance than the original nc-FastIVA algorithm for solving the noisy JBSS problem.