采用循环差集和差分进化算法的稀疏MIMO雷达方向图优化

MIMO雷达的旁瓣电平(SLL)是MIMO雷达方向图主要的影响因素,会给成像效果带来极为不利的影响,为有效地降低MIMO雷达的旁瓣电平,在前期对MIMO雷达方向图研究的基础上提出了一种新的算法C-DSDE,该算法采用循环差集(Circle Different Set, C-DS)实现雷达阵元的快速布阵,采用差分进化算法(Different Evolution, DE)实现雷达阵元激励幅度优化,在提升算法的计算效率基础上,最大可能地避免DE早熟现象的发生。通过实验与对比,本文所提出的方法可以有效地降低MIMO雷达的旁瓣电平,运行结果较为稳定,计算效率也有所提升,从而表明该算法在MIMO雷达方向图优化中的可行性。     

遗传算法在阵列天线方向图综合中的应用

应用实数编码的遗传算法进行阵列天线方向图综合的优化设计.针对阵列天线方向图综合的特点,运用算法,通过优化单元电流幅度、阵元间距,对阵列天线方向图进行了综合优化,其中包括方向图的波瓣控制和零点生成,并同时压低旁瓣电平使其达到期望值.仿真结果表明,通过优化,天线阵的辐射特性获得很大的改善,在主瓣宽度满足要求的情况下,副瓣电平也可达到-33.6100dB.良好的仿真结果表明遗传算法在阵列天线方向图综合中的应用是有效的,有良好的应用前景.     

基于遗传算法的MIMO发射接收阵列联合优化研究

为了对MIMO发射接收阵列进行联合波束优化,提出了一种采用遗传算法对MIMO收发阵列联合优化的方法.分析了MIMO发射接收阵列联合优化的必要性,建立了MIMO稀疏阵列信号模型,给出了MIMO稀疏阵虚拟收发波束形成的方法.提出了基于遗传算法的MIMO阵列优化方法,包括适应度函数设计、编码以及交叉变异方法等,优化目的为保持主瓣宽度不变的情况下,尽可能抑制旁瓣水平.仿真结果表明了该算法的有效性.     

基于遗传算法的深空探测天线综合

为了改善深空探测中共焦面阵列馈电抛物反射面天线的可视范围,提出一种基于遗传算法的扫描波束综合方法。基于物理光学法计算共焦面馈电阵中每个馈源照射反射面的次级远场方向图,利用遗传算法优化得到的权值对各次级方向图加权合成期望的波束。仿真和分析结果表明：提出的基于遗传算法的共焦面阵列馈电反射面方向图综合与传统共轭场匹配方法相比,可控制旁瓣电平,更精确综合出期望方向图,扩大深空探测天线的可视范围。     

一种广域稀布雷达低旁瓣波束形成方法

广域稀布雷达具有抗干扰、抗摧毁能力强等优点,但是其方向图会因阵元稀布而存在大量的高旁瓣。提出一种脉组内捷变频联合波束形成方法,通过在雷达的连续脉组内发射不同频率的信号,并将不同频率的信号进行相参合成,在使主瓣电平不变的情况下,得到更低的旁瓣电平。通过与遗传算法相结合,并设定适当的约束和适应度函数,经迭代优化后的布局,可以得到具有更低的旁瓣电平的方向图。仿真结果表明：经该方法优化后,广域稀布线阵旁瓣电平降低至-11.85dB,广域稀布面阵方位向和俯仰向旁瓣电平分别降低至-14.18dB及-14.73dB。该方法可以有效降低广稀疏阵列的旁瓣电平。     

基于微遗传算法的稀疏天线阵列优化方法

为生成无栅瓣、高空间分辨率的方向图,均匀平面阵列使用的天线单元数量很多,实现难度和成本高。稀疏布阵只需要相对较少的单元数目,会出现旁瓣电平升高、测向模糊等问题。通过对天线阵列特性进行分析,以全向一致、无栅瓣、低旁瓣的高分辨方向图为目标,利用微遗传算法对多重圆环阵列单元的位置参数进行优化,性能分析表明综合出的多重圆环阵列具有方位角对称、旁瓣电平低、起伏小的特点,且该算法优化效率高、收敛速度快。     

