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)

Translated title of the contribution: An efficient search strategy for ACELP algebraic codebook by means of reduced candidate mechanism and iteration-free pulse replacement

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

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

2 Scopus citations

Abstract

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.

Translated title of the contributionAn efficient search strategy for ACELP algebraic codebook by means of reduced candidate mechanism and iteration-free pulse replacement
Original languageLithuanian
Pages (from-to)183-187
Number of pages5
JournalInformation Technology and Control
Volume43
Issue number2
DOIs
StatePublished - 1 Jan 2014

Cite this