Mask constrained beam pattern synthesis for large arrays

Hoang, HG; Vo, BN; Tuan, HD; Son, TT

Mask constrained beam pattern synthesis for large arrays

Hoang, HG Vo, BN Tuan, HD

Son, TT

Permalink

Publication Type:: Conference Proceeding
Citation:: Proceedings - 8th International Symposium on Signal Processing and its Applications, ISSPA 2005, 2005, 1 pp. 387 - 390
Issue Date:: 2005-12-01

Closed Access

	Filename	Description	Size
	2010003624OK.pdf		630.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	Vo, BN	en_US
dc.contributor.author	Tuan, HD https://orcid.org/0000-0003-0292-6061	en_US
dc.contributor.author	Son, TT	en_US
dc.date.issued	2005-12-01	en_US
dc.identifier.citation	Proceedings - 8th International Symposium on Signal Processing and its Applications, ISSPA 2005, 2005, 1 pp. 387 - 390	en_US
dc.identifier.isbn	0780392434	en_US
dc.identifier.isbn	9780780392434	en_US
dc.identifier.uri	http://hdl.handle.net/10453/16336
dc.description.abstract	Antenna array pattern synthesis with mask constraints can be formulated as a convex optimization problem with semi-infinite trigonometric polynomial constraints. The current approach uses a Linear Matrix Inequality (LMI) characterization of the semi-infinite constraints to convert the original problem into a semidefinite programming (SDP) problem. However, an important drawback of this approach is the large number of additional variables incurred in the equivalent SDP representation, which in turn prohibits its use in the design of large antenna arrays that arise in many modern applications. This paper presents an efficient method for the synthesis of large antenna arrays via a novel LMI characterization of semi-infinite constraints that only involves a minimal number of additional variables. Subsequently, the design of patterns for arrays with hundreds of elements can be easily achieved on a standard personal computer using existing SDP solvers. © 2005 IEEE.	en_US
dc.relation.ispartof	Proceedings - 8th International Symposium on Signal Processing and its Applications, ISSPA 2005	en_US
dc.relation.isbasedon	10.1109/ISSPA.2005.1580277	en_US
dc.title	Mask constrained beam pattern synthesis for large arrays	en_US
dc.type	Conference Proceeding
utslib.citation.volume	1	en_US
utslib.for	0906 Electrical and Electronic Engineering	en_US
dc.location.activity	Sydney, Australia	en_US
dc.location.activity	WOS:000263602900006
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
pubs.volume	1	en_US

Abstract:

Antenna array pattern synthesis with mask constraints can be formulated as a convex optimization problem with semi-infinite trigonometric polynomial constraints. The current approach uses a Linear Matrix Inequality (LMI) characterization of the semi-infinite constraints to convert the original problem into a semidefinite programming (SDP) problem. However, an important drawback of this approach is the large number of additional variables incurred in the equivalent SDP representation, which in turn prohibits its use in the design of large antenna arrays that arise in many modern applications. This paper presents an efficient method for the synthesis of large antenna arrays via a novel LMI characterization of semi-infinite constraints that only involves a minimal number of additional variables. Subsequently, the design of patterns for arrays with hundreds of elements can be easily achieved on a standard personal computer using existing SDP solvers. © 2005 IEEE.

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

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