Dirty paper coding for PAM signaling

Tal Gariby*, Uri Erez, Shlomo Shamai

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-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 languageEnglish
Title of host publicationProceedings - 2007 IEEE International Symposium on Information Theory, ISIT 2007
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages376-380
Number of pages5
ISBN (Print)1424414296, 9781424414291
DOIs
StatePublished - 2007
Event2007 IEEE International Symposium on Information Theory, ISIT 2007 - Nice, France
Duration: 24 Jun 200729 Jun 2007

Publication series

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

Conference

Conference2007 IEEE International Symposium on Information Theory, ISIT 2007
Country/TerritoryFrance
CityNice
Period24/06/0729/06/07

Fingerprint

Dive into the research topics of 'Dirty paper coding for PAM signaling'. Together they form a unique fingerprint.

Cite this