Pulse description word TOA sorting method and system for large file

Abstract

The invention discloses a pulse description word TOA sorting method and system for a large file. The method specifically comprises the steps that firstly, a memory mapping module and a block storage module are created; then, a memory mapping module performs file block memory mapping, reads memory data, analyzes PDW data, and sorts the PDW data according to TOA from small to large; the block storage module receives the sorted PDW data, reads the PDW data sent by the memory mapping module, stores the first block data, compares the data between two adjacent blocks, sorts and merges the data, and finally stores the data; and repeating memory mapping and block storage until the file analysis, sorting and conversion are completed. According to the method, the memory mapping file is used for accessing the data file on the disk, so that the reading efficiency is improved, the storage efficiency is improved by using block storage, PDW data playback and signal sorting are facilitated, and the phenomenon that the PDW data is interrupted or cannot be played back during playback is avoided.

Description

Technical Field

[0001] The invention relates to the technical field of electronic countermeasure reconnaissance, in particular to a TOA sorting method and system for pulse description words of large files. Background Art

[0002] Pulse Descriptor Word (PDW) is an important concept in radar signal processing. It is used to describe various characteristic parameters of the pulse signal emitted by the radar, including frequency, amplitude, pulse repetition interval, pulse width, arrival time (TOA), and arrival angle. These parameters play an important role in radar signal processing. Among them, the pulse arrival time TOA is a very important parameter in PDW. Since the pulse repetition interval is calculated by TOA, the accurate measurement of TOA is very critical for subsequent PDW data playback and signal sorting.

[0003] In the process of radar signal processing, PDW data is generally recorded for subsequent playback analysis. Each recorded PDW data will be added with the information of the record file, such as time stamp information, generally taking the TOA value to reflect the playback time. Since the recorded PDW data file is sometimes very large, reaching several GB or even more than ten GB, and sometimes there are individual TOAs that are not arranged in order, such as small or large values ​​in the TOA sequence arranged from small to large, which will cause the PDW data to be interrupted or unable to be played back during playback. When parsing large file PDW data, if the method is not selected properly, it will result in low efficiency or the inability to play back after parsing.

[0004] Chinese patent CN 115902781 A discloses a method for sorting radar pulse description word information according to pulse arrival time, wherein a demarcation value of the pulse arrival time in the pulse description word information is selected, and the pulse description word information is divided into two parts according to the demarcation value, wherein the pulse arrival time of one part of the pulse description word information is earlier than the demarcation value, and the pulse arrival time of the other part of the pulse description word information is not earlier than the demarcation value, until each part only includes pulse description word information with equal pulse arrival time, thereby realizing the sorting of radar pulse description word information according to pulse arrival time, but the method involves many comparisons and exchanges, and the exchange distance is short, requiring a large number of cycles, and having low sorting efficiency, which cannot meet the real-time requirements of radar signal processing. Therefore, it is urgent to study a method for sorting PWD of large files to solve the problems of low efficiency in parsing large file PDW data and inability to replay after parsing. Summary of the invention

[0005] The object of the present invention is to provide a pulse descriptor TOA sorting method and system which can sort pulse descriptor words of a large file, improve the efficiency of PDW parsing of the large file and have good real-time performance.

[0006] The technical solution to achieve the purpose of the present invention is: a pulse description word TOA sorting method for large files, comprising the following steps:

[0007] Step 1: Create a memory mapping module and a block storage module;

[0008] Step 2: The memory mapping module performs file block memory mapping, reads memory data, parses PDW data, and sorts PDW data from small to large according to TOA;

[0009] Step 3: The block storage module receives the sorted PDW data, reads the PDW data sent by the memory mapping module, saves the first block data, compares the data between two adjacent blocks, sorts and merges them, and finally stores them;

[0010] Step 4: Repeat steps 2 and 3 until the file parsing, sorting and conversion are completed.

[0011] The present invention provides a pulse description word TOA sorting system for large files, which is used to implement the pulse description word TOA sorting method for large files. The system includes a memory mapping module and a block storage module, wherein:

[0012] The memory mapping module performs file block memory mapping, reads memory data, parses PDW data, and sorts PDW data from small to large according to TOA;

[0013] The block storage module receives the sorted PDW data, reads the PDW data sent by the memory mapping module, saves the first block data, compares the data between two adjacent blocks, sorts and merges them, and finally stores them;

[0014] The memory mapping module and the block storage module are executed repeatedly until the file parsing and sorting conversion is completed.

