Variation of vector quantisation and speech waveform coding
A new idea for waveform coding using vector quantisation (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 (inherent in the present context) in the &-norm describing a measure of neamess is presented. The overall computational complexity of this solution is O(n3 log, n). Sample results are presented to demonstrate the advantage of using this technique in the context of coding of speech waveforms.
Communications, Speech and Vision, IEE Proceedings I
Nandi, A. K.; Aburdene, Maurice F.; Constantinides, A. G.; and Dologlou, I.. "Variation of vector quantisation and speech waveform coding." Communications, Speech and Vision, IEE Proceedings I (1991) : 76-80.