Optimized beamforming problem in amplify-forward wireless MIMO relay networks

Phan, AH; Tuan, HD

Optimized beamforming problem in amplify-forward wireless MIMO relay networks

Phan, AH Tuan, HD

Permalink

Publication Type:: Conference Proceeding
Citation:: IEEE Wireless Communications and Networking Conference, WCNC, 2012, pp. 2577 - 2581
Issue Date:: 2012-08-01

Closed Access

	Filename	Description	Size
	06214234.pdf	Published version	1.2 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	Phan, AH	en_US
dc.contributor.author	Tuan, HD https://orcid.org/0000-0003-0292-6061	en_US
dc.date.issued	2012-08-01	en_US
dc.identifier.citation	IEEE Wireless Communications and Networking Conference, WCNC, 2012, pp. 2577 - 2581	en_US
dc.identifier.isbn	9781467304375	en_US
dc.identifier.issn	1525-3511	en_US
dc.identifier.uri	http://hdl.handle.net/10453/120921
dc.description.abstract	Total relay transmit power minimization in Amplify-forward (AF) MIMO relay beamforming is naturally formulated as an indefinite quadratic (nonconvex) program and then semidefinite relaxation (SDR) technique can be used to locate their optimal solutions. Indeed, SDR often gives rank-one optimal solution within a low number of relaying antennas and communicating users. However, as the antennas number increases, the computational complexity of SDR grows up explosively that requires a huge amount of additional variables. In this paper, a more efficient problem formulation is introduced, which needs a much reduced number of auxiliary variables but the optimal solutions are still achieved iteratively. Furthermore, it works as well as for max-min relay power optimization, for which SDR seems to be powerless for solution. Simulation shows the viability of the proposed approach. © 2012 IEEE.	en_US
dc.relation.ispartof	IEEE Wireless Communications and Networking Conference, WCNC	en_US
dc.relation.isbasedon	10.1109/WCNC.2012.6214234	en_US
dc.rights	info:eu-repo/semantics/closedAccess
dc.title	Optimized beamforming problem in amplify-forward wireless MIMO relay networks	en_US
dc.type	Conference Proceeding
utslib.for	0906 Electrical and Electronic Engineering	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

Abstract:

Total relay transmit power minimization in Amplify-forward (AF) MIMO relay beamforming is naturally formulated as an indefinite quadratic (nonconvex) program and then semidefinite relaxation (SDR) technique can be used to locate their optimal solutions. Indeed, SDR often gives rank-one optimal solution within a low number of relaying antennas and communicating users. However, as the antennas number increases, the computational complexity of SDR grows up explosively that requires a huge amount of additional variables. In this paper, a more efficient problem formulation is introduced, which needs a much reduced number of auxiliary variables but the optimal solutions are still achieved iteratively. Furthermore, it works as well as for max-min relay power optimization, for which SDR seems to be powerless for solution. Simulation shows the viability of the proposed approach. © 2012 IEEE.

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

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