Optimized solutions for beamforming problems in amplify-forward wireless relay networks

Phan, AH; Tuan, HD; Kha, HH

Optimized solutions for beamforming problems in amplify-forward wireless relay networks

Phan, AH Tuan, HD

Kha, HH

Permalink

Publication Type:: Conference Proceeding
Citation:: GLOBECOM - IEEE Global Telecommunications Conference, 2011
Issue Date:: 2011-12-01

Closed Access

	Filename	Description	Size
	06134324.pdf	Published version	211.79 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	Phan, AH	en_US
dc.contributor.author	Tuan, HD https://orcid.org/0000-0003-0292-6061	en_US
dc.contributor.author	Kha, HH	en_US
dc.date.issued	2011-12-01	en_US
dc.identifier.citation	GLOBECOM - IEEE Global Telecommunications Conference, 2011	en_US
dc.identifier.isbn	9781424492688	en_US
dc.identifier.uri	http://hdl.handle.net/10453/120230
dc.description.abstract	Beamforming problems in amlify-forward (AF) wireless relay network can be formulated as nonconvex quadratically constrained quadratic programming (QCQP) problems which is very difficult to solve directly. Generally, by transforming a QCQP problem into a semi-definite program (SDP) and by relaxing rank-one constraints, the problem can be tackled essentially. If resulting matrices found after solving SDP problems are of rank-one then the task can be terminated. However, in some scenarios such as minimizing individual power constraints on relays, most of the rank-one dropped SDP solutions have rank higher than one. In this case, a nonsmooth reverse convex optimization technique is employed to solve the problem iteratively then rank-one solutions can be optimized numerically. © 2011 IEEE.	en_US
dc.relation.ispartof	GLOBECOM - IEEE Global Telecommunications Conference	en_US
dc.relation.isbasedon	10.1109/GLOCOM.2011.6134324	en_US
dc.rights	info:eu-repo/semantics/closedAccess
dc.title	Optimized solutions for beamforming problems in amplify-forward wireless relay networks	en_US
dc.type	Conference Proceeding
utslib.for	0906 Electrical and Electronic Engineering	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

Abstract:

Beamforming problems in amlify-forward (AF) wireless relay network can be formulated as nonconvex quadratically constrained quadratic programming (QCQP) problems which is very difficult to solve directly. Generally, by transforming a QCQP problem into a semi-definite program (SDP) and by relaxing rank-one constraints, the problem can be tackled essentially. If resulting matrices found after solving SDP problems are of rank-one then the task can be terminated. However, in some scenarios such as minimizing individual power constraints on relays, most of the rank-one dropped SDP solutions have rank higher than one. In this case, a nonsmooth reverse convex optimization technique is employed to solve the problem iteratively then rank-one solutions can be optimized numerically. © 2011 IEEE.

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

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