Your Search Results

Use this resource - and many more! - in your textbook!

AcademicPub holds over eight million pieces of educational content for you to mix-and-match your way.

Experience the freedom of customizing your course pack with AcademicPub!
Not an educator but still interested in using this content? No problem! Visit our provider's page to contact the publisher and get permission directly.

Blind Source Separation of Postnonlinear Convolutive Mixture

By: Dlay, S.S.; Woo, W.L.; Jingyi Zhang;

2007 / IEEE


This item was taken from the IEEE Periodical ' Blind Source Separation of Postnonlinear Convolutive Mixture ' In this paper, a novel solution is developed to solve blind source separation of postnonlinear convolutive mixtures. The proposed model extends the conventional linear instantaneous mixture model to include both convolutive mixing and postnonlinear distortion. The maximum-likelihood (ML) approach solution based on the expectation-maximization (EM) algorithm is developed to estimate the source signals and the parameters in the proposed nonlinear model. In the proposed solution, the sufficient statistics associated with the source signals are estimated in the E-step, while the model parameters are optimized through these statistics in the M-step. However, the complication resulted from the postnonlinear function associated with the mixture renders these statistics difficult to be formulated in a closed form and hence causes intractability in the parameter optimization. A computationally efficient algorithm is proposed which uses the extended Kalman smoother (EKS) to facilitate the E-step tractable and a set of self-updated polynomials is used as the nonlinearity estimator to facilitate closed form estimations of the parameters in the M-step. The theoretical foundation of the proposed solution has been rigorously developed and discussed in details. Both simulations and recorded speech signals have been carried out to verify the success and efficacy of the proposed algorithm. Remarkable improvement has been obtained when compared with the existing algorithms.