Complexity Scalability for ACELP and MP-MLQ Speech Coders

概要

論文の詳細を見る
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.
社団法人電子情報通信学会の論文
2002-01-01