Dirty Paper Coding with a Finite Input Alphabet

Authors :: Tal Gariby
Uri Erez
Shlomo Shamai
Source :: 2006 IEEE 24th Convention of Electrical & Electronics Engineers in Israel.
Publication Year :: 2006
Publisher :: IEEE, 2006.
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.

Subjects :: MIMO
Data_CODINGANDINFORMATIONTHEORY
symbols.namesake
Intersymbol interference
Gaussian noise
symbols
Electronic engineering
Dirty paper coding
Random variable
Algorithm
Digital watermarking
Computer Science::Information Theory
Constellation
Coding (social sciences)
Mathematics

Database :: OpenAIRE
Journal :: 2006 IEEE 24th Convention of Electrical & Electronics Engineers in Israel
Accession number :: edsair.doi...........8ce94b14cfa625faefac1f9646008b64

Tools