Candidate scheme for MP-MLQ search in G723.1

Fu Kun Chen, Jar Ferr Yang

研究成果: Conference contribution

2 引文 斯高帕斯(Scopus)

摘要

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.

原文English
主出版物標題2001 IEEE 3rd Workshop on Signal Processing Advances in Wireless Communications, SPAWC 2001
發行者Institute of Electrical and Electronics Engineers Inc.
頁面368-371
頁數4
ISBN(電子)0780367200
DOIs
出版狀態Published - 2001 一月 1
事件3rd IEEE Workshop on Signal Processing Advances in Wireless Communications, SPAWC 2001 - Taoyuan, Taiwan
持續時間: 2001 三月 202001 三月 23

出版系列

名字IEEE Workshop on Signal Processing Advances in Wireless Communications, SPAWC
2001-January

Other

Other3rd IEEE Workshop on Signal Processing Advances in Wireless Communications, SPAWC 2001
國家/地區Taiwan
城市Taoyuan
期間01-03-2001-03-23

All Science Journal Classification (ASJC) codes

  • 電氣與電子工程
  • 電腦科學應用
  • 資訊系統

指紋

深入研究「Candidate scheme for MP-MLQ search in G723.1」主題。共同形成了獨特的指紋。

引用此