Low-complexity optimal zero collision zone frequency hopping sequence set construction method and storage medium

Abstract

The invention discloses a low-complexity optimal zero collision zone frequency hopping sequence set construction method and a storage medium, and the construction method comprises the steps: obtaining a frequency hopping sequence length L and a frequency hopping sequence number M corresponding to a frequency hopping sequence set needing to be constructed, and a frequency point type number M in a frequency point set, the frequency point set is used for providing candidate frequencies for construction of the frequency hopping sequence set; constructing a frequency hopping matrix A of which the initial state is an all-zero matrix based on the frequency hopping sequence length L and the frequency hopping sequence number M, and calculating the element number T of the frequency hopping matrix A; classifying the frequency hopping matrix A based on the size relationship between the element number T and the frequency point type number F, the quantitative relationship between the element number T and the frequency point type number F, and the quantitative relationship between the frequency point type number F and the frequency hopping sequence number M; mapping from the frequency hopping matrix A to the frequency point set is established according to the type of the frequency hopping matrix A, and elements of the frequency hopping matrix A are replaced by corresponding frequency points in the mapping relation; and redistributing the positions of the elements in the frequency hopping matrix A.

Description

Technical Field

[0001] The present invention belongs to the technical field of frequency hopping communications, and in particular relates to a low-complexity optimal zero-collision interval frequency hopping sequence set construction method and a storage medium. Background Art

[0002] Wireless communications often face the problem of signals being interfered with by various means, especially in some complex electromagnetic environments. In order to effectively avoid the enemy's broadband suppression interference, single-tone interference at fixed frequencies, and linear frequency hopping interference, frequency hopping communication has been widely used in various communication systems with its broadband frequency hopping band, fast frequency hopping speed, and flexible frequency hopping points. The purpose of frequency hopping technology is to make the signal frequency point present the characteristics of random hopping within a larger frequency broadband range as much as possible, so that the frequency band of the entire signal can be extended to a larger broadband, so as to make the best use of the frequency band resources to reduce the probability of interference to one's own communication signal. In the multi-user frequency hopping communication scenario, frequency hopping communication needs to consider not only avoiding enemy interference, but also avoiding interference caused by collision of one's own frequency points, which makes the zero collision zone an important indicator of the frequency hopping sequence family.

[0003] The optimal zero-collision zone frequency-hopping sequence family constructed by existing construction techniques / methods based on mathematical methods such as finite fields is often limited to a certain specific form and coupled with each other in terms of the number of frequency-hopping sequences, the length of the frequency-hopping sequence, and the number of frequency points. There is no construction method applicable to scenarios where the above three parameters can be set arbitrarily. Existing solutions based on heuristic algorithms often have a high complexity in algorithm implementation, resulting in a long iterative convergence time, making it difficult to generate sequence families in real time, and there may be unstable performance. Summary of the invention

[0004] In view of the shortcomings of the prior art, the present invention provides a low-complexity optimal zero-collision zone frequency hopping sequence set construction method, which can quickly construct a frequency hopping sequence family with a zero-collision zone under optimal non-periodic Hamming correlation and good pseudo-random performance under the constraints of any frequency hopping sequence number F, frequency hopping sequence length L and number of frequency point types M. It is suitable for a multi-user frequency hopping communication system that needs to generate a frequency hopping sequence family under any of the above three parameters in real time.

[0005] In order to achieve the above-mentioned object of the invention, the present invention provides a low-complexity optimal zero-collision zone frequency hopping sequence set construction method, comprising:

[0006] Acquire a frequency hopping sequence length L and a frequency hopping sequence number M corresponding to a frequency hopping sequence set to be constructed, and a frequency point type number M in a frequency point set, wherein the frequency point set is used to provide candidate frequencies for constructing the frequency hopping sequence set;

[0007] Constructing a frequency hopping matrix A whose initial state is an all-zero matrix based on the frequency hopping sequence length L and the frequency hopping sequence number M, and calculating the number of elements T of the frequency hopping matrix A;

[0008] Classifying the frequency hopping matrix A based on the magnitude relationship between the number of elements T and the number of frequency point types F, the quantitative relationship between the number of elements T and the number of frequency point types F, and the quantitative relationship between the number of frequency point types F and the number of frequency hopping sequences M;

