Title :
Fast CELP coder using Givens bidiagonalisation
Author_Institution :
Dept. of Eng., Cambridge Univ., UK
fDate :
5/26/1988 12:00:00 AM
Abstract :
CELP speech coders give good performance but require considerable computational power. Earlier work showed how singular value decomposition can be used to speed up the calculations required for codebook search in the CELP. The bidiagonal decomposition proposed by the author is simpler and results in a fast algorithm with fixed running time
Keywords :
encoding; filtering and prediction theory; speech analysis and processing; CELP coder; Givens bidiagonalisation; code excited linear prediction; codebook search; encoding; fast algorithm; fixed running time; speech coders;
Journal_Title :
Electronics Letters