Abstract

An integrated optimization of sum and difference beam for time-modulated linear antenna array is studied in this paper. The goal of sum and difference beam synthesis is to generate sum beam in the main band and difference beams in the first-order sideband with low side-lobe level through timing switches. The turn-on times of antenna array are achieved by solving a quadratic constraint linear programming; meanwhile, the opening times are optimized by particle swarm optimization algorithm. The results of linear array show that the sum and difference beam can be scanned within degrees, with lower peak side-lobe level.

1. Introduction

Monopulse technology is a tracking method which is developed and widely used in the late 1950s. It is further adapted in a radar system, named monopulse radar [1]. Monopulse radar antenna needs to generate a main lobe sum beam and a difference beam with two main lobes. The function of the sum beam is to detect the target distance and carry out distance tracking, and the function of the difference beam is to detect the target azimuth and elevation angle information and carry out angle tracking [2]. Then, by comparing with the information obtained by the sum and difference beam, the spatial position of the target is determined [3]. If the target is exactly in the direction of the maximum value of the sum beam, the signal received by the difference beam is extremely weak. When the target moves, the signal received by the difference beam changes from weak to strong and the difference signal can be used to drive the servo mechanism to make the antenna rotate in elevation or azimuth so that the zero value direction of the difference beam is always aligned with the target track [4]. Monopulse radar has the advantages of high tracking accuracy, unlimited range, great potential for data rate, and outstanding antijamming performance. However, it can only be used for multibeam antennas, and the beam must be shaped.

In 1963, Kummer et al. first proposed a variable aperture size (Variable Aperture Sizes, VAS) time modulation method and applied it to an array antenna to achieve low/ultralow side lobe [5]. Reyna presents a new research in the field of timed antenna arrays. The study proposes the synthesis of timed antenna array for arbitrary-shaped beam energy patterns. By using the well-known particle swarm optimization to obtain low side-lobe patterns, the results show that the timing antenna array can provide accurate beam energy patterns of any shape [6]. Reyna presents the synthesis of a conformal timed array for optimum energy patterns during beam scanning by the particle swarm optimization and simulates and verifies the semicylindrical array [7]. Garza presents the synthesis of time-domain circular antenna arrays for a flat-top energy pattern through the use of multiobjective optimization differential evolution (DEMO), comprehensive consideration of the best real-time excitation delay, and the best excitation amplitude optimization to obtain a good performance circular antenna array pattern [8]. Mahanti proposes a real-coded genetic algorithm (GA) for the optimal design of a reconfigurable dual-beam linear time-modulated array antenna that only uses phase control. The amplitude distribution will generate a pencil beam with zero phase and a flat-top beam with a continuously controllable phase analog phase shifter Alberto Reyna presents new designs of time-modulated antenna arrays for circularly polarized shaped beams. The time switching sequence of the elements optimized by the particle swarm algorithm is designed to design the array while maintaining a uniform amplitude. At the same time, two design examples of the circular polarization flat top and the equal-pass pattern are given [10]. Through a suitable strategy based on multiobjective particle swarm optimization, the problem of minimizing power loss in the time modulation array is solved by Poli [11].

Pal proposes a multiobjective optimization (MO) framework for designing time-modulated linear antenna arrays. The maximum side-lobe level, the main lobe beam width between the maximum sideband level, and the previous null are regarded as three simultaneous realizations. For different goals, the evolutionary algorithm using the most goals can determine the best compromise between these three goals. This provides greater flexibility in the design, and users can choose a solution that obtains an appropriate compromise as the final result [12].

