Antenna array synthesis method and device based on Taylor distribution and Kirchhoff circle

Abstract

The present invention provides an antenna array synthesis method and device based on Taylor distribution and Kirchhoff circle, belonging to the field of radar antenna technology. The method comprises: determining the initial excitation coefficients and initial array zero positions of array elements using the Taylor distribution function according to array synthesis requirements, thereby obtaining an initial radiation pattern with sidelobe suppression and mainlobe characteristics; converting the initial array zero positions to the Kirchhoff unit circle; identifying the zero positions to be optimized in the area to be optimized based on the principle of Kirchhoff unit circle; and fine-tuning the zero positions to be optimized using a genetic algorithm; and calculating the excitation coefficients of the array elements corresponding to the specific zero positions after fine-tuning, replacing the initial excitation coefficients, and obtaining the final array element excitation coefficients. The present invention achieves fine optimization of the antenna array radiation pattern and completes rapid beamforming, multi-beam, and adaptive interference suppression for the antenna array.

Description

Technical Field

[0001] The present invention belongs to the technical field of radar antennas, and in particular relates to an antenna array synthesis method and device based on Taylor distribution and Kirchhoff circle. Background Art

[0002] As radar technology develops towards miniaturization and integration, traditional array synthesis methods have exposed many shortcomings when dealing with complex application scenarios and are unable to meet the growing and diverse needs. Especially in scenarios such as satellite platforms with strict space and energy constraints, array synthesis methods need to meet higher requirements in terms of computational efficiency and accuracy.

[0003] Currently, common array synthesis methods include analytical methods, optimization algorithms, and methods based on specific distributions. While the Fourier transform method, among analytical methods, has a simple theoretical basis, it is difficult to obtain an accurate analytical expression for complex beam shapes, limiting its scope of application. While the Woodward synthesis method performs well in the shaped region, it is ineffective in controlling sidelobe levels in the non-shaped region, impacting radar system performance. Among optimization algorithms, direct search methods such as Powell's are computationally fast but prone to local optimal solutions, affecting beamforming effectiveness. Intelligent search methods such as genetic algorithms, while capable of global search, are computationally slow and struggle to balance objectives in multi-objective optimization. The Taylor array synthesis method, based on specific distributions, can effectively suppress sidelobe levels and control mainlobe shape, but it is highly dependent on parameter settings, has significant limitations in irregular arrays, and lacks flexibility.

[0004] In summary, existing array synthesis technologies have limitations to varying degrees in complex beamforming, sidelobe level control, computational efficiency, and multi-objective optimization balance, making it difficult to meet the diverse needs of modern radar systems in complex scenarios. Summary of the Invention

[0005] To address the above technical issues, the present invention proposes a method and device for antenna array synthesis based on the Taylor distribution and Kirchhoff circle. Combining the characteristics of the Taylor distribution function and Kirchhoff circle, the Taylor distribution is first used to achieve preliminary sidelobe suppression and mainlobe optimization. Kirchhoff polynomials are then used to fine-tune the radiation pattern, optimizing key parameters such as sidelobe level and mainlobe shape. Combining the systematic nature of the Taylor array synthesis method with the fine-tuning capabilities of the Kirchhoff unit circle, the present invention is suitable for radar systems requiring high target detection accuracy and anti-interference capabilities, as well as the design and application of high-precision radar antennas.

[0006] In order to achieve the above object, the present invention adopts the following technical solutions:

[0007] The antenna array synthesis method based on Taylor distribution and Kirchhoff circle includes the following steps:

[0008] Step 1: According to the array synthesis requirements, the Taylor distribution function is used to determine the initial excitation coefficients of the array elements and the initial array zero position, and an initial radiation pattern with sidelobe suppression and mainlobe characteristics is obtained;

[0009] Step 2: convert the initial array zero point position determined in step 1 to the Kirchhoff unit circle, identify the zero point position to be optimized in the area to be optimized based on the principle of Kirchhoff's unit circle, and use a genetic algorithm to fine-tune the zero point position to be optimized;

