Advertisement

A massively parallel implementation of the full search vector quantization algorithm

  • Paul Lukowicz
  • Jutta Schiffers
  • Rudi Cober
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 796)

Abstract

We present a massively parallel version of a full search vector quantization and its application in the development of an audio-visual speech recognition system. The parallel implementation reduced the worst case runtime of (estimated) 80–100 hours on a 10 MFLOP SPARC to less then 2 hours on a 2.4 GFOLP MasPar MP2216. This demonstrates how the use of parallel computers reduces product development time and leads to a more mature design by allowing for more extensive experimentation with different data sets.

References

  1. 1.
    Allen Gersho, Robert M. Gray, Vector Quantization and Signal Compression Kluwer Academic Publishers, Boston, 1992Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Paul Lukowicz
    • 1
  • Jutta Schiffers
    • 2
  • Rudi Cober
    • 2
  1. 1.Fakultät für InformatikUniversität KarlsruheKarlsruheF.R.G.
  2. 2.FAW UlmUlmF.R.G.

Personalised recommendations