.png){kind=icon}
.png){kind=icon}
Return
Efficient Circular Flat-Top Pattern Synthesis With Circular Planar Array via Dimensionality Reduction
.png){kind=icon}
PRE
AI
DOI：10.1109/LAWP.2023.3317310.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
Chebyshev approximation
Planar arrays
Dimensionality reduction
Transmission line matrix methods
Optimization
Costs
Iterative methods
Circular flat-top pattern
dimensionality reduction
even-order Chebyshev polynomials
Journal
IF:
4.8
Papers:
1.0W
Citations:
2.8W