By Topic

Short-term temporal decomposition and its properties for speech compression

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)
Cheng, Y.M. ; INRS-Telecommun., Quebec Univ., Verdun, Que., Canada ; O'Shaughnessy, D.

A technique of temporal speech compression, called temporal decomposition, is considered. A mathematical presentation of temporal decomposition is discussed from the point of view of speech production. Temporal decomposition is studied in terms of an iterative solution and its convergence. For vocoder applications, a practical algorithm, short-term temporal decomposition, is proposed. The statistical performance of this algorithm was tested on a multispeaker database. The efficiencies of vector quantization and vector predictability were comparatively studied on data derived from the algorithm and on data from linear predictive coding (LPC) analysis. The results show that data from the algorithm have more efficient information transmission via vector quantization than data from LPC, and that vector prediction coding is feasible for the data from temporal decomposition

Published in:

Signal Processing, IEEE Transactions on  (Volume:39 ,  Issue: 6 )