Beamforming optimization in multi-user amplify-and-forward wireless relay networks

Phan, AH; Tuan, HD; Kha, HH; Nguyen, HH

Beamforming optimization in multi-user amplify-and-forward wireless relay networks

Phan, AH Tuan, HD

Kha, HH Nguyen, HH

Permalink

Publication Type:: Journal Article
Citation:: IEEE Transactions on Wireless Communications, 2012, 11 (4), pp. 1510 - 1520
Issue Date:: 2012-04-01

Closed Access

	Filename	Description	Size
	2011005484OK.pdf		489.26 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.contributor.author	Nguyen, HH	en_US
dc.date.issued	2012-04-01	en_US
dc.identifier.citation	IEEE Transactions on Wireless Communications, 2012, 11 (4), pp. 1510 - 1520	en_US
dc.identifier.issn	1536-1276	en_US
dc.identifier.uri	http://hdl.handle.net/10453/22341
dc.description.abstract	Optimization problems of beamforming in multi-user amplify-and-forward (AF) wireless relay networks are indefinite (nonconvex) quadratic programs, which require effective computational solutions. Solutions to these problems have often been obtained by relaxing the original problems to semi-definite programs (SDPs) of convex optimization. Most existing works have claimed that these relaxed SDPs actually provide the optimal beamforming solutions. This paper, however, shows that this is not the case in many practical scenarios where SDPs fail to provide even a feasible beamforming solution. To fill this gap, we develop in this paper a nonsmooth optimization algorithm, which provides the optimal solution at low computational complexity. © 2012 IEEE.	en_US
dc.relation.ispartof	IEEE Transactions on Wireless Communications	en_US
dc.relation.isbasedon	10.1109/TWC.2012.021512.111040	en_US
dc.subject.classification	Networking & Telecommunications	en_US
dc.title	Beamforming optimization in multi-user amplify-and-forward wireless relay networks	en_US
dc.type	Journal Article
utslib.citation.volume	4	en_US
utslib.citation.volume	11	en_US
utslib.for	0805 Distributed Computing	en_US
utslib.for	0906 Electrical and Electronic Engineering	en_US
utslib.for	1005 Communications Technologies	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	4	en_US
pubs.publication-status	Published	en_US
pubs.volume	11	en_US

Abstract:

Optimization problems of beamforming in multi-user amplify-and-forward (AF) wireless relay networks are indefinite (nonconvex) quadratic programs, which require effective computational solutions. Solutions to these problems have often been obtained by relaxing the original problems to semi-definite programs (SDPs) of convex optimization. Most existing works have claimed that these relaxed SDPs actually provide the optimal beamforming solutions. This paper, however, shows that this is not the case in many practical scenarios where SDPs fail to provide even a feasible beamforming solution. To fill this gap, we develop in this paper a nonsmooth optimization algorithm, which provides the optimal solution at low computational complexity. © 2012 IEEE.

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

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