Pulse description word sorting method based on arrival time

Abstract

The invention discloses a pulse description word sorting method based on arrival time, which comprises the following steps of: selecting PDWs of which existing TOAs are not sorted from small to large from an original PDW sequence, and storing the PDWs. And sorting the stored PDWs from small to large according to the TOA values. And finally, according to the TOA values from small to large, merging and sorting the sorted stored PDWs and the original remaining PDWs to form a new PDW sequence. According to the method, the PDWs of which the TOA values are not ranked from small to large can be quickly selected from the original PDW sequence, and the PDWs can be quickly merged and ranked to form a new PDW sequence, so that conditions are provided for the next PDW data playback or signal sorting, the data playback or signal sorting can be smoothly carried out, and the success rate of the data playback or signal sorting is improved. And meanwhile, the phenomenon that the PDW data is interrupted or cannot be played back when being played back is avoided.

Description

Technical Field

[0001] The present application relates to the field of countermeasure reconnaissance technology, and in particular to a pulse description word sorting method based on arrival time. Background Art

[0002] The pulse description word (PDW) describes the important characteristics of the information carried by each pulse seen by a receiver, mainly including frequency, amplitude, pulse repetition interval, pulse width, arrival time (TOA), and arrival angle. The pulse arrival time is a very important parameter in the PDW, and the pulse repetition interval is calculated from the arrival time. Therefore, the accurate measurement of the arrival time is very critical for the subsequent PDW data playback or signal sorting. Generally, the PDW data will be recorded for subsequent playback analysis. Each recorded PDW data will add the information of the record file, such as: time stamp, which generally takes the value of TOA, which can better reflect the playback time.

[0003] However, sometimes some TOAs of the recorded PDW data are not arranged in order, for example, there are small or large values ​​in the TOA sequence from small to large. This may cause the PDW data to be interrupted or unable to be played back because the time scale is not sorted from small to large. Summary of the invention

[0004] The present application provides a pulse description word sorting method based on arrival time, which can be used to solve the technical problem of PDW data being interrupted or unable to be played back during playback.

[0005] The present application provides a pulse description word sorting method based on arrival time, the method comprising:

[0006] Step 1, parse the PDW data file in several cycles, and select the PDW whose TOA is not sorted from small to large in one parsing process: select the existing PDW whose TOA is not sorted from small to large from the original PDW sequence, and save the corresponding PDW, then the TOA values ​​of the original remaining PDW are all sorted from small to large;

[0007] Step 2: In the current analysis, sort the TOA of the saved PDWs: sort the saved PDWs from small to large according to the TOA value;

[0008] Step 3: In the current analysis, the sorted saved PDWs and the original remaining PDWs are sorted: the sorted saved PDWs and the original remaining PDWs are merged and sorted from small to large according to the TOA value to form a new PDW sequence;

[0009] Step 4, loop step 1 to step 3 until the data file is parsed and a new data file is generated after TOA sorting.

[0010] Further, the selection method is as follows:

[0011] Case 1: If LastLastTOA < LastTOA; LastTOA > TOA; LastLastTOA <= TOA, then save LastPDW; where LastLastTOA represents the first TOA, the first TOA represents the second previous TOA of the current TOA; LastTOA represents the previous TOA of the current TOA; TOA represents the current TOA.

[0012] Case 2: If LastLastTOA < LastTOA; LastTOA > TOA; LastLastTOA > TOA, then save CurPDW.

[0013] Case 3: If LastLastTOA > LastTOA; LastTOA < TOA; LastLastTOA <= TOA, then save LastPDW.

[0014] Wherein, LastPDW represents the previous PDW of the current PDW.

[0015] Case 4: If LastLastTOA > LastTOA; LastTOA < TOA; LastLastTOA > TOA, then save CurPDW.

[0016] CurPDW represents the current PDW; LastLastPDW represents the first PDW, the first PDW represents the second previous PDW of the current PDW.

[0017] Case 5: If LastLastTOA >= LastTOA; LastTOA >= TOA; LastLastTOA > TOA, then save CurPDW.

[0018] Case 6: If it is 32-bit data, for the flipped situation, do not save.

[0019] Further, in step 2, quick sort or merge sort is used for sorting.

[0020] Compared with the prior art, the remarkable feature of the present invention is:

[0021] If the TOA of each PDW in a large file is sorted once and then parsed and converted into a playback format, it will be very time-consuming; while adopting the method of the present invention, during the process of parsing and converting into the playback format, the TOA of each PDW is sorted, which greatly improves the efficiency. Description of the Drawings

[0022] Figure 1 is the flowchart of the pulse description word sorting method based on the arrival time of the present invention;

[0023] Figure 2 is the flowchart of the present invention for selecting PDWs whose TOA is not sorted from small to large;

