Optimal Modulation for Known Interference
2007 (English)In: Proceedings of the 32nd IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP'07), 2007, III-233-III-236 p.Conference paper (Refereed)
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. The demodulator picks the information symbol (as a function of the received symbol) which minimizes the average error probability. We find the optimal modulator-demodulator pair, in the minimum-probability-of-symbol-error sense, via an iterative optimization procedure, for fixed average transmit power. We illustrate that the new scheme can perform close to the no-interference bound, and in particular that it outperforms Tomlinson-Harashima precoding, which is a classical but suboptimal solution to the problem under study.
Place, publisher, year, edition, pages
2007. III-233-III-236 p.
Engineering and Technology
IdentifiersURN: urn:nbn:se:liu:diva-42503DOI: 10.1109/ICASSP.2007.366515Local ID: 65145ISBN: 1-4244-0728-1ISBN: 1-4244-0727-3OAI: oai:DiVA.org:liu-42503DiVA: diva2:263360