A general procedure to solve efficiently non convex array synthesis problems is presented. It
is based on the SemiDefinite Relaxation (SDR) technique. The way to properly relax the …

The purpose of the research is the application of parallel computations when solving the
problems of estimating the characteristics on the subject is complex within the framework of …

In this article, a novel multibranch encoder-decoder-based artificial neural network (ANN)
framework is proposed for pattern-reconfigurable nonuniformly spaced linear array …

Previously, the matrix pencil method (MPM) and the forward-backward MPM (FBMPM) were
used to effectively reduce the number of antenna elements in the single-pattern linear …

In this paper, the authors present an optimization method based on modified Particle Swarm
Optimization (PSO) algorithm for thinning large multiple concentric circular ring arrays of …

Reconfigurable antenna arrays are often capable of radiating multiple patterns by modifying
the excitation phases of the elements. In this paper a method based on Firefly Algorithm (FA) …

In this paper, we propose an optimization method based on real-coded genetic algorithm
(GA) with elitist strategy for thinning a large linear array of uniformly excited isotropic …

The problem of synthesizing array patterns while reducing dynamic range ratio (DRR) of
complex excitations is of great importance in practical applications since it enables active …

We present an effective approach to the optimal mask-constrained power pattern synthesis
of uniformly spaced array antennas able to dynamically reconfigure their radiation pattern by …

This paper presents a bacterial foraging algorithm (BFA) for null steering of linear antenna
arrays by controlling only the element amplitudes. The BFA is a new evolutionary computing …