Cart (Loading....) | Create Account
Close category search window
 

On computational complexity of optimized temporal decomposition algorithm for speech signal modelling

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

1 Author(s)
Athaudage, C.R.N. ; Dept. of Electr. & Electron. Eng., Univ. of Melbourne, Vic., Australia

An optimized algorithm for a temporal decomposition (TD) model of speech is useful for very low-bit-rate speech coding in the context of voice storage applications. The event localizing task associated with the optimized TD is regarded as the major computational component of the algorithm. This paper provides a theoretical analysis of the computational complexity of the optimized TD algorithm which is important from an implementation point of view. Computational complexities of exhaustive, recursive, and Viterbi search techniques as applied to the event localizing task are analyzed. It is proven that Viterbi search achieves the minimum computational complexity with associated cost increasing in proportion to N3 at a fixed event rate, where N is the block size of TD analysis. This result has a significant implication in selecting the block size for a practical implementation of the optimized TD algorithm.

Published in:

Signal Processing, 2002 6th International Conference on  (Volume:1 )

Date of Conference:

26-30 Aug. 2002

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.