[0015] The present invention provides a mobile terminal, comprising a memory, a processor and a computer program stored in the memory and operable on the processor. When the processor executes the program, the TOA sorting method for pulse description words of large files is implemented.

[0016] The present invention provides a computer-readable storage medium on which a computer program is stored. When the program is executed by a processor, the steps in the TOA sorting method for pulse description words of large files are implemented.

[0017] Compared with the prior art, the present invention has the following significant features: (1) block memory mapping files can improve the efficiency of accessing files and reduce the overhead of IO operations; (2) block memory mapping can control the memory mapping size of each data file, improve reading performance and memory resource utilization; (3) TOA is sorted during the parsing process, which improves the sorting efficiency and improves the parsing efficiency of large file PDW. BRIEF DESCRIPTION OF THE DRAWINGS

[0018] Figure 1 The present invention is a flow chart of a pulse description word TOA sorting method for large files.

[0019] Figure 2 It is a schematic diagram of the flow of memory mapping in the present invention.

[0020] Figure 3 It is a schematic diagram of the process of block storage in the present invention. DETAILED DESCRIPTION

[0021] The present invention provides a pulse description word TOA sorting method for a large file, comprising the following steps:

[0022] Step 1: Create a memory mapping module and a block storage module;

[0023] Step 2: The memory mapping module performs file block memory mapping, reads memory data, parses PDW data, and sorts PDW data from small to large according to TOA;

[0024] Step 3: The block storage module receives the sorted PDW data, reads the PDW data sent by the memory mapping module, saves the first block data, compares the data between two adjacent blocks, sorts and merges them, and finally stores them;

[0025] Step 4: Repeat steps 2 and 3 until the file parsing, sorting and conversion are completed.

[0026] As a specific example, the memory mapping module described in step 2 performs file block memory mapping, reads memory data, parses PDW data, and sorts PDW data from small to large according to TOA, as follows:

[0027] Step 2.1, the memory mapping module performs block memory mapping on the file;

[0028] Step 2.2, read memory data and parse PDW data;

[0029] Step 2.3: Sort the PDW data by TOA from small to large.

[0030] Step 2.4, PDW data is sent to the block storage module;

[0031] Step 2.5, cancel the current file block memory mapping, modify the relevant parameters of the file block memory mapping, and wait for the next block memory mapping cycle.

[0032] As a specific example, the block storage module described in step 3 receives the sorted PDW data, reads the PDW data sent by the memory mapping module, saves the first block data, compares the data between two adjacent blocks, sorts and merges them, and finally stores them, as follows:

[0033] Step 3.1, receiving the PDW data sorted by the memory mapping module;

[0034] Step 3.2, determine the total number of loops. If the total number of loops is equal to 1, directly store the block data; if the total number of loops is equal to 2, go to step 3.3; if the total number of loops is greater than 2, go to step 3.4;

[0035] Step 3.3, save the block data of the first cycle, then merge and sort the block data of the second cycle with the saved block data, and finally store the merged and sorted data;

[0036] Step 3.4: The steps for merging and sorting data when the total number of cycles is greater than 2 are as follows:

[0037] Step 3.4.1, save the block data of the first loop, and then proceed to the next loop;

[0038] Step 3.4.2, determine whether the number of loops is equal to the total number of loops minus one. If so, merge and sort the saved block data with the current block data, and store the merged sorted data; if not, proceed to step 3.4.2;

[0039] Step 3.4.3, determine whether the last TOA of the saved block data is less than or equal to the first TOA of the current block data, if so, store the saved block data and save the current block data; if not, proceed to step 3.4.4;

[0040] Step 3.4.4, check whether the last TOA of the saved block data is less than or equal to the TOA of the current block data. If not, merge and sort the saved block data with the current block data; if so, proceed to step 3.4.5;

[0041] Step 3.4.5, record the found position k, and query among the k data whether the first TOA of the saved block data is greater than or equal to the TOA of the current block data queried. If so, record the found position p, merge and sort the saved block data and the data after the current block data position p, store the merged and sorted data, and save the current block data starting from position k. If not, merge and sort the saved block data with the current block data.

[0042] As a specific example, step 2 and step 3 are repeated in step 4 until the file parsing and sorting conversion is completed, as follows:

[0043] Create two memory mapping threads and block storage threads, use semaphores sem_w and sem_r to switch threads, and repeat memory mapping and block storage until the file parsing, sorting and conversion are completed.

