D.C. programming for cooperative beamforming in SC-FDMA multi-user multi-relay networks

Kha, HH; Tuan, HD; Nguyen, HH; Pham, TT

D.C. programming for cooperative beamforming in SC-FDMA multi-user multi-relay networks

Kha, HH Tuan, HD

Nguyen, HH Pham, TT

Permalink

Publication Type:: Conference Proceeding
Citation:: GLOBECOM - IEEE Global Telecommunications Conference, 2012, pp. 4998 - 5003
Issue Date:: 2012-12-01

Closed Access

	Filename	Description	Size
	2012004169OK.pdf		1.6 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	Kha, HH	en_US
dc.contributor.author	Tuan, HD https://orcid.org/0000-0003-0292-6061	en_US
dc.contributor.author	Nguyen, HH	en_US
dc.contributor.author	Pham, TT	en_US
dc.date.issued	2012-12-01	en_US
dc.identifier.citation	GLOBECOM - IEEE Global Telecommunications Conference, 2012, pp. 4998 - 5003	en_US
dc.identifier.isbn	9781467309219	en_US
dc.identifier.uri	http://hdl.handle.net/10453/23101
dc.description.abstract	We are concerned with a cooperative beamforming design for multi-user multi-relay wireless networks in which the single-carrier frequency division multiple access (SC-FDMA) technique is employed at the terminals. The problem of interest is to find the beamforming weights across relays to maximize the minimum signal-to-interference-plus-noise ratio (SINR) among users subject to individual power constraints at each relay. Such a beamforming design is shown to be a hard nonconvex program and therefore it is mathematically challenging to find the optimal solution. By exploring its partial convex structures, we recast the design problem as minimization of a d.c. (difference of two convex) objective function subject to convex constraints and develop an effective iterative algorithm of low complexity to solve it. Simulation results show that our optimal cooperative beamforming scheme realizes the inherent diversity order of the relay network and it performs significantly better than the equal-power beamforming weights. © 2012 IEEE.	en_US
dc.relation.ispartof	GLOBECOM - IEEE Global Telecommunications Conference	en_US
dc.relation.isbasedon	10.1109/GLOCOM.2012.6503912	en_US
dc.title	D.C. programming for cooperative beamforming in SC-FDMA multi-user multi-relay networks	en_US
dc.type	Conference Proceeding
utslib.for	0906 Electrical and Electronic Engineering	en_US
dc.location.activity	Anaheim, USA	en_US
dc.location.activity	Anaheim, USA
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:

We are concerned with a cooperative beamforming design for multi-user multi-relay wireless networks in which the single-carrier frequency division multiple access (SC-FDMA) technique is employed at the terminals. The problem of interest is to find the beamforming weights across relays to maximize the minimum signal-to-interference-plus-noise ratio (SINR) among users subject to individual power constraints at each relay. Such a beamforming design is shown to be a hard nonconvex program and therefore it is mathematically challenging to find the optimal solution. By exploring its partial convex structures, we recast the design problem as minimization of a d.c. (difference of two convex) objective function subject to convex constraints and develop an effective iterative algorithm of low complexity to solve it. Simulation results show that our optimal cooperative beamforming scheme realizes the inherent diversity order of the relay network and it performs significantly better than the equal-power beamforming weights. © 2012 IEEE.

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

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