Multiple description lattice vector quantization

variations and extensions

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

Research output: Contribution to journalConference article

Abstract

Multiple description lattice vector quantization (MDLVQ) is a technique for two-channel multiple description coding. We observe that MDLVQ, in the form introduced by Servetto. Vaishampayan and Sloane in 1999, is inherently optimized for the central decoder; i.e., for a zero probability of a lost description. With a nonzero probability of description loss, performance is improved by modifying the encoding rule (using nearest neighbors with respect to 'multiple description distance') and by perturbing the lattice codebook. The perturbation maintains many symmetries and hence does not significantly effect encoding or decoding complexity. An extension to more than two descriptions with attractive decoding properties is outlined.

Original languageEnglish (US)
Pages (from-to)480-489
Number of pages10
JournalData Compression Conference Proceedings
StatePublished - Jan 1 2000
EventData Compression Conference - DDC 2000 - Snowbird, UT, USA
Duration: Mar 28 2000Mar 30 2000

Fingerprint

Vector quantization
Decoding

ASJC Scopus subject areas

  • Computer Networks and Communications

Cite this

Multiple description lattice vector quantization : variations and extensions. / Kelner, Jonathan A.; Goyal, Vivek K.; Kovacevic, Jelena.

In: Data Compression Conference Proceedings, 01.01.2000, p. 480-489.

Research output: Contribution to journalConference article

@article{9cb30d0d44ac4a86a071322f7e3064b3,
title = "Multiple description lattice vector quantization: variations and extensions",
abstract = "Multiple description lattice vector quantization (MDLVQ) is a technique for two-channel multiple description coding. We observe that MDLVQ, in the form introduced by Servetto. Vaishampayan and Sloane in 1999, is inherently optimized for the central decoder; i.e., for a zero probability of a lost description. With a nonzero probability of description loss, performance is improved by modifying the encoding rule (using nearest neighbors with respect to 'multiple description distance') and by perturbing the lattice codebook. The perturbation maintains many symmetries and hence does not significantly effect encoding or decoding complexity. An extension to more than two descriptions with attractive decoding properties is outlined.",
author = "Kelner, {Jonathan A.} and Goyal, {Vivek K.} and Jelena Kovacevic",
year = "2000",
month = "1",
day = "1",
language = "English (US)",
pages = "480--489",
journal = "Proceedings of the Data Compression Conference",
issn = "1068-0314",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - Multiple description lattice vector quantization

T2 - variations and extensions

AU - Kelner, Jonathan A.

AU - Goyal, Vivek K.

AU - Kovacevic, Jelena

PY - 2000/1/1

Y1 - 2000/1/1

N2 - Multiple description lattice vector quantization (MDLVQ) is a technique for two-channel multiple description coding. We observe that MDLVQ, in the form introduced by Servetto. Vaishampayan and Sloane in 1999, is inherently optimized for the central decoder; i.e., for a zero probability of a lost description. With a nonzero probability of description loss, performance is improved by modifying the encoding rule (using nearest neighbors with respect to 'multiple description distance') and by perturbing the lattice codebook. The perturbation maintains many symmetries and hence does not significantly effect encoding or decoding complexity. An extension to more than two descriptions with attractive decoding properties is outlined.

AB - Multiple description lattice vector quantization (MDLVQ) is a technique for two-channel multiple description coding. We observe that MDLVQ, in the form introduced by Servetto. Vaishampayan and Sloane in 1999, is inherently optimized for the central decoder; i.e., for a zero probability of a lost description. With a nonzero probability of description loss, performance is improved by modifying the encoding rule (using nearest neighbors with respect to 'multiple description distance') and by perturbing the lattice codebook. The perturbation maintains many symmetries and hence does not significantly effect encoding or decoding complexity. An extension to more than two descriptions with attractive decoding properties is outlined.

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

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

M3 - Conference article

SP - 480

EP - 489

JO - Proceedings of the Data Compression Conference

JF - Proceedings of the Data Compression Conference

SN - 1068-0314

ER -