[0010] Step 3: Calculate the array element excitation coefficient of the array element corresponding to the fine-tuned zero point position obtained in step 2, replace the initial excitation coefficient in step 1, and obtain the final array element excitation coefficient to achieve fine optimization of the antenna array radiation pattern and complete fast beamforming, multi-beam and adaptive interference suppression of the antenna array.

[0011] The present invention also provides an antenna array synthesis device based on Taylor distribution and Kirchhoff circle, comprising the following modules:

[0012] The initial pattern acquisition module uses the Taylor distribution function to determine the initial excitation coefficients of the array elements and the initial array zero position according to the array synthesis requirements, and obtains the initial pattern with sidelobe suppression and mainlobe characteristics;

[0013] The fine-tuning module converts the initial array zero point position to Kirchhoff's unit circle, identifies the zero point position to be optimized based on the principle of Kirchhoff's unit circle, and uses the genetic algorithm to fine-tune the zero point position to be optimized;

[0014] The fine-tuning optimization module calculates the array element excitation coefficients corresponding to the fine-tuned zero point position, replaces the initial excitation coefficients in step 1, and obtains the final array element excitation coefficients, thereby achieving fine optimization of the antenna array radiation pattern and completing fast beamforming, multi-beam, and adaptive interference suppression for the antenna array.

[0015] The present invention also provides an electronic device, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein when the processor executes the program, the steps of the antenna array synthesis method based on Taylor distribution and Kirchhoff circle are implemented.

[0016] The present invention also provides a non-transitory computer-readable storage medium having a computer program stored thereon. When the computer program is executed by a processor, the steps of the antenna array synthesis method based on Taylor distribution and Kirchhoff circle are implemented.

[0017] Compared with existing array synthesis methods, the present invention has precise sidelobe control capabilities and flexible mainlobe shape optimization, with the following specific beneficial effects:

[0018] The present invention achieves a significant improvement in the performance of the antenna array by combining the advantages of the Taylor distribution function and the Kirchhoff unit circle. On the one hand, the Taylor distribution function effectively reduces the sidelobe level by optimizing the array element excitation coefficient and the zero point distribution, especially in the area close to the main lobe. On this basis, the Kirchhoff unit circle can further fine-tune the sidelobe and optimize the sidelobe level at a specific angle, thereby surpassing the traditional technology of a single method in terms of the accuracy and flexibility of sidelobe control. On the other hand, the Taylor distribution function can determine the array element excitation coefficient and the zero point distribution according to the sidelobe level requirements, while the Kirchhoff unit circle further optimizes the width and gain of the main lobe by adjusting the radial and angular position of the zero point, while maintaining the stability of the sidelobe level. This combination not only improves the sidelobe control capability, but also enhances the flexibility of the mainlobe shape optimization, solving the problem that conventional methods are difficult to take into account. BRIEF DESCRIPTION OF THE DRAWINGS

[0019] Figure 1 This is a schematic diagram of the iteration of the direct genetic method;

[0020] Figure 2 Schematic diagram of the shaping iteration of the antenna array synthesis method based on Taylor distribution and Kirchhoff circle of the present invention;

[0021] Figure 3 This is a comparison chart of the cosecant square shaping results;

[0022] Figure 4 This is a schematic diagram of interference suppression iteration in direct genetic method;

[0023] Figure 5 Schematic diagram of interference suppression iteration of the antenna array synthesis method based on Taylor distribution and Kirchhoff circle of the present invention;

[0024] Figure 6 This is a comparison chart of adaptive interference suppression results;

[0025] Figure 7 A flowchart of the antenna array synthesis method based on Taylor distribution and Kirchhoff circle of the present invention;

[0026] Figure 8 Schematic diagram of the antenna array synthesis device based on Taylor distribution and Kirchhoff circle of the present invention. DETAILED DESCRIPTION

[0027] In order to make the objectives, technical solutions and advantages of the present invention more clearly understood, the present invention is further described in detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only intended to illustrate the present invention and are not intended to limit the present invention. In addition, the technical features involved in the various embodiments of the present invention described below may be combined with each other as long as they do not conflict with each other.

