Abstract
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.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
