• DocumentCode
    273905
  • Title

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

  • Author

    Nandi, A.K. ; Aburdene, M.F. ; Constantinides, A.G. ; Dologlou, I.

  • Author_Institution
    Imperial Coll., London, UK
  • fYear
    1989
  • fDate
    5-8 Sep 1989
  • Firstpage
    522
  • Lastpage
    526
  • Abstract
    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∞-norm describing a measure of nearness is presented. The overall computational complexity of the solution is O(n3log2n). 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; matching problem; nearness; overall computational complexity; speech waveform coding; vector quantization;
  • fLanguage
    English
  • Publisher
    iet
  • Conference_Titel
    Circuit Theory and Design, 1989., European Conference on
  • Conference_Location
    Brighton
  • Type

    conf

  • Filename
    51674
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=273905