Optimal Modulation for Known Interference
2008 (English)In: IEEE Transactions on Communications, ISSN 0090-6778, E-ISSN 1558-0857, Vol. 56, no 11, 1892-1899 p.Article in journal (Refereed) Published
We present a symbol-by-symbol approach to the problem of canceling known interference at the transmitter in a communication system. In the envisioned system, the modulator maps an information symbol (taken from a finite alphabet) and an interference symbol (from the complex field) onto a transmitted constellation point. Our scheme is based on joint optimization of a modulator and demodulator, subject to a constraint on the average transmit power. The demodulator picks the information symbol (as a function of the received symbol) that minimizes the average error probability. We emphasize that our focus is on transmission in a single (complex) dimension, and hence the proposed technique is a “modulation” rather than a “coding” scheme. We illustrate that the new scheme outperforms Tomlinson–Harashima precoding, which is a classical but suboptimal solution to the one-dimensional known-interference precoding problem. In our simulations, the new approach is able to perform close to the no-interference bound.
Place, publisher, year, edition, pages
2008. Vol. 56, no 11, 1892-1899 p.
Modulation, dirty paper coding, Costa precoding, interference cancellation, joint design
Engineering and Technology
IdentifiersURN: urn:nbn:se:liu:diva-22001DOI: 10.1109/TCOMM.2008.060382OAI: oai:DiVA.org:liu-22001DiVA: diva2:242298
©2009 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.
Mikael Skoglund and Erik G. Larsson, Optimal Modulation for Known Interference, 2008, IEEE Transactions on Communications, (56), 11, 1892-1899.