Linearly-constrained multichannel interference suppression algorithms derived from a minimum mutual information criterion

Conference contribution
(Conference Contribution)


Publication Details

Author(s): Reindl K, Kellermann W
Publication year: 2013
Pages range: 283-287
ISBN: 978-1-4799-1043-4
Language: English


Abstract


In this contribution, a generic framework for linearly-constrained multichannel noise and interference suppression algorithms is presented. It is derived from a linearly-constrained minimum mutual information (LCMMI) criterion between mutually statistically independent desired and undesired components, which also accounts for three fundamental signal properties characteristic, e.g., for speech and audio signals: Nonwhiteness, nonstationarity, and nongaus-sianity. We demonstrate links to prominent second order statistics-based algorithms such as the linearly-constrained minimum variance (LCMV) filter and its realization as a generalized sidelobe canceller (GSC). Additionally, we will show how specific supervised constrained and unconstrained multichannel algorithms result as special cases. The presented LCMMI concept leads to new insights for the development of improved adaptation algorithms for noise and interference suppression. © 2013 IEEE.


FAU Authors / FAU Editors

Kellermann, Walter Prof. Dr.-Ing.
Professur für Nachrichtentechnik
Reindl, Klaus
Professur für Nachrichtentechnik


How to cite

APA:
Reindl, K., & Kellermann, W. (2013). Linearly-constrained multichannel interference suppression algorithms derived from a minimum mutual information criterion. In Proceedings of the IEEE China Summit and International Conference on Signal and Information Processing (ChinaSIP) (pp. 283-287). Beijing, CN.

MLA:
Reindl, Klaus, and Walter Kellermann. "Linearly-constrained multichannel interference suppression algorithms derived from a minimum mutual information criterion." Proceedings of the IEEE China Summit and International Conference on Signal and Information Processing (ChinaSIP), Beijing 2013. 283-287.

BibTeX: 

Last updated on 2019-03-06 at 07:10