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

Abstract

This invention discloses a low-complexity optimal zero-collision zone frequency hopping sequence set construction method and storage medium. The construction method includes: obtaining the frequency hopping sequence length L and the number of frequency hopping sequences M corresponding to the frequency hopping sequence set to be constructed, as well as the number of frequency point types M in the frequency point set, the frequency point set being used to provide candidate frequencies for the construction of the frequency hopping sequence set; constructing a frequency hopping matrix A with an initial state of all zeros based on the frequency hopping sequence length L and the number of frequency hopping sequences M, and calculating the number of elements T of the frequency hopping matrix A; classifying the frequency hopping matrix A based on the size relationship between the number of elements T and the number of frequency point types F, the quantity relationship between the number of elements T and the number of frequency point types F, and the quantity 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, replacing the elements of the frequency hopping matrix A with the corresponding frequency points in the mapping relationship; and reallocating the positions of the elements in the frequency hopping matrix A.

Description

Technical Field

[0001] This invention belongs to the field of frequency hopping communication technology, and specifically relates to a method for constructing a low-complexity optimal zero-collision interval frequency hopping sequence set and a storage medium. Background Technology

[0002] Wireless communication often faces various forms of interference, especially in complex electromagnetic environments. To effectively circumvent enemy wideband suppression interference, single-tone interference targeting fixed frequencies, and linear frequency hopping interference, frequency hopping communication, with its wideband hopping frequency band, fast hopping speed, and flexible hopping frequency points, has been widely used in various communication systems. The purpose of frequency hopping technology is to make the signal frequency point exhibit random hopping characteristics within a large frequency bandwidth, thereby extending the entire signal bandwidth to a wider area and maximizing the utilization of bandwidth resources to reduce the probability of interference to the communication signal. In multi-user frequency hopping communication scenarios, frequency hopping communication not only needs to avoid enemy interference but also needs to avoid interference caused by collisions between friendly frequencies, making the zero-collision zone an important indicator of frequency hopping sequence families.

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

[0004] To address the shortcomings of existing technologies, this invention provides a low-complexity optimal zero-collision zone frequency hopping sequence set construction method. This method can quickly construct a family of frequency hopping sequences with zero collision zones under optimal aperiodic Hamming correlation and good pseudo-random performance under any constraints of the number of frequency hopping sequences M, the length of the frequency hopping sequence L, and the number of frequency point types F. It is suitable for multi-user frequency hopping communication systems that need to generate frequency hopping sequence families under any of the above three parameters in real time.

[0005] To achieve the above-mentioned objectives, this invention provides a method for constructing a low-complexity optimal zero-collision region frequency hopping sequence set, comprising:

[0006] Obtain the frequency hopping sequence length L and the number of frequency hopping sequences M corresponding to the frequency hopping sequence set to be constructed, as well as the number of frequency point types F in the frequency point set, wherein the frequency point set is used to provide candidate frequencies for the construction of the frequency hopping sequence set;

[0007] Based on the frequency hopping sequence length L and the number of frequency hopping sequences M, construct a frequency hopping matrix A with an initial state of all zeros, and calculate the number of elements T of the frequency hopping matrix A;

[0008] 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, the frequency hopping matrix A is classified.

[0009] Based on the type of the frequency hopping matrix A, establish a mapping from the frequency hopping matrix A to the frequency point set, and replace 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 redistributed.

[0011] Preferably, the step of constructing a frequency hopping matrix A with an initial state of all zeros based on the frequency hopping sequence length L and the number of frequency hopping sequences M, and calculating the number of elements T of the frequency hopping matrix A, includes:

[0012] Using the length L of the frequency hopping sequence as the number of columns and the number M of the frequency hopping sequence as the number of rows, construct a frequency hopping matrix A with an initial state of all zeros.

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

[0014] Preferably, the frequency hopping matrix A is categorized based on the relationship between the number of elements T and the number of frequency point types F, the relationship between the number of elements T and the number of frequency point types F, and the 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, then classify the frequency hopping matrix A into a first-type frequency hopping matrix, and let the set of frequency points be P = {p1, p2, ..., p...}. F};

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

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

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

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

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

[0021] Preferably, the construction method further includes:

[0022] Based on the formula:

[0023]

[0024] Calculate the range of values ​​for the zero-collision zone length corresponding to the frequency hopping sequence set to be constructed, and let the zero-collision zone length N obtain boundary values.

