Synthesis of linear antenna arrays using Z transforms

It is well known that a linear antenna array with equally spaced elements can be represented by a polynomial whose roots correspond to the nulls of its antenna pattern. Since the linear array has equally spaced elements, its polynomial has only integral powers of the variable, so that the array can be represented by aZtransform. Therefore, the effect of moving roots of the polynomial can be represented as a linear sampled-data system problem, which is solved by using a table ofZtransforms or by discrete numerical convolution. In this paper, the quantitative effects on the array and its antenna pattern caused by moving roots of the polynomial are determined, and these effects are utilized for array synthesis to produce desired antenna patterns. Examples illustrating the use of this new synthesis technique include modification of a uniform array to obtain low sidelobes in the antenna pattern and synthesis of an array to produce nulls in its antenna pattern in the directions of discrete and spatially distributed interference sources.     

Phase-only synthesis of the radiation pattern of the phased array antenna of a coordinate meter

Design versions of the phased array antenna (PAA) of an object coordinate meter are considered. The array antenna forms the sum radiation pattern and two difference patterns ensuring measuring of the object angular coordinates. The problem of the phase-only synthesis of the PAA sum amplitude pattern with a given shape is solved under the condition of keeping the angular orientation of direction-finding nulls of difference patterns in the pattern scanning direction. Design relationships are derived and a pattern synthesis method based on numerical minimization of a nonlinear functional is described. Synthesis examples are presented.     

低副瓣任意波束直接合成算法研究

在传统阵列天线波束赋形设计中，通过对阵元天线辐射方向图进行幅度相位加权，获得阵列合成方向图.通常阵元激励幅度相位权值的获取，取决于优化算法对目标方向图和阵列合成方向图的对比，通过对阵元激励幅度相位进行大量随机选参后，获得优化结果.由于算法通常是基于相关的阵元方向图，且算法中缺乏副瓣抑制机制，使得方向图合成效率不高且副瓣效果通常不理想.该文设计了一种任意波束直接合成算法.该方法首先在阵元方向图的基础上获得一组互相独立的高增益窄波束（自由基波束），然后基于此波束进行方向图的直接合成，使波束赋形问题统一到基于自由基波束权值运算的范畴内，对波束赋形问题进行了统一，避免了未知参量的随机优选过程，极大提升了阵列天线波束赋形设计的效率.同时在自由基设计的过程中结合了副瓣抑制机制，且这种副瓣抑制机制与波束赋形过程互相独立，使合成波束的副瓣天然地具备了低副瓣的特征.     

Approximated synthesis of antenna array for interference compensator

For the two-channel antenna array of interference compensator, consisting of the main antenna array and compensational antenna with low directivity, the problem of approximated synthesis of the main antenna array of isotropic radiators is solved, in which the radiation patters in the region of side lobes is formed, taking into account the radiation pattern of the compensational antenna.     

Method of the Amplitude–Phase Synthesis of a Pareto-Optimal Planar Antenna Array

A method of the amplitude–phase multicriteria synthesis of a Pareto-optimal antenna array is proposed. The method is based on representation of the initial antenna array synthesis problem in the form of successively solved partial problems (subproblems) with small dimensionality. Each subproblem is reduced to determination of Pareto-optimal parameters of the amplitude–phase distribution of an additional beam added to the initial radiation pattern.     

Comparison of different antenna arrays for the BER reduction in indoor wireless communication

In this paper, we use the ultra wideband antenna array combined with particle swarm optimization (PSO) to minimize the BER for indoor communication systems. Three types of antenna arrays, namely the circular shape, L shape, and Y shape arrays, are used in the transmitter and their corresponding BER on several paths in the indoor environment are calculated. On the basis of the topography of the antenna array and the BER formula, the array pattern synthesis problem can be reformulated into an optimization problem and solved by the PSO. The novelties of our approach is not only choosing BER as the object function instead of the sidelobe level of the antenna pattern, but also considering the antenna feed length effect of each array element. The particle swarm optimization algorithm is employed to optimize the excitation voltages and feed lengths for these antenna arrays to reduce the BER. The strong point of the PSO is that it can find the solution even if the performance index cannot be formulated by simple equations. By the obtained antenna patterns, we can know the route with the lowest BER; meanwhile, transmission power using this route can be reduced. Numerical results show that the synthesized antenna array pattern is effective in focusing maximum gain to the line‐of‐sight path for these antenna arrays. The synthesized array pattern also can mitigate severe multipath fading in complex propagation environments. As a result, the BER can be reduced substantially in indoor ultra wideband communication systems. The investigated results can help communication engineers improve their planning and design of indoor wireless communication.Copyright © 2011 John Wiley & Sons, Ltd.     

Linear antenna array pattern synthesis with prescribed broad nulls

A technique of synthesizing an antenna array pattern with prescribed broad nulls is presented. The array pattern synthesis problem is formulated as a least-square null constrained optimization problem. Numerical techniques based on the matrix factorization method are developed for reducing the computational complexity of determining the optimal weight vector. Subsequently, a set of eigenvector constraints are used to approximate the effect of the quadratic constraint. Numerical results are presented to illustrate the performance achievable     

Eigen-approach for wide-band interference suppression

This paper presents a new synthesis technique of an antenna array pattern for multiple wide-band interference suppression. The proposed technique uses an eigen-approach to design an array pattern with arbitrary controlled multiple broad suppressed sectors by controlling the array complex element excitations. The eigen-approach determines the element complex current ratios that produce the closest perturbed pattern in the least squares sense. Numerical results show that the proposed technique can suppress multiple wide sectors in the array pattern and control the sector depths by applying an appropriate weight factor on the mean square error of the perturbed pattern in the prescribed sector intervals.     

迭代投影的平顶方向图综合算法

针对现有的平顶波束综合形成算法计算量较大的问题,提出了一种迭代求解平顶波束的快速形成算法。该算法首先设置方向图参数、迭代条件,然后利用方向图与阵元加权系数的变换关系设计投影算法并通过二阶差分运算确定过渡带,最后结合蝶形计算方法快速迭代逼近理想的平顶方向图。实验结果表明,该算法相比凸优化算法运算效率较高,并且可修复阵元失效后的平顶方向图。算法运算次数随着副瓣阈值、主瓣宽度和零陷深度等参数的变化而变化。     

基于离网格结合粒子群算法的稀疏阵列综合

针对大型稀疏阵列未知期望方向图的综合问题, 提出了一种基于离网格结合粒子群算法的方法综合稀布阵列单元位置以使增益最大化.该方法在粒子群算法的基础上, 再次在网格单元中进行梯度寻优, 能快速找到增益最大时对应的阵元位置且无需已知期望方向图.该算法对稀疏阵列综合效果良好, 增益提升显著且扫描过程中栅瓣抑制良好.通过对综合结果进行HFSS全波仿真对比, 数值仿真结果与综合结果基本一致, 证明了该方法的正确性.     

基于框架理论的最小阵元数稀疏阵综合算法研究

随着越来越高的角度分辨率要求与进一步降低的天线成本,大规模阵列越来越普及。在重量、体积和成本有限时,要获得大孔径天线得到较高的角度分辨率,且尽量减少天线阵元数目,可采用最小阵元稀疏阵设计方法。本文基于框架理论,提出了一种新的最小阵元数的稀疏阵综合方法。该方法将稀疏阵设计问题转化为压缩感知问题模型,然后利用次优反馈的零空间追踪硬阈值算法求解。该方法可同时综合阵元位置与阵元权重来匹配给定的阵列方向图,并可有效降低阵元数。仿真实验证明了算法的正确性和有效性     

圆柱面上的轴向偶极子阵的低副瓣方向图优化综合

本文利用新的非线性最优化方法讨论圆柱面上的轴向偶极子阵的低副瓣方向图优化综合问题，利用阵列的单元可实现增益方向图，我们把阵列综合问题表述为一个约束非线性规划问题，采用新直接法求解该问题即可得出一组使阵列的总方向图满足副瓣指标要求，同时具有尽可能高的方向性系数的激励系数，如果阵列的总方向图不能达到副瓣指标，则可得出一组使阵列方向图在可达到的副瓣方向图综合设计的模拟计算结果。     

基于投影矩阵法的阵列天线波束形成方法

