A parallel processing algorithm for vector quantizer design based on subpartitioning

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