An adaptive distributed radar anti-intermittent sampling retransmission interference method

Abstract

The present application relates to the technical field of radar signal processing, in particular to a kind of adaptive distributed radar anti intermittent sampling retransmission interference method, for when encountering intermittent sampling retransmission interference, accurate, stably detect real target, including through the echo of multiple receiving stations signal level interference alignment processing;Optimization algorithm is realized by using simulated annealing-particle swarm search sequence under the optimal site combination intra-pulse phase reference level intermittent sampling retransmission interference cancellation fusion processing and optimization.The method of the present application is by means of the characteristics of high power gain of intermittent sampling retransmission interference and high correlation of homologous interference radiation, the adaptive distributed radar anti intermittent sampling retransmission interference method proposed, has good robustness in the environment of resisting different types of intermittent sampling retransmission interference and different jamming-to-signal ratio, improves the target accurate detection capability in information battlefield confrontation environment.

Description

TECHNICAL FIELD

[0001] The present application relates to the technical field of radar signal processing, and particularly relates to a self-adaptive distributed radar anti-intermittent sampling and forwarding jamming method. BACKGROUND

[0002] Intermittent sampling and forwarding jamming (ISRJ) is a new type of coherent jamming emerging with the development of digital radio frequency memory (DRFM), which can generate multiple false target spikes around the target of the echo signal, and disturb the detection of the real target by the radar. At present, the ISRJ equipped by the self-defense jammer makes the single base radar gradually fall behind in the anti-jamming target detection due to the fast response speed and small difference from the radar.

[0003] At present, the suppression method of multi-base radar network (MSRN) for the multi-false target jamming of ISRJ can be mainly divided into two categories of data level and signal level. The data level multi-false target suppression method mainly utilizes the non-cooperative nature of the false target, and performs data level false target jamming discrimination through the information contradiction of the spatial position and speed of the false target. However, in the environment where the echo power of the real target is weak, the detection ability of the real target is easily lost by the method.

[0004] For the self-defense deception jamming, two solutions are proposed in the prior art: one is a cooperative cancellation anti-jamming method based on single base radar network. The method utilizes any difference in amplitude, phase, delay or Doppler frequency shift of the target and the jamming in the signals received by two receiving stations to carry out jamming cancellation, and maximally preserves the target echo signal. The other is to set a special node radar to aim at the jamming source, sample the jamming signal, and then realize cancellation by means of the correlation. However, when dealing with self-defense jamming or random jamming, it is difficult to sample the jamming signal.

[0005] There are still some problems in the multi-receiving station cooperative anti-jamming algorithm that need to be improved: (1) the data level method itself cannot solve the problem of target detection when the real target is covered by noise / jamming; (2) most of the signal level methods require to meet the near field area condition, and in the far field area, the difference in echo correlation of each receiving station is small, and the energy loss of the target echo after cancellation is large; (3) the signal level method mainly utilizes the cancellation result of the echo signals of two stations, and does not fully consider the fusion gain of the echo signals in the environment of more stations. SUMMARY

[0006] In order to solve the problem that it is difficult to utilize the fusion gain of the multi-receiving station cooperation in the low signal-to-noise ratio and far field scene, the present application provides a self-adaptive distributed radar anti-intermittent sampling and forwarding jamming method.

[0007] In order to solve the above problems, the present application adopts the following technical scheme:

[0008] A self-adaptive distributed radar anti-intermittent sampling and forwarding jamming method:

[0009] S1. Signal level interference alignment processing on echoes of multiple receiving stations, including interference time delay alignment, interference phase alignment and interference amplitude alignment of multiple receiving station echo signals;

[0010] S2. Intra-pulse coherent inter-stage intermittent sampling and forwarding interference cancellation fusion processing and optimization under optimal station combination, including interference coherent cancellation between two receiving stations, candidate fusion signal generation through prefix operation according to signal-to-noise ratio contribution ranking, candidate fusion signal evaluation and screening, initialization and iteration process of sequence optimization simulated annealing-particle swarm search algorithm, and output of final fusion signal corresponding to global optimal sequence.