[0028] The Taylor array synthesis method primarily uses a specific Taylor distribution function to design array element excitation coefficients to suppress antenna pattern sidelobe levels and optimize mainlobe characteristics. The Kirchhoff unit circle (Schelkunoff unit circle) optimizes the antenna pattern shape and sidelobe levels by controlling the zero position on the unit circle. This invention combines the Taylor distribution function with Kirchhoff polynomials to provide an antenna array synthesis method based on the Taylor distribution and Kirchhoff circle. Figure 7 As shown, the following steps are included:

[0029] Step 1: According to the array synthesis requirements, the Taylor distribution function is used to determine the initial excitation coefficients of the array elements and the initial array zero position, and an initial radiation pattern with sidelobe suppression and mainlobe characteristics is obtained;

[0030] Step 2: convert the initial array zero point position determined in step 1 to the Kirchhoff unit circle, identify the zero point position to be optimized in the area to be optimized based on the principle of Kirchhoff's unit circle, and use a genetic algorithm to fine-tune the zero point position to be optimized;

[0031] Step 3. Based on step 2, calculate the excitation coefficient of the array element corresponding to the specific zero point position after fine-tuning obtained in step 2, replace the initial excitation coefficient corresponding to step 1, and obtain the final array element excitation coefficient to achieve fine optimization of the antenna array radiation pattern and complete the fast beamforming, multi-beam and adaptive interference suppression of the antenna array.

[0032] Specifically, in step 1, determining the initial excitation coefficient of the array element using the Taylor distribution function includes:

[0033] The Taylor distribution function is obtained based on the mathematical analysis and approximation of the ideal radiation pattern. Its purpose is to design the excitation coefficient through a special function form (Formula (2)) so that the antenna array radiation pattern meets the desired sidelobe level and mainlobe characteristics.

[0034] For an N-element uniform linear array, the far-field array factor The expression is:

[0035] (1)

[0036] Where N is the number of units; is the excitation coefficient of the nth array element; j is the imaginary unit; k is the wave number; d is the array element spacing; is the observation angle.

[0037] Assuming the desired sidelobe level is SLL, the Taylor distribution function can be expressed as:

[0038] (2)

[0039] in, is the coefficient related to the array structure; the intermediate parameter for , intermediate parameters . cosh represents the hyperbolic cosine function.

[0040] In order to determine the coefficients related to the array structure , using the normalization condition, that is, the main lobe direction array factor is the largest, we have:

[0041] (3)

[0042] Will Substituting the Taylor distribution expression into , we can get:

[0043] (4)

[0044] Solving this equation, we can get The expression of , thereby determining the excitation coefficient of the nth array element .

[0045] Determining the initial array zero point position using the Taylor distribution function includes:

[0046] According to the characteristics of Taylor distribution, the zero position of the far-field array factor is calculated.

[0047] make ,Right now:

[0048] (5)

[0049] Will Substituting in:

[0050] (6)

[0051] Make the intermediate variable u substitute: , the above formula can be rewritten as:

[0052] (7)

[0053] when When n is an integer, the value of the sin function is ±1 or 0, then n makes When it is close to an integer, The contribution of is large, and this property can be used to solve the zero point position of the array. The solution method of the zero point position is explained in detail below.

[0054] Near the zero point, the far-field array factor Approximate expansion is:

[0055] (8)

[0056] in, for right The derivative of for The minimum value of .

[0057] right Take the derivative and substitute the variables , after mathematical operations, we can get Solving this equation gives us an approximate expression for the zero position. In the common Taylor distribution model, the zero position can be expressed as:

[0058] (9)

[0059] Among them, the intermediate parameters for ; is the working wavelength; is the array length.

[0060] Specifically, in step 2, converting the initial array zero point position determined by the Taylor distribution function to the Kirchhoff unit circle includes:

[0061] Substitution through the variable z: , far-field array factor The result F after variable substitution can be written as:

[0062] (10)

[0063] This polynomial has N-1 complex roots, which can be factored into:

