Title :
Variation of vector quantisation and speech waveform coding
Author :
Nandi, A.K. ; Aburdene, M.F. ; Constantinides, A.G. ; Dologlou, I.
Author_Institution :
Dept. of Electr. Eng., Imperial Coll., London, UK
fDate :
4/1/1991 12:00:00 AM
Abstract :
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 L infinity -norm describing a measure of nearness is presented. The overall computational complexity of this solution is O(n 3 log 2 n). Sample results are presented to demonstrate the advantage of using this technique in the context of coding of speech waveforms.<>
Keywords :
encoding; speech analysis and processing; codevectors; computational complexity; matching problem; speech coding; vector quantisation; waveform coding;
Journal_Title :
Communications, Speech and Vision, IEE Proceedings I
