Scheduled System Maintenance:
On May 6th, single article purchases and IEEE account management will be unavailable from 8:00 AM - 5:00 PM ET (12:00 - 21:00 UTC). We apologize for the inconvenience.
By Topic

A fast adaptive Kalman filtering algorithm for speech enhancement

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

4 Author(s)
Quanshen Mai ; Beijing Univ. of Technol., Beijing, China ; Dongzhi He ; Yibin Hou ; Zhangqin Huang

The speech enhancement is one of the effective techniques to solve speech degraded by noise. In this paper a fast speech enhancement method for noisy speech signals is presented, which is based on improved Kalman filtering. The conventional Kalman filter algorithm for speech enhancement needs to calculate the parameters of AR (auto-regressive) model, and perform a lot of matrix operations, which usually is non-adaptive. The speech enhancement algorithm proposed in this paper eliminates the matrix operations and reduces the calculating time by only constantly updating the first value of state vector X(n). We design a coefficient factor for adaptive filtering, to automatically amend the estimation of environmental noise by the observation data. Simulation results show that the fast adaptive algorithm using Kalman filtering is effective for speech enhancement.

Published in:

Automation Science and Engineering (CASE), 2011 IEEE Conference on

Date of Conference:

24-27 Aug. 2011