Efficient Circular Flat-Top Pattern Synthesis With Circular Planar Array via Dimensionality Reduction

Zhang, W; Peng, Y; Li, M

Efficient Circular Flat-Top Pattern Synthesis With Circular Planar Array via Dimensionality Reduction

Zhang, W Peng, Y Li, M

Permalink

Publisher:: IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
Publication Type:: Journal Article
Citation:: IEEE Antennas and Wireless Propagation Letters, 2024, 23, (1), pp. 64-68
Issue Date:: 2024-01-01

Recently Added

	Filename	Description	Size
	1683373.pdf	Published version	4.46 MB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Open Access

This item is new to OPUS and is not currently available.

Full metadata record

Field	Value	Language
dc.contributor.author	Zhang, W
dc.contributor.author	Peng, Y
dc.contributor.author	Li, M https://orcid.org/0000-0002-2268-9334
dc.date.accessioned	2024-08-07T04:28:34Z
dc.date.available	2024-08-07T04:28:34Z
dc.date.issued	2024-01-01
dc.identifier.citation	IEEE Antennas and Wireless Propagation Letters, 2024, 23, (1), pp. 64-68
dc.identifier.issn	1536-1225
dc.identifier.issn	1548-5757
dc.identifier.uri	http://hdl.handle.net/10453/180192
dc.description.abstract	A novel method is presented to efficiently synthesize circular flat-top patterns with circular planar arrays, employing dimensionality reduction techniques. Considering the symmetry of the circular planar array geometry, we define the distance from each element to the array geometric center as the independent variable, then expand the excitation distribution using the even-order polynomials of a single Chebyshev polynomials. With the help of such polynomial expansion, we can synthesize pattern by solving polynomial coefficients instead of directly solving array excitation distribution, significantly reducing the number of optimization variables by over 98% compared with the number of array elements, which effectively converts a high-dimensional problem into a more manageable low-dimensional one. Two synthesis examples involving circular planar arrays with equispaced and nonequispaced elements are conducted to validate the effectiveness and advantages of our proposed method.
dc.language	English
dc.publisher	IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
dc.relation.ispartof	IEEE Antennas and Wireless Propagation Letters
dc.relation.isbasedon	10.1109/LAWP.2023.3317310
dc.rights	info:eu-repo/semantics/restrictedAccess
dc.subject	0906 Electrical and Electronic Engineering, 1005 Communications Technologies
dc.subject.classification	Networking & Telecommunications
dc.subject.classification	4006 Communications engineering
dc.title	Efficient Circular Flat-Top Pattern Synthesis With Circular Planar Array via Dimensionality Reduction
dc.type	Journal Article
utslib.citation.volume	23
utslib.for	0906 Electrical and Electronic Engineering
utslib.for	1005 Communications Technologies
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	recently_added	*
dc.date.updated	2024-08-07T04:28:30Z
pubs.issue	1
pubs.publication-status	Published
pubs.volume	23
utslib.citation.issue	1

Abstract:

A novel method is presented to efficiently synthesize circular flat-top patterns with circular planar arrays, employing dimensionality reduction techniques. Considering the symmetry of the circular planar array geometry, we define the distance from each element to the array geometric center as the independent variable, then expand the excitation distribution using the even-order polynomials of a single Chebyshev polynomials. With the help of such polynomial expansion, we can synthesize pattern by solving polynomial coefficients instead of directly solving array excitation distribution, significantly reducing the number of optimization variables by over 98% compared with the number of array elements, which effectively converts a high-dimensional problem into a more manageable low-dimensional one. Two synthesis examples involving circular planar arrays with equispaced and nonequispaced elements are conducted to validate the effectiveness and advantages of our proposed method.

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

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