Blind signal separation using steepest descent
Blind signal separation using steepest descent
A method that significantly improves the convergence rate of the gradient-based blind signal separation (BSS) algorithm for convolutive mixtures is proposed. The proposed approach is based on the steepest descent algorithm suitable for constrained BSS problems, where the constraints are included to ease the permutation effects associated with the convolutive mixtures. In addition, the method is realized using a modified golden search method plus parabolic interpolation, and this allows the optimum step size to be determined with only a few calculations of the cost function. Evaluation of the proposed procedure in simulated environments and in a real room environment shows that the proposed method results in significantly faster convergence for the BSS when compared with a fixed step-size gradient-based algorithm. In addition, for blind signal extraction where only a main speech source is desired, a combined scheme consisting of the proposed BSS and a postprocessor, such as an adaptive noise canceller, offers impressive noise suppression levels while maintaining low-target signal distortion levels
4198-4207
Dam, H.H.
0b63dab1-ea3f-47d1-8522-46f3d44e7081
Nordholm, S.
d2441721-2cf0-4387-a95d-7cd2b956c014
Low, S.Y.
8fd903a4-b0b0-4c1c-9cc7-c2fe87109376
Cantoni, A.
ea97084f-46c3-4c5b-8521-1a91eb1bb764
August 2007
Dam, H.H.
0b63dab1-ea3f-47d1-8522-46f3d44e7081
Nordholm, S.
d2441721-2cf0-4387-a95d-7cd2b956c014
Low, S.Y.
8fd903a4-b0b0-4c1c-9cc7-c2fe87109376
Cantoni, A.
ea97084f-46c3-4c5b-8521-1a91eb1bb764
Dam, H.H., Nordholm, S., Low, S.Y. and Cantoni, A.
(2007)
Blind signal separation using steepest descent.
IEEE Transactions on Signal Processing, 55 (8), .
(doi:10.1109/TSP.2007.894406).
Abstract
A method that significantly improves the convergence rate of the gradient-based blind signal separation (BSS) algorithm for convolutive mixtures is proposed. The proposed approach is based on the steepest descent algorithm suitable for constrained BSS problems, where the constraints are included to ease the permutation effects associated with the convolutive mixtures. In addition, the method is realized using a modified golden search method plus parabolic interpolation, and this allows the optimum step size to be determined with only a few calculations of the cost function. Evaluation of the proposed procedure in simulated environments and in a real room environment shows that the proposed method results in significantly faster convergence for the BSS when compared with a fixed step-size gradient-based algorithm. In addition, for blind signal extraction where only a main speech source is desired, a combined scheme consisting of the proposed BSS and a postprocessor, such as an adaptive noise canceller, offers impressive noise suppression levels while maintaining low-target signal distortion levels
This record has no associated files available for download.
More information
Published date: August 2007
Organisations:
Southampton Wireless Group
Identifiers
Local EPrints ID: 369130
URI: http://eprints.soton.ac.uk/id/eprint/369130
ISSN: 1053-587X
PURE UUID: da8e475e-6133-44a5-a8e6-05f0c9893359
Catalogue record
Date deposited: 09 Oct 2014 08:43
Last modified: 14 Mar 2024 17:58
Export record
Altmetrics
Contributors
Author:
H.H. Dam
Author:
S. Nordholm
Author:
S.Y. Low
Author:
A. Cantoni
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics