Abstract
This paper adresses the problem of the joint zero-diagonalization of a given set of matrices. We establish the identiflability conditions of the zero-diagonalizer, and we propose a new algebraical algorithm based on the reformulation of the initial problem into a joint-diagonalization problem. The zero-diagonalizer is not constrained to be unitary. Computer simulations illustrate the behavior of the algorithm. Moreover, as an application, we show that the blind separation of correlated sources can be performed applying this algorithm to a particular set of spatial quadratic time-frequency distribution matrices. In this case, computer simulations are also provided in order to illustrate the performances of the proposed algorithm and to compare it with other existing ones.
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.
