By Topic

Improved colored noise handling in Kalman Filter-based speech enhancement algorithms

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Mustiere, F. ; Sch. of Inf. Technol. & Eng., Univ. of Ottawa, Ottawa, ON ; Bolic, M. ; Bouchard, M.

This paper presents a simple alternative to the traditional handling of autoregressive colored observation noise processes in Kalman filter-based speech enhancement algorithms. The method is entirely centered on a rewriting of the state-space equations describing the problem. The proposed approach decreases the dimension of the state vector and the amount of computations per iteration, and also naturally reduces to the white noise case when a zero-order autoregressive colored noise is chosen. In addition, from the multiple experiments conducted using several Kalman filter-based algorithms, it is found that the quality obtained with the new method, as measured by different speech quality measures, is equivalent and in some cases better. The simulations presented are based on both computer-generated and real-world colored noises, in stationary and nonstationary cases.

Published in:

Electrical and Computer Engineering, 2008. CCECE 2008. Canadian Conference on

Date of Conference:

4-7 May 2008