We present practical codes designed for the Gaussian dirty paper channel. We show that the dirty paper decoding problem can be transformed into an equivalent multiple-access problem, for which we apply superposition coding. Our approach is a generalization of the nested lattices approach of Zamir et al. (2002). We present simulation results which confirm the effectiveness of our methods.
Superposition coding for gaussian dirty-paper
IEEEI 2004, 23rd convention of IEEE Israel Section, 6-7 September, 2004, Tel-Aviv, Israël
Systèmes de Communication
© 2004 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
PERMALINK : https://www.eurecom.fr/publication/1597