CN111541467A - Method for generating quasi-synchronization frequency hopping sequence set - Google Patents

Method for generating quasi-synchronization frequency hopping sequence set Download PDF

Info

Publication number
CN111541467A
CN111541467A CN202010388328.0A CN202010388328A CN111541467A CN 111541467 A CN111541467 A CN 111541467A CN 202010388328 A CN202010388328 A CN 202010388328A CN 111541467 A CN111541467 A CN 111541467A
Authority
CN
China
Prior art keywords
frequency hopping
sequence set
quasi
hopping sequence
sequence
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
Application number
CN202010388328.0A
Other languages
Chinese (zh)
Other versions
CN111541467B (en
Inventor
刘星
舒勤
曾琦
周李梦男
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Sichuan University
Original Assignee
Sichuan University
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Sichuan University filed Critical Sichuan University
Priority to CN202010388328.0A priority Critical patent/CN111541467B/en
Publication of CN111541467A publication Critical patent/CN111541467A/en
Application granted granted Critical
Publication of CN111541467B publication Critical patent/CN111541467B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

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
    • H04B1/7136—Arrangements for generation of hop frequencies, e.g. using a bank of frequency sources, using continuous tuning or using a transform

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 generating a quasi-synchronous frequency hopping sequence set, which solves the problem that the maximum period Hamming correlation of the frequency hopping sequence set of a low collision zone outside a time delay zone is large in the prior art. The quasi-synchronous frequency hopping sequence set obtained by the invention has no displacement equivalence condition between the sequences, and simultaneously the maximum period Hamming correlation in the time delay region Z is 0, namely no collision exists, even if the relative time delay exceeds the limited time delay region due to the error of system sensitivity or the difference of channel conditions, the Hamming correlation value can be controlled to be in the limited time delay region
Figure DDA0002484928970000011
Even when the relative delay exceeds the delay region far, the relative delay can be controlled to be below a low hamming correlation value.

Description

Method for generating quasi-synchronization frequency hopping sequence set
Technical Field
The invention relates to the field of frequency hopping communication, in particular to a method for generating a quasi-synchronous frequency hopping sequence set.
Background
The quasi-synchronization frequency hopping sequence set has the following advantages compared with the traditional low collision zone frequency hopping sequence set: the Hamming correlation value of the quasi-synchronous frequency hopping sequence set rises in a step shape along with the increase of the relative time delay, even if the relative time delay exceeds a limited time delay area due to the error of the system sensitivity or the difference of the channel conditions, the Hamming correlation value can be controlled in a small range, and the size of the Hamming correlation value corresponds to the size of the interference degree, so that the interference can be effectively reduced. However, the conventional low collision region hopping sequence set needs to strictly control the relative time delay within a certain range (i.e. within the low collision region of the hopping sequence set), and once the relative time delay exceeds the range, i.e. within the low collision region, the hamming correlation of the hopping sequence set may reach a very large value, and some sequences may even completely collide (this is because there are many sequences of the low collision region hopping sequence set are equivalent to shift), so that the interference caused by this is very large. The quasi-synchronization frequency hopping sequence set aims to solve the problem of interference outside a time delay region caused by relative time delay errors caused by errors of system sensitivity or differences of channel conditions.
For the quasi-synchronous frequency hopping sequence set, it is desirable that the maximum periodic hamming correlation of the quasi-synchronous frequency hopping sequence set in the delay region is 0, and the maximum periodic hamming correlation outside the delay region is as small as possible.
Disclosure of Invention
The technical problem to be solved by the invention is as follows: for the traditional low collision area frequency hopping sequence set, the Hamming correlation of the maximum period outside a time delay area is larger, and the invention provides a method for generating a quasi-synchronous frequency hopping sequence set, which solves the problems.
The invention is realized by the following technical scheme:
a method for generating a quasi-synchronization frequency hopping sequence set comprises the following steps:
step A) determining a frequency hopping sequence set S required by a quasi-synchronous frequency hopping system according to the requirement of the quasi-synchronous frequency hopping system, wherein the sequence number of the frequency hopping sequence set S is q, and q is the prime number power;
step B), selecting Z +1 finite fields, and selecting m sequences based on each finite field, wherein Z +1 m sequences are counted, and Z +1 finite fields are as follows: GF0(q),GF1(q),...,GFZ(q), the Z +1 finite fields are isomorphic and do not contain the same elements between each two, wherein Z is a positive integer, and the Z +1 m sequences are as follows:
Figure BDA0002484928950000021
N0、N1、…、NZrespectively correspond to a0、a1、…、aZThe length of (a) of (b),
Figure BDA0002484928950000022
wherein n is0,n1,...,nZIs a positive integer, n0≤n1≤...≤nZ，N0≤N1≤...≤NZ；
Step C) constructing a single sequence based on element arrangement of Z +1 m sequences, wherein the length of the single sequence is (Z +1) N, N is the least common multiple of the lengths of the Z +1 m sequences, and N is lcm (N)0,N1,...,NZ) Represents N0,N1,...,NZThe single sequence is as follows:
Figure BDA0002484928950000023
wherein, aj iSubscript j of (a) is in modulo NiIn the following operation, the value range of i is 0,1, …, Z;
step D) removing zero elements based on the finite field in the step B), selecting a generating element, adding each sequence element of the single sequence in the step C) to the power of the generating element to construct a new sequence, and generating a frequency hopping sequence set S according to the sequences obtained in the steps C) and D), specifically: separately selecting GF0(q)*,GF1(q)*,...,GFZ(q)*α0,αi,...,αZRepresenting a set of other elements of the finite field except the zero elements, constructing a new sequence s according to said step D)kWherein the sequence skComprises the following steps:
Figure BDA0002484928950000024
wherein k is more than or equal to 1 and less than or equal to q-1According to the sequence s0And skGenerating a hopping sequence set S ═ S0,s1,...,sq-1}。
The finite field comprises elements of prime number power, namely q elements, wherein the elements are integers or symbols, and all the elements meet certain rules and relations, namely, the closure, the commutative law, the combination law and the like which are met by the finite field.
Further, a computer-readable storage medium, in which a computer program is stored, which computer program, when being executed by a processor, carries out the steps of the method. The specific use of the method relies on a large number of calculations and it is therefore preferred that the above calculation is performed by a computer program, so any computer program and its storage medium containing the steps protected in the method also fall within the scope of the present application.
Further, an application method of a quasi-synchronous frequency hopping sequence set is provided, wherein the quasi-synchronous frequency hopping system comprises a frequency hopping sequence set S, the quasi-synchronous frequency hopping system is used for receiving and transmitting user communication data moved at two ends of frequency hopping communication, and the frequency hopping sequence set S is used for carrying out frequency movement on a plurality of user communication data on a communication frequency channel to realize frequency hopping communication.
Theorem: the hopping sequence set S is a quasi-synchronous hopping sequence set with a maximum periodic hamming correlation whose sequence length, number of sequences and frequency slot set size are (Z +1) N, q, (Z +1) q, respectively.
Figure BDA0002484928950000031
And (3) proving that: obviously, the sequence length, the sequence number and the frequency slot set size of S are (Z +1) N, q, (Z +1) q, respectively. For the
Figure BDA0002484928950000032
Figure BDA0002484928950000033
Their periodic hamming correlation functions with time delays of size tau
Figure BDA0002484928950000034
Is composed of
Figure BDA0002484928950000035
Here, the first and second liquid crystal display panels are,
Figure BDA0002484928950000036
meaning that the operation of rounding down x,<x>yrepresenting an x modulo y operation. When τ is not less than 1 and not more than Z, since<i>Z+1≠<i+τ>Z+1I.e. by
Figure BDA0002484928950000037
And
Figure BDA0002484928950000038
is valued over different finite fields, so
Figure BDA0002484928950000039
When τ is 0 and k1≠k2Due to
Figure BDA00024849289500000310
Therefore, it is not only easy to use
Figure BDA00024849289500000311
Then
Figure BDA00024849289500000312
So in the delay region Z, Hm0. The latency zone (Z +1) N is discussed below0In the case of-1, i.e.τ. ltoreq. (Z +1) N0-1。
1)<τ>Z+1Not equal to 0. Due to the fact that<i>Z+1≠<i+τ>Z+1I.e. by
Figure BDA00024849289500000313
And
Figure BDA00024849289500000314
is different in thatValue in a limited domain, so
Figure BDA00024849289500000315
2)<τ>Z+10. When τ is 0 and k1≠k2This has been demonstrated previously. Now consider the case where τ ≠ 0, at which time the periodic Hamming correlation function becomes
Figure BDA0002484928950000041
Because of 0<τ≤(Z+1)N0-1≤(Z+1)Nj-1, therefore
Figure BDA0002484928950000042
Equation for i
Figure BDA0002484928950000043
Figure BDA0002484928950000044
At most have
Figure BDA0002484928950000045
And (4) solving. This is because for a length of
Figure BDA0002484928950000046
Is subtracted from its own shifted sequence, and each finite field element appears at most in one period of the m-sequence
Figure BDA0002484928950000047
Thus, this result can be obtained. So that there are
Figure BDA0002484928950000048
Then
Figure BDA0002484928950000049
After the syndrome is confirmed.
Further, in practical application, the quasi-synchronous frequency hopping sequence set S is applied to frequency hopping communication, the quasi-synchronous frequency hopping sequence set S performs sequence frequency hopping or encryption on information transmitted by a plurality of users in a limited number of frequency slots within a carrier frequency band range, the number of the frequency slots within the carrier frequency band range is q, and the quasi-synchronous frequency hopping sequence set S simultaneously performs time domain or frequency domain shifting on both transmitting and receiving ends of each user on a shared carrier frequency band.
The quasi-synchronous frequency hopping sequence set obtained by the invention mainly solves the problem that the maximum period Hamming correlation of the traditional low collision region frequency hopping sequence set outside a time delay region is larger, namely the quasi-synchronous frequency hopping sequence set obtained by the invention has a very small Hamming correlation value outside the time delay region compared with the traditional low collision region frequency hopping sequence set, and the key point is that the time delay region is outside.
The invention has the following advantages and beneficial effects:
the quasi-synchronous frequency hopping sequence set obtained by the invention has no displacement equivalence condition between the sequences, and simultaneously the maximum period Hamming correlation in the time delay region Z is 0, namely no collision exists, even if the relative time delay exceeds the limited time delay region due to the error of system sensitivity or the difference of channel conditions, the Hamming correlation value can be controlled to be in the limited time delay region
Figure BDA00024849289500000410
Even when the relative delay exceeds the delay region far, the relative delay can be controlled to be below a low hamming correlation value.
Drawings
The accompanying drawings, which are included to provide a further understanding of the embodiments of the invention and are incorporated in and constitute a part of this application, illustrate embodiment(s) of the invention and together with the description serve to explain the principles of the invention. In the drawings:
FIG. 1 is a flow chart of the steps of the present invention.
Detailed Description
Before any embodiments of the invention are explained in detail, it is to be understood that the invention is not limited in its application to the details of construction and the arrangements of components set forth in the following description or illustrated in the drawings. The invention is capable of other embodiments and of being practiced or of being carried out in various ways. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any inventive changes, are within the scope of the present invention.
A method for generating a quasi-synchronization frequency hopping sequence set, as shown in fig. 1, includes the following steps:
step A) determining a frequency hopping sequence set S required by a quasi-synchronous frequency hopping system according to the requirement of the quasi-synchronous frequency hopping system, wherein the sequence number of the frequency hopping sequence set S is q, and q is the prime number power;
step B), selecting Z +1 finite fields, and selecting m sequences based on each finite field, wherein Z +1 m sequences are counted, and Z +1 finite fields are as follows: GF0(q),GF1(q),...,GFZ(q), the Z +1 finite fields are isomorphic and do not contain the same elements between each two, wherein Z is a positive integer, and the Z +1 m sequences are as follows:
Figure BDA0002484928950000051
N0、N1、…、NZrespectively correspond to a0、a1、…、aZThe length of (a) of (b),
Figure BDA0002484928950000052
wherein n is0,n1,...,nZIs a positive integer, n0≤n1≤...≤nZ，N0≤N1≤...≤NZ；
Step C) constructing a single sequence based on element arrangement of Z +1 m sequences, wherein the length of the single sequence is (Z +1) N, N is the least common multiple of the lengths of the Z +1 m sequences, and N is lcm (N)0,N1,...,NZ) Represents N0,N1,...,NZIs the most important ofSmall common multiple, the single sequence is as follows:
Figure BDA0002484928950000053
wherein, aj iSubscript j of (a) is in modulo NiIn the following operation, the value range of i is 0,1, …, Z;
step D) removing zero elements based on the finite field in the step B), selecting a generating element, adding each sequence element of the single sequence in the step C) to the power of the generating element to construct a new sequence, and generating a frequency hopping sequence set S according to the sequences obtained in the steps C) and D), specifically: separately selecting GF0(q)*,GF1(q)*,...,GFZ(q)*α0,α1,...,αZRepresenting a set of other elements of the finite field except the zero elements, constructing a new sequence s according to said step D)kWherein the sequence skComprises the following steps:
Figure BDA0002484928950000061
where k is not less than 1 and not more than q-1, according to the sequence s0And skGenerating a hopping sequence set S ═ S0,s1,...,sq-1}。
The finite field comprises elements of prime number power, namely q elements, wherein the elements are integers or symbols, and all the elements meet certain rules and relations, namely, the closure, the commutative law, the combination law and the like which are met by the finite field.
In an embodiment, a computer-readable storage medium stores a computer program which, when executed by a processor, implements the steps in the above method. The specific use of the above method relies on a large number of calculations and it is therefore preferred that the above calculation is performed by a computer program, so any computer program and its storage medium containing the steps protected in the method also fall within the scope of the present application.
Based on another embodiment of the previous embodiment, an application method of a quasi-synchronous frequency hopping sequence set is provided, in which a quasi-synchronous frequency hopping system includes a frequency hopping sequence set S, the quasi-synchronous frequency hopping system is used for frequency hopping communication to receive and transmit user communication data, and the frequency hopping sequence set S is used for frequency shifting a plurality of user communication data on a communication frequency channel to realize frequency hopping communication.
Based on the other embodiment of the previous embodiment, in practical application, the quasi-synchronous frequency hopping sequence set S is applied to frequency hopping communication, the quasi-synchronous frequency hopping sequence set S performs sequence frequency hopping or encryption on information transmitted by a plurality of users in a limited number of frequency slots within a carrier frequency band, the number of frequency slots within the carrier frequency band is q, and the quasi-synchronous frequency hopping sequence set S performs time domain or frequency domain shifting simultaneously on both transmitting and receiving ends of each user on a shared carrier frequency band.
In summary, the quasi-synchronous frequency hopping sequence set obtained by the invention mainly solves the problem that the maximum period hamming correlation of the conventional low collision zone frequency hopping sequence set outside the time delay zone is large, that is, compared with the conventional low collision zone frequency hopping sequence set, the quasi-synchronous frequency hopping sequence set obtained by the invention has a very small hamming correlation value outside the time delay zone, and the emphasis is outside the time delay zone.
Theorem: the hopping sequence set S is a quasi-synchronous hopping sequence set with a maximum periodic hamming correlation whose sequence length, number of sequences and frequency slot set size are (Z +1) N, q, (Z +1) q, respectively.
Figure BDA0002484928950000071
And (3) proving that: obviously, the sequence length, the sequence number and the frequency slot set size of S are (Z +1) N, q, (Z +1) q, respectively. For the
Figure BDA0002484928950000072
Figure BDA0002484928950000073
Their periodic hamming correlation functions with time delays of size tau
Figure BDA0002484928950000074
Is composed of
Figure BDA0002484928950000075
Here, the first and second liquid crystal display panels are,
Figure BDA0002484928950000076
meaning that the operation of rounding down x,<x>yrepresenting an x modulo y operation. When τ is not less than 1 and not more than Z, since<i>Z+1≠<i+τ>Z+1I.e. by
Figure BDA0002484928950000077
And
Figure BDA0002484928950000078
is valued over different finite fields, so
Figure BDA0002484928950000079
When τ is 0 and k1≠k2Due to
Figure BDA00024849289500000710
Therefore, it is not only easy to use
Figure BDA00024849289500000711
Then
Figure BDA00024849289500000712
So in the delay region Z, Hm0. The latency zone (Z +1) N is discussed below0In the case of-1, i.e.τ. ltoreq. (Z +1) N0-1。
1)<τ>Z+1Not equal to 0. Due to the fact that<i>Z+1≠<i+τ>Z+1I.e. by
Figure BDA00024849289500000713
And
Figure BDA00024849289500000714
is valued over different finite fields, so
Figure BDA00024849289500000715
2)<τ>Z+10. When τ is 0 and k1≠k2This has been demonstrated previously. Now consider the case where τ ≠ 0, at which time the periodic Hamming correlation function becomes
Figure BDA00024849289500000716
Because of 0<τ≤(Z+1)N0-1≤(Z+1)Nj-1, therefore
Figure BDA00024849289500000717
Equation for i
Figure BDA00024849289500000718
0≤i≤Nj-1, at most
Figure BDA00024849289500000719
And (4) solving. This is because for a length of
Figure BDA00024849289500000720
Is subtracted from its own shifted sequence, and each finite field element appears at most in one period of the m-sequence
Figure BDA0002484928950000081
Thus, this result can be obtained. So that there are
Figure BDA0002484928950000082
Then
Figure BDA0002484928950000083
After the syndrome is confirmed.
Example 1: selecting q ═ 17, Z ═ 1, and then selecting the F (x) ═ x on GF (17)2Length of + x +3 generation is N0288 of m-sequence a0And from f (x) x2+6x +6 generation of length N1288 of m-sequence a1. Note that since the construction method is to select m sequences over different finite fields, the elements in the second sequence can be mapped to obtain a new sequence, for example, a1Mapping (15,6,10,6,6,13,5,11,6,0, 15.) into a sequence (32,23,27,23,23,30,22,28,23,17, 32.). Thus, a quasi-synchronous frequency hopping sequence set S ═ S can be obtained through a construction method0,s1,...,s16The sequence length, the sequence number and the frequency slot set size are 576, 17 and 34 respectively, and the maximum period Hamming correlation is
Figure BDA0002484928950000084
It can be seen that the maximum period hamming correlation can be controlled to a very low value even if the relative delay exceeds the delay zone Z of 1 due to errors in the sensitivity of the system or differences in channel conditions.
On the basis of the previous embodiment, the quasi-synchronous frequency hopping communication control system further comprises an antenna, a frequency synthesizer, a frequency hopping sequence generator and a baseband processing unit, wherein the baseband processing unit is used for performing baseband processing on user data to generate a baseband signal; the frequency synthesizer is connected with the frequency hopping sequence generator and is used for generating a corresponding frequency hopping carrier sequence according to the frequency point corresponding to the frequency hopping sequence set S with the sequence number of q; and the carrier modulation/demodulation unit is connected between the baseband processing unit and the antenna, and is also connected with the frequency synthesizer and used for modulating the baseband signal on a frequency hopping carrier sequence and sending the baseband signal out through the antenna.
The above-mentioned embodiments are intended to illustrate the objects, technical solutions and advantages of the present invention in further detail, and it should be understood that the above-mentioned embodiments are merely exemplary embodiments of the present invention, and are not intended to limit the scope of the present invention, and any modifications, equivalent substitutions, improvements and the like made within the spirit and principle of the present invention should be included in the scope of the present invention.

