Method for optimizing periodic multi-phase modulation radar interference based on simulated annealing algorithm

Through the simulation annealing algorithm, the problem of poor interference effect caused by the randomness of the modulation sequence in the coordinated interference mode of multi-jammer is solved, which significantly improves the interference capability of the multi-static radar system and enhances the flexibility and adaptability of the system .

CN119001625APending Publication Date: 2024-11-22ZHEJIANG UNIV OF TECH
View PDF 0 Cites 1 Cited by

Patent Information

Application Number
CN202411100636.3
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-08-12
Publication Date
2024-11-22

AI Technical Summary

Technical Problem

In the prior art, the multi-jammer synergistic interference mode based on periodic multi-phase modulation is difficult to obtain the optimal interference effect due to the randomness of the modulated phase sequence, which makes it difficult for the multi-static radar system to identify the differences between false targets and physical targets.

Method used

The modulated phase sequence is optimized by using a simulated annealing algorithm. By setting the fitness function and annealing process, the modulated phase sequence is gradually adjusted to minimize the sum of the distances of the false target and the physical target in the amplitude ratio feature space, thereby improving the interference effect.

Benefits of technology

The interference capability of multi-static radar systems is significantly improved, the risk of being identified by radar is reduced, local optimal solution problems are avoided, the flexibility and adaptability of the system are enhanced, and the calculation efficiency is improved through matrix operations.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119001625A_ABST
    Figure CN119001625A_ABST
Patent Text Reader

Abstract

The invention discloses a periodic multi-phase modulation radar interference optimization method based on a simulated annealing algorithm. The method comprises the following steps: S1, setting an initial temperature of annealing; a feature vector matrix PTs is randomly generated, a modulation phase sequence is randomly generated, and the value range of each random phase value is [-pi, pi]; the fitness interpolation sequence is used for recording the interpolation of the current solution and the new solution of the phase sequence, and is negative; and accepting probability: accepting the new solution at a certain probability when the fitness of the new solution is lower than that of the current solution. S2, calculating a feature vector matrix FTs according to the PTs and the modulation phase sequence: simulating a process that a jammer receives a physical target and sends an interference signal, defining a related phase period and a time step length, and carrying out PMPM operation on the processed PTs to obtain FTs; and S3, pairing the nearest PT and FT, and then performing summation operation on the distances of all PT and FT pairs as an output result of the fitness function. S4, disturbance is given to the current solution, and if the sum of the distances obtained by the new modulation phase sequence is smaller than the current value, the new solution is accepted; otherwise, if the sum of the distances obtained by the new modulation phase sequence is larger than the current value, the new solution is accepted at a certain probability and serves as the current solution. S5, circulating annealing is a core structure of a simulated annealing algorithm model, the temperature is reduced after annealing, the modulation phase sequence variation amplitude is reduced, and the disturbance giving and accepting process is repeated; and when the temperature reaches the final temperature, a global optimal solution is obtained.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The invention belongs to the field of radar countermeasures, and in particular relates to an optimized periodic multi-phase modulation radar jamming method based on a simulated annealing algorithm. Background Art

[0002] A multi-static radar system (MRSR) is an integrated radar system with multiple spatially separated transmitting and receiving facilities. Compared with traditional monostatic radar systems, MRSR provides greater degrees of freedom and has significant advantages in moving target detection, direction finding and target positioning. In order to prevent important buildings, airports and military targets from being monitored by MRSR, electronic countermeasures against MRSR need to be designed.

[0003] The false targets (FTs) generated by traditional jamming methods have a concentrated characteristic in the amplitude ratio feature space. This is because each array element of the array jammer uses the same modulation method to transmit the jamming signal, resulting in the correlation between the jamming signals received by different radars, while the physical targets (PTs) have discrete characteristics. According to the difference between FTs and PTs, MRSR uses a clustering algorithm to identify the interference of interrupted sampling repeaters. Therefore, in the process of jamming identification, the distribution of FTs in the amplitude ratio space plays a key role. There is a multi-jammer cooperative jamming mode based on periodic multi-phase modulation (PMPM). Each array element of the jammer uses PMPM with a different phase modulation sequence. Combined with transmit beamforming, the correlation of FTs between receivers is destroyed, making it difficult for MRSR to identify FTs.

