# Antenna Optimization Design Based on Deep Gaussian Process Model

Authors: Xin-Yu Zhang; Yu-Bo Tian; Xie Zheng
Journal: International Journal of Antennas and Propagation
 (2020)

---

## Abstract

When using Gaussian process (GP) machine learning as a surrogate model combined with the global optimization method for rapid optimization design of electromagnetic problems, a large number of covariance calculations are required, resulting in a calculation volume which is cube of the number of samples and low efficiency. In order to solve this problem, this study constructs a deep GP (DGP) model by using the structural form of convolutional neural network (CNN) and combining it with GP. In this network, GP is used to replace the fully connected layer of the CNN, the convolutional layer and the pooling layer of the CNN are used to reduce the dimension of the input parameters and GP is used to predict output, while particle swarm optimization (PSO) is used algorithm to optimize network structure parameters. The modeling method proposed in this paper can compress the dimensions of the problem to reduce the demand of training samples and effectively improve the modeling efficiency while ensuring the modeling accuracy. In our study, we used the proposed modeling method to optimize the design of a multiband microstrip antenna (MSA) for mobile terminals and obtained good optimization results. The optimized antenna can work in the frequency range of 0.69–0.96 GHz and 1.7–2.76 GHz, covering the wireless LTE 700, GSM 850, GSM 900, DCS 1800, PCS1900, UMTS 2100, LTE 2300, and LTE 2500 frequency bands. It is shown that the DGP network model proposed in this paper can replace the electromagnetic simulation software in the optimization process, so as to reduce the time required for optimization while ensuring the design accuracy.


---

## Body

## 1. Introduction

At present, solving most of the problems concerning antennas relies on full-wave electromagnetic simulation software. However, using electromagnetic simulation software to analyze the antenna is not only complicated but also computationally expensive [1]. Therefore, many literatures have proposed that artificial neural networks (ANNs) [2], support vector machine (SVMs) [3], and Gaussian process (GP) [4, 5] can be used to analyze antenna problems. ANN can implement parallel processing, self-learning, and nonlinear mapping, but its structure is relatively complicated, which requires a large amount of electromagnetic simulation data, and it is difficult to determine with poor generalization ability [6]. SVM has many unique advantages in solving small samples and nonlinear problems [7] and also has many disadvantages such as difficult selection of kernel parameters, easy overfitting, and prediction output without probabilistic significance [8]. As the machine learning (ML) method has developed rapidly in recent decades, GP has a good adaptability to deal with complex problems such as high dimensions, small samples, and nonlinearities, which is also easier to implement than SVM and ANN. Otherwise, its hyperparameters can be obtained adaptively, and its predicted output value is also of probability significance [9]. Therefore, the GP model can be used as a fast surrogate to obtain accurate full-wave analysis in antenna design, which can greatly reduce the time required for accurate simulation in antenna design while ensuring model accuracy [10]. However, for the GP modeling method, the biggest limitation is that it has relatively high requirements on training data. Therefore, it often uses high-accuracy discrete data sets to ensure that the model has sufficient prediction accuracy. Meanwhile, for calculation with the same amount of training data, GP requires more time [11].Convolutional neural network (CNN) is a type of feedforward neural network (FNN) that includes convolution calculations and has a deep structure, and it is also one of the representative algorithms of deep learning (DL). In DL, CNN can be understood as a deep neural network (DNN) that can reduce the dimension of data [12] while retaining the value of data, which is widely used in computer vision [13] and natural language processing [14], for its convolutional layer can perform feature extraction on the data and the data passed to the pooling layer can also be used to perform feature selection and information filtering on the data. In the entire CNN, fully connected layers can be regarded as a “classifier.” If we say that the convolutional layer, pooling layer, and activation function are used to map the original data to the feature space of hidden layer, then the fully connected layers can map the “distributed feature representation” learned by the CNN network to the sample label space, which is consistent with the ability of the GP to map nonlinear complex problems to high-dimensional space. However, since the traditional GP requires a large number of covariance calculations, the training efficiency of GP model will be very low once there is a large input data dimension. However, the CNN’s convolutional layer and pooling layer can reduce the dimensions of the data while retaining the feature value of the data. Based on the above situation, a deep GP (DGP) network modeling method combining CNN and GP models is proposed. Simultaneously, particle swarm optimization (PSO) algorithm is used to optimize the parameters of the DGP network model when training the model. Considering the current research situation, the application of PSO algorithm to optimize CNN and GP has been very mature [15, 16]. Comparing with the traditional error backpropagation (BP) optimization of CNN, PSO is very flexible in optimizing model parameters [17]. Therefore, PSO is selected to optimize the DGP model in this study, while the mean-squared error of the difference value between the prediction output of the model and the training output is used as the fitness function of PSO. In this paper, we applied the proposed DGP model to the design of a multiband antenna [18] for the mobile terminal and obtained good optimization results.


