An upper bound on the capacity of the causal dirty-paper channel

Mustafa Kesal; Uri Erez

doi:https://doi.org/10.1109/TIT.2011.2162261

An upper bound on the capacity of the causal dirty-paper channel

Mustafa Kesal, Uri Erez

School of Electrical Engineering

Tel Aviv University

Research output: Contribution to journal › Article › peer-review

Abstract

A bound on the capacity of the causal dirty-paper channel 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+SNR/e) bits per real dimension. This bound is useful for SNR ≤ e(e-2).

Original language	English
Article number	6006594
Pages (from-to)	5650-5659
Number of pages	10
Journal	IEEE Transactions on Information Theory
Volume	57
Issue number	9
DOIs	https://doi.org/10.1109/TIT.2011.2162261
State	Published - Sep 2011

Keywords

Causal channel state information
dirty-paper channel
lattice strategies
modulo-lattice channels

All Science Journal Classification (ASJC) codes

Information Systems
Computer Science Applications
Library and Information Sciences

Access to Document

https://doi.org/10.1109/TIT.2011.2162261

Cite this

@article{46abe4b4ed1a4091bcd28fcab9d9bb47,

title = "An upper bound on the capacity of the causal dirty-paper channel",

abstract = "A bound on the capacity of the causal dirty-paper channel 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+SNR/e) bits per real dimension. This bound is useful for SNR ≤ e(e-2).",

keywords = "Causal channel state information, dirty-paper channel, lattice strategies, modulo-lattice channels",

author = "Mustafa Kesal and Uri Erez",

note = "Funding Information: Manuscript received April 30, 2010; revised December 21, 2010; accepted December 21, 2010. Date of current version August 31, 2011. This work was supported in part by the Israel Science Foundation under Grant ISF1234/09 and by the Binational Science Foundation under Grant BSF2008455. This work was presented in part at the IEEE International Symposium on Information Theory, Austin, TX, June 13–18, 2010.",

year = "2011",

month = sep,

doi = "https://doi.org/10.1109/TIT.2011.2162261",

language = "الإنجليزيّة",

volume = "57",

pages = "5650--5659",

journal = "IEEE Transactions on Information Theory",

issn = "0018-9448",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "9",

}

TY - JOUR

T1 - An upper bound on the capacity of the causal dirty-paper channel

AU - Kesal, Mustafa

AU - Erez, Uri

N1 - Funding Information: Manuscript received April 30, 2010; revised December 21, 2010; accepted December 21, 2010. Date of current version August 31, 2011. This work was supported in part by the Israel Science Foundation under Grant ISF1234/09 and by the Binational Science Foundation under Grant BSF2008455. This work was presented in part at the IEEE International Symposium on Information Theory, Austin, TX, June 13–18, 2010.

PY - 2011/9

Y1 - 2011/9

N2 - A bound on the capacity of the causal dirty-paper channel 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+SNR/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 channel 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+SNR/e) bits per real dimension. This bound is useful for SNR ≤ e(e-2).

KW - Causal channel state information

KW - dirty-paper channel

KW - lattice strategies

KW - modulo-lattice channels

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

U2 - https://doi.org/10.1109/TIT.2011.2162261

DO - https://doi.org/10.1109/TIT.2011.2162261

M3 - مقالة

SN - 0018-9448

VL - 57

SP - 5650

EP - 5659

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

IS - 9

M1 - 6006594

ER -

An upper bound on the capacity of the causal dirty-paper channel

Abstract

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this