[0064] (11)

[0065] Among them, I N is the magnitude value of the factorization; , is the zero position of the nth array element The conversion corresponds to the value of Kirchhoff's unit circle, where j is the imaginary unit.

[0066] Based on the principle of Kirchhoff's unit circle, the zero point position to be optimized is identified, and the genetic algorithm is used to fine-tune the zero point position to be optimized, including:

[0067] make , and obtain the far-field array factor The formula of the result F after variable substitution is:

[0068] (12)

[0069] Among them, x n z n Real part; y n z n Imaginary part; the intermediate parameter ψ is kdcosθ+β, and β is the array beam pointing parameter.

[0070] During the antenna array synthesis process, identify the zero point position of the area to be optimized and The roots are placed outside Kirchhoff's unit circle, and the sidelobe region The roots are restricted to Kirchhoff's unit circle, and after normalization, the total indivual or Form vector x and obtain intermediate parameters and a function of the vector x If you want to reduce the sidelobe level at a certain position, you need to adjust the zero point position of the sidelobe at that position. or It is added to the vector x, and then the appropriate zero point position is calculated with the help of genetic algorithm to achieve precise control of the sidelobe level and rapid optimization of the mainlobe shape.

[0071] The zero point position after fine-tuning is expressed on Kirchhoff's unit circle as:

[0072] (13)

[0073] in, is the zero position after fine-tuning; The initial zero position after being obtained by Taylor array synthesis method and converted to Kirchhoff's unit circle; It is the optimization adjustment amount of the zero point position.

[0074] Specifically, in step 3, recalculating the excitation coefficient of the array element includes:

[0075] According to the zero point position after fine-tuning , substitute into formula (11), and replace , calculate the result after replacing the far-field array factor variable corresponding to the area to be optimized, expand the result to obtain the array element excitation coefficient of the area to be optimized, replace the initial excitation coefficient in step 1, and obtain the final array element excitation coefficient.

[0076] Example:

[0077] To demonstrate the technical advantages of the proposed method, a digital array antenna was used as an example to simulate and optimize 10-element cosecant squared shaping and 32-element interference suppression, targeting the design requirements of cosecant squared shaping, simultaneous multi-beam, and adaptive interference suppression. Comparison with the optimization results of a genetic algorithm clearly demonstrated the remarkable speed and accuracy of the proposed method.

[0078] (1) Cosecant square shaping and simultaneous multi-beam situation:

[0079] According to the application requirements of a certain type of digital array antenna, the maximum pointing angle of the antenna beam is 1.97°, the beam coverage is 19.83°, and the cosecant square function is used for beamforming to construct the objective function as follows:

[0080] (14)

[0081] Where SLL is the sidelobe level; θ0~θ min is the array antenna beam pointing; θ min ~θ max is the array antenna beamforming angle; the design target θ0 is 1.97°, and the minimum value θ min is 6°, the maximum value θ max It is 21.80°.

[0082] The optimization goal is to minimize the cost function, which is defined as:

[0083] (15)

[0084] Among them, q is the number of sampling points of the cost function; is the sidelobe area error; is the cosecant square area deviation; w1 and w2 are the weights of different errors.

[0085] The present invention uses a genetic algorithm to optimize two parameters within the shaping region, taking 6.637 seconds. In comparison, a direct genetic algorithm optimized 20 parameters across 10 units of amplitude and phase, taking 167.346 seconds. The present invention takes only 3.96% of the time of the direct genetic algorithm.

[0086] Figure 1The iteration of the direct genetic algorithm for the comprehensive design of the cosecant square shaped array is given. It can be seen that the direct genetic algorithm needs more than 1500 generations to complete the array optimization design. Figure 2 As shown, the present invention only requires 30 generations to obtain the design result, which greatly improves the optimization speed of array optimization.