[0024] Figure 3 is the flowchart of the present invention for sorting the saved PDWs and the remaining original PDWs. Specific Embodiment

[0025] To make the objectives, technical solutions and advantages of the present application clearer, the embodiments of the present application will be further described in detail below with reference to the accompanying drawings.

[0026] First, the embodiments of the present application will be introduced below with reference to the accompanying drawings.

[0027] The present invention is a pulse description word sorting method based on the arrival time, including the following steps:

[0028] Premise: A large data file containing pulse description word (PDW) information, with a file size of several GB or even more than a dozen GB, and containing hundreds of millions or even billions of data.

[0029] Step 1, parse the PDW data file in several loops. During one parsing process, select the PDWs whose TOA is not sorted from small to large: From the original PDW sequential sequence, select the existing PDWs whose TOA is not sorted from small to large, and save these PDWs. Then, the TOA values of the remaining original PDWs are sorted from small to large.

[0030] The selection method is as follows:

[0031] Case 1: If LastLastTOA < LastTOA; LastTOA > TOA; LastLastTOA <= TOA, then save LastPDW; where, LastLastTOA represents the first TOA, the first TOA represents the upper upper TOA of the current TOA; LastTOA represents the upper TOA of the current TOA; TOA represents the current TOA;

[0032] Case 2: If LastLastTOA < LastTOA; LastTOA > TOA; LastLastTOA > TOA, then save CurPDW;

[0033] Case 3: If LastLastTOA > LastTOA; LastTOA < TOA; LastLastTOA <= TOA, then save LastPDW;

[0034] Among them, LastPDW indicates the previous PDW of the current PDW;

[0035] Case 4: If LastLastTOA>LastTOA; LastTOA<TOA;LastLastTOA> TOA, then save CurPDW;

[0036] CurPDW indicates the current PDW; LastLastPDW indicates the first PDW, and the first PDW indicates the PDW before the current PDW;

[0037] Case 5: If LastLastTOA>=LastTOA; LastTOA>=TOA; LastLastTOA>TOA, then save CurPDW;

[0038] Case 6: If it is 32-bit data, it will not be saved for the flipping case.

[0039] Step 2, in the current analysis, sort the TOA of the saved PDW: sort the saved PDW from small to large according to the TOA value, and choose a sorting method with a small time complexity, such as quick sort or merge sort;

[0040] Step 3: In the current analysis, the sorted saved PDWs and the original remaining PDWs are sorted: the sorted saved PDWs and the original remaining PDWs are merged and sorted from small to large according to the TOA values ​​to form a new PDW sequence.

[0041] Step 4, loop step 1 to step 3 until the data file is parsed and a new data file is generated after TOA sorting.

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

Claims

1. A pulse description word sorting method based on arrival time, characterized in that: The method includes the following steps: Step 1: Analyze the PDW data file in several loops. During one parsing process, select the PDWs whose TOAs are not in ascending order: From the original PDW sequence, select the PDWs whose existing TOAs are not sorted in ascending order, and save the corresponding PDWs. Then, the TOA values of the remaining original PDWs are sorted in ascending order. Step 2: During the current parsing, sort the TOAs of the saved PDWs: For the saved PDWs, sort them in ascending order according to the TOA values. Step 3: During the current parsing, sort the sorted saved PDWs and the remaining original PDWs: According to the TOA values in ascending order, perform a merge sort on the sorted saved PDWs and the remaining original PDWs to form a new PDW sequence. Step 4: Loop through Step 1 to Step 3 until the data file parsing is completed, generating a new data file with the TOAs sorted.

2. The method according to claim 1, characterized in that The selection method is as follows: Case 1: If LastLastTOA < LastTOA; LastTOA > TOA; LastLastTOA <= TOA, then save LastPDW; where LastLastTOA represents the first TOA, the first TOA represents the second previous TOA of the current TOA; LastTOA represents the previous TOA of the current TOA; TOA represents the current TOA. Case 2: If LastLastTOA < LastTOA; LastTOA > TOA; LastLastTOA > TOA, then save CurPDW. Case 3: If LastLastTOA > LastTOA; LastTOA < TOA; LastLastTOA <= TOA, then save LastPDW. Where LastPDW represents the previous PDW of the current PDW. Case 4: If LastLastTOA > LastTOA; LastTOA < TOA; LastLastTOA > TOA, then save CurPDW. CurPDW represents the current PDW; LastLastPDW represents the first PDW, the first PDW represents the second previous PDW of the current PDW. Case 5: If LastLastTOA >= LastTOA; LastTOA >= TOA; LastLastTOA > TOA, then save CurPDW. Case 6: If it is 32-bit data, for the flipped situation, do not save.

3. The method according to claim 1, characterized in that In Step 2, quick sort or merge sort is used for sorting.

Images