OPTIMUM QUANTIZER PERFORMANCE FOR A CLASS OF NON-GAUSSIAN MEMORYLESS SOURCES.

Nariman Farvardin, James W. Modestino

Research output: Contribution to journalArticle

209 Citations (Scopus)

Abstract

The performance of optimum quantizers subject to an entropy constraint is studied for a wide class of memoryless sources. For a general distortion criterion, necessary conditions are developed for optimality and a recursive algorithm is described for obtaining the optimum quantizer. Under a mean-square error criterion, the performance of entropy encoded uniform quantization of memoryless Gaussian sources is well-known to be within 0. 255 bits/sample of the rate-distortion bound at relatively high rates. Despite claims to the contrary, it is demonstrated that similar performance can be expected for a wide range of memoryless sources. Indeed, for the cases considered, the worst case performance is observed to be less than 0. 3 bits/sample from the rate-distortion bound, and in most cases this disparity is less at low rates.

Original languageEnglish
Pages (from-to)485-497
Number of pages13
JournalIEEE Transactions on Information Theory
VolumeIT-30
Issue number3
StatePublished - May 1 1984

Fingerprint

Entropy
entropy
performance
Mean square error

ASJC Scopus subject areas

  • Information Systems
  • Electrical and Electronic Engineering

Cite this

OPTIMUM QUANTIZER PERFORMANCE FOR A CLASS OF NON-GAUSSIAN MEMORYLESS SOURCES. / Farvardin, Nariman; Modestino, James W.

In: IEEE Transactions on Information Theory, Vol. IT-30, No. 3, 01.05.1984, p. 485-497.

Research output: Contribution to journalArticle

Farvardin, Nariman ; Modestino, James W. / OPTIMUM QUANTIZER PERFORMANCE FOR A CLASS OF NON-GAUSSIAN MEMORYLESS SOURCES. In: IEEE Transactions on Information Theory. 1984 ; Vol. IT-30, No. 3. pp. 485-497.
@article{648bff54051448a090258be344174d38,
title = "OPTIMUM QUANTIZER PERFORMANCE FOR A CLASS OF NON-GAUSSIAN MEMORYLESS SOURCES.",
abstract = "The performance of optimum quantizers subject to an entropy constraint is studied for a wide class of memoryless sources. For a general distortion criterion, necessary conditions are developed for optimality and a recursive algorithm is described for obtaining the optimum quantizer. Under a mean-square error criterion, the performance of entropy encoded uniform quantization of memoryless Gaussian sources is well-known to be within 0. 255 bits/sample of the rate-distortion bound at relatively high rates. Despite claims to the contrary, it is demonstrated that similar performance can be expected for a wide range of memoryless sources. Indeed, for the cases considered, the worst case performance is observed to be less than 0. 3 bits/sample from the rate-distortion bound, and in most cases this disparity is less at low rates.",
author = "Nariman Farvardin and Modestino, {James W.}",
year = "1984",
month = "5",
day = "1",
language = "English",
volume = "IT-30",
pages = "485--497",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "3",

}

TY - JOUR

T1 - OPTIMUM QUANTIZER PERFORMANCE FOR A CLASS OF NON-GAUSSIAN MEMORYLESS SOURCES.

AU - Farvardin, Nariman

AU - Modestino, James W.

PY - 1984/5/1

Y1 - 1984/5/1

N2 - The performance of optimum quantizers subject to an entropy constraint is studied for a wide class of memoryless sources. For a general distortion criterion, necessary conditions are developed for optimality and a recursive algorithm is described for obtaining the optimum quantizer. Under a mean-square error criterion, the performance of entropy encoded uniform quantization of memoryless Gaussian sources is well-known to be within 0. 255 bits/sample of the rate-distortion bound at relatively high rates. Despite claims to the contrary, it is demonstrated that similar performance can be expected for a wide range of memoryless sources. Indeed, for the cases considered, the worst case performance is observed to be less than 0. 3 bits/sample from the rate-distortion bound, and in most cases this disparity is less at low rates.

AB - The performance of optimum quantizers subject to an entropy constraint is studied for a wide class of memoryless sources. For a general distortion criterion, necessary conditions are developed for optimality and a recursive algorithm is described for obtaining the optimum quantizer. Under a mean-square error criterion, the performance of entropy encoded uniform quantization of memoryless Gaussian sources is well-known to be within 0. 255 bits/sample of the rate-distortion bound at relatively high rates. Despite claims to the contrary, it is demonstrated that similar performance can be expected for a wide range of memoryless sources. Indeed, for the cases considered, the worst case performance is observed to be less than 0. 3 bits/sample from the rate-distortion bound, and in most cases this disparity is less at low rates.

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

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

M3 - Article

AN - SCOPUS:0021422549

VL - IT-30

SP - 485

EP - 497

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 3

ER -