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

Mustafa Kesal; Uri Erez

doi:10.1109/ISIT.2010.5513328

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

Mustafa Kesal^*, Uri Erez

^*Corresponding author for this work

School of Electrical Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

1 Scopus citations

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 log₂ (1 + SMS/e) bits per real dimension. This bound is useful for SNR ≤ e(e-2).

Original language	English
Title of host publication	2010 IEEE International Symposium on Information Theory, ISIT 2010 - Proceedings
Pages	310-314
Number of pages	5
DOIs	https://doi.org/10.1109/ISIT.2010.5513328
State	Published - 2010
Event	2010 IEEE International Symposium on Information Theory, ISIT 2010 - Austin, TX, United States Duration: 13 Jun 2010 → 18 Jun 2010

Publication series

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

Conference

Conference	2010 IEEE International Symposium on Information Theory, ISIT 2010
Country/Territory	United States
City	Austin, TX
Period	13/06/10 → 18/06/10

Access to Document

10.1109/ISIT.2010.5513328

Cite this

@inproceedings{5fc1ca9992f94c8d864a79a05be32411,

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

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).",

author = "Mustafa Kesal and Uri Erez",

year = "2010",

doi = "10.1109/ISIT.2010.5513328",

language = "אנגלית",

isbn = "9781424469604",

series = "IEEE International Symposium on Information Theory - Proceedings",

pages = "310--314",

booktitle = "2010 IEEE International Symposium on Information Theory, ISIT 2010 - Proceedings",

note = "2010 IEEE International Symposium on Information Theory, ISIT 2010 ; Conference date: 13-06-2010 Through 18-06-2010",

}

Kesal, M & Erez, U 2010, Gaussian causal dirty paper capacity is at most log (1+SNR/e). in 2010 IEEE International Symposium on Information Theory, ISIT 2010 - Proceedings., 5513328, IEEE International Symposium on Information Theory - Proceedings, pp. 310-314, 2010 IEEE International Symposium on Information Theory, ISIT 2010, Austin, TX, United States, 13/06/10. https://doi.org/10.1109/ISIT.2010.5513328

Gaussian causal dirty paper capacity is at most log (1+SNR/e). / Kesal, Mustafa; Erez, Uri.
2010 IEEE International Symposium on Information Theory, ISIT 2010 - Proceedings. 2010. p. 310-314 5513328 (IEEE International Symposium on Information Theory - Proceedings).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

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

AU - Kesal, Mustafa

AU - Erez, Uri

PY - 2010

Y1 - 2010

N2 - 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).

AB - 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).

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

U2 - 10.1109/ISIT.2010.5513328

DO - 10.1109/ISIT.2010.5513328

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:77955701740

SN - 9781424469604

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 310

EP - 314

BT - 2010 IEEE International Symposium on Information Theory, ISIT 2010 - Proceedings

T2 - 2010 IEEE International Symposium on Information Theory, ISIT 2010

Y2 - 13 June 2010 through 18 June 2010

ER -

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

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this