By Topic

A DCT-based fast signal subspace technique for robust speech recognition

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

2 Author(s)
Huang, J. ; Beckman Inst. for Adv. Sci. & Technol., Illinois Univ., Urbana, IL, USA ; Yunxin Zhao

In this correspondence, a fast computational method is proposed to approximate the Karhunen-Loeve transform (KLT) for the covariance matrix of the autoregressive process. A fast algorithm which reduces the computation of eigenvalues of an N×N symmetric Toeplitz matrix from O(N3) in KLT to N2 is further developed. Experimental results demonstrate that the performance of the fast algorithm is very close to the KLT in eigenvalue computation and in energy constrained signal subspace speech enhancement for speech recognition in a car environment

Published in:

Speech and Audio Processing, IEEE Transactions on  (Volume:8 ,  Issue: 6 )