[0087] Array synthesis results are as follows Figure 3 As shown. Figure 3 It can be seen that when the genetic method is directly used, the side lobe of the radiation pattern in the side lobe area reaches -10.0 dB, which cannot meet the side lobe level requirement of -30 dB; and the main lobe is pointed to 0°, which is quite different from the setting of 1.97° of the objective function. This shows that the direct genetic algorithm falls into local convergence and does not converge to the global optimal solution. Compared with the direct genetic algorithm optimization, the main lobe of the optimized radiation pattern of the present invention is pointed to 2° and the side lobe level is -29.1°. The side lobe level does not reach -30dB because only the zero point amplitude of the shaping area is optimized in consideration of the optimization speed.

[0088] Similar to the principle of beamforming, simultaneous multi-beam generation is achieved by using a genetic algorithm to optimize the zero-point amplitude on the Kirchhoff unit circle in the direction where simultaneous multi-beam generation is desired. Compared to directly optimizing twice the number of parameters in the array using a genetic algorithm, this method optimizes only two to three parameters, offering the advantage of faster optimization. Furthermore, by introducing the Taylor distribution function, sidelobe levels are also well controlled.

[0089] (2) Perform adaptive interference suppression:

[0090] Based on application requirements, digital array antennas must not only support simultaneous multi-beam transmission but also possess adaptive interference suppression capabilities. To reduce the computational complexity, a 32-element digital array is simulated. The sidelobe level is -25 dB, the null position is between -22° and -25°, and the null depth is -40 dB. The objective function is constructed as follows:

[0091] (16)

[0092] Where IL is the interference suppression level; SLL is the sidelobe level; θ il ~θ ih is the interference suppression angle of the array antenna; θ min ~θ max is the array antenna beam pointing; θ il is -25°, θ ih is -22°, θ min is -2°, θ max is 2°.

[0093] The optimization goal is to minimize the cost function, constructed in the same manner as for beamforming. A direct genetic algorithm optimization of the 32-unit amplitude and phase took 393.028 seconds. In comparison, the proposed method, which uses the genetic algorithm to optimize two parameters in the null region, took 10.414 seconds. The proposed method takes only 2.65% of the time required by the direct genetic algorithm.

[0094] Figure 4 The iteration of the direct genetic algorithm to resist interference is given. It can be seen that the direct genetic algorithm needs 2000 generations to complete the array optimization design. Figure 5 As shown, the present invention only requires 40 generations to obtain the design result, which has a significant optimization efficiency advantage.

[0095] Adaptive interference suppression results are as follows Figure 6 As shown. Figure 6 It can be seen that the null position optimized by the direct genetic algorithm is -22° to -25°, and the null depth is -40.0°, while there are 6 side lobes near the main lobe exceeding -25dB, and the side lobe level is as high as -17.9dB, which cannot meet the side lobe level requirement of -25 dB. This shows that the direct genetic algorithm has not converged to the global optimal solution. Compared with the direct genetic algorithm optimization, the null position optimized by the method of the present invention is -22° to -25°, the null depth is -39.1°, and the side lobe level is -22.2°. The optimization result is significantly better than the direct genetic algorithm. The side lobe level does not reach -25 dB because only the zero-point phase of the shaping area is optimized in consideration of the optimization speed.

[0096] In summary, compared with directly using the genetic algorithm, the method of the present invention has the advantages of fast convergence speed and high shaping accuracy, and is suitable for different forms of beamforming and adaptive null generation.

[0097] like Figure 8 As shown, the present invention also provides an antenna array synthesis device based on Taylor distribution and Kirchhoff circle, including the following modules:

[0098] The initial pattern acquisition module uses the Taylor distribution function to determine the initial excitation coefficients of the array elements and the initial array zero position according to the array synthesis requirements, and obtains the initial pattern with sidelobe suppression and mainlobe characteristics;

[0099] The fine-tuning module converts the initial array zero point position to Kirchhoff's unit circle, identifies the zero point position to be optimized based on the principle of Kirchhoff's unit circle, and uses the genetic algorithm to fine-tune the zero point position to be optimized;

[0100] The fine optimization module calculates the excitation coefficient of the array element corresponding to the specific zero point position after fine-tuning, replaces the initial excitation coefficient, and obtains the final array element excitation coefficient, thereby realizing fine optimization of the antenna array radiation pattern and completing fast beamforming, multi-beam and adaptive interference suppression of the antenna array.