基于改进遗传算法的圆阵稀布方法

由于圆形阵列所具有的特性,使其正得到日益广泛的应用,但是圆阵方向图却具有相对主瓣较高的旁瓣电平。为此,针对稀布圆形阵列的天线单元使旁瓣电平尽量降低的问题,应用改进的遗传算法,取角度差值为染色体的基因,进行阵列孔径、单元个数、最小间隔一定的稀布优化排列,减小了遗传算法的搜索空间,提高了搜索效率。仿真结果表明:该方法能有效提高收敛速度、降低圆阵的旁瓣电平。     

基于遗传算法的低副瓣阵列天线综合

为得到更低副瓣的方向图,建立16单元线天线阵和32×32单元面天线阵遗传算法模型,并对这两类阵列天线方向图进行综合。将综合仿真结果与Chebyshev、Taylor两种传统综合方法进行比较。比较结果表明,遗传算法优化方向图的第1副瓣电平可达-40dB,且优化效率比传统方法高很多。为遗传算法在阵列天线方向图综合中的应用提供了技术支持。     

基于混沌遗传算法的二维平面阵研究

针对一般均匀平面阵列方向图旁瓣较高的问题，利用传统遗传算法对均匀阵进行二维稀布排列，有效降低了旁瓣电平，但遗传算法收敛速度慢，容易陷入局部最优解。因混沌优化算法具有随机性、遍历性以及规律性的特性，把混沌优化算法引入到遗传算法中，利用混沌序列初始化种群，可提高遗传算法的收敛速度和获得全局最优解的能力。因此，提出一种基于混沌优化算法的遗传算法，并把该算法应用到二维平面阵天线设计中，该算法对天线阵的排布进行了优化设计。仿真结果显示混沌遗传算法的收敛速度有所提高，阵列天线的副瓣电平进一步降低，说明该方法具有一定的可行性。     

基于NSGA-Ⅱ的频控阵发射波束优化

为了改善频控阵波束方向图，达到波束宽度、旁瓣电平的整体最优，提出一种基于非支配排序遗传算法(Non-dominated Sorting Genetic AlgorithmⅡ,NSGA-Ⅱ)的频控阵发射波束优化方法。该方法将距离维主瓣波束宽度和最大旁瓣电平作为优化目标，采用NSGA-Ⅱ优化频率偏移求解Pareto最优解集。仿真结果表明该方法可以得到分布均匀、多样性良好的Pareto前沿，结合实际应用需求可以从Pareto最优解集中选择一组合适的频率偏移，与现有的频控阵相比具有更好的目标定位能力。     

Design of aperiodic planar arrays for isoflux radiation in GEO satellites by applying evolutionary optimization

The design of an aperiodic planar array is presented in this research. This design of aperiodic arrays considers the reduction of the side lobe level and the isoflux radiation requirements for GEO (Geostationary Earth Orbit) satellite applications. In this way, it is considered four different optimization cases. The first two cases are optimizations of amplitude and phase excitations for the antenna elements in a uniform antenna array and the last two cases are optimizations of positions of the antenna elements and certain number of levels of amplitude excitation in an aperiodic array. In this case, it is proposed a simple new approach combining the main idea of both thinned theory and random arrays approaches. For this optimization problem, the well-known method of Genetic Algorithms (GA) is utilized. The obtained results show the proper performance of the array factor to provide the isoflux radiation and low side lobe level. Depending on the performance requirements, the design of the aperiodic array could lead the satellite hardware to be reduced significantly even more that results presented previously in the literature.     

MIMO‐UWB smart antenna communication characteristics for different antenna arrays of transmitters

