Dirty paper coding with a finite input alphabet

Tal Gariby; Uri Erez; Shlomo Shamai

doi:10.1109/EEEI.2006.321110

Dirty paper coding with a finite input alphabet

Tal Gariby, Uri Erez, Shlomo Shamai

School of Electrical Engineering

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

Abstract

We study a dirty paper channel model where the input is constrained to belong to a PAM constellation. In particular, we provide lower bounds on the capacity as well as explicit coding schemes for the binary-input dirty-paper channel. We examine the case of causal as well as non-causal side information.

Original language	English
Title of host publication	2006 IEEE 24th Convention of Electrical and Electronics Engineers in Israel, IEEEI
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	95-99
Number of pages	5
ISBN (Print)	1424402301, 9781424402304
DOIs	https://doi.org/10.1109/EEEI.2006.321110
State	Published - 2006
Event	2006 IEEE 24th Convention of Electrical and Electronics Engineers in Israel, IEEEI - Eilat, Israel Duration: 15 Nov 2006 → 17 Nov 2006

Publication series

Name	IEEE Convention of Electrical and Electronics Engineers in Israel, Proceedings

Conference

Conference	2006 IEEE 24th Convention of Electrical and Electronics Engineers in Israel, IEEEI
Country/Territory	Israel
City	Eilat
Period	15/11/06 → 17/11/06

Access to Document

10.1109/EEEI.2006.321110

Cite this

Gariby, T., Erez, U., & Shamai, S. (2006). Dirty paper coding with a finite input alphabet. In 2006 IEEE 24th Convention of Electrical and Electronics Engineers in Israel, IEEEI (pp. 95-99). [4115254] (IEEE Convention of Electrical and Electronics Engineers in Israel, Proceedings). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/EEEI.2006.321110

@inproceedings{0f7224a7e4e34313a5090ac85d8deedd,

title = "Dirty paper coding with a finite input alphabet",

abstract = "We study a dirty paper channel model where the input is constrained to belong to a PAM constellation. In particular, we provide lower bounds on the capacity as well as explicit coding schemes for the binary-input dirty-paper channel. We examine the case of causal as well as non-causal side information.",

author = "Tal Gariby and Uri Erez and Shlomo Shamai",

year = "2006",

doi = "10.1109/EEEI.2006.321110",

language = "אנגלית",

isbn = "1424402301",

series = "IEEE Convention of Electrical and Electronics Engineers in Israel, Proceedings",

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

pages = "95--99",

booktitle = "2006 IEEE 24th Convention of Electrical and Electronics Engineers in Israel, IEEEI",

address = "ארצות הברית",

note = "null ; Conference date: 15-11-2006 Through 17-11-2006",

}

Gariby, T, Erez, U & Shamai, S 2006, Dirty paper coding with a finite input alphabet. in 2006 IEEE 24th Convention of Electrical and Electronics Engineers in Israel, IEEEI., 4115254, IEEE Convention of Electrical and Electronics Engineers in Israel, Proceedings, Institute of Electrical and Electronics Engineers Inc., pp. 95-99, 2006 IEEE 24th Convention of Electrical and Electronics Engineers in Israel, IEEEI, Eilat, Israel, 15/11/06. https://doi.org/10.1109/EEEI.2006.321110

Dirty paper coding with a finite input alphabet. / Gariby, Tal; Erez, Uri; Shamai, Shlomo.

2006 IEEE 24th Convention of Electrical and Electronics Engineers in Israel, IEEEI. Institute of Electrical and Electronics Engineers Inc., 2006. p. 95-99 4115254 (IEEE Convention of Electrical and Electronics Engineers in Israel, Proceedings).

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

TY - GEN

T1 - Dirty paper coding with a finite input alphabet

AU - Gariby, Tal

AU - Erez, Uri

AU - Shamai, Shlomo

PY - 2006

Y1 - 2006

N2 - We study a dirty paper channel model where the input is constrained to belong to a PAM constellation. In particular, we provide lower bounds on the capacity as well as explicit coding schemes for the binary-input dirty-paper channel. We examine the case of causal as well as non-causal side information.

AB - We study a dirty paper channel model where the input is constrained to belong to a PAM constellation. In particular, we provide lower bounds on the capacity as well as explicit coding schemes for the binary-input dirty-paper channel. We examine the case of causal as well as non-causal side information.

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

U2 - 10.1109/EEEI.2006.321110

DO - 10.1109/EEEI.2006.321110

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

AN - SCOPUS:50249172399

SN - 1424402301

SN - 9781424402304

T3 - IEEE Convention of Electrical and Electronics Engineers in Israel, Proceedings

SP - 95

EP - 99

BT - 2006 IEEE 24th Convention of Electrical and Electronics Engineers in Israel, IEEEI

PB - Institute of Electrical and Electronics Engineers Inc.

Y2 - 15 November 2006 through 17 November 2006

ER -

Dirty paper coding with a finite input alphabet

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this