Trellis and convolutional precoding for transmitter-based interference presubtraction

This paper studies the combination of practical trellis and convolution codes with Tomlinson-Harashima precoding (THP) for the presubtraction of multiuser interference that is known at the transmitter but not known at the receiver. It is well known that a straightforward application of THP suffers power, modulo, and shaping losses. This paper proposes generalizations of THP that recover some of these losses. At a high signal-to-noise ratio (SNR), the precoding loss is dominated by the shaping loss, which is about 1.53 dB. To recover shaping loss, a trellis-shaping technique is developed that takes into account the knowledge of a noncausal interfering sequence, rather than just the instantaneous interference. At rates of 2 and 3 bits per transmission, trellis shaping is shown to be able to recover almost all of the 1.53-dB shaping loss. At a low SNR, the precoding loss is dominated by power and modulo losses, which can be as large as 3-4 dB. To recover these losses, a technique that incorporates partial interference presubtraction (PIP) within convolutional decoding is developed. At rates of 0.5 and 0.25 bits per transmission, PIP is able to recover 1-1.5 dB of the power loss. For intermediate SNR channels, a combination of the two schemes is shown to recover both power and shaping losses.

[1]  Brendan J. Frey,et al.  Factor graphs and the sum-product algorithm , 2001, IEEE Trans. Inf. Theory.

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

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

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

[5]  Robert F. H. Fischer,et al.  Modulo-lattice reduction in precoding schemes , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..

[6]  Shlomo Shamai,et al.  Writing on dirty tape with LDPC codes , 2003, Multiantenna Channels: Capacity, Coding and Signal Processing.

[7]  G. David Forney Trellis shaping , 1992, IEEE Trans. Inf. Theory.

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

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

[10]  G. David Forney,et al.  Trellis precoding: Combined coding, precoding and shaping for intersymbol interference channels , 1992, IEEE Trans. Inf. Theory.

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

[12]  John M. Cioffi,et al.  Vectored transmission for digital subscriber line systems , 2002, IEEE J. Sel. Areas Commun..

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

[14]  G. David Forney,et al.  Multidimensional constellations. II. Voronoi constellations , 1989, IEEE J. Sel. Areas Commun..

[15]  David Tse,et al.  Sum capacity of the vector Gaussian broadcast channel and uplink-downlink duality , 2003, IEEE Trans. Inf. Theory.

[16]  David Tse,et al.  Sum capacity of the multiple antenna Gaussian broadcast channel , 2002, Proceedings IEEE International Symposium on Information Theory,.

[17]  Nader Moayeri,et al.  Trellis coded vector quantization , 1992, IEEE Trans. Commun..

[18]  Robert F. H. Fischer,et al.  Dynamics Limited Precoding, Shaping, and Blind Equalization for Fast Digital Transmission over Twisted Pair Lines , 2006, IEEE J. Sel. Areas Commun..

[19]  N. J. A. Sloane,et al.  A fast encoding method for lattice codes and quantizers , 1983, IEEE Trans. Inf. Theory.

[20]  Richard D. Wesel,et al.  Achievable Rates for Tomlinson-Harashima Precoding , 1998, IEEE Trans. Inf. Theory.

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

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

[23]  Shlomo Shamai,et al.  The capacity region of the Gaussian MIMO broadcast channel , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..