Abstract
This paper addresses the problem of the non-unitary approximate joint block diagonalization (NU -JBD) of matrices. Such a problem occurs in various fields of applications among which blind separation of convolutive mixtures of sources and wide-band signals array processing. We present a new algorithm for the non-unitary joint block-diagonalization of complex matrices based on a gradient-descent algorithm whereby the optimal step size is computed algebraically at each iteration as the rooting of a 3rd-degree polynomial. Computer simulations are provided in order to illustrate the effectiveness of the proposed algorithm. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Ghennioui, H., Thirion-Moreau, N., Moreau, E., Adib, A., & Aboutajdine, D. (2007). Non unitary joint block diagonalization of complex matrices using a gradient approach. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4666 LNCS, pp. 201–208). Springer Verlag. https://doi.org/10.1007/978-3-540-74494-8_26
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
