Convex quadratic programming for maximizing sum throughput in MIMO-NOMA multicell networks

Nguyen, VD; Tuan, HD; Duong, TQ; Poor, HV; Shin, OS

Convex quadratic programming for maximizing sum throughput in MIMO-NOMA multicell networks

Nguyen, VD Tuan, HD

Duong, TQ Poor, HV Shin, OS

Permalink

Publication Type:: Conference Proceeding
Citation:: 2017 IEEE Global Communications Conference, GLOBECOM 2017 - Proceedings, 2017, 2018-January pp. 1 - 6
Issue Date:: 2017-07-01

Closed Access

	Filename	Description	Size
	08254177.pdf	Published version	205.03 kB	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	Nguyen, VD	en_US
dc.contributor.author	Tuan, HD https://orcid.org/0000-0003-0292-6061	en_US
dc.contributor.author	Duong, TQ	en_US
dc.contributor.author	Poor, HV	en_US
dc.contributor.author	Shin, OS	en_US
dc.date.issued	2017-07-01	en_US
dc.identifier.citation	2017 IEEE Global Communications Conference, GLOBECOM 2017 - Proceedings, 2017, 2018-January pp. 1 - 6	en_US
dc.identifier.isbn	9781509050192	en_US
dc.identifier.uri	http://hdl.handle.net/10453/127417
dc.description.abstract	© 2017 IEEE. This paper aims to design linear precoders for signal superposition at the base stations of non-orthogonal multiple access multiple-input multiple-output multi-cellular systems to maximize the overall sum throughput subject to the users' quality-of-service requirements, which are imposed independently on the users' channel conditions. This design problem is formulated as the maximization of a highly nonlinear and nonsmooth function subject to nonconvex constraints, which is very computationally challenging. A path-following algorithm for its solution, which invokes only a simple convex problem of moderate dimension at each iteration, is developed. Generating a sequence of improved points, this algorithm converges at least to a local optimum. Numerical results are then provided to demonstrate its merit.	en_US
dc.relation.ispartof	2017 IEEE Global Communications Conference, GLOBECOM 2017 - Proceedings	en_US
dc.relation.isbasedon	10.1109/GLOCOM.2017.8254177	en_US
dc.rights	info:eu-repo/semantics/closedAccess
dc.title	Convex quadratic programming for maximizing sum throughput in MIMO-NOMA multicell networks	en_US
dc.type	Conference Proceeding
utslib.citation.volume	2018-January	en_US
utslib.for	0805 Distributed Computing	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.publication-status	Published	en_US
pubs.volume	2018-January	en_US

Abstract:

© 2017 IEEE. This paper aims to design linear precoders for signal superposition at the base stations of non-orthogonal multiple access multiple-input multiple-output multi-cellular systems to maximize the overall sum throughput subject to the users' quality-of-service requirements, which are imposed independently on the users' channel conditions. This design problem is formulated as the maximization of a highly nonlinear and nonsmooth function subject to nonconvex constraints, which is very computationally challenging. A path-following algorithm for its solution, which invokes only a simple convex problem of moderate dimension at each iteration, is developed. Generating a sequence of improved points, this algorithm converges at least to a local optimum. Numerical results are then provided to demonstrate its merit.

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

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