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 ex...Show MoreMetadata
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.
Published in: 2007 IEEE International Symposium on Information Theory
Date of Conference: 24-29 June 2007
Date Added to IEEE Xplore: 09 July 2008
ISBN Information:
Contents 