Rapid implementation method for pulse sorting

Abstract

The invention discloses a rapid implementation method for pulse sorting in the technical field of pulse signal processing. According to the rapid implementation method for pulse sorting, rapid sorting of known targets is achieved in a library matching mode, and the storage capacity of pulses is improved in a mode that an SDRAM is externally hung on a DSP; preprocessing the PDW by adopting a three-dimensional clustering method; an addressing mode is adopted to improve the PRI estimation speed; and a multi-DSP parallel processing method is adopted to improve the processing speed. According to the pulse sorting rapid implementation method, the processing speed of each link of pulse sorting is increased in multiple modes, the storage capacity is large, task arrangement is reasonable, and the requirements of pulse sorting in different environments can be met.

Description

Technical Field

[0001] The present invention relates to the technical field of pulse signal processing, and in particular to a method for quickly implementing pulse sorting. Background Art

[0002] Pulse sorting is the process of separating pulse trains originating from different targets from randomly overlapping pulse streams and classifying the pulse trains according to the target radiation source to which they belong. The quality of the sorting results is related to the subsequent radiation source identification, threat judgment, and interference decision-making processes. Therefore, pulse sorting technology is a key technology in the field of radar signal processing and has become an important indicator of electronic reconnaissance capabilities. With the development of radar technology and the application of a large number of new radar systems, the signal environment is becoming increasingly dense and complex, which has brought huge challenges to the traditional pulse sorting architecture and sorting methods.

[0003] In complex electromagnetic environments, there are more and more signal styles such as radar, communication, navigation, and radio and television signals, and they overlap seriously in the time domain, frequency domain, and space domain. For receivers with wide frequency domains, the greater the signal flow, the more difficult it is to implement pulse sorting methods and engineering. With the development of complex radar systems towards multi-function and multi-purpose, a radar can integrate multiple functions. In different working modes, the intra-pulse modulation waveform and inter-pulse parameter agility of radar signals are diversified. The complex waveform and electrical parameter agility design destroy the signal laws used in existing signal sorting and identification, making the traditional signal sorting method "add batch" and "miss batch" phenomenon very serious. It is urgent to find a new type of pulse sorting technology to overcome these problems. Summary of the invention

[0004] The purpose of the present invention is to provide a method for quickly implementing pulse sorting, which solves the technical problems that traditional pulse sorting technology and equipment cannot meet the needs of real-time sorting of complex system radars in high-density environments, and the serious "over-batch" and "missed batch" phenomena of traditional signal sorting methods. It realizes real-time sorting of high-density pulse signals in complex electromagnetic environments and improves the sorting capability of complex system radars.

[0005] In order to achieve the above object, the technical solution of the present invention is as follows:

[0006] A method for quickly implementing pulse sorting comprises the following steps:

[0007] S1. Use library matching to achieve rapid sorting of known targets while increasing the storage capacity of DSP;

[0008] S2. Use three-dimensional clustering to pre-process pulse description words and separate different targets;

[0009] S3. Use repeated interval addressing to improve the PRI estimation speed;

[0010] S4. Use multi-chip DSP parallel processing method to improve the processing speed of pulse sorting.

[0011] As one aspect of a method for rapidly implementing pulse sorting of the present invention, S1 comprises the following steps:

[0012] S11. Rapid sorting of known targets using library matching;

[0013] S12. Use DSP external SDRAM to increase the storage capacity of DSP.

[0014] As one aspect of a method for rapidly implementing pulse sorting of the present invention, the S11 comprises the following steps:

[0015] S111. Using the characteristic parameters of the known target library as prior knowledge to match the received pulse description words;

[0016] S112. The received pulse description word has certain errors, and a certain tolerance needs to be set for the characteristic parameters.

[0017] As one aspect of a method for rapidly implementing pulse sorting of the present invention, S2 comprises the following steps:

[0018] S21. Clustering radar signals in three-dimensional space using their azimuth, frequency and pulse width characteristics to extract the same radar signal from a large number of pulse signals;

[0019] S22. Based on the agile characteristics of radar parameters, multiple one-dimensional and two-dimensional clustering methods are used to implement preprocessing of different signals. As one aspect of a rapid pulse sorting implementation method of the present invention, S22 includes the following steps:

[0020] S221. For frequency-agile radar signals, two-dimensional clustering of azimuth and pulse width is used for preprocessing;

[0021] S222. For radar signals with agile pulse width, two-dimensional clustering of azimuth and frequency is used for preprocessing;

[0022] S223. For radar signals with agile frequency and pulse width, only azimuth is used for clustering processing.

[0023] As one aspect of a method for rapidly implementing pulse sorting of the present invention, S3 comprises the following steps:

[0024] S31. Based on the range of PRI and the measurement error of PRI, a large range of storage space is opened to store possible PRI values;

[0025] S32. Calculate the location information of the storage space corresponding to the PRI for any one PRI, and address the storage space according to the location signal to count the number;

[0026] S33. When all PRI calculations are completed, the amount of storage space corresponds to the histogram statistics of the PRI.

