# A Fast and Efficient Beamforming Algorithm Imitating Plant Growth Gene for Phased Array Antenna

Authors: Jinling Zhang; Chen Han; Zhanqi Zheng; Xiongzhi Zhu; Xiaohui Li
Journal: International Journal of Antennas and Propagation
 (2022)

---

## Abstract

In this paper, a new beamforming algorithm for phased array antennas is proposed, the plant growth gene algorithm. The algorithm consists of three steps. Firstly, according to the excitation relation of the array unit before and after the local fine-tuning of the antenna radiation pattern, the model for solving the array unit excitation difference is established. Secondly, the Taylor series expansion is used to solve the model, and the growth model is established based on this, and the beam tuning network is designed to realize the growth model. Finally, based on the growth gene obtained by the neural network algorithm, the growth model is called multiple times for high-precision beamforming. This algorithm converts the complex optimization process of array antenna excitation by the classical optimization algorithm into a simple process of fine-tuning the gain at any angle on the beam to make it grow and approach the target pattern. The growth gene is used to weigh the target angle and gain to achieve beamforming, which greatly reduces the complexity of the algorithm and improves its accuracy of the algorithm. Taking a 1 × 16 linear array as an example, a cosecant square beam pattern with a coverage range of −31° to 31° and a maximum gain direction of 17° is designed using the algorithm proposed in this paper. The experimental results show that the proposed algorithm can easily fine-tune the gain of any angle to achieve precise beamforming. Importantly, the growth genes trained by the algorithm are universal to the phased array antenna with the same topology.


---

## Body

## 1. Introduction

Beamforming is an important technology for array antennas to realize long-distance high-quality communication and high-resolution target detection. A lot of research work on array antenna beamforming has been carried out at home and abroad [1–8]. Among them, based on the target beam pattern, there are many research studies on using algorithms to optimize the excitation amplitude and phase of each array unit or optimizing the arrangement of array units to realize beamforming, such as genetic algorithm [5], model order reduction [6], weed algorithm [7], and particle swarm optimization algorithm [8]. The method of using the algorithm for beamforming is to make the gains of all angles of the original beam approach the target pattern, so as to minimize the error between the original and target beam pattern. In these algorithms, the errors of all angles are counted, and the overall errors are aimed at minimizing. However, it is difficult to optimize the errors of a single-angle to the minimum, which leads to the failure of the antenna radiation pattern to accurately fit with the target pattern at a single angle, and it is difficult to achieve further improvement. In addition, for the antenna whose topology is determined, or without changing the antenna structure, when the target pattern needs to be changed or improved according to engineering applications or other reasons, even if only one angle gain needs to be changed, the optimization algorithm needs to be rerun to calculate the excitation corresponding to the new beam pattern. Therefore, the beamforming by the current algorithm has low efficiency and accuracy, high cost, poor generality, and no correction mechanism for local errors, so it is impossible to fine-tune the results of the beamforming.With the development of deep learning technology, the neural network method is used to model the nonlinear relationship between the antenna radiation pattern and the excitation of the array units, and the coupling effect between the array units is considered in the beamforming process [9–11]. In [12], a convolutional neural network is used to model the beamforming problem of a phased array. The processed two-dimensional pattern image is used as input of the model and the output of the model is the phase of each array unit. In [13], the antenna is placed in a space with obstacles, the neural network is used to deal with the beamforming problem, and the interaction between array units and the existence of obstacles are considered, which is more in line with the practical application scenarios. Besides excitation, the position of each array unit also affects the beam pattern. In [14], the coupling effects of different array unit positions in beamforming are analyzed through the neural network, and the array unit position distribution and excitation are simultaneously optimized by combining optimization algorithms. The transfer learning method is used in [15] to reduce the amount of data required for training and obtains better results than traditional DNN methods.In this paper, we propose a beamforming algorithm that imitates the plant growth gene (Growth Gene Algorithm (GGA)) and train a set of growth gene parameters by a neural network. Using the growth gene to weigh any target angle and target gain can easily control the gain of any angle on the known antenna radiation pattern and gradually increase the gain of that angle by a certain step size, just as a plant grows a new branch in a local area. The specific process is as follows: firstly, by analyzing the parameter information involved in the gain change of a certain angle of the phased array antenna, a growth model for beam fine-tuning of the single-angle gain of the antenna radiation pattern is proposed. Secondly, the Beam Tuning Network (BTNet) is designed based on the neural network and growth model structure. Finally, the data obtained by an improved genetic algorithm [16] and the growth gene of the phased array antenna are obtained. Accurate beamforming is realized based on the growth gene parameters. Experimental verification shows that we can fine-tune the beam gain at any angle based on the growth gene parameters and can be applied to the phased array antenna of any antenna unit structure. It has universality, greatly reduces the complexity of pattern configuration, and improves the efficiency and precision of array antenna synthesis.


## 2. The Theory of Gain Fine-Tuning

A method of expressing beamforming with excitation difference is proposed, which converts the array antenna beamforming into high-precision beamforming for any target pattern by gradually fine-tuning the gain at any angle in the antenna radiation pattern. Each of these fine-tuning of the gain at an angle is achieved by adding an excitation difference∂W corresponding to the pattern difference to the known excitation Wori.Assuming that the excitation corresponding to the original pattern of the n-unit array antenna isWori=wori1,wori2,…,worin,…,woriNT, and the excitation corresponding to the pattern after fine-tuning is W=w1,w2,…,wn,…,wNT, then the relationship between the corresponding excitation before and after pattern fine-tuning can be expressed as follows:(1)w1w2⋯wn⋯wN=wori1wori2⋯worin⋯woriN+∂w1∂w2⋯∂wn⋯∂wN,where ∂wn represents the difference of excitation before and after beamforming of the nth array unit. The above expression is only related to the excitation of the antenna unit and does not involve the antenna array unit. Therefore, for an array antenna with any antenna unit structure, the relationship between the excitations of the array units before and after beamforming can be expressed by (1).For any beamforming problem, there are correspondingW and ∂W=∂w1,∂w2,…,∂wn,…,∂wNT on the basis of any original excitation Wori. The key of traditional array antenna beamforming is to search for appropriate excitation W. The growth gene algorithm proposed in this paper is to solve ∂W instead of searching W and obtains the excitation corresponding to the target pattern indirectly by using the general model among W,Wori, and ∂W.


