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

Complexity scalability design in global pulse replacement algorithm for ACELP speech codecs

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)
Fu-Kun Chen ; Dept. of Comput. Sci. & Inf. Eng., Southern Taiwan Univ., Tainan, Taiwan ; Bo-Kai Su ; Yue-Dar Jou

The algebraic code excited linear prediction (ACELP) algorithm, due to low complexity and high quality in its analysis-by-synthesis (AbS) optimization, has been adopted by many speech coding standards. In this paper, the scalability of computational complexity to the global pulse replacement search method for ACELP is proposed. In addition, the proposed method can achieve the lowest computational complexity with perceptually negligible degradation. Based on the standard subjective and objective quality measurements, the experimental results reflect the facts.

Published in:

Digital Signal Processing, 2009 16th International Conference on

Date of Conference:

5-7 July 2009

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.