ON OVERFLOW AND UNDERFLOW PROBLEMS IN BUFFER-INSTRUMENTED VARIABLE-LENGTH CODING OF FIXED-RATE MEMORYLESS SOURCES.

Nariman Farvardin, James W. Modestino

Research output: Contribution to journalArticle

9 Citations (Scopus)

Abstract

Variable-length coding schemes can be used in entropy encoding of finite-alphabet sources, but to transmit these codes over a synchronous channel requires a buffer. Since this buffer is of finite size, it is subject to both overflow and underflow. The buffer behavior is studied with particular application to Huffman coding of the outputs of an optimum uniform-threshold quantizer driven by a memoryless Gaussian source. Fairly general upper and lower bounds on the average terminal time are developed. Under certain conditions, the tightness of these bounds is verified, and asymptotic formulas are developed. As an example, an encoding scheme using Huffman codes in conjunction with uniform quantization of memoryless Gaussian sources is considered, and the buffer behavior is studied as a function of the buffer size and output rate.

Original languageEnglish
Pages (from-to)839-845
Number of pages7
JournalIEEE Transactions on Information Theory
VolumeIT-32
Issue number6
StatePublished - Nov 1 1986

Fingerprint

coding
Entropy
entropy
time

ASJC Scopus subject areas

  • Information Systems
  • Electrical and Electronic Engineering

Cite this

ON OVERFLOW AND UNDERFLOW PROBLEMS IN BUFFER-INSTRUMENTED VARIABLE-LENGTH CODING OF FIXED-RATE MEMORYLESS SOURCES. / Farvardin, Nariman; Modestino, James W.

In: IEEE Transactions on Information Theory, Vol. IT-32, No. 6, 01.11.1986, p. 839-845.

Research output: Contribution to journalArticle

@article{addb7fc1a9a64af9a520fe7241bb3ea8,
title = "ON OVERFLOW AND UNDERFLOW PROBLEMS IN BUFFER-INSTRUMENTED VARIABLE-LENGTH CODING OF FIXED-RATE MEMORYLESS SOURCES.",
abstract = "Variable-length coding schemes can be used in entropy encoding of finite-alphabet sources, but to transmit these codes over a synchronous channel requires a buffer. Since this buffer is of finite size, it is subject to both overflow and underflow. The buffer behavior is studied with particular application to Huffman coding of the outputs of an optimum uniform-threshold quantizer driven by a memoryless Gaussian source. Fairly general upper and lower bounds on the average terminal time are developed. Under certain conditions, the tightness of these bounds is verified, and asymptotic formulas are developed. As an example, an encoding scheme using Huffman codes in conjunction with uniform quantization of memoryless Gaussian sources is considered, and the buffer behavior is studied as a function of the buffer size and output rate.",
author = "Nariman Farvardin and Modestino, {James W.}",
year = "1986",
month = "11",
day = "1",
language = "English",
volume = "IT-32",
pages = "839--845",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "6",

}

TY - JOUR

T1 - ON OVERFLOW AND UNDERFLOW PROBLEMS IN BUFFER-INSTRUMENTED VARIABLE-LENGTH CODING OF FIXED-RATE MEMORYLESS SOURCES.

AU - Farvardin, Nariman

AU - Modestino, James W.

PY - 1986/11/1

Y1 - 1986/11/1

N2 - Variable-length coding schemes can be used in entropy encoding of finite-alphabet sources, but to transmit these codes over a synchronous channel requires a buffer. Since this buffer is of finite size, it is subject to both overflow and underflow. The buffer behavior is studied with particular application to Huffman coding of the outputs of an optimum uniform-threshold quantizer driven by a memoryless Gaussian source. Fairly general upper and lower bounds on the average terminal time are developed. Under certain conditions, the tightness of these bounds is verified, and asymptotic formulas are developed. As an example, an encoding scheme using Huffman codes in conjunction with uniform quantization of memoryless Gaussian sources is considered, and the buffer behavior is studied as a function of the buffer size and output rate.

AB - Variable-length coding schemes can be used in entropy encoding of finite-alphabet sources, but to transmit these codes over a synchronous channel requires a buffer. Since this buffer is of finite size, it is subject to both overflow and underflow. The buffer behavior is studied with particular application to Huffman coding of the outputs of an optimum uniform-threshold quantizer driven by a memoryless Gaussian source. Fairly general upper and lower bounds on the average terminal time are developed. Under certain conditions, the tightness of these bounds is verified, and asymptotic formulas are developed. As an example, an encoding scheme using Huffman codes in conjunction with uniform quantization of memoryless Gaussian sources is considered, and the buffer behavior is studied as a function of the buffer size and output rate.

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

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

M3 - Article

AN - SCOPUS:0022810671

VL - IT-32

SP - 839

EP - 845

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 6

ER -