Robust mask-constrained linear array synthesis throughan interval-basedparticleSWARMoptimisation

نویسندگان

  • Luca Manica
  • Nicola Anselmi
  • Paolo Rocca
  • Andrea Massa
چکیده

An innovative strategy for the robust design of linear antenna arrays is presented. Being the array elements characterised by tolerance errors, the synthesis is aimed at determining the intervals of values fitting the user-defined mask constraints on the radiated power pattern. With reference to the upper and lower bounds of the power pattern analytically determined for given tolerances through interval analysis, the nominal excitations of the array elements are then optimised by means of a global stochastic optimiser suitably customised to deal with interval numbers. A set of numerical examples is reported to show the behaviour of the proposed method as well as to assess its potentials in dealing with the robust synthesis of pencil and shaped beams.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Synthesis of Optimal Narrow Beam Low Sidelobe Linear Array with Constrained Length

The synthesis of optimal narrow beam low sidelobe linear array is addressed. Only the length of the array is constrained. The number, the positions and the weightings of the elements are left free. It is proven, that the optimal design is always an array with a small number of elements. One first demonstrates that among equally spaced linear arrays of given length, the sparsest Dolph-Chebyshev ...

متن کامل

ROBUST RESOURCE-CONSTRAINED PROJECT SCHEDULING WITH UNCERTAIN-BUT-BOUNDED ACTIVITY DURATIONS AND CASH FLOWS I. A NEW SAMPLING-BASED HYBRID PRIMARY-SECONDARY CRITERIA APPROACH

This paper, we presents a new primary-secondary-criteria scheduling model for resource-constrained project scheduling problem (RCPSP) with uncertain activity durations (UD) and cash flows (UC). The RCPSP-UD-UC approach producing a “robust” resource-feasible schedule immunized against uncertainties in the activity durations and which is on the sampling-based scenarios may be evaluated from a cos...

متن کامل

Derivative Constrained Robust Lcmv Beamforming Algorithm

A class of linear derivative constraints, which provides robustness to the conventional narrowband uniform linear array configuration so as to handle broadband and moving jammer sources problem is presented. The robust modification of linear constrained minimum variance (LCMV) algorithm is given to broaden the null widths in the jammer directions. Numerical results show that the proposed algori...

متن کامل

Digitally Excited Reconfigurable Linear Antenna Array Using Swarm Optimization Algorithms

This paper describes the synthesis of digitally excited pencil/flat top dual beams simultaneously in a linear antenna array constructed of isotropic elements. The objective is to generate a pencil/flat top beam pair using the excitations generated by the evolutionary algorithms. Both the beams share common variable discrete amplitude excitations and differ in variable discrete phase excitations...

متن کامل

Robust Mask-layout and Process Synthesis in Micro-Electro-Mechanical-Systems (MEMS) Using Genetic Algorithms

This thesis reports a Genetic Algorithm approach for the mask-layout and process flow synthesis problem. For a given desired target shape, an optimal mask-layout and process flow can be automatically generated using the Genetic Algorithm synthesis approach. The Genetic Algorithm manipulates and evolves a population of candidate solutions (mask-layouts and process parameters) by utilizing a proc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013