A new idea for speech waveform coding using vector quantization and solution to the matching problem in L/sub infinity /-norm

A new idea for waveform coding using vector quantization (VQ) is introduced. This idea makes it possible to deal with codevectors much larger than before for a fixed bit per sample rate. Also a solution to the matching problem in the L/sub infinity /-norm describing a measure of nearness is presented. The overall computational complexity of the solution is O(n/sup 3/log/sub 2/n). Sample results are presented to demonstrate the advantage of using this technique in the context of coding of speech waveforms.<
>