# Design, Simulation, and Optimization of an Irregularly Shaped Microstrip Patch Antenna for Air-to-Ground Communications

Authors: L. A. R. Ramirez; J. C. A. Santos
Journal: International Journal of Antennas and Propagation
 (2017)

---

## Abstract

In this study an irregularly shaped microstrip patch antenna was designed, simulated, and optimized for air-to-ground communication (ATG) applications. The process started with the design of a rectangular patch antenna with the traditional transmission line and cavity methods, followed by a simulation with the finite-difference time-domain method (FDTD) in conjunction with a genetic algorithm (GA). The aim of the study was to design an efficient patch antenna. The designed antenna is resonating at 14.25 GHz with 35 dB return loss. The 10 dB bandwidth of the antenna is 3.7 GHz.


---

## Body

## 1. Introduction

The use of microstrip structures to radiate electromagnetic waves started in the 1950s [1]. The earliest form of planar antennas, integrated with planar transmission lines, was developed by Deschamps and Sichak [2]. Practical implementation started to increase in the 1970s when suitable substrate materials became available. The development of microstrip antennas in the 1970s and 1980s has been well documented by Bahl and Bhartia [3] and James and Hall [4], and later several good books were published on this subject [5–16].A microstrip patch antenna in its simplest configuration consists of a radiating patch on one side of a dielectric substrate and a ground plane on the other side. With regard to the shape, microstrip antenna patches can be regular or irregular. Typical regular shapes are rectangular, square, circular, elliptic, and triangular, among others. These shapes have been widely studied and the design procedures are well established. They are used as conformal antennas for airplanes, cars, missiles, portable devices and many other applications. Regularly shaped antennas are more common, mainly because they are easy to analyze and usually present a symmetric radiation pattern. The irregularly shaped patch antenna refers to a microstrip antenna whose patch geometry is designed to fulfill a specific antenna property such as compactness, wideband characteristics, and multiresonant operation. Examples include H-Shape, E-Shape, and L-Shape, as well as combinations of these antennas [3–16]. In the past few years, patch antennas with nonintuitive and novel shapes have appeared. The radiating patch is modified through an optimization process, aimed at improving its specific properties, in particular increasing the bandwidth [17–22].In [17], Michael Johnson and Rahmat-Samii described the technique of combining GA optimization with method of moments for broadband patch antenna design. Their study included the optimization of a simple patch antenna to produce a wider operational bandwidth than classical designs. Specifically, the goal was to produce an irregularly shaped patch antenna with a voltage standing wave ratio (VSWR) of 2 : 1 over 20% bandwidth centered at 3 GHz. The GA optimized the subpatch by removing the square metal sections from the patch region. Choo et al. [18] designed a broadband patch antenna using an approach similar to that described in [17]. They began with a metal patch, in which subpatches were represented by Boolean subpatches, either ones (metal) or zeros (nonmetal). The goal was to broaden the bandwidth of a microstrip antenna around the center frequency of 2 GHz by changing the patch shape. Chapter 32 of a handbook published by Balanis [19] presents an overview of antenna optimization using GA and provides some cases of use and a selected bibliography. In [20], Griffiths et al. report the use of GA for the generation of compact antennas (broadband and multiband), where the patch is modified using ellipses to create new forms, with higher bandwidth and return loss. In [21], a semiautomatic antenna design method is proposed to design a multiband monopole antenna. In the antenna optimization, particle swarm optimization (PSO) was used, with a new technique of grid patch generation, and good simulation and measurement results were obtained. In [22], Modiri and Kiasaleh used the binary particle swarm optimization (BPSO) algorithm to design several irregularly shaped microstrip antennas, the main focus being the frequency selectivity of a software-defined radio (SDR).As in [17–22], an irregularly shaped microstrip antenna is the object of this study; however, here it will be applied to air-to-ground (ATG or A2G) communication.Ground-to-ground radio communication is a common application of mobile wireless networks. ATG communication has received increased attention recently [23]. It is used for communication between aircraft and stations on the ground or on water. Line-of-sight (LOS) conditions are usually established. Internet service providers also use ATG to connect planes to the Internet, which has significant limitations in terms of the speed and latency of the connection (on-board WiFi allows no video streaming and no fast browsing, phone calls are of poor quality, etc.). ATG systems are less expensive than satellite-based systems and, thus, services can be provided to passengers at lower cost [23]. Also, this technology will enable a much larger set of applications due to the lower latency and cost per bit. Interest is enhanced by the fact that several companies (e.g., Alcatel and Nokia) currently provide 4G services using air-to-ground LTE [24]. This technology has also become of interest for unmanned aerial vehicles (UAVs), commonly known as a drones, for military, agriculture, and surveillance applications [25].In this paper, we report the design of a microstrip patch antenna for the ATG frequency band, starting from the classical rectangle microstrip antenna with an inset-fed line to obtain an improved antenna. In this study, the finite-difference time-domain numerical method FDTD-3D is combined with a genetic algorithm (GA) to optimize the bandwidth and return loss of the antenna. The full wave FDTD-3D method is described in Section2. Section 3 presents the GA. The design of the antenna is described in Section 4, and the numerical results are reported in Section 5. Finally, Section 6 provides the conclusions.


