检索结果-内蒙古大学图书馆

Polarization synthesis via Sequential Convex Optimizations

IEEE ANTENNAS AND WIRELESS PROPAGATION LETTERS 2024年第11期23卷 3516-3520页

作者： Ding, Yufeng You, Chang Jiang Zhang, Naibo Zhuang, Jie Zheng, Yuqing Univ Elect Sci & Technol China UESTC Chengdu 611731 Peoples R China UESTC Shenzhen Inst Adv Study Shenzhen 518110 Peoples R China China Elect Technol Grp Corp Res Inst 54 Beijing 050081 Peoples R China

A polarization synthesis method via sequential convex optimizations is addressed. This study solves the problem of high cost caused by the use of strict polarization constraints in existing studies. The polarization synthesis method proposed by us is formulated as a sequence of weighted convex optimization problems with relaxed polarization constraints, which can significantly reduce the number of antennas with negligible axial ratio accuracy loss. 3-D vector antennas have been introduced as basic antenna elements for polarization synthesis due to their high degrees of freedom. Various numerical results have been presented to shown the effectiveness and advantages of the proposed method.

关键词： Antenna arrays Vectors Antennas Convex functions Polarization Costs Accuracy array pattern synthesis convex programming polarization synthesis

来源：评论

学校读者我要写书评

暂无评论

A Novel Hybrid IWO/WDO Algorithm for Interference Minimization of Uniformly Excited Linear Sparse array by Position-Only Control

引用

IEEE ANTENNAS AND WIRELESS PROPAGATION LETTERS 2016年 15卷 250-254页

作者： Mahto, Santosh Kumar Choubey, Arvind Natl Inst Technol Dept Elect & Commun Engn Jamshedpur 831014 Bihar India

This letter introduces a novel, fast, efficient, and global optimization algorithm called hybrid invasive weed optimization and wind-driven optimization (IWO/WDO). The proposed algorithm is implemented to synthesize the uniformly excited (a(n) = 1, empty set(n) = 0) linear sparse array pattern having a minimum sidelobe level (SLL), and null control with constraint on beamwidth to minimize the interference effect by optimizing the element position-only. Three examples of (N = 10, 28, and 32)-element linear array synthesis are considered to illustrate the efficacy of the proposed algorithm. The results are compared to those obtained by IWO, WDO, PSO, CLPSO, DE, and BBO algorithms. Simulation studies demonstrate that this algorithm achieves minimum SLL of -23.5, -13.22, and -19.7 dB as compared to -17.35, -10.5, and -15.70 dB obtained by the IWO algorithm for 10-, 28-, and 32-elements array, respectively. Also, it yields a null depth level (NDL) larger than -84.5 dB in all cases. The learning characteristics show a faster convergence at around 100 iterations. The simulation results demonstrate the improved performance of hybrid IWO/WDO algorithm compared to other six algorithms in terms of null control, minimum SLL, beamwidth control, and the rate of convergence.

关键词： array pattern synthesis electromagnetic interference hybrid IWO/WDO invasive weed optimization (IWO) linear array wind-driven optimization (WDO)

来源：评论

学校读者我要写书评

暂无评论

Shaped Beam synthesis of Arbitrary arrays via Linear Programming

引用

IEEE ANTENNAS AND WIRELESS PROPAGATION LETTERS 2010年 9卷 481-484页

作者： Fuchs, Benjamin Univ Rennes 1 IETR F-35042 Rennes France

A simple procedure for the synthesis of shaped beams with arbitrary arrays is presented. The steps that reduce this general synthesis problem to a linear programming one, which is then called iteratively, are detailed. Since linear program solvers are largely and freely available, the additional effort to solve the shaping beam synthesis problem is limited. Numerical applications and comparisons to results found in the literature are performed to show the efficiency of the proposed procedure. To illustrate its versatility, the shaped-beam pattern synthesis is also presented for a conformal array.

关键词： array pattern synthesis conformal arrays linear programming

来源：评论

学校读者我要写书评

暂无评论

synthesis of Some Low Sidelobe Linear arrays Using Hybrid Differential Evolution Algorithm Integrated With Convex Programming

引用

IEEE ANTENNAS AND WIRELESS PROPAGATION LETTERS 2017年 16卷 2444-2448页

作者： Cui, Chao-Yi Jiao, Yong-Chang Zhang, Li Xidian Univ Natl Key Lab Antennas & Microwave Technol Xian 710071 Shaanxi Peoples R China Xidian Univ Collaborat Innovat Ctr Informat Sensing & Underst Xian 710071 Shaanxi Peoples R China

In this letter, some low sidelobe linear arrays are synthesized by a hybrid differential evolution (DE) algorithm integrated with convex programming. In the hybrid algorithm, the DE algorithm is used to optimize the array layouts only. Once the array layouts are fixed, the subproblems for minimizing the peak sidelobe level of the array pattern with constraints on its beamwidth become convex. A readily available MATLAB toolbox CVX is then used to solve the convex subproblems. Based on the optimal solution of each convex subproblem, an appropriate fitness function is defined in the DE algorithm. Some low sidelobe linear array synthesis examples are given to demonstrate the effectiveness of the proposed algorithm.

关键词： array pattern synthesis convex programming (CP) differential evolution (DE) hybrid method

来源：评论

学校读者我要写书评

暂无评论

Incomplete Anger-Weber Functions: A Class of Special Functions for Electromagnetics

引用

RADIO SCIENCE 2019年第4期54卷 331-348页

作者： Caratelli, Diego Antenna Co Res & Dev Eindhoven Netherlands Eindhoven Univ Technol Dept Elect Engn Eindhoven Netherlands Tomsk Polytech Univ Inst Cybernet Tomsk Russia

A novel class of special functions for electromagnetics is presented. Formed by the incomplete Anger-Weber functions, this class conveniently allows solving electromagnetic problems involving truncated circular electromagnetic structures. The definition of these functions is here introduced, and the relevant analytical properties are derived. The definition is such that the interrelationships between the incomplete functions parallel, as far as is feasible, those for canonical Anger-Weber functions.

关键词： special functions incomplete associated Anger-Weber functions uniform asymptotic expansion Bessel expansion series conformal antenna array array pattern synthesis

来源：评论

学校读者我要写书评

暂无评论

Constrained Deterministic synthesis of Conformal Supershaped Antenna arrays

引用

IEEE TRANSACTIONS ON ANTENNAS AND PROPAGATION 2023年第11期71卷 8726-8738页

作者： Geerarts, Justin M. E. Theis, Guilherme Smolders, A. Bart Caratelli, Diego Eindhoven Univ Technol Dept Elect Engn NL-5612 AZ Eindhoven Netherlands Eindhoven Univ Technol Electromagnet Grp NL-5612 AZ Eindhoven Netherlands Antenna Co NL-5656 AE Eindhoven Netherlands

Conformal array pattern synthesis represents a challenging problem for current state-of-the-art design techniques. To their detriment, these techniques typically suffer from a significant computational burden. A deterministic method for the synthesis of singly curved conformal antenna arrays based on the superformula and the auxiliary array pattern (AAP) formulation is presented. This method, being semianalytical in nature, is able to evaluate the location and excitation coefficients of each radiating element subject to different design constraints in a deterministic manner while utilizing multiple embedded element patterns. Therefore, this method is more computationally efficient than the state-of-the-art alternatives. The proposed synthesis technique has been validated through full-wave electromagnetic simulations and experimental measurements taken on physical demonstrators relevant to different applications within radar and communication systems. The obtained results show accurate agreement between simulations and measurements, requiring only seconds of computation on conventional hardware.

关键词： Antenna arrays Antenna radiation patterns Shape Geometry Electromagnetics Dipole antennas Three-dimensional displays antenna radiation patterns array pattern synthesis conformal arrays superformula

来源：评论

学校读者我要写书评

暂无评论

synthesis of Linear and Planar arrays via Sequential Convex Optimizations

引用

IEEE ACCESS 2020年 8卷 6717-6728页

作者： Qi, Zhengdong Bai, Yechao Zhang, Xinggan Nanjing Univ Sch Elect Sci & Engn Nanjing 210023 Peoples R China CSIC Res Inst 724 Nanjing 210000 Peoples R China

