Optimal modulation for known interference
2007 (English)In: 2007 IEEE International Conference on Acoustics, Speech, and Signal Processing, IEEE , 2007, 233-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
IEEE , 2007. 233-236 p.
, International Conference on Acoustics Speech and Signal Processing (ICASSP), ISSN 1520-6149
interference suppression, modulation
IdentifiersURN: urn:nbn:se:kth:diva-28991DOI: 10.1109/ICASSP.2007.366515ISI: 000248906600059ScopusID: 2-s2.0-34547528501OAI: oai:DiVA.org:kth-28991DiVA: diva2:395609
32nd IEEE International Conference on Acoustics, Speech and Signal Processing Honolulu, HI, APR 15-20, 2007
QC 201102072011-02-072011-01-252011-12-14Bibliographically approved