[0101] The present invention also provides an electronic device, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein when the processor executes the program, the steps of the antenna array synthesis method based on Taylor distribution and Kirchhoff circle are implemented.

[0102] The present invention also provides a non-transitory computer-readable storage medium having a computer program stored thereon. When the computer program is executed by a processor, the steps of the antenna array synthesis method based on Taylor distribution and Kirchhoff circle are implemented.

[0103] Those skilled in the art will appreciate that embodiments of the present invention may be provided as methods, systems, or computer program products. Thus, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, the present invention may take the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to disk drives, CD-ROMs, optical storage devices, etc.) containing computer-usable program code. The solutions in the embodiments of the present invention may be implemented using various computer languages, such as the object-oriented programming language Java and the interpreted scripting language JavaScript.

[0104] The present invention is described with reference to flowcharts and / or block diagrams of methods, devices (systems), and computer program products according to embodiments of the present invention. It should be understood that each process and / or block in the flowcharts and / or block diagrams, as well as combinations of processes and / or blocks in the flowcharts and / or block diagrams, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing device to produce a machine, so that the instructions executed by the processor of the computer or other programmable data processing device generate instructions for implementing the processes in the flowcharts and / or block diagrams. Figure 1 a process or multiple processes and / or boxes Figure 1 A device that provides the functions specified in a block or multiple blocks.

[0105] These computer program instructions may also be stored in a computer readable memory that can direct a computer or other programmable data processing device to work in a specific manner, so that the instructions stored in the computer readable memory produce an article of manufacture comprising an instruction device, which implements the process Figure 1 a process or multiple processes and / or boxes Figure 1The function specified in one or more boxes.

[0106] These computer program instructions can also be loaded onto a computer or other programmable data processing device so that a series of operational steps are executed on the computer or other programmable device to produce a computer-implemented process, thereby providing the instructions executed on the computer or other programmable device for implementing the process. Figure 1 a process or multiple processes and / or boxes Figure 1 A step that specifies a function in one or more boxes.

[0107] Although the preferred embodiments of the present invention have been described, those skilled in the art may make additional changes and modifications to these embodiments once they have learned the basic creative concept. Therefore, the appended claims are intended to be interpreted as including the preferred embodiments and all changes and modifications that fall within the scope of the present invention.

[0108] Obviously, those skilled in the art may make various changes and modifications to the present invention without departing from the spirit and scope of the present invention. Thus, if such changes and modifications fall within the scope of the claims and their equivalents, the present invention is intended to include such changes and modifications.

Claims

1. Antenna array synthesis method based on Taylor distribution and Kirchhoff circle, characterized by: The steps include: Step 1: According to the array synthesis requirements, the Taylor distribution function is used to determine the initial excitation coefficients of the array elements and the initial array zero position, and an initial radiation pattern with sidelobe suppression and mainlobe characteristics is obtained; Step 2: Convert the initial array zero position determined in step 1 to the Kirchhoff unit circle by substituting the variable z, that is, , and get the result F after replacing the far-field array factor variable: （10） Where j is the imaginary unit, k is the wave number, and d is the array element spacing. is the observation angle, exp() represents the exponential function; is the array element excitation coefficient of the nth array element; N represents the total number of array elements; The result of far-field array factor substitution, F, has N-1 complex roots, which can be factored into: （11） Among them, I N is the magnitude value of the factorization; , is the zero position of the nth array element The corresponding value of the transformation on Kirchhoff's unit circle; Based on the principle of Kirchhoff's unit circle, the zero point position to be optimized in the area to be optimized is identified, and the zero point position to be optimized is fine-tuned using a genetic algorithm; During the antenna array synthesis process, identify the zero point position of the area to be optimized and The roots are placed outside Kirchhoff's unit circle, and the sidelobe region The roots are restricted to Kirchhoff's unit circle, and after normalization, the total indivual or Form vector x and obtain intermediate parameters and a function of the vector x If you want to reduce the sidelobe level at a certain position, you need to adjust the zero point position of the sidelobe at that position. or Add it to vector x, and then use genetic algorithms to calculate the appropriate zero point position to achieve precise control of the sidelobe level and rapid optimization of the mainlobe shape; Step 3: Calculate the array element excitation coefficient of the array element corresponding to the fine-tuned zero point position obtained in step 2, replace the initial excitation coefficient in step 1, and obtain the final array element excitation coefficient to achieve fine optimization of the antenna array radiation pattern and complete fast beamforming, multi-beam and adaptive interference suppression of the antenna array.

