For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
Complexity Scalability for ACELP and MP-MLQ Speech Coders
Fu-Kun CHEN Jar-Ferr YANG Yu-Pin LIN
IEICE TRANSACTIONS on Information and Systems
Publication Date: 2002/01/01
Print ISSN: 0916-8532
Type of Manuscript: PAPER
Category: Speech and Hearing
speech coding, ACELP, MP-MLQ, complexity scalability,
Full Text: PDF>>
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.