[0004] The principle of periodic multi-phase modulation based on PMPM is to divide the original pulse signal into K time periods, each of which corresponds to a different phase value in the PMPM sequence, generating a series of equidistant discrete pulses. The harmonic components of each order of the signal have the characteristics of asymmetry and changing with the change of the modulation phase sequence, thereby achieving the purpose of destroying the amplitude correlation of FTs.

[0005] In summary, periodic multi-phase modulation is an important method for MRSR, but since the modulation phase sequence is random, the modulation signal composed of multiple random modulation phase sequences cannot achieve the best interference effect. Therefore, further research is needed to effectively implement the algorithm for optimizing the modulation phase sequence. Summary of the invention

[0006] In order to overcome the deficiencies of the prior art, the present invention provides an optimized periodic multi-phase modulation radar jamming method based on a simulated annealing algorithm.

[0007] When the interference is maximized, the sum of the distances between PTs and FTs in the amplitude ratio feature space is minimized. Therefore, the multi-jammer cooperative interference problem based on PMPM is simplified to: when the number of jammers is fixed, the minimum sum of the distances in the amplitude ratio feature space is obtained by optimizing the modulation phase.

[0008] The present invention takes the modulation phase sequence as a variable and takes the initial solution as the optimal solution. Since the change of the modulation phase sequence affects the distance between PTs and FTs, the sum of the distances between PTs and FTs in the amplitude ratio feature space can be used as the fitness function to calculate the fitness of the current modulation phase sequence. Under the structure of the simulated annealing algorithm, the internal parameters of the modulation phase sequence will show random changes, and then the fitness after the change is calculated and compared with the current fitness. If the new fitness is better than the current fitness, the traditional greedy algorithm is used to accept the solution as the new optimal solution; if the current fitness is better than the new fitness, the new fitness is accepted with a certain probability based on the current annealing environment and the fitness change as a benchmark. The above steps will be repeated each time annealing is performed. When the temperature reaches the termination temperature, the algorithm ends and the solution at this time is taken as the global optimal solution. The modulation phase sequence optimization model consists of five parts: variable setting and initialization, false target generation, fitness function, simulated annealing algorithm environment construction and data perturbation and acceptance model. The entire model calculation is simple and efficient.

[0009] The optimized periodic multi-phase modulation radar jamming method based on simulated annealing algorithm of the present invention comprises the following steps:

[0010] S1: Perform overall initialization: set the initial temperature of annealing; randomly generate eigenvector matrix PTs, randomly generate modulation phase sequence, each modulation phase sequence contains K random phase values, and there are L jammers working at the same time, so the number of optimized phase values ​​is K×L, and the value range of each random phase value is [-π,π]; the fitness interpolation sequence is used to record the interpolation of the current solution and the new solution of the phase sequence, and it is negative; acceptance probability, when the fitness of the new solution is lower than the current solution, the new solution is accepted with a certain probability.

[0011] S2: Calculate the eigenvector matrix FTs based on PTs and modulation phase sequence: simulate the process of the jammer receiving the physical target and sending the jamming signal, define the relevant phase period and time step, perform PMPM operation on the processed PTs to obtain FTs.

[0012] S3: In order to maximize the deception jamming effect, it is hoped that after the clustering operation, each cluster contains PTs and FTs, so MRSR cannot identify PTs. Due to the randomness of the modulation phase sequence of each jammer, the amplitude of the FT in the amplitude ratio space after modulation is random, and it is difficult to determine that a certain FT is close to the PT. To this end, the fitness function needs to calculate the distance between PTs and FTs in the amplitude ratio feature space, pair the nearest PT and FT, and then sum the distances of all PT and FT pairs as the output result of the fitness function.

