A vector quantizer for the Laplace source

Author

Swaszek, Peter F.

Author_Institution

Dept. of Electr. Eng., Rhode Island Univ., Kingston, RI, USA

Volume

37

Issue

5

fYear

1991

fDate

9/1/1991 12:00:00 AM

Firstpage

1355

Lastpage

1365

Abstract

The low complexity, nearly optimal vector quantizer (VQ) is a generalization of T. R. Fischer´s (1986) pyramid VQ and is similar in structure to the unrestricted polar quantizers previously presented for the independent Gaussian source. An analysis of performance is presented with results for both the product code pyramid VQ and the unrestricted version. This analysis, although asymptotic in nature, helps to demonstrate the performance advantages of the VQ. Implementation issues of the VQ are discussed. Nonasymptotic results are considered. In particular, the author presents an approximate design algorithm for finite bit rate and demonstrates the usefulness of this VQ through several example designs with Monte Carlo simulations of performance. For the restricted form (the pyramid VQ), the author provides further implementational information and low dimension analytical results

Keywords

data compression; encoding; information theory; Laplace source; Monte Carlo simulations; asymptotic analysis; product code; pyramid vector quantisation; source coding; vector quantizer; Bit rate; Encoding; Image coding; Image resolution; Performance gain; Probability density function; Product codes; Quantization; Region 7; Source coding;

fLanguage

English

Journal_Title

Information Theory, IEEE Transactions on

Publisher

ieee

ISSN

0018-9448

Type

jour

DOI

10.1109/18.133252

Filename

133252