Fast CELP coder using Givens bidiagonalisation
T.F. Thorpe · Electronics Letters · 1988
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 here is simpler and results in a fast algorithm with fixed running time.