[0025] Preferably, the step of establishing a mapping from the frequency hopping matrix A to the frequency point set based on 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 an injective method from the frequency hopping matrix A to the frequency point set: Among them, a i,j This represents the element in the i-th row and j-th column of the frequency hopping matrix A; i, j belong to the set of natural numbers and 1≤i≤M, 1≤j≤L; the element a in the frequency hopping matrix A... i,j Replace all with the frequency point p in the mapping ξ iL+j ;

[0027] If the frequency hopping matrix A is a second-type frequency hopping matrix, then establish a surjective mapping from the frequency hopping matrix A to the set of frequency points: Where i, j, l belong to the set of natural numbers 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) Replace all with their frequency point p in the mapping ξ i+(j-1)*M ;

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

[0029] Re-establish full range: Where i, m, n belong to the set of natural numbers and

[0030] a in the frequency hopping matrix A i,j+l*(N+1) All elements should be replaced with their corresponding frequency point p in mapping ξ1. i+(j-1)*M ; to add a to the frequency hopping matrix A i,m+n*(N+1) Replace all elements with their corresponding frequency point p in the mapping ξ2. i+(m-1)*M .

[0031] Preferably, the step of establishing a mapping from the frequency hopping matrix A to the frequency point set based on 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 frequency hopping matrix, establish a surjective projection 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, 1≤j≤N+1, 0≤l≤k-1;

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

[0034] a in the frequency hopping matrix A i,j+l*(N+1) All elements should be replaced with their corresponding frequency point p in mapping ξ1. i+(j-1)*M ; to the frequency hopping matrix A Replace all elements with their corresponding frequency point p in the mapping ξ2. n+1 ;

[0035] If the frequency hopping matrix A is a fifth-type frequency hopping matrix, establish a surjective projection 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 the surjective projection 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 should be replaced with their corresponding frequency point p in mapping ξ1. i+(j-1)*M ; to add a to the frequency hopping matrix A i,m Replace all elements with their corresponding frequency points in the mapping ξ2.

[0040] Preferably, the reallocation of the positions of the elements in the frequency hopping matrix A includes:

[0041] If the frequency hopping matrix A is a first-type 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 reallocation of the positions of the elements in the frequency hopping matrix A includes:

[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 column by column.

[0044] Preferably, the reallocation of the positions of the elements in the frequency hopping matrix A includes:

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

[0046]

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

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

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

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

[0051]

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

[0053] Interchange 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 column by column.

[0055] The present invention also provides a readable storage medium storing a computer program, which, when executed by a processor, implements the method described in any of the preceding claims.

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

[0057] This invention provides a low-complexity optimal zero-collision zone frequency hopping sequence set construction method. It 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 desired frequency hopping sequence family, and establishes a mapping relationship between the frequency hopping matrix A and the frequency point set. The method then assigns and replaces values ​​between the original image sets to generate the frequency hopping sequence family. The frequency hopping sequence families designed in this scheme all achieve optimal zero-collision zone performance, i.e., the frequency hopping sequence family with the largest zero-collision zone length, effectively solving the problem of mutual interference in multi-user frequency hopping communication. This scheme is adaptable to any frequency hopping sequence length L, number of frequency hopping sequences M, and 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 since it does not involve complex finite field operations, the random sorting algorithm involved is also easy to call directly in environments such as C language, making the entire algorithm have low implementation complexity and suitable for application scenarios that require real-time generation of frequency hopping sequence families. Attached Figure Description

[0058] Figure 1 This is a flowchart illustrating a method for constructing a low-complexity optimal zero-collision region frequency hopping sequence set according to an embodiment of the present invention. Detailed Implementation

[0059] The following is in conjunction with the appendix Figure 1 The following detailed description of the low-complexity optimal zero-collision region frequency hopping sequence set construction method and storage medium proposed in this invention provides further specific implementation details. The advantages and features of this invention will become clearer from the following description. It should be noted that the accompanying drawings are in a very simplified form and use non-precise proportions, used only to facilitate and clearly illustrate the purpose of the embodiments of this invention. Please refer to the accompanying drawings to make the objectives, features, and advantages of this invention more apparent and understandable. It should be understood that the structures, proportions, sizes, etc., depicted in the accompanying drawings are only used to complement the content disclosed in the specification, for those skilled in the art to understand and read, and are not intended to limit the implementation conditions of this invention. Therefore, they have no substantial technical significance. Any modifications to the structure, changes in proportions, or adjustments to the size, without affecting the effects and objectives achieved by this invention, should still fall within the scope of the technical content disclosed in this invention.

[0060] It should be noted that, in this document, relational terms such as "first" and "second" are used only to distinguish one entity or operation from another, and do not necessarily require or imply any such actual relationship or order between these entities or operations. Furthermore, the terms "comprising," "including," or any other variations thereof are intended to cover non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements includes not only those elements but also other elements not expressly listed, or elements inherent to such a process, method, article, or apparatus. Without further limitations, an element defined by the phrase "comprising one..." does not exclude the presence of other identical elements in the process, method, article, or apparatus that includes said element.

[0061] Please see Figure 1 , Figure 1 The flowchart of a low-complexity optimal zero-collision region frequency hopping sequence set construction method according to an embodiment of the present invention includes the following steps:

[0062] Step S1: Obtain the frequency hopping sequence length L and the number of frequency hopping sequences M corresponding to the frequency hopping sequence set to be constructed, as well as the number of frequency point types F in the frequency point set. The frequency point set is used to provide candidate frequencies for the construction of the frequency hopping sequence set.

[0063] Step S2: Construct a frequency hopping matrix A with an initial state of all zeros based on the frequency hopping sequence length L and the number of frequency hopping sequences M, and calculate the number of elements T of the frequency hopping matrix A;

[0064] Step S3: 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, classify the frequency hopping matrix A;

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

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

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

[0068] Using the length L of the frequency hopping sequence as the number of columns and the number M of the frequency hopping sequence as the number of rows, construct a frequency hopping matrix A with an initial state of all zeros.

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

[0070] For example, if the frequency hopping sequence set to be constructed has a frequency hopping sequence length L = 13, a frequency hopping sequence number M = 5, and a frequency point type number F = 17 in the frequency point set, then a 5-row, 13-column all-zero matrix is ​​constructed as the initial state of the frequency 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, then classify the frequency hopping matrix A into a first-type frequency hopping matrix, and let the set of frequency points be P = {p1, p2, ..., p...}. F };

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

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

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

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

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

[0078] The above embodiments provide a specific classification method for frequency hopping matrix A, so as to facilitate the subsequent establishment of a mapping relationship between the type of frequency hopping matrix A and the frequency point set.

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

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

[0081] In this example, η≠0 and r≠0, therefore the frequency hopping matrix A is classified as a 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 Γ={P1,P2,...,P 15 }, and Ξ={P 16 ,P 17 }

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

[0083] Based on the formula:

[0084]

[0085] Calculate the range of values ​​for the zero-collision zone length corresponding to the frequency hopping sequence set to be constructed, and let the zero-collision zone length N obtain boundary values.

[0086] For example, in this embodiment, the number of frequency point types F = 17, the number of frequency hopping sequences = 5, and after calculation, the optimal zero-collision zone length N ≤ 2, with a boundary value of 2. Therefore, let 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 an injective method from the frequency hopping matrix A to the frequency point set: Among them, a i,j This represents the element in the i-th row and j-th column of the frequency hopping matrix A; i, j belong to the set of natural numbers and 1≤i≤M, 1≤j≤L; the element a in the frequency hopping matrix A... i,j Replace all with the frequency point p in the mapping ξ iL+j ;

[0089] If the frequency hopping matrix A is a second-type frequency hopping matrix, then establish a surjective mapping from the frequency hopping matrix A to the set of frequency points: Where i, j, l belong to the set of natural numbers 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) Replace all with their frequency point p in the mapping ξ i+(j-1)*M ;

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

[0091] Re-establish full range: Where i, m, n belong to the set of natural numbers and

[0092] a in the frequency hopping matrix A i,j+l*(N+1) All elements should be replaced with their corresponding frequency point p in mapping ξ1. i+(j-1)*M ; to add a to the frequency hopping matrix A i,m+n*(N+1) Replace all elements with their corresponding frequency point 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 frequency hopping matrix, establish a surjective projection 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, 1≤j≤N+1, 0≤l≤k-1;

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

[0096] a in the frequency hopping matrix A i,j+l*(N+1) All elements should be replaced with their corresponding frequency point p in mapping ξ1. i+(j-1)*M ; to the frequency hopping matrix A Replace all elements with their corresponding frequency point p in the mapping ξ2. n+1 ;