## 3. Materials and Methods

### 3.1. Growth Gene Algorithm (GGA)

As shown in Figure1, the excitation difference ∂wn corresponding to the gain change at a certain angle of the phased array antenna radiation pattern is only related to the following three parameters: the angle to be adjusted, θ (in radians), the original gain of the pattern at the angle θ, Goriθ (in dBi), and the expected gain change, s (in dB). According to the three parameters θ,Goriθ, and s to solve ∂W, the mathematical solution model of ∂W is assumed as follows:(2)∂wn=fsgGoriθhθ,n,where ∂wn represents the excitation difference of the nth array element before and after the pattern fine-tuning, fs and gGoriθ are unknown functions about s and Goriθ respectively, and hθ,n is the array factor of the target angle of the nth array element(3)hθ,n=e−j2πdn−1cosθ.Figure 1
When there is only a local difference between the target pattern and the original pattern at the angle and the expected gain change is small, it is difficult to use the optimization algorithm for accurate beamforming.When beamforming the phased array antenna, since the fine-tuned pattern can be arbitrary compared to the original pattern, the gainGoriθ+s of the fine-tuned pattern at angle θ is also arbitrary compared to the gain Goriθ of the original pattern. That is, the expected gain change s at the angle θ is independent of the original gain Goriθ. Therefore, in (2), two unary functions fs,gGoriθ instead of binary functions fs,Goriθ are used to represent ∂W model.Althoughfs and gGoriθ are unknown in the ∂W model, according to the definition of Taylor series, fs can be expressed as follows:(4)fs=∑m=0∞fm0m!sm=f0+f′0s+f″02!s2+…+fm0m!sm+….Leta0=f0,a1=f′0,a2=f″0/2!,…,am=fm0/m!,…, then fs can be expressed as follows:(5)fs=a0n+a1ns1+a2ns2+…+amnsm+…,where n represents the nth array element. Similarly, gGoriθ can be expressed as follows:(6)gGoriθ=b0n+b1nGoriθ+b2nGoriθ2+…+bmnGoriθm+….The higher the order of the Taylor series, the higher the approximation of the function expression. The experimental simulation results show that the fifth-order Taylor series can already meet the accuracy requirements of beamforming. So in this paper, the functionsfs and gGoriθ are expanded into the fifth-order Taylor series. The ∂W model can be expressed as follows:(7)∂wn=a0n+a1ns1+a2ns2+a3ns3+a4ns4+a5ns5×b0n+b1nGoriθ+b2nGoriθ2+b3nGoriθ3+b4nGoriθ4+b5nGoriθ5×e−j2πdn−1cosθ.Since the even and odd powers of negative numbers are opposite numbers, the same∂W model cannot accurately express the two cases of expected gain change s>0 and s<0. However, the expansion of Taylor series shows that for both cases, the ∂W model has different weights but has similar forms. When s>0, ∂W model can be expressed as follows:(8)∂wn=a0+n+a1+ns1+a2+ns2+a3+ns3+a4+ns4+a5+ns5×b0+n+b1+nGoriθ+b2+nGoriθ2+b3+nGoriθ3+b4+nGoriθ4+b5+nGoriθ5×e−j2πdn−1cosθ.Whens<0, ∂W model can be expressed as follows:(9)∂wn=a0−n+a1−ns1+a2−ns2+a3−ns3+a4−ns4+a5−ns5×b0−n+b1−nGoriθ+b2−nGoriθ2+b3−nGoriθ3+b4−nGoriθ4+b5−nGoriθ5×e−j2πdn−1cosθ.It can be seen from (8) and (9) that for the problem of fine-tuning the gain of the single-angle in beamforming, as long as the weights a0+n,...,a5+n,b0+n,...,b5+n;a0−n,...,a5−n,b0−n,...,b5−n in the ∂W model are appropriate, the excitation corresponding to each array element after the gain fine-tuning can be calculated according to s and Goriθ. Since the positive fine-tuning of the gain at an angle s>0 is similar to the plant gradually growing a new branch in a certain part, the weights a0+n,...,a5+n,b0+n,...,b5+n that plays a key role in the process of positive fine-tuning of gain are called positive growth gene, and the weights a0−n,...,a5−n,b0−n,...,b5−n that play a role in the process of negative fine-tuning s<0 are called negative growth gene, and the gain fine-tuning model ∂W is named “Growth Model.”In this paper, the method of using the growth model to adjust the gain of any angle of the radiation pattern to realize the precise beamforming of the phased array antenna is named the Growth Gene Algorithm (GGA). The beamforming of GGA only involves simple matrix multiplication and addition operation, so the complexity is much lower than other beamforming algorithms. The solution of GGA is∂wn of a single array element after beamforming. Each array element corresponds to a growth model and two sets of gene parameters. Taking 1 × 16 linear array antenna as an example, a total of 2 × 12 × 16 = 384 gene parameters need to be determined. Since the growth model does not involve the radiation pattern of the array element, for the 1 × 16 linear array antenna with the same topology, these 384 gene parameters are applicable to the antenna element of any structure.In the next section, Beam Tuning Network (BTNet) is designed based on a growth gene algorithm and neural network, and the growth genes of 1 × 16 linear array antenna are trained to verify the effectiveness of the algorithm proposed in this paper for fine-tuning gain at any angle and high-precision beamforming.