[0009] Establishing a mapping from the frequency hopping matrix A to the frequency point set according to the type of the frequency hopping matrix A, and replacing the elements of the frequency hopping matrix A with the corresponding frequency points in the mapping relationship;

[0010] The positions of the elements in the frequency hopping matrix A are reallocated.

[0011] Preferably, constructing a frequency hopping matrix A whose initial state is an all-zero matrix based on the frequency hopping sequence length L and the frequency hopping sequence number M, and calculating the number of elements T of the frequency hopping matrix A includes:

[0012] With the frequency hopping sequence length L as the number of columns and the frequency hopping sequence number M as the number of rows, a frequency hopping matrix A whose initial state is an all-zero matrix is ​​constructed;

[0013] The number of elements T of the frequency hopping matrix A is calculated according to T=LM.

[0014] Preferably, the frequency hopping matrix A is classified based on the size relationship between the number of elements T and the number of frequency point types F, the quantitative relationship between the number of elements T and the number of frequency point types F, and the quantitative relationship between the number of frequency point types F and the number of frequency hopping sequences M, including:

[0015] Determine the relationship between the number of elements T and the number of frequency point types F. If T≤F, classify the frequency hopping matrix A as a first-type frequency hopping matrix, and let the frequency point set be P={p1,p2,...,p F};

[0016] If T>F, let T=kF+r, where k, r belong to the set of natural numbers, and r<F; let η= <f> M , where the operation <α> β It represents the modulus operation of α on β, where α and β are both integers;

[0017] If η=0 and r=0, the frequency hopping matrix A is classified as a second type of frequency hopping matrix, and the frequency point set is set to P={p1, p2, ..., p F };

[0018] If η=0 and r≠0, the frequency hopping matrix A is classified as the third type of frequency hopping matrix, and the frequency point set is P={p1,p2,...,p F }, and its two complementary subsets are Γ={P1,P2,...,P r }, and Ξ={P r+1 ,P r+2 ,...,P F };

[0019] If η≠0 and r=0, the frequency hopping matrix A is classified as the fourth type of frequency hopping matrix, and b= <f> M , and let the frequency point set be P = {p1, p2, ..., p F }, and its two complementary subsets are Γ={P1,P2,...,P F-b }, and Ξ={P F-b+1 ,P F-b+2 ,...,P F };

[0020] If η≠0 and r≠0, the frequency hopping matrix A is classified as the fifth type of frequency hopping matrix, and c=M- <r> M , and let the frequency point set be P = {p1, p2, ..., p F }, and its two complementary subsets are Γ={P1,P2,...,P r+c }, and Ξ={P r+c+1 ,P r+c+2 ,...,P F }.

[0021] Preferably, the construction method further comprises:

[0022] Based on the formula:

[0023]

[0024] The value range of the zero collision zone length corresponding to the frequency hopping sequence set to be constructed is calculated, and the zero collision zone length N is set to obtain a boundary value.

[0025] Preferably, establishing a mapping of the frequency hopping matrix A to the frequency point set according to the type of the frequency hopping matrix A, and replacing the elements of the frequency hopping matrix A with the corresponding frequency points in the mapping relationship, includes:

[0026] If the frequency hopping matrix A is a first-type frequency hopping matrix, establish a single injection from the frequency hopping matrix A to the frequency point set: Among them, a i,j represents the element in the i-th row and j-th column of the frequency hopping matrix A; i, j belong to the natural number set and 1≤i≤M, 1≤j≤L; the element a in the frequency hopping matrix A is i,j All are replaced by the frequency points p in the mapping ξ iL+j ;

[0027] If the frequency hopping matrix A is a second type frequency hopping matrix, then a surjection from the frequency hopping matrix A to the frequency point set is established: Where i, j, l belong to the natural number set and 1≤i≤M, 1≤j≤N+1, 0≤l≤k-1; the element a in the frequency hopping matrix A is i,j+l*(N+1) All are replaced by their frequency points p in the mapping ξ i+(j-1)*M ;

[0028] If the frequency hopping matrix A is a third type frequency hopping matrix, establish a surjection from the frequency hopping matrix A to the frequency point set: where i, j, l belong to the set of natural numbers and

[0029] Then establish the surjection: where i, m, n belong to the set of natural numbers and

[0030] The frequency hopping matrix A is i,j+l*(N+1) All elements are replaced by their frequency points p in the mapping ξ1 i+(j-1)*M ; The frequency hopping matrix A in a i,m+n*(N+1) All elements are replaced by their frequency points p in the mapping ξ2 i+(m-1)*M .

