Title :
Low Complexity Search Method for G.723.1 MP-MLQ Algorithm
Author :
Lin, R.S. ; Chen, Y.C. ; Chen, F.K.
Author_Institution :
Dept. of Comput. Sci. & Inf. Eng., Southern Taiwan Univ.
Abstract :
The Multi-pulse Maximum Likelihood Quantization (MP-MLQ) algorithm with high complexity and high quality in its analysis-by-synthesis optimization has been used by many speech coding standards. To reduce the computational complexity of MP-MLQ in ITU-T G.723.1 speech codec, in this paper, we propose a fast search algorithm by using a designed function and the multi-track positions structure to predict the candidate pulses for each subframe. Simulation results show that the degradation of PESQ score for the pro-posed approach is about 0.069 relative to the original search procedure. However, the proposed approach reduced the computational complexity about 98.346% with perceptually negligible degradation.
Keywords :
computational complexity; maximum likelihood estimation; prediction theory; quantisation (signal); search problems; speech codecs; speech coding; speech synthesis; G.723.1 multipulse maximum likelihood quantization algorithm; analysis-by-synthesis optimization; complexity search method; multitrack position structure; prediction theory; speech codec; speech coding standard; Algorithm design and analysis; Computational complexity; Degradation; Internet telephony; Linear predictive coding; Personal digital assistants; Quantization; Search methods; Speech coding; Stochastic processes; G.723.1; Low complexity; MP-MLQ; candidate pulses;
Conference_Titel :
Intelligent Systems Design and Applications, 2008. ISDA '08. Eighth International Conference on
Conference_Location :
Kaohsiung
Print_ISBN :
978-0-7695-3382-7
DOI :
10.1109/ISDA.2008.203
