A matrix deception jamming method for networked radars

Abstract

The application provides a matrix deception jamming method for networked radars. The method uses small unmanned aerial vehicles and other carriers with hovering function to cooperate with jamming sources to construct a jamming matrix in the appropriate airspace in each network radar detection direction. Each unmanned aerial vehicle-borne jamming point source in the matrix is a jamming pixel. Through the ordered signal radiation of the jamming pixels in the jamming matrix at each radar and the cooperative work between different jamming matrices, multiple false point tracks generated at different times satisfy the geometric convergence relationship of the reverse extension line in space, and then multiple self-consistent false tracks are formed on each networked radar, and finally the deception effect is completed. The method provided by the application reduces the comprehensive movement range of the nodes in the cluster in the entire airspace, improves the robustness of the false track fusion, reduces the distance between the jamming pixels and the deceived radars, reduces the contribution of the single node to the fusion error of the system, and reduces the dependence of the deception jamming on the prior information.

Description

Technical Field

[0001] This application relates to the field of unmanned swarm electronic warfare technology, and in particular to a matrix-style deception jamming method for networked radar. Background Technology

[0002] In recent years, the confrontation between radar and electronic warfare sides has intensified, with various jamming and anti-jamming methods emerging one after another. Both sides are constantly vying for control of the battlefield by obtaining effective battlefield information. Networked radar technology was born in this context. Faced with the powerful detection capabilities and anti-jamming capabilities of networked radar, ordinary jamming techniques are almost ineffective. It is necessary to design cooperative distributed jamming using mobile platforms such as UAVs to improve the efficiency of the jamming side's resource utilization against networked radar.

[0003] Traditional deception jamming is an anti-deception jamming method based on signal processing. Its core is to eliminate interference by utilizing the differences between real and false target echo signals. However, as the realism of the deception signal increases, the difficulty of interference identification increases, and it becomes inevitable that the deception signal will pass through the signal layer's discrimination and enter the data processing layer. Furthermore, when the target's signal-to-noise ratio decreases and its observability deteriorates, the accuracy of the above methods in correctly identifying real targets will be significantly affected. Existing literature has designed single-radar anti-range deception jamming methods based on data processing. Further, it has designed centralized network radar anti-range deception jamming methods based on data processing. Utilizing the radar network's advantages in target detection and tracking, and employing a method of same-source measurement verification, range deception jamming can be effectively eliminated. For multi-site network radars distributed in the airspace, traditional methods often treat the entire airspace as a whole for analysis, calculating the projected position on a unified mapping plane using UAV nodes, etc. Given the known target location and the ability to locate itself, this method requires UAV nodes to achieve accurate convergence of false tracks through high-precision variable acceleration coordination within a large airspace. The coordination accuracy of the entire system and the flight control capabilities of the UAV nodes are both required to be high. The error redundancy of the entire deception process is small, making it easy to be filtered by the cross-validation detection algorithm of the networked radar, thus losing the deception effect. Summary of the Invention

[0004] This application provides a matrix-based deception jamming method for networked radar, which can be used to solve the technical problems of high coordination accuracy and high flight control capability of UAV nodes in current methods.

[0005] This application provides a matrix-style deception and jamming method for networked radar, the method comprising:

[0006] Step 1: Arrange the interfering pixels according to the set method, and pre-set multiple false tracks in the distant space;

[0007] Step 2, initial arrangement of the interference matrix is performed:

[0008] The interference pixels in the interference matrix enter the airspace in the radar detection direction according to the initial arrangement mode to perform cooperative reconnaissance, the relative distance d of the pixels and the radar is adjusted to evaluate the scanning range, scanning period and main lobe beam arrangement of the radar to be deceived, and the arrangement mode of the pixels in the interference matrix is set according to the evaluation result and the pixel maneuvering capability level, so as to ensure that the pixel interval matches the beam arrangement of the radar;

[0009] Step 3, pixel frequency storage and forwarding is performed:

[0010] When the activated interference pixels JAM active in each radar track capture the radar main lobe signal, frequency storage and reverse forwarding need to be performed according to the intercepted radar signal, that is, the reverse direction of the intercepted signal direction vector, the same form of waveform is radiated into the receiver of the radar to be deceived, and a false target track with a distance L nkm is formed by using delay; activation refers to the movement of the projection point on the mapping surface F km due to the position of the false track TR n advancing with time;

[0011] Step 4, interference pixel maneuvering is performed: the interference pixel maneuvering is performed by combining hovering and maneuvering of the interference pixels; the projection point and the interference pixel are one-to-one corresponding, that is, when the interference matrix is initialized and arranged, the I pixels JAM nk1 ~JAM nkI participating in the same track deception are arranged according to the increasing order of the sampling time P nk0 , P nk1 , P nk2 ,..., P nkI-1 ; the false track is a continuous target motion process, and the false track is sampled according to the time interval Δt=t m+1 -t m .

[0012] Further, step 1, a plurality of false tracks in a remote space are pre-set, including:

[0013] The pre-set k false tracks are respectively denoted as TRACE1, TRACE2,..., TRACE k , the maneuvering speed V k is set in each track, the false track of the kth track at time t m is TR km , the known fixed positions of the n networked radars are O1, O2,..., O n ; in front of the detection direction of each radar to be deceived at a distance d, the corresponding interference matrix MATRIX nThe surface where the array is located is the mapping surface F n All the false point traces TR km The projection position coordinates P nkm on each mapping surface and the corresponding false point trace distances L nkm constitute a first set; all the jamming pixels JAM nki that are in the task of deceptive jamming need to hover or maneuver according to the positions in the first set, and during this process, the false point traces are constructed according to the distances in the first set; the subscript i represents the number of jamming pixels participating in the construction of the false track,

[0014] When all the jamming pixels cooperate in maneuvering according to the projection positions of the false tracks on the respective mapping surfaces, and the false point trace distances are modulated through the frequency storage signal delay forwarding of each group network radar, finally, a plurality of false tracks are formed according to the pre-designed state.

[0015] Further, step 2, initial arrangement of the jamming matrix, including:

[0016] Let the position coordinates of the radar be O n (x n ,y n ,z n ), at the initial moment, the spatial position of the false point trace is TR km (x km ,y km ,z km ), the false point trace distance from the radar is L nkm = [(x km -x n ) 2 +(y km -y n ) 2 +(z km -z n ) 2 ] 1 / 2 The spatial position of the current point at the mapping surface projection point P nkm at a distance d is (x n +d(x km -x n ) / L nkm ,y n +d(y km -y n ) / L nkm ,z n +d(z km -z n ) / L nkm ).

[0017] Suppose there are a total of I interfering pixels participating in the target track under the current radar. Using a simple matrix construction method where projection points correspond one-to-one with interfering pixels, the i-th interfering pixel JAM... nki The initial position coordinates should be P. nkm+i-1 =(x n +d(x km+i -1-x n ) / L nkm+i -1,y n +d(y km+i -1-y n ) / L nkm+i -1,z n +d(z km+i-1 -z n ) / L nkm+i -1), where i≤I.

[0018] Furthermore, the total number of interfering pixels I is greater than or equal to 3.

[0019] Furthermore, during the relay of the jamming pixel, the pixel is positioned according to the distance L between the fake dot and the radar. nkm The value is calculated with a delay.

[0020] Further, step 4 involves performing interference pixel maneuvers, including:

[0021] In the false track with V k Speed ​​by TR k0 Position movement to TR k1 At that time, the first interfering pixel JAM nk1 As the active pixel JAM active On the mapping surface, with d·V k / L nk0 Speed ​​by P nk0 Movement to P nk1 Other pixels remain suspended;

[0022] Immediately following, when the false track was V k Speed ​​by TR k1 Position movement to TR k2 At that time, the second interfering pixel JAM nk2 As the active pixel JAM active On the mapping surface, with d·V k / L nk1 Speed ​​by P nk1 Movement to P nk2 The first pixel moves to the subsequent projection position, while the remaining pixels remain hovering.

[0023] And so on, until the I-th interfering pixel JAM nkI As the active pixel JAM active On the mapping surface, with d·Vk / L nkI -1 velocity from P nkI-1 move to P nkI After that, all I pixels are traversed.

[0024] If the track does not stop, repeat the above process, starting from the first jamming pixel JAM nk1 As the active pixel JAM active On the mapping plane, d·V k / L nkI velocity from P nkI move to P nkI+1 , forming a circular relay maneuver.

[0025] The matrix deception jamming method proposed in the application has the beneficial effects that: compared with the traditional deception jamming method of unmanned aerial vehicles on the networked radar, the method divides the projection mapping plane of the original false track on the unmanned aerial vehicle from a large area covering the entire networked radar into a small area of each radar node, on the one hand, reduces the comprehensive movement range of the unmanned aerial vehicle cluster in the entire airspace, reduces the demand for the coordination accuracy of pixels and the dynamic flight control capability of the unmanned aerial vehicle platform, and improves the robustness of false track fusion; on the other hand, the distance between the jamming pixel and the deceived radar is reduced, and in the scenario where the false tracks converge far away, the value weakens the contribution of the fusion error, so that the dependence of the deception jamming on the prior information is reduced; finally, the mapping methods of the multiple tracks are the same and have no strict synchronization requirement, and the resource utilization rate of each pixel is high, so that the false track has good editability. BRIEF DESCRIPTION OF DRAWINGS

[0026] Figure 1 The interference pixel composition schematic diagram provided for the embodiment of the application;

[0027] Figure 2 The false track generation principle schematic diagram of the interference matrix provided for the embodiment of the application;

[0028] Figure 3 The deception scene schematic diagram of the interference matrix provided for the embodiment of the application;

[0029] Figure 4 The interference matrix deception jamming flowchart of the networked radar provided for the embodiment of the application;

[0030] Figure 5 The example scene deception jamming schematic diagram provided for the embodiment of the application. DETAILED DESCRIPTION

[0031] In order to make the purpose, technical scheme and advantages of the application clearer, the embodiments of the application will be further described in detail below with reference to the drawings.

[0032] The application provides a matrix deception jamming method for networked radars, in which a regular jamming matrix composed of multiple jamming pixels is formed in a reasonable airspace in the detection direction of each networked radar and is kept in a periodic hovering or maneuvering state. Each jamming pixel has the basic functions of storing, delay modulating and radiating and retransmitting the jammed radar signal and the data interaction function with other pixels, ensuring the accuracy of coordinated signal transmission.

[0033] When the signal of the jammed radar is captured by the corresponding jamming pixel in the jamming matrix during the radar beam scanning process, the retransmitted signal is delay modulated according to the spatial position relationship to form a false point trace; the jamming matrices at different positions of the networked radars cooperate with each other to ensure that the generated false point traces can converge on the reverse extension lines of the main lobe detection directions of the respective radars, thereby forming multiple self-consistent false tracks.

[0034] When the spatial coverage requirement of the false track exceeds the shielding range of the existing hovering jamming matrix to the radar, the idle jamming pixels in the matrix are allowed to maneuver to blind, reorganize a new jamming matrix along the movement direction of the false track, and ensure the continuity and realism of the false track.

[0035] In order to fully utilize the jamming matrix resources and reasonably plan the hovering airspace of the jamming matrix and the relative spatial position of the pixels, passive reconnaissance can be performed on the matrix before the jamming is turned on, to assist in judging the key parameters of the jammed radar, such as the main lobe position, scanning period and scanning mode, and the above information is used as input to dynamically adjust the arrangement mode of the jamming matrix.

[0036] The false track can be pre-designed and planned by algorithm, and the spatial convergence point is mapped back to the corresponding jamming matrix according to the detection direction of the different radars, and the signal modulation is completed by the pixels in the matrix. Meanwhile, the number of false tracks formed should be limited by the number of pixel resources in the jamming matrix.

[0037] Next, the embodiments of the application will be described in combination with the drawings.

[0038] Step 1, arrange the jamming pixels in a set manner, and pre-set multiple false tracks in a remote space; the method provided by the application is arranged by multiple jamming pixels in a certain manner. Each jamming pixel is a jamming point source, which is usually integrated on a small unmanned aerial vehicle with hovering function. Each jamming pixel can intercept the radar signal irradiated to itself, and after digital storage, delay modulation and other signal processing, the signal is radiated in the opposite direction of the incident path through an antenna, as shown in Figure 1 The multiple jamming pixels are arranged in a certain spatial position rule, and temporarily reside (or slightly maneuver) in the hovering manner in the detection direction of the jammed radar, forming a jamming matrix. The jamming matrix intercepts and retransmits the scanning beam of the countermeasure radar, and finally completes the deception jamming situation with multiple false tracks, as shown inFigure 2 as shown.

[0039] For electronic deception networking radar, the core point is that each radar receives interference pixel signals to form false points that can converge into the same point in space along the respective radar detection direction. The false tracks formed by the continuous convergence points can not be filtered out by the poor verification algorithm of the networking radar due to logical self-consistency, which ultimately consolidates the deception effect. From the perspective of engineering implementation, the scheme pre-sets multiple false tracks in the space far away. According to the connection between a point on the track and each networking radar, the specific azimuth, pitch and modulation distance information of the interference pixel signal radiation should be obtained, as shown in Figure 3 .

[0040] In Figure 3 , TRACE1, TRACE2,..., TRACE k represent the pre-set k false tracks, and the maneuvering speed V k is set in each track. The false point of the kth track at time t m is TR km , and the known fixed positions of the n networking radars are O1, O2,..., O n ; in front of the detection direction of each radar to be deceived at a distance d, the surface where the corresponding interference matrix MATRIX n is located is called the mapping surface F n . The projection position coordinates P nkm of all false points TR km on the mapping surface and the corresponding false point distance L nkm form the first set; all interference pixels JAM nki under the task of deception jamming, subscript i represents the number of interference pixels participating in the construction of the false track, which needs to hover or maneuver according to the position in the first set, and during this period, false points are constructed according to the distance in the first set. When all interference pixels cooperate with each other according to the projection position of the false track on the respective mapping surface, and modulate the false point distance through the frequency storage signal delay forwarding of each networking radar, multiple false tracks can be formed according to the pre-designed state.

[0041] Step 2, initial arrangement of matrix.

[0042] The interference pixels in the interference matrix enter the airspace in the radar detection direction according to the initial arrangement mode, and through the continuous adjustment of the relative distance d between the pixels and the radar, the key information such as the scanning range, scanning period and main lobe beam position arrangement of the radar to be deceived is evaluated, and d and the arrangement mode of the pixels in the interference matrix are reasonably set according to the evaluation results and the pixel maneuvering ability level, so as to match the pixel interval with the beam position setting of the radar as much as possible, and avoid waste or local sparseness of pixel resources.

[0043] Let's take a general scenario as an example. Assume the radar's position coordinates are O. n For (x) n ,y n ,z n At the initial moment, the spatial location of the dummy dot is TR. km The coordinates are (x km ,y km ,z km ), Fake dot range radar L nkm =[(x km -x n ) 2 +(y km -y n ) 2 +(z km -z n ) 2 ] 1 / 2 The projection point P of the current point onto the mapping surface at a distance d nkm The spatial location is (x n +d(x km -x n ) / L nkm ,y n +d(y km -y n ) / L nkm ,z n +d(z km -z n ) / L nkm ).

[0044] Suppose there are a total of I interfering pixels participating in the target track under the current radar. Using a simple matrix construction method where projection points correspond one-to-one with interfering pixels, the i-th interfering pixel JAM... nki The initial position coordinates should be P. nkm+i-1 =(x n +d(x km+i-1 -x n ) / L nkm+i-1 ,y n +d(y km+i-1 -y n ) / L nkm+i-1 ,z n +d(z km+i-1 -z n ) / L nkm+i-1 ), where i≤I.

[0045] Step 3, pixel frequency storage and forwarding.

[0046] After the matrix completes its initial array setup, when the JAM of the interfering pixels activated in each track of each radar... activeAfter capturing the radar main lobe signal, it is necessary to perform frequency storage delay and reverse forwarding based on the intercepted radar signal, that is, to reverse the direction vector of the intercepted signal. By radiating the same waveform into the receiver of the radar to be deceived, a frequency-delayed signal is formed at a distance of L. nkm False target points;

[0047] In this method, the distance d between the interference matrix mapping surface and the radar is generally much smaller than the distance L between the dummy spot and the radar. nkm During the relay of interfering pixels, the delay modulation is insensitive to the time difference caused by d. Under approximate conditions, the pixel is based on the distance L between the dummy mark and the radar. nkm The value is calculated with a delay, which means that the timing accuracy requirement of the entire jamming and deception system is reduced, and the robustness is improved. Activation refers to the effect of false track TR... km The position of the object on the mapping surface F as time progresses. n The projection point moves, and the interference pixel JAM in the interference matrix is ​​responsible for simulating this change. active The interference matrix maneuver will be explained in detail in the next step.

[0048] Step 4, Interference Pixel Maneuver. A false track is a continuous target movement process; false dots are generated at certain time intervals Δt = t. m+1 -t m Sampling of the flight path; to simulate this continuous motion process, this application employs a method combining hovering and maneuvering of interfering pixels on the mapping surface. The most intuitive method is a one-to-one correspondence between projection points and interfering pixels, i.e., when initializing the interfering matrix, I pixels JAM participating in the same flight path deception... nk1 ~JAM nkI P follows an increasing pattern according to the sampling time sequence nk0 P nk1 P nk2 ... P nkI-1 Take your positions;

[0049] In the false track with V k Speed ​​by TR k0 Position movement to TR k1 At that time, the first interfering pixel JAM nk1 As the active pixel JAM active On the mapping surface, with d·V k / L nk0 Speed ​​by P nk0 Movement to P nk1 Other pixels remain suspended;

[0050] Immediately following, when the false track was V k Speed ​​by TR k1 Position movement to TR k2The 2nd jamming pixel JAM nk2 As the active pixel JAM active On the mapping surface with d·V k / L nk1 The speed from P nk1 Move to P nk2 ; The first pixel maneuvers to the subsequent projection position, and the remaining pixels remain hovering;

[0051] By analogy, until the Ith jamming pixel JAM nkI As the active pixel JAM active On the mapping surface with d·V k / L nkI-1 The speed from P nkI-1 Move to P nkI After that, the traversal of all I pixels is completed;

[0052] If the track does not stop, repeat the above process, starting from the 1st jamming pixel JAM nk1 As the active pixel JAM active On the mapping surface with d·V k / L nkI The speed from P nkI Move to P nkI+1 , forming a circular relay maneuvering form.

[0053] In the track deception process, there is and only one maneuvering pixel JAM active After capturing the radar main lobe signal, the pixel allowed to implement step 3 is frequency storage and retransmission; other non-active pixels, or active pixels not illuminated by the radar main lobe are not allowed to produce signal radiation behavior, otherwise it will destroy the convergence effect of the track and affect the overall deception realism degree.

