Dirty paper coding with a finite input alphabet

Tal Gariby, Uri Erez, Shlomo Shamai

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 publication2006 IEEE 24th Convention of Electrical and Electronics Engineers in Israel, IEEEI
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages95-99
Number of pages5
ISBN (Print)1424402301, 9781424402304
DOIs
StatePublished - 2006
Event2006 IEEE 24th Convention of Electrical and Electronics Engineers in Israel, IEEEI - Eilat, Israel
Duration: 15 Nov 200617 Nov 2006

Publication series

NameIEEE Convention of Electrical and Electronics Engineers in Israel, Proceedings

Conference

Conference2006 IEEE 24th Convention of Electrical and Electronics Engineers in Israel, IEEEI
Country/TerritoryIsrael
CityEilat
Period15/11/0617/11/06

Fingerprint

Dive into the research topics of 'Dirty paper coding with a finite input alphabet'. Together they form a unique fingerprint.

Cite this