### 3.2. Beam Tuning Network (BTNet)

The neural network model designed to train the growth model of each array element is shown in Figure2.Figure 2
BTNet is a general model structure designed based on the neural network combined with the antenna gain fine-tuning problem. Different from the traditional neural network, it has two input layers and its network structure can be divided into three subnetworks.In BTNet, the weight training by the convolutional layer of sub network 1 corresponds to the gene parametera1n,a2n,a3n,a4n,a5n related to fs, and the trained bias corresponds to the gene parameter a0n. The activation function used by the convolutional layer is “identity mapping,” that is, y=σx=x. The architecture of subnetwork 2 is similar to that of subnetwork 1, in that the weight and bias trained by the convolutional layer correspond to the gene parameters related to gGoriθ, and the activation function is also “identity mapping.” In order to make the output of the neural network consistent with the growth model, sub network 3 uses the “multiplicator layer” designed for the structure of the growth model. Its input is fs and gGoriθ learned by the network, and the output is fs×gGoriθ. According to the form of array factor in the growth model, the activation function in the sub network 3 is designed as y=σx=hθ,nx, so that the output of the activation function is the growth model ∂wn of the nth array element.To sum up, the process of beamforming by the GGA is shown in Figure3. The gene parameters of the growth model corresponding to each array element are trained through BTNet, and the growth model obtained by training is used to calculate the excitation of each array element corresponding to the target pattern to complete the beamforming. The algorithm can fine-tune the gain at any angle on any radiation pattern, achieve high-precision beamforming, decouple the main lobe and side lobe, and have the characteristics of high computing efficiency and real-time data feedback.Figure 3
Flow chart of beamforming using growth model; in the process of beamforming, the gene parameters of the growth model corresponding to each array element were first trained by BTNet. Then, use the trained growth model to calculate the excitation of each array element corresponding to the target pattern and complete the beamforming.


## 3.1. Growth Gene Algorithm (GGA)

As shown in Figure1, the excitation difference ∂wn corresponding to the gain change at a certain angle of the phased array antenna radiation pattern is only related to the following three parameters: the angle to be adjusted, θ (in radians), the original gain of the pattern at the angle θ, Goriθ (in dBi), and the expected gain change, s (in dB). According to the three parameters θ,Goriθ, and s to solve ∂W, the mathematical solution model of ∂W is assumed as follows:(2)∂wn=fsgGoriθhθ,n,where ∂wn represents the excitation difference of the nth array element before and after the pattern fine-tuning, fs and gGoriθ are unknown functions about s and Goriθ respectively, and hθ,n is the array factor of the target angle of the nth array element(3)hθ,n=e−j2πdn−1cosθ.Figure 1
When there is only a local difference between the target pattern and the original pattern at the angle and the expected gain change is small, it is difficult to use the optimization algorithm for accurate beamforming.When beamforming the phased array antenna, since the fine-tuned pattern can be arbitrary compared to the original pattern, the gainGoriθ+s of the fine-tuned pattern at angle θ is also arbitrary compared to the gain Goriθ of the original pattern. That is, the expected gain change s at the angle θ is independent of the original gain Goriθ. Therefore, in (2), two unary functions fs,gGoriθ instead of binary functions fs,Goriθ are used to represent ∂W model.Althoughfs and gGoriθ are unknown in the ∂W model, according to the definition of Taylor series, fs can be expressed as follows:(4)fs=∑m=0∞fm0m!sm=f0+f′0s+f″02!s2+…+fm0m!sm+….Leta0=f0,a1=f′0,a2=f″0/2!,…,am=fm0/m!,…, then fs can be expressed as follows:(5)fs=a0n+a1ns1+a2ns2+…+amnsm+…,where n represents the nth array element. Similarly, gGoriθ can be expressed as follows:(6)gGoriθ=b0n+b1nGoriθ+b2nGoriθ2+…+bmnGoriθm+….The higher the order of the Taylor series, the higher the approximation of the function expression. The experimental simulation results show that the fifth-order Taylor series can already meet the accuracy requirements of beamforming. So in this paper, the functionsfs and gGoriθ are expanded into the fifth-order Taylor series. The ∂W model can be expressed as follows:(7)∂wn=a0n+a1ns1+a2ns2+a3ns3+a4ns4+a5ns5×b0n+b1nGoriθ+b2nGoriθ2+b3nGoriθ3+b4nGoriθ4+b5nGoriθ5×e−j2πdn−1cosθ.Since the even and odd powers of negative numbers are opposite numbers, the same∂W model cannot accurately express the two cases of expected gain change s>0 and s<0. However, the expansion of Taylor series shows that for both cases, the ∂W model has different weights but has similar forms. When s>0, ∂W model can be expressed as follows:(8)∂wn=a0+n+a1+ns1+a2+ns2+a3+ns3+a4+ns4+a5+ns5×b0+n+b1+nGoriθ+b2+nGoriθ2+b3+nGoriθ3+b4+nGoriθ4+b5+nGoriθ5×e−j2πdn−1cosθ.Whens<0, ∂W model can be expressed as follows:(9)∂wn=a0−n+a1−ns1+a2−ns2+a3−ns3+a4−ns4+a5−ns5×b0−n+b1−nGoriθ+b2−nGoriθ2+b3−nGoriθ3+b4−nGoriθ4+b5−nGoriθ5×e−j2πdn−1cosθ.It can be seen from (8) and (9) that for the problem of fine-tuning the gain of the single-angle in beamforming, as long as the weights a0+n,...,a5+n,b0+n,...,b5+n;a0−n,...,a5−n,b0−n,...,b5−n in the ∂W model are appropriate, the excitation corresponding to each array element after the gain fine-tuning can be calculated according to s and Goriθ. Since the positive fine-tuning of the gain at an angle s>0 is similar to the plant gradually growing a new branch in a certain part, the weights a0+n,...,a5+n,b0+n,...,b5+n that plays a key role in the process of positive fine-tuning of gain are called positive growth gene, and the weights a0−n,...,a5−n,b0−n,...,b5−n that play a role in the process of negative fine-tuning s<0 are called negative growth gene, and the gain fine-tuning model ∂W is named “Growth Model.”In this paper, the method of using the growth model to adjust the gain of any angle of the radiation pattern to realize the precise beamforming of the phased array antenna is named the Growth Gene Algorithm (GGA). The beamforming of GGA only involves simple matrix multiplication and addition operation, so the complexity is much lower than other beamforming algorithms. The solution of GGA is∂wn of a single array element after beamforming. Each array element corresponds to a growth model and two sets of gene parameters. Taking 1 × 16 linear array antenna as an example, a total of 2 × 12 × 16 = 384 gene parameters need to be determined. Since the growth model does not involve the radiation pattern of the array element, for the 1 × 16 linear array antenna with the same topology, these 384 gene parameters are applicable to the antenna element of any structure.In the next section, Beam Tuning Network (BTNet) is designed based on a growth gene algorithm and neural network, and the growth genes of 1 × 16 linear array antenna are trained to verify the effectiveness of the algorithm proposed in this paper for fine-tuning gain at any angle and high-precision beamforming.


