The rate-distortion function of a poisson process with a queueing distortion measure

Todd P. Coleman, Negar Kiyavash, Vijay G. Subramanian

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


This paper presents a proof of the rate distortion function of a Poisson process with a queuing distortion measure that is in complete analogy with the proofs associated with the rate distortion functions of a Bernoulli source with Hamming distortion measure and a Gaussian source with squared-error distortion measure. Analogous to those problems, the distortion measure that we consider is related to the logarithm of the conditional distribution relating the input to the output of a well-known channel coding problem, specifically the Anantharam and Verdu "Bits through Queues" [1] coding problem. Our proof of the converse utilizes McFadden's point process entropy formulation [2] and involves a number of mutual information inequalities, one of which exploits the maximum-entropy achieving property of the Poisson process. Our test channel uses Burke's theorem [3], [4] to prove achievability.

Original languageEnglish (US)
Title of host publicationProceedings - 2008 Data Compression Conference, DCC 2008
Number of pages10
StatePublished - 2008
Event2008 Data Compression Conference, DCC 2008 - Snowbird, UT, United States
Duration: Mar 25 2008Mar 27 2008

Publication series

NameData Compression Conference Proceedings
ISSN (Print)1068-0314


Other2008 Data Compression Conference, DCC 2008
Country/TerritoryUnited States
CitySnowbird, UT

ASJC Scopus subject areas

  • Computer Networks and Communications


Dive into the research topics of 'The rate-distortion function of a poisson process with a queueing distortion measure'. Together they form a unique fingerprint.

Cite this