Large array beamforming via semidefinite programming

Hoang, HG; Tuan, HD; Vo, B

Large array beamforming via semidefinite programming

Hoang, HG Tuan, HD

Vo, B

Permalink

Publication Type:: Conference Proceeding
Citation:: Sixth IEEE International Symposium on Signal Processing and Information Technology, ISSPIT, 2006, pp. 857 - 862
Issue Date:: 2006-01-01

Closed Access

	Filename	Description	Size
	2010003615OK.pdf		207.14 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	Hoang, HG	en_US
dc.contributor.author	Tuan, HD https://orcid.org/0000-0003-0292-6061	en_US
dc.contributor.author	Vo, B	en_US
dc.date.issued	2006-01-01	en_US
dc.identifier.citation	Sixth IEEE International Symposium on Signal Processing and Information Technology, ISSPIT, 2006, pp. 857 - 862	en_US
dc.identifier.isbn	0780397541	en_US
dc.identifier.isbn	9780780397545	en_US
dc.identifier.uri	http://hdl.handle.net/10453/16409
dc.description.abstract	Bounding the sidelobe and mainlobe levels of an array with complex weights is attractive in that it allows direct control of the radiation pattern. In this paper we propose an efficient beamforming technique for synthesizing the patterns of large arrays with bound constraints on the sidelobe and mainlobe levels. It is shown that the pattern synthesis problem can be posed as a convex semi-infinite programme (SIP) which is then turned into a semidefinite programme (SDP) via a novel linear matrix inequality (LMI) characterization of semi-infinite trigonometric polynomial constraints. In contrast to existing SDP formulations which require a large number of additional variables, our SDP representation only uses a minimal number of additional variables. This subsequently enables the design of patterns for arrays with several hundred elements to be efficiently achieved on a standard personal computer using existing SDP solvers. © 2006 IEEE.	en_US
dc.relation.ispartof	Sixth IEEE International Symposium on Signal Processing and Information Technology, ISSPIT	en_US
dc.relation.isbasedon	10.1109/ISSPIT.2006.270918	en_US
dc.title	Large array beamforming via semidefinite programming	en_US
dc.type	Conference Proceeding
utslib.for	0906 Electrical and Electronic Engineering	en_US
dc.location.activity	Vancouver, Canada	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:

Bounding the sidelobe and mainlobe levels of an array with complex weights is attractive in that it allows direct control of the radiation pattern. In this paper we propose an efficient beamforming technique for synthesizing the patterns of large arrays with bound constraints on the sidelobe and mainlobe levels. It is shown that the pattern synthesis problem can be posed as a convex semi-infinite programme (SIP) which is then turned into a semidefinite programme (SDP) via a novel linear matrix inequality (LMI) characterization of semi-infinite trigonometric polynomial constraints. In contrast to existing SDP formulations which require a large number of additional variables, our SDP representation only uses a minimal number of additional variables. This subsequently enables the design of patterns for arrays with several hundred elements to be efficiently achieved on a standard personal computer using existing SDP solvers. © 2006 IEEE.

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

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