## 3.2. Beam Tuning Network (BTNet)

The neural network model designed to train the growth model of each array element is shown in Figure2.Figure 2
BTNet is a general model structure designed based on the neural network combined with the antenna gain fine-tuning problem. Different from the traditional neural network, it has two input layers and its network structure can be divided into three subnetworks.In BTNet, the weight training by the convolutional layer of sub network 1 corresponds to the gene parametera1n,a2n,a3n,a4n,a5n related to fs, and the trained bias corresponds to the gene parameter a0n. The activation function used by the convolutional layer is “identity mapping,” that is, y=σx=x. The architecture of subnetwork 2 is similar to that of subnetwork 1, in that the weight and bias trained by the convolutional layer correspond to the gene parameters related to gGoriθ, and the activation function is also “identity mapping.” In order to make the output of the neural network consistent with the growth model, sub network 3 uses the “multiplicator layer” designed for the structure of the growth model. Its input is fs and gGoriθ learned by the network, and the output is fs×gGoriθ. According to the form of array factor in the growth model, the activation function in the sub network 3 is designed as y=σx=hθ,nx, so that the output of the activation function is the growth model ∂wn of the nth array element.To sum up, the process of beamforming by the GGA is shown in Figure3. The gene parameters of the growth model corresponding to each array element are trained through BTNet, and the growth model obtained by training is used to calculate the excitation of each array element corresponding to the target pattern to complete the beamforming. The algorithm can fine-tune the gain at any angle on any radiation pattern, achieve high-precision beamforming, decouple the main lobe and side lobe, and have the characteristics of high computing efficiency and real-time data feedback.Figure 3
Flow chart of beamforming using growth model; in the process of beamforming, the gene parameters of the growth model corresponding to each array element were first trained by BTNet. Then, use the trained growth model to calculate the excitation of each array element corresponding to the target pattern and complete the beamforming.


## 4. Algorithms and Model Validation

### 4.1. Training Strategy

Taking the 1 × 16 linear array antenna as an example to verify the algorithm, BTNet is used to train the gene parameters of the growth model of each array element, and the Adam optimizer is used in the training [17]. In the experiment, the data pair θ,s composed of random angles and gain change values is used as the optimization target pattern, and the improved genetic algorithm [16] is used to generate 20,000 sets of data in the format of θ,Gθ,s,∂W, in which the ratio of s>0 to s<0 is 1 : 1. BTNet is trained with 8000 sets of data, and 2000 sets of data are used for validation. Set the number of training times (epochs) to 400 and batch size to 100, and use the CPU version of TensorFlow 1.8.0 for simulation. In order to improve the efficiency of training, the transfer learning [18] strategy is adopted in training. Except that the initial weights are randomly generated in the first training, the weights trained in the previous training are used as the initial weights in the rest of the training. For the 1 × 16 linear array antenna, in order to obtain 2 sets of gene parameters of the growth model of each array element, BTNet was used for 32 times of training. Under the condition of Intel(R) Core(TM) I5-7300HQ CPU @ 2.50 GHz processor and 8 Gb memory, the first training takes about 7 minutes, and the rest training takes about 1 minute and 27 seconds on average due to the strategy of transfer learning.


### 4.2. Experimental Results of Growth Genes