[0013] S4: The advantage of the simulated annealing algorithm is that it simulates the randomness of physical molecular motion. In the model, the data changes randomly but is restricted by the current annealing environment. To generate a new solution, it is necessary to determine the amplitude of the phase value change based on the current temperature and give a disturbance to the current solution. If the sum of the distances obtained by the new modulated phase sequence is less than the current value, the new solution is accepted; conversely, if the sum of the distances obtained by the new modulated phase sequence is greater than the current value, in order for the algorithm not to be limited to the local optimal solution, it is necessary to accept the new solution as the current solution with a certain probability.

[0014] S5: Cyclic annealing is the core structure of the simulated annealing algorithm model. After annealing, the temperature decreases, the amplitude of the modulation phase sequence changes, and the process of giving disturbances and accepting disturbances is repeated. When the temperature reaches the termination temperature, the global optimal solution is obtained and the algorithm stops.

[0015] Step S1 specifically includes: initializing the annealing temperature T0, setting the temperature reduction rate α, and setting the final stop temperature T end The temperature reduction rate α determines the temperature reduction amplitude in each iteration, and is usually between 0.8 and 0.99. Randomly generate modulation phase sequence Each of these are all random numbers uniformly distributed in the range of [-π,π]. Here K represents the number of modulation phases, and each jammer will use these phase values ​​for modulation. Initialize the fitness interpolation sequence ΔF=-∞ to record the fitness difference between the new solution and the current solution in each iteration. Set the acceptance probability function P(ΔF,T). The acceptance probability is inversely proportional to the fitness difference ΔF and the current temperature T. When ΔF is small, that is, when the fitness difference between the new solution and the current solution is small, the probability of accepting the new solution is large; when the temperature T is high, the probability of accepting the poor solution is also large.

[0016] Wherein, step S2 specifically includes: defining a time series, with a time step of τ and a time period of T. Generating a PMPM sequence Φ(t) according to the time series and the phase matrix. Applying the PMPM sequence to the feature vector of the physical target, generating an interference signal, and obtaining the feature vector of the false target.

[0017] Wherein, step S3 specifically comprises: for each generated modulation phase sequence Calculate its fitness value F(Φ). The fitness function is the key criterion for evaluating the quality of the current solution, which is implemented by calculating the distance between PT and FT in the amplitude ratio feature space. The fitness of the current modulated phase sequence is evaluated by calculating the sum of the minimum distances between all PTs and FTs. In order to facilitate the calculation, matrix operations can be used to improve the calculation efficiency during the implementation process. The distance between each pair of PTs and FTs is calculated through matrix operations, and the sum of the minimum values ​​is calculated.

[0018] Step S4 specifically includes: at the current temperature T, performing a small range perturbation on the current solution Φ to generate a new solution Φ'. The specific method of perturbation can be to Add a random perturbation value in A random number in the range of (-∈,∈), where ∈ is the perturbation amplitude. For the new solution Φ', recalculate its fitness value F(Φ') and compare it with the fitness value F(Φ) of the current solution. The new fitness value is compared with the fitness value of the current solution to determine whether to accept the new solution. If the new fitness value F(Φ') is less than the current fitness value F(Φ), the new solution Φ' is accepted as the current solution. Otherwise, the new solution is accepted with probability P(ΔF,T).

[0019] Step S5 specifically includes: after each annealing, updating the temperature T = αT. The temperature update formula gradually reduces the temperature by multiplying the temperature reduction coefficient α|, so that the algorithm gradually converges to the global optimal solution. Repeat the process of step S3 until the temperature drops to the termination temperature T end In each iteration, the process of perturbation, calculation of the fitness of the new solution, and judgment on whether to accept the new solution will be carried out until the temperature gradually decreases to the set termination temperature. When the temperature reaches the termination temperature T end When , the algorithm stops and records the solution Φ at this time as the global optimal solution. The solution at this time has undergone multiple annealing and perturbations, and is usually close to the global optimal solution, which can maximize the perturbation effect.

