Complexity scalability design in global pulse replacement algorithm for ACELP speech codecs

Author

Chen, Fu-Kun ; Su, Bo-Kai ; Jou, Yue-Dar

Author_Institution

Dept. of Comput. Sci. & Inf. Eng., Southern Taiwan Univ., Tainan, Taiwan

fYear

2009

fDate

5-7 July 2009

Firstpage

1

Lastpage

4

Abstract

The algebraic code excited linear prediction (ACELP) algorithm, due to low complexity and high quality in its analysis-by-synthesis (AbS) optimization, has been adopted by many speech coding standards. In this paper, the scalability of computational complexity to the global pulse replacement search method for ACELP is proposed. In addition, the proposed method can achieve the lowest computational complexity with perceptually negligible degradation. Based on the standard subjective and objective quality measurements, the experimental results reflect the facts.

Keywords

computational complexity; optimisation; speech coding; algebraic code excited linear prediction speech codecs; analysis-by-synthesis optimization; complexity scalability design; computational complexity; global pulse replacement algorithm; speech coding standards; standard objective measurements; standard subjective measurements; Algorithm design and analysis; Code standards; Computational complexity; Degradation; Prediction algorithms; Scalability; Search methods; Speech analysis; Speech codecs; Speech coding; ACELP; Speech coding; complexity scalability; global pulse replacement; stochastic codebook;

fLanguage

English

Publisher

ieee

Conference_Titel

Digital Signal Processing, 2009 16th International Conference on

Conference_Location

Santorini-Hellas

Print_ISBN

978-1-4244-3297-4

Electronic_ISBN

978-1-4244-3298-1

Type

conf

DOI

10.1109/ICDSP.2009.5201059

Filename

5201059