Claims (4)

1. A method for generating a quasi-synchronization frequency hopping sequence set is characterized by comprising the following steps:
step A) determining a frequency hopping sequence set S required by a quasi-synchronous frequency hopping system according to the requirement of the quasi-synchronous frequency hopping system, wherein the sequence number of the frequency hopping sequence set S is q, and q is the prime number power;
step B), selecting Z +1 finite fields, and selecting m sequences based on each finite field, wherein Z +1 m sequences are counted;
step C) constructing a single sequence based on element arrangement of Z +1 m sequences, wherein the length of the single sequence is (Z +1) N, and N is the least common multiple of the lengths of the Z +1 m sequences;
and D) removing zero elements based on the finite field in the step B), selecting a generating element, adding each sequence element of the single sequence in the step C) to the power of the generating element to construct a new sequence, and generating a frequency hopping sequence set S according to the sequences obtained in the steps C) and D).
2. The method for generating a quasi-synchronous frequency hopping sequence set according to claim 1, wherein Z +1 finite fields in step B) are: GF0(q),GF1(q),...,GFZ(q), the Z +1 finite fields are isomorphic and do not contain the same elements between each two, wherein Z is a positive integer.
3. The method for generating a quasi-synchronous frequency hopping sequence set according to claim 2, wherein the Z +1 m sequences in step B) are as follows:
Figure FDA0002484928940000011
Figure FDA0002484928940000012
Figure FDA0002484928940000013
Figure FDA0002484928940000014
N0、N1、…、NZrespectively correspond to a0、a1、…、aZThe length of (a) of (b),
Figure FDA0002484928940000015
wherein n is0,n1,...,nZIs a positive integer, n0≤n1≤...≤nZ，N0≤N1≤...≤NZ。
4. The method for generating plesiochronous frequency hopping sequence set according to claim 3, wherein N ═ lcm (N ═ lcm)0,N1,...,NZ) Represents N0,N1,...,NZThe single sequence is as follows:
Figure FDA0002484928940000016
wherein, aj iSubscript j of (a) is in modulo NiIn the following operation, the value range of i is 0,1, …, Z;
separately selecting GF0(q)*,GF1(q)*,...,GFZ(q)*α1，α1，...，αZRepresenting a set of other elements of the finite field except the zero elements, constructing a new sequence s according to said step D)kWherein the sequence skComprises the following steps:
Figure FDA0002484928940000021
where k is not less than 1 and not more than q-1, according to the sequence s0And skGenerating a hopping sequence set S ═ S0,s1,...,sq-1}。
CN202010388328.0A 2020-05-07 2020-05-07 Method for generating quasi-synchronization frequency hopping sequence set Active CN111541467B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202010388328.0A CN111541467B (en) 2020-05-07 2020-05-07 Method for generating quasi-synchronization frequency hopping sequence set

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202010388328.0A CN111541467B (en) 2020-05-07 2020-05-07 Method for generating quasi-synchronization frequency hopping sequence set

