Costa Precoding in One Dimension

We design an optimum modulator for the Costa (dirty-paper) precoding problem under the constraint of a binary signaling alphabet, and assuming the interference symbols belong to a binary constellation. We evaluate the performance of our technique in terms of the mutual information between the channel input and output, and compare it to that of Tomlinson-Harashima precoding (THP) with optimized parameters. We show that our optimal modulator is always better than THP. In many relevant scenarios, the performance difference is significant

[1]  J. Cioffi,et al.  Achievable rates for Tomlinson-Harashima precoding , 1995, Proceedings of 1995 IEEE International Symposium on Information Theory.

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

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

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

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

[6]  Shlomo Shamai,et al.  Superposition coding for side-information channels , 2006, IEEE Transactions on Information Theory.

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

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

[9]  David Tse,et al.  Fundamentals of Wireless Communication , 2005 .

[10]  Robert W. Heath,et al.  Practical Costa precoding for the multiple antenna broadcast channel , 2004, IEEE Global Telecommunications Conference, 2004. GLOBECOM '04..

[11]  Robert F. H. Fischer,et al.  Precoding in multiantenna and multiuser communications , 2004, IEEE Transactions on Wireless Communications.