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

Candidate scheme for MP-MLQ search in G723.1

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)
Fu-Kun Chen ; Dept. of Electr. Eng., Nat. Cheng Kung Univ., Tainan, Taiwan ; Jar-Ferr Yang

For the purpose of low cost or low power consumption, a cost-effective solution with good trade-off between quality and complexity must be estimated for a small mobile device. We propose a condensed MP-MLQ algorithm to reduce the search computation required for G723.1. Simulation results show that the proposed method can reduce about 50~82% the computational load for stochastic codebook search with perceptually intangible degradation. This reduction would be helpful to save power consumption and relax the CPU load for a mobile device in wireless communication, e.g., PALM, PDA

Published in:

Wireless Communications, 2001. (SPAWC '01). 2001 IEEE Third Workshop on Signal Processing Advances in

Date of Conference:


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.