[0031] Preferably, establishing a mapping of the frequency hopping matrix A to the frequency point set according to the type of the frequency hopping matrix A, and replacing the elements of the frequency hopping matrix A with the corresponding frequency points in the mapping relationship, includes:

[0032] If the frequency hopping matrix A is a fourth type of frequency hopping matrix, a surjection from the frequency hopping matrix A to the frequency point set is established: Where i, j, l belong to the set of natural numbers and 1≤i≤M, 1≤j≤N+1, 0≤l≤k-1;

[0033] Then establish a surjection from the frequency hopping matrix A to the frequency point set: where i, m, n belong to the set of natural numbers and

[0034] The frequency hopping matrix A is i,j+l*(N+1) All elements are replaced by their frequency points p in the mapping ξ1 i+(j-1)*M ; The frequency hopping matrix A All elements are replaced by their frequency points p in the mapping ξ2 n+1 ;

[0035] If the frequency hopping matrix A is a fifth type of frequency hopping matrix, establish a surjection from the frequency hopping matrix A to the frequency point set: where i, j, l belong to the set of natural numbers and

[0036] Then establish a surjection from the frequency hopping matrix A to the frequency point set:

[0037] where i, m belong to the set of natural numbers and

[0038]

[0039] The frequency hopping matrix A All elements are replaced by their frequency points p in the mapping ξ1 i+(j-1)*M ; The frequency hopping matrix A in a i,m All elements are replaced by their frequency points in the mapping ξ2

[0040] Preferably, the reallocating positions of elements in the frequency hopping matrix A comprises:

[0041] If the frequency hopping matrix A is a first type of frequency hopping matrix, the elements in the frequency hopping matrix A are randomly shuffled in units of each row or each column.

[0042] Preferably, the reallocating positions of elements in the frequency hopping matrix A comprises:

[0043] If the frequency hopping matrix A is a second-type frequency hopping matrix or a third-type frequency hopping matrix, the elements in the frequency hopping matrix A are randomly shuffled in units of each column.

[0044] Preferably, the reallocating positions of elements in the frequency hopping matrix A comprises:

[0045] If the frequency hopping matrix A is a frequency hopping matrix of the fourth type, a bijection is established:

[0046]

[0047] where i, m, n belong to the set of natural numbers and

[0048] Interchanging the positions of the one-to-one corresponding elements in the mapping σ in the frequency hopping matrix A;

[0049] The elements of the frequency hopping matrix A are randomly shuffled in units of each column;

[0050] If the frequency hopping matrix A is a fifth type of frequency hopping matrix, establish a bijection:

[0051]

[0052] where i, m belong to the set of natural numbers and

[0053] Interchanging the positions of the one-to-one corresponding elements in σ in the frequency hopping matrix A;

[0054] The elements of the frequency hopping matrix A are randomly shuffled in units of each column.

[0055] The present invention also provides a readable storage medium, wherein the readable storage medium stores a computer program, and when the computer program is executed by a processor, any of the above-mentioned methods is implemented.

[0056] Compared with the prior art, the present invention has the following advantages:

[0057] The present invention provides a low-complexity optimal zero-collision zone frequency hopping sequence set construction method, which analyzes and classifies the relationship between the frequency hopping sequence length L, the number of frequency hopping sequences M and the number of frequency point types F of the required frequency hopping sequence family, and establishes a mapping relationship between the frequency hopping matrix A and the frequency point set, assigns and replaces the original image set with the image set, and then generates the frequency hopping sequence family. The frequency hopping sequence families designed by this scheme have all achieved the optimal zero-collision zone performance, that is, the frequency hopping sequence family with the largest zero-collision zone length, which can effectively solve the mutual interference problem of multi-user frequency hopping communication; this scheme can adapt to any frequency hopping sequence length L, the number of frequency hopping sequences M and the number of frequency point types F, and there is no coupling relationship between the three in the generated frequency hopping sequence family; the assignment and replacement operations involved in this scheme are easy to implement in programming, and because it does not involve finite field operations with high complexity, the random sorting algorithm involved is also easy to call directly in environments such as C language, so that the whole set of algorithms has a low implementation complexity and is suitable for application scenarios that require real-time generation of frequency hopping sequence families. BRIEF DESCRIPTION OF THE DRAWINGS