In 1959, Shanks discovered the central frequency band, and the first-order sideband can be used to synthesize the sum beam and the difference beam, and it was applied to beam scanning since 1961. This is also the first time that time modulation technology has been applied to the electrical beam scanning of an array antenna without a phase shifter [13]. Tennant and his team proposed a two-element time modulation array in the United Kingdom. By adjusting the timing loaded on the two elements, the sum beam is synthesized at the center band and the difference beam is synthesized at the first-order sideband, which can be used for wide-angle targets’ direction estimation [14] and experimental verification of this theory [15]. Recently, algorithms widely used in the synthesis of sum and difference beams include adaptive beamforming [1618], evolutionary algorithms such as genetic algorithms [19], particle swarm optimization algorithms [20], and differential evolution algorithms, and their hybrid changes [21]. However, we noticed that the computational cost of the above heuristic method is higher and the convergence speed is slow. Therefore, people have begun to use convex optimization algorithms for antenna pattern synthesis. The obstacle is how to convert the nonlinear problem into a convex problem or decompose the original problem into a combination of convex and nonconvex problems. In order to solve the nonconvex optimization problem, Fan et al. first used the variant penalty to transform the original constrained optimization problem into an unconstrained nonsmooth and then used a smooth function to approximate the nonsmooth component to obtain a smooth unconstrained optimization. The problem then can be solved by the steepest descent, with precise control of different beam patterns [22]. Kwak proposed a linear programming method which simplifies the antenna system of monopulse radar by attaching a common weight (for summing beam and difference beam) to each antenna. It is computationally efficient and does not require slow global optimization techniques [23]. Dorsey proposed an A second-order cone program (SOCP) method to synthesize beams with azimuth and difference characteristics from a uniform circular array and perform electromagnetic simulation [24]. Yang Shiwen’s team in China introduced the equivalent phase weighting into the time modulation technology, and the center band beam scanning and beamforming are realized without the phase shifter and attenuator [25]. Kwak proposed a new technique for finding disjoint and completely covering weight vector sets in 2019. Each weight vector set forms a sparse subarray to form a single beam. Our algorithm decomposes the original nonconvex optimization problem into the problem of finding disjoint weight vectors [26]. Morabito proposed a new synthetic one-dimensional reconfigurable sparse array method, which can generate summation and difference power patterns. Only the phase shift is required to switch the half-array between the two radiation modes and the sparsity of the array layout can be achieved by appropriately using the principle of compressed sensing [27]. In addition to algorithmic improvements, many people have conducted research on hardware aspects such as antenna design and optimized the sum and difference beam pattern [2, 2830].

However, nowadays, people have adopted symmetrical array element timing correlation in the research of sum and difference beams. This symmetric method needs to limit the timing switch, and there is no lower side-lobe level when the beam is scanned. The purpose of this paper is to use the PSO-CVX algorithm to synthesize the sum-and-difference beam. The turn-on times of antenna array are achieved by solving a quadratic constraint linear programming; meanwhile, the opening times are optimized by particle swarm optimization algorithm, which greatly improves the time efficiency. Compared with the traditional phased array, only time modulation controls the on-off of the sequential switch and no power divider and phase shifter is required, which greatly simplifies the system complexity and reduces the cost of hardware production. And, the sum and difference beams synthesized by this algorithm also have low side-lobe when scanning within ±40°.

The structure of this paper is arranged as follows. Section 2 introduces the basic mathematical model of equal excitation uniform time modulation linear array and the sum-and-difference beam. In Section 3, the PSO-CVX algorithm will be explained in details; besides, the process of using PSO-CVS algorithm to solve the mathematical model will also be presented. In Section 4, by listing, the performance and result of sum-and-difference beam during scanning are provided to verify the effectiveness of the proposed algorithm. Finally, conclusions are drawn in Section 5.

2. Mathematical Model

In Figure 1, without considering the element coupling, the radiation intensity of the uniformly excited uniform linear array is [31]where is the radiation direction, is the number of elements, is the carrier frequency, , is the wavelength, is the speed of light, and is the position of the element.

Introduce the ideal rectangular pulse switch function [32] which is shown in Figure 2, and its mathematical expression iswhere is the step function, is the channel opening time, and is the channel keep open time. Thus, the far-field radiation intensity of the linear array based on the time modulation technology is

Fourier expansion of the rectangular pulse switching function iswhere , is the time modulation period, and is the harmonic excitation.

The far-field radiation intensity of the m-order sideband can be obtained as

The expansion coefficient of the order sideband of the sequential switch of the element is

