Complexity reduction in fully vector quantised stochastic coders
P.G. Hammett · Electronics Letters · 1987
Stochastic linear predictive coders can produce good quality speech at low bit rates but are computationally very demanding. A method for reducing the computational complexity of the selection process for the optimum innovation sequence is described. The improved efficiency can be achieved without any reduction in the performance of the coder.