[0058] Figure 1 The figure is a flow chart of a method for constructing a low-complexity optimal zero-collision zone frequency hopping sequence set according to an embodiment of the present invention. DETAILED DESCRIPTION

[0059] The following is combined with Figure 1 The low-complexity optimal zero-collision zone frequency-hopping sequence set construction method and storage medium proposed in the present invention are further described in detail with specific implementation methods. According to the following description, the advantages and features of the present invention will be clearer. It should be noted that the drawings are in a very simplified form and use non-precise proportions, which are only used to conveniently and clearly assist in explaining the purpose of the implementation methods of the present invention. In order to make the purposes, features and advantages of the present invention more obvious and easy to understand, please refer to the drawings. It should be noted that the structures, proportions, sizes, etc. illustrated in the drawings of this specification are only used to match the contents disclosed in the specification for people familiar with this technology to understand and read, and are not used to limit the limiting conditions for the implementation of the present invention, so they have no substantive technical significance. Any structural modification, change in proportional relationship or adjustment of size, without affecting the effects that can be produced by the present invention and the purposes that can be achieved, should still fall within the scope of the technical content disclosed by the present invention.

[0060] 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 "comprise", "include" 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. In the absence of further restrictions, an element defined by the sentence "comprises a ..." does not exclude the presence of other identical elements in the process, method, article or device including the element.

[0061] See also Figure 1 , Figure 1 The flowchart of a method for constructing a low-complexity optimal zero-collision zone frequency hopping sequence set according to an embodiment of the present invention includes the following steps:

[0062] Step S1: obtaining a frequency hopping sequence length L and a frequency hopping sequence number M corresponding to a frequency hopping sequence set to be constructed, and a frequency point type number M in a frequency point set, wherein the frequency point set is used to provide candidate frequencies for constructing the frequency hopping sequence set;

[0063] Step S2: constructing a frequency hopping matrix A whose initial state is an all-zero matrix based on the frequency hopping sequence length L and the frequency hopping sequence number M, and calculating the number of elements T of the frequency hopping matrix A;

[0064] Step S3: classifying the frequency hopping matrix A based on the magnitude relationship between the number of elements T and the number of frequency point types F, the quantitative relationship between the number of elements T and the number of frequency point types F, and the quantitative relationship between the number of frequency point types F and the number of frequency hopping sequences M;

[0065] Step S4: establishing a mapping from the frequency hopping matrix A to the frequency point set according to the type of the frequency hopping matrix, and replacing the elements of the frequency hopping matrix A with the corresponding frequency points in the mapping relationship;

[0066] Step S5: reallocate the positions of the elements in the frequency hopping matrix A.

[0067] Specifically, in some embodiments, step S2 includes:

[0068] With the frequency hopping sequence length L as the number of columns and the frequency hopping sequence number M as the number of rows, a frequency hopping matrix A whose initial state is an all-zero matrix is ​​constructed;

[0069] The number of elements T of the frequency hopping matrix A is calculated according to T=LM.

[0070] For example, the hopping sequence length L of the hopping sequence set to be constructed is 13, the number of hopping sequences M is 5, and the number of frequency types in the frequency point set is F=17, then a 5-row 13-column all-zero matrix is ​​constructed as the initial state of the hopping matrix A.

[0071] Specifically, in some embodiments, step S3 includes:

[0072] Determine the relationship between the number of elements T and the number of frequency point types F. If T≤F, classify the frequency hopping matrix A as a first-type frequency hopping matrix, and let the frequency point set be P={p1,p2,...,p F };

[0073] If T>F, let T=kF+r, where k, r belong to the set of natural numbers, and r<F; let η= <f> M , where operation <α β It represents the modulus operation of α on β, where α and β are both integers;

[0074] If η=0 and r=0, the frequency hopping matrix A is classified as a second type of frequency hopping matrix, and the frequency point set is set to P={p1, p2, ..., p F };

[0075] If η=0 and r≠0, the frequency hopping matrix A is classified as the third type of frequency hopping matrix, and the frequency point set is P={p1,p2,...,p F }, and its two complementary subsets are Γ={P1,P2,...,P r }, and Ξ={P r+1 ,P r+2 ,...,P F };

[0076] If η≠0 and r=0, the frequency hopping matrix A is classified as the fourth type of frequency hopping matrix, and b= <f> M , and let the frequency point set be P = {p1, p2, ..., p F }, and its two complementary subsets are Γ={P1,P2,...,P F-b }, and Ξ={P F-b+1 ,P F-b+2 ,...,P F };