## 2. Finite Differences in Time Domain

In the finite-difference time-domain method, Maxwell equations in a differential form are transformed into discrete finite-difference equations. This results in a fully explicit system of difference equations, whereby chronological values of the electric and magnetic field components are obtained in a leap-frog manner; that is, the electric field is solved at a given instant of time and the magnetic field is solved at the next time instant. The process is cyclically repeated. Spatially, the calculation of the electric and magnetic field components is dependent only on the neighbors in each case.For the FDTD-3D case, the computational domain is divided into small cells (Figure1(a)). The components E⃑ and H⃑ are distributed in space, with the components E⃑ positioned on the edges and components H⃑ distributed at the center of the faces of the cells (Figure 1(b)) [26].Figure 1
FDTD (a) grid and (b) field components in a unitary cell.
(a)
FDTD mesh or computational grid
(b)
FDTD unitary cellWith this field distribution, with two adjacent cubes connected by a vertex, each field component ofE⃑ is surrounded by four components of H⃑, and similarly each component of H⃑ is surrounded by four components of E⃑, which can be seen in detail in Figure 2.Figure 2
Fields components ofE⃑ and H⃑ in two adjacent unitary cells.In linear, homogeneous, isotropic, and free source media, Maxwell equations can be written as(1)∇×E⃑=-μ∂H⃑∂t,∇×H⃑=σE⃑+ε∂E⃑∂t.The spatial and temporal derivatives in (1) are written in a discrete form using a central difference scheme.The choice of cell size is critical in applying the FDTD method. It must be small enough to permit accurate calculations at the highest frequencies of interest and yet be large enough to ensure that the computational resources are manageable. The cell size is directly affected by the objects in the mesh. Once the cell size is chosen, the maximum time step is determined by satisfying the Courant stability criterion(2)Δt≤1vmax1/Δxmin2+1/Δymin2+1/Δzmin2which enforces the property that an incident waveform cannot pass through more than one cell during one time step. This is because during one time step the FDTD algorithm can only propagate across one cell to its nearest neighbor. In (2), vmax is the maximum speed of wave propagation in the model, Δx, Δy, and Δz are the space increments, and Δt is the time step [26].Together with the FDTD method, the uniaxial perfectly matched layer (UPML) [26, 27] was used. This is an absorbent boundary condition, used to simulate the propagation of waves in free space outside the computational domain, such as an anechoic chamber. Figure 3 illustrates the UPML with an FDTD grid.Figure 3
UPML layers around the FDTD mesh with (a) all layers and (b) removed frontal layers. The FDTD mesh is highlighted.
(a)
(b)


## 3. Genetic Algorithm