## 2. Deep Gaussian Process Network Model

### 2.1. Convolutional Neural Network

The basic structure of CNN consists of input layers, convolutional layers, pooling layers, fully connected layers, and output layers, among which the convolutional layers and the pooling layers usually have multiple layers according to the actual problem. The traditional CNN is composed of forward pass and back propagation, so BP is used to optimize the parameters of the NN and train the NN. We use PSO to optimize the parameters. Figure1 is a schematic diagram of the structure of the convolutional layer and the pooling layer in the one-dimensional CNN. In this figure, the top layer is the pooling layer, the middle layer is the convolutional layer, and the bottom layer is the input layer of the convolutional layer. The neurons in the convolutional layer constitute each feature surface, and each neuron is connected to the local region of the feature surface of the next layer through a set of convolution kernel. Then, the local weight value is calculated and transferred to a nonlinear activation function. In addition, the weight values of the same feature surface are shared. The parameters and complexity of the model can be reduced by weight value sharing and local connection, making the network easier to train. In order to combine with the GP, we use PSO to optimize the parameters. Therefore, we need to find out the number of parameters that need to be optimized and sort out their positions in the CNN.Figure 1
Schematic diagram of convolutional layer and pooling layer.Take Figure1 as an example. The feature surfaces are connected by a 1 × 3 convolution kernel. If we want to use an equation to represent the connection weight value of the ith neuron on the input feature surface m and the jth neuron on the output feature surface n, the following weight value sharing equation can be obtained: ωminj. An input feature surface can be mapped to the corresponding output feature surface through the translation of a convolution kernel of a fixed size, the convolution operation is performed with all neurons on the input feature surface, and then it can be mapped after weighting and activation. Because of the property of translation convolution kernel, the weight values can be shared for adjacent neurons in the corresponding position, which actually use the same weight value in the convolution kernel. Through the convolution operation, the number of neurons in the feature surface of the convolutional layer or the size of the feature surface satisfies the following formula:(1)OutSize=InSize−CSizeCInterval+1,where OutSize represents the number of neurons on output feature surface, InSize represents the number of neurons on input feature surface, CSize is the size of the convolution kernel, and CInterval represents the sliding translation step size of the convolution kernel. The number of parameters that can be trained by the convolutional layer is as follows [19]:(2)CPN=InSize×CSize+1×OutSize,where CPN is the number of training parameters and 1 is the number of thresholds, usually only one shared threshold is set for each layer. The activation function in CNN generally uses sigmoid function, tanh function, etc.The pooling layer is generally constructed on the next layer of the convolutional layer. It also consists of multiple feature surfaces, each of which corresponds to the unique feature surface of the previous layer. The feature of the pooling layer is that it does not change the number of feature surfaces. The number of neurons on the output feature surface of the pooling layer is calculated as follows:(3)OutSize=InSizeDSize,where DSize is the size of the pooling kernel. The numerical output formula of any neuron on the output feature surface of the pooling layer is as follows:(4)ynkout=fxnpin,xnp+1in,where ynkout is the kth neuron of the nth output surface of the pooling layer, xnpin is the pth neuron of the nth input face, and f⋅ can be classified into average pooling and maximum pooling according to the different pooling methods. The parameters that need to be optimized are usually in the convolutional layer and the fully connected layer. In the pooling layer, we choose the largest pooling or average pooling, and there are no training parameters [20]. Finally, we replaced the fully connected layer of the traditional CNN with a GP model, so we will not discuss the parameters of the fully connected layer here.


