Multiple description vector quantization with a coarse lattice

Vivek K. Goyal, Jonathan A. Kelner, Jelena Kovacevic

Research output: Contribution to journalArticle

Abstract

A multiple description (MD) lattice vector quantization technique for two descriptions was recently introduced in which fine and coarse codebooks are both lattices. The encoding begins with quantization to the nearest point in the fine lattice. This encoding is an inherent optimization for the decoder that receives both descriptions; performance can be improved with little increase in complexity by considering all decoders in the initial encoding step. The altered encoding relies only on the symmetries of the coarse lattice. This allows us to further improve performance without a significant increase in complexity by replacing the fine lattice codebook with a nonlattice codebook that respects many of the symmetries of the coarse lattice. Examples constructed with the two-dimensional (2-D) hexagonal lattice demonstrate large improvement over time sharing between previously known quantizers.

Original languageEnglish (US)
Pages (from-to)781-788
Number of pages8
JournalIEEE Transactions on Information Theory
Volume48
Issue number3
DOIs
StatePublished - Mar 1 2002

Fingerprint

Vector quantization
performance
time

Keywords

  • Codebook optimization
  • High-rate source coding
  • Lattice vector quantization

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences

Cite this

Multiple description vector quantization with a coarse lattice. / Goyal, Vivek K.; Kelner, Jonathan A.; Kovacevic, Jelena.

In: IEEE Transactions on Information Theory, Vol. 48, No. 3, 01.03.2002, p. 781-788.

Research output: Contribution to journalArticle

Goyal, Vivek K. ; Kelner, Jonathan A. ; Kovacevic, Jelena. / Multiple description vector quantization with a coarse lattice. In: IEEE Transactions on Information Theory. 2002 ; Vol. 48, No. 3. pp. 781-788.
@article{eece219ecb5b4c40a637a48b58687998,
title = "Multiple description vector quantization with a coarse lattice",
abstract = "A multiple description (MD) lattice vector quantization technique for two descriptions was recently introduced in which fine and coarse codebooks are both lattices. The encoding begins with quantization to the nearest point in the fine lattice. This encoding is an inherent optimization for the decoder that receives both descriptions; performance can be improved with little increase in complexity by considering all decoders in the initial encoding step. The altered encoding relies only on the symmetries of the coarse lattice. This allows us to further improve performance without a significant increase in complexity by replacing the fine lattice codebook with a nonlattice codebook that respects many of the symmetries of the coarse lattice. Examples constructed with the two-dimensional (2-D) hexagonal lattice demonstrate large improvement over time sharing between previously known quantizers.",
keywords = "Codebook optimization, High-rate source coding, Lattice vector quantization",
author = "Goyal, {Vivek K.} and Kelner, {Jonathan A.} and Jelena Kovacevic",
year = "2002",
month = "3",
day = "1",
doi = "10.1109/18.986048",
language = "English (US)",
volume = "48",
pages = "781--788",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "3",

}

TY - JOUR

T1 - Multiple description vector quantization with a coarse lattice

AU - Goyal, Vivek K.

AU - Kelner, Jonathan A.

AU - Kovacevic, Jelena

PY - 2002/3/1

Y1 - 2002/3/1

N2 - A multiple description (MD) lattice vector quantization technique for two descriptions was recently introduced in which fine and coarse codebooks are both lattices. The encoding begins with quantization to the nearest point in the fine lattice. This encoding is an inherent optimization for the decoder that receives both descriptions; performance can be improved with little increase in complexity by considering all decoders in the initial encoding step. The altered encoding relies only on the symmetries of the coarse lattice. This allows us to further improve performance without a significant increase in complexity by replacing the fine lattice codebook with a nonlattice codebook that respects many of the symmetries of the coarse lattice. Examples constructed with the two-dimensional (2-D) hexagonal lattice demonstrate large improvement over time sharing between previously known quantizers.

AB - A multiple description (MD) lattice vector quantization technique for two descriptions was recently introduced in which fine and coarse codebooks are both lattices. The encoding begins with quantization to the nearest point in the fine lattice. This encoding is an inherent optimization for the decoder that receives both descriptions; performance can be improved with little increase in complexity by considering all decoders in the initial encoding step. The altered encoding relies only on the symmetries of the coarse lattice. This allows us to further improve performance without a significant increase in complexity by replacing the fine lattice codebook with a nonlattice codebook that respects many of the symmetries of the coarse lattice. Examples constructed with the two-dimensional (2-D) hexagonal lattice demonstrate large improvement over time sharing between previously known quantizers.

KW - Codebook optimization

KW - High-rate source coding

KW - Lattice vector quantization

UR - http://www.scopus.com/inward/record.url?scp=0036495827&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0036495827&partnerID=8YFLogxK

U2 - 10.1109/18.986048

DO - 10.1109/18.986048

M3 - Article

VL - 48

SP - 781

EP - 788

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 3

ER -