Blind signal separation of convolutive mixtures: A time-domain joint-diagonalization approach

2Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We address the blind source separation (BSS) problem for the convolutive mixing case. Second-order statistical methods are employed assuming the source signals are non-stationary and possibly also non-white. The proposed algorithm is based on a joint-diagonalization approach, where we search for a single polynomial matrix that jointly diagonalizes a set of measured spatiotemporal correlation matrices. In contrast to most other algorithms based on similar concepts, we define the underlying cost function entirely in the time-domain. Furthermore, we present an efficient implementation of the proposed algorithm which is based on fast convolution techniques. © Springer-Verlag 2004.

Cite

CITATION STYLE

APA

Joho, M. (2004). Blind signal separation of convolutive mixtures: A time-domain joint-diagonalization approach. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3195, 578–585. https://doi.org/10.1007/978-3-540-30110-3_74

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free