CN111600631A - Method for sorting signals of two network stations with overlapped arrival time - Google Patents
Method for sorting signals of two network stations with overlapped arrival time Download PDFInfo
- Publication number
- CN111600631A CN111600631A CN202010395582.3A CN202010395582A CN111600631A CN 111600631 A CN111600631 A CN 111600631A CN 202010395582 A CN202010395582 A CN 202010395582A CN 111600631 A CN111600631 A CN 111600631A
- Authority
- CN
- China
- Prior art keywords
- frequency hopping
- frequency
- signals
- arrival time
- hopping signals
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B1/00—Details of transmission systems, not covered by a single one of groups H04B3/00 - H04B13/00; Details of transmission systems not characterised by the medium used for transmission
- H04B1/69—Spread spectrum techniques
- H04B1/713—Spread spectrum techniques using frequency hopping
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B1/00—Details of transmission systems, not covered by a single one of groups H04B3/00 - H04B13/00; Details of transmission systems not characterised by the medium used for transmission
- H04B1/69—Spread spectrum techniques
- H04B1/713—Spread spectrum techniques using frequency hopping
- H04B1/7136—Arrangements for generation of hop frequencies, e.g. using a bank of frequency sources, using continuous tuning or using a transform
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B1/00—Details of transmission systems, not covered by a single one of groups H04B3/00 - H04B13/00; Details of transmission systems not characterised by the medium used for transmission
- H04B1/69—Spread spectrum techniques
- H04B1/713—Spread spectrum techniques using frequency hopping
- H04B1/7136—Arrangements for generation of hop frequencies, e.g. using a bank of frequency sources, using continuous tuning or using a transform
- H04B2001/71362—Arrangements for generation of hop frequencies, e.g. using a bank of frequency sources, using continuous tuning or using a transform using a bank of frequency sources
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a method for sorting signals of two networks with overlapped arrival time, belonging to the technical field of communication countermeasure. The method includes estimating a frequency hopping period; constructing a time-frequency distribution map of the frequency hopping signal; calculating the range of left and right blank rectangles in the time-frequency distribution diagram; determining respective distribution areas of frequency hopping signals of the two network stations, and sorting the frequency hopping signals in the areas to the respective network stations; utilizing mutual exclusivity recursion of two frequency hopping signals in the same frequency hopping period to sort the rest frequency hopping signals; and calculating parameters of the two net stations, and the like. The invention realizes the sorting of the network station signals with two identical hopping speeds and overlapped frequency sets without complete overlapping by using the time-frequency distribution characteristics of the hopping frequency signals and the mutual exclusivity of the hopping frequency signals in the same hopping frequency period under the condition of not increasing the incoming wave direction information. The method has concise algorithm, greatly improves the adaptability of the network platform sorting method, and is an important improvement on the prior art.
Description
Technical Field
The invention belongs to the technical field of communication countermeasure, and particularly relates to a method for sorting signals of two networks with overlapped arrival time.
Background
Frequency hopping communication has been widely used in the field of military communication as an anti-interference communication means. As a third party of non-cooperative communication, in order to perform reconnaissance and interference on frequency hopping communication, it is an important premise that network station sorting can be accurately performed, and parameters such as a frequency set and a hopping rate of a frequency hopping radio station can be acquired.
The existing network station sorting algorithm comprises a network station sorting algorithm based on blind source separation, a network station sorting algorithm based on frequency hopping characteristic clustering and the like. The network platform sorting algorithm based on blind source separation processes time domain signals for sorting by using the blind source separation algorithm, and has the advantages of complex calculation, poor real-time performance and difficulty in adapting to complex electromagnetic environments. The net station sorting algorithm based on the frequency hopping characteristic clustering is used for sorting according to the characteristics of arrival time, incoming wave direction and the like of frequency hopping signals, but when a scout cannot obtain the incoming wave direction of the frequency hopping signals, if the arrival time of the signals of two net stations is overlapped, the net station sorting algorithm based on the frequency hopping characteristic clustering fails.
Disclosure of Invention
The invention aims to overcome the defects in the prior art and provides a method for sorting two network station signals with overlapped arrival time.
In order to achieve the purpose, the invention adopts the technical scheme that:
a method for sorting signals of two network stations with overlapped arrival time is used for sorting the signals of the two network stations, the frequency hopping periods of the two network stations are equal, and the arrival time of the signals is overlapped, and comprises the following steps:
(1) estimating a frequency hopping period according to the arrival time of the frequency hopping signals, and calculating the relative arrival time of each frequency hopping signal;
(2) constructing a time-frequency distribution graph of the frequency hopping signal by taking the relative arrival time and frequency of the frequency hopping signal as a horizontal axis and a vertical axis respectively; dividing grids on the time-frequency distribution diagram, counting the number of frequency hopping signals in each grid, if no signal or sparse signal exists in the grids, assigning the value of the grid to be 0, otherwise, assigning the value of the grid to be 1, and thus obtaining a binary density matrix;
(3) searching all first sub-matrixes and all second sub-matrixes in the density matrix; the elements in the first sub-matrix are all 0, the 1 st column thereof is the 1 st column of the density matrix, and the last 1 column thereof is adjacent to the columns of which the elements are not all 0; the area of the first sub-matrix corresponding to the time-frequency distribution diagram is a left blank rectangle; the elements in the second sub-matrix are all 0, the last 1 column of the second sub-matrix is the last 1 column of the density matrix, and the 1 st column of the second sub-matrix is adjacent to the columns of which the elements are not all 0; the region of the second sub-matrix corresponding to the time-frequency distribution diagram is a right blank rectangle; note that the relative arrival time range of the jth left blank rectangle is [ ltj,0,ltj,1]The frequency range is [ lf ]j,0,lfj,1]J is 0,1, …, unifying the relative arrival time range of all left blank rectangles as [ lt0,lt1]Wherein lt0Is ltj,0Mean value of (1), lt1Is ltj,1The mean value of (a); let the relative arrival time range of the kth right blank rectangle be [ rt ]k,0,rtk,1]In the frequency range of [ rfk,0,rfk,1]K is 0,1, …, unifying the relative arrival time range of all right blank rectangles as [ rt [ ]0,rt1]Wherein rt is0Is rtk,0Mean value of (1), rt1Is rtk,1The mean value of (a);
(4) in a relative arrival time range of [ lt0,lt1]In a frequency range of [ rf ]k,0,rfk,1]The overlapping areas of the first network station and the second network station are used as the distribution areas of the frequency hopping signals of the first network station, and the frequency hopping signals in the overlapping areas form a frequency hopping signal set A1 of the first network station; with a relative time of arrival range of [ rt ]0,rt1]Frequency range of [ lf ]j,0,lfj,1]The overlapping area is used as the distribution area of the second network station frequency hopping signalA domain, the frequency hopping signals within the overlapping regions forming a set of frequency hopping signals a2 for the second network station; the remaining frequency hopping signals except the set a1 and the set a2 are set as a set B;
(5) finding the frequency hopping signals in the same frequency hopping period as the frequency hopping signals in the set A1 in the set B, and transferring the frequency hopping signals into the set A2; in addition, the frequency hopping signals in the same frequency hopping period as the frequency hopping signals in the set A2 are searched in the set B and transferred to the set A1; update sets a1, a2, B;
(6) after the step (5) is completed, recursively transferring the frequency hopping signals in the set B to the set A1 and the set A2 by using the mutual exclusivity of the two frequency hopping signals in the same frequency hopping period until no transferable frequency hopping signal exists in the set B;
(7) respectively counting the occurrence times of each frequency in each set according to the sets A1 and A2 finally obtained in the step (6), selecting the frequencies with high occurrence times from the sets to form a frequency set of the network station corresponding to the set, wherein the reciprocal of the frequency hopping period obtained in the step (1) is the hopping speed of the two network stations; and finishing the sorting of the net platforms.
Further, in the step (6), the following steps are performed for each recursion:
(601) calculating a frequency set F1 of the frequency hopping signals in the set A1;
(602) searching the frequency hopping signals with the frequency belonging to the set F1 in the frequency hopping signals existing in the set B, transferring the searched frequency hopping signals to the set A1, and transferring the frequency hopping signals with the same frequency hopping period as the frequency hopping signals to the set A2; update sets a1, a2, B;
(603) calculating a frequency set F2 of the frequency hopping signals in the set A2;
(604) searching the frequency hopping signals with the frequency belonging to the set F2 in the currently existing frequency hopping signals of the set B, transferring the searched frequency hopping signals to the set A2, and transferring the frequency hopping signals in the same frequency hopping period with the frequency hopping signals to the set A1; update sets A1, A2, B.
Further, the relative arrival time in step (1) is the remainder of the division of the arrival time of each hopping signal by its hopping period.
Further, in the step (2), the method for determining no signal or sparse signal in the grid is as follows:
(201) calculating the sum of the number of the frequency hopping signals in the grids of each pair of upper and lower adjacent grids in the first grid and the last grid, taking the maximum value of all the sum values, taking 1/4 of the maximum value as a threshold, and directly setting the threshold as 4 if the threshold is less than 4;
(202) for any grid, if the number of the frequency hopping signals is smaller than the threshold value, no signal or sparse signal in the grid is judged.
Further, in the step (1), the method of estimating the frequency hopping period is a PRI pulse repetition interval changing method.
Further, the judgment criterion in the same frequency hopping period is that the difference between the arrival times of the two frequency hopping signals is less than one half of the frequency hopping period.
Further, in the step (7), the specific way of selecting the frequency with the high frequency of occurrence to form the frequency set of the network station corresponding to the set is to calculate a mean value of the frequency of occurrence in the set a1 or a2, and select the frequency with the frequency of occurrence in the set greater than one half of the mean value to form the frequency set of the network station corresponding to the set.
Compared with the prior art, the invention has the following advantages:
1. the invention solves the problem that the existing method is difficult to solve that the separation of two network station signals with the same hopping speed is overlapped in arrival time and the frequency sets are not completely overlapped by skillfully utilizing the time-frequency distribution characteristics of the hopping frequency signals and the mutual exclusivity of the hopping frequency signals in the same hopping frequency period, and greatly improves the adaptability of the network station separation method.
2. The method has the advantages of concise algorithm, small calculation amount and easy engineering realization.
Drawings
FIG. 1 is a flow chart of a sorting method in an embodiment of the invention.
Detailed Description
The present invention is described in further detail below with reference to the attached drawing figures.
A method for sorting signals of two network stations with overlapped arrival time is used for sorting the signals of the two network stations, the frequency hopping periods of the two network stations are equal, and the arrival time of the signals is overlapped, and comprises the following steps:
(1) estimating a frequency hopping period:
estimating a frequency hopping period by utilizing a PRI transformation algorithm according to the arrival time of the frequency hopping signal obtained in the frequency hopping signal detection;
(2) constructing a time-frequency distribution graph of the frequency hopping signal:
(2a) calculating the relative arrival time of each frequency hopping signal;
(2b) constructing a time-frequency distribution graph of the frequency hopping signal by taking the relative arrival time and frequency of the frequency hopping signal as a horizontal axis and a vertical axis respectively;
(3) calculating the range of left and right blank rectangles in the time-frequency distribution diagram:
(3a) dividing grids on the time-frequency distribution graph, and counting the number of frequency hopping signals in each grid to form a density matrix;
(3b) determining a threshold value according to left and right boundary elements of the density matrix to form a binary density matrix, wherein a value of 0 indicates no signal or sparse signal in the grid, and a value of 1 indicates signal in the grid;
(3c) searching a first sub-matrix in the binarization density matrix, wherein all elements in the first sub-matrix are 0, the 1 st column of the first sub-matrix is the 1 st column of the binarization density matrix, the last 1 column of the first sub-matrix is adjacent to the columns of which the elements are not all 0, the area of the first sub-matrix corresponding to the time-frequency distribution diagram is a left blank rectangle, and the relative arrival time range of the jth left blank rectangle is [ lt [ ]j,0,ltj,1]The frequency range is [ lf ]j,0,lfj,1]J is 0,1, …, unifying all left blank rectangles to the same relative arrival time range [ lt0,lt1]Wherein lt0Is ltj,0Mean value of (1), lt1Is ltj,1The mean value of (a);
(3d) searching a second sub-matrix in the binary density matrix, wherein the elements in the second sub-matrix are all 0, the last 1 column of the second sub-matrix is the last 1 column of the binary density matrix, and the second sub-matrix isThe 1 st column is adjacent to the column whose elements are not all 0, the region of the second sub-matrix corresponding to the time-frequency distribution diagram is the right blank rectangle, and the relative arrival time range of the kth right blank rectangle is [ rt ]k,0,rtk,1]In the frequency range of [ rfk,0,rfk,1]K is 0,1, …, unifying all right blank rectangles to the same relative arrival time range [ rt [ ]0,rt1]Wherein rt is0Is rtk,0Mean value of (1), rt1Is rtk,1The mean value of (a);
(4) determining respective distribution areas of frequency hopping signals of the two network stations, and sorting the frequency hopping signals in the areas to the respective network stations:
(4a) in a relative arrival time range of [ lt0,lt1]In a frequency range of [ rf ]k,0,rfk,1]As a distribution region of the frequency hopping signals of the network station 1, k is 0,1, …, and the frequency hopping signals in these overlapping regions form a frequency hopping signal set a1 of the network station 1;
(4b) with a relative time of arrival range of [ rt ]0,rt1]Frequency range of [ lf ]j,0,lfj,1]The overlapping area of (a) is used as the distribution area of the frequency hopping signals of the network station 2, j is 0,1, …, and the frequency hopping signals in the overlapping area form a frequency hopping signal set a2 of the network station 2;
at this time, the remaining hopping signals except the set a1 and the set a2 form a set B;
(4c) finding the frequency hopping signals in the same frequency hopping period as the frequency hopping signals in the set A1 in the set B, and transferring the frequency hopping signals into the set A2; after the transfer, the set B and the set A2 both have the increase and decrease of elements, and the subsequent related sets are set after the increase and decrease, which are similar and not described again;
(4d) finding the frequency hopping signals in the same frequency hopping period as the frequency hopping signals in the set A2 in the set B, and transferring the frequency hopping signals into the set A1;
(5) the remaining hopping signals are recursively sorted using mutual exclusivity of the two hopping signals in the same hopping period:
(5a) calculating a frequency set F1 of the frequency hopping signals in the set A1;
(5b) searching the frequency hopping signals with the frequency belonging to the set F1 in the rest frequency hopping signals in the set B, transferring the searched frequency hopping signals to the set A1, and simultaneously transferring the frequency hopping signals with the same frequency hopping period as the frequency hopping signals to the set A2;
(5c) calculating a frequency set F2 of the frequency hopping signals in the set A2;
(5d) searching the frequency hopping signals with the frequency belonging to the set F2 in the rest frequency hopping signals in the set B, transferring the searched frequency hopping signals to the set A2, and simultaneously transferring the frequency hopping signals with the same frequency hopping period as the frequency hopping signals to the set A1;
(5e) if the number of the residual frequency hopping signals in the set B still exists, repeating the steps (5a) to (5d) until no new frequency hopping signal can be selected;
(6) according to the frequency hopping signal sets A1 and A2 of the network station 1 and the network station 2, the frequency occurrence times in the two sets are respectively counted, the frequencies with high frequency occurrence times are screened to form a frequency set, and the reciprocal of the frequency hopping period is the hopping speed.
And finishing the net table sorting.
The following is a more specific example:
referring to fig. 1, a method for sorting two-network signals with overlapping arrival times includes the following steps:
step 1) estimating a frequency hopping period:
estimating a frequency hopping period by utilizing a PRI transformation algorithm according to the arrival time of the frequency hopping signal obtained in the frequency hopping signal detection;
step 2), constructing a time-frequency distribution map of the frequency hopping signal:
step 2a) calculating the relative arrival time, RTOA, of each frequency-hopping signaliThe calculation formula of (a) is as follows:
RTOAimod (time of arrival of ith hopping signal, hopping period)
Wherein i is 0,1, … N-1, N is the number of the frequency hopping signals, and mod is remainder calculation;
step 2b) constructing a time-frequency distribution graph of the frequency hopping signal by taking the relative arrival time and frequency of the frequency hopping signal as a horizontal axis and a vertical axis respectively;
step 3), calculating the range of the left blank rectangle and the right blank rectangle in the time-frequency distribution diagram:
step 3a) dividing grids on the time-frequency distribution diagram, and counting the number of frequency hopping signals in each grid to form a density matrix, wherein the time domain width of the grids in the embodiment is 0.1 time resolution, the time resolution is 44.44 microseconds, and the frequency width of the grids is 1 MHz;
and 3b) determining a threshold value according to left and right boundary elements of the density matrix to form a binary density matrix, wherein the value of 0 represents no signal or sparse signal in the grid, and the value of 1 represents signal in the grid. The threshold value is calculated in the following mode: calculating the sum of the number of the frequency hopping signals in the grids of each pair of upper and lower adjacent grids in the 1 st column and the last 1 st column of the density matrix, taking the maximum value of all the sum values, taking 1/4 of the maximum value as a threshold, and if the threshold is less than 4, directly setting the threshold as 4;
step 3c) searching a first sub-matrix in the binarization density matrix, wherein all elements in the first sub-matrix are 0, the 1 st column of the first sub-matrix is the 1 st column of the binarization density matrix, the last 1 column of the first sub-matrix is adjacent to the columns of which the elements are not all 0, the area of the first sub-matrix corresponding to the time-frequency distribution diagram is a left blank rectangle, and the relative arrival time range of the jth left blank rectangle is [ ltj,0,ltj,1]The frequency range is [ lf ]j,0,lfj,1]J is 0,1, …, unifying all left blank rectangles to the same relative arrival time range [ lt0,lt1]Wherein lt0Is ltj,0Mean value of (1), lt1Is ltj,1The mean value of (a);
step 3d) searching a second sub-matrix in the binarization density matrix, wherein the elements in the second sub-matrix are all 0, the last 1 column of the second sub-matrix is the last 1 column of the binarization density matrix, the 1 st column of the second sub-matrix is adjacent to the columns of which the elements are not all 0, the area of the second sub-matrix corresponding to the time-frequency distribution diagram is a right blank rectangle, and the relative arrival time range of the kth right blank rectangle is recorded as [ rtk,0,rtk,1]In the frequency range of [ rfk,0,rfk,1]K is 0,1, …, unifying all right blank rectangles to the same relative arrival time range [ rt [ ]0,rt1]Wherein rt is0Is rtk,0Mean value of (1), rt1Is rtk,1The mean value of (a);
step 4) determining respective distribution areas of the frequency hopping signals of the two network stations, and sorting the frequency hopping signals in the areas to the respective network stations:
step 4a) with a relative arrival time range of [ lt0,lt1]In a frequency range of [ rf ]k,0,rfk,1]As a distribution region of the frequency hopping signals of the network station 1, k is 0,1, …, and the frequency hopping signals in these overlapping regions form a frequency hopping signal set a1 of the network station 1;
step 4b) with a relative time of arrival range of [ rt ]0,rt1]Frequency range of [ lf ]j,0,lfj,1]The overlapping area of (a) is used as the distribution area of the frequency hopping signals of the network station 2, j is 0,1, …, and the frequency hopping signals in the overlapping area form a frequency hopping signal set a2 of the network station 2;
at this time, the remaining hopping signals except the set a1 and the set a2 form a set B;
step 4c) finding the frequency hopping signals in the set B in the same frequency hopping period as the frequency hopping signals in the set A1, and transferring the frequency hopping signals to the set A2; the judgment standard of the same frequency hopping period is that the difference of the arrival time of the two frequency hopping signals is less than one half of the frequency hopping period;
step 4d) finding the frequency hopping signals in the set B in the same frequency hopping period as the frequency hopping signals in the set A2, and transferring the frequency hopping signals to the set A1;
step 5) utilizing mutual exclusivity recursion of two frequency hopping signals in the same frequency hopping period to sort the rest frequency hopping signals:
step 5a) calculating a frequency set F1 of the frequency hopping signals in the set A1;
step 5B) searching the frequency hopping signals with the frequency belonging to the set F1 in the rest frequency hopping signals in the set B, transferring the searched frequency hopping signals to the set A1, and simultaneously transferring the frequency hopping signals in the same frequency hopping period with the frequency hopping signals to the set A2;
step 5c) calculating a frequency set F2 of the frequency hopping signals in the set A2;
step 5d) searching the frequency hopping signals with the frequency belonging to the set F2 in the rest frequency hopping signals in the set B, transferring the searched frequency hopping signals to the set A2, and simultaneously transferring the frequency hopping signals in the same frequency hopping period with the frequency hopping signals to the set A1;
step 5e) if the number of the residual frequency hopping signals in the set B still exists, repeating the steps (5a) to (5d) until no new frequency hopping signal can be selected;
and 6) respectively counting the frequency occurrence times in the two sets according to the frequency hopping signal sets A1 and A2 of the network station 1 and the network station 2, calculating the average value of the frequency occurrence times in the set A1 or A2, selecting the frequencies with the frequency occurrence times more than one half of the average value in the set, and forming the frequency set of the network station corresponding to the set, wherein the reciprocal of the frequency hopping period is the hopping speed of the network station.
And finishing the net table sorting.
In short, under the condition of not increasing the incoming wave direction information, the invention realizes the sorting of two network station signals with the same hopping speed and the overlapping arrival time and the incomplete overlapping frequency sets by utilizing the time-frequency distribution characteristics of the hopping frequency signals and the mutual exclusivity of the hopping frequency signals in the same hopping frequency period. The method has concise algorithm, greatly improves the adaptability of the network platform sorting method, and is an important improvement on the prior art.
It should be understood that the above description of the embodiments of the present patent is only an exemplary description for facilitating the understanding of the patent scheme by the person skilled in the art, and does not imply that the scope of protection of the patent is only limited to these examples, and that the person skilled in the art can obtain more embodiments by combining technical features, replacing some technical features, adding more technical features, and the like to the various embodiments listed in the patent without any inventive effort on the premise of fully understanding the patent scheme, and therefore, the new embodiments are also within the scope of protection of the patent.
Claims (7)
1. A method for sorting signals of two network stations with overlapped arrival time is characterized in that the method is used for sorting the signals of the two network stations, the frequency hopping periods of the two network stations are equal, and the arrival time of the signals is overlapped, and comprises the following steps:
(1) estimating a frequency hopping period according to the arrival time of the frequency hopping signals, and calculating the relative arrival time of each frequency hopping signal;
(2) constructing a time-frequency distribution graph of the frequency hopping signal by taking the relative arrival time and frequency of the frequency hopping signal as a horizontal axis and a vertical axis respectively; dividing grids on the time-frequency distribution diagram, counting the number of frequency hopping signals in each grid, if no signal or sparse signal exists in the grids, assigning the value of the grid to be 0, otherwise, assigning the value of the grid to be 1, and thus obtaining a binary density matrix;
(3) searching all first sub-matrixes and all second sub-matrixes in the density matrix; the elements in the first sub-matrix are all 0, the 1 st column thereof is the 1 st column of the density matrix, and the last 1 column thereof is adjacent to the columns of which the elements are not all 0; the area of the first sub-matrix corresponding to the time-frequency distribution diagram is a left blank rectangle; the elements in the second sub-matrix are all 0, the last 1 column of the second sub-matrix is the last 1 column of the density matrix, and the 1 st column of the second sub-matrix is adjacent to the columns of which the elements are not all 0; the region of the second sub-matrix corresponding to the time-frequency distribution diagram is a right blank rectangle; note that the relative arrival time range of the jth left blank rectangle is [ ltj,0,ltj,1]The frequency range is [ lf ]j,0,lfj,1]J is 0,1, …, unifying the relative arrival time range of all left blank rectangles as [ lt0,lt1]Wherein lt0Is ltj,0Mean value of (1), lt1Is ltj,1The mean value of (a); let the relative arrival time range of the kth right blank rectangle be [ rt ]k,0,rtk,1]In the frequency range of [ rfk,0,rfk,1]K is 0,1, …, unifying the relative arrival time range of all right blank rectangles as [ rt [ ]0,rt1]Wherein rt is0Is rtk,0Mean value of (1), rt1Is rtk,1The mean value of (a);
(4) in a relative arrival time range of [ lt0,lt1]In a frequency range of [ rf ]k,0,rfk,1]The overlapping areas of the first network station and the second network station are used as the distribution areas of the frequency hopping signals of the first network station, and the frequency hopping signals in the overlapping areas form a frequency hopping signal set A1 of the first network station; with a relative time of arrival range of [ rt ]0,rt1]Frequency range of [ lf ]j,0,lfj,1]The overlapping areas of the first network station and the second network station are used as the distribution areas of the frequency hopping signals of the second network station, and the frequency hopping signals in the overlapping areas form a frequency hopping signal set A2 of the second network station; the remaining frequency hopping signals except the set a1 and the set a2 are set as a set B;
(5) finding the frequency hopping signals in the same frequency hopping period as the frequency hopping signals in the set A1 in the set B, and transferring the frequency hopping signals into the set A2; in addition, the frequency hopping signals in the same frequency hopping period as the frequency hopping signals in the set A2 are searched in the set B and transferred to the set A1; update sets a1, a2, B;
(6) after the step (5) is completed, recursively transferring the frequency hopping signals in the set B to the set A1 and the set A2 by using the mutual exclusivity of the two frequency hopping signals in the same frequency hopping period until no transferable frequency hopping signal exists in the set B;
(7) respectively counting the occurrence times of each frequency in each set according to the sets A1 and A2 finally obtained in the step (6), selecting the frequencies with high occurrence times from the sets to form a frequency set of the network station corresponding to the set, wherein the reciprocal of the frequency hopping period obtained in the step (1) is the hopping speed of the two network stations; and finishing the sorting of the net platforms.
2. The method for sorting two-network signals with overlapped arrival time according to claim 1, wherein in the step (6), the following steps are performed for each recursion:
(601) calculating a frequency set F1 of the frequency hopping signals in the set A1;
(602) searching the frequency hopping signals with the frequency belonging to the set F1 in the frequency hopping signals existing in the set B, transferring the searched frequency hopping signals to the set A1, and transferring the frequency hopping signals with the same frequency hopping period as the frequency hopping signals to the set A2; update sets a1, a2, B;
(603) calculating a frequency set F2 of the frequency hopping signals in the set A2;
(604) searching the frequency hopping signals with the frequency belonging to the set F2 in the currently existing frequency hopping signals of the set B, transferring the searched frequency hopping signals to the set A2, and transferring the frequency hopping signals in the same frequency hopping period with the frequency hopping signals to the set A1; update sets A1, A2, B.
3. The method as claimed in claim 1, wherein the relative arrival time in step (1) is the remainder of the division of the arrival time of each frequency hopping signal by the frequency hopping period.
4. The method for sorting two-network signals with overlapping arrival times according to claim 1, wherein in the step (2), the judgment method of no signal or sparse signal in the grid is as follows:
(201) calculating the sum of the number of the frequency hopping signals in the grids of each pair of upper and lower adjacent grids in the first grid and the last grid, taking the maximum value of all the sum values, taking 1/4 of the maximum value as a threshold, and directly setting the threshold as 4 if the threshold is less than 4;
(202) for any grid, if the number of the frequency hopping signals is smaller than the threshold value, no signal or sparse signal in the grid is judged.
5. The method as claimed in claim 1, wherein the step (1) estimates the frequency hopping period by a PRI pulse repetition interval transformation method.
6. The method as claimed in claim 1, wherein the difference between the arrival times of the two hopping signals in the same hopping period is less than one half of the hopping period.
7. The method as claimed in claim 1, wherein in the step (7), the frequencies with high occurrence frequencies are selected to form the frequency sets of the network stations corresponding to the set by calculating a mean value of the occurrence frequencies in the set a1 or a2, and selecting the frequencies with occurrence frequencies greater than one-half of the mean value to form the frequency sets of the network stations corresponding to the set.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010395582.3A CN111600631B (en) | 2020-05-12 | 2020-05-12 | Method for sorting signals of two network stations with overlapped arrival time |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010395582.3A CN111600631B (en) | 2020-05-12 | 2020-05-12 | Method for sorting signals of two network stations with overlapped arrival time |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111600631A true CN111600631A (en) | 2020-08-28 |
| CN111600631B CN111600631B (en) | 2021-07-06 |
Family
ID=72182325
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010395582.3A Active CN111600631B (en) | 2020-05-12 | 2020-05-12 | Method for sorting signals of two network stations with overlapped arrival time |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111600631B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113109784A (en) * | 2021-04-28 | 2021-07-13 | 中国人民解放军63892部队 | Radar pulse repetition interval estimation method based on blind source separation |
| CN116232378A (en) * | 2023-02-01 | 2023-06-06 | 南京中新赛克科技有限责任公司 | Frequency hopping signal sorting method based on statistical analysis |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2002132620A (en) * | 2000-10-19 | 2002-05-10 | Nec Access Technica Ltd | Radio information terminal and its radio communication method |
| JP2006229463A (en) * | 2005-02-16 | 2006-08-31 | Daiichikosho Co Ltd | Device for applying real-time streaming transmission to high-efficiency coded time series information for reception and reproduction |
| CN108462509A (en) * | 2018-03-26 | 2018-08-28 | 西安电子科技大学 | Asynchronous frequency hopping net platform method for separating based on time-frequency figure information |
| CN110336585A (en) * | 2019-04-17 | 2019-10-15 | 四川大学 | A kind of Frequency Hopping Signal method for parameter estimation based on MWC |
| CN110401502A (en) * | 2019-06-17 | 2019-11-01 | 同方电子科技有限公司 | Net platform method for separating based on time-frequency collision principle |
| CN111046896A (en) * | 2018-10-11 | 2020-04-21 | 中国人民解放军空军工程大学 | Sorting method for frequency hopping signal radio stations |
-
2020
- 2020-05-12 CN CN202010395582.3A patent/CN111600631B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2002132620A (en) * | 2000-10-19 | 2002-05-10 | Nec Access Technica Ltd | Radio information terminal and its radio communication method |
| JP2006229463A (en) * | 2005-02-16 | 2006-08-31 | Daiichikosho Co Ltd | Device for applying real-time streaming transmission to high-efficiency coded time series information for reception and reproduction |
| CN108462509A (en) * | 2018-03-26 | 2018-08-28 | 西安电子科技大学 | Asynchronous frequency hopping net platform method for separating based on time-frequency figure information |
| CN111046896A (en) * | 2018-10-11 | 2020-04-21 | 中国人民解放军空军工程大学 | Sorting method for frequency hopping signal radio stations |
| CN110336585A (en) * | 2019-04-17 | 2019-10-15 | 四川大学 | A kind of Frequency Hopping Signal method for parameter estimation based on MWC |
| CN110401502A (en) * | 2019-06-17 | 2019-11-01 | 同方电子科技有限公司 | Net platform method for separating based on time-frequency collision principle |
Non-Patent Citations (1)
| Title |
|---|
| 杨芸丞等: "基于时频分析的异步跳频网台分选方法仿真", 《计算机仿真》 * |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113109784A (en) * | 2021-04-28 | 2021-07-13 | 中国人民解放军63892部队 | Radar pulse repetition interval estimation method based on blind source separation |
| CN116232378A (en) * | 2023-02-01 | 2023-06-06 | 南京中新赛克科技有限责任公司 | Frequency hopping signal sorting method based on statistical analysis |
| CN116232378B (en) * | 2023-02-01 | 2023-08-29 | 南京中新赛克科技有限责任公司 | Frequency hopping signal sorting method based on statistical analysis |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111600631B (en) | 2021-07-06 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111600631B (en) | Method for sorting signals of two network stations with overlapped arrival time | |
| CN101692734B (en) | Method and device for predicting cell interference | |
| CN110113075B (en) | Hybrid network station frequency hopping parameter blind estimation method based on STFT-SPWVD | |
| CN104917820B (en) | A kind of data transmission method based on the wireless interconnected interworking technology of micropower | |
| CN104507164B (en) | A kind of WSN node positioning methods based on RSS and ranging unbiased esti-mator | |
| CN107027148B (en) | Radio Map classification positioning method based on UE speed | |
| KR102655903B1 (en) | Processing method and processing device for saving energy in a base station | |
| CN105353344A (en) | Distance automatic measuring method of wireless network nodes | |
| CN105978644A (en) | Cuckoo search algorithm based satellite-land cognitive system frequency spectrum access method | |
| CN112444778A (en) | Reference point weighted trilateral centroid positioning method based on DBSCAN | |
| CN102752852A (en) | Mobile communication positioning method based on code division multiple access (CDMA) base station | |
| Hatami et al. | On RSS and TOA based indoor geolocation-a comparative performance evaluation | |
| DE102015105683B4 (en) | CELL SEARCH PROCEDURE AND COMMUNICATION TERMINAL | |
| CN105099964A (en) | Method and equipment for estimating power intensity and determining interference cell | |
| CN110488259A (en) | A kind of classification of radar targets method and device based on GDBSCAN | |
| CN111600629B (en) | Net platform sorting method based on improved CleaStream framework | |
| CN105137398A (en) | Genetic algorithm-based radar anti-forwarding-type interference pulse compression filter optimization method | |
| CN108983167A (en) | Radar universal description modeling method and device | |
| CN113068194B (en) | Method, device, equipment and medium for determining anchor point | |
| CN114689056A (en) | Accurate distance measurement method based on UWB SS-TWR | |
| CN113359100A (en) | Attribute data association method for tracking target radar radiation source | |
| CN107196744B (en) | Method/system for detecting implicit communication signal, storage medium and electronic device | |
| Imaizumi et al. | Low-Cost Path Loss Estimation Using Correlation Graph CNN with Novel Feature Parameters | |
| CN116430345B (en) | 5G network-based low-altitude unmanned aerial vehicle multi-target reflection source separation method | |
| CN115940993A (en) | Network platform sorting and tracking method based on RB-Stream algorithm |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |