Gaussian causal dirty paper capacity is at most log (1+SNR/e)

Mustafa Kesal*, Uri Erez

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

A bound on the capacity of the causal dirty paper problem with arbitrary interference and general independent identically distributed additive noise is derived. In particular, it is shown that for the case of Gaussian noise the capacity is upper bounded by log2 (1 + SMS/e) bits per real dimension. This bound is useful for SNR ≤ e(e-2).

Original languageEnglish
Title of host publication2010 IEEE International Symposium on Information Theory, ISIT 2010 - Proceedings
Pages310-314
Number of pages5
DOIs
StatePublished - 2010
Event2010 IEEE International Symposium on Information Theory, ISIT 2010 - Austin, TX, United States
Duration: 13 Jun 201018 Jun 2010

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8103

Conference

Conference2010 IEEE International Symposium on Information Theory, ISIT 2010
Country/TerritoryUnited States
CityAustin, TX
Period13/06/1018/06/10

Fingerprint

Dive into the research topics of 'Gaussian causal dirty paper capacity is at most log (1+SNR/e)'. Together they form a unique fingerprint.

Cite this