A parallel processing algorithm for vector quantizer design based on subpartitioning

Author

Zeger, Kenneth ; Gersho, Allen

Author_Institution

Dept. of Electr. Eng., Hawaii Univ., Honolulu, HI, USA

fYear

1991

fDate

14-17 Apr 1991

Firstpage

1141

Abstract

A technique for designing vector quantizers that is well suited for parallel processing environments is presented. The input space is iteratively partitioned into M disjoint connected regions composed of unions of partition regions. Each of M processors then independently commutes an optimal subquantizer for its restricted input space. The partitions can regularly be changed to further improve the overall quantizer performance. This technique can improve on the performance of the generalized Lloyd algorithm by following the traditional design process with the subpartitioning iterations

Keywords

data compression; parallel algorithms; disjoint connected regions; generalized Lloyd algorithm; input space; optimal subquantizer; parallel processing algorithm; quantizer performance; subpartitioning iterations; vector quantizer design; Algorithm design and analysis; Computational complexity; Computational modeling; Concurrent computing; Information processing; Iterative algorithms; Parallel processing; Partitioning algorithms; Simulated annealing; Vector quantization;

fLanguage

English

Publisher

ieee

Conference_Titel

Acoustics, Speech, and Signal Processing, 1991. ICASSP-91., 1991 International Conference on

Conference_Location

Toronto, Ont.

ISSN

1520-6149

Print_ISBN

0-7803-0003-3

Type

conf

DOI

10.1109/ICASSP.1991.150570

Filename

150570