The channel capacity of indoor multiple‐input multiple‐output ultra‐wide band (MIMO‐UWB) transmission for smart antenna is presented. The genetic algorithm (GA) is used to synthesize the radiation pattern of the directional antenna array to maximize the capacity performance in indoor MIMO‐UWB communication system. Three types of antenna arrays such as circular shape, L shape and Y shape arrays are used in the transmitter and their corresponding capacity on several paths in the indoor environment are calculated. The UWB impulse responses of the indoor channel for any transmitter‐receiver location are computed by applying shooting and bouncing ray/image (SBR/image) techniques, inverse fast Fourier transform and Hermitian processing. By using the calculated frequency response, the capacity performance of the synthesized antenna pattern on MIMO‐UWB system can be computed. Based on the topography of the antenna array and the capacity formula, the array pattern synthesis problem can be reformulated into an optimization problem and solved by the GA algorithm. The GA algorithm optimization is applied to a high order nonlinear optimization problem. The novelties of our approach is not only choosing capacity as the cost function instead of sidelobe level of the antenna pattern, but also considering the antenna feed length effect of each array element. The cost function for the problem is nonsmooth and discontinuous with respect to the antenna pattern. It is difficult to solve by gradient methods, since the derivative is hard to derive. The GA algorithm is employed to optimize the excitation voltages and feed lengths for these antenna arrays to increase the capacity. The strong point of the GA is that it can find out the solution even if the performance index cannot be formulated by simple equations. Numerical results show that the synthesized antenna array pattern is effective to focus maximum gain to the LOS path for these antenna arrays. In other words, the receiver can increase the received signal energy to noise ratio. The synthesized array pattern also can mitigate severe multipath fading in complex propagation environment. As a result, the capacity can be increased substantially in indoor MIMO‐UWB communication system. The investigated results can help communication engineers improve their planning and design of indoor wireless communication. © 2012 Wiley Periodicals, Inc. Int J RF and Microwave CAE, 2013.     

Genetic algorithm optimization of a planar slot array using full wave method‐of‐moments analysis

Waveguide‐fed slot arrays in standing wave mode have been employed successfully in space based remote sensing radars because of their high efficiency, ease of deployment and their ability to withstand the radiation environment. Although the bandwidth requirement in such systems is minimal, at Ka band and above manufacturing tolerances in the order of 1 mil (25 μm), achieved in the dip brazing process, may affect their performance. To produce designs that are less sensitive to manufacturing tolerance, genetic algorithm (GA) optimization is employed in conjunction with a full wave analysis utilizing the method‐of‐moments solution to the pertinent integral equations of slot apertures of a planar array. In this work, a single 8 × 10 sub‐array of an interferometric antenna, proposed previously for a planetary mapping application, was investigated. The array was first designed by the Elliott's procedure and subsequently the design parameters were perturbed by GA optimization using the moment method analysis. The fitness parameter is a weighted function of return loss and gain over a number of frequencies in the operating band. A matching waveguide section consisting of inductive irises is also optimized using GA and mode matching technique. Optimum designs producing nearly constant gain and good return loss over 6% bandwidth are found to be less sensitive to manufacturing tolerance than the initial Elliott design. © 2013 Wiley Periodicals, Inc. Int J RF and Microwave CAE, 2013.     

Optimized element positions for prescribed radar cross section pattern of linear dipole arrays

Approximate closed‐form expression is derived for the scattering from dipole arrays based on the equivalent circuit theory. Then, a method is proposed for synthesis of dipole arrays to produce desired scattering pattern using genetic algorithm (GA). In the synthesis method, the element positions in an array are considered as the optimization parameter and the derived expression is used to evaluate the fitness function of GA. To assess the validity and efficiency of the proposed method, several linear dipole arrays are designed to obtain scattering pattern with low sidelobe level (SLL). A good agreement between the patterns calculated using the expression and simulated by FEKO validates the accuracy of the presented expression. In addition, the numerical results show that the maximum SLL of the scattering pattern is considerably reduced by optimization. © 2011 Wiley Periodicals, Inc. Int J RF and Microwave CAE, 2011.     

基于遗传算法的多板天线时延相位补偿技术

