It is well known that the complex-valued nonunitary joint diagonalization (NUJD) problem in blind source separation (BSS) can be linked to the trilinear models. In this paper, by exploring the special structure of the NUJD problem in BSS, we introduce a novel symmetric tri-quadratic cost function and then derive a simultaneous bi-iterative algorithm (s-BIA) for solving the NUJD problem. Finally, three experiments are conducted in order to show the comparatively good performance of the proposed BSS algorithm.
['Da-Zheng Feng', 'Hua Zhang', 'Wei Xing Zheng']
Bi-Iterative Algorithm for Extracting Independent Components From Array Signals