Open Access

Equivalence between Frequency-Domain Blind Source Separation and Frequency-Domain Adaptive Beamforming for Convolutive Mixtures

  • Shoko Araki1Email author,
  • Shoji Makino1,
  • Yoichi Hinamoto2,
  • Ryo Mukai1,
  • Tsuyoki Nishikawa2 and
  • Hiroshi Saruwatari2
EURASIP Journal on Advances in Signal Processing20032003:198923

https://doi.org/10.1155/S1110865703305074

Received: 2 December 2002

Published: 5 October 2003

Abstract

Frequency-domain blind source separation (BSS) is shown to be equivalent to two sets of frequency-domain adaptive beamformers (ABFs) under certain conditions. The zero search of the off-diagonal components in the BSS update equation can be viewed as the minimization of the mean square error in the ABFs. The unmixing matrix of the BSS and the filter coefficients of the ABFs converge to the same solution if the two source signals are ideally independent. If they are dependent, this results in a bias for the correct unmixing filter coefficients. Therefore, the performance of the BSS is limited to that of the ABF if the ABF can use exact geometric information. This understanding gives an interpretation of BSS from a physical point of view.

Keywords

blind source separationconvolutive mixturesadaptive beamformers

Authors’ Affiliations

(1)
NTT Communication Science Laboratories, NTT Corporation
(2)
Graduate School of Information Science, Nara Institute of Science and Technology

Copyright

© Copyright © 2003 Hindawi Publishing Corporation 2003