A genetic algorithm (GA) is an optimization technique that can handle the common characteristics of electromagnetic fields. It is an iterative optimization procedure and it maintains a population of probable solutions (chromosomes) within a search space (which is usually discrete) over many simulated generations.The basic principles of GA were inspired by the mechanism of natural selection of Darwin and genetic laws, where stronger individuals are likely to be winners (the fittest) in a competing environment and present better characteristics for adaptation [28]. GA assumes that the potential solution of any problem is an individual from a population. Any chromosome can be represented by a set of parameters. These parameters are regarded as the genes and can be structured by a string of values (alleles) in binary form or real values. In a computer algorithm, genes represent the basic building blocks of a genetic algorithm. Figure 4 shows a sample of a binary chromosome and three of its components.Figure 4
Sample of a binary chromosome.A chromosome (or individual) is an array of genes, and a group of chromosomes is known as a population (see the following).Matrix representation of components of a genetic algorithm, adapted from [28], is as follows: (3)population=chrom1chrom2chrom3chrom4︸chromosomes=g11g12g1Mg21g22⋮⋱⋮gN1⋯gNM︸genes.Each gene of a chromosome will represent a property of the patch antenna and all genes belonging to a chromosome will represent an antenna configuration. At each iteration (or generation) three basic genetic operations (“selection,” “crossover,” and “mutation”) are performed. The initial population is a randomly generated chromosome satisfying boundary or system constraints to the known configuration that needs to be optimized. A good choice of the population size optimizes the convergence of the simulation.During each generation, the chromosomes are evaluated, using an associated cost function, and this gives some measurements for the fitness or relative merit. A new generation is formed by selection, according to the fitness values, to create the next generation of individuals from the previous population. These individuals are called parents while those created by applying evolutionary operators to the parents are referred to as offspring. These new chromosomes (offspring) can be formed using several techniques, for instance, by either merging two chromosomes from the current generation using a crossover operator or modifying a chromosome using a mutation operator. In this process, some of the parents and offspring are chosen while others are rejected, so as to keep the population size constant. Fitter chromosomes have a higher probability of being selected. After several generations, the algorithms converge to the best chromosome, which is expected to represent the optimum or suboptimal solution to the problem. Figure5 shows a flowchart of the GA used.Figure 5
Flowchart of the basic genetic algorithm.


## 4. Microstrip Antenna Design

### 4.1. Antenna Design

The first step in the design of the proposed antenna was the dimensioning of a classical rectangular patch antenna through the transmission line and resonant cavity methods [29]. The antenna is shown in Figure 6. The frequency of resonance was chosen in accordance with air-to-ground technology. Input data were center frequency (f0) at 14.25 GHz and frequency band range of 13.25 to 15.25 GHz. The three metal components (ground plane, antenna patch, and feed line) have a conductivity of 5.8 × 107 S/m (for copper clad substrates). The substrate RT/duroid 5880 was used, which has a relative permittivity of 2.20. Additional parameters are given in Table 1. The origin of the coordinate system was set at the center of the ground plane, at zero height on the base.Table 1
Characteristics of microstrip inset patch antenna.
Component
Width (mm)
Length (mm)
Thickness (mm)
Ground plane (copper)
16.8
24.5
0.5
Patch (copper)
8.0
10.0
0.5
Substrate (duroid 5880)
16.6
28.5
3.5
Feed line (copper)
1.5
17.0
0.5Figure 6
Microstrip antenna with inset (unscaled).


### 4.2. FDTD Considerations

The FDTD method works in the time domain. Thus, the use of signals with variant spectrum is recommended. There are three approaches to this method: total field/scattered field formulation; additive source; and hard-source. Since the energy is introduced into the space-time lattice, the hard-source solution was used. This is incorporated into the FDTD code by specifying the electric field value at a specific location by a time function (typically Gaussian or a Gaussian derivative), which takes advantage of the wideband nature of the problem. In this study, Morlet’s wavelet function was used. The driving field is given by(4)Ezt=E0exp⁡-2πfbt-t02cos⁡2πfct-t0with E0=12 V/m, t0=375 ps, fc=14.25 GHz, and fb=2000 MHz, where E0 is the signal amplitude, t0 is the time at which the pulse reaches its maximum value, fc is the center frequency, and t represents the propagation time signal with 0≤t≤8000Δt, where Δt=0.0342 ns is the time step. This signal is shown in Figure 7. The spatial steps Δx=0.234 mm, Δy=0.21 mm, and Δz=0.11 mm were used. A mesh is generated by dividing the computational domain into 72 × 113 × 39 tiny cells. The time step is calculated according to Courant criterion (see (2)). 8000 iterations were necessary to address the steady-state, rendering approximately 9 minutes of computer time.Figure 7
Signal excitation in time and frequency domains.


### 4.3. Validation

The software implemented was verified by comparing the results for a common microstrip inset patch antenna with those obtained from the commercial software package CST-MWS®. The magnitudes ofS11 for both packages are shown in Figure 8. The nature of the variation of S11 obtained with FDTD follows closely that obtained by CST-MWS.Figure 8
Simulated results for the return loss of a rectangular patch antenna with CST and the developed simulator.


### 4.4. GA Considerations

For the optimization process, all elements of the initial population refer to a standard rectangular patch antenna with inset (Figure6). The corresponding resonant patch is divided into a binary matrix of 17 × 17 subpatches (see sample in Figure 9). The subpatches correspond to the intrinsic representation of the problem. This indicates the presence (set as 1) or the absence (set as 0) of copper in a candidate solution (chromosome). The idea is that, in the random generation of the initial population, the subpatches to be generated have behavior similar to that of the passive resonating elements. Considering that both the FDTD and GA are time-consuming processes, various chromosome sizes were tested. A digital individual with 289 elements showed a good balance between accuracy and computational burden.Figure 9
Patch antenna configuration in the evolutionary process.Each chromosome is composed of 289 alleles. Within the program a one-dimensional binary array represents the irregular patch antenna. Each subpatch is an exact multiple of the size of the corresponding dimensional step in order to create a second 17 × 17 mesh of subpatches. The latter is stored in a two-dimensional array. The corresponding conversion from vector to matrix and vice versa is done through a subroutine.The initial size of the population was set at 70 chromosomes (all different). This number should be sufficient to ensure the generation of good parents (i.e., with sufficient diversity to ensure that some chromosomes have the desired characteristics). For the evaluation of each population, the time consumed was 10.5 hours on a PC with i7 processor, 12 GB of RAM, and Nvidia© GeFORCE GT 610 Graphics Accelerator, with 2 GB DDR3/ 64 bits.Another consideration is related to the fitness function used to evaluate if the individual is a good solution. Each chromosome in a population has a fitness value associated with it and the chromosomes are ranked from best to worst based on this value. This function is considered to be the most important part of the algorithm, because its success is dependent on how well the fitness function evaluates each solution in relation to the overall objectives of the optimization problem. The fitness function is related to the bandwidth and the return loss (see (5)). The two optimization objectives functions were combined to form a single overall fitness function.In (5), α is a weighting factor in the range [0,1]. This parameter allows us to choose the emphasis or preference of one parameter with respect to another. The fitness function related to bandwidth is set to a minimum bandwidth of 2.0 GHz, as in the study described in [30], and the related return loss value is better than 20 dB, as reported in [31].(5)fit=αfitBW+1-αfitPR.For the application of the basic genetic operators, that is, selection, crossover, and mutation, the specific bit operator roulette wheel, single point crossover, and elitism, were used. In the roulette wheel, each member of the new population is selected in a random way from the elements of the previous population, where the probability of selecting a member from the previous population is proportional to its fitness value. Crossover involves creating two “offspring” chromosomes from the complementary part of two “parent” chromosomes. A random point is chosen, the two parents are then divided, and in the left side the first parent becomes the left side of second parent and vice versa. A crossover probability controls the frequency of the operator, which was fixed at 0.8. In the mutation process, the operator mutation randomly flips some of the bits in a chromosome. Mutation probability was fixed at 0.05, changing the offspring properties. Crossover and mutation are important operators that are responsible for improving the diversity.Elitism is the process of retaining or inserting the best individual into the next generation from the current generation. This is performed to avoid the loss of the best individual in any population during the crossover and mutation operations. Thus, using these operators, good candidates are retained while others are discarded in such a way that the population size remains constant.


## 4.1. Antenna Design

