Equivalence between frequency-domain blind source separation and frequency-domain adaptive beamforming for convolutive mixtures (Q1418324): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 17:20, 31 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Equivalence between frequency-domain blind source separation and frequency-domain adaptive beamforming for convolutive mixtures |
scientific article |
Statements
Equivalence between frequency-domain blind source separation and frequency-domain adaptive beamforming for convolutive mixtures (English)
0 references
25 February 2004
0 references
Summary: 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.
0 references
blind source separation
0 references
adaptive beamformers
0 references
convolutive mixtures
0 references
telecommunication
0 references
estimating source signals
0 references
speech recognition
0 references