2. The antenna array synthesis method based on Taylor distribution and Kirchhoff circle according to claim 1, characterized in that: In step 2, based on the principle of Kirchhoff's unit circle, the zero point position to be optimized is identified, and the zero point position to be optimized is fine-tuned using a genetic algorithm, including: make , the formula for the far-field array factor F after variable substitution is: （12） Among them, x n z n Real part; y n z n Imaginary part; the intermediate parameter ψ is kdcosθ+β, and β is the array beam pointing parameter.

3. The antenna array synthesis method based on Taylor distribution and Kirchhoff circle according to claim 1, characterized in that: In step 2, based on the principle of Kirchhoff's unit circle, identifying the zero point position to be optimized, and using the genetic algorithm to fine-tune the zero point position to be optimized further includes: The zero point position after fine-tuning is expressed on Kirchhoff's unit circle as: （13） in, is the zero position after fine-tuning; It is the optimization adjustment amount of the zero point position.

4. The antenna array synthesis method based on Taylor distribution and Kirchhoff circle according to claim 3, characterized in that: In step 3, the final array element excitation coefficient is obtained by: According to the zero point position after fine-tuning , substitute into formula (11), and replace , calculate the result of the far-field array factor variable substitution corresponding to the area to be optimized, expand the result to obtain the array element excitation coefficient of the area to be optimized, replace the initial excitation coefficient in step 1, and obtain the final array element excitation coefficient.

5. An antenna array synthesis device based on Taylor distribution and Kirchhoff circle, characterized in that: Includes the following modules: The initial pattern acquisition module uses the Taylor distribution function to determine the initial excitation coefficients of the array elements and the initial array zero position according to the array synthesis requirements, and obtains the initial pattern with sidelobe suppression and mainlobe characteristics; The fine-tuning module converts the initial array zero point position to the Kirchhoff unit circle, that is, it is substituted by the variable z, that is, , and get the result F after replacing the far-field array factor variable: （10） Where j is the imaginary unit, k is the wave number, and d is the array element spacing. is the observation angle, exp() represents the exponential function; is the array element excitation coefficient of the nth array element; N represents the total number of array elements; The result of far-field array factor substitution, F, has N-1 complex roots, which can be factored into: （11） Among them, I N is the magnitude value of the factorization; , is the zero position of the nth array element The corresponding value of the transformation on Kirchhoff's unit circle; Based on the principle of Kirchhoff's unit circle, the zero point position to be optimized in the area to be optimized is identified, and the zero point position to be optimized is fine-tuned using a genetic algorithm; During the antenna array synthesis process, identify the zero point position of the area to be optimized and The roots are placed outside Kirchhoff's unit circle, and the sidelobe region The roots are restricted to Kirchhoff's unit circle, and after normalization, the total indivual or Form vector x and obtain intermediate parameters and a function of the vector x If you want to reduce the sidelobe level at a certain position, you need to adjust the zero point position of the sidelobe at that position. or It is added to the vector x, and then the appropriate zero point position is calculated with the help of genetic algorithm to achieve precise control of the sidelobe level and rapid optimization of the mainlobe shape.

6. An electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein: When the processor executes the program, the steps of the antenna array synthesis method based on Taylor distribution and Kirchhoff circle according to any one of claims 1 to 4 are implemented.

7. A non-transitory computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the steps of the antenna array synthesis method based on Taylor distribution and Kirchhoff circle according to any one of claims 1 to 4 are implemented.

Images