[0097] If the frequency hopping matrix A is a fifth-type frequency hopping matrix, establish a surjective projection 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 the surjective projection 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 should be replaced with their corresponding frequency point p in mapping ξ1. i+(j-1)*M ; to add a to the frequency hopping matrix A i,m Replace all elements with their corresponding frequency points in the mapping ξ2.

[0102] In this embodiment, the frequency hopping matrix is ​​a fifth-type frequency hopping matrix, thus establishing a surjective signal:

[0103]

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

[0105] Re-establish full range:

[0106]

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

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

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

[0110] If the frequency hopping matrix A is a first-type 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 column by column.

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

[0113]

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

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

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

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

[0118]

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

[0120] Interchange 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 column by column.

[0122] In this embodiment, the frequency hopping matrix is ​​a fifth-type frequency hopping matrix, thus establishing a surjective signal:

[0123]

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

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

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

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

[0128] Table 1

[0129]

[0130]

[0131] This invention provides a method for constructing a low-complexity optimal zero-correlation zone frequency hopping sequence set. It analyzes and classifies the relationships between the frequency hopping sequence length, the number of frequency hopping sequences, and the number of frequency point types in the desired frequency hopping sequence set, and establishes a mapping relationship between the frequency point set and the frequency hopping matrix. The frequency hopping sequence set is generated by assigning and replacing elements between the original image set and the image set. The frequency hopping sequence set designed by this method achieves 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. This method is applicable to frequency hopping sequences of arbitrary length L, number of frequency hopping sequences M, and number of frequency point types F, with no coupling relationship between the three in the generated sequence set. The assignment and replacement operations involved in this method are easy to implement in programming and do not involve high-complexity finite field operations. The random sorting algorithm used is also easy to call in environments such as C language. Therefore, the entire algorithm has low implementation complexity and is suitable for practical application scenarios that require real-time generation of frequency hopping sequence sets.

[0132] This embodiment also provides a readable storage medium storing a computer program. When the computer program is executed by a processor, it implements the low-complexity optimal zero-collision zone frequency hopping sequence set construction method described in any of the above embodiments of this embodiment.

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

Claims

1. A method for constructing a low-complexity optimal zero-collision region frequency hopping sequence set, characterized in that, include: Obtain the frequency hopping sequence length L and the number of frequency hopping sequences M corresponding to the frequency hopping sequence set to be constructed, as well as the number of frequency point types F in the frequency point set, wherein the frequency point set is used to provide candidate frequencies for the construction of the frequency hopping sequence set; Based on the frequency hopping sequence length L and the number of frequency hopping sequences M, construct a frequency hopping matrix A with an initial state of all zeros, and calculate the number of elements T of the frequency hopping matrix A; 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, the frequency hopping matrix A is classified. Based on the type of the frequency hopping matrix A, establish a mapping from the frequency hopping matrix A to the frequency point set, and replace 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 redistributed.

2. The method for constructing a low-complexity optimal zero-collision region frequency hopping sequence set as described in claim 1, characterized in that, The process of constructing a frequency hopping matrix A with an initial state of all zeros based on the frequency hopping sequence length L and the number of frequency hopping sequences M, and calculating the number of elements T of the frequency hopping matrix A, includes: Using the length L of the frequency hopping sequence as the number of columns and the number M of the frequency hopping sequence as the number of rows, construct a frequency hopping matrix A with an initial state of all zeros. The number of elements T of the frequency hopping matrix A is calculated using T = LM.