[0077] If η≠0 and r≠0, the frequency hopping matrix A is classified as the fifth type of frequency hopping matrix, and c=M- <r> M , and let the frequency point set be P = {p1, p2, ..., p F }, and its two complementary subsets are Γ={P1,P2,...,P r+c }, and Ξ={P r+c+1 ,P r+c+2 ,...,P F }.

[0078] In the above embodiment, a specific classification method of the frequency hopping matrix A is provided, so as to establish a mapping relationship between the type of the frequency hopping matrix A and the frequency point set in the subsequent process.

[0079] In this embodiment, the number of elements T is 65, T>F, so let:

[0080] T=kF+r, where k=3, r=14, define η= <f> M =2.

[0081] In this embodiment, η≠0 and r≠0, so the frequency hopping matrix A is classified as the fifth type of frequency hopping matrix, and c=M- <r> M =1, and let the frequency point set be P = {p1,p2,...,p 17 }, and its two complementary subsets are Γ={P1,P2,...,P 15 }, and Ξ={P 16 ,P 17 }.

[0082] In some embodiments, the low-complexity optimal zero-collision zone frequency hopping sequence set construction method of the present invention further includes:

[0083] Based on the formula:

[0084]

[0085] The value range of the zero collision zone length corresponding to the frequency hopping sequence set to be constructed is calculated, and the zero collision zone length N is set to obtain a boundary value.

[0086] For example, in this embodiment, the number of frequency point types F=17, the number of frequency hopping sequences=5, after calculation, the optimal zero collision zone length N≤2, the boundary value is 2, therefore, the zero collision zone length N=2.

[0087] Specifically, in some embodiments, step S4 includes:

[0088] If the frequency hopping matrix A is a first-type frequency hopping matrix, establish a single injection from the frequency hopping matrix A to the frequency point set: Among them, a i,j represents the element in the i-th row and j-th column of the frequency hopping matrix A; i, j belong to the natural number set and 1≤i≤M, 1≤j≤L; the element a in the frequency hopping matrix A is i,j All are replaced by the frequency points p in the mapping ξ iL+j ;

[0089] If the frequency hopping matrix A is a second type frequency hopping matrix, then a surjection from the frequency hopping matrix A to the frequency point set is established: Where i, j, l belong to the natural number set and 1≤i≤M, 1≤j≤N+1, 0≤l≤k-1; the element a in the frequency hopping matrix A is i,j+l*(N+1) All are replaced by their frequency points p in the mapping ξ i+(j-1)*M ;

[0090] If the frequency hopping matrix A is a third type frequency hopping matrix, establish a surjection from the frequency hopping matrix A to the frequency point set: where i, j, l belong to the set of natural numbers and

[0091] Then establish the surjection: where i, m, n belong to the set of natural numbers and

[0092] The frequency hopping matrix A is i,j+l*(N+1) All elements are replaced by their frequency points p in the mapping ξ1 i+(j-1)*M ; The frequency hopping matrix A in a i,m+n*(N+1) All elements are replaced by their frequency points p in the mapping ξ2 i+(m-1)*M .

[0093] Specifically, in some embodiments, step S4 further includes:

[0094] If the frequency hopping matrix A is a fourth type of frequency hopping matrix, a surjection from the frequency hopping matrix A to the frequency point set is established: Where i, j, l belong to the set of natural numbers and 1≤i≤M, 1≤j≤N+1, 0≤l≤k-1;

[0095] Then establish a surjection from the frequency hopping matrix A to the frequency point set: where i, m, n belong to the set of natural numbers and

[0096] The frequency hopping matrix A is i,j+l*(N+1) All elements are replaced by their frequency points p in the mapping ξ1 i+(j-1)*M ; The frequency hopping matrix A All elements are replaced by their frequency points p in the mapping ξ2 n+1 ;

[0097] If the frequency hopping matrix A is a fifth type of frequency hopping matrix, establish a surjection from the frequency hopping matrix A to the frequency point set: where i, j, l belong to the set of natural numbers and

[0098] Then establish a surjection from the frequency hopping matrix A to the frequency point set:

[0099] where i, m belong to the set of natural numbers and

[0100]