[0044] The present invention provides a pulse description word TOA sorting system for large files, which is used to implement the pulse description word TOA sorting method for large files. The system includes a memory mapping module and a block storage module, wherein:

[0045] The memory mapping module performs file block memory mapping, reads memory data, parses PDW data, and sorts PDW data from small to large according to TOA;

[0046] The block storage module receives the sorted PDW data, reads the PDW data sent by the memory mapping module, saves the first block data, compares the data between two adjacent blocks, sorts and merges them, and finally stores them;

[0047] The memory mapping module and the block storage module are executed repeatedly until the file parsing and sorting conversion is completed.

[0048] The present invention provides a mobile terminal, comprising a memory, a processor and a computer program stored in the memory and operable on the processor. When the processor executes the program, the TOA sorting method for pulse description words of large files is implemented.

[0049] The present invention provides a computer-readable storage medium on which a computer program is stored. When the program is executed by a processor, the steps in the TOA sorting method for pulse description words of large files are implemented.

[0050] The present invention uses a memory-mapped file to access a data file on a disk, thereby improving reading efficiency, using block storage to improve storage efficiency, avoiding the formation of a new PDW data file, facilitating PDW data playback and signal sorting, and avoiding the phenomenon of interruption or failure to playback PDW data during playback.

[0051] The present invention will be further described in detail below in conjunction with the accompanying drawings and specific embodiments.

[0052] Example

[0053] like Figure 1 As shown, the present invention provides a pulse description word TOA sorting method for a large file, comprising the following steps:

[0054] Step 1: Create a memory mapping module and a block storage module;

[0055] Step 2: The memory mapping module performs file block memory mapping, reads memory data, parses PDW data, and sorts PDW data from small to large according to TOA, such as Figure 2 As shown, the details are as follows:

[0056] Step 2.1, the memory mapping module performs block memory mapping on the file;

[0057] Step 2.2, read memory data and parse PDW data;

[0058] Step 2.3: Sort the PDW data by TOA from small to large.

[0059] Step 2.4, PDW data is sent to the block storage module;

[0060] Step 2.5, cancel the current file block memory mapping, modify the relevant parameters of the file block memory mapping, and wait for the next block memory mapping cycle.

[0061] Step 3: The block storage module receives the sorted PDW data, reads the PDW data sent by the memory mapping module, saves the first block data, compares the data between two adjacent blocks, sorts and merges them, and finally stores them. Figure 3 As shown, the details are as follows:

[0062] Step 3.1, receiving the PDW data sorted by the memory mapping module;

[0063] Step 3.2, determine the total number of loops. If the total number of loops is equal to 1, directly store the block data; if the total number of loops is equal to 2, go to step 3.3; if the total number of loops is greater than 2, go to step 3.4;

[0064] Step 3.3, save the block data of the first cycle, then merge and sort the block data of the second cycle with the saved block data, and finally store the merged and sorted data;

[0065] Step 3.4: The steps for merging and sorting data when the total number of cycles is greater than 2 are as follows:

[0066] Step 3.4.1, save the block data of the first loop, and then proceed to the next loop;

[0067] Step 3.4.2, determine whether the number of loops is equal to the total number of loops minus one. If so, merge and sort the saved block data with the current block data, and store the merged sorted data; if not, proceed to step 3.4.2;

[0068] Step 3.4.3, determine whether the last TOA of the saved block data is less than or equal to the first TOA of the current block data, if so, store the saved block data and save the current block data; if not, proceed to step 3.4.4;

[0069] Step 3.4.4, check whether the last TOA of the saved block data is less than or equal to the TOA of the current block data. If not, merge and sort the saved block data with the current block data; if so, proceed to step 3.4.5;

[0070] Step 3.4.5, record the found position k, and query among the k data whether the first TOA of the saved block data is greater than or equal to the TOA of the current block data queried. If so, record the found position p, merge and sort the saved block data and the data after the current block data position p, store the merged and sorted data, and save the current block data starting from position k. If not, merge and sort the saved block data with the current block data.

[0071] Step 4: Repeat steps 2 and 3 until the file parsing, sorting and conversion are completed, as follows:

[0072] Create two memory mapping threads and block storage threads, use semaphores sem_w and sem_r to switch threads, and repeat memory mapping and block storage until the file parsing, sorting and conversion are completed.

