Efektyvi paieškos strategija algoritmo ACELP algebriniam kodu{ogonek} vykdymo protokolui, naudojant redukuoto kandidato mechanizma{ogonek} (RCM) ir nuo iteracijos nepriklausanti{ogonek} impulso pakeitima{ogonek} (IFPR)

Chao Ping Chu, Cheng Yu Yeh*, Shaw-Hwa Hwang

*Corresponding author for this work

研究成果: Article同行評審

2 引文 斯高帕斯(Scopus)

摘要

This work aims to present a combined version of reduced candidate mechanism (RCM) and iteration free pulse replacement (IFPR) as a novel and efficient way to enhance the performance of algebraic codebook search in an algebraic code-excited linear-prediction (ACELP) speech coder. As the first step, individual pulse contribution in each track is given by RCM, and the number N of candidate pulses is then specified. Subsequently, the replacement of a pulse is performed through the search over the sorted top N pulses by IFPR, and those of 2 to 4 pulses are carried out by a standard IFPR. Implemented on a G.729A speech codec, this proposal requires as few as 24 searches, a search load tantamount to 7.5% of G.729A, 37.5% of the global pulse replacement method (iteration=2), 50% of IFPR, but still provides a comparable speech quality in any case. The aim of significant search performance improvement is hence achieved in this work.

貢獻的翻譯標題An efficient search strategy for ACELP algebraic codebook by means of reduced candidate mechanism and iteration-free pulse replacement
原文Lithuanian
頁(從 - 到)183-187
頁數5
期刊Information Technology and Control
43
發行號2
DOIs
出版狀態Published - 1 一月 2014

Keywords

  • Algebraic codebook search
  • Iteration-free pulse replacement
  • Reduced candidate mechanism (RCM)
  • Speech codec

引用此