[0101] The frequency hopping matrix A All elements are replaced by their frequency points p in the mapping ξ1 i+(j-1)*M ; The frequency hopping matrix A in a i,m All elements are replaced by their frequency points in the mapping ξ2

[0102] In this embodiment, the frequency hopping matrix is ​​a fifth type of frequency hopping matrix, and a surjection is established:

[0103]

[0104] where i, j, l belong to the set of natural numbers and

[0105] Then establish the surjection:

[0106]

[0107] where i, m belong to the set of natural numbers and

[0108] The frequency hopping matrix a i,j+3*l All elements are replaced by their images p in the mapping ξ1 i+5*(j-1) ; Change a in the frequency hopping matrix i,m All corresponding elements are replaced by their images in the mapping ξ2

[0109] Specifically, in some embodiments, step S5 includes:

[0110] If the frequency hopping matrix A is a first type of frequency hopping matrix, the elements in the frequency hopping matrix A are randomly shuffled in units of each row or each column.

[0111] If the frequency hopping matrix A is a second-type frequency hopping matrix or a third-type frequency hopping matrix, the elements in the frequency hopping matrix A are randomly shuffled in units of each column.

[0112] If the frequency hopping matrix A is a frequency hopping matrix of the fourth type, a bijection is established:

[0113]

[0114] where i, m, n belong to the set of natural numbers and

[0115] Interchanging the positions of the one-to-one corresponding elements in the mapping σ in the frequency hopping matrix A;

[0116] The elements of the frequency hopping matrix A are randomly shuffled in units of each column;

[0117] If the frequency hopping matrix A is a fifth type of frequency hopping matrix, establish a bijection:

[0118]

[0119] where i, m belong to the set of natural numbers and

[0120] Interchanging the positions of the one-to-one corresponding elements in σ in the frequency hopping matrix A;

[0121] The elements of the frequency hopping matrix A are randomly shuffled in units of each column.

[0122] In this embodiment, the frequency hopping matrix is ​​a fifth type of frequency hopping matrix, and a surjection is established:

[0123]

[0124] where i, m belong to the set of natural numbers and

[0125] The positions of the one-to-one corresponding elements in σ in the frequency hopping matrix are swapped.

[0126] The elements of the frequency hopping matrix A are randomly shuffled in units of each column.

[0127] Please refer to Table 1, which is a frequency hopping sequence set constructed using the technical solution of this embodiment.

[0128] Table 1

[0129]

[0130]

[0131] The present invention provides a method for constructing a low-complexity optimal zero-correlation zone frequency hopping sequence set, by analyzing and classifying the relationship between the frequency hopping sequence length, the number of frequency hopping sequences and the number of frequency point types of the required frequency hopping sequence set, and establishing a mapping relationship between the frequency point set and the frequency hopping matrix. The frequency hopping sequence set is generated by assigning and replacing the elements between the original image set and the image set. The frequency hopping sequence set designed by the method realizes the optimal zero-correlation zone (i.e., zero-collision zone) performance, maximizes the length of the zero-correlation zone, and effectively solves the mutual interference problem in multi-user frequency hopping communication. The method is applicable to frequency hopping sequences with arbitrary frequency hopping sequence length L, frequency hopping sequence number M and frequency point type number F, and there is no coupling relationship between the three in the generated sequence set. The assignment and replacement operations involved in the method are easy to implement in programming, and do not involve finite field operations with higher complexity. The random sorting algorithm adopted is also easy to call in environments such as C language. Therefore, the entire algorithm has a low implementation complexity and is suitable for practical application scenarios where a frequency hopping sequence set needs to be generated in real time.

[0132] This embodiment further provides a readable storage medium, in which a computer program is stored. When the computer program is executed by a processor, the method for constructing a low-complexity optimal zero-collision zone frequency hopping sequence set described in any of the above implementation methods of this embodiment is implemented.

[0133] Although the content of the present invention has been described in detail through the above preferred embodiments, it should be appreciated that the above description should not be considered as a limitation of the present invention. After reading the above content, it will be apparent to those skilled in the art that various modifications and substitutions of the present invention will occur. Therefore, the protection scope of the present invention should be limited by the appended claims.< / r> < / f> < / r> < / f> < / f> < / r> < / f> < / f>

Claims