Schematic diagram of sum and difference beam pattern is shown in Figure 3, and the goal of sum-and-difference beam synthesis is to form a sum beam in the main frequency band through the switching timing of the array elements, form a difference beam on the first-order sideband, and improve the performance of the sum and difference beam, that is, under normalization of the peak level of the main band. (1) The maximum side-lobe level of the main band is the smallest. (2) Side-lobe radiation on the first-order sideband is less than the constraint value . (3) The first-order sideband produces a null in the main radiation direction, which is smaller than the constraint value . (4) The first-order sideband produces a difference beam, that is, the radiation level is equal to the constraint value in the direction of the difference beam and . The mathematical model of sum and difference beam pattern synthesis is obtained by analysis aswhere and are the expansion coefficient vectors, is main band side-lobe area, is the steering vector of the side-lobe sampling angle of the main band, is the first-order sideband side-lobe area, is the steering vector of the first-order side-lobe sampling angle, is the steering vector in the beam direction , and is the steering vector in the direction of the difference beam .

3. PSO-CVX Algorithm

In equation (7), the optimization model optimizes the main frequency band, first-order sideband main lobe, and side-lobe levels. It is a nonlinear optimization problem. We propose an optimization algorithm based on PSO-CVX to solve this nonlinear optimization problem.

When , from equation (6), we can get ; thus, the electric field strength of the main frequency band is

For the electric field of the main frequency band, is a common factor and can be omitted. When is known, is a linear function of . The main frequency band and beamforming problem is a subproblem of the optimization problem of formula (7), which can be expressed as

The global optimal solution of can be obtained by convex optimization algorithm. Introducing the slack variable with side-lobe level constraint , convert the minimum-maximization problem of formula (9) into an inequality constrained optimization problem:

Let the variables in space , , , , , and ; thus, equation (10) is transformed into a standard form of Quadratic Constraint Linear Programming (QCLP):

The CVX toolbox can be used to obtain the global optimal solution of , thereby obtaining the global optimal solution of .

When , from equation (6), When is known, it is a certain value, so the first-order sideband electric field intensity is

For the first sideband electric field, is a common factor and can be omitted. is a nonlinear function with respect to . So, the first-order sideband difference beamforming problem can be converted into a single-objective optimization problem, as shown in Figure 4.

It is required that the sum of errors between the formation of the pattern and the given pattern is the smallest and expressed as

We use particle swarm algorithm to find the best opening moment and use N-dimensional particles to represent . The fitness function of particle swarm optimization is

The optimization goal is to minimize .

In each iteration, the particle velocity and position update formula of the PSO algorithm iswhere are the velocity and position of the dimension of the particle in the th iteration, shrinkage factor , are learning factors, is the historical optimal value for each particle, is the particle global optimal value, and is a random number of .

The processing flow of the PSO-CVX algorithm is given below, and the flowchart of the PSO-CVX algorithm is shown in Figure 5:(1)Give the number of array elements, element position, beam width, difference beam shape, and angular sampling interval.(2)Initialize the dimensions of the particle swarm and the initial velocity of the particles, and give the maximum number of iterations.(3)Calculate steering vector.(4)Calculate the optimal opening time of each array element through the convex optimization algorithm.(5)Use PSO algorithm to optimize switch opening time:(a)Calculate the fitness function value.(b)Update the global optimal solution and historical optimal solution at the moment of opening.(c)If the maximum number of iterations is reached, execute (5), otherwise execute (e).(d)The iteration counter is incremented by 1.(e)Update the opening time and execute (a).(6)End the iteration and get the optimized sum and difference beam pattern.

4. Simulation Results

4.1. Performance Analysis of Sum and Difference Beam Pattern

In order to verify the correctness and effectiveness of the PSO-CVX algorithm optimization and the difference beam pattern, simulations are carried out and compared with the literature [18, 20, 33]. The basic parameters of the array are shown in Table 1. The constraint value is set to .

The PSO algorithm parameter settings are shown in Table 2.

The integrated sum and difference beam pattern is shown in Figure 6. The optimized sum beam width is , difference beam width is , the peak side-lobe level of the main band is , and the first-order sideband side-lobe peak level is .

Table 3 shows the comparison of the pattern parameters of this article and the literature [18, 20, 33].