In this paper, an iterative procedure for the synthesis of sparse arrays radiating focused beampattern is presented. The proposed approach provides a signifcant reduction in the complexity of the beam forming network, which is fulfilled by reducing the number of antenna elements in the array. An iterative scheme is used where the prescribed pattern response in the mainlobe is cast as a multi-convex problem at each step that the nonconvex lower bound constraint is relaxed while including a reweighted l(1)-norm minimization based on the magnitudes of the elements. Thus, a sparse array with fewer elements (compared to other methods) and a better performance of beam pattern (e.g., narrower 3-dB beamwidth, lower maximum sidelobe level) is produced. The resulting sparse array is able to generate a steerable pencil beam, matching a given power mask and avoid to constraint the fitting of any a priori defined reference beam pattern. The practical array imperfections are also compensated in the optimization stage by using worst-case performance optimization technique. Examples concerning the design of linear and planar arrays show relevant savings of array elements with respect to conventional array techniques.

关键词： array pattern synthesis multi-convex programming sequential convex optimization sparse array

来源：评论

学校读者我要写书评

暂无评论

OPARC: Optimal and Precise array Response Control Algorithm-Part II: Multi-Points and Applications

引用

IEEE TRANSACTIONS ON SIGNAL PROCESSING 2019年第3期67卷 668-683页

作者： Zhang, Xuejing He, Zishu Xia, Xiang-Gen Liao, Bin Zhang, Xuepan Yang, Yue Univ Elect Sci & Technol China Dept Elect Engn Signal & Informat Proc Chengdu 611731 Sichuan Peoples R China Univ Delaware Dept Elect & Comp Engn Newark DE 19716 USA Univ Elect Sci & Technol China Chengdu 611731 Sichuan Peoples R China Univ Delaware Dept Elect & Comp Engn Newark DE 19716 USA Shenzhen Univ Coll Informat Engn Shenzhen 518060 Peoples R China Qian Xuesen Lab Space Technol Beijing 100094 Peoples R China

In this paper, the optimal and precise array response control (OPARC) algorithm proposed in Part I of this two paper series is extended from single point to multi-points. Two computationally attractive parameter determination approaches are provided to maximize the array gain under certain constraints. In addition, the applications of the multi-point OPARC algorithm to array signal processing are studied. It is applied to realize array pattern synthesis (including the general array case and the large array case), multi-constraint adaptive beamforming, and quiescent pattern control, where an innovative concept of normalized covariance matrix loading is proposed. Finally, simulation results are presented to validate the effectiveness and good performance of the multi-point OPARC algorithm.

关键词： array response control adaptive array theory array pattern synthesis adaptive beamforming quiescent pattern control

来源：评论

学校读者我要写书评

暂无评论

synthesis of Sparse arrays With Focused or Shaped Beampattern via Sequential Convex Optimizations

引用

IEEE TRANSACTIONS ON ANTENNAS AND PROPAGATION 2012年第7期60卷 3499-3503页

作者： Fuchs, Benjamin Ecole Polytech Fed Lausanne Lab Electromagent & Acoust Lausanne Switzerland

An iterative procedure for the synthesis of sparse arrays radiating focused or shaped beampattern is presented. The algorithm consists in solving a sequence of weighted l(1) convex optimization problems. The method can thus be readily implemented and efficiently solved. In the optimization procedure, the objective is the minimization of the number of radiating elements and the constraints correspond to the pattern requirements. The method can be applied to synthesize either focused or shaped beampattern and there is no restriction regarding the array geometry and individual element patterns. Numerical comparisons with standard benchmark problems assess the efficiency of the proposed approach, whose computation time is several orders of magnitude below those of so-called global optimization algorithms.

关键词： array pattern synthesis convex programming linear arrays planar arrays sparsity

来源：评论

学校读者我要写书评

暂无评论

Revisiting a Method of Beam Shaping Using Phase Weights

Revisiting a Method of Beam Shaping Using Phase Weights

引用

IEEE International Symposium on Phased array Systems and Technology (PAST)

作者： Leifer, Mark C. Ball Aerosp & Technol Corp Westminster CO 80021 USA

ISBN: (纸本)9781509014477

This paper revisits a method of synthesizing array beam patterns using phase weights. The original paper by Kinsey suggested the technique but omitted implementation details. The present paper provides mathematical justification for the technique as well as a step-by-step process for designing a shaped beam using phase weights. The validity and flexibility of the technique is illustrated with examples of broadened and scanned beams, both with and without amplitude tapers. We believe that this " rediscovered" method is a useful addition to the phasedarray designer's toolbox.

关键词： phased array phase taper phase-only phase weights beam spoiling beam broadening array pattern synthesis

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：