CN103412738A - Pseudorandom sequence generator based on single-step iteration generator polynomial and implement method thereof - Google Patents
Pseudorandom sequence generator based on single-step iteration generator polynomial and implement method thereof Download PDFInfo
- Publication number
- CN103412738A CN103412738A CN201310284391XA CN201310284391A CN103412738A CN 103412738 A CN103412738 A CN 103412738A CN 201310284391X A CN201310284391X A CN 201310284391XA CN 201310284391 A CN201310284391 A CN 201310284391A CN 103412738 A CN103412738 A CN 103412738A
- Authority
- CN
- China
- Prior art keywords
- initial value
- iterative generation
- grey iterative
- pseudo
- unit
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Abstract
The invention discloses a pseudorandom sequence generator based on a single-step iteration generator polynomial and an implement method of the pseudorandom sequence generator based on the single-step iteration generator polynomial. The pseudorandom sequence generator comprises an iteration generator polynomial initial value setting unit, an iteration generator polynomial coefficient setting unit, an N-nary system M bit parameter setting unit, an iteration generator polynomial initial value duration time unit, an iteration generator polynomial arithmetical unit, a module 2M arithmetical unit and a feeding shifting register unit. The iteration generator polynomial arithmetical unit obtains an arithmetical result according to a polynomial initial value f(0), polynomial coefficients (C1, C2), an N-nary system parameter M and a single-step iteration arithmetical equation f(k). The arithmetical result of the iteration generator polynomial arithmetical unit is input into the module 2M arithmetical unit to obtain a megabit iteration operation result. According to the pseudorandom sequence generator based on the single-step iteration generator polynomial and the implement method of the pseudorandom sequence generator based on the single-step iteration generator polynomial pseudorandom sequence, the pseudorandom sequence composed of N-nary system pseudo-random numbers which are longer in period can be generated, the method is simple and easy to achieve, reliability of a pseudorandom sequence system is improved and safety of a pseudorandom sequence communication device is enhanced.
Description
Technical field
The remote-control romote-sensing field that the present invention relates to communicate by letter, relate in particular to the SSC spread spectrum communication technology in digital carrier system, is a kind of pseudo-random sequence generator and its implementation.
Technical background
Pseudo-random sequence has some statistical property of similar random noise, can repeat again simultaneously to produce.Because it has advantages of random noise, avoided again the shortcoming of random noise, so pseudo-random sequence many key areas now have been widely used in, as ECM (Electronic Countermeasures) in cryptography, broadband communication, navigation, modern war etc.Such as controlling doing the saltus step that wartime, frequency-hopping communication system often adopted the m sequence to carry out frequency, sending control routine controls unmanned plane, pseudo-randomness due to the m sequence, after the enemy, intercepting and capturing the control signal of sending out on our ground, be difficult for detecting the frequency hopping pattern of frequency-hopping communication system, for information war gains time; Equally, in cryptography, information is encrypted and also needs pseudo-random sequence, reduce the probability cracked by the enemy.
Pseudo-random sequence commonly used is the m sequence, is the abbreviation of longest linear feedback shift register sequence, and we adopt feedback shift register to produce usually.We usually wish to produce long as far as possible sequence with the least possible progression, N (N>=2, N is natural number) the long period of the sequence that produces of level linear feedback shift register equals (2
N-1), for example: the cycle of the sequence of 4 grades of feedback linearization shifting memory generations is the longest is 15, and that its corresponding primitive polynomial is commonly used is x
4+ x+1.Generally, as long as find primitive polynomial, we just can form the m sequencer by it.When making the m sequencer, the number of shift register feedback line directly is decided by the item number of primitive polynomial, for the composition that makes the m sequencer is tried one's best simple, we wish the primitive polynomial of using item number minimum, but it is not very simple finding primitive polynomial, a large amount of calculating through forefathers, also only found the part primitive polynomial, the cycle of its formation sequence is also limited, and the increase along with required Cycle Length, the primitive polynomial of the m sequence that can find is fewer and feweri, complexity is also more and more higher, be unfavorable for the more generation of long period pseudo-random sequence.Yet modern information war is more and more higher to the Anti-Jamming Technique requirement of communication facilities, and the generation of pseudo-random sequence is namely the most key key element in Communication Anti-Jamming Techniques.This urgent operational need requires us to find more simple mathematical operation to carry out longer pseudo-random sequence of structure cycle, thereby meets the requirement of fast-developing information countermeasure war.
Goal of the invention
Goal of the invention of the present invention is to provide a kind of pseudo-random sequence generator based on the single step iteration generator polynomial and its implementation, reduces pseudo-random sequence and realizes macrocyclic complexity.
For realizing above purpose, the present invention is achieved through the following technical solutions:
A kind of pseudo-random sequence generator based on the single step iteration generator polynomial, comprise grey iterative generation polynomials initial value functions setting unit, grey iterative generation multinomial coefficient setting unit, multi-system M bit parameter setting unit, grey iterative generation polynomials initial value functions duration unit, grey iterative generation multinomial operation unit, mould 2
MArithmetic element, feedback shift register unit, described grey iterative generation polynomials initial value functions setting unit generator polynomial initial value f (0);
Described grey iterative generation multinomial coefficient setting unit generator polynomial coefficient C
1, C
2
Described multi-system M bit parameter setting unit generates multi-system parameter M;
Described grey iterative generation polynomials initial value functions duration unit comprises the initial value T of a setting and the value of a real-world operation, by comparer, these two values are compared, if the value of real-world operation is greater than the initial value T of setting and just enters the grey iterative generation pattern, produce the pseudo-random sequence that M bit pseudo-random array becomes, otherwise maintain the polynomial initial value of grey iterative generation always;
Described grey iterative generation multinomial operation unit is according to polynomials initial value functions f (0), multinomial coefficient C
1, C
2, multi-system parameter M and single step iteration arithmetic expression f (k) carry out computing and generate operation result;
Described mould 2
MArithmetic element obtains operation result to grey iterative generation multinomial operation unit and carries out mould 2
MComputing, generate the pseudo-random sequence that M bit pseudo-random array becomes;
Described feedback shift register unit determines that according to arranging of grey iterative generation polynomials initial value functions duration unit the pseudo-random sequence that M bit pseudo-random array becomes is transported to grey iterative generation multinomial operation unit to enter the grey iterative generation pattern or maintain the polynomial initial value design of grey iterative generation always.
According to above-mentioned feature, a kind of implementation method of the pseudo-random sequence generator based on the single step iteration generator polynomial comprises following steps:
Step 1: according to grey iterative generation polynomial expression, the setting of required pseudo-random sequence bit parameter M and the parameters such as duration of initial value, grey iterative generation polynomials initial value functions setting unit produces grey iterative generation polynomials initial value functions f (0), grey iterative generation multinomial coefficient setting unit generator polynomial coefficient C
1, C
2Multi-system M bit parameter setting unit generates multi-system parameter M, grey iterative generation polynomials initial value functions duration unit generates the initial value duration T, and wherein grey iterative generation multinomial coefficient setting unit, multi-system M bit parameter setting unit are the mathematics assignment operation;
Step 2: grey iterative generation polynomials initial value functions f (0), multinomial coefficient C
1, C
2, multi-system parameter M is transported to grey iterative generation multinomial operation unit, obtains operation result according to single step iteration arithmetic expression f (k);
Step 3: the operation result obtained according to step 2 is input to mould 2
MArithmetic element, obtain the interative computation result of M bit and send into the feedback shift register unit;
Step 4: grey iterative generation polynomials initial value functions duration unit compares the initial value T of setting and the value of a real-world operation by comparer, if the value of real-world operation is greater than the initial value T of setting, with regard to the instruction feedback shift register cell, enter the grey iterative generation pattern, produce the pseudo-random sequence that M bit pseudo-random array becomes, otherwise maintain the polynomial initial value of grey iterative generation always.
According to above-mentioned feature, described initial value f (0) ∈ [0,2
M-1], multinomial coefficient C1, C2 are prime number, the M bit>=2, M is natural number.
According to above-mentioned feature, described single step iteration arithmetic expression f (k)=C
1F (k-1) ± C
2, can generating period be 2
MThe pseudo-random sequence that forms of multi-system (M bit) pseudo random number.And M bit pseudo-random number is [0,2
M-1] interval interior traversal.
Perhaps f (k)=f
2(k-1)+C
1F (k-1)+(2
M-C
2), can generating period be 2
M-1The pseudo-random sequence that forms of multi-system (M bit) pseudo random number.
Compared with prior art, beneficial effect of the present invention is: adopt the single step iteration generator polynomial to produce the pseudo-random sequence that longer multi-system pseudo random number of cycle forms, expanded the method for existing generation pseudo-random sequence.With respect to the technology of existing pseudo-random sequence generator, completed a very large breakthrough, its single step iteration generator polynomial mathematical computations is simple, and due to C
1With C
2Value have randomness, the kind of generator polynomial also has randomness and kind is more.In actual applications, the probability that generator polynomial is detected reduces greatly, has greatly improved the robustness of communication system; In addition, the present invention has adopted the thought of software radio " reconstruct of pseudo-random sequence and platform universalization ", only needs change C
1, C
2From the value of M, just different pseudo-random sequences be can produce, development time and design cost saved.
The accompanying drawing explanation
Fig. 1 is the fundamental block diagram that the present invention is based on the pseudo-random sequence generator of single step iteration generator polynomial
Multi-system in Fig. 2 embodiment of the present invention one (M bit) pseudo-random sequence generator is realized block diagram
Multi-system in Fig. 3 embodiment of the present invention two (M bit) pseudo-random sequence generator is realized block diagram
Embodiment
Below in conjunction with accompanying drawing and embodiment, the present invention is described in more detail:
Embodiment mono-:
As shown in Figure 1, a kind of pseudo-random sequence generator based on the single step iteration generator polynomial of the present invention, comprise grey iterative generation polynomials initial value functions setting unit, grey iterative generation multinomial coefficient setting unit, multi-system M bit parameter setting unit, grey iterative generation polynomials initial value functions duration unit, grey iterative generation multinomial operation unit, mould 2
MArithmetic element, feedback shift register unit, its concrete methods of realizing is as follows:
Step 1: according to grey iterative generation polynomial expression, the setting of required pseudo-random sequence bit parameter M and the parameters such as duration of initial value, grey iterative generation polynomials initial value functions setting unit produces grey iterative generation polynomials initial value functions f (0), f (0) ∈ [0,2
M-1], grey iterative generation multinomial coefficient setting unit generator polynomial coefficient C
1, C
2, C
1With C
2Get prime number, multi-system M bit parameter setting unit generates multi-system parameter M, the M bit>=2, M is natural number, grey iterative generation polynomials initial value functions duration unit generates the initial value duration T, and wherein grey iterative generation multinomial coefficient setting unit, multi-system M bit parameter setting unit are the mathematics assignment operation;
Step 2: grey iterative generation polynomials initial value functions f (0), multinomial coefficient C
1, C
2, multi-system parameter M is transported to grey iterative generation multinomial operation unit, according to single step iteration arithmetic expression f (k)=C
1F (k-1) ± C
2Obtain operation result;
Step 3: the operation result obtained according to step 2 is input to mould 2
MArithmetic element, obtain the interative computation result of M bit and send into the feedback shift register unit;
Step 4: grey iterative generation polynomials initial value functions duration unit compares the initial value T of setting and the value of a real-world operation by comparer, if the value of real-world operation is greater than the initial value T of setting, with regard to the instruction feedback shift register cell, entering the grey iterative generation pattern, can generating period be 2
MThe pseudo-random sequence that forms of multi-system (M bit) pseudo random number.And M bit pseudo-random number is [0,2
M-1] interval interior traversal.
Embodiment bis-
Basic identical with embodiment mono-, difference is the single step iteration arithmetic expression f (k)=f in step 2
2(k-1)+C
1F (k-1)+(2
M-C2), can generating period be 2
M-1The pseudo-random sequence that forms of multi-system (M bit) pseudo random number.
Claims (5)
1. pseudo-random sequence generator based on the single step iteration generator polynomial, it is characterized in that, comprise grey iterative generation polynomials initial value functions setting unit, grey iterative generation multinomial coefficient setting unit, multi-system M bit parameter setting unit, grey iterative generation polynomials initial value functions duration unit, grey iterative generation multinomial operation unit, mould 2
MArithmetic element, feedback shift register unit, described grey iterative generation polynomials initial value functions setting unit generator polynomial initial value f (0);
Described grey iterative generation multinomial coefficient setting unit generator polynomial coefficient C
1, C
2
Described multi-system M bit parameter setting unit generates multi-system parameter M;
Described grey iterative generation polynomials initial value functions duration unit comprises the initial value T of a setting and the value of a real-world operation, by comparer, these two values are compared, if the value of real-world operation is greater than the initial value T of setting and just enters the grey iterative generation pattern, produce the pseudo-random sequence that M bit pseudo-random array becomes, otherwise maintain the polynomial initial value of grey iterative generation always;
Described grey iterative generation multinomial operation unit is according to polynomials initial value functions f (0), multinomial coefficient C
1, C
2, multi-system parameter M and single step iteration arithmetic expression f (k) carry out computing and generate operation result, the single step iteration arithmetic expression is: f (k)=C
1F (k-1) ± C
2Perhaps f (k)=f
2(k-1)+C
1F (k-1)+(2
M-C
2);
Described mould 2
MArithmetic element obtains operation result to grey iterative generation multinomial operation unit and carries out mould 2
MComputing, generate the pseudo-random sequence that M bit pseudo-random array becomes;
Described feedback shift register unit determines that according to arranging of grey iterative generation polynomials initial value functions duration unit the pseudo-random sequence that M bit pseudo-random array becomes is transported to grey iterative generation multinomial operation unit to enter the grey iterative generation pattern or maintain the polynomial initial value design of grey iterative generation always.
2. the implementation method of a kind of pseudo-random sequence generator based on the single step iteration generator polynomial according to claim 1 is characterized in that comprising following steps:
Step 1: according to grey iterative generation polynomial expression, the setting of required pseudo-random sequence bit parameter M and the parameters such as duration of initial value, grey iterative generation polynomials initial value functions setting unit produces grey iterative generation polynomials initial value functions f (0), grey iterative generation multinomial coefficient setting unit generator polynomial coefficient C
1, C
2Multi-system M bit parameter setting unit generates multi-system parameter M, grey iterative generation polynomials initial value functions duration unit generates the initial value duration T, and wherein grey iterative generation multinomial coefficient setting unit, multi-system M bit parameter setting unit are the mathematics assignment operation;
Step 2: grey iterative generation polynomials initial value functions f (0), multinomial coefficient C
1, C
2, multi-system parameter M is transported to grey iterative generation multinomial operation unit, obtains operation result according to single step iteration arithmetic expression f (k);
Step 3: the operation result obtained according to step 2 is input to mould 2
MArithmetic element, obtain the interative computation result of M bit and send into the feedback shift register unit;
Step 4: grey iterative generation polynomials initial value functions duration unit compares the initial value T of setting and the value of a real-world operation by comparer, if the value of real-world operation is greater than the initial value T of setting, with regard to the instruction feedback shift register cell, enter the grey iterative generation pattern, produce the pseudo-random sequence that M bit pseudo-random array becomes, otherwise maintain the polynomial initial value of grey iterative generation always
3. the implementation method of a kind of pseudo-random sequence generator based on the single step iteration generator polynomial according to claim 2, is characterized in that described initial value f (0) ∈ [0,2
M-1], multinomial coefficient C
1, C
2For prime number, the M bit>=2, M is natural number.
4. according to the implementation method of the described a kind of pseudo-random sequence generator based on the single step iteration generator polynomial of claim 2 or 3, it is characterized in that described single step iteration arithmetic expression f (k)=C
1F (k-1) ± C
2.
5. according to the implementation method of the described a kind of pseudo-random sequence generator based on the single step iteration generator polynomial of claim 2 or 3, it is characterized in that described single step iteration arithmetic expression f (k)=f
2(k-1)+C
1F (k-1)+(2
M-C
2).
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310284391.XA CN103412738B (en) | 2013-07-08 | 2013-07-08 | Based on pseudo-random sequence generator and its implementation of single step iteration generator polynomial |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310284391.XA CN103412738B (en) | 2013-07-08 | 2013-07-08 | Based on pseudo-random sequence generator and its implementation of single step iteration generator polynomial |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103412738A true CN103412738A (en) | 2013-11-27 |
| CN103412738B CN103412738B (en) | 2016-02-17 |
Family
ID=49605752
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310284391.XA Active CN103412738B (en) | 2013-07-08 | 2013-07-08 | Based on pseudo-random sequence generator and its implementation of single step iteration generator polynomial |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103412738B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108650069A (en) * | 2018-05-09 | 2018-10-12 | 中国科学技术大学 | A kind of sequence generating method and system |
| CN112328206A (en) * | 2020-11-03 | 2021-02-05 | 广州科泽云天智能科技有限公司 | Parallel random number generation method for vectorization component |
| WO2022001427A1 (en) * | 2020-07-01 | 2022-01-06 | 浙江三维利普维网络有限公司 | Dsp-based pseudo random sequence generating method and device, and storage medium |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101019099A (en) * | 2004-09-22 | 2007-08-15 | 诺基亚公司 | Method and device for generating pseudo random numbers |
| CN101292223A (en) * | 2005-10-19 | 2008-10-22 | Nxp股份有限公司 | Method of generating pseudo-random numbers |
| US20090292752A1 (en) * | 2008-05-23 | 2009-11-26 | Red Hat, Inc. | Mechanism for generating pseudorandom number sequences |
| US20130036146A1 (en) * | 2011-08-01 | 2013-02-07 | Syntest Technologies, Inc. | Method and apparatus for hybrid ring generator design |
-
2013
- 2013-07-08 CN CN201310284391.XA patent/CN103412738B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101019099A (en) * | 2004-09-22 | 2007-08-15 | 诺基亚公司 | Method and device for generating pseudo random numbers |
| CN101292223A (en) * | 2005-10-19 | 2008-10-22 | Nxp股份有限公司 | Method of generating pseudo-random numbers |
| US20090292752A1 (en) * | 2008-05-23 | 2009-11-26 | Red Hat, Inc. | Mechanism for generating pseudorandom number sequences |
| US20130036146A1 (en) * | 2011-08-01 | 2013-02-07 | Syntest Technologies, Inc. | Method and apparatus for hybrid ring generator design |
Non-Patent Citations (4)
| Title |
|---|
| A. MARCHI ET AL.: "Polynomial pseudo-random number generator via cyclic phase", 《ELSEVIER》, 23 May 2009 (2009-05-23), pages 3328 - 3338 * |
| INSTITUT FÜR MATHEMATIK, UNIVERSITäT ZÜRICH, WINTERTHURERSTRASSE: "Multivariate permutation polynomial systems and nonlinear pseudorandom number generators", 《ELSEVIER》, vol. 16, 31 December 2009 (2009-12-31), pages 144 - 154 * |
| 吕辉等: "伪随机序列中本原多项式生成算法", 《计算机工程》, vol. 30, no. 16, 31 August 2004 (2004-08-31), pages 108 - 109 * |
| 柴先明等: "基于匹配搜索的伪随机序列生成多项式的轨迹", 《光学精密工程》, vol. 19, no. 9, 30 September 2011 (2011-09-30), pages 2222 - 2227 * |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108650069A (en) * | 2018-05-09 | 2018-10-12 | 中国科学技术大学 | A kind of sequence generating method and system |
| WO2022001427A1 (en) * | 2020-07-01 | 2022-01-06 | 浙江三维利普维网络有限公司 | Dsp-based pseudo random sequence generating method and device, and storage medium |
| CN112328206A (en) * | 2020-11-03 | 2021-02-05 | 广州科泽云天智能科技有限公司 | Parallel random number generation method for vectorization component |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103412738B (en) | 2016-02-17 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103440119B (en) | A kind of primitive polynomial pseudo-random sequence generator based on m sequencer | |
| Panda et al. | FPGA implementation of 8, 16 and 32 bit LFSR with maximum length feedback polynomial using VHDL | |
| Merah et al. | A pseudo random number generator based on the chaotic system of Chua’s circuit, and its real time FPGA implementation | |
| Roy et al. | Compact and side channel secure discrete Gaussian sampling | |
| Masoodi et al. | An analysis of linear feedback shift registers in stream ciphers | |
| US20080281892A1 (en) | Method and Apparatus for Generating Pseudo Random Numbers | |
| Arnault et al. | Design and properties of a new pseudorandom generator based on a filtered FCSR automaton | |
| CN103412738B (en) | Based on pseudo-random sequence generator and its implementation of single step iteration generator polynomial | |
| CN107678729A (en) | A kind of Lorenz chaos pseudo random sequence generators based on m-sequence | |
| CN103197912B (en) | A kind of uniform random number generation method for deep space communication protocol code | |
| CN109375897B (en) | Method for generating pseudo-random sequence | |
| Azzaz et al. | An FPGA implementation of a Feed-Back Chaotic Synchronization for secure communications | |
| Baldi et al. | On the autocorrelation properties of truncated maximum-length sequences and their effect on the power spectrum | |
| US20090157779A1 (en) | Method System and Device for Generation of a Pseudo-Random Data Sequence | |
| Tasheva et al. | Generalization of the self-shrinking generator in the galois field GF (pn) | |
| Thane et al. | Hardware design and implementation of pseudorandom number generator using piecewise linear chaotic map | |
| CN1697366B (en) | Controllable method for generating chaos cipher sequence of natural number, and core of digit chip | |
| Dogaru et al. | Algebraic normal form for rapid prototyping of elementary hybrid cellular automata in FPGA | |
| CN102904715A (en) | Parallel pseudorandom bit generator based on coupling chaotic mapping system | |
| Abdullah et al. | FPAA implementation of chaotic modulation based on Nahrain map | |
| Gupt et al. | Automatic test case generation for prime field elliptic curve cryptographic circuits | |
| RU2586006C1 (en) | Digital synthesizer of noise signals | |
| Merah et al. | Coupling two chaotic systems in order to increasing the security of a communication system-study and real time FPGA implementation | |
| Azzaz et al. | Hardware implementation of multi-scroll chaos based architecture for securing biometric templates | |
| Ergün et al. | A truly random number generator based on a continuous-time chaotic oscillator for applications in cryptography |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant |