CN103412738B - Based on pseudo-random sequence generator and its implementation of single step iteration generator polynomial - Google Patents
Based on pseudo-random sequence generator and its implementation of single step iteration generator polynomial Download PDFInfo
- Publication number
- CN103412738B CN103412738B CN201310284391.XA CN201310284391A CN103412738B CN 103412738 B CN103412738 B CN 103412738B CN 201310284391 A CN201310284391 A CN 201310284391A CN 103412738 B CN103412738 B CN 103412738B
- Authority
- CN
- China
- Prior art keywords
- initial value
- iterative generation
- grey iterative
- unit
- pseudo
- 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.)
- Active
Links
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a kind of pseudo-random sequence generator based on single step iteration generator polynomial and its implementation, comprise grey iterative generation polynomials initial value functions setting unit, grey iterative generation multinomial coefficient setting unit, multi-system M-bit parameter set unit, grey iterative generation polynomials initial value functions duration unit, grey iterative generation multinomial operation unit, mould 2
marithmetic element, feedback shift register unit, 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) obtain operation result, its operation result is input to mould 2
marithmetic element, obtains the interative computation result of M-bit.The present invention can produce the pseudo-random sequence of cycle longer multi-system pseudo random number composition and method is simple, improves the reliability adopting pseudo-random sequence system, enhances the security adopting pseudo-random sequence communication facilities.
Description
Technical field
The present invention relates to the remote-control romote-sensing field of communication, particularly relate 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 to produce simultaneously.Because it has the advantage of random noise, turn avoid the shortcoming of random noise, therefore pseudo-random sequence has now been widely used in many key areas, as ECM (Electronic Countermeasures) in cryptography, broadband communication, navigation, modern war etc.Such as when fighting, frequency-hopping communication system often adopts m sequence to control to the saltus step carrying out frequency, send control routine to manipulate unmanned plane, due to the pseudo-randomness of m sequence, enemy intercept and capture our ground after the control signal sent out, not easily detect 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 enemy.
Conventional pseudo-random sequence is m sequence, and be the abbreviation of longest linear feedback shift register sequence, we adopt feedback shift register to produce usually.We usually wish to produce sequence long as far as possible with the least possible progression, and the most long period of the sequence that N (N>=2, N are natural number) level linear feedback shift register produces equals (2
n-1) that, such as: the cycle of the sequence of 4 grades of feedback linearization shifting memory generations is the longest is 15, the primitive polynomial of its correspondence is conventional is x
4+ x+1.Generally, as long as find primitive polynomial, we just can form m sequencer by it.When making m sequencer, the number of shift register feedback line is directly decided by the item number of primitive polynomial, in order to make the composition of m sequencer as far as possible simple, we wish the primitive polynomial using item number minimum, but it is not very simple for finding primitive polynomial, through a large amount of calculating of forefathers, also only have found part primitive polynomial, the cycle of its formation sequence is also limited, and along with the increase of 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 generation of more long period pseudo-random sequence.But modern information war requires more and more higher to the Anti-Jamming Technique of communication facilities, and namely the generation of pseudo-random sequence is a most key key element in Communication Anti-Jamming Techniques.This urgent operational need requires that we find more simple mathematical operation to construct cycle longer pseudo-random sequence, thus 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 single step iteration generator polynomial and its implementation, reduces pseudo-random sequence and realizes macrocyclic complexity.
For realizing above object, the present invention is achieved through the following technical solutions:
Based on a pseudo-random sequence generator for 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 set 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 optimum configurations unit generates multi-system parameter M;
Described grey iterative generation polynomials initial value functions duration unit comprises the value of an initial value T and real-world operation of a setting, by comparer, these two values are compared, if the initial value T that the value of real-world operation is greater than setting just enters grey iterative generation pattern, produce the pseudo-random sequence of M-bit pseudo random number composition, 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, generates the pseudo-random sequence of M-bit pseudo random number composition;
According to arranging of grey iterative generation polynomials initial value functions duration unit, described feedback shift register unit determines that the pseudo-random sequence that M-bit pseudo random number forms being transported to grey iterative generation multinomial operation unit enters 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 single step iteration generator polynomial, comprises following steps:
Step one: according to parameters such as grey iterative generation polynomial expression, the required setting of pseudo-random sequence bit parameter M and the 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 optimum configurations unit generates multi-system parameter M, grey iterative generation polynomials initial value functions duration unit generates initial value duration T, and wherein grey iterative generation multinomial coefficient setting unit, multi-system M-bit parameter set unit are 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: be input to mould 2 according to the operation result that step 2 obtains
marithmetic element, obtains the interative computation result of M-bit and sends into feedback shift register unit;
Step 4: grey iterative generation polynomials initial value functions duration unit is compared by the value of comparer to an initial value T and real-world operation of setting, if the value of real-world operation is greater than the initial value T of setting, grey iterative generation pattern is entered with regard to instruction feedback shift register cell, produce the pseudo-random sequence of M-bit pseudo random number composition, 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, and M-bit >=2, M are 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
mmulti-system (M-bit) pseudo random number composition pseudo-random sequence.And M-bit pseudo random number is [0,2
m-1] interval interior traversal.
Or f (k)=f
2(k-1)+C
1f (k-1)+(2
m-C
2), can generating period be 2
m-1multi-system (M-bit) pseudo random number composition pseudo-random sequence.
Compared with prior art, beneficial effect of the present invention is: the pseudo-random sequence of the multi-system pseudo random number composition adopting the single step iteration generator polynomial generation cycle longer, has expanded the method for existing generation pseudo-random sequence.Relative to the technology of existing pseudo-random sequence generator, complete a very large breakthrough, its single step iteration generator polynomial mathematical computations is simple, and due to C
1with C
2value there is 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, substantially increases the robustness of communication system; In addition, present invention employs the thought of software radio " reconstruct of pseudo-random sequence and platform universalization ", only need change C
1, C
2just different pseudo-random sequences be can produce from the value of M, development time and design cost saved.
Accompanying drawing explanation
Fig. 1 is the fundamental block diagram of the pseudo-random sequence generator that the present invention is based on single step iteration generator polynomial
In Fig. 2 embodiment of the present invention one, multi-system (M-bit) pseudo-random sequence generator realizes block diagram
In Fig. 3 embodiment of the present invention two, multi-system (M-bit) pseudo-random sequence generator realizes block diagram
Embodiment
Below in conjunction with accompanying drawing and embodiment, the present invention is described in more detail:
Embodiment one:
As shown in Figure 1, a kind of pseudo-random sequence generator based on single step iteration generator polynomial of the present invention, comprises grey iterative generation polynomials initial value functions setting unit, grey iterative generation multinomial coefficient setting unit, multi-system M-bit parameter set 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 one: according to parameters such as grey iterative generation polynomial expression, the required setting of pseudo-random sequence bit parameter M and the 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 optimum configurations unit generates multi-system parameter M, M-bit >=2, M is natural number, grey iterative generation polynomials initial value functions duration unit generates initial value duration T, and wherein grey iterative generation multinomial coefficient setting unit, multi-system M-bit parameter set unit are 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: be input to mould 2 according to the operation result that step 2 obtains
marithmetic element, obtains the interative computation result of M-bit and sends into feedback shift register unit;
Step 4: grey iterative generation polynomials initial value functions duration unit is compared by the value of comparer to an initial value T and real-world operation of setting, if the value of real-world operation is greater than the initial value T of setting, entering grey iterative generation pattern with regard to instruction feedback shift register cell, can generating period be 2
mmulti-system (M-bit) pseudo random number composition pseudo-random sequence.And M-bit pseudo random number is [0,2
m-1] interval interior traversal.
Embodiment two
Substantially identical with embodiment one, difference is single step iteration arithmetic expression f (the k)=f in step 2
2(k-1)+C
1f (k-1)+(2
m-C2), can generating period be 2
m-1multi-system (M-bit) pseudo random number composition pseudo-random sequence.
Claims (2)
1. the pseudo-random sequence generator based on 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 set 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) ∈ [0,2
m-1];
Described grey iterative generation multinomial coefficient setting unit generator polynomial coefficient C
1, C
2, C
1, C
2for prime number;
Described multi-system M-bit optimum configurations unit generates multi-system parameter M, M be more than or equal to 2 natural number;
Described grey iterative generation polynomials initial value functions duration unit comprises the value of an initial value T and real-world operation of a setting, by comparer, these two values are compared, if the initial value T that the value of real-world operation is greater than setting just enters grey iterative generation pattern, produce the pseudo-random sequence of M-bit pseudo random number composition, 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, single step iteration arithmetic expression is: f (k)=C
1f (k-1) ± C
2or 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, generates the pseudo-random sequence of M-bit pseudo random number composition;
According to arranging of grey iterative generation polynomials initial value functions duration unit, described feedback shift register unit determines that the pseudo-random sequence that M-bit pseudo random number forms being transported to grey iterative generation multinomial operation unit enters 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 single step iteration generator polynomial according to claim 1, is characterized in that comprising following steps:
Step one: according to grey iterative generation polynomial expression, the required setting of pseudo-random sequence bit parameter M and the 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 optimum configurations unit generates multi-system parameter M, grey iterative generation polynomials initial value functions duration unit generates initial value duration T, and wherein grey iterative generation multinomial coefficient setting unit, multi-system M-bit parameter set unit are 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: be input to mould 2 according to the operation result that step 2 obtains
marithmetic element, obtains the interative computation result of M-bit and sends into feedback shift register unit;
Step 4: grey iterative generation polynomials initial value functions duration unit is compared by the value of comparer to an initial value T and real-world operation of setting, if the value of real-world operation is greater than the initial value T of setting, grey iterative generation pattern is entered with regard to instruction feedback shift register cell, produce the pseudo-random sequence of M-bit pseudo random number composition, otherwise maintain the polynomial initial value of grey iterative generation always.
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 CN103412738A (en) | 2013-11-27 |
| CN103412738B true 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) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108650069B (en) * | 2018-05-09 | 2020-08-28 | 中国科学技术大学 | Sequence generation method and system |
| CN111813374A (en) * | 2020-07-01 | 2020-10-23 | 浙江三维利普维网络有限公司 | Method and device for generating pseudo-random sequence based on DSP (digital Signal processor), and storage medium |
| CN112328206B (en) * | 2020-11-03 | 2024-07-23 | 广州科泽云天智能科技有限公司 | Parallel random number generation method for vectorization component |
Citations (2)
| 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 |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8588412B2 (en) * | 2008-05-23 | 2013-11-19 | Red Hat, Inc. | Mechanism for generating pseudorandom number sequences |
| US8949299B2 (en) * | 2011-08-01 | 2015-02-03 | 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 (2)
| 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 |
Non-Patent Citations (5)
| Title |
|---|
| Institut für Mathematik, Universitä * |
| Polynomial pseudo-random number generator via cyclic phase;A. Marchi et al.;《ELSEVIER》;20090523;第3328-3338页 * |
| t Zürich, Winterthurerstrasse.Multivariate permutation polynomial systems and nonlinear pseudorandom number generators.《ELSEVIER》.2009,第16卷第144-154页. * |
| 伪随机序列中本原多项式生成算法;吕辉等;《计算机工程》;20040831;第30卷(第16期);第108-109页 * |
| 基于匹配搜索的伪随机序列生成多项式的轨迹;柴先明等;《光学精密工程》;20110930;第19卷(第9期);第2222-2227页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103412738A (en) | 2013-11-27 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103440119B (en) | A kind of primitive polynomial pseudo-random sequence generator based on m sequencer | |
| CA2684269C (en) | Digital generation of a chaotic numerical sequence | |
| Masoodi et al. | An analysis of linear feedback shift registers in stream ciphers | |
| 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 | |
| EP1792252A1 (en) | Method and apparatus for generating pseudo random numbers | |
| Zuev et al. | Practical implementation of a pseudo-random signal generator based on the Lorenz system realized on FPGA | |
| CN103560876A (en) | Encryption method and device using random clock based on chaos | |
| CN109375897B (en) | Method for generating pseudo-random sequence | |
| US8260834B2 (en) | Method system and device for generation of a pseudo-random data sequence | |
| CN103049242A (en) | Digital true random number generator circuit | |
| Demir et al. | Cryptanalysis of a random number generator based on continuous‐time chaos | |
| CN103701591A (en) | Sequence password realization method and key stream generating method and device | |
| Levina et al. | Second-order spline-wavelet robust code under non-uniform codeword distribution | |
| CN102904715A (en) | Parallel pseudorandom bit generator based on coupling chaotic mapping system | |
| Falih | A Pseudorandom Binary Generator Based on Chaotic Linear Feedback Shift Register | |
| Ergün | A truly random number generator based on a pulse-excited cross-coupled chaotic oscillator | |
| Abdullah et al. | FPAA implementation of chaotic modulation based on Nahrain map | |
| KR20190139765A (en) | Method and apparatus for generating trust field using linear feedback shift register | |
| AbdElHaleem et al. | Analysis and Guidelines for Different Designs of Pseudo Random Number Generators | |
| RU2586006C1 (en) | Digital synthesizer of noise signals | |
| Bharatesh et al. | FPGA Implementation of Park-Miller Algorithm to Generate Sequence of 32-Bit Pseudo Random Key for Encryption and Decryption of Plain Text | |
| CN103220128A (en) | Chaos cipher production method based on random bit taking-out quantization | |
| Antoniadis et al. | An efficient implementation of a delay-based PUF construction | |
| Cheon et al. | SMAUG (-T), Revisited: Timing-secure, More Compact, Less Failure |
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 |