[0020] The advantages of the present invention are: by optimizing the modulation phase sequence, the jamming capability of the multi-static radar system is significantly improved, and the distance between the false target (FTs) and the physical target (PTs) can be effectively increased, thereby reducing the risk of being identified by the radar; by utilizing the randomness of the simulated annealing algorithm, the local optimal solution problem that may be caused by the traditional greedy algorithm is avoided, so that the algorithm can explore a wider solution space and find the global optimal solution; the algorithm can also be dynamically adjusted according to different jammer numbers and modulation parameters, adapt to various complex electronic countermeasure scenarios, and improve the flexibility and adaptability of the system; by reasonably setting the fitness function and using matrix operations, high efficiency is maintained, the effect of the modulation phase sequence can be quickly evaluated, and the optimization time is shortened. Finally, the algorithm has a clear structure, is easy to implement, is suitable for application in actual electronic countermeasure systems, and provides strong support for research and application in related fields. BRIEF DESCRIPTION OF THE DRAWINGS

[0021] Figure 1 It is a schematic diagram of the PMPM sequence of the present invention.

[0022] Figure 2 It is a flow chart of the simulated annealing model of the present invention. DETAILED DESCRIPTION

[0023] The following will be combined with the drawings in the embodiments of the present invention to clearly and completely describe the technical solutions in the embodiments of the present invention. Obviously, the described embodiments are part of the embodiments of the present invention, not all of the embodiments. It should be understood that the specific implementation cases described here are only used to explain the present invention and are not used to limit the present invention.

[0024] Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in the field without making any creative work shall fall within the scope of protection of the present invention.

[0025] The optimized periodic multi-phase modulation radar jamming method based on simulated annealing algorithm comprises the following steps:

[0026] S1: The overall initialization mainly includes: setting the initial temperature of annealing; randomly generating eigenvector matrices PTs, randomly generating modulation phase sequences, each modulation phase sequence contains K random phase values, and there are L jammers working at the same time, so the number of optimized phase values ​​is K×L, and the value range of each random phase value is [-π,π]; the fitness interpolation sequence is used to record the interpolation of the current solution and the new solution of the phase sequence, and it is negative; acceptance probability, when the fitness of the new solution is lower than the current solution, the new solution is accepted with a certain probability.

[0027] S2: Calculate the eigenvector matrix FTs based on PTs and modulation phase sequence: simulate the process of the jammer receiving the physical target and sending the jamming signal, define the relevant phase period and time step, perform PMPM operation on the processed PTs to obtain FTs.

[0028] S3: In order to maximize the deception jamming effect, it is hoped that after the clustering operation, each cluster contains PTs and FTs, so MRSR cannot identify PTs. Due to the randomness of the modulation phase sequence of each jammer, the amplitude of the FT in the amplitude ratio space after modulation is random, and it is difficult to determine that a certain FT is close to the PT. To this end, the fitness function needs to calculate the distance between PTs and FTs in the amplitude ratio feature space, pair the nearest PT and FT, and then sum the distances of all PT and FT pairs as the output result of the fitness function.

[0029] S4: The advantage of the simulated annealing algorithm is that it simulates the randomness of physical molecular motion. In the model, the data changes randomly but is restricted by the current annealing environment. To generate a new solution, it is necessary to determine the amplitude of the phase value change based on the current temperature and give a disturbance to the current solution. If the sum of the distances obtained by the new modulated phase sequence is less than the current value, the new solution is accepted; conversely, if the sum of the distances obtained by the new modulated phase sequence is greater than the current value, in order for the algorithm not to be limited to the local optimal solution, it is necessary to accept the new solution as the current solution with a certain probability.

[0030] S5: Cyclic annealing is the core structure of the simulated annealing algorithm model. After annealing, the temperature decreases, the amplitude of the modulation phase sequence changes, and the process of giving disturbances and accepting disturbances is repeated. When the temperature reaches the termination temperature, the global optimal solution is obtained and the algorithm stops.

[0031] Step S1 specifically includes: initializing the annealing temperature T0, setting the temperature reduction rate α, and setting the final stop temperature T end The initial temperature T0 is chosen to ensure that the solution space can be fully traversed at the beginning of the algorithm, and the temperature reduction rate α determines the temperature reduction in each iteration, usually between 0.8 and 0.99. Randomly generate the eigenvector matrix PTs. Assuming there are N PTs, the eigenvector of the i-th PT can be expressed as PT i =[PT i1 ,PT i2 ,...,PT id ], the d in the feature vector represents the dimension. Figure 1 As shown, the modulation phase sequence is randomly generated Each of these are all random numbers uniformly distributed in the range [-π,π]. Here K represents the number of modulation phases, and each jammer will use these phase values ​​for modulation. Assuming there are L jammers, the phase sequence of each jammer contains K random phase values, and each phase value range is uniformly distributed in [-π,π]. The generated phase matrix is ​​as follows:

[0032]

[0033] Initialize the fitness interpolation sequence ΔF = -∞, which is used to record the fitness difference between the new solution and the current solution in each iteration. The initial value is set to negative infinity to ensure that any new solution can be accepted in the first round of iteration. Set the acceptance probability function, whose expression is:

[0034]

[0035] Formula (1) is used to decide whether to accept a new solution when the new solution has poor fitness, so as to avoid the algorithm falling into the local optimum. The acceptance probability is inversely proportional to the fitness difference ΔF and the current temperature T. When ΔF is small, that is, when the fitness difference between the new solution and the current solution is small, the probability of accepting the new solution is large; when the temperature T is high, the probability of accepting a poor solution is also large.

[0036] Step S2 specifically includes: defining a time series, with a time step of τ and a time period of T. The modulation signal Φ(t) corresponding to the PMPM sequence is generated according to the time series and the phase matrix, and its expression is:

[0037]

[0038] Where * represents the convolution operation, and δ(t) is the impulse function. Applying the PMPM sequence Φ(t) to the eigenvector of PTs generates an interference signal whose expression is:

[0039]

[0040] In formula (3), L is the number of elements in the jammer array, β(θ) is the beamforming vector about angle θ, and R J,n is the slant range from the reference jammer to the nth radar, λ is the wavelength, a m is the amplitude weighted vector. Finally, the expression of FTs is obtained:

[0041]

[0042] In formula (4), m Represents the peak of the blur function.

[0043] Step S3 specifically includes: for each generated modulation phase sequence Or phase matrix, calculate its fitness value F(Φ). The fitness function is the key criterion for evaluating the quality of the current solution, which is achieved by calculating the distance between PT and FT in the amplitude ratio feature space. The fitness function is defined as:

[0044]

[0045] In formula (2), PT i and FT j Respectively represent the positions of PT and FT in the amplitude ratio feature space, ||PT i -FT j || represents the distance between the i-th PT and the j-th FT. The fitness of the current modulation phase sequence is evaluated by calculating the sum of the minimum distances between all PTs and FTs. In order to facilitate the calculation, matrix operations can be used to improve the calculation efficiency during the implementation process. Define the PT and FT position matrix PT∈R N×d and FT∈R M×d Where d represents the dimension of the feature space. The distance between each pair of PT and FT is calculated through matrix operations, and the sum of the minimum values ​​is calculated.

