Candidate scheme for fast ACELP search

F. K. Chen, Jar-Ferr Yang, Y. L. Yan

Research output: Contribution to journalArticle

23 Citations (Scopus)

Abstract

The algebraic code excited linear prediction (ACELP) algorithm has been adopted by many speech coding standards, due to low complexity and high quality in its analysis-by-synthesis optimisation. For further computational complexity reduction, the authors propose a fast ACELP algorithm using a designed pilot function to predict the predetermined candidate pulses. With candidate pulses, it is possible to not only reduce the number of search loops but also to avoid the computation of unnecessary correlation functions. The proposed candidate position scheme can be applied to all ACELP coders such as the ITU G-723.1 and G.729 as well as the GSM enhanced full rate (EFR) speech coding standards. Simulation results show that the computational load can be reduced by about 50-80% with almost imperceptible degradation in performance.

Original languageEnglish
Pages (from-to)10-16
Number of pages7
JournalIEE Proceedings: Vision, Image and Signal Processing
Volume149
Issue number1
DOIs
Publication statusPublished - 2002 Feb 1

All Science Journal Classification (ASJC) codes

  • Signal Processing
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Candidate scheme for fast ACELP search'. Together they form a unique fingerprint.

  • Cite this