[0011] Further, the interference alignment processing includes taking the echo signal of the first receiving station as a reference signal , and performing alignment processing on the echo signals of the remaining receiving stations .

[0012] Further, the S1 includes S1.1, interference time delay alignment includes calculating the correlation function of the reference signal and the echo signals of the remaining receiving stations , as formula (1):

[0013] (1);

[0014] In the formula, is the echo signal of the first receiving station, is the conjugate operation of a complex number, is the convolution operation, is the value of the echo signal of the mth receiving station after the conjugate operation and time reversal at discrete time-k;

[0015] The time delay sample difference between the interference of the mth receiving station signal and the interference of the reference signal is obtained by the maximum value of , as formula (2):

[0016] (2);

[0017] In the formula, is the value of the cross-correlation function between the echo signal of the first receiving station and the echo signal of the mth receiving station at discrete time k, is the modulo operation;

[0018] When , the signal calculation formula of the mth receiving station after interference time delay alignment is , as formula (3):​

[0019] (3);

[0020] wherein, is the value of the echo signal of the mth receiving station at discrete time n after the first processing, is the value of the echo signal of the mth receiving station at discrete time after the first processing;

[0021] When , the mth receiving station interference time delay alignment signal calculation formula , as formula (4):

[0022] (4).

[0023] Further, the S1 includes S1.2, interference phase alignment phase difference, as formula (5):

[0024] (5);

[0025] wherein, is the phase difference between the echo signal of the first receiving station and the echo signal of the mth receiving station, is the phase extraction, is the value of the echo signal of the first receiving station at discrete time n after the first processing, is the value of the echo signal of the mth receiving station after the first processing, and after the conjugate operation and time reversal, at discrete time -n;

[0026] According to the phase difference of formula (5), the phase compensation is made, as formula (6):

[0027] (6);

[0028] wherein, is the value of the echo signal of the mth receiving station at discrete time n after the second processing.

[0029] Further, the S1 includes S1.3, interference amplitude alignment, including using the high power characteristics of intermittent sampling to forward interference, positioning the interference signal in the time domain of the echo signal through a double sliding window bidirectional constant false alarm rate detector, determining the range of the target echo and interference and estimating the amplitude of the interference, and then aligning the interference amplitude of the remaining receiving station signal with the reference signal, as formula (7):

[0030] (7);

[0031] wherein, The value of the echo signal of the mth receiving station after the third processing at discrete time n, The interference amplitude of the first receiving station, The interference amplitude of the mth receiving station.

[0032] Further, the S2 includes S2.1, interference coherent cancellation between receiving stations, including interference coherent cancellation between the first receiving station and the second receiving station to the Mth receiving station, the second receiving station and the third receiving station to the Mth receiving station, …, the M-1th receiving station and the Mth receiving station, and the cancellation result vector The middle element is calculated as formula (8):

[0033] (8);

[0034] In the formula, , The value of the echo signal of the ith receiving station after the third processing at discrete time n, The value of the echo signal of the jth receiving station after the third processing at discrete time n.

[0035] Further, the S2 includes S2.2, the calculation of the candidate fusion signal Further, the S2 includes S2.2, the calculation of the candidate fusion signal The signal-to-noise ratio contribution of each cancellation result is sorted from large to small, and the candidate fusion signal is generated by the prefix sum operation of , as formula (9):

[0036] ;

[0037] In the formula, , The value of the jth cancellation result signal at discrete time n.

[0038] Further, the S2 includes S2.3, the evaluation and screening of the candidate fusion signal, and the evaluation function is as formula (10),

[0039] (10);

[0040] (11);

[0041] (12);

[0042] In the formula, The candidate fusion signal after pulse compression , The signal-to-noise ratio of the detection target, The value of the echo signal of the mth receiving station after the third processing at discrete time n, The number of targets after constant false alarm rate detection Whether it is 1, as formula (11), by calculating the target main lobe 3dB power The maximum power of the rest of the points The signal-to-noise ratio of the detected target in the candidate fusion signal after pulse compression is obtained As formula (12).

