Superposition Signaling in Broadcast Interference Networks

Tuan, HD; Tam, HHM; Nguyen, HH; Duong, TQ; Poor, HV

Superposition Signaling in Broadcast Interference Networks

Tuan, HD

Tam, HHM Nguyen, HH Duong, TQ Poor, HV

Permalink

Publication Type:: Journal Article
Citation:: IEEE Transactions on Communications, 2017, 65 (11), pp. 4646 - 4656
Issue Date:: 2017-11-01

Closed Access

	Filename	Description	Size
	07990267.pdf	Published Version	1.11 MB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Tuan, HD https://orcid.org/0000-0003-0292-6061	en_US
dc.contributor.author	Tam, HHM	en_US
dc.contributor.author	Nguyen, HH	en_US
dc.contributor.author	Duong, TQ	en_US
dc.contributor.author	Poor, HV	en_US
dc.date.issued	2017-11-01	en_US
dc.identifier.citation	IEEE Transactions on Communications, 2017, 65 (11), pp. 4646 - 4656	en_US
dc.identifier.issn	0090-6778	en_US
dc.identifier.uri	http://hdl.handle.net/10453/125103
dc.description.abstract	© 1972-2012 IEEE. It is known that superposition signaling in Gaussian interference networks is capable of improving the achievable rate region. However, the problem of maximizing the rate gain offered by superposition signaling is computationally prohibitive, even in the simplest case of two-user single-input single-output interference networks. This paper examines superposition signaling for the general multiple-input multiple-output broadcast Gaussian interference networks. The problem of maximizing either the sum rate or the minimal user's rate under superposition signaling and dirty paper coding is solved by a computationally efficient path-following procedure, which requires only a convex quadratic program for each iteration but ensures convergence at least to a locally optimal solution. Numerical results demonstrate the substantial performance advantage of the proposed approach.	en_US
dc.relation	http://purl.org/au-research/grants/arc/DP130104617
dc.relation.ispartof	IEEE Transactions on Communications	en_US
dc.relation.isbasedon	10.1109/TCOMM.2017.2731315	en_US
dc.rights	info:eu-repo/semantics/closedAccess
dc.title	Superposition Signaling in Broadcast Interference Networks	en_US
dc.type	Journal Article
utslib.citation.volume	11	en_US
utslib.citation.volume	65	en_US
utslib.for	0906 Electrical and Electronic Engineering	en_US
utslib.for	1005 Communications Technologies	en_US
utslib.for	0804 Data Format	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Electrical and Data Engineering
utslib.copyright.status	closed_access	*
pubs.issue	11	en_US
pubs.publication-status	Published	en_US
pubs.volume	65	en_US

Abstract:

© 1972-2012 IEEE. It is known that superposition signaling in Gaussian interference networks is capable of improving the achievable rate region. However, the problem of maximizing the rate gain offered by superposition signaling is computationally prohibitive, even in the simplest case of two-user single-input single-output interference networks. This paper examines superposition signaling for the general multiple-input multiple-output broadcast Gaussian interference networks. The problem of maximizing either the sum rate or the minimal user's rate under superposition signaling and dirty paper coding is solved by a computationally efficient path-following procedure, which requires only a convex quadratic program for each iteration but ensures convergence at least to a locally optimal solution. Numerical results demonstrate the substantial performance advantage of the proposed approach.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/125103