Synthesis of planar continuous current sources with arbitrary shapes for generation of desired radiation patterns by methods of moments and least squares

Abstract

Synthesis of planar continuous current sources (planar CCSs) with arbitrary shapes is developed for the generation of specified radiation patterns by method of moments (MoM) and method of least squares (MLS). First, an integral equation is expressed, which relates planar CCS current distribution to its radiation pattern. Second, the planar CCS region is divided into several segments and its current distribution is expressed in terms of the pulse expansion functions to discretise the integral equation. Third, the resulting discretised integral equation is converted to a linear equations system by MoM and MLS. Fourth, the resulting linear equations system is solved to determine unknown coefficients of planar CCS current distribution. To evaluate and compare the efficacy of proposed methods, two parameters of synthesis error (SE) and superdirectivity ratio (SR) are used. It is shown that the number of segments should be properly determined to achieve specified SE and SR. If resulting radiation pattern does not meet design goal, a perturbation procedure is applied to current distribution in order to improve the characteristics of radiation patterns of the planar CCS, such as side‐lobe level and pattern ripple. Several examples are given to validate the efficacy of the proposed methods.

Antenna Array Arbitrary Pattern Synthesis Using Conditional Generative Adversarial Network

“…This involves performing a gradient update on the discriminator and a separate update on the generator. It is important to highlight that two different types of discriminators are utilized in this research, as illustrated in Figures (16)…”

“…In [7][8][9][10] analytical methods for arrayfactor synthesis have been proposed, conventional optimization algorithms have been used in [11,12], and global optimization techniques such as genetic algorithms and PSO algorithms have been employed in pattern synthesis problems in [13][14][15]. Adaptive algorithms employing the Least Mean Squares (LMS) technique have been documented in a study by [16]. Iterative algorithms like iterative FFT, known for their effectiveness and simplicity in array factor synthesis, were proposed in [17][18][19].…”

Rectangular Grid Antennas With Various Boundary Square-Rings Array

“…In the array pattern optimization with some desired constraints such as low sidelobe level, narrow beam width, and controlled nulls, many of the design parameters could be saved by choosing their values non-adaptive [7][8][9][10]. Other techniques include the use of thinning process especially for the large planar arrays where the optimization processes are slow and difficult [11][12][13][14][15][16]. To overcome such problems, many researchers suggested using analytical methods rather than complex optimization based-iterative methods [17][18][19].…”

Sidelobe Suppression in Array-Pattern Synthesis Using Periodic Leaky-Wave Antenna and Binomial Array

“…We used the binomial method because it gives a good performance with a minimum sidelobe level than the others [6]. Other methods such as in [7][8][9], using the Real Coded Genetic Algorithm (RCGA), result in a larger array size than the original, which may be considered a drawback. To reduce the sidelobe level of the array antenna, we must take into account scan direction, beam width, and type of antenna element used.…”