Dirty Paper Coding for PAM Signaling

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.

[1]  Shlomo Shamai,et al.  Nested linear/Lattice codes for structured multiterminal binning , 2002, IEEE Trans. Inf. Theory.

[2]  R. Zamir,et al.  On lattice quantization noise , 1994, Proceedings of 1994 IEEE International Symposium on Information Theory.

[3]  Shlomo Shamai,et al.  Capacity and lattice strategies for canceling known interference , 2005, IEEE Transactions on Information Theory.

[4]  Max H. M. Costa,et al.  Writing on dirty paper , 1983, IEEE Trans. Inf. Theory.