### 2.2. Gaussian Process

The GP describes a functional distribution. It is a set of infinite random variables, and any subset of these variables conforms to the Gaussian distribution. Its properties can be determined by the average value functionux=EYx and the covariance function Cx,x′=EYx−uxYx′−ux′. So, the GP can be defined as follows:(5)fx∼GPux,Cx,x′,where x,x′∈X refers to any d-dimensional vector.Assume the finite data setD=xi,ti,i=1,…,n containing n observed values as the training sample of the Gaussian model, and the observed target value t is polluted by additive noise ε that follows the normal distribution. Then the model can be expressed as follows:(6)ti=fxi+εi,i=1,...,nRd⟶R,where xi∈X represents the d×n dimensional training input matrix composed of training input vectors; ti represents the training output vector composed of the corresponding n training output scalars; and ε refers to the random variable that follows the normal distribution, that is,(7)ε∼N0,σn2.Joint Gaussian prior distribution composed ofn training outputs t and n∗ testing output t∗ is as follows:(8)tt∗∼N0,CX,X+σn2ICX,x∗CX,x∗Cx∗,x∗,where CX,x∗ is the n×n∗ order covariance matrix between training input and testing input samples and Cx∗,x∗ is the covariance matrix of the testing input sample itself.On the premise that the testing pointx∗ and the training set d is given, the purpose of Bayesian prediction probability is to calculate the probability Pt∗|D,x∗. Based on Bayesian posterior probability formula, we can get(9)t∗|x∗,D∼Nut∗,σt∗2,where the expected value and variance of t∗ are as follows:(10)ut∗=Cx∗,XCX,X+σn2I−1t,(11)σt∗2=Cx∗,x∗−CTx∗,XC+σn2I−1Cx∗,X.The covariance function of the GP must meet the Mercer condition, that is, for any point set, a non-negative positive definite covariance matrix can be guaranteed. This study chooses the Ardmatern52 covariance function as the covariance function of the GP:(12)Cxi,xj|θ=σf21+5r+53r2exp−5r,where(13)r=∑m=1dxim−xjm2σm2.where σf2 is the signal variance. The properties of the average function and covariance function of the GP are determined by a set of hyperparameters, which is also the only parameter that needs to be determined for the GP [21].


### 2.3. Particle Swarm Optimization

We adopted PSO algorithm for optimization. PSO algorithm is easy to implement, simple, with less parameters, and can effectively solve the global optimization problems [22]. In the standard PSO algorithm, the particle swarm consists of particles, and the position of each particle is assumed to be a possible prepared solution to the problem in the dimensional search space. The particle updates its flight track based on its inertia, optimal position, and swarm optimal position.The basic idea of the PSO algorithm is to accelerate each particle to approach the best position of itself and the swarm. In the solution space, the starting position and speed of the particles will be randomly set. During the iterative search process, the algorithm will record the best positions experienced by individual particles and swarms and the corresponding fitness function values. The speed and position update formula of the particle swarm algorithm is as follows:(14)vi,dk+1=vi,dk+c1randpi,dk−xi,dk+c2randpg,dk−xi,dk,(15)xi,dk+1=xi,dk+vi,dk+1,where c1 and c2 refer to the learning factor and the acceleration constant; rand () is a random number between (0, 1); vi,dk and xi,dk refer to the d-dimensional speed and position of particle i in the kth iteration; pi,dk refers to the position of the individual extreme value of particle i in the dth dimension; and pg,dk refers to the position of the global extreme value of the swarm in the dth dimension. In this paper, we optimized the parameters of the proposed DGP model globally using the PSO algorithm in the training of the model, so that the prediction accuracy of the model after the training is completed can replace the traditional electromagnetic simulation software. After that, the PSO algorithm is used again to optimize the antenna based on the trained model.


### 2.4. The Proposed Deep Gaussian Process