[0073] The above are only preferred embodiments of the present invention. It should be pointed out that, for ordinary technicians in this technical field, several improvements and modifications can be made without departing from the principles of the present invention. These improvements and modifications should also be regarded as the scope of protection of the present invention.

Claims

1. A pulse description word TOA sorting method for large files, characterized in that: The following steps are involved: Step 1: Create a memory mapping module and a block storage module; Step 2: The memory mapping module performs file block memory mapping, reads memory data, parses PDW data, and sorts PDW data from small to large according to TOA; Step 3: The block storage module receives the sorted PDW data, reads the PDW data sent by the memory mapping module, saves the first block data, compares the data between two adjacent blocks, sorts and merges them, and finally stores them; Step 4: Repeat steps 2 and 3 until the file parsing, sorting and conversion are completed.

2. The pulse description word TOA sorting method for large files according to claim 1, characterized in that: The memory mapping module described in step 2 performs file block memory mapping, reads memory data, parses PDW data, and sorts PDW data from small to large according to TOA, as follows: Step 2.1, the memory mapping module performs block memory mapping on the file; Step 2.2, read memory data and parse PDW data; Step 2.3: Sort the PDW data by TOA from small to large. Step 2.4, PDW data is sent to the block storage module; Step 2.5, cancel the current file block memory mapping, modify the relevant parameters of the file block memory mapping, and wait for the next block memory mapping cycle.

3. The pulse description word TOA sorting method for large files according to claim 1, characterized in that: The block storage module described in step 3 receives the sorted PDW data, reads the PDW data sent by the memory mapping module, saves the first block data, compares the data between two adjacent blocks, sorts and merges them, and finally stores them, as follows: Step 3.1, receiving the PDW data sorted by the memory mapping module; Step 3.2, determine the total number of loops. If the total number of loops is equal to 1, directly store the block data; if the total number of loops is equal to 2, go to step 3.3; if the total number of loops is greater than 2, go to step 3.4; Step 3.3, save the block data of the first cycle, then merge and sort the block data of the second cycle with the saved block data, and finally store the merged and sorted data; Step 3.4: The steps for merging and sorting data when the total number of cycles is greater than 2 are as follows: Step 3.4.1, save the block data of the first loop, and then proceed to the next loop; Step 3.4.2, determine whether the number of loops is equal to the total number of loops minus one. If so, merge and sort the saved block data with the current block data, and store the merged sorted data; if not, proceed to step 3.4.2; Step 3.4.3, determine whether the last TOA of the saved block data is less than or equal to the first TOA of the current block data, if so, store the saved block data and save the current block data; if not, proceed to step 3.4.4; Step 3.4.4, check whether the last TOA of the saved block data is less than or equal to the TOA of the current block data. If not, merge and sort the saved block data with the current block data; if so, proceed to step 3.4.5; Step 3.4.5, record the found position k, and query among the k data whether the first TOA of the saved block data is greater than or equal to the TOA of the current block data queried. If so, record the found position p, merge and sort the saved block data and the data after the current block data position p, store the merged and sorted data, and save the current block data starting from position k. If not, merge and sort the saved block data with the current block data.

4. The pulse description word TOA sorting method for large files according to claim 1, characterized in that: Repeat steps 2 and 3 as described in step 4 until the file parsing and sorting conversion is completed, as follows: Create two memory mapping threads and block storage threads, use semaphores sem_w and sem_r to switch threads, and repeat memory mapping and block storage until the file parsing, sorting and conversion are completed.

5. A pulse description word TOA sorting system for large files, characterized in that: The system is used to implement the pulse description word TOA sorting method for large files according to any one of claims 1 to 4, and the system includes a memory mapping module and a block storage module, wherein: The memory mapping module performs file block memory mapping, reads memory data, parses PDW data, and sorts PDW data from small to large according to TOA; The block storage module receives the sorted PDW data, reads the PDW data sent by the memory mapping module, saves the first block data, compares the data between two adjacent blocks, sorts and merges them, and finally stores them; The memory mapping module and the block storage module are executed repeatedly until the file parsing and sorting conversion is completed.

6. A mobile terminal comprising a memory, a processor and a computer program stored in the memory and executable on the processor, characterized in that: When the processor executes the program, the pulse description word TOA sorting method for large files as described in any one of claims 1 to 4 is implemented.

7. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the program is executed by a processor, the steps in the pulse description word TOA sorting method for large files as described in any one of claims 1 to 4 are implemented.

Images