CN111781564A - Rapid prejudging method for jitter signal pulse sequence - Google Patents

Abstract

The invention belongs to the technical field of radar data processing and signal sorting, and particularly relates to a rapid prejudging method for a jitter signal pulse sequence, which solves the problem of false signals caused by the false entering of the jitter signal sequence into a conventional sorting module by carrying out sequence type prejudging before signal sorting; the method comprises the following implementation steps: (1) performing first-level difference histogram statistics of arrival time differences on the input pulse sequence; (2) judging whether the grid width is reduced or not and carrying out primary difference histogram statistics again; (3) performing a first conditional decision of the shaking pulse sequence according to the statistical result; (4) finding out all pulses which meet the jitter search condition in the pulse sequence according to the first judgment result; 5. and executing secondary condition judgment of the jitter pulse sequence and outputting a final sequence type pre-judgment result. The invention is beneficial to reducing false signals and improving the sorting accuracy of the jitter signals, and can be used for a radar detection system.

Description

Rapid prejudging method for jitter signal pulse sequence

Technical Field

The invention belongs to the technical field of radar data processing and signal sorting, and particularly relates to a rapid prejudging method for a jitter signal pulse sequence.

Background

In signal sorting, for conventional signals, including PRI fixed signals and spread signals, histogram statistics are usually performed by using histogram bins with fixed widths. In contrast, the repetition frequency jitter signal needs to be counted by using a histogram grid with overlapping ranges. The two processing flows are different, and engineering implementation is generally divided into two different sorting modules. In an actual environment, because the existence of the conventional signal can reduce the sorting accuracy of the jitter signal, a sorting flow of sorting the conventional signal first and then sorting the jitter signal is generally adopted, that is, the input pulse buffer firstly enters the conventional signal sorting module and then enters the jitter signal sorting module. However, the jittered signal pulses, particularly jittered signals with a small jitter range, may have similar time domain characteristics to the regular signal in a short time, so that there is a small probability that a false regular signal will be generated when entering the regular signal sorting module. The existing signal sorting method can only reduce the probability of the situation by adopting targeted processing measures such as increasing sequence search condition limitation and the like, and cannot solve the problem fundamentally.

Therefore, the type of the input pulse buffer sequence needs to be pre-judged before signal sorting, if the jitter pulse sequence is judged, the conventional sorting module is skipped over to directly enter the jitter sorting module, and the false signal problem caused by the fact that the jitter signal sequence enters the conventional sorting module is avoided. Moreover, due to the requirement of high real-time performance of signal sorting, the sequence type pre-judging method is not suitable for consuming more computing resources, and how to realize rapid pre-judging is also the key point.

Disclosure of Invention

The invention aims to provide a method for quickly pre-judging a jitter signal pulse sequence, which is used for pre-judging the type of an input pulse buffer sequence before signal sorting, directly introducing pulses judged to be the jitter pulse sequence into a jitter signal sorting module, reducing false signals and improving the sorting accuracy of the jitter signals.

In order to achieve the technical purpose, the invention comprises the following steps:

step 1: the arrival time difference primary difference histogram statistics is carried out on the input pulse sequence, and the grid width is set as x₁Sorting the statistical values from big to small, and respectively identifying the statistical value set and the subscript set of the first N lattices as N_topNAnd idx_topNN is a positive integer, and the statistic of the grid with the largest statistic is marked as N_maxCorresponding PRI identification_max；

Step 2: calculating idx_topNThe difference value between the subscript of the middle and maximum grids and the subscript of the minimum grid is less than or equal to a set threshold n_thThe width of the grid is reduced to x₂，x₂＜x₁Then, againPerforming arrival time difference primary difference histogram statistics on the input sequence, and updating n_topN、idx_topN、pri_max、n_max；

And step 3: computing

If r is satisfied₁> 0.5 or r₂If any condition is more than 0.4, the sequence is judged not to be a shaking pulse sequence, wherein N_totalIs the total number of pulses contained in the input pulse sequence; if not, entering step 4;

and 4, step 4: traversing the pulse sequence, calculating the arrival time difference dtoa of each pulse and the previous pulse, and finding out the pulse sequence satisfying the jitter search condition of | dtoa-pri_max|≤pri_max*ratio_jAll pulses of 2, the number of which is denoted n_jitterWherein ratio_jIs the maximum jitter radius of the supported jitter signal;

and 5: calculating n found_jitterMean arrival time difference of pulses dTAA_meanSum standard deviation dTAA_stdCalculating

Judging whether the condition is satisfied

If the signal is satisfied, the signal is judged to be a jitter pulse sequence, and if the signal is not satisfied, the signal is judged to be a non-jitter sequence.

The invention has the beneficial effects that: aiming at the problem that the conventional signal is possibly generated by missorting when a small-range jitter signal enters a conventional sorting module, the method for quickly prejudging the jitter signal pulse sequence is provided.

Drawings

FIG. 1 is a flow chart of an embodiment of the present invention.

Detailed Description

FIG. 1 is a flow chart of an embodiment of the present invention. With reference to the accompanying drawings, the specific steps of this embodiment are:

step 1: the arrival time difference of the input pulse sequence is subjected to one-level difference histogram statistics, namely, the first-level difference is that only the arrival time difference of adjacent pulses is calculated, and the grid width is set as x during the statistics₁；

After statistics is completed, the statistics values are sorted from big to small, and the statistics value set of the first N grids is marked as N_topNThe subscript set of the first N lattices is identified as idx_topNN is a positive integer; the statistic of the maximum grid is marked as n_maxCorresponding PRI identification_max；

Step 2: compute set idx_topNThe difference value between the subscript of the middle and maximum grids and the subscript of the minimum grid is less than or equal to a set threshold n_thThe width of the grid is reduced to x₂，x₂＜x₁And carrying out arrival time difference primary difference histogram statistics on the input pulse sequence again, and updating n_topN、idx_topN、pri_max、n_max；

And step 3: computing

If r is satisfied₁> 0.5 or r₂If any condition is more than 0.4, the sequence is judged not to be a shaking pulse sequence, wherein N_totalIs the total number of pulses contained in the input pulse sequence; if not, entering step 4;

(3.1) calculating r₁If r is₁If the pulse sequence is more than 0.5, judging that the sequence is not a shaking pulse sequence;

(3.2) calculating r₂If r is₂If the pulse sequence is more than 0.4, judging that the sequence is not a shaking pulse sequence;

(3.3) if neither of the conditions in 3.1 and 3.2 are met, entering step 4;

and 4, step 4: traversing the pulse sequence, calculating the arrival time difference dtoa of each pulse and the previous pulse, and finding out the pulse sequence satisfying the jitter search condition of | dtoa-pri_max|≤pri_max*ratio_jAll pulses of 2, the number of which is denoted n_jitterWherein ratio_jIs the maximum jitter radius of the supported jitter signal;

and 5: calculating n found_jitterMean arrival time difference of pulses dTAA_meanSum standard deviation dTAA_stdCalculating

Judging whether the condition is satisfied

If the signal is satisfied, the signal is judged to be a jitter pulse sequence, and if the signal is not satisfied, the signal is judged to be a non-jitter sequence.

(5.1) calculating the searched n_jitterMean difference of arrival (dTAA) of a sequence of shaking pulses_meanSum standard deviation dTAA_std；

(5.2) calculating r₃；

And (5.3) judging whether the conditions shown in the formula 4 are met, if so, judging the sequence to be a jitter pulse sequence, and if not, judging the sequence to be a non-jitter sequence.

Claims (3)

1. A method for fast prejudging a jitter signal pulse sequence is characterized in that:

step 1: the arrival time difference primary difference histogram statistics is carried out on the input pulse sequence, and the grid width is set as x₁Sorting the statistical values from big to small, and respectively identifying the statistical value set and the subscript set of the first N lattices as N_topNAnd idx_topNN is a positive integer, and the statistic of the grid with the largest statistic is marked as N_maxCorresponding PRI identification_max；

Step 2: calculating idx_topNThe difference value between the subscript of the middle and maximum grids and the subscript of the minimum grid is less than or equal to a set threshold n_thThe width of the grid is reduced to x₂，x₂＜x₁And carrying out arrival time difference primary difference histogram statistics on the input sequence again, and updating n_topN、idx_topN、pri_max、n_max；

And step 3: computing

If r is satisfied₁> 0.5 or r₂If any condition is more than 0.4, the sequence is judged not to be a shaking pulse sequence, wherein N_totalIs the total number of pulses contained in the input pulse sequence; if not, entering step 4;

and 4, step 4: traversing the pulse sequence, calculating the arrival time difference dtoa of each pulse and the previous pulse, and finding out the pulse sequence satisfying the jitter search condition of | dtoa-pri_max|≤pri_max*ratio_jAll pulses of 2, the number of which is denoted n_jitterWherein ratio_jIs the maximum jitter radius of the supported jitter signal;

and 5: calculating n found_jitterMean arrival time difference of pulses dTAA_meanSum standard deviation dTAA_stdCalculating

Judging whether the condition is satisfied

If the two sequences are satisfied, the sequence is determined to be a jitter pulse sequence, and if the two sequences are not satisfied, the sequence is determined to be a non-jitter sequence.

2. The method according to claim 1, wherein said step 3 comprises:

(3.1) calculating r₁If r is₁If the pulse sequence is more than 0.5, judging that the sequence is not a shaking pulse sequence;

(3.2) calculating r₂If r is₂If the pulse sequence is more than 0.4, judging that the sequence is not a shaking pulse sequence;

(3.3) if neither of the conditions in 3.1 and 3.2 are satisfied, proceed to step 4.

3. A method according to claim 1 or claim 2, wherein said step 5 comprises:

(5.1) calculating the searched n_jitterMean difference of arrival (dTAA) of a sequence of shaking pulses_meanSum standard deviation dTAA_std；

(5.2) calculating r₃；

(5.3) judging whether the condition shown in the formula 4 is met, if so, judging the jitter pulse sequence, and if not, judging the jitter pulse sequence to be a non-jitter sequence:

Images