[0046] Step S3 specifically includes: at the current temperature T, performing a small range perturbation on the current solution Φ to generate a new solution Φ'. The specific method of perturbation can be to perturb the current phase value Add a random perturbation value That is in A random number in the range of (-∈,∈), where ∈ is the disturbance amplitude. For the new solution Φ', recalculate its fitness value F(Φ') and compare it with the fitness value F(Φ) of the current solution. The new fitness value is compared with the fitness value of the current solution to decide whether to accept the new solution. If the new fitness value F(Φ') is less than the current fitness value F(Φ), that is, ΔF=F(Φ')-F(Φ)<0, then accept the new solution Φ' as the current solution. Otherwise, with probability Accept new solutions. This mechanism ensures that when the temperature is high, the algorithm can accept poor solutions and thus escape from the local optimum.

[0047] Step S4 specifically includes: after each annealing, updating the temperature T = αT. The temperature update formula gradually reduces the temperature by multiplying the temperature reduction coefficient α|, so that the algorithm gradually converges to the global optimal solution. Repeat the process of step S3 until the temperature drops to the termination temperature T end In each iteration, the process of perturbation, calculation of the fitness of the new solution, and judgment on whether to accept the new solution will be carried out until the temperature gradually decreases to the set termination temperature. When the temperature reaches the termination temperature T endWhen , the algorithm stops and records the solution Φ at this time as the global optimal solution. The solution at this time has undergone multiple annealing and perturbations, and is usually close to the global optimal solution, which can maximize the perturbation effect.

[0048] The overall algorithm model is as follows Figure 2 shown.

[0049] By implementing the embodiments of the present invention, the jamming capability of the multi-static radar system is significantly improved by optimizing the modulation phase sequence, and the distance between the false targets (FTs) and the physical targets (PTs) can be effectively increased, thereby reducing the risk of being identified by the radar; the randomness of the simulated annealing algorithm is utilized to avoid the local optimal solution problem that may be caused by the traditional greedy algorithm, so that the algorithm can explore a wider solution space and find the global optimal solution; the algorithm can also dynamically adjust according to different jammer numbers and modulation parameters to adapt to various complex electronic countermeasure scenarios, thereby improving the flexibility and adaptability of the system; by reasonably setting the fitness function and using matrix operations, high efficiency is maintained, the effect of the modulation phase sequence can be quickly evaluated, and the optimization time is shortened. Finally, the algorithm has a clear structure and is easy to implement, which is suitable for application in actual electronic countermeasure systems, and provides strong support for research and application in related fields.

[0050] Those skilled in the art will appreciate that the above is only a specific embodiment of the present invention, but the protection scope of the present invention is not limited thereto. Any person skilled in the art who is familiar with the present technical field can easily think of various equivalent modifications or substitutions within the technical scope disclosed by the present invention, and these modifications or substitutions should be included in the protection scope of the present invention. Therefore, the protection scope of the present invention shall be subject to the protection scope of the claims.

Claims

1. An optimized periodic multi-phase modulation radar jamming method based on a simulated annealing algorithm comprises the following steps: S1: Perform overall initialization: set the initial temperature of annealing; randomly generate eigenvector matrix PTs, randomly generate modulation phase sequence, each modulation phase sequence contains K random phase values, and there are L jammers working at the same time, so the number of optimized phase values ​​is K×L, and the value range of each random phase value is [-π,π]; the fitness interpolation sequence is used to record the interpolation between the current solution and the new solution of the phase sequence, and it is negative; Acceptance probability: when the fitness of the new solution is lower than that of the current solution, the new solution is accepted with a certain probability; S2: Calculate the eigenvector matrix FTs based on PTs and modulation phase sequence: simulate the process of the jammer receiving the physical target and sending the jamming signal, define the relevant phase period and time step, perform PMPM operation on the processed PTs to obtain FTs; S3: Use the fitness function to calculate the distance between PTs and FTs in the amplitude ratio feature space, pair the closest PT and FT, and then sum the distances of all PT and FT pairs as the output of the fitness function; S4: In the simulated annealing algorithm, the change amplitude of the phase value is determined according to the current temperature, and a disturbance is given to the current solution. If the sum of the distances obtained by the new modulation phase sequence is less than the current value, the new solution is accepted; conversely, if the sum of the distances obtained by the new modulation phase sequence is greater than the current value, in order for the algorithm not to be limited to the local optimal solution, it is necessary to accept the new solution with a set probability as the current solution; S5: Cyclic annealing. After annealing, the amplitude decreases, the amplitude of the modulation phase sequence changes decreases, and the process of giving disturbance and acceptance is repeated. When the temperature reaches the termination temperature, the global optimal solution is obtained and the algorithm stops.

2. The multi-beam forming method based on pseudo-random sequence weighting of a parametric matrix as claimed in claim 1, characterized in that: Step S1 specifically includes: initializing the annealing temperature T0, setting the temperature reduction rate α, and setting the final stop temperature T end ; The temperature reduction rate α determines the temperature reduction in each iteration, usually between 0.8 and 0.99; Randomly generate the modulation phase sequence Each of these are all random numbers uniformly distributed in the range of [-π,π]. Here K represents the number of modulation phases, and each jammer will use these phase values ​​for modulation; initialize the fitness interpolation sequence ΔF=-∞ to record the fitness difference between the new solution and the current solution in each iteration; set the acceptance probability function P(ΔF,T); the acceptance probability is inversely proportional to the fitness difference ΔF and the current temperature T. When ΔF is small, that is, when the fitness difference between the new solution and the current solution is small, the probability of accepting the new solution is large; when the temperature T is high, the probability of accepting the worse solution is also large.

3. The multi-beam forming method based on pseudo-random sequence weighting of a parametric matrix as claimed in claim 1, characterized in that: Step S2 specifically includes: defining a time series with a time step of τ and a time period of T; generating a PMPM sequence Φ(t) according to the time series and the phase matrix; applying the PMPM sequence to the feature vector of the physical target, generating an interference signal, and obtaining the feature vector of the false target.

4. The multi-beam forming method based on pseudo-random sequence weighting of a parametric matrix as claimed in claim 1, characterized in that: Step S3 specifically includes: for each generated modulation phase sequence Calculate its fitness value F(Φ); The fitness function is the key criterion for evaluating the quality of the current solution, which is achieved by calculating the distance between PT and FT in the amplitude ratio feature space; The fitness of the current modulated phase sequence is evaluated by calculating the sum of the minimum distances between all PTs and FTs; In order to facilitate calculation, matrix operations can be used to improve calculation efficiency during the implementation process; The distance between each pair of PTs and FTs is calculated through matrix operations, and the sum of the minimum values ​​is calculated.

5. The multi-beam forming method based on pseudo-random sequence weighting of a parametric matrix as claimed in claim 1, characterized in that: Step S4 specifically includes: at the current temperature T, performing a small range perturbation on the current solution Φ to generate a new solution Φ'; the specific method of perturbation can be to perturb the current phase value Add a random perturbation value in A random number in the range of (-∈,∈), where ∈ is the disturbance amplitude; for the new solution Φ', recalculate its fitness value F(Φ') and compare it with the fitness value F(Φ) of the current solution; the new fitness value is compared with the fitness value of the current solution to decide whether to accept the new solution; if the new fitness value F(Φ') is less than the current fitness value F(Φ), accept the new solution Φ' as the current solution; otherwise, accept the new solution with probability P(ΔF,T).

6. The multi-beam forming method based on pseudo-random sequence weighting of a parametric matrix as claimed in claim 1, characterized in that: Step S5 specifically includes: after each annealing, updating the temperature T=αT; the temperature update formula gradually reduces the temperature by multiplying the temperature reduction coefficient α|, so that the algorithm gradually converges to the global optimal solution; repeating the process of step S3 until the temperature drops to the termination temperature T end ; In each iteration, the process of perturbation, calculation of the fitness of the new solution, and judgment on whether to accept the new solution will be carried out until the temperature gradually decreases to the set termination temperature; when the temperature reaches the termination temperature T end When , the algorithm stops and records the solution Φ at this time as the global optimal solution; this claim The solution at that time has undergone multiple annealing and perturbations, and is usually close to the global optimal solution, which can maximize the perturbation effect.

Citation Information

Cited By

  • Intelligent chemical product production data acquisition method and system based on big data

    CN121682056A