Publications (2)

Publication Number Publication Date
CN111541467A true CN111541467A (en) 2020-08-14
CN111541467B CN111541467B (en) 2020-12-22

Family

ID=71971747

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202010388328.0A Active CN111541467B (en) 2020-05-07 2020-05-07 Method for generating quasi-synchronization frequency hopping sequence set

Country Status (1)

Country Link
CN (1) CN111541467B (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN116582152A (en) * 2023-06-30 2023-08-11 西华大学 Construction method of long-period wide-interval frequency hopping sequence set

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110855319A (en) * 2020-01-16 2020-02-28 四川大学 Method for generating low collision zone frequency hopping sequence set
CN110875757A (en) * 2020-01-19 2020-03-10 四川大学 Construction method of low collision region frequency hopping sequence set with wide interval characteristic

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110855319A (en) * 2020-01-16 2020-02-28 四川大学 Method for generating low collision zone frequency hopping sequence set
CN110875757A (en) * 2020-01-19 2020-03-10 四川大学 Construction method of low collision region frequency hopping sequence set with wide interval characteristic

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
刘星等: "《Low-Hit-Zone Frequency/Time Hopping Sequence Sets With Large Family Size》", 《IEEE》 *

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN116582152A (en) * 2023-06-30 2023-08-11 西华大学 Construction method of long-period wide-interval frequency hopping sequence set
CN116582152B (en) * 2023-06-30 2023-12-29 西华大学 Construction method of long-period wide-interval frequency hopping sequence set

Also Published As

Publication number Publication date
CN111541467B (en) 2020-12-22

Similar Documents

Publication Publication Date Title
Carlet Boolean functions for cryptography and coding theory
Ding et al. A coding theory construction of new systematic authentication codes
Kak Encryption and error-correction coding using D sequences
Nawaz et al. WG: A family of stream ciphers with designed randomness properties
AU2012344739B2 (en) Algebraic generators of sequences for communication signals
PT2101419E (en) Sequence distributing, processing method and apparatus in communication system
CN111541467B (en) Method for generating quasi-synchronization frequency hopping sequence set
CN110855319A (en) Method for generating low collision zone frequency hopping sequence set
CN114039625B (en) Graph division multiple access communication system based on optimal frequency hopping graph
Wang Optimal sets of frequency hopping sequences with large linear spans
Chen et al. Decoding of binary quadratic residue codes with hash table
Cusick et al. A recursive formula for weights of Boolean rotation symmetric functions
US7356068B2 (en) Frequency hopping sequence generator
Lee et al. Families of Gaussian integer sequences with high energy efficiency
Gang et al. Almost perfect sequences based on cyclic difference sets
Song Feedback shift register sequences
RU2690765C1 (en) Periodic pseudorandom binary sequence generator of complex structure
Ustimenko et al. Dynamical systems as the main instrument for the constructions of new quadratic families and their usage in cryptography
Golomb et al. Irreducible Polynomials Which Divide Trinomials Over GF $\,(2) $
CN114221675B (en) Interleaving expansion method of controllable long-period frequency hopping sequence family in frequency hopping communication
CN114296688A (en) Domain expansion-based pin-shaped fuzzy function signal construction method
Radhakrishnan Modulo multipliers using polynomial rings
Li et al. Linear complexity of generalised cyclotomic quaternary sequences of length 2pm+ 1 qn+ 1
Boztaş et al. On the Relative Abundance of Nonbinary sequences with perfect autocorrelations
KR100368204B1 (en) lnverse operation algorithm using normal basis

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