Cart (Loading....) | Create Account
Close category search window
 

An Efficient Parallel Algorithm for Vector Quantizer Design

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Jianhua Lin ; Eastern Connecticut State University, USA

Vector quantization is a technique used extensively and successfully to compress digitized data such as speech and images. The design of a vector quantizer is very computationally intensive. Parallel algorithms based on various architectures have been proposed for related applications in clustering. These algorithms are in general not practical for the vector quantization problem because of the magnitude of the parameters involved. We present a parallel SIMD algorithm which can run efficiently on parallel machines of variable sizes. The speedup and efficiency of the algorithms are high across a wide range of input parameters.

Published in:

Parallel Processing, 1994. Vol. 1. ICPP 1994. International Conference on  (Volume:3 )

Date of Conference:

15-19 Aug. 1994

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.