关于动中通系统中普遍采用抛物面天线,可使得系统小型化难度增加,为优化最佳天线方案,采用平板天线取代抛物面天线可以部分改善.为促进动中通技术在车载平台中的应用,提出了超低轮廓相控阵天线方案,使得平板相控阵天线的高度进一步降低.针对孔径效应和孔径渡越时间限制问题,给出了时延相位两级补偿的方法,有效扩展了天线系统的工作带宽;同时采用遗传算法调整天线阵因子相位,对多板相控阵天线方向图的副瓣高度实现了优化.仿真结果表明,多板天线方案可以实现性能对平板天线的逼近,并很好的适应了车载平台对天线高度的严格要求,有较高的工程实用价值.     

Design of a linear array antenna for shaped beam using genetic algorithm

A linear array antenna design with desired radiation pattern has been presented based on genetic algorithm (GA) approach. Examples of cosecant and flat‐topped beam patterns are illustrated to show the flexibility of GA to solve complex antenna synthesis problems by suitably selecting the fitness function, even with a simple GA. The results have been validated by IE3D electromagnetic simulation. The antenna arrays with different element geometries can also be implemented using the proposed technique. © 2008 Wiley Periodicals, Inc. Int J RF and Microwave CAE, 2008.     

An extended particle swarm optimization algorithm for pattern synthesis of conformal phased arrays

In this article, an extended particle swarm optimization (EPSO) algorithm is proposed for designing conformal phased arrays. On the basis of traditional particle swarm optimization (PSO), novel velocity updating mechanism, new exceeding boundary control operator, and global best perturbation are introduced in EPSO to overcome the drawbacks of PSO. To validate the efficiency of the proposed algorithm, both the classical test functions and the scenarios concerning a 1 × 9‐element cylindrical conformal phased array and a 3 × 9(27)‐element cylindrical conformal array with flat‐top shaped‐beam pattern are presented. Simulation results show that the proposed method is superior to genetic algorithm (GA) and PSO when applied to both the classical test functions and the practical problems of conformal antenna array synthesis. © 2010 Wiley Periodicals, Inc. Int J RF and Microwave CAE, 2010.     

A novel hybrid invasive weed optimization algorithm for pattern synthesis of array antennas

By introducing novel strategies in Invasive Weed Optimization (IWO), a hybrid algorithm called IWO‐simplified quadratic approximation (SQA) is proposed, in which an adaptive standard deviation is designed to improve the convergence performances of the original IWO, and SQA is embedded into IWO as a local search operator to enhance the overall search capability of the algorithm. Simulated results for six benchmark functions show that the proposed algorithm performs better than the original IWO algorithm. In addition, the proposed algorithm is used to the pattern synthesis of array antennas. Compared to the genetic algorithm (GA) and particle swarm optimization (PSO), the advantages of IWO‐SQA algorithm are shown. As another application, the phase‐only pattern reconfigurable arrays are synthesized by IWO‐SQA algorithm, and the numerical results show that IWO‐SQA algorithm is superior to GA. All the testing results show that it is an effective improvement to embed SQA into IWO algorithm. © 2014 Wiley Periodicals, Inc. Int J RF and Microwave CAE 25:154–163, 2015.     

Efficient reconfiguration algorithms for communication-aware three-dimensional processor arrays

Homogeneous processor arrays are emerging in tera-scale computation and effective fault tolerance techniques are essential to improving the reliability of such complex integrated circuits. We study the degradable processor arrays to achieve fault tolerance by employing reconfiguration. Three bypass schemes and three rerouting schemes are proposed to reconfigure three-dimensional processor arrays with defective processors to achieve target arrays without faults. A heuristic algorithm is proposed to construct a target array on the selected rows and columns. It is also proved that the proposed greedy plane rerouting algorithm (GPR) produces maximum target array. In addition, the problem of constructing the communication efficient array is considered in this paper. An algorithm is proposed to refine the communication among processors within the target array constructed by GPR. Experimental study shows that the proposed algorithm GPR produces target arrays with higher harvest and lower degradation on the host arrays with fault density no more than 5%. In addition, the communication performance is significantly optimized by reducing the number of long interconnects, and the average improvement is about 34% for all cases considered in this paper.