Low-dimensional SDP formulation for large antenna array synthesis

Hoang, HG; Tuan, HD; Vo, BN

Low-dimensional SDP formulation for large antenna array synthesis

Hoang, HG Tuan, HD

Vo, BN

Permalink

Publication Type:: Journal Article
Citation:: IEEE Transactions on Antennas and Propagation, 2007, 55 (6 II), pp. 1716 - 1725
Issue Date:: 2007-06-01

Closed Access

	Filename	Description	Size
	2010003571OK.pdf		473.88 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, BN	en_US
dc.date.issued	2007-06-01	en_US
dc.identifier.citation	IEEE Transactions on Antennas and Propagation, 2007, 55 (6 II), pp. 1716 - 1725	en_US
dc.identifier.issn	0018-926X	en_US
dc.identifier.uri	http://hdl.handle.net/10453/15372
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 program (SIP) which is then turned into a semi-definite program (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. © 2007 IEEE.	en_US
dc.relation.ispartof	IEEE Transactions on Antennas and Propagation	en_US
dc.relation.isbasedon	10.1109/TAP.2007.898573	en_US
dc.subject.classification	Networking & Telecommunications	en_US
dc.title	Low-dimensional SDP formulation for large antenna array synthesis	en_US
dc.type	Journal Article
utslib.citation.volume	6 II	en_US
utslib.citation.volume	55	en_US
utslib.for	0906 Electrical and Electronic Engineering	en_US
utslib.for	1005 Communications Technologies	en_US
dc.location.activity	ISI:000247223700005	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	6 II	en_US
pubs.publication-status	Published	en_US
pubs.volume	55	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 program (SIP) which is then turned into a semi-definite program (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. © 2007 IEEE.

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

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