[0027] As one aspect of a method for rapidly implementing pulse sorting of the present invention, S4 comprises the following steps:

[0028] S41. A DSP is used to complete the reception of the pulse description word. After the reception is completed, three-dimensional clustering preprocessing is performed. The preprocessed pulse description word is sent to the remaining DSP pieces through the inter-chip LINK port for pulse sorting processing;

[0029] S42. After the pulse sorting process is completed, the formed pulse description word is sent back to the DSP through the LINK port for comprehensive processing, and then the comprehensive result is sent out.

[0030] As one aspect of a method for quickly implementing pulse sorting of the present invention, the one DSP and the remaining DSPs in S41 together form a universal signal processing platform, and the one DSP and the remaining DSPs are interconnected via the LINK port.

[0031] By adopting the above technical solution, the present invention has the following advantages:

[0032] The present invention provides a method for rapid pulse sorting, which uses library matching to achieve rapid sorting of known targets; uses DSP external SDRAM to increase the storage capacity of pulses; uses a three-dimensional clustering method to achieve PDW preprocessing; uses addressing to increase the estimation speed of PRI; and uses a multi-chip DSP parallel processing method to increase the processing speed. The method for rapid pulse sorting achieves real-time sorting of high-density pulse signals in complex electromagnetic environments, improves the sorting capability of complex radars, uses multiple methods to increase the processing speed of each link of pulse sorting, and has a large storage capacity and reasonable task arrangement, which can meet the needs of pulse sorting in different environments. BRIEF DESCRIPTION OF THE DRAWINGS

[0033] Figure 1 It is a flow chart of the method for quickly implementing pulse sorting of the present invention;

[0034] Figure 2 A block diagram of a pulse sorting device for multi-processor parallel processing according to the present invention;

[0035] Figure 3 This is a pulse sorting data flow chart for multi-processor parallel processing of the present invention. DETAILED DESCRIPTION

[0036] The technical solution of the present invention is described in detail below in conjunction with the drawings in the specification. It should be noted that, in this article, relational terms such as first and second, etc. are only used to distinguish one entity or operation from another entity or operation, and do not necessarily require or imply any such actual relationship or order between these entities or operations. Moreover, the terms "include", "comprises" or any other variants thereof are intended to cover non-exclusive inclusion, so that a process, method, article or device including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, article or device.

[0037] A method for quickly implementing pulse sorting is as follows: Figure 1 As shown, the following steps are included:

[0038] S1. Use library matching to achieve rapid sorting of known targets while increasing the storage capacity of DSP;

[0039] Among them, S1 includes the following specific steps:

[0040] S11. Rapid sorting of known targets using library matching;

[0041] Wherein, S11 includes the following specific steps:

[0042] S111. The method of using library matching to realize rapid sorting of known targets is to use the characteristic parameters of the known target library as prior knowledge to match the received pulse description words, thereby realizing rapid sorting of targets;

[0043] S112. Since external interference affects the accuracy of signal parameter measurement, resulting in a certain error in the received pulse description word, it is necessary to set a certain tolerance for the characteristic parameters.

[0044] S12. Using DSP external SDRAM to improve the storage capacity of DSP: In order to achieve real-time storage of tens of millions of dense pulse description words (PDW), relying on the DSP on-chip memory alone is far from enough, and it is necessary to use an external memory to meet the large-capacity storage. The present invention uses DSP external SDRAM to achieve the storage of pulse description words. The advantage of this method is that the use of SDRAM memory facilitates DSP to quickly read and write pulse description words, and does not occupy the system bus, ensuring that the FPGA transmits the pulse description words to the DSP in real time using the system bus.

[0045] S2. Use three-dimensional clustering to pre-process pulse description words and separate different targets;

[0046] S2 includes the following steps:

[0047] S21. The preprocessing of pulse description words (PDW) by three-dimensional clustering is to cluster the radar signals in three-dimensional space based on their azimuth, frequency and pulse width, and extract the same radar signal from a large number of pulse signals.

[0048] S22. According to the agile characteristics of radar parameters, multiple one-dimensional and two-dimensional clustering methods are used to realize the preprocessing of different signals.

[0049] S22 includes the following specific steps:

[0050] S221. For frequency-agile radar signals, two-dimensional clustering of azimuth and pulse width is used for preprocessing;

[0051] S222. For radar signals with agile pulse width, two-dimensional clustering of azimuth and frequency is used for preprocessing;

[0052] S223. For radar signals with agile frequency and pulse width, only azimuth is used for clustering processing.

[0053] S3. Use repeated interval addressing to improve the PRI estimation speed;

[0054] In order to realize the pulse repetition interval (PRI) estimation of a large number of pulse descriptors, a repetition interval addressing method is proposed to realize the fast estimation of PRI. The specific implementation method adopts the following S3 steps:

[0055] S31. Based on the range of PRI and the measurement error of PRI, a large range of storage space is opened to store possible PRI values;

[0056] S32. Calculate the location information of the storage space corresponding to the PRI for any one PRI, and address the storage space according to the location signal to count the number;

