Variation of vector quantisation and speech waveform coding

A. K. Nandi; Maurice F. Aburdene; A. G. Constantinides; I. Dologlou

Variation of vector quantisation and speech waveform coding

A. K. Nandi
, Maurice F. Aburdene
, A. G. Constantinides
, I. Dologlou

Bucknell University

Research output: Contribution to journal › Article › peer-review

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 &-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.

Original language	American English
Journal	Default journal
Volume	138
State	Published - Apr 1 1991

Disciplines

Mathematics

Cite this

@article{e0e60e4b0c3e44799be4ed6d8ca88600,

title = "Variation of vector quantisation and speech waveform coding",

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 \&-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.",

author = "Nandi, \{A. K.\} and Aburdene, \{Maurice F.\} and Constantinides, \{A. G.\} and I. Dologlou",

year = "1991",

month = apr,

day = "1",

language = "American English",

volume = "138",

journal = "Default journal",

}

TY - JOUR

T1 - Variation of vector quantisation and speech waveform coding

AU - Nandi, A. K.

AU - Aburdene, Maurice F.

AU - Constantinides, A. G.

AU - Dologlou, I.

PY - 1991/4/1

Y1 - 1991/4/1

N2 - 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.

AB - 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.

UR - https://digitalcommons.bucknell.edu/fac_journ/409

M3 - Article

VL - 138

JO - Default journal

JF - Default journal

ER -

Variation of vector quantisation and speech waveform coding

Abstract

Disciplines

Other files and links

Cite this