3. The method for constructing a low-complexity optimal zero-collision region frequency hopping sequence set as described in claim 1, characterized in that, Based on the relationship between the number of elements T and the number of frequency point types F, the relationship between the number of elements T and the number of frequency point types F, and the 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, then classify the frequency hopping matrix A into a first-type frequency hopping matrix, and let the set of frequency points be P = {p1, p2, ..., p...}. F }; If T > F, let T = kF + r, where k and r belong to the set of natural numbers and r < F; let η = <f> M , where the operation <α> β This represents the modulo operation of α with respect to β, where α and β are both integers;< / f> If η = 0 and r = 0, then the frequency hopping matrix A is classified as a second-type frequency hopping matrix, and the set of frequency points is P = {p1, p2, ..., p...} F }; If η = 0 and r ≠ 0, then the frequency hopping matrix A is classified as a third-class frequency hopping matrix, and the set of frequency points is P = {p1, p2, ..., p...} F }, and its two complementary subsets Γ={P1,P2,...,P r }, and Ξ={P r+1 ,P r+2 ,...,P F }; If η≠0 and r=0, then the frequency hopping matrix A is classified as a fourth type of frequency hopping matrix, and let b= <f> M Let the set of frequency points be P = {p1, p2, ..., p...} F }, and its two complementary subsets Γ={P1,P2,...,P F-b }, and Ξ={P F-b+1 ,P F-b+2 ,...,P F };< / f> If η≠0 and r≠0, then the frequency hopping matrix A is classified as a fifth type of frequency hopping matrix, and c = M - <r> M Let the set of frequency points be P = {p1, p2, ..., p...} F }, and its two complementary subsets Γ={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 region frequency hopping sequence set as described in claim 3, characterized in that, The construction method further includes: Based on the formula: Calculate the range of values ​​for the zero-collision zone length corresponding to the frequency hopping sequence set to be constructed, and let the zero-collision zone length N obtain boundary values.

5. The method for constructing a low-complexity optimal zero-collision region frequency hopping sequence set as described in claim 3, characterized in that, The step of establishing a mapping from the frequency hopping matrix A to the frequency point set based on 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 an injective method from the frequency hopping matrix A to the frequency point set: Among them, a i,j This represents the element in the i-th row and j-th column of the frequency hopping matrix A; i, j belong to the set of natural numbers and 1≤i≤M, 1≤j≤L; the element a in the frequency hopping matrix A... i,j Replace all with the frequency point p in the mapping ξ iL+j ; If the frequency hopping matrix A is a second-type frequency hopping matrix, then establish a surjective mapping from the frequency hopping matrix A to the set of frequency points: Where i, j, l belong to the set of natural numbers 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) Replace all with their frequency point p in the mapping ξ i+(j-1)*M ; If the frequency hopping matrix A is a third-type frequency hopping matrix, establish a surjective projection 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; Re-establish full range: Where i, m, n belong to the set of natural numbers and 1 ≤ i ≤ M. 0≤n≤k-1; a in the frequency hopping matrix A i,j+l*(N+1) All elements should be replaced with their corresponding frequency point p in mapping ξ1. i+(j-1)*M ; to add a to the frequency hopping matrix A i,m+n*(N+1) Replace all elements with their corresponding frequency point p in the mapping ξ2. i+(m-1)*M .

6. The method for constructing a low-complexity optimal zero-collision region frequency hopping sequence set as described in claim 4, characterized in that, The step of establishing a mapping from the frequency hopping matrix A to the frequency point set based on 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 frequency hopping matrix, establish a surjective projection 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, 1≤j≤N+1, 0≤l≤k-1; Then establish the surjective projection 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; a in the frequency hopping matrix A i,j+l*(N+1) All elements should be replaced with their corresponding frequency point p in mapping ξ1. i+(j-1)*M ; to the frequency hopping matrix A Replace all elements with their corresponding frequency point p in the mapping ξ2. n+1 ; If the frequency hopping matrix A is a fifth-type frequency hopping matrix, establish a surjective projection 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 the surjective projection 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 should be replaced with their corresponding frequency point p in mapping ξ1. i+(j-1)*M ; to add a to the frequency hopping matrix A i,m Replace all elements with their corresponding frequency points in the mapping ξ2.

7. The method for constructing a low-complexity optimal zero-collision region frequency hopping sequence set as described in claim 5, characterized in that, The reallocation of the positions of the elements in the frequency hopping matrix A includes: If the frequency hopping matrix A is a first-type 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 region frequency hopping sequence set as described in claim 5, characterized in that, The reallocation of 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 column by column.

9. The method for constructing a low-complexity optimal zero-collision region frequency hopping sequence set as described in claim 6, characterized in that, The reallocation of the positions of the elements in the frequency hopping matrix A includes: If the frequency hopping matrix A is a fourth type frequency hopping matrix, establish a bijection: Where i, m, n belong to the set of natural numbers and The positions of the one-to-one corresponding elements in the mapping σ are interchanged in the frequency hopping matrix A; The elements of the frequency hopping matrix A are randomly shuffled column by column; If the frequency hopping matrix A is a fifth-type frequency hopping matrix, establish a bijection: Where i, m belong to the set of natural numbers and Interchange 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 column by column.

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

Images