The deep Gaussian process (DGP) network model is the combination of the CNN and the GP, which is shown in Figure2. The GP replaces the fully connected layer of the CNN, while retaining the input layer, output layer, convolutional layer, and pooling layer of the CNN. The convolutional layer is used to retain the feature quantity of the input data, the pooling layer is used to reduce the data dimension, and the GP is used to predict the output of the object. The overall structure of the model is evolved from LeNet-5 [23] (a common conventional structure of CNN). However, it is more flexible than LeNet-5 because its overall structure has been improved with two or more layers of convolutional layers and pooling layers. Otherwise, the specific number of layers can be set according to actual needs or multiple convolutions can be carried out according to the size of the data or the order of convolutions and pooling can be changed.Figure 2
Deep Gaussian process network structure.In the DGP network modeling method, the samples required for model training, that is, the training input and training output, can be obtained by the electromagnetic simulation software HFSS. In this paper, VBScript language is used to realize the data exchange between MATLAB software and HFSS software, which makes the acquisition of training data more concise and automatic. After obtaining the training data, it would be uniformly normalized. Assume that each group of input data isx with the size of 1 × n and the size is 1 × (n − 1) after passing the convolutional layer with the convolution kernel of 1 × 2. The data are then passed through the activation function before inputting the pooling layer, which can turn the linear data into discrete data. After adding nonlinear factors, the network model’s ability to understand the problem can be improved [24]. Therefore, in this paper, sigmoid is used as the activation function. Otherwise, the input data completed by convolutions and pooling are used as the input of the DGP, and the mean-squared error of the output of the DGP and the training output is used as the fitness function for PSO-based training. Finally, the output of the model is reversely normalized to get the real predicted output value given by the model.The trained DGP network can finally be used for antenna optimization design. The process of optimization design is shown in Figure3.Figure 3
Flowchart of optimal design.


## 2.1. Convolutional Neural Network

The basic structure of CNN consists of input layers, convolutional layers, pooling layers, fully connected layers, and output layers, among which the convolutional layers and the pooling layers usually have multiple layers according to the actual problem. The traditional CNN is composed of forward pass and back propagation, so BP is used to optimize the parameters of the NN and train the NN. We use PSO to optimize the parameters. Figure1 is a schematic diagram of the structure of the convolutional layer and the pooling layer in the one-dimensional CNN. In this figure, the top layer is the pooling layer, the middle layer is the convolutional layer, and the bottom layer is the input layer of the convolutional layer. The neurons in the convolutional layer constitute each feature surface, and each neuron is connected to the local region of the feature surface of the next layer through a set of convolution kernel. Then, the local weight value is calculated and transferred to a nonlinear activation function. In addition, the weight values of the same feature surface are shared. The parameters and complexity of the model can be reduced by weight value sharing and local connection, making the network easier to train. In order to combine with the GP, we use PSO to optimize the parameters. Therefore, we need to find out the number of parameters that need to be optimized and sort out their positions in the CNN.Figure 1
Schematic diagram of convolutional layer and pooling layer.Take Figure1 as an example. The feature surfaces are connected by a 1 × 3 convolution kernel. If we want to use an equation to represent the connection weight value of the ith neuron on the input feature surface m and the jth neuron on the output feature surface n, the following weight value sharing equation can be obtained: ωminj. An input feature surface can be mapped to the corresponding output feature surface through the translation of a convolution kernel of a fixed size, the convolution operation is performed with all neurons on the input feature surface, and then it can be mapped after weighting and activation. Because of the property of translation convolution kernel, the weight values can be shared for adjacent neurons in the corresponding position, which actually use the same weight value in the convolution kernel. Through the convolution operation, the number of neurons in the feature surface of the convolutional layer or the size of the feature surface satisfies the following formula:(1)OutSize=InSize−CSizeCInterval+1,where OutSize represents the number of neurons on output feature surface, InSize represents the number of neurons on input feature surface, CSize is the size of the convolution kernel, and CInterval represents the sliding translation step size of the convolution kernel. The number of parameters that can be trained by the convolutional layer is as follows [19]:(2)CPN=InSize×CSize+1×OutSize,where CPN is the number of training parameters and 1 is the number of thresholds, usually only one shared threshold is set for each layer. The activation function in CNN generally uses sigmoid function, tanh function, etc.The pooling layer is generally constructed on the next layer of the convolutional layer. It also consists of multiple feature surfaces, each of which corresponds to the unique feature surface of the previous layer. The feature of the pooling layer is that it does not change the number of feature surfaces. The number of neurons on the output feature surface of the pooling layer is calculated as follows:(3)OutSize=InSizeDSize,where DSize is the size of the pooling kernel. The numerical output formula of any neuron on the output feature surface of the pooling layer is as follows:(4)ynkout=fxnpin,xnp+1in,where ynkout is the kth neuron of the nth output surface of the pooling layer, xnpin is the pth neuron of the nth input face, and f⋅ can be classified into average pooling and maximum pooling according to the different pooling methods. The parameters that need to be optimized are usually in the convolutional layer and the fully connected layer. In the pooling layer, we choose the largest pooling or average pooling, and there are no training parameters [20]. Finally, we replaced the fully connected layer of the traditional CNN with a GP model, so we will not discuss the parameters of the fully connected layer here.


## 2.2. Gaussian Process

The GP describes a functional distribution. It is a set of infinite random variables, and any subset of these variables conforms to the Gaussian distribution. Its properties can be determined by the average value functionux=EYx and the covariance function Cx,x′=EYx−uxYx′−ux′. So, the GP can be defined as follows:(5)fx∼GPux,Cx,x′,where x,x′∈X refers to any d-dimensional vector.Assume the finite data setD=xi,ti,i=1,…,n containing n observed values as the training sample of the Gaussian model, and the observed target value t is polluted by additive noise ε that follows the normal distribution. Then the model can be expressed as follows:(6)ti=fxi+εi,i=1,...,nRd⟶R,where xi∈X represents the d×n dimensional training input matrix composed of training input vectors; ti represents the training output vector composed of the corresponding n training output scalars; and ε refers to the random variable that follows the normal distribution, that is,(7)ε∼N0,σn2.Joint Gaussian prior distribution composed ofn training outputs t and n∗ testing output t∗ is as follows:(8)tt∗∼N0,CX,X+σn2ICX,x∗CX,x∗Cx∗,x∗,where CX,x∗ is the n×n∗ order covariance matrix between training input and testing input samples and Cx∗,x∗ is the covariance matrix of the testing input sample itself.On the premise that the testing pointx∗ and the training set d is given, the purpose of Bayesian prediction probability is to calculate the probability Pt∗|D,x∗. Based on Bayesian posterior probability formula, we can get(9)t∗|x∗,D∼Nut∗,σt∗2,where the expected value and variance of t∗ are as follows:(10)ut∗=Cx∗,XCX,X+σn2I−1t,(11)σt∗2=Cx∗,x∗−CTx∗,XC+σn2I−1Cx∗,X.The covariance function of the GP must meet the Mercer condition, that is, for any point set, a non-negative positive definite covariance matrix can be guaranteed. This study chooses the Ardmatern52 covariance function as the covariance function of the GP:(12)Cxi,xj|θ=σf21+5r+53r2exp−5r,where(13)r=∑m=1dxim−xjm2σm2.where σf2 is the signal variance. The properties of the average function and covariance function of the GP are determined by a set of hyperparameters, which is also the only parameter that needs to be determined for the GP [21].


## 2.3. Particle Swarm Optimization

We adopted PSO algorithm for optimization. PSO algorithm is easy to implement, simple, with less parameters, and can effectively solve the global optimization problems [22]. In the standard PSO algorithm, the particle swarm consists of particles, and the position of each particle is assumed to be a possible prepared solution to the problem in the dimensional search space. The particle updates its flight track based on its inertia, optimal position, and swarm optimal position.The basic idea of the PSO algorithm is to accelerate each particle to approach the best position of itself and the swarm. In the solution space, the starting position and speed of the particles will be randomly set. During the iterative search process, the algorithm will record the best positions experienced by individual particles and swarms and the corresponding fitness function values. The speed and position update formula of the particle swarm algorithm is as follows:(14)vi,dk+1=vi,dk+c1randpi,dk−xi,dk+c2randpg,dk−xi,dk,(15)xi,dk+1=xi,dk+vi,dk+1,where c1 and c2 refer to the learning factor and the acceleration constant; rand () is a random number between (0, 1); vi,dk and xi,dk refer to the d-dimensional speed and position of particle i in the kth iteration; pi,dk refers to the position of the individual extreme value of particle i in the dth dimension; and pg,dk refers to the position of the global extreme value of the swarm in the dth dimension. In this paper, we optimized the parameters of the proposed DGP model globally using the PSO algorithm in the training of the model, so that the prediction accuracy of the model after the training is completed can replace the traditional electromagnetic simulation software. After that, the PSO algorithm is used again to optimize the antenna based on the trained model.


## 2.4. The Proposed Deep Gaussian Process

The deep Gaussian process (DGP) network model is the combination of the CNN and the GP, which is shown in Figure2. The GP replaces the fully connected layer of the CNN, while retaining the input layer, output layer, convolutional layer, and pooling layer of the CNN. The convolutional layer is used to retain the feature quantity of the input data, the pooling layer is used to reduce the data dimension, and the GP is used to predict the output of the object. The overall structure of the model is evolved from LeNet-5 [23] (a common conventional structure of CNN). However, it is more flexible than LeNet-5 because its overall structure has been improved with two or more layers of convolutional layers and pooling layers. Otherwise, the specific number of layers can be set according to actual needs or multiple convolutions can be carried out according to the size of the data or the order of convolutions and pooling can be changed.Figure 2
Deep Gaussian process network structure.In the DGP network modeling method, the samples required for model training, that is, the training input and training output, can be obtained by the electromagnetic simulation software HFSS. In this paper, VBScript language is used to realize the data exchange between MATLAB software and HFSS software, which makes the acquisition of training data more concise and automatic. After obtaining the training data, it would be uniformly normalized. Assume that each group of input data isx with the size of 1 × n and the size is 1 × (n − 1) after passing the convolutional layer with the convolution kernel of 1 × 2. The data are then passed through the activation function before inputting the pooling layer, which can turn the linear data into discrete data. After adding nonlinear factors, the network model’s ability to understand the problem can be improved [24]. Therefore, in this paper, sigmoid is used as the activation function. Otherwise, the input data completed by convolutions and pooling are used as the input of the DGP, and the mean-squared error of the output of the DGP and the training output is used as the fitness function for PSO-based training. Finally, the output of the model is reversely normalized to get the real predicted output value given by the model.The trained DGP network can finally be used for antenna optimization design. The process of optimization design is shown in Figure3.Figure 3
Flowchart of optimal design.


## 3. Multiband Microstrip Antenna Application

### 3.1. Design of Multiband Antenna

In recent years, the 4G system of LTE has matured and developed worldwide, and the 5G communication technology has also been gradually and widely used [25]. Under this background, the performance requirements of antennas are increasing [26]. To meet the requirements of many wireless communication standards, the antennas of mobile terminal should cover multiple frequency bands or broadband [27]. In addition, with the popularity of ultrathin mobile phones, the space of the antenna is limited, so it is of research value to design the antenna in terms of small size and frequency band [28].The antenna in [18] is changed from a T-shaped monopole antenna, and the size of the FR4 substrate is 75 (width) mm × 120 (length) mm × 0.8 (thickness) mm. The right side of the T-shaped antenna is a parasitic open strip, and the left side is a slot etched on the ground. The overall structure is shown in Figure 4. Through the simulation of HFSS electromagnetic software, we know the antenna has 4 resonant frequency bands. In this paper, we use the DGP network to perform optimization design of the microstrip antenna (MSA) to make it in the S11 less than 6 dB to cover the impedance bandwidth of 270 MHz (0.69 to 0.96 GHz) and 1.06 GHz (1.7 to 2.76 GHz), so that we can cover the wireless LTE 700, GSM 850, GSM 900, DCS 1800, PCS1900, UMTS 2100, LTE 2300, and LTE 2500 frequency bands.Figure 4
Schematic diagram of the multiband microstrip antenna.


### 3.2. Model Training and Prediction

During the modeling process, the 20 size parameters of the antenna (as shown in Table1) are used as variables and randomly combined into 200 groups of different antenna parameters as input data of the DGP network. HFSS is transferred for simulation, and the obtained simulation results are taken as the training output to train the DGP network model. The mean-squared error is used as the fitness function of PSO during the training process. If the model prediction accuracy does not meet the requirements, then we would continue to train iteratively by PSO until the model meets the accuracy requirements.Table 1
Optimization parameters of the multiband microstrip antenna.
Variable nameVariable range (unit: mm)Variable nameVariable range (unit: mm)L328.5∼10PL43.5∼4.5L3315∼22PL512∼18L356∼12PL65∼7W11∼2PL77∼12W23∼4PL85∼7W31.5∼2.5Plg13.5∼4.5L127∼29Lsg11∼3L221∼24Lsg21∼3PL150∼54Lsg340∼45PL24.5∼5.5Wsg1∼2The proposed DGP network model used here has 3 convolutional layers and 2 pooling layers. The size of the convolution kernel of each convolutional layer is 1 × 2, the number of channels of convolutional layer 1 is 3, the number of channels of convolutional layer 2 is 1, the number of channels of convolutional layer 3 is 3, and the size of pooling layer of each layer is 1 × 2. Figure5 shows the specific structure of the DGP network model for multiband antennas. After the input data of 1 × 20 enter the model, the dimension size after the pooling layer 2 is 1 × 4 for every channel, which can greatly reduce the training time of GP and improve the training efficiency of GP. After a series of convolutions and pooling processes, for the GP, at this point, the input training data size is 1 × 12, and the output data are the S11 amplitude corresponding to the frequency points sampled in the frequency band. The specific frequency band range is 0.5 GHz–3 GHz, and the sampling interval is 0.04 GHz, with 63 frequency points in each group.Figure 5
The DGP network model structure.After training, we use PSO to optimize the design. The number of particles in the PSO algorithm is 20, the maximum number of iterations is 500, the acceleration constant isc1=c2=2, the inertia weight w is 1, and the fitness function is less than−6 dB in the frequency range of 0.69–0.96 GHz and 1.7–2.76 GHz. The optimized size parameters are shown in Table 2. In order to verify the validity and accuracy of the model, Figure 6 shows the comparison results between the S11 predicted by the proposed method and the simulation results of the electromagnetic simulation software HFSS, and Figure 7 is the field pattern of the antenna in its 4 frequency points. The above results prove that the optimized antenna can meet the optimization objectives.Table 2
Optimized parameters of the multiband microstrip antenna.
Variable nameVariable range (unit: mm)Variable nameVariable range (unit: mm)L329.66PL44.02L3317.96PL517.66L3510.05PL66.27W11.09PL711.79W23.26PL86.75W31.65Plg13.74L127.56Lsg11.58L222.32Lsg22.34PL152.11Lsg343.47PL24.95Wsg1.068Figure 6
S11 comparison results of the multiband microstrip antenna.Figure 7
Field pattern of the antenna.


## 3.1. Design of Multiband Antenna

In recent years, the 4G system of LTE has matured and developed worldwide, and the 5G communication technology has also been gradually and widely used [25]. Under this background, the performance requirements of antennas are increasing [26]. To meet the requirements of many wireless communication standards, the antennas of mobile terminal should cover multiple frequency bands or broadband [27]. In addition, with the popularity of ultrathin mobile phones, the space of the antenna is limited, so it is of research value to design the antenna in terms of small size and frequency band [28].The antenna in [18] is changed from a T-shaped monopole antenna, and the size of the FR4 substrate is 75 (width) mm × 120 (length) mm × 0.8 (thickness) mm. The right side of the T-shaped antenna is a parasitic open strip, and the left side is a slot etched on the ground. The overall structure is shown in Figure 4. Through the simulation of HFSS electromagnetic software, we know the antenna has 4 resonant frequency bands. In this paper, we use the DGP network to perform optimization design of the microstrip antenna (MSA) to make it in the S11 less than 6 dB to cover the impedance bandwidth of 270 MHz (0.69 to 0.96 GHz) and 1.06 GHz (1.7 to 2.76 GHz), so that we can cover the wireless LTE 700, GSM 850, GSM 900, DCS 1800, PCS1900, UMTS 2100, LTE 2300, and LTE 2500 frequency bands.Figure 4
Schematic diagram of the multiband microstrip antenna.


## 3.2. Model Training and Prediction

During the modeling process, the 20 size parameters of the antenna (as shown in Table1) are used as variables and randomly combined into 200 groups of different antenna parameters as input data of the DGP network. HFSS is transferred for simulation, and the obtained simulation results are taken as the training output to train the DGP network model. The mean-squared error is used as the fitness function of PSO during the training process. If the model prediction accuracy does not meet the requirements, then we would continue to train iteratively by PSO until the model meets the accuracy requirements.Table 1
Optimization parameters of the multiband microstrip antenna.
Variable nameVariable range (unit: mm)Variable nameVariable range (unit: mm)L328.5∼10PL43.5∼4.5L3315∼22PL512∼18L356∼12PL65∼7W11∼2PL77∼12W23∼4PL85∼7W31.5∼2.5Plg13.5∼4.5L127∼29Lsg11∼3L221∼24Lsg21∼3PL150∼54Lsg340∼45PL24.5∼5.5Wsg1∼2The proposed DGP network model used here has 3 convolutional layers and 2 pooling layers. The size of the convolution kernel of each convolutional layer is 1 × 2, the number of channels of convolutional layer 1 is 3, the number of channels of convolutional layer 2 is 1, the number of channels of convolutional layer 3 is 3, and the size of pooling layer of each layer is 1 × 2. Figure5 shows the specific structure of the DGP network model for multiband antennas. After the input data of 1 × 20 enter the model, the dimension size after the pooling layer 2 is 1 × 4 for every channel, which can greatly reduce the training time of GP and improve the training efficiency of GP. After a series of convolutions and pooling processes, for the GP, at this point, the input training data size is 1 × 12, and the output data are the S11 amplitude corresponding to the frequency points sampled in the frequency band. The specific frequency band range is 0.5 GHz–3 GHz, and the sampling interval is 0.04 GHz, with 63 frequency points in each group.Figure 5
The DGP network model structure.After training, we use PSO to optimize the design. The number of particles in the PSO algorithm is 20, the maximum number of iterations is 500, the acceleration constant isc1=c2=2, the inertia weight w is 1, and the fitness function is less than−6 dB in the frequency range of 0.69–0.96 GHz and 1.7–2.76 GHz. The optimized size parameters are shown in Table 2. In order to verify the validity and accuracy of the model, Figure 6 shows the comparison results between the S11 predicted by the proposed method and the simulation results of the electromagnetic simulation software HFSS, and Figure 7 is the field pattern of the antenna in its 4 frequency points. The above results prove that the optimized antenna can meet the optimization objectives.Table 2
Optimized parameters of the multiband microstrip antenna.
Variable nameVariable range (unit: mm)Variable nameVariable range (unit: mm)L329.66PL44.02L3317.96PL517.66L3510.05PL66.27W11.09PL711.79W23.26PL86.75W31.65Plg13.74L127.56Lsg11.58L222.32Lsg22.34PL152.11Lsg343.47PL24.95Wsg1.068Figure 6
S11 comparison results of the multiband microstrip antenna.Figure 7
Field pattern of the antenna.


## 4. Conclusion

This study proposes a modeling method based on deep Gaussian process networks. In the framework of deep learning, this paper first utilizes the advantages of convolutional neural network and Gaussian process and creatively combines these advantages. Then, we take advantage of the convolutional neural network to reduce the input data dimension without losing data characteristics and finally use the Gaussian process adaptability to the nonlinear problem to predict antenna frequency, so as to guarantee the accuracy and reduce the calculation time, thereby improving the efficiency. Meanwhile, the proposed deep Gaussian process network model combined with the PSO algorithm is adopted to conduct optimization design. The optimized results are very close to the results obtained by the HFSS high-fidelity model simulation, indicating that the modeling method is sufficiently reliable. The optimized antenna size meets the requirements of the index, showing that the method has practical value in the antenna optimization design.



---

*Source: 2154928-2020-11-12.xml*