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
IEEE Communications Society, 2008. Vol. 56, no 11, 1892-1899 p.
Costa precoding, Modulation, dirty paper coding, interference cancellation, joint design
IdentifiersURN: urn:nbn:se:kth:diva-17994DOI: 10.1109/tcomm.2008.060382ISI: 000261076800018ScopusID: 2-s2.0-57449092669OAI: oai:DiVA.org:kth-17994DiVA: diva2:336039
QC 201005252010-08-052010-08-052012-03-20Bibliographically approved