1. A low-complexity optimal zero-collision zone frequency hopping sequence set construction method, characterized in that: include: Acquire a frequency hopping sequence length L and a frequency hopping sequence number M corresponding to a frequency hopping sequence set to be constructed, and a frequency point type number M in a frequency point set, wherein the frequency point set is used to provide candidate frequencies for constructing the frequency hopping sequence set; Constructing a frequency hopping matrix A whose initial state is an all-zero matrix based on the frequency hopping sequence length L and the frequency hopping sequence number M, and calculating the number of elements T of the frequency hopping matrix A; Classifying the frequency hopping matrix A based on the magnitude relationship between the number of elements T and the number of frequency point types F, the quantitative relationship between the number of elements T and the number of frequency point types F, and the quantitative relationship between the number of frequency point types F and the number of frequency hopping sequences M; Establishing a mapping from the frequency hopping matrix A to the frequency point set according to the type of the frequency hopping matrix A, and replacing the elements of the frequency hopping matrix A with the corresponding frequency points in the mapping relationship; The positions of the elements in the frequency hopping matrix A are reallocated.

2. The method for constructing a low-complexity optimal zero-collision zone frequency hopping sequence set according to claim 1, characterized in that: The step of constructing a frequency hopping matrix A whose initial state is an all-zero matrix based on the frequency hopping sequence length L and the frequency hopping sequence number M, and calculating the number of elements T of the frequency hopping matrix A includes: With the frequency hopping sequence length L as the number of columns and the frequency hopping sequence number M as the number of rows, a frequency hopping matrix A whose initial state is an all-zero matrix is ​​constructed; The number of elements T of the frequency hopping matrix A is calculated according to T=LM.

3. The method for constructing a low-complexity optimal zero-collision zone frequency hopping sequence set according to claim 1, characterized in that: Based on the magnitude relationship between the number of elements T and the number of frequency point types F, the quantitative relationship between the number of elements T and the number of frequency point types F, and the quantitative relationship between the number of frequency point types F and the number of frequency hopping sequences M, the frequency hopping matrix A is classified, including: Determine the relationship between the number of elements T and the number of frequency point types F. If T≤F, classify the frequency hopping matrix A as a first-type frequency hopping matrix, and let the frequency point set be P={p1,p2,...,p F }; If T>F, let T=kF+r, where k, r belong to the set of natural numbers, and r<F; let η= <f> M , where the operation <α> β It represents the modulus operation of α on β, where α and β are both integers;< / f> If η=0 and r=0, the frequency hopping matrix A is classified as a second type of frequency hopping matrix, and the frequency point set is set to P={p1, p2, ..., p F }; If η=0 and r≠0, the frequency hopping matrix A is classified as the third type of frequency hopping matrix, and the frequency point set is P={p1,p2,...,p F }, and its two complementary subsets are Γ={P1,P2,...,P r }, and Ξ={P r+1 ,P r+2 ,...,P F }; If η≠0 and r=0, the frequency hopping matrix A is classified as the fourth type of frequency hopping matrix, and b= <f> M , and let the frequency point set be P = {p1, p2, ..., p F }, and its two complementary subsets are Γ={P1,P2,...,P F-b }, and Ξ={P F-b+1 ,P F-b+2 ,...,P F };< / f> If η≠0 and r≠0, the frequency hopping matrix A is classified as the fifth type of frequency hopping matrix, and c=M- <r> M , and let the frequency point set be P = {p1, p2, ..., p F }, and its two complementary subsets are Γ={P1,P2,...,P r+c }, and Ξ={P r+c+1 ,P r+c+2 ,...,P F }.< / r> 4. The method for constructing a low-complexity optimal zero-collision zone frequency hopping sequence set according to claim 3, characterized in that: The construction method also includes: Based on the formula: The value range of the zero collision zone length corresponding to the frequency hopping sequence set to be constructed is calculated, and the zero collision zone length N is set to obtain a boundary value.