Under the condition of 20000 sets of data, BTNet was used to train the growth model of 1 × 16 linear arrays, and the obtained 192 positive growth gene parameters and negative growth gene parameters are shown in Tables1 and 2, respectively.Table 1
1 × 16 linear array positive growth gene parameters.
a0a1a2a3a4a5b0b1b2b3b4b5n = 100.1151340.0067190.0003410.0000900.00001010.0072260.0004440.0000880.0000140.000072n = 200.1151410.0066950.0002990.0000880.00007210.0072900.0004990.0000530.0000700.000020n = 300.1151330.0067040.0003000.0000580.00009010.0072610.0004720.0001060.0000810.000058n = 400.1151480.0066540.0003390.0000130.00004910.0072170.0005080.0000910.0000500.000047n = 500.1151360.0066980.0002540.0000170.00005210.0072100.0004920.0001020.0000720.000015n = 600.1151960.0066820.0003470.0000750.00008010.0072450.0004530.0001030.0000080.000013n = 700.1151470.0066690.0003330.0000900.00000610.0072400.0004630.0000620.0000660.000063n = 800.1151590.0066730.0002520.0001080.00001710.0072110.0004470.0000400.0000490.000034n = 900.1152250.0067220.0002550.0000840.00002710.0072420.0004650.0001140.0000420.000098n = 1000.1151600.0067000.0003170.0000640.00007010.0072670.0004280.0000330.0001000.000017n = 1100.1151330.0066860.0003380.0000770.00001910.0072370.0004560.0001180.0000160.000086n = 1200.1151940.0066680.0002690.0000530.00004810.0072120.0004690.0000430.0000380.000058n = 1300.1151550.0066590.0003120.0000370.00008210.0072980.0004830.0000540.0000580.000011n = 1400.1152210.0067180.0003320.0000360.00005910.0072020.0004530.0000510.0000160.000018n = 1500.1151720.0066390.0003100.0000570.00007010.0072700.0004740.0000230.0000070.000032n = 1600.1151830.0066950.0002910.0000920.00007210.0072970.0004630.0000530.0000110.000061Table 2
1 × 16 linear array negative growth gene parameters.
Genea0a1a2a3a4a5b0b1b2b3b4b5n = 100.115199−0.0065740.000290−0.0000040.00007810.0072340.0004710.0000940.0000100.000013n = 200.115185−0.0065810.0003390.0000700.00007310.0072050.0004170.0000290.0000800.000094n = 300.115198−0.0066170.0003220.0000010.00001210.0072640.0004430.0000850.0000750.000058n = 400.115204−0.0066070.0003230.0000870.00008710.0072090.0004470.0000570.0000690.000060n = 500.115209−0.0065930.000271−0.0000010.00007710.0072210.0004490.0000750.0000230.000064n = 600.115178−0.0066150.0003280.0000000.00002910.0072240.0004630.0000290.0000410.000010n = 700.115141−0.0065520.0002790.0000500.00009610.0072430.0004790.0000960.0000430.000066n = 800.115141−0.0065370.0002690.0000170.00008010.0072490.0004870.0000600.0000270.000004n = 900.115197−0.0065870.0002950.0000510.00000610.0072320.0004870.0000900.0000130.000013n = 1000.115139−0.0066290.0002920.0000560.00007210.0072530.0004210.0000830.0000130.000013n = 1100.115140−0.0066160.0002670.0000100.00003210.0072320.0004320.0000450.0000890.000070n = 1200.115186−0.0066120.000271−0.0000020.00009110.0072710.0004660.0000510.0000170.000062n = 1300.115229−0.0066130.0002760.0000300.00000710.0072680.0004500.0001180.0000400.000062n = 1400.115145−0.0065920.0002660.0000660.00008710.0072350.0004790.0000490.0000530.000083n = 1500.115190−0.0065960.0002800.0000350.00004210.0072360.0004660.0000940.0000420.000043n = 1600.115142−0.0066280.0002790.0000220.00006510.0072960.0005040.0000660.0000240.000076The gene parameters in this table are applicable to the 1 × 16 linear array antenna of any antenna element structure. By using the growth model to fine-tune the gain at any angle on the radiation pattern, the corresponding excitation of each array element can be calculated quickly.


### 4.3. Experimental Verification of Beam Fine-Tuning

The antenna structure and unit structure of the 1 × 16 linear arrays used to verify the growth gene algorithm are shown in Figure4 and Figure 5. The antenna unit adopts a patch structure with a length of 37.26 mm and a width of 28 mm. The unit spacing is d, feeding from the coaxial line, and the feeding point is located 7 mm above the center of the patch antenna. The relative dielectric constant and thickness of substrate FR4 are 4.4 and 1.6 mm respectively. The working frequency of the antenna is 2.45 GHz, and the working air wavelength is λ = 122 mm. Figure 6(a) shows a flat-topped beam pattern of the 1 × 16 array antenna under the condition of array spacing d = 0.5λ. The amplitude and phase of the excitation corresponding to the flat-topped beam pattern are shown in Table 3.Figure 4
1 × 16 linear array antenna.Figure 5
Patch antenna element.Figure 6
(a) The flat-topped beam pattern of the 1 × 16 antenna array under the condition of array spacingd = 0.5λ and gain G(θ) = 8 dBi at angle θ = 18°(b) the fine-tuned pattern has a gain of 5dBi at θ = 18°, which is 3 dB lower than the original flat-topped beam pattern; (c) the fine-tuned pattern has a gain of 11dBi at θ = 18°, which is 3 dB higher than the original flat-topped beam pattern. The random pattern of the 1 × 16 array antenna with array spacing d = 0.5λ was taken as the initial pattern, and the growth model was used to carry out continuous fine-tuning of the side lobe gain at θ = –33° with equal step size; (d) the general view of pattern tuning; (e) the detail view; (f) the cosecant squared pattern designed using the growth model, the coverage range of the formed pattern is -31°∼31°, and the maximum gain direction is θ = 17°.
(a)(b)(c)(d)(e)(f)Table 3
The excitation corresponding to the flat-top beam.
NumAmplitude (V)Phase10.803040deg22.63950deg33.63520deg45.1516−180deg517.3215180deg66.1928−180deg728.77320deg835.57390deg919.9924180deg1088.6058−180deg11100−180deg1257.2576−180deg1314.716180deg140.683840deg150.993590deg160.140010degAs shown in Figure6(a), the gain of the flat-topped beam pattern at θ = 18° is 8dBi. In the experiment, the growth model trained by BTNet is used to fine-tune the gain at this angle by decreasing 3 dB and increasing 3 dB, respectively. The corresponding excitation of each array element calculated by the growth model is shown in Table 4. The electromagnetic simulation software CST is used to simulate the excitation in Table 4, and the simulation results are shown in Figure 6(b) and Figure 6(c), respectively. It can be observed that the gains of the fine-tuned beam pattern at θ = 18° are 5dBi and 11dBi, respectively, indicating that the growth model is very accurate for the fine-tuning pattern at any angle.Table 4
The excitation after gain fine-tuning.
NumGain decreased by 3 dBGain increased by 3 dBAmplitudePhaseAmplitudePhase14.672 V167.6122deg8.4425 V−9.5788deg24.0511 V−105.728deg9.5885 V34.7518deg37.2696 V−48.0397deg7.8159 V75.7985deg42.2398 V−100.0909deg12.2195 V165.3479deg513.9121 V167.903deg22.9001 V−169.7203deg68.3639 V138.906deg9.7894 V−128.0798deg726.1478 V7.2343deg33.0671 V−8.0232deg832.3632 V−3.1515deg40.2185 V3.5551deg923.1728 V−166.7736deg18.0008 V155.6163deg1090.0087 V−177.3203deg86.9729 V176.1113deg11100V179.685deg100V−179.5584deg1257.9555 V175.2204deg56.9624 V−173.1756deg1318.6731 V164.7761deg12.2061V−145.7311deg144.7879 V171.4933deg8.3389 V−6.8373deg154.8673 V−122.5324deg8.3516 V43.5287deg165.5395 V−74.6664deg7.6825 V102.9145degFigure6(d) and Figure 6(e) show the results of continuously fine-tuning the side lobe gain of the 1 × 16 linear array antenna at θ = -33° with 0.5 dB steps using the growth model. It can be found that using the growth model to fine-tune the side lobes of the antenna radiation pattern will not affect the gain of the main lobe of the pattern and vice versa. This conclusion is also verified in Figure 6(b) and Figure 6(c).The fine-tuning of the gain at any angle by the above growth model takes an average of less than 10 ms, which verifies the high efficiency of the growth gene algorithm for fine-tuning patterns, which is convenient for real-time application in engineering. Table5 shows the comparison of the computational times between the growth model and some beamforming algorithms in the literature. The growth model uses G (θ) (in dBi, the original gain at the angle θ) and s (in dB, the expected gain change at the angle θ) as inputs, where s is the step size of beam fine-tuning.Table 5
Comparison of the growth model with different algorithms.
Year/RefAlgorithmAntenna arrayOptimization objectivesComputational time[2020]/[5]Generic algorithm10-circularBeamforming110 s[2015]/[6]Model order reductionRectangularBeamforming644 s[2020]/[7]Invasive weed optimization10-circularBeamforming114.5 s[2019]/[8]Particle swarm optimization8 × 1 PatchBeamforming31.7 s[2019]/[8]Firefly algorithm8 × 1 PatchBeamforming55.4 s[2019]/[8]Taguchi’s method8 × 1 PatchBeamforming194.8 sProposedGrowth model1 × 16-LinearGain fine-tuning<10 ms


## 4.1. Training Strategy

Taking the 1 × 16 linear array antenna as an example to verify the algorithm, BTNet is used to train the gene parameters of the growth model of each array element, and the Adam optimizer is used in the training [17]. In the experiment, the data pair θ,s composed of random angles and gain change values is used as the optimization target pattern, and the improved genetic algorithm [16] is used to generate 20,000 sets of data in the format of θ,Gθ,s,∂W, in which the ratio of s>0 to s<0 is 1 : 1. BTNet is trained with 8000 sets of data, and 2000 sets of data are used for validation. Set the number of training times (epochs) to 400 and batch size to 100, and use the CPU version of TensorFlow 1.8.0 for simulation. In order to improve the efficiency of training, the transfer learning [18] strategy is adopted in training. Except that the initial weights are randomly generated in the first training, the weights trained in the previous training are used as the initial weights in the rest of the training. For the 1 × 16 linear array antenna, in order to obtain 2 sets of gene parameters of the growth model of each array element, BTNet was used for 32 times of training. Under the condition of Intel(R) Core(TM) I5-7300HQ CPU @ 2.50 GHz processor and 8 Gb memory, the first training takes about 7 minutes, and the rest training takes about 1 minute and 27 seconds on average due to the strategy of transfer learning.


## 4.2. Experimental Results of Growth Genes

Under the condition of 20000 sets of data, BTNet was used to train the growth model of 1 × 16 linear arrays, and the obtained 192 positive growth gene parameters and negative growth gene parameters are shown in Tables1 and 2, respectively.Table 1
1 × 16 linear array positive growth gene parameters.
a0a1a2a3a4a5b0b1b2b3b4b5n = 100.1151340.0067190.0003410.0000900.00001010.0072260.0004440.0000880.0000140.000072n = 200.1151410.0066950.0002990.0000880.00007210.0072900.0004990.0000530.0000700.000020n = 300.1151330.0067040.0003000.0000580.00009010.0072610.0004720.0001060.0000810.000058n = 400.1151480.0066540.0003390.0000130.00004910.0072170.0005080.0000910.0000500.000047n = 500.1151360.0066980.0002540.0000170.00005210.0072100.0004920.0001020.0000720.000015n = 600.1151960.0066820.0003470.0000750.00008010.0072450.0004530.0001030.0000080.000013n = 700.1151470.0066690.0003330.0000900.00000610.0072400.0004630.0000620.0000660.000063n = 800.1151590.0066730.0002520.0001080.00001710.0072110.0004470.0000400.0000490.000034n = 900.1152250.0067220.0002550.0000840.00002710.0072420.0004650.0001140.0000420.000098n = 1000.1151600.0067000.0003170.0000640.00007010.0072670.0004280.0000330.0001000.000017n = 1100.1151330.0066860.0003380.0000770.00001910.0072370.0004560.0001180.0000160.000086n = 1200.1151940.0066680.0002690.0000530.00004810.0072120.0004690.0000430.0000380.000058n = 1300.1151550.0066590.0003120.0000370.00008210.0072980.0004830.0000540.0000580.000011n = 1400.1152210.0067180.0003320.0000360.00005910.0072020.0004530.0000510.0000160.000018n = 1500.1151720.0066390.0003100.0000570.00007010.0072700.0004740.0000230.0000070.000032n = 1600.1151830.0066950.0002910.0000920.00007210.0072970.0004630.0000530.0000110.000061Table 2
1 × 16 linear array negative growth gene parameters.
Genea0a1a2a3a4a5b0b1b2b3b4b5n = 100.115199−0.0065740.000290−0.0000040.00007810.0072340.0004710.0000940.0000100.000013n = 200.115185−0.0065810.0003390.0000700.00007310.0072050.0004170.0000290.0000800.000094n = 300.115198−0.0066170.0003220.0000010.00001210.0072640.0004430.0000850.0000750.000058n = 400.115204−0.0066070.0003230.0000870.00008710.0072090.0004470.0000570.0000690.000060n = 500.115209−0.0065930.000271−0.0000010.00007710.0072210.0004490.0000750.0000230.000064n = 600.115178−0.0066150.0003280.0000000.00002910.0072240.0004630.0000290.0000410.000010n = 700.115141−0.0065520.0002790.0000500.00009610.0072430.0004790.0000960.0000430.000066n = 800.115141−0.0065370.0002690.0000170.00008010.0072490.0004870.0000600.0000270.000004n = 900.115197−0.0065870.0002950.0000510.00000610.0072320.0004870.0000900.0000130.000013n = 1000.115139−0.0066290.0002920.0000560.00007210.0072530.0004210.0000830.0000130.000013n = 1100.115140−0.0066160.0002670.0000100.00003210.0072320.0004320.0000450.0000890.000070n = 1200.115186−0.0066120.000271−0.0000020.00009110.0072710.0004660.0000510.0000170.000062n = 1300.115229−0.0066130.0002760.0000300.00000710.0072680.0004500.0001180.0000400.000062n = 1400.115145−0.0065920.0002660.0000660.00008710.0072350.0004790.0000490.0000530.000083n = 1500.115190−0.0065960.0002800.0000350.00004210.0072360.0004660.0000940.0000420.000043n = 1600.115142−0.0066280.0002790.0000220.00006510.0072960.0005040.0000660.0000240.000076The gene parameters in this table are applicable to the 1 × 16 linear array antenna of any antenna element structure. By using the growth model to fine-tune the gain at any angle on the radiation pattern, the corresponding excitation of each array element can be calculated quickly.


## 4.3. Experimental Verification of Beam Fine-Tuning

The antenna structure and unit structure of the 1 × 16 linear arrays used to verify the growth gene algorithm are shown in Figure4 and Figure 5. The antenna unit adopts a patch structure with a length of 37.26 mm and a width of 28 mm. The unit spacing is d, feeding from the coaxial line, and the feeding point is located 7 mm above the center of the patch antenna. The relative dielectric constant and thickness of substrate FR4 are 4.4 and 1.6 mm respectively. The working frequency of the antenna is 2.45 GHz, and the working air wavelength is λ = 122 mm. Figure 6(a) shows a flat-topped beam pattern of the 1 × 16 array antenna under the condition of array spacing d = 0.5λ. The amplitude and phase of the excitation corresponding to the flat-topped beam pattern are shown in Table 3.Figure 4
1 × 16 linear array antenna.Figure 5
Patch antenna element.Figure 6
(a) The flat-topped beam pattern of the 1 × 16 antenna array under the condition of array spacingd = 0.5λ and gain G(θ) = 8 dBi at angle θ = 18°(b) the fine-tuned pattern has a gain of 5dBi at θ = 18°, which is 3 dB lower than the original flat-topped beam pattern; (c) the fine-tuned pattern has a gain of 11dBi at θ = 18°, which is 3 dB higher than the original flat-topped beam pattern. The random pattern of the 1 × 16 array antenna with array spacing d = 0.5λ was taken as the initial pattern, and the growth model was used to carry out continuous fine-tuning of the side lobe gain at θ = –33° with equal step size; (d) the general view of pattern tuning; (e) the detail view; (f) the cosecant squared pattern designed using the growth model, the coverage range of the formed pattern is -31°∼31°, and the maximum gain direction is θ = 17°.
(a)(b)(c)(d)(e)(f)Table 3
The excitation corresponding to the flat-top beam.
NumAmplitude (V)Phase10.803040deg22.63950deg33.63520deg45.1516−180deg517.3215180deg66.1928−180deg728.77320deg835.57390deg919.9924180deg1088.6058−180deg11100−180deg1257.2576−180deg1314.716180deg140.683840deg150.993590deg160.140010degAs shown in Figure6(a), the gain of the flat-topped beam pattern at θ = 18° is 8dBi. In the experiment, the growth model trained by BTNet is used to fine-tune the gain at this angle by decreasing 3 dB and increasing 3 dB, respectively. The corresponding excitation of each array element calculated by the growth model is shown in Table 4. The electromagnetic simulation software CST is used to simulate the excitation in Table 4, and the simulation results are shown in Figure 6(b) and Figure 6(c), respectively. It can be observed that the gains of the fine-tuned beam pattern at θ = 18° are 5dBi and 11dBi, respectively, indicating that the growth model is very accurate for the fine-tuning pattern at any angle.Table 4
The excitation after gain fine-tuning.
NumGain decreased by 3 dBGain increased by 3 dBAmplitudePhaseAmplitudePhase14.672 V167.6122deg8.4425 V−9.5788deg24.0511 V−105.728deg9.5885 V34.7518deg37.2696 V−48.0397deg7.8159 V75.7985deg42.2398 V−100.0909deg12.2195 V165.3479deg513.9121 V167.903deg22.9001 V−169.7203deg68.3639 V138.906deg9.7894 V−128.0798deg726.1478 V7.2343deg33.0671 V−8.0232deg832.3632 V−3.1515deg40.2185 V3.5551deg923.1728 V−166.7736deg18.0008 V155.6163deg1090.0087 V−177.3203deg86.9729 V176.1113deg11100V179.685deg100V−179.5584deg1257.9555 V175.2204deg56.9624 V−173.1756deg1318.6731 V164.7761deg12.2061V−145.7311deg144.7879 V171.4933deg8.3389 V−6.8373deg154.8673 V−122.5324deg8.3516 V43.5287deg165.5395 V−74.6664deg7.6825 V102.9145degFigure6(d) and Figure 6(e) show the results of continuously fine-tuning the side lobe gain of the 1 × 16 linear array antenna at θ = -33° with 0.5 dB steps using the growth model. It can be found that using the growth model to fine-tune the side lobes of the antenna radiation pattern will not affect the gain of the main lobe of the pattern and vice versa. This conclusion is also verified in Figure 6(b) and Figure 6(c).The fine-tuning of the gain at any angle by the above growth model takes an average of less than 10 ms, which verifies the high efficiency of the growth gene algorithm for fine-tuning patterns, which is convenient for real-time application in engineering. Table5 shows the comparison of the computational times between the growth model and some beamforming algorithms in the literature. The growth model uses G (θ) (in dBi, the original gain at the angle θ) and s (in dB, the expected gain change at the angle θ) as inputs, where s is the step size of beam fine-tuning.Table 5
Comparison of the growth model with different algorithms.
Year/RefAlgorithmAntenna arrayOptimization objectivesComputational time[2020]/[5]Generic algorithm10-circularBeamforming110 s[2015]/[6]Model order reductionRectangularBeamforming644 s[2020]/[7]Invasive weed optimization10-circularBeamforming114.5 s[2019]/[8]Particle swarm optimization8 × 1 PatchBeamforming31.7 s[2019]/[8]Firefly algorithm8 × 1 PatchBeamforming55.4 s[2019]/[8]Taguchi’s method8 × 1 PatchBeamforming194.8 sProposedGrowth model1 × 16-LinearGain fine-tuning<10 ms


## 5. Experimental Verification of Cosecant Squared Beamforming

The beamforming of the array antenna can be achieved by fine-tuning the gain at multiple angles of the array radiation pattern using the growth model. In the experiment, the cosecant squared pattern with the pattern coverage range of −30° to 30° and the maximum gain direction of 16° to 18° is taken as the target, and the growth model is used to synthesize the beam pattern. The corresponding excitation of each element calculated by the growth model is shown in Table6, and the radiation pattern simulated by using this excitation is shown in Figure 6(f).Table 6
The excitation corresponding to the cosecant squared.
NumAmplitude (V)Phase15.7913126.8469deg210.8134−166.273deg314.2734−102.7381deg422.9186−40.2313deg526.716714.9124deg637.070887.1692deg754.3422138.6947deg85.7913126.8469deg958.1583−168.3989deg1075.653−107.6462deg11100−69.8895deg1290.6976−45.7976deg1348.0395−23.0731deg148.226947.2888deg1516.8154166.8038deg1613.9234−158.1047degAs can be seen from Figure6(f), the coverage range of the formed beam pattern is −31° to 31°, and the maximum gain direction is 17°, which well meets the design requirements of the cosecant squared pattern. Moreover, compared with the complex steps needed to be performed when using the optimization algorithm to perform the beamforming, the growth gene algorithm only needs to input the original gain Goriθ and the expected gain change s at the corresponding angle θ into the growth model to calculate the excitation corresponding to the target pattern. It reduces the difficulty for antenna designers to implement high-precision beamforming.


## 6. Conclusions

In this paper, a beamforming algorithm, called the growth gene algorithm, which imitates plant growth genes, is proposed. By establishing the growth model, the algorithm can fine-tune the gain of the antenna radiation pattern at any angle to achieve high efficiency and accurate beamforming of the target pattern. By fine-tuning multiple angles of the radiation pattern of 1 × 16 linear arrays, the cosecant square beamforming with a coverage range of −31° to 31° and maximum gain direction of 17° is realized. The process of fine-tuning the gain of the growth gene algorithm only involves simple matrix multiplication and addition operations, so the complexity of achieving precise beamforming is low. The growth model is only related to the gain value before and after the gain fine-tuning and the angle of the gain fine-tuning, but not to the array spacing and the array element radiation pattern. Therefore, these gene parameters can be applied to other 1 × 16 linear array antennae. More importantly, the growth gene algorithm proposed in this paper can be easily extended to the beamforming of area array antennas.



---

*Source: 6987814-2022-11-04.xml*