Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