Comparing with literature [18], it can be seen that when the peak level of the side lobe is the same as that of the beam side lobe, the peak of the side lobe of the difference beam is reduced, and the beam width is obviously narrowed to . Compared with literature [20], the peak side-lobe of the difference beam is higher, but the difference beam width is reduced by . However, the peak side-lobe of the sum beam is significantly reduced by , and the sum beam width is narrowed. Compared with literature [33], when the beam width is the same as that of the beam, the peak side-lobe of the beam is reduced by, the peak of the side-lobe of the difference beam is reduced, and the beam width is reduced by .

Literature [18, 20, 33] uses the method of symmetric array element timing delay to reduce the dimension. In this paper, the convex optimization algorithm is introduced to directly obtain the opening time of each array element, which reduces the dimensionality of the optimization problem and does not require conditions related to the timing of symmetric array elements. The optimized timing switch is shown in Figure 7. The specific data of optimized timing switch are shown in Table 4.

In this paper, based on the convex optimization algorithm, the global optimal solution of the turn-on time of the array element timing switch is obtained under the condition of the beam constraint, only the PSO algorithm is used to solve the turn-on time, which reduces the computational complexity and the number of iterations is significantly reduced, as shown in Figure 8, and converged in 58 iterations. The literature [20] only converged after 2000 iterations, and the literature [33] only converged after 820 iterations.

4.2. Performance Analysis of Sum and Difference Beam Angle Scanning

Literature [18, 33] can only generate sum and difference beams in a fixed direction and cannot perform angle scanning. The beam scanning experiment was carried out in literature [20]. Through the algorithm in literature [20], the peak level of the main band is −21.6 dB and the peak level of the first-order sideband is −20 dB when the beam is pointing at . In order to verify the radiation performance of the algorithm in this paper during beam scanning, the following experiments are carried out by changing the beam direction.

Let . When the beam is scanned, the performance of the sum and difference beams decreases, and the constraint value is relaxed. Let perform simulation to get the changed sum and difference beam as shown in Figure 9. The sum and difference beam synthesized by the algorithm in this paper can be scanned. As increases, the peak level of the main frequency band and beam side-lobe gradually increases and the peak level of the first-order sideband difference beam side-lobe and null value also gradually increases. The specific parameters are given in Table 5. Compared with the literature [20], when the first-order sideband peak level is basically the same, the main frequency band peak level decreases by 3.4 dB at .

During change, , the simulation diagram of the sum and difference beam is shown in Figure 10. At this time, the beam side-lobe peak is and the first-order sideband side-lobe peak level is , which cannot produce a null in the radiation direction to form a difference beam.

It can be seen from the simulation results that the sum and difference beams synthesized by the local algorithm have a good effect when scanning within .

5. Conclusion

This paper proposed a PSO-CVX algorithm to synthesize the sum and difference beams and to scan in . Our basic idea is to combine the main band synthesis and beam with the convex optimization algorithm to optimize the optimal turn-on time of each element, synthesize the difference beam in the first-order sideband, and optimize the optimal opening time of each element through the PSO algorithm. The time-only modulation used in this article does not require phase shifters and power dividers, which extremely reduces the system complexity. As an example, this paper simulates a 16-element linear array. The simulation results show the effectiveness of the algorithm. Compared with other algorithms, the algorithm in this paper greatly improves the time efficiency. Compared with the reference, when the main lobe width remains the same, the peak side-lobe level of the main band drops by 10 dB, and while the width of the main lobe of the first-order sideband is narrowed, the peak side-lobe level is reduced by 0.4 dB. Meanwhile, it does not require the timing-related properties of symmetrical elements. Last but not the least, it can still maintain good beam performance when scanning at a larger angle. We will further optimize our model and expand the algorithm into the area array and circular array.

Data Availability

The data used to support the findings of this study are available from the corresponding author upon request.

Conflicts of Interest

The authors declare that there are no conflicts of interest regarding the publication of this paper.

Acknowledgments

This work was supported by the National Natural Science Foundation of China (Grant no. 61671239) and Fundamental Research Funds for the Central Universities (Grant nos. Kfjj20200417 and Kfjj20200412).