[0054] In general, the number of activated pixels in each interference matrix is equal to the number of false tracks. The signal forwarding time during pixel activation is related to the radar scanning mode. When the radar is in a wide-range scanning mode, an activated pixel may not be able to forward signals throughout the activation period. When the radar is in a tracking mode, the activated pixel may continuously forward signals. In a minimalist configuration, only a single pixel is involved in the deception process of a track, i.e., I = 1, and the pixel is an activated pixel throughout the process. Due to the different motion speeds of the projection points on the mapping surface, a single activated pixel needs to fly at variable speeds according to its location, which requires a higher control capability of the pixel's unmanned aerial vehicle and a lower tolerance for the pixel's absolute navigation accuracy. With error accumulation, the false track formed by a single pixel will gradually oscillate and diverge until it completely deviates from the convergence state. When multiple pixels are involved in the deception of the same track, the mapping surface path is locally divided into several small segments. Under the approximate condition, the segments can be relayed at a constant speed in a straight line at a set speed, with a small error. At the same time, there is sufficient opportunity to adjust the position of the next activated node, which is equivalent to continuously calibrating the position during the relay process. The convergence effect of the overall false track is more accurate and durable, and the realism is higher. However, too many pixels will result in a sharp increase in system cost. A reasonable system configuration can be obtained by weighing the effectiveness and cost. The present application recommends that I be no less than 3. In the relay mode with I > 1, the speed V k The sampling interval Δt of the track should be reasonably set. A small projection point spacing will result in a short relay handover period, reducing the overall stability of the system.

[0055] The following will be described in conjunction with a specific simulation scenario as a specific example. There are three networked radars in space with coordinates O1(0, 0, 0), O2(5000, 3000, 0), and O3(0, 5000, 0). There are three false tracks TR1, TR2, and TR3, all with a flight speed of 300 m / s, and a sampling time interval Δt of 4 s. The three flight trajectories are parallel and start from (15000, 1000, 5000), (15000, 2500, 5000), and (15000, 4000, 5000), respectively, and move in the direction perpendicular to the xz plane towards the x decreasing direction at a constant speed. The distance between the interference pixels and each radar is set to d = 3000. In this scenario, the pixel arrangement state of each interference matrix is as shown in Figure 5

[0056] Assuming that each track in the matrix is deceived by three pixels, the number of activated pixels in each matrix is as shown in Table 1. Figure Five ​The position coordinates of the projection plane are formed every three times to form a relay cycle, and the track is advanced until the track is out of the radar detection boundary. When the number of radars in the scene, the radar position, the number of false tracks, the complexity of the false tracks, the scale of the interference matrix, and other parameters change, the basic flow of the scheme remains unchanged.

[0057] To sum up, the above is only a preferred embodiment of the present application, and is not used to limit the protection scope of the present application. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present application shall be included in the protection scope of the present application.

[0058] The above-described embodiments of the present application do not constitute a limitation on the protection scope of the present application.

Claims

1. A matrix-style deception jamming method for networked radar, characterized in that, The method includes: Step 1: Arrange the interfering pixels according to the set method, and pre-set multiple false tracks in the distant space; Step 2, perform initial arrangement of the interference matrix: The interfering pixels in the interference matrix enter the airspace above the radar detection direction for collaborative reconnaissance according to the initial arrangement. The scanning range, scanning period, and main lobe beam position arrangement of the radar to be deceived are evaluated by adjusting the relative distance d between the pixels and the radar. Based on the evaluation results, the pixel maneuverability level d and the arrangement of pixels in the interference matrix are set to ensure that the pixel spacing matches the radar beam position setting. Step 3, perform pixel frequency storage and forwarding: When the jamming pixels JAM are activated in each track of each radar active After capturing the radar main lobe signal, it is necessary to perform frequency storage delay and reverse forwarding based on the intercepted radar signal, that is, to reverse the direction vector of the intercepted signal. By radiating the same waveform into the receiver of the radar to be deceived, a frequency-delayed signal is formed at a distance of L. nkm False target points; activation refers to the activation caused by false track TR. km The position of the object on the mapping surface F as time progresses. n The upper projection point moves; Step 4, Perform interference pixel maneuvers: Interference pixel maneuvers are performed using a combination of hovering and maneuvering. The projection points correspond one-to-one with the interference pixels; that is, during the initial arrangement of the interference matrix, I pixels (JAMs) participating in the same track deception... nk1 ~JAM nkI P follows an increasing pattern according to the sampling time sequence nk0 P nk1 P nk2 ... P nkI-1 Positioning; a false track is a continuous target movement process, while a false dot is formed according to a time interval Δt = t m+1 -t m Sampling of flight paths.

