返回
Efficient Circular Flat-Top Pattern Synthesis With Circular Planar Array via Dimensionality Reduction
DOI:10.1109/LAWP.2023.3317310.png)
摘要
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.
Keyword:
Chebyshev approximation
Planar arrays
Dimensionality reduction
Transmission line matrix methods
Optimization
Costs
Iterative methods
Circular flat-top pattern
dimensionality reduction
even-order Chebyshev polynomials
期刊
IF:
4.8
论文数:
1.0W
被引数:
2.8W
机构
引用论文
A Simple Compact Wideband Microstrip Antenna Consisting of Three Staggered Patches由三个交错贴片组成的简单紧凑宽带微带天线
A Review of Multibeam Phased Array Antennas as LEO Satellite Constellation Ground Station多波束相控阵天线作为低轨卫星星座地面站的研究综述
IEEE ACCESS
IF3.6
Efficient RCS Computation Over a Broad Frequency Band Using Subdomain MoM and Chebyshev Approximation Technique
IEEE ACCESS
IF3.6
The Effects of Biodiesel on the Performance and Gas Emissions of Farm Tractors’ Engines: A Systematic Review, Meta-Analysis, and Meta-Regression
Energies
IF0

