Lattice-based designs of direct sum codebooks for vector quantization

Clark W. Barrett, Richard L. Frost

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

A direct sum codebook (DSC) has the potential to reduce both memory and computational costs of vector quantization. A DSC consists of several sets or stages of vectors. An equivalent code vector is made from the direct sum of one vector from each stage. Lattice based DSC quantizers are designed to be optimal under a residual encoding by avoiding entanglement. Experimental results show that DSC quantizers based on cubical lattices perform as well as exhaustive search quantizers on a scalar source. Performance increases with vector dimension on sources with memory, though not quite as much as with an exhaustive search. Additional savings in rate are obtainable by using variable length code vectors.

Original languageEnglish (US)
Title of host publicationData Compression Conference Proceedings
PublisherIEEE
Pages436
Number of pages1
StatePublished - 1995
EventProceedings of the 5th Data Compression Conference - Snowbird, UT, USA
Duration: Mar 28 1995Mar 30 1995

Other

OtherProceedings of the 5th Data Compression Conference
CitySnowbird, UT, USA
Period3/28/953/30/95

Fingerprint

Vector quantization
Data storage equipment
Costs

ASJC Scopus subject areas

  • Hardware and Architecture
  • Electrical and Electronic Engineering

Cite this

Barrett, C. W., & Frost, R. L. (1995). Lattice-based designs of direct sum codebooks for vector quantization. In Data Compression Conference Proceedings (pp. 436). IEEE.

Lattice-based designs of direct sum codebooks for vector quantization. / Barrett, Clark W.; Frost, Richard L.

Data Compression Conference Proceedings. IEEE, 1995. p. 436.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Barrett, CW & Frost, RL 1995, Lattice-based designs of direct sum codebooks for vector quantization. in Data Compression Conference Proceedings. IEEE, pp. 436, Proceedings of the 5th Data Compression Conference, Snowbird, UT, USA, 3/28/95.
Barrett CW, Frost RL. Lattice-based designs of direct sum codebooks for vector quantization. In Data Compression Conference Proceedings. IEEE. 1995. p. 436
Barrett, Clark W. ; Frost, Richard L. / Lattice-based designs of direct sum codebooks for vector quantization. Data Compression Conference Proceedings. IEEE, 1995. pp. 436
@inproceedings{2541b790fdf34260a5df7fe355a3ce8e,
title = "Lattice-based designs of direct sum codebooks for vector quantization",
abstract = "A direct sum codebook (DSC) has the potential to reduce both memory and computational costs of vector quantization. A DSC consists of several sets or stages of vectors. An equivalent code vector is made from the direct sum of one vector from each stage. Lattice based DSC quantizers are designed to be optimal under a residual encoding by avoiding entanglement. Experimental results show that DSC quantizers based on cubical lattices perform as well as exhaustive search quantizers on a scalar source. Performance increases with vector dimension on sources with memory, though not quite as much as with an exhaustive search. Additional savings in rate are obtainable by using variable length code vectors.",
author = "Barrett, {Clark W.} and Frost, {Richard L.}",
year = "1995",
language = "English (US)",
pages = "436",
booktitle = "Data Compression Conference Proceedings",
publisher = "IEEE",

}

TY - GEN

T1 - Lattice-based designs of direct sum codebooks for vector quantization

AU - Barrett, Clark W.

AU - Frost, Richard L.

PY - 1995

Y1 - 1995

N2 - A direct sum codebook (DSC) has the potential to reduce both memory and computational costs of vector quantization. A DSC consists of several sets or stages of vectors. An equivalent code vector is made from the direct sum of one vector from each stage. Lattice based DSC quantizers are designed to be optimal under a residual encoding by avoiding entanglement. Experimental results show that DSC quantizers based on cubical lattices perform as well as exhaustive search quantizers on a scalar source. Performance increases with vector dimension on sources with memory, though not quite as much as with an exhaustive search. Additional savings in rate are obtainable by using variable length code vectors.

AB - A direct sum codebook (DSC) has the potential to reduce both memory and computational costs of vector quantization. A DSC consists of several sets or stages of vectors. An equivalent code vector is made from the direct sum of one vector from each stage. Lattice based DSC quantizers are designed to be optimal under a residual encoding by avoiding entanglement. Experimental results show that DSC quantizers based on cubical lattices perform as well as exhaustive search quantizers on a scalar source. Performance increases with vector dimension on sources with memory, though not quite as much as with an exhaustive search. Additional savings in rate are obtainable by using variable length code vectors.

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

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

M3 - Conference contribution

SP - 436

BT - Data Compression Conference Proceedings

PB - IEEE

ER -