Share Email Print

Proceedings Paper

Lattice vector quantization with reduced or without look-up table
Author(s): Patrick Rault; Christine M. Guillemot
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

This paper describes a new vector indexing algorithm for Lattice Vector Quantization (LVQ). The technique applies to a large class of lattices such as Zn, An, Dn, or E8, widely used in signal compression. Relying on a partitioning of the events sources, based on a notion of leaders as proposed, it allows to trade vector look-up table size for arithmetic operations. At the cost of a very small number of integer arithmetic operations, The algorithm leads to a very significant reduction of the vector look-up tables. This in turn leads to reduced encoder and decoder complexities. The introduction of the concept of 'absolute' leaders, and of the corresponding coding and decoding algorithms, provides additional flexibility in trading table size for arithmetic operations. The association of these vector indexing techniques with product codes, in the framework of LVQ, leads to increased compression performances.

Paper Details

Date Published: 9 January 1998
PDF: 12 pages
Proc. SPIE 3309, Visual Communications and Image Processing '98, (9 January 1998); doi: 10.1117/12.298397
Show Author Affiliations
Patrick Rault, CCETT (France)
Christine M. Guillemot, CCETT (France)

Published in SPIE Proceedings Vol. 3309:
Visual Communications and Image Processing '98
Sarah A. Rajala; Majid Rabbani, Editor(s)

© SPIE. Terms of Use
Back to Top