The first step in the design of the proposed antenna was the dimensioning of a classical rectangular patch antenna through the transmission line and resonant cavity methods [29]. The antenna is shown in Figure 6. The frequency of resonance was chosen in accordance with air-to-ground technology. Input data were center frequency (f0) at 14.25 GHz and frequency band range of 13.25 to 15.25 GHz. The three metal components (ground plane, antenna patch, and feed line) have a conductivity of 5.8 × 107 S/m (for copper clad substrates). The substrate RT/duroid 5880 was used, which has a relative permittivity of 2.20. Additional parameters are given in Table 1. The origin of the coordinate system was set at the center of the ground plane, at zero height on the base.Table 1
Characteristics of microstrip inset patch antenna.
Component
Width (mm)
Length (mm)
Thickness (mm)
Ground plane (copper)
16.8
24.5
0.5
Patch (copper)
8.0
10.0
0.5
Substrate (duroid 5880)
16.6
28.5
3.5
Feed line (copper)
1.5
17.0
0.5Figure 6
Microstrip antenna with inset (unscaled).


## 4.2. FDTD Considerations

The FDTD method works in the time domain. Thus, the use of signals with variant spectrum is recommended. There are three approaches to this method: total field/scattered field formulation; additive source; and hard-source. Since the energy is introduced into the space-time lattice, the hard-source solution was used. This is incorporated into the FDTD code by specifying the electric field value at a specific location by a time function (typically Gaussian or a Gaussian derivative), which takes advantage of the wideband nature of the problem. In this study, Morlet’s wavelet function was used. The driving field is given by(4)Ezt=E0exp⁡-2πfbt-t02cos⁡2πfct-t0with E0=12 V/m, t0=375 ps, fc=14.25 GHz, and fb=2000 MHz, where E0 is the signal amplitude, t0 is the time at which the pulse reaches its maximum value, fc is the center frequency, and t represents the propagation time signal with 0≤t≤8000Δt, where Δt=0.0342 ns is the time step. This signal is shown in Figure 7. The spatial steps Δx=0.234 mm, Δy=0.21 mm, and Δz=0.11 mm were used. A mesh is generated by dividing the computational domain into 72 × 113 × 39 tiny cells. The time step is calculated according to Courant criterion (see (2)). 8000 iterations were necessary to address the steady-state, rendering approximately 9 minutes of computer time.Figure 7
Signal excitation in time and frequency domains.


## 4.3. Validation

The software implemented was verified by comparing the results for a common microstrip inset patch antenna with those obtained from the commercial software package CST-MWS®. The magnitudes ofS11 for both packages are shown in Figure 8. The nature of the variation of S11 obtained with FDTD follows closely that obtained by CST-MWS.Figure 8
Simulated results for the return loss of a rectangular patch antenna with CST and the developed simulator.


## 4.4. GA Considerations

