A fast ACELP codebook search method

KJ Byun*, HB Jung, Minsoo Hahn, KS Kim

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference proceeding contributionpeer-review

10 Citations (Scopus)


The ACELP coding algorithm has been widely adopted in standard speech coders due to the advantages of codebook storage and the efficient search scheme. Especially, the focused. search and the depth first tree search are very efficient methods dramatically reducing the search complexity while providing a good sub optimal solution, In this paper, we propose a fast algebraic codebook search method which improves the depth first tree search method. The proposed method reduces the search complexity by pruning the trees which are less possible to be selected as an optimum excitation. This method needs no additional computation for the selection of trees to be pruned and reduce the computational complexity considerably compared with the original depth first tree search method with very slight degradation of speech quality. We also implemented a GSM EFR codec chosen as an example to examine our method on the 16 bit fixed-point DSP.

Original languageEnglish
Title of host publication2002 6th international conference on signal processing proceedings
Subtitle of host publication Vols I and II
EditorsBZ Yuanong, XF Tang
Place of PublicationPiscataway, New Jersey
PublisherInstitute of Electrical and Electronics Engineers (IEEE)
Number of pages4
ISBN (Print)0-7803-7488-6
Publication statusPublished - Aug 2002
Externally publishedYes
Event6th International Conference on Signal Processing - BEIJING
Duration: 26 Aug 200230 Aug 2002


Conference6th International Conference on Signal Processing




Dive into the research topics of 'A fast ACELP codebook search method'. Together they form a unique fingerprint.

Cite this