5. The method for constructing a low-complexity optimal zero-collision zone frequency hopping sequence set according to claim 3, characterized in that: The step of establishing a mapping from the frequency hopping matrix A to the frequency point set according to the type of the frequency hopping matrix A, and replacing the elements of the frequency hopping matrix A with the corresponding frequency points in the mapping relationship, includes: If the frequency hopping matrix A is a first-type frequency hopping matrix, establish a single injection from the frequency hopping matrix A to the frequency point set: Among them, a i,j represents the element in the i-th row and j-th column of the frequency hopping matrix A; i, j belong to the natural number set and 1≤i≤M, 1≤j≤L; the element a in the frequency hopping matrix A is i,j All are replaced by the frequency points p in the mapping ξ iL+j ; If the frequency hopping matrix A is a second type frequency hopping matrix, then a surjection from the frequency hopping matrix A to the frequency point set is established: Where i, j, l belong to the natural number set and 1≤i≤M, 1≤j≤N+1, 0≤l≤k-1; the element a in the frequency hopping matrix A is i,j+l*(N+1) All are replaced by their frequency points p in the mapping ξ i+(j-1)*M ; If the frequency hopping matrix A is a third type frequency hopping matrix, establish a surjection from the frequency hopping matrix A to the frequency point set: where i, j, l belong to the set of natural numbers and 1≤i≤M, 0≤l≤k; Then establish the surjection: where i, m, n belong to the set of natural numbers and 1≤i≤M, 0≤n≤k-1; The frequency hopping matrix A is i,j+l*(N+1) All elements are replaced by their frequency points p in the mapping ξ1 i+(j-1)*M ; The frequency hopping matrix A in a i,m+n*(N+1) All elements are replaced by their frequency points p in the mapping ξ2 i+(m-1)*M .

6. The method for constructing a low-complexity optimal zero-collision zone frequency hopping sequence set according to claim 4, characterized in that: The step of establishing a mapping from the frequency hopping matrix A to the frequency point set according to the type of the frequency hopping matrix A, and replacing the elements of the frequency hopping matrix A with the corresponding frequency points in the mapping relationship, includes: If the frequency hopping matrix A is a fourth type of frequency hopping matrix, a surjection from the frequency hopping matrix A to the frequency point set is established: Where i, j, l belong to the set of natural numbers and 1≤i≤M, 1≤j≤N+1, 0≤l≤k-1; Then establish a surjection from the frequency hopping matrix A to the frequency point set: where i, m, n belong to the set of natural numbers and 1≤i≤M, Fb≤n≤F-1; The frequency hopping matrix A is i,j+l*(N+1) All elements are replaced by their frequency points p in the mapping ξ1 i+(j-1)*M ; The frequency hopping matrix A All elements are replaced by their frequency points p in the mapping ξ2 n+1 ; If the frequency hopping matrix A is a fifth type of frequency hopping matrix, establish a surjection from the frequency hopping matrix A to the frequency point set: where i, j, l belong to the set of natural numbers and Then establish a surjection from the frequency hopping matrix A to the frequency point set: where i, m belong to the set of natural numbers and The frequency hopping matrix A All elements are replaced by their frequency points p in the mapping ξ1 i+(j-1)*M ; The frequency hopping matrix A in a i,m All elements are replaced by their frequency points in the mapping ξ2 7. The method for constructing a low-complexity optimal zero-collision zone frequency hopping sequence set according to claim 5, characterized in that: The reallocating the positions of the elements in the frequency hopping matrix A includes: If the frequency hopping matrix A is a first type of frequency hopping matrix, the elements in the frequency hopping matrix A are randomly shuffled in units of each row or each column.

8. The method for constructing a low-complexity optimal zero-collision zone frequency hopping sequence set according to claim 5, characterized in that: The reallocating the positions of the elements in the frequency hopping matrix A includes: If the frequency hopping matrix A is a second-type frequency hopping matrix or a third-type frequency hopping matrix, the elements in the frequency hopping matrix A are randomly shuffled in units of each column.

9. The method for constructing a low-complexity optimal zero-collision zone frequency hopping sequence set according to claim 6, wherein: The reallocating the positions of the elements in the frequency hopping matrix A includes: If the frequency hopping matrix A is a frequency hopping matrix of the fourth type, a bijection is established: where i, m, n belong to the set of natural numbers and Interchanging the positions of the one-to-one corresponding elements in the mapping σ in the frequency hopping matrix A; The elements of the frequency hopping matrix A are randomly shuffled in units of each column; If the frequency hopping matrix A is a fifth type of frequency hopping matrix, establish a bijection: where i, m belong to the set of natural numbers and Interchanging the positions of the one-to-one corresponding elements in σ in the frequency hopping matrix A; The elements of the frequency hopping matrix A are randomly shuffled in units of each column.

10. A readable storage medium, characterized in that: The readable storage medium stores a computer program, and when the computer program is executed by a processor, the method according to any one of claims 1 to 9 is implemented.

Images