Complexity scalability for ACELP and MP-MLQ speech coders

Fu Kun Chen, Jar Ferr Yang, Yu Pin Lin

Research output: Contribution to journalArticlepeer-review

5 Citations (Scopus)

Abstract

For multimedia communications, the computational scalability of a multimedia codec is required to match with different working platforms and integrated services of media sources. In this paper, two condensed stochastic codebook search approaches are proposed to progressively reduce the computation required for the algebraic code excited linear predictive (ACELP) and multi-pulse maximum likelihood quantization (MP-MLQ) coders. By reducing the candidates of the codebook before search procedure, the proposed methods can effectively diminish the computation required for the ITU-T G.723.1 dual rate speech coder. Simulation results show that the proposed methods can save over 50 percent for the stochastic codebook search with perceptually intangible degradation in speech quality.

Original languageEnglish
Pages (from-to)255-263
Number of pages9
JournalIEICE Transactions on Information and Systems
VolumeE85-D
Issue number1
Publication statusPublished - 2002 Jan

All Science Journal Classification (ASJC) codes

  • Software
  • Hardware and Architecture
  • Computer Vision and Pattern Recognition
  • Electrical and Electronic Engineering
  • Artificial Intelligence

Fingerprint Dive into the research topics of 'Complexity scalability for ACELP and MP-MLQ speech coders'. Together they form a unique fingerprint.

Cite this