Structured Dirty Paper Coding with Known Interference Structure at Receiver

The Tomlinson-Harashima precoding is well known for dirty paper coding implementation. Despite its simplicity, THP suffers from a significant performance loss in the low SNR region due to modulo operations. In this paper, we propose new dirty paper precoding scheme by taking advantage of the known modulation structure of interference (e.g., BPSK and QPSK signals). The new method, termed structured DPC (SDPC), outperforms the regular THP with modest changes to the transmitter and receiver. For BPSK and QPSK cases investigated, the SDPC only suffers power loss, which is up to 1.25 dB compared with non-interference case, while the regular THP-based scalar dirty paper coding has a typical 4-5 dB capacity loss in the same low SNR regions

[1]  Amos Lapidoth,et al.  The Gaussian watermarking game , 2000, IEEE Trans. Inf. Theory.

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

[3]  Andrea J. Goldsmith,et al.  Duality, achievable rates, and sum-rate capacity of Gaussian MIMO broadcast channels , 2003, IEEE Trans. Inf. Theory.

[4]  Thomas M. Cover,et al.  Broadcast channels , 1972, IEEE Trans. Inf. Theory.

[5]  Wei Yu,et al.  Sum capacity of Gaussian vector broadcast channels , 2004, IEEE Transactions on Information Theory.

[6]  Katalin Marton,et al.  A coding theorem for the discrete memoryless broadcast channel , 1979, IEEE Trans. Inf. Theory.

[7]  Shlomo Shamai,et al.  On the achievable throughput of a multiantenna Gaussian broadcast channel , 2003, IEEE Transactions on Information Theory.

[8]  Richard D. Wesel,et al.  Trellis code design for correlated fading and achievable rates for tomlinson-harashima precoding , 1996 .

[9]  Wei Yu,et al.  Trellis and convolutional precoding for transmitter-based interference presubtraction , 2005, IEEE Transactions on Communications.

[10]  Shlomo Shamai,et al.  On the Achievable Throughput of a Multiantenna , 2003 .

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

[12]  M. Tomlinson.  New automatic equaliser employing modulo arithmetic , 1971 .

[13]  Thomas M. Cover,et al.  An achievable rate region for the broadcast channel , 1975, IEEE Trans. Inf. Theory.

[14]  Edward C. van der Meulen,et al.  Random coding theorems for the general discrete memoryless broadcast channel , 1975, IEEE Trans. Inf. Theory.

[15]  S. Brink,et al.  Approaching the Dirty Paper Limit for Canceling Known Interference , 2003 .

[16]  H. Miyakawa,et al.  Matched-Transmission Technique for Channels With Intersymbol Interference , 1972, IEEE Trans. Commun..

[17]  G. David Forney,et al.  Multidimensional constellations. I. Introduction, figures of merit, and generalized cross constellations , 1989, IEEE J. Sel. Areas Commun..

[18]  Shlomo Shamai,et al.  The intersymbol interference channel: lower bounds on capacity and channel precoding loss , 1996, IEEE Trans. Inf. Theory.