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, Shamai and Erez. We present simulation results which confirm the effectiveness of our methods.
|Number of pages||4|
|State||Published - 2004|
|Event||2004 23rd IEEE Convention of Electrical and Electronics Engineers in Israel, Proceedings - Tel-Aviv, Israel|
Duration: 6 Sep 2004 → 7 Sep 2004
|Conference||2004 23rd IEEE Convention of Electrical and Electronics Engineers in Israel, Proceedings|
|Period||6/09/04 → 7/09/04|