D.C. iterations for SINR maximin multicasting in Cognitive radio

Phan, AH; Tuan, HD; Kha, HH

D.C. iterations for SINR maximin multicasting in Cognitive radio

Phan, AH Tuan, HD

Kha, HH

Permalink

Publication Type:: Conference Proceeding
Citation:: 6th International Conference on Signal Processing and Communication Systems, ICSPCS 2012 - Proceedings, 2012
Issue Date:: 2012-12-01

Closed Access

	Filename	Description	Size
	dc.pdf	Published version	1 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.contributor.author	Kha, HH	en_US
dc.date.issued	2012-12-01	en_US
dc.identifier.citation	6th International Conference on Signal Processing and Communication Systems, ICSPCS 2012 - Proceedings, 2012	en_US
dc.identifier.isbn	9781467323932	en_US
dc.identifier.uri	http://hdl.handle.net/10453/120162
dc.description.abstract	The design of transmit beamforming vectors to maximize the threshold of the signal-to-interference-plus-noise ratios (SINR) at the secondary receivers in cognitive multicast transmission is maximin optimization of quadratic fractional functions. There is no efficient solver for this hard maximin program. In the present paper, we show that the program can be effectively represented by a canonical d.c. (difference of convex functions) program of the same size. Accordingly, d.c. iterations are derived to locate its optimized solution. Our thorough numerical examples verify that the proposed algorithms offer almost global optimality whilst requiring relatively low computational load. © 2012 IEEE.	en_US
dc.relation.ispartof	6th International Conference on Signal Processing and Communication Systems, ICSPCS 2012 - Proceedings	en_US
dc.relation.isbasedon	10.1109/ICSPCS.2012.6507971	en_US
dc.rights	info:eu-repo/semantics/closedAccess
dc.title	D.C. iterations for SINR maximin multicasting in Cognitive radio	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:

The design of transmit beamforming vectors to maximize the threshold of the signal-to-interference-plus-noise ratios (SINR) at the secondary receivers in cognitive multicast transmission is maximin optimization of quadratic fractional functions. There is no efficient solver for this hard maximin program. In the present paper, we show that the program can be effectively represented by a canonical d.c. (difference of convex functions) program of the same size. Accordingly, d.c. iterations are derived to locate its optimized solution. Our thorough numerical examples verify that the proposed algorithms offer almost global optimality whilst requiring relatively low computational load. © 2012 IEEE.

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

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