该文介绍一种阵列天线波束形成的新算法投影矩阵法,包括复系数、仅相位、仅幅度的波束形成技术,并推广应用到多目标波束综合设计中。文中首先给出采用投影矩阵法进行阵列天线复系数和仅相位波束形成的计算方法,然后提出仅幅度控制下的投影矩阵法,并进一步应用到多目标波束同时优化设计中。该文计算了多种工程应用例子,特别是满足全口径和多子孔径波束优化的仅幅度控制技术、满足多波束优化的仅相位控制及共用幅度优化技术,对算例的设计达到了采用优化激励系数控制波束指向、波束赋形、旁瓣电平等性能要求,实现了阵列天线的波束形成。仿真结果说明了投影矩阵法的有效性,适用范围广泛。      

Sidelobe reduction in array-pattern synthesis using geneticalgorithm

A simple and flexible genetic algorithm (GA) for pattern synthesis of antenna array with arbitrary geometric configuration is presented. Unlike conventional GA using binary coding and binary crossover, this approach directly represents the array excitation weighting vectors as complex number chromosomes and uses decimal linear crossover without a crossover site. Compared with conventional GAs, this approach has a few advantages: giving a clearer and simpler representation of the problem, simplifying chromosome construction, and totally avoiding binary encoding and decoding so as to simplify software programming and to reduce CPU time. This method also allows us to impose constraints on phases and magnitudes of complex excitation coefficients for preferable implementation in practice using digital phase shifters and digital attenuators. Successful applications show that the approach can be used as a general tool for pattern synthesis of arbitrary arrays     

基于改进粒子群算法的共形阵列天线综合

共形阵列天线的赋形方向图综合涉及大量的运算,成为现在研究的一大难点,目前对共形阵方向图综合的研究比较少,且所用算法存在理论复杂、耗时长的缺点。文中运用改进粒子群算法对圆环阵、圆柱阵方向图的综合进行了研究,仿真结果表明,改进粒子群算法能够较快地形成期望方向图,证明了该方法的有效性和实用性。     

Adaptive beam weighting

The optimum adaptive steering of multibeam antennas is discussed, where a single beam is scanned or shaped by weighting and summing the antenna outputs. Classical principles and implementations are valid here. The most effective antenna system involves a set of orthogonal beams by means of which gain maximization, pattern synthesis, beam scanning, besides pattern null steering can be realized. A large weight dynamic range may be required for low sidelobe synthesis. A number of antennas fitting the desired type is cited. The feasibility of real weight instead of complex weight control is illustrated by means of a linear array fed by a Butler matrix.     

考虑互耦效应的六边形天线阵方向图综合

该文研究了一种综合正六边形阵列天线方向图的新方法。通过选择多个初始点来抑制非线性最小二乘法局部收敛的缺点,有效地实现了阵列天线的全局优化。根据阵列单元轴向对称分布的特点,通过计算部分单元获得整个阵列天线单元间的散射系数矩阵,降低了互耦的影响。计算结果说明阵列方向图在最小二乘意义上逼近了预先设定的目标方向图。     

基于改进型粒子群算法的阵列天线综合

粒子群优化(PSO)算法是一种通过粒子之间的合作与竞争来实现复杂多维空间的最优区域搜索的优化算法。本文中改进型PSO算法(NPSO),通过增加积分控制项改善了PSO算法全局搜索能力,并将该方法应用于多元环形阵列天线方向图的综合,实现了阵列方向图与预先给定的目标方向图的高度逼近。最后通过数值实例说明这种NPSO方法的有效性。     

一种阵列天线赋形波束综合方法

给出一种基于反离散傅里叶变换阵列天线赋形波束的综合算法,综合后的阵列天线波束形状与预给的波束形状吻合较好,从而达到设计要求。该方法具有计算速度快、计算量小、计算数值稳定性好的优点。是一种阵列天线波束赋形的实用方法。     

Model-based synthesis of shaped-beam patterns with the minimum number of elements: a state-space method

Conventional antenna array synthesis methods can give good performance for uniform spaced antenna arrays within desired performance bounds. However, due to the restriction of uniform antenna element spacing, a lot of elements are required. Because of the above-mentioned drawback, in this paper, a new approach is presented to synthesise uniform spaced antenna array using the minimum number of elements. This approach introduces the state-space model to represent the desired discrete array pattern that is sampled uniformly from ?1 to 1 corresponding to 0–180°, then uses the desired sampled array pattern directly to construct the forward–backward data matrix that is introduced to estimate the model parameters, from which the locations and excitations of the new antenna elements can be extracted. The appropriate roots that are located on the unit circle are selected to obtain new radiation pattern. Simulation results show the viability for both shaped-beam and pencil-beam designs.