New Insights into the Kalman Filter Beamformer: Applications to Speech and Robustness: Applications to Speech and Robustness

Dani Cherkassky, Sharon Gannot

Research output: Contribution to journalArticlepeer-review

10 Scopus citations

Abstract

© 2015 IEEE. Statistically optimal spatial processors (also referred to as data-dependent beamformers) are widely-used spatial focusing techniques for desired source extraction. The Kalman filterbased beamformer (KFB) [1] is a recursive Bayesian method for implementing the beamformer. This letter provides new insights into the KFB. Specifically, we adopt the KFB framework to the task of speech extraction. We formalize the KFB with a set of linear constraints and present its equivalence to the linearly constrained minimum power (LCMP) beamformer. We further show that the optimal output power, required for implementing the KFB, is merely controlling the white noise gain (WNG) of the beamformer. We also show, that in static scenarios, the adaptation rule of the KFB reduces to the simpler affine projection algorithm (APA). The analytically derived results are verified and exemplified by a simulation study.
Original languageEnglish
Article number7386586
Pages (from-to)376-380
Number of pages5
JournalIEEE Signal Processing Letters
Volume23
Issue number3
DOIs
StatePublished - 1 Mar 2016

Keywords

  • adaptive beamformer
  • affine projection algorithm
  • Kalman filter
  • LCMP beamformer
  • microphone arrays
  • speech enhancement
  • speech extraction

Fingerprint

Dive into the research topics of 'New Insights into the Kalman Filter Beamformer: Applications to Speech and Robustness: Applications to Speech and Robustness'. Together they form a unique fingerprint.

Cite this