For the optimization process, all elements of the initial population refer to a standard rectangular patch antenna with inset (Figure6). The corresponding resonant patch is divided into a binary matrix of 17 × 17 subpatches (see sample in Figure 9). The subpatches correspond to the intrinsic representation of the problem. This indicates the presence (set as 1) or the absence (set as 0) of copper in a candidate solution (chromosome). The idea is that, in the random generation of the initial population, the subpatches to be generated have behavior similar to that of the passive resonating elements. Considering that both the FDTD and GA are time-consuming processes, various chromosome sizes were tested. A digital individual with 289 elements showed a good balance between accuracy and computational burden.Figure 9
Patch antenna configuration in the evolutionary process.Each chromosome is composed of 289 alleles. Within the program a one-dimensional binary array represents the irregular patch antenna. Each subpatch is an exact multiple of the size of the corresponding dimensional step in order to create a second 17 × 17 mesh of subpatches. The latter is stored in a two-dimensional array. The corresponding conversion from vector to matrix and vice versa is done through a subroutine.The initial size of the population was set at 70 chromosomes (all different). This number should be sufficient to ensure the generation of good parents (i.e., with sufficient diversity to ensure that some chromosomes have the desired characteristics). For the evaluation of each population, the time consumed was 10.5 hours on a PC with i7 processor, 12 GB of RAM, and Nvidia© GeFORCE GT 610 Graphics Accelerator, with 2 GB DDR3/ 64 bits.Another consideration is related to the fitness function used to evaluate if the individual is a good solution. Each chromosome in a population has a fitness value associated with it and the chromosomes are ranked from best to worst based on this value. This function is considered to be the most important part of the algorithm, because its success is dependent on how well the fitness function evaluates each solution in relation to the overall objectives of the optimization problem. The fitness function is related to the bandwidth and the return loss (see (5)). The two optimization objectives functions were combined to form a single overall fitness function.In (5), α is a weighting factor in the range [0,1]. This parameter allows us to choose the emphasis or preference of one parameter with respect to another. The fitness function related to bandwidth is set to a minimum bandwidth of 2.0 GHz, as in the study described in [30], and the related return loss value is better than 20 dB, as reported in [31].(5)fit=αfitBW+1-αfitPR.For the application of the basic genetic operators, that is, selection, crossover, and mutation, the specific bit operator roulette wheel, single point crossover, and elitism, were used. In the roulette wheel, each member of the new population is selected in a random way from the elements of the previous population, where the probability of selecting a member from the previous population is proportional to its fitness value. Crossover involves creating two “offspring” chromosomes from the complementary part of two “parent” chromosomes. A random point is chosen, the two parents are then divided, and in the left side the first parent becomes the left side of second parent and vice versa. A crossover probability controls the frequency of the operator, which was fixed at 0.8. In the mutation process, the operator mutation randomly flips some of the bits in a chromosome. Mutation probability was fixed at 0.05, changing the offspring properties. Crossover and mutation are important operators that are responsible for improving the diversity.Elitism is the process of retaining or inserting the best individual into the next generation from the current generation. This is performed to avoid the loss of the best individual in any population during the crossover and mutation operations. Thus, using these operators, good candidates are retained while others are discarded in such a way that the population size remains constant.


## 5. Results

Figure10 shows snapshots of the iterative evolutionary process, together with their respective S11 graphs (dB). Wideband and high return loss were the optimization criteria. Figures 10(a) and 10(b) show two instants in the evolutionary process in which the corresponding chromosomes have distinct characteristics. Figure 10(a) shows a return loss of the order of 26 dB and a poor bandwidth of 1 GHz, while Figure 10(b) shows a poor return loss but frequency response with a wideband behavior. These two chromosomes are the arguments in the crossover process that will generate the next individuals. The antennas in Figures 10(c) and 10(d) were the best solutions. In Figure 10(c) the peak value for the return loss is 27.04 dB, with a 10 dB bandwidth of 6 GHz. In Figure 10(d), the values for the return loss are around 35 dB, with a 10 dB bandwidth of 3.7 GHz, and better return loss is observed in the middle frequencies.Figure 10
Some snapshots from the evolutionary optimization process.
(a)
(b)
(c)
(d)For the antenna of Figure10(d), the corresponding radiation patterns are presented in Figure 11, at 13 GHz, 14.25 GHz, and 15 GHz, corresponding to the columns of the figure. This antenna presents 15 dB minimum return loss at ATG frequency range. TheXY plane (azimuth) responses are shown in Figures 11(a), 11(b), and 11(c); theXZ plane responses are shown in Figures 11(d), 11(e), and 11(f); and theYZ plane responses are shown in Figures 11(g), 11(h), and 11(i).Figure 11
Radiation patterns of the antenna of Figure10(d) for 13, 14.25, and 15 GHz.
(a)
(b)
(c)
(d)
(e)
(f)
(g)
(h)
(i)


## 6. Conclusions

In this study, a compact irregularly shaped microstrip patch antenna for use in ATG devices was designed. Excellent return loss and bandwidth values were obtained, with 10 dB bandwidths up to 6 GHz, and peak return loss of around 27 dB. The best antenna showed 15 dB minimum return loss over the full ATG frequency band. The finite-difference time-domain method (FDTD) was used in conjunction with a genetic algorithm. The proposed methodology can be applied to the design of other microstrip antennas. This is currently under investigation.



---

*Source: 5156263-2017-03-28.xml*