[0043] Further, the S2 includes S2.4, the initialization and the speed update in the iteration process of the sequence optimization simulated annealing-particle swarm search algorithm, sets the algorithm initialization current temperature , randomly generates P receiving station sequences as P particles, The initial sequence of the pth particle, while each particle randomly generates no more than 3 exchange operator initial speeds, then enters the algorithm iteration, traverses all particles to perform the following operations, updates the speed of particle p according to formula (13):

[0044] (13);

[0045] In the formula, The speed of the pth particle in the nth iteration, The sequence of the pth particle at time t-1, The historical optimal sequence of the particle itself, The historical optimal sequence of all particles, The speed of the sequence Transformed to the sequence The probability value in , and Each exchange operator in the speed that retains the action with the probability value Each exchange operator in the speed that retains the action with the probability value The combined speed a and speed b. The probability value in , and Each exchange operator in the speed that retains the action with the probability value The combined speed a and speed b. The probability value in , and Each exchange operator in the speed that retains the action with the probability value

[0046] Further, the iteration process further includes the sequence update and acceptance judgment process of the sequence optimization simulated annealing-particle swarm search algorithm, the sequence of the particle Is updated according to formula (14):

[0047] (14);

[0048] In the formula, The sequence of the particle at time t, The updated particle speed of the particle at time t, For position Execution speed All commutation operators in the middle;

[0049] The evaluation value of the particle sequence is assessed using equation (10), and the updated particles are determined according to the Metropolis criterion, as shown in equation (15):

[0050] (15);

[0051] In the formula, for The probability value is randomly generated internally. The difference between the new and old sequence evaluation values ​​of the particles is considered. If the result is unacceptable, the particle's velocity and sequence are updated again until the maximum number of iterations is reached. Accepted later;

[0052] After traversing all particles, update the globally optimal sequence. and the historical optimal sequence of each particle Then proceed to the next iteration, until the maximum number of iterations is reached. Then stop and output the globally optimal sequence. The corresponding final fusion signal .

[0053] Compared with the prior art, the present invention has the following beneficial effects:

[0054] This invention proposes an adaptive distributed multi-station cancellation fusion method by leveraging the high power gain of ISRJ interference and the high correlation of co-source interference radiation. The proposed algorithm can improve the signal-to-interference ratio (SJR) after suppression by more than 10 dB compared with the optimal two-station cancellation method. It also has good robustness against different types of ISRJ and different interference-to-signal ratio (JSR) environments, thereby improving the target accuracy detection capability and interference countermeasures level in future information battlefield confrontation environments. Attached Figure Description

[0055] Figure 1 This is a flowchart illustrating the technical process of the present invention.

[0056] Figure 2 The results for receiving station 4 are shown in the following diagrams: no intermittent sampling direct forwarding interference (ISDJ) echo (orange) and with ISDJ echo (blue);

[0057] Figure 3 The results for receiving station 4 are shown in the images with and without ISRJ interference echoes (orange) and with ISRJ interference echoes (blue).

[0058] Figure 4The result figure of receiving station 4 under the condition of no double-channel complex modulation ISRJ (ISRJ-Complex) jamming echo (orange) and the condition of ISRJ-Complex jamming echo (blue);

[0059] Figure 5 The result figure of LMS algorithm (LMS) against ISDJ jamming;

[0060] Figure 6 The result figure of optimal two-station cancellation method (ACTR) against ISDJ jamming;

[0061] Figure 7 The result figure of sequence-free optimization method against ISDJ jamming;

[0062] Figure 8 The result figure of adaptive distributed radar jamming cancellation and multi-station fusion against ISDJ jamming;

[0063] Figure 9 The result figure of LMS against ISRJ jamming;

[0064] Figure 10 The result figure of ACTR against ISRJ jamming;

[0065] Figure 11 The result figure of sequence-free optimization method against ISRJ jamming;

[0066] Figure 12 The result figure of adaptive distributed radar jamming cancellation and multi-station fusion against ISRJ jamming;

[0067] Figure 13 The result figure of LMS against ISRJ-Complex jamming;

[0068] Figure 14 The result figure of ACTR against ISRJ-Complex jamming;

[0069] Figure 15 The result figure of sequence-free optimization method against ISRJ-Complex jamming;

[0070] Figure 16 The result figure of adaptive distributed radar jamming cancellation and multi-station fusion against ISRJ-Complex jamming;

[0071] Figure 17 The statistical figure of the suppression performance of LMS, ACTR, sequence-free optimization method and adaptive distributed radar against ISDJ jamming in different JSR environments;

[0072] Figure 18A statistical chart comparing the suppression performance of four algorithms—LMS, ACTR, sequence-free optimization method, and adaptive distributed radar—on ISRJ interference in different JSR environments.

[0073] Figure 19 A statistical chart comparing the suppression performance of four algorithms—LMS, ACTR, sequence-free optimization method, and adaptive distributed radar—on ISRJ-Complex interference in different JSR environments. Detailed Implementation

[0074] The present invention will be further illustrated below with reference to embodiments. These embodiments are for illustrative purposes only and are not intended to limit the invention in any way.

[0075] It should be understood that the described embodiments are merely some, not all, of the embodiments in this application. All other embodiments obtained by those skilled in the art based on the embodiments in this application without inventive effort are within the scope of protection of this application.

[0076] An adaptive distributed radar anti-intermittent sampling and forwarding interference method includes:

[0077] S1. Perform signal-level interference alignment processing on the echoes from multiple receiving stations, including aligning the interference delay, interference phase, and interference amplitude of the echo signals from multiple receiving stations.

[0078] S2. The simulated annealing-particle swarm search sequence optimization algorithm is used to realize the intra-pulse coherent level intermittent sampling forwarding interference cancellation fusion processing and optimization under the optimal site combination. This includes coherent interference cancellation between two receiving stations, generating candidate fusion signals by prefix sum operation according to the signal-to-noise ratio (SNR) contribution, evaluating and screening the candidate fusion signals, executing the initialization and iteration process of the sequence optimization simulated annealing-particle swarm search algorithm, and outputting the final fusion signal corresponding to the globally optimal sequence.

[0079] Interference alignment processing includes using the echo signal from the first receiving station as a reference signal. For the echo signals of the other receiving stations Alignment is then performed.

[0080] S1 includes S1.1, and interference delay alignment includes calculating the reference signal. Compared with the echo signals from other receiving stations The relevant functions are shown in equation (1):

[0081] (1);

[0082] In the formula, The echo signal from the first receiving station. For the conjugate operation of complex numbers, For convolution operations, The value of the echo signal from the m-th receiving station at discrete time -k after conjugation and time reversal.

[0083] No. The time delay difference between the interference of the receiving station signal and the interference of the reference signal. Depend on The maximum value is obtained as shown in equation (2):

[0084] (2);

[0085] In the formula, Let be the value of the cross-correlation function between the echo signal from the first receiving station and the echo signal from the m-th receiving station at discrete time k. For mold taking operation;

[0086] when The formula for calculating the signal after interference delay alignment at the m-th receiving station is as follows: As in equation (3):

[0087] (3);

[0088] In the formula, Let be the echo signal from the m-th receiving station, after the first processing, and its value at discrete time n. The echo signal of the m-th receiving station in discrete time The value at;

[0089] when The formula for calculating the signal after interference delay alignment at the m-th receiving station is as follows: As in equation (4):

[0090] (4).

[0091] S1 includes S1.2 and the phase difference of the interference phase alignment solution, as shown in equation (5):

[0092] (5);

[0093] In the formula, Let be the phase difference between the echo signal from the first receiving station and the echo signal from the m-th receiving station. For phase extraction, The value of the echo signal from the first receiving station at discrete time n after the first processing. The value of the echo signal from the m-th receiving station at discrete time -n after the first processing, conjugate operation, and time reversal.

[0094] Phase compensation is performed based on the phase difference in equation (5), as shown in equation (6):

[0095] (6);

[0096] In the formula, Let be the value of the echo signal from the m-th receiving station at discrete time n after the second processing.

[0097] S1 includes S1.3, interference amplitude alignment, which includes utilizing the high power characteristics of intermittent sampling forwarding interference, in the time domain of the echo signal, using a dual sliding window bidirectional constant false alarm rate detector to locate the interference signal, determine the range of the target echo and interference and estimate the amplitude of the interference, and then align the interference amplitude of the remaining receiving station signals with the reference signal, as shown in equation (7):

[0098] (7);

[0099] In the formula, Let be the value of the echo signal from the m-th receiving station at discrete time n after the third processing. The interference amplitude of the first receiving station. Let be the interference amplitude of the m-th receiving station.

[0100] S2 includes S2.1, interference coherent cancellation between receiving stations, including interference coherent cancellation between the first receiving station and the second receiving station up to the Mth receiving station, the second receiving station and the third receiving station up to the Mth receiving station, ..., the (M-1)th receiving station and the Mth receiving station, and the cancellation result vector. The calculation of elements is as follows, as shown in equation (8):

[0101] (8);

[0102] In the formula, , Let be the value of the echo signal from the i-th receiving station at discrete time n after the third processing. Let be the value of the echo signal from the j-th receiving station at discrete time n after the third processing.

[0103] S2 includes S2.2 and candidate fusion signals. The calculation, The signal-to-noise ratio contributions of each cancellation result are sorted from largest to smallest, and then... Prefix sum operation generates candidate fusion signals As in equation (9):

[0104] ;

[0105] In the formula, , Let be the value of the j-th cancellation result signal at discrete time n.

[0106] S2 includes S2.3, evaluation and screening of candidate fusion signals, with the evaluation function as shown in equation (10).

[0107] (10);

[0108] (11);

[0109] (12);

[0110] In the formula, Candidate fusion signal after pulse compression , To detect the SNR of the target, for Number of targets after constant false alarm rate detection Whether it is 1, as shown in equation (11), is determined by calculating the 3dB power of the target main lobe. Maximum power at other points The SNR of the detected target in the candidate fused signal after pulse compression was obtained. , as in equation (12).

[0111] Since the ablation process is determined, The problem of SNR contribution ranking can be transformed into interference-aligned echo signals. The problem of arranging the stations in sequence. The optimal station sequence can guarantee that after cancellation... The results are sorted in descending order of SNR contribution. When the number of receiving stations is small, the optimal order is directly solved by traversing all sequences. When the number of receiving stations is large (e.g., ...), the optimal order is solved by traversing all sequences. , The real-time requirements prevent the radar system from traversing and searching the entire sequence. Therefore, the Simulated Annealing-particle Swarm Optimization (SA-PSO) sequence optimization algorithm is adopted to adapt the algorithm to the receiver sequence problem of multi-station cancellation fusion.

[0112] S2 includes S2.4, the initialization and iterative velocity update of the sequence-optimized simulated annealing-particle swarm search algorithm, and setting the algorithm's initial temperature. P random receiver station sequences are generated as P particles. The initial sequence for the p-th particle is given, and each particle is randomly generated with no more than 3 exchange operators as initial velocities. Then, the algorithm iterates through all particles and performs the following operations, updating the velocity of particle p according to equation (13):

[0113] (13);

[0114] In the formula, For the first The first particle The speed of the next iteration For the first The sequence of particles at time t-1 This is the particle's own historical optimal sequence. This is the historical optimal sequence for all particles. For sequence Transform to sequence speed, and for The probability value within, For probability values Each commutator in the retention action's velocity, For probability values Each commutator in the retention action's velocity, This is to combine all the exchange operators for velocities a and b.

[0115] The iterative process also includes sequence updates and acceptance criteria for the sequence optimization simulated annealing-particle swarm search algorithm, and the particle swarm optimization process. The sequence is updated according to formula (14):

[0116] (14);

[0117] In the formula, Let be the sequence of particles at time t. Let be the updated particle velocity at time t. For position Execution speed All commutation operators in the middle;

[0118] The evaluation value of the particle sequence is assessed using equation (10), and the updated particles are determined according to the Metropolis criterion, as shown in equation (15):

[0119] (15);

[0120] In the formula, for The probability value is randomly generated internally. The difference between the new and old sequence evaluation values ​​of the particles is considered. If the result is unacceptable, the particle's velocity and sequence are updated again until the maximum number of iterations is reached. Accepted later;

[0121] After traversing all particles, update the globally optimal sequence. and the historical optimal sequence of each particle Then proceed to the next iteration, until the maximum number of iterations is reached. Then stop and output the globally optimal sequence. The corresponding final fusion signal .

[0122] The embodiments of the present invention consist of two steps:

[0123] S1. Based on the simulation experiment, the MSRN is set up with 7 radar devices, including 6 R-type silent receiving stations and 4 receiving stations being T / R-type transceiver radars. The transmitted waveform adopts linear frequency modulation (LFM). The target radar cross section (RCS) is sampled from the distributions U(1,2) and N(0,π) to measure the energy and phase response distribution of the echo signal from each station. 2 The remaining simulation parameters are shown in Table 1. The average SNR for each station is approximately 1 dB. The jammer can release three types of ISRJ interference: ISDJ, ISRJ, and ISRJ-Complex.

[0124] Table 1. Simulation Parameter Settings

[0125] .

[0126] Figure 2 , Figure 3 , Figure 4 This is a diagram showing the results of the interference-free echo and the interference-affected echo at receiving station 4 under different interference conditions. ISRJ-Complex is a dual-channel composite interference, and the sampling width, sampling period, and frequency shift modulation of the interference component in each channel are random. The algorithm performance index is the SJR of the output suppressed signal pulse compression result, which is calculated as shown in equation (16):

[0127] (16);

[0128] In the formula, For the true target power, To determine the maximum power of the interference spike.

[0129] S2. The experiment selected LMS and ACTR as multi-station cancellation comparison algorithms, and also compared the fusion results of direct coherent accumulation without sequence optimization. The proposed algorithm set the initial temperature to 100°C, the annealing coefficient to 0.75, the number of particles in the SA-PSO sequence optimization algorithm to 20, and the number of iterations for the particle swarm optimization (PSO) algorithm and the simulated annealing (SA) algorithm to 10 and 5 times respectively, to ensure the real-time performance of the algorithm. Figure 5 , Figure 6 , Figure 7 , Figure 8 , Figure 9 , Figure 10 , Figure 11 , Figure 12 , Figure 13 , Figure 14 , Figure 15 , Figure 16 The results of echo pulse compression suppression using four different algorithms against different types of ISRJ interference are presented. The LMS algorithm targets the echo from another station for cancellation, such as... Figure 5 , Figure 6 , Figure 7 , Figure 8 , Figure 9 , Figure 10 , Figure 11 , Figure 12 As shown, the suppression effect is similar to narrow pulse rejection, resulting in a high gate lobe in the processed pulse compression result, indicating poor suppression performance. When dealing with ISRJ-Complex interference, the complexity of the interference makes it impossible for the LMS algorithm to completely suppress it. ACTR is the optimal two-station cancellation result obtained after cancelling between the master station and the other stations.

[0130] The method proposed in this invention, compared to the direct coherent accumulation cancellation signal method, exhibits better suppression performance against ISDJ and ISRJ due to the fusion of multi-station cancellation results. However, against ISRJ-Complex, the lack of adaptive cancellation fusion results results in the accumulation of cancellation results containing high-power noise and residual interference, leading to unstable suppression performance. Furthermore, the target detection distance cells of the ACTR algorithm, the sequence-free optimization method, and the method proposed in this invention are all unbiased and consistent with the actual target location.

[0131] Figure 17 , Figure 18 , Figure 19The results show that the four algorithms performed 100 Monte Carlo tests against three ISRJ algorithms under JSR conditions of 5dB, 25dB, 30dB, 35dB, and 40dB. The results indicate that the algorithm proposed in this invention outperforms LMS, ACTR, and the no-sequence optimization method in resisting ISDJ, ISRJ, and ISRJ-Complex interference. After interference suppression, the average SJR is 30dB, and the algorithm outperforms ACTR by more than 10dB, demonstrating good robustness under different JSR environments.

[0132] Overall, the algorithm proposed in this invention is stable and performs well in combating these three types of ISRJ. It can not only accumulate target echo energy by utilizing multi-station cancellation results, but also avoid fusing inferior cancellation results through sequence optimization fusion algorithm.

[0133] Of course, the above description is not intended to limit the present invention, and the present invention is not limited to the examples given above. Any changes, modifications, additions or substitutions made by those skilled in the art within the scope of the present invention should also fall within the protection scope of the present invention.

Claims

1. An adaptive distributed radar anti-intermittent sampling and forwarding interference method, characterized in that, Includes the following steps: S1. Perform signal-level interference alignment processing on the echoes from multiple receiving stations, including aligning the interference delay, interference phase, and interference amplitude of the echo signals from multiple receiving stations. S2. The simulated annealing-particle swarm search sequence optimization algorithm is used to realize the interference cancellation and fusion processing and optimization of the pulse coherent level intermittent sampling forwarding under the optimal site combination. This includes the coherent cancellation of interference between receiving stations, the generation of candidate fusion signals by prefix sum operation according to the signal-to-noise ratio contribution, the evaluation and screening of candidate fusion signals, the initialization and iteration process of the sequence optimization simulated annealing-particle swarm search algorithm, and the output of the final fusion signal corresponding to the globally optimal sequence. S2 includes S2.1, interference coherent cancellation between receiving stations, including interference coherent cancellation between the first receiving station and the second receiving station up to the Mth receiving station, the second receiving station and the third receiving station up to the Mth receiving station, ..., the (M-1)th receiving station and the Mth receiving station, and the cancellation result vector. The calculation of elements is as follows, as shown in equation (8): （8）； In the formula, , Let be the value of the echo signal from the i-th receiving station at discrete time n after the third processing. Let be the value of the echo signal from the j-th receiving station at discrete time n after the third processing. S2 includes S2.2, candidate fusion signal. The calculation, The signal-to-noise ratio contributions of each cancellation result are sorted from largest to smallest, and then... Prefix sum operation generates candidate fusion signals As in equation (9): ； In the formula, , Let be the value of the j-th cancellation result signal at discrete time n; S2 includes S2.3, evaluation and screening of candidate fusion signals, with the evaluation function as shown in equation (10). （10）； （11）； （12）； In the formula, Candidate fusion signal after pulse compression , To detect the signal-to-noise ratio of the target, for Number of targets after constant false alarm rate detection Whether it is 1, as shown in equation (11), is determined by calculating the 3dB power of the target main lobe. Maximum power at other points The signal-to-noise ratio of the detected target in the candidate fused signal after pulse compression is obtained. , as in equation (12); S2 includes S2.4, the speed update during the initialization and iteration process of the sequence-optimized simulated annealing-particle swarm search algorithm, and setting the algorithm to initialize the current temperature. P random receiver station sequences are generated as P particles. The initial sequence for the p-th particle is given, and each particle is randomly generated with no more than 3 exchange operators as initial velocities. Then, the algorithm iterates through all particles and performs the following operations, updating the velocity of particle p according to equation (13): （13）； In the formula, For the first The first particle The speed of the next iteration For the first The sequence of particles at time t-1 This is the particle's own historical optimal sequence. This is the historical optimal sequence for all particles. For sequence Transform to sequence speed, and for The probability value within, For probability values Each commutator in the retention action's velocity, For probability values Each commutator in the retention action's velocity, This is to combine all the exchange operators for velocities a and b.

2. The adaptive distributed radar anti-intermittent sampling and forwarding interference method according to claim 1, characterized in that, The interference alignment process includes using the echo signal from the first receiving station as a reference signal. For the echo signals of the other receiving stations Alignment is then performed.

3. The adaptive distributed radar anti-intermittent sampling and forwarding interference method according to claim 1, characterized in that, S1 includes S1.1, interference delay alignment including calculation of reference signal. Compared with the echo signals from other receiving stations The relevant functions are shown in equation (1): （1）； In the formula, The echo signal from the first receiving station. For the conjugate operation of complex numbers, For convolution operations, The value of the echo signal from the m-th receiving station at discrete time -k after conjugation and time reversal. No. The time delay difference between the interference of the receiving station signal and the interference of the reference signal. Depend on The maximum value is obtained as shown in equation (2): （2）； In the formula, Let be the value of the cross-correlation function between the echo signal from the first receiving station and the echo signal from the m-th receiving station at discrete time k. For mold taking operation; when The formula for calculating the signal after interference delay alignment at the m-th receiving station is as follows: As in equation (3): （3）； In the formula, Let be the echo signal from the m-th receiving station, after the first processing, and its value at discrete time n. The echo signal of the m-th receiving station in discrete time The value at; when The formula for calculating the signal after interference delay alignment at the m-th receiving station is as follows: As in equation (4): （4）。 4. The adaptive distributed radar anti-intermittent sampling and forwarding interference method according to claim 1, characterized in that, S1 includes S1.2, interference phase alignment dephase difference, as shown in equation (5): （5）； In the formula, Let be the phase difference between the echo signal from the first receiving station and the echo signal from the m-th receiving station. For phase extraction, The value of the echo signal from the first receiving station at discrete time n after the first processing. The value of the echo signal from the m-th receiving station at discrete time -n after the first processing, conjugate operation, and time reversal. Phase compensation is performed based on the phase difference in equation (5), as shown in equation (6): （6）； In the formula, Let be the value of the echo signal from the m-th receiving station at discrete time n after the second processing.

5. The adaptive distributed radar anti-intermittent sampling and forwarding interference method according to claim 1, characterized in that, S1 includes S1.3, interference amplitude alignment, which includes utilizing the high-power characteristics of intermittent sampling forwarding interference, in the time domain of the echo signal, locating the interference signal through a dual sliding window bidirectional constant false alarm rate detector, determining the range of the target echo and interference and estimating the amplitude of the interference, and then aligning the interference amplitude of the remaining receiving station signals with the reference signal, as shown in equation (7): （7）； In the formula, Let be the value of the echo signal from the m-th receiving station at discrete time n after the third processing. The interference amplitude of the first receiving station. Let be the interference amplitude of the m-th receiving station.

6. The adaptive distributed radar anti-intermittent sampling and forwarding interference method according to claim 1, characterized in that, The iterative process also includes a sequence update and acceptance judgment process for the sequence optimization simulated annealing-particle swarm search algorithm, for particles. The sequence is updated according to formula (14): （14）； In the formula, Let be the sequence of particles at time t. Let be the updated particle velocity at time t. For position Execution speed All commutation operators in the middle; The evaluation value of the particle sequence is assessed using equation (10), and the updated particles are determined according to the Metropolis criterion, as shown in equation (15): （15）； In the formula, for The probability value within, The difference between the new and old sequence evaluation values ​​of the particle is used; if the decision condition of equation (15) is not accepted, the particle's velocity and sequence are updated again until the upper limit is reached. Accepted later; After traversing all particles, update the globally optimal sequence. and the historical optimal sequence of each particle Then proceed to the next iteration, until the maximum number of iterations is reached. Then stop and output the globally optimal sequence. The corresponding final fusion signal .

Images