[0057] S33. When all PRI calculations are completed, the amount of storage space corresponds to the histogram statistics of the PRI.

[0058] The above-mentioned repeated interval addressing method has fast calculation speed and is easy to implement in hardware.

[0059] S4. The method of using multiple DSPs for parallel processing to improve the processing speed of pulse sorting. In a specific embodiment, a block diagram of a pulse sorting device for parallel processing of multiple processors is shown in FIG. Figure 2 As shown, four DSPs are used for parallel processing, and the four DSPs are interconnected through LINK ports.

[0060] Among them, S4 includes the following specific steps:

[0061] S41. A DSP is used to complete the reception of the pulse description word. After the reception is completed, three-dimensional clustering preprocessing is performed. The preprocessed pulse description word is sent to the remaining DSP pieces through the inter-chip LINK port for pulse sorting processing;

[0062] S42. After the pulse sorting process is completed, the formed pulse description word is sent back to the DSP through the LINK port for comprehensive processing, and then the comprehensive result is sent out.

[0063] In a specific embodiment, in order to improve the processing speed of pulse sorting, the present invention adopts a self-developed universal signal processing platform, which is composed of 4 TS201s, and the 4 TS201s are interconnected through LINK ports. In the engineering design, one TS201 is used to complete the reception of PDW, and after the reception is completed, three-dimensional clustering preprocessing is performed. The preprocessed PDW is sent to the remaining three TS201s through the inter-chip LINK port for pulse sorting processing. After the processing is completed, the formed PDW is sent back to the first chip through the LINK port for comprehensive processing, and then the comprehensive result is sent as follows. Figure 3 As shown, the DSP parallel processing method does not adopt the architecture of data segmentation parallel processing, which avoids the increase in batches caused by data segmentation, and also ensures the integrity of the data of the same batch of targets.

[0064] Finally, it should be pointed out that although the present invention has been described with reference to the current specific embodiments, ordinary technicians in this technical field should realize that the above embodiments are only used to illustrate the present invention and are not used as a limitation of the present invention. Various equivalent changes or substitutions can be made without departing from the concept of the present invention. Therefore, as long as the changes and modifications to the above embodiments are within the essential spirit of the present invention, they will fall within the scope of the claims of the present invention.

Claims

1. A method for rapid pulse sorting, characterized in that: The following steps are involved: S1. Use library matching to achieve rapid sorting of known targets while increasing the storage capacity of DSP; S2. Use three-dimensional clustering to pre-process pulse description words and separate different targets; S3. Use repeated interval addressing to improve the PRI estimation speed; S4. Use multi-chip DSP parallel processing method to improve the processing speed of pulse sorting.

2. A method for rapid pulse sorting according to claim 1, characterized in that: The S1 comprises the following steps: S11. Rapid sorting of known targets using library matching; S12. Use DSP external SDRAM to increase the storage capacity of DSP.

3. A method for rapid pulse sorting according to claim 2, characterized in that: The S11 comprises the following steps: S111. Using the characteristic parameters of the known target library as prior knowledge to match the received pulse description words; S112. The received pulse description word has certain errors, and a certain tolerance needs to be set for the characteristic parameters.

4. A method for rapid pulse sorting according to claim 1, characterized in that: The S2 comprises the following steps: S21. Clustering radar signals in three-dimensional space using their azimuth, frequency and pulse width characteristics to extract the same radar signal from a large number of pulse signals; S22. According to the agile characteristics of radar parameters, multiple one-dimensional and two-dimensional clustering methods are used to realize the preprocessing of different signals.

5. A method for rapid pulse sorting according to claim 4, characterized in that: The S22 comprises the following steps: S221. For frequency-agile radar signals, two-dimensional clustering of azimuth and pulse width is used for preprocessing; S222. For radar signals with agile pulse width, two-dimensional clustering of azimuth and frequency is used for preprocessing; S223. For radar signals with agile frequency and pulse width, only azimuth is used for clustering processing.

6. A method for rapid pulse sorting according to claim 1, characterized in that: The S3 comprises the following steps: S31. Based on the range of PRI and the measurement error of PRI, a large range of storage space is opened to store possible PRI values; S32. Calculate the location information of the storage space corresponding to the PRI for any one PRI, and address the storage space according to the location signal to count the number; S33. When all PRI calculations are completed, the amount of storage space corresponds to the histogram statistics of the PRI.

7. A method for rapid pulse sorting according to claim 1, characterized in that: The S4 comprises the following steps: S41. A DSP is used to complete the reception of the pulse description word. After the reception is completed, three-dimensional clustering preprocessing is performed. The preprocessed pulse description word is sent to the remaining DSP pieces through the inter-chip LINK port for pulse sorting processing; S42. After the pulse sorting process is completed, the formed pulse description word is sent back to the DSP through the LINK port for comprehensive processing, and then the comprehensive result is sent out.

8. A method for rapid pulse sorting according to claim 7, characterized in that: The one DSP and the remaining DSPs in S41 together form a universal signal processing platform, and the one DSP and the remaining DSPs are interconnected via the LINK port.

Images