Candidate scheme for fast ACELP search

Author

Chen, F.K. ; Yang, J.-F. ; Yan, Y.-L.

Author_Institution

Dept. of Electr. Eng., Nat. Cheng Kung Univ., Tainan, Taiwan

Volume

149

Issue

1

fYear

2002

fDate

2/1/2002 12:00:00 AM

Firstpage

10

Lastpage

16

Abstract

The algebraic code excited linear prediction (ACELP) algorithm has been adopted by many speech coding standards, due to low complexity and high quality in its analysis-by-synthesis optimisation. For further computational complexity reduction, the authors propose a fast ACELP algorithm using a designed pilot function to predict the predetermined candidate pulses. With candidate pulses, it is possible to not only reduce the number of search loops but also to avoid the computation of unnecessary correlation functions. The proposed candidate position scheme can be applied to all ACELP coders such as the ITU G-723.1 and G.729 as well as the GSM enhanced full rate (EFR) speech coding standards. Simulation results show that the computational load can be reduced by about 50-80% with almost imperceptible degradation in performance

Keywords

adaptive codes; code standards; computational complexity; linear predictive coding; optimisation; search problems; speech coding; speech synthesis; telecommunication standards; ACELP coders; GSM; ITU G-6.729; ITU G-723.1; algebraic code excited linear prediction; analysis-by-synthesis optimisation; candidate pulses; computational complexity reduction; computational load; correlation functions; enhanced full rate speech coding standards; fast ACELP algorithm; fast ACELP search; low complexity algorithm; pilot function; search loops reduction; simulation results;

fLanguage

English

Journal_Title

Vision, Image and Signal Processing, IEE Proceedings -

Publisher

iet

ISSN

1350-245X

Type

jour

DOI

10.1049/ip-vis:20020151

Filename

999165