Change search
ReferencesLink to record
Permanent link

Direct link
Optimal Symbol-by-Symbol Costa Precoding for a Relay-aided Downlink Channel
KTH.
Linköping University, Department of Electrical Engineering, Communication Systems. Linköping University, The Institute of Technology.ORCID iD: 0000-0002-7599-4367
KTH.
KTH.
2011 (English)In: IEEE Transactions on Communications, ISSN 0090-6778, E-ISSN 1558-0857, Vol. 59, no 8, 2274-2284 p.Article in journal (Refereed) Published
Abstract [en]

In this article, we consider practical approaches to Costa precoding (also known as dirty paper coding). Specifically, we propose a symbol-by-symbol scheme for cancellation of interference known at the transmitter in a relay-aided downlink channel. For finite-alphabet signaling and interference, we derive the optimal (in terms of maximum mutual information) modulator under a given power constraint. A sub-optimal modulator is also proposed by formulating an optimization problem that maximizes the minimum distance of the signal constellation, and this non-convex optimization problem is approximately solved by semi-definite relaxation. For the case of binary signaling with binary interference, we obtain a closed-form solution for the sub-optimal modulator, which only suffers little performance degradation compared to the optimal modulator in the region of interest. For more general signal constellations and more general interference distributions, we propose an optimized Tomlinson-Harashima precoder (THP), which uniformly outperforms conventional THP with heuristic parameters. Bit-level simulation shows that the optimal and sub-optimal modulators can achieve significant gains over the THP benchmark as well as over non-Costa reference schemes, especially when the power of the interference is larger than the power of the noise.

Place, publisher, year, edition, pages
IEEE , 2011. Vol. 59, no 8, 2274-2284 p.
Keyword [en]
Costa precoding, dirty paper coding, interference, modulation, relay channel
National Category
Engineering and Technology
Identifiers
URN: urn:nbn:se:liu:diva-66102DOI: 10.1109/TCOMM.2011.053111.100645ISI: 000295008500026OAI: oai:DiVA.org:liu-66102DiVA: diva2:401710
Note
©2011 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. Jinfeng Du, Erik G. Larsson, Ming Xiao and Mikael Skoglund, Optimal Symbol-by-Symbol Costa Precoding for a Relay-aided Downlink Channel, 2011, accepted IEEE Transactions on Communications. Available from: 2011-03-03 Created: 2011-03-03 Last updated: 2016-08-31

Open Access in DiVA

fulltext(303 kB)354 downloads
File information
File name FULLTEXT02.pdfFile size 303 kBChecksum SHA-512
df7616d19df89fe6268f2406769a07df97284087decbaa714e9d3a41afea493d897d267a7c0c385e27ea2b5671c15618ed8951b5eadb4949d004d13352542524
Type fulltextMimetype application/pdf

Other links

Publisher's full text

Search in DiVA

By author/editor
Larsson, Erik G.
By organisation
Communication SystemsThe Institute of Technology
In the same journal
IEEE Transactions on Communications
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar
Total: 359 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 429 hits
ReferencesLink to record
Permanent link

Direct link