2. The method according to claim 1, characterized in that, Step 1: Pre-set multiple false tracks in distant space, including: The pre-set k spurious tracks are denoted as TRACE1, TRACE2, ..., TRACE... k A maneuvering speed V is set for each flight path. k The k-th track is at t m The false dot trace at time point is TR km The known fixed positions of n networked radars are O1, O2, ..., O n At a distance d ahead of the detection direction of each radar to be deceived, the corresponding interference moment MATRIX n The surface on which the array lies is the mapping surface F. n All false dots TR km The projection position coordinates P on each mapping plane nkm And the corresponding pseudo-dot distance L nkm The first set consists of all interfering pixels (JAM) in the deception / interference task. nki It is necessary to hover or maneuver based on the position in the first set, and construct fake tracks based on the distance in the first set during this process; the subscript i indicates the number of interfering pixels involved in the construction of this fake track; When all the interfering pixels coordinate to maneuver according to the projection position of the false tracks on their respective mapping surfaces, and perform false track range modulation on each network radar through frequency storage signal delay and forwarding, multiple false tracks are finally formed in a pre-designed state.

3. The method according to claim 1, characterized in that, Step 2, perform initial arrangement of the interference matrix, including: Let the radar's position coordinates O n For (x) n ,y n ,z n At the initial moment, the spatial location of the dummy dot is TR. km The coordinates are (x km ,y km ,z km ), Fake dot range radar L nkm =[(x km -x n ) 2 +(y km -y n ) 2 +(z km -z n ) 2 ] 1 / 2 The projection point P of the current point onto the mapping surface at a distance d nkm The spatial location is (x n +d(x km -x n ) / L nkm ,y n +d(y km -y n ) / L nkm ,z n +d(z km -z n ) / L nkm ); Suppose there are a total of I interfering pixels participating in the target track under the current radar. Using a simple matrix construction method where projection points correspond one-to-one with interfering pixels, the i-th interfering pixel JAM... nki The initial position coordinates should be P. nkm+i-1 =(x n +d(x km+i-1 -x n ) / L nkm+i-1 ,y n +d(y km+i-1 -y n ) / L nkm+i-1 ,z n +d(z km+i-1 -z n ) / L nkm+i-1 ), where i≤I.

4. The method according to claim 1, characterized in that, The total number of interfering pixels (I) is greater than or equal to 3.

5. The method according to claim 1, characterized in that, During the jamming pixel relay process, the pixel is based on the distance L between the fake dot and the radar. nkm The value is calculated with a delay.

6. The method according to claim 1, characterized in that, Step 4, perform interference pixel maneuvers, including: In the false track with V k Speed ​​by TR k0 Position movement to TR k1 At that time, the first interfering pixel JAM nk1 As the active pixel JAM active On the mapping surface, with d·V k / L nk0 Speed ​​by P nk0 Movement to P nk1 Other pixels remain suspended; Immediately following, when the false track was V k Speed ​​by TR k1 Position movement to TR k2 At that time, the second interfering pixel JAM nk2 As the active pixel JAM active On the mapping surface, with d·V k / L nk1 Speed ​​by P nk1 Movement to P nk2 The first pixel moves to the subsequent projection position, while the remaining pixels remain hovering. And so on, until the I-th interfering pixel JAM nkI As the active pixel JAM active On the mapping surface, with d·V k / L nkI-1 Speed ​​by P nkI-1 Movement to P nkI Then, complete the traversal of all I pixels; If the trajectory does not stop, repeat the above process, starting with the first interfering pixel JAM. nk1 As the active pixel JAM active On the mapping surface, with d·V k / L nkI Speed ​​by P nkI Movement to P nkI+1 This forms a cyclical relay-style motorized operation.

Images