CN105159652A - Multi-channel pseudo-random signal generation method - Google Patents
Multi-channel pseudo-random signal generation method Download PDFInfo
- Publication number
- CN105159652A CN105159652A CN201510492826.9A CN201510492826A CN105159652A CN 105159652 A CN105159652 A CN 105159652A CN 201510492826 A CN201510492826 A CN 201510492826A CN 105159652 A CN105159652 A CN 105159652A
- Authority
- CN
- China
- Prior art keywords
- pseudo random
- random number
- number generator
- pseudorandom number
- pseudorandom
- 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.)
- Pending
Links
Landscapes
- Tests Of Electronic Circuits (AREA)
Abstract
The invention discloses a multi-channel pseudo-random signal generation method. The method comprises: performing operation on at least two pseudo-random number generators, and generating high-speed pseudo-random numbers with long sequence periods, wherein the generation of each pseudo-random number is based on a parallel-structure longest linear feedback shift register circuit. The pseudo-random numbers generated by the pseudo-random number generators participating in operation are required to be uncorrelated with one another; uniformly-distributed pseudo-random numbers with multiple data bits can be generated in real time; other distributed pseudo-random numbers also can be generated; wide-band digital white noise signals can be generated; parameters such as an average value, a variance and the like are adjustable; and multi-channel pseudo-random signals can be generated.
Description
Technical field
The present invention relates to signal and field, specifically a kind of hyperchannel pseudo random signal method for generation occur.
Background technology
The power spectral density function of desirable white noise signal is a constant in all frequencies, and its power is infinitely great, therefore can not physics realization.A noise signal its power spectral density function in interested frequency range is approximately a constant, is called as bandlimited white noise acoustical signal, physically can realizes.The character of bandlimited white noise acoustical signal and desirable white noise signal is similar.The bandwidth of side circuit system is limited, as long as the frequency range of the bandlimited white noise acoustical signal produced is wider than the bandwidth of side circuit, it is identical on the impact of the desirable white noise signal that the impact of signal system distributes with same spectrum density, equal probabilities.After the voltage digital of simulating the white noise signal, ideal digital white noise signal can be formed.
Noise signal is physically based deformation technology traditionally.Such as, utilize the radioactivity of radiomaterial, use detector to produce random number to its counting.The electric discharge of gas-discharge tube is utilized to produce noise signal.At the seventies in last century six, gas-discharge tube was at home and abroad once widely used as noise criteria.The method and technology complexity, the security that more than produce noise are not high, the solid-state noise generation techniques be therefore born again based on circuit noise.Such as, utilize the thermonoise of resistance or the noise of semiconductor devices, can produce broadband noise signal, its theory diagram as shown in Figure 1.
Charge carrier result of random thermal motion in conductor and the fluctuation noise produced are thermonoise, and thermal noise voltage is relevant with temperature, and its mean square value is:
V
2＝4kTBR
Wherein R is the resistance of conductor, and B is the bandwidth of circuit, and k is Boltzmann constant, and T is absolute temperature.Because thermonoise originates from the motion of majority carrier, so it is the Gaussian distribution of zero that its instantaneous amplitude obeys average, when temperature and resistance one timing, the spectral density of thermal noise voltage and frequency have nothing to do, and therefore, the thermonoise of resistance is the white noise of Gaussian.
A semiconductor diode reverse bias operation, in avalanche breakdown state, in avalanche region, produces snowslide Johnson noise because electron-hole pair produces the random fluctuation character of speed.Under certain avalanche frequency, snowslide Johnson noise is similar to white noise, and its noise power spectral density is uniformly distributed.Therefore, reverse operation can become a comparatively ideal noise source in the diode of avalanche breakdown state.Utilize the avalanche breakdown of Zener diode or PIN diode to produce noise signal, then through wide-band amplify, can broadband noise signal be produced.
Solid state noise generator frequency range is wider, can be covered to microwave frequency band, and the probability density of output signal meets Gaussian distribution, belongs to white Gaussian noise signal.The shortcoming of conventional noise signal generator is that the probability distribution outputed signal can not adjust, spectral density adjustment difficulty.In practical application, often need random number or the noise signal of numeric type.By the output quantization of solid state noise generator, the noise signal of numeric type can be produced.
Set forth the method that physically based deformation technology produces true random number below.Utilize the noise that the avalanche breakdown of Zener diode produces, warp is every straight and wide-band amplify, and can produce the broadband white noise signal of simulation, this noise signal is Gaussian distribution.Use A/D converter at a high speed by analogue noise signal digital, can produce the digital noise signal of Gaussian distribution, theory diagram as shown in Figure 2.In figure, Vcc is direct voltage source, and R is current-limiting resistance, is operated in avalanche breakdown region to make diode D.L provides DC channel, isolates AC signal simultaneously, and C is partiting dc capacitor, and simultaneously by noise signal coupling output, N is amplifying circuit.The noise signal quantized compares with numerical value 0 again, if numerical value is more than or equal to 0 just export 1, if be less than 0 just export 0, create an equally distributed scale-of-two random number in this way, theory diagram as shown in Figure 3.Analog comparator at a high speed can certainly be used to convert analogue noise signal to binary digital noise signal.
The limited random number of sequence period is called pseudo random number, and the limited random signal of sequence period is called pseudo random signal.The sequence period of pseudo random number is longer, and its statistical property is better, more close to true random number.Because the generation circuit of true random number is comparatively complicated, in engineering, the normal pseudo random number that uses replaces true random number, because its mathematical property is similar, can meet requirement of engineering.
Utilize computing machine to produce easily and be uniformly distributed pseudo random number.The method producing pseudo random number has middle square method, multiplicative congruential method, linear congruent algorithm.Middle square method, multiplicative congruential method produce the of low quality of pseudo random number.On computers, conventional linear congruent algorithm produces pseudo random number.Linear congruential method recursion formula is:
rand(n)＝(rand(n-1)*mult+inc)modM
Wherein rand (n) is current random number, and rand (n-1) is previous moment random number, and mult is multiplier factor, M=2
lfor modulus value.Inc is increment, under normal circumstances the desirable odd number being less than M.In C language compiler, function rand () can produce the random integers between 0 ~ 32767.The formula producing pseudo random number in VC is:
rand(n)＝((rand(n-1)*214013+2531011)mod65536)&0x7fff
The formula producing pseudo random number in BC is:
rand(n)＝((rand(n-1)*22695477+1)mod65536)&0x7fff
Utilize digital technology, produce after being uniformly distributed pseudo random number, other distribution pseudo random number can be produced easily, the pseudorandom number white noise signal that such as Gaussian distribution pseudo-random sequence, and average, variance, spectral density are adjustable.
M sequence, also known as longest linear feedback shift register sequence, is a kind of binary pseudo-random sequence studying more deep.Be usually used in the fields such as spread spectrum communication, range finding, circuit test.It is produced by the shift register with linear feedback, as shown in Figure 4.The state a of single place shift register in figure
irepresent, a
i=0 or a
i=1, i is integer.The connection status C of feedback line
irepresent, C
i=0 represents that this feedback line disconnects, C
i=1 represents that feedback exists.
Under control of the clock signal, be outwards shifted shift register output step by step.Due to the existence of feedback, if original state is complete " 0 ", then what obtain after displacement is still complete " 0 ", therefore should avoid occurring complete " 0 " state; Again because n level shifting memory has 2
nplant possible different conditions, except complete " 0 " state, remaining 2
n-a kind of state can be used.Often be shifted once, just occur a kind of state, after displacement several times, one repeats front a certain state surely, and process thereafter is is just gone round and begun again, and that is, output signal must be periodic signal.To there are the different sequences of different cycles in feedback line position difference, it is desirable to find suitable linear feedback logic, the sequence that shift register can be made to produce is the longest, namely reaches cycle M=2
n-1.By line relation in Fig. 2, the input that shift register group left end obtains can be written as:
a
n＝c
1a
n-1⊕c
2a
n-2⊕c
3a
n-3⊕...⊕c
n-1a
1⊕c
na
0
In formula, ⊕ is xor operator.When selecting suitable linear feedback logic, output sequence is exactly one-period is 2
nthe m sequence of-1.
C
ivalue determine the feedback link of concrete shift register, sequential structure and cycle, for ease of expressing C
istate, introduce polynomial expression:
f(x)＝c
0+c
1x+c
2x
2+...+c
n-1x
n-1+c
nx
n
This formula is called proper polynomial.When knowing the proper polynomial of a linear feedback shift register, the structure of linear feedback shift register just can be determined.Verified, if the proper polynomial of linear feedback shift register is primitive polynomial, then this linear feedback shift register can produce m sequence.This is the sufficient and necessary condition that linear feedback shift register produces m sequence.In actual applications, need according to data bits the length first determining m sequence, then by the feedback logic that just can obtain m sequencer easily of tabling look-up.The linear feedback shift register of certain length, has a lot of primitive polynomials, corresponding different m sequences.Conventional primitive polynomial, forefathers provide in table form.Such as, as n=31, f (x)=1+x
3+ x
31for primitive polynomial, m sequence can be produced.C in corresponding formula
0=1, C
3=1, C
31=1.Sequence period is 2
31-1, be a Mersenne Prime just.M sequence has following character:
(1) equilibrium response.In each 2 of m sequence
nin-1 cycle, the number that " 1 " code element occurs is 2
n-1secondary, the number that " 0 " code element occurs is 2
n-1-1 time, i.e. the number of " 0 " always fewer than the number of " 1 ", this shows, serial mean is minimum.
(2) Run length property.The distance of swimming refers to being collectively referred to as of continuously arranged in a sequence period and the code element that value is identical, and the number of the code element in a distance of swimming is run length.2 are had in m sequence
n-1the individual distance of swimming.Wherein length is that the distance of swimming number of k (1≤k≤n-2) accounts for 2 of total number of runs
-k, length is the number of runs of the company " 0 " of n-1 is 1, and length is company " 1 " number of runs of n is 1.
(3) shifter-adder characteristic.A m sequence { a
nrear another the different sequence { a produced that is shifted is postponed any time from it
n+kexclusive-OR, the delay shift sequence being still this m sequence obtained.As, 01001l1 moves to right and produces another sequence 1010011 for 1 time, and the sequence after exclusive-OR is 1l10100, is equivalent to former sequence and moves to right the sequence obtained after 3 times.
(4) m sequence has excellent autocorrelation performance, its autocorrelation function:
Usually there are a lot of m sequences in longest linear feedback shift register.There are 2 m sequences in the longest linear feedback shift register of such as 3, there are 2 m sequences in the longest linear feedback shift register of 4, there are 6 m sequences in the longest linear feedback shift register of 5, there are 6 m sequences in the longest linear feedback shift register of 6, there are 18 m sequences in the longest linear feedback shift register of 7, there are 16 m sequences in the longest linear feedback shift register of 8, there are 48 m sequences in the longest linear feedback shift register of 9, there are 60 m sequences in the longest linear feedback shift register of 10, there are 176 m sequences in the longest linear feedback shift register of 11, there are 144 m sequences in the longest linear feedback shift register of 12, there are 630 m sequences in the longest linear feedback shift register of 13, there are 756 m sequences in the longest linear feedback shift register of 14, there are 1800 m sequences in the longest linear feedback shift register of 15.Along with the increase of longest linear feedback shift register figure place, the number of m sequence increases sharply.
Coefficient is that 19 longest linear feedback shift registers of 5 exist 158 m sequences.Its primitive polynomial is 1+x+x
2+ x
5+ x
19, 1+x+x
2+ x
6+ x
19, 1+x+x
4+ x
6+ x
19, 1+x
3+ x
4+ x
6+ x
19, 1+x+x
5+ x
6+ x
19, 1+x+x
4+ x
7+ x
19, 1+x
5+ x
6+ x
7+ x
19, 1+x+x
6+ x
8+ x
19..., 1+x
13+ x
17+ x
18+ x
19, 1+x
14+ x
17+ x
18+ x
19.Coefficient is that 25 longest linear feedback shift registers of 3 exist 4 m sequences.Its primitive polynomial is 1+x
3+ x
25, 1+x
7+ x
25, 1+x
18+ x
25, 1+x
22+ x
25.Usually there is a mirror image primitive polynomial in a primitive polynomial, the number of these two primitive polynomial coefficients is identical, and the exponent number of coefficient is symmetrical with the figure place of longest linear feedback shift register.Such as 19 rank primitive polynomial 1+x+x
2+ x
5+ x
19with 1+x
14+ x
17+ x
18+ x
19mirror image, 1+x+x
2+ x
6+ x
19with 1+x
13+ x
17+ x
18+ x
19mirror image.25 rank primitive polynomial 1+x
3+ x
25with 1+x
22+ x
25mirror image, 1+x
7+ x
25with 1+x
18+ x
25mirror image.The m sequence that the primitive polynomial of two mirror images generates has stronger correlativity.The cross correlation function of the m sequence not having the primitive polynomial of mirror to generate is almost nil, can think incoherent.Such as primitive polynomial 1+x+x
2+ x
5+ x
19, 1+x+x
2+ x
6+ x
19, 1+x+x
4+ x
6+ x
19, 1+x
3+ x
4+ x
6+ x
19, 1+x+x
5+ x
6+ x
19, 1+x+x
4+ x
7+ x
19, 1+x
5+ x
6+ x
7+ x
19, 1+x+x
6+ x
8+ x
19, 1+x
3+ x
25, 1+x
7+ x
25between uncorrelated mutually.
The pseudo-randomness of m sequence is fine, but it can only export one at every turn.Want the pseudo random number of generation data bit more than, very natural idea directly extracts several from longest linear feedback shift register, obtains the random number of a multidigit.Fig. 5 is the circuit diagram obtaining 4 pseudo random numbers the longest linear feedback shift register of from 8.The primitive polynomial that its linear feedback logical circuit is corresponding can select 1+x
2+ x
3+ x
4+ x
8, the feedback line that namely a6, a5, a4, a0 data bit is corresponding is in connection status.But this method is bad, because the pseudo random number that this moment exports, the pseudo random number exported with subsequent time, except a data bit is newly-generated, other several data bit is identical, and only position offset by one.The pseudo random number that this moment exports, the pseudo random number exported with next subsequent time, except two data bit are newly-generated, other two data bit are identical, and only position offset by two.The like.That is have stronger correlativity between before and after the pseudo random number generated in this way, therefore its quality is good not.
Summary of the invention
The object of this invention is to provide a kind of hyperchannel pseudo random signal method for generation, to solve prior art Problems existing.
In order to achieve the above object, the technical solution adopted in the present invention is:
A kind of hyperchannel pseudo random signal method for generation, is characterized in that: based on the N of parallel organization longest linear feedback shift register
aposition pseudorandom number generator A, what generate m position is uniformly distributed pseudo random number, is designated as A [k], take binary representation as A
m-1[k] A
m-2[k] ... A
1[k] A
0[k]; Based on the N of parallel organization
bthe pseudorandom number generator B of position longest linear feedback shift register, what generate m position is uniformly distributed pseudo random number, is designated as B [k], take binary representation as B
m-1[k] B
m-2[k] ... B
1[k] B
0[k]; Pseudo random number A [k] is in parallel with pseudo random number B [k], and generating 2m position pseudo random number D [k], take binary representation as D
2m-1[k] D
2m-2[k] ... D
1[k] D
0[k]; The pseudo random number B [k] that the pseudo random number A [k] requiring pseudorandom number generator A to generate and pseudorandom number generator B generate is uncorrelated, and namely the primitive polynomial of pseudorandom number generator A and the primitive polynomial of pseudorandom number generator B can not be mirror image primitive polynomials; Due to uncorrelated between pseudorandom number generator A and pseudorandom number generator B, each in the pseudo random number D [k] of generation is equally distributed, and therefore D [k] is that 2m position is uniformly distributed pseudo random number;
When m is even number, the sequence period of parallel organization pseudorandom number generator A is 2
nathe sequence period of-1, parallel organization pseudorandom number generator B is 2
nb-1; The sequence period of pseudo random number D [k] is the lowest common multiple of pseudorandom number generator A and B sequence period, and therefore the sequence period of pseudo random number D [k] obtains very big expansion.
Described a kind of hyperchannel pseudo random signal method for generation, is characterized in that: when adopting three groups of pseudorandom number generator circuit structures, based on the N of parallel organization longest linear feedback shift register
aposition pseudorandom number generator A, what generate m position is uniformly distributed pseudo random number, is designated as A [k]; Based on the N of parallel organization longest linear feedback shift register
bposition pseudorandom number generator B, what generate m position is uniformly distributed pseudo random number, is designated as B [k]; Based on the N of parallel organization longest linear feedback shift register
cposition pseudorandom number generator C, what generate m position is uniformly distributed pseudo random number, is designated as C [k]; A [k] is in parallel with C [k] with B [k], and what generate 3m position is uniformly distributed pseudo random number D [k]; Require that pseudorandom number generator A and pseudorandom number generator B and pseudorandom number generator C is uncorrelated mutually;
When m is even number, the sequence period of parallel organization pseudorandom number generator A is 2
nathe sequence period of-1, parallel organization pseudorandom number generator B is 2
nbthe sequence period of-1, parallel organization pseudorandom number generator C is 2
nc-1; The sequence period of pseudo random number D [k] is the lowest common multiple of pseudorandom number generator A and B and C sequence period, and therefore the sequence period of pseudo random number D [k] obtains very big expansion.
The present invention can produce at a high speed the long sequence period pseudo random number of multiple data bit, also can produce the pseudo random number of multiple distribution, also can produce wide band digital white noise signal, and its Parameter adjustable such as average, variance saves, and can also produce multichannel pseudo random signal.
Accompanying drawing explanation
The solid-state noise signal generator theory diagram of Fig. 1.
Fig. 2 Gaussian distribution digital noise signal generator theory diagram.
Fig. 3 scale-of-two is uniformly distributed digital noise signal generator theory diagram.
Fig. 4 longest linear feedback shift register theory diagram.
Fig. 5 extracts the theory diagram of 4 figure places from 8 longest linear feedback shift registers.
Fig. 6 parallel organization pseudo random number circuit for generating theory diagram.
The circuit for producing pseudorandom number theory diagram of Fig. 7 invention.
Fig. 8 has the high speed circuit for producing pseudorandom number theory diagram of three circuit units.
Fig. 9 coding circuit theory diagram.
Figure 10 Hash coding circuit theory diagram.
Figure 11 different distributions digital noise signal produces schematic block circuit diagram.
Specifically implement theory diagram for one of Figure 12 circuit for producing pseudorandom number.
Specifically implement theory diagram for one of Figure 13 coding circuit.
Figure 14 pseudo random signal generator output circuit emulation sequential chart.
Another of Figure 15 circuit for producing pseudorandom number specifically implements theory diagram.
Another of Figure 16 coding circuit specifically implements theory diagram.
Figure 17 pseudo random signal generator output circuit emulation sequential chart.
Figure 18 Gaussian reflectivity mirrors signal probability densimetric curve.
Figure 19 Gaussian reflectivity mirrors signal accumulation distribution function curve.
Numerical curve when Figure 20 produces Gaussian reflectivity mirrors signal in look-up table.
Embodiment
A kind of hyperchannel pseudo random digital noise signal generator, carries out computing to two or more pseudorandom number generator, produces long sequence period high speed pseudo random number; Wherein the generation of each pseudo random number is based on parallel organization longest linear feedback shift register circuit; Require that the pseudo random number that each pseudorandom number generator participating in computing produces is uncorrelated mutually; What can produce that multichannel has multiple data bit in real time is uniformly distributed pseudo random number; Also the pseudo random number of other distribution of multichannel can be produced; The pseudorandom number white noise signal of Multipath wide band band can be produced; Its Parameter adjustable such as average, variance saves.Set forth know-why of the present invention below.
Extracting from longest linear feedback shift register in the method for a few figure place has partial data position to be identical between adjacent pseudo random number, and only position offsets to some extent, and the pseudo random number poor quality of generation, needs to make improvement.
For the longest linear feedback shift register of n position, the value of internal register illustrates the state of circuit { Q [k] }, and the value of current time register is designated as Q
n-1[k], Q
n-2[k], Q
n-3[k] ... Q
1[k], Q
0[k], Q
n[k] is
Q
n[k]＝c
1Q
n-1[k]⊕c
2Q
n-2[k]⊕c
3Q
n-3[k]⊕...⊕c
n-1Q
1[k]⊕c
nQ
0[k]
The state of lower moment circuit is designated as { Q [k+1] }, and the value of register is Q
n-1[k+1], Q
n-2[k+1], Q
n-3[k+1] ... Q
1[k+1], Q
0[k+1], then
Q
n-1[k+1]＝Q
n[k]
Q
n-2[k+1]＝Q
n-1[k]
Q
n-3[k+1]＝Q
n-2[k]
...
Q
1[k+1]＝Q
2[k]
Q
0[k+1]＝Q
1[k]
Q
n[k+1]＝c
1Q
n-1[k+1]⊕c
2Q
n-2[k+1]⊕c
3Q
n-3[k+1]⊕...⊕c
n-1Q
1[k+1]⊕c
nQ
0[k+1]
The state of circuit of lower lower moment is designated as { Q [k+2] }, and the value of register is Q
n-1[k+2], Q
n-2[k+2], Q
n-3[k+2] ... Q
1[k+2], Q
0[k+2], then
Q
n-1[k+2]＝Q
n[k+1]
Q
n-2[k+2]＝Q
n-1[k+1]
Q
n-3[k+2]＝Q
n-2[k+1]
...
Q
1[k+2]＝Q
2[k+1]
Q
0[k+2]＝Q
1[k+1]
Q
n[k+2]＝c
1Q
n-1[k+2]⊕c
2Q
n-2[k+2]⊕c
3Q
n-3[k+2]⊕...⊕c
n-1Q
1[k+2]⊕c
nQ
0[k+2]
The like.If prepare the binary data of parallel output m position, generate the shortcoming of pseudo random number to overcome preceding method, need to come m clock, the state of circuit become { Q [k+m] } from { Q [k] }, the value of register is Q
n-1[k+m], Q
n-2[k+m], Q
n-3[k+m] ... Q
1[k+m], Q
0[k+m].The binary data of the m position generated in this way is Q
m-1[k+m], Q
m-2[k+m] ..., Q
1[k+m], Q
0[k+m].Be identical without any data bit between before and after the m position pseudo random number of such generation, the correlativity overcome between data well, the quality of pseudo random number obtains very big improvement.Because every bit " 0 " is identical with the probability of " 1 " code element, the pseudo random number of the m position therefore generated is equally distributed.When the pseudo random number of m position regards complement code as, numerical range is [-2
m-1, 2
m-1-1].When the pseudo random number of m position regards unsigned number as, numerical range is [0,2
m-1].
The shortcoming of said method often carrys out m clock, just can obtain a pseudo random number, and therefore the speed of circuit evolving pseudo random number have dropped m doubly.If to state { Q [the k] } recursion of foregoing circuit, obtain successively { Q [k+1] } ... { Q [k+m] }, the Logical Deriving of circuit state { Q [k+m] } is derived the state only depending on { Q [k] }, the longest linear feedback shift register so designed often carrys out a clock, just can export the pseudo random number of a m position, the speed generating pseudo random number is greatly improved, and its internal state is equivalent to the state that original longest linear feedback shift register changes m time.The longest linear feedback shift register theory diagram of this parallel organization as shown in Figure 6.
The present invention proposes a kind of being combined with more than one parallel organization longest linear feedback shift register by a parallel organization longest linear feedback shift register and produce the method for long sequence period pseudo random number, theory diagram as shown in Figure 7.
If based on the N of parallel organization longest linear feedback shift register
aposition pseudorandom number generator A, what generate m position is uniformly distributed pseudo random number, is designated as A [k], take binary representation as A
m-1[k] A
m-2[k] ... A
1[k] A
0[k].Based on the N of parallel organization
bthe pseudorandom number generator B of position longest linear feedback shift register, what generate m position is uniformly distributed pseudo random number, is designated as B [k], take binary representation as B
m-1[k] B
m-2[k] ... B
1[k] B
0[k].Pseudo random number A [k] is in parallel with pseudo random number B [k], and generating 2m position pseudo random number D [k], take binary representation as D
2m-1[k] D
2m-2[k] ... D
1[k] D
0[k].The pseudo random number B [k] that the pseudo random number A [k] requiring pseudorandom number generator A to generate and pseudorandom number generator B generate is uncorrelated, and namely the primitive polynomial of pseudorandom number generator A and the primitive polynomial of pseudorandom number generator B can not be mirror image primitive polynomials.Due to uncorrelated between pseudorandom number generator A and pseudorandom number generator B, each in the pseudo random number D [k] of generation is equally distributed, and therefore D [k] is that 2m position is uniformly distributed pseudo random number.
When m is even number, the sequence period of parallel organization pseudorandom number generator A is 2
nathe sequence period of-1, parallel organization pseudorandom number generator B is 2
nb-1.The sequence period of pseudo random number D [k] is the lowest common multiple of pseudorandom number generator A and B sequence period.Therefore the sequence period of pseudo random number D [k] obtains very big expansion.
When adopting three groups of pseudorandom number generator circuit structures, theory diagram as shown in Figure 8.Based on the N of parallel organization longest linear feedback shift register
aposition pseudorandom number generator A, what generate m position is uniformly distributed pseudo random number, is designated as A [k].Based on the N of parallel organization longest linear feedback shift register
bposition pseudorandom number generator B, what generate m position is uniformly distributed pseudo random number, is designated as B [k].Based on the N of parallel organization longest linear feedback shift register
cposition pseudorandom number generator C, what generate m position is uniformly distributed pseudo random number, is designated as C [k].A [k] is in parallel with C [k] with B [k], and what generate 3m position is uniformly distributed pseudo random number D [k].Require that pseudorandom number generator A and pseudorandom number generator B and pseudorandom number generator C is uncorrelated mutually.
When m is even number, the sequence period of parallel organization pseudorandom number generator A is 2
nathe sequence period of-1, parallel organization pseudorandom number generator B is 2
nbthe sequence period of-1, parallel organization pseudorandom number generator C is 2
nc-1.The sequence period of pseudo random number D [k] is the lowest common multiple of pseudorandom number generator A and B and C sequence period.Therefore the sequence period of pseudo random number D [k] obtains very big expansion.
The pseudorandom number generator of more multicircuit unit can be designed with.Such as can be designed with the pseudorandom number generator of four parallel organization longest linear feedback shift registers, by the output-parallel of these four pseudorandom number generators, generate have multiple data bit be uniformly distributed pseudo random number.Require that these four pseudorandom number generators are uncorrelated mutually.The sequence period generating pseudo random number is the lowest common multiple of these four pseudorandom number generator sequence periods.
Hash class function, can become the data-mapping in a data space data in another data space.Export the change of data to input data very responsive, input data are even the change of, and exporting data also can be very different.Design good Hash function and the data-mapping in the input space can be become equally distributed random number in output region.This Hash function according to application demand designed, designed, also can select a kind of Hash function of function admirable.Secure Hash Algorithm SHA is the one of Hash function, and the random number after SHA process has good statistical property.SHA family algorithm designed by U.S.National Security Agency (NSA), and is issued by National Institute of Standards and Technology (NIST).SHA-2 comprises SHA-224, SHA-256, SHA-384 and SHA-512 tetra-kinds.In four kinds of algorithms, SHA-224 computational complexity is relatively low, and arithmetic speed is the fastest.SHA-2 algorithm input maximum length is no more than 2
64position, output is 224 or 256 or 384 or 512.Algorithm process comprises the following steps: (1) additional padding bits; (2) additional length value; (3) initialization buffer memory; (4) packet sequence is processed; (5) last data summarization is exported.The logical operation that SHA-2 mainly uses has: displacement, step-by-step and and step-by-step XOR, digital circuit can be used simply, and SHA-2 arithmetic speed is within hardware very fast.SHA-2 can realize the compression to data easily, and when adopting data input-output ratio to be 1:1, input figure place is identical with output figure place, does not reduce data output speed.
Occur from the angle of signal, the method discussed herein, the quality being uniformly distributed pseudo random number of generation is relatively good.If pseudo random number the present invention generated, after coding circuit process as shown in Figure 9, can improve the quality generating pseudo random number.When this coding circuit select as shown in Figure 10 Hash coding circuit time, what can generate very high-quality is uniformly distributed pseudo random number, can be good at meeting every Randomness test, can be used for there is strict demand in the fields such as cryptography occasion to quality of random numbers.After this coding circuit process, the sequence period exporting pseudo random number is identical with the sequence period of input pseudo random number, but the sequence period that the sequence period of each all expands to many data bit pseudo random number is identical, that is the entropy of pseudo random number is improved.The pseudo random signal inputted in Figure 10 circuit, through data bit transition circuit, the pseudo random signal serioparallel exchange of two-forty low-bit width is become the pseudo random signal of low rate high-bit width, the pseudo random signal of phase same rate is generated through Hash coding circuit, again through data bit transition circuit, the pseudo random signal parallel-serial conversion of low rate high-bit width is become the output pseudo random signal of two-forty low-bit width.Multiphace clock generating circuit, by input clock signal frequency division, produces the low-frequency clock signal of multichannel, phase input clock cycle of every road low-frequency clock signal, for going here and there and and parallel-to-serial converter.The frequency of input clock and low-frequency clock is than the ratio equaling Hash coded signal and input signal data bit wide.The frequency of output clock and low-frequency clock is than the ratio equaling Hash coded signal and output signal data bit wide.The w byte that coding exports is uniformly distributed pseudo random number, and be divided into t road pseudo random number and export simultaneously, every road is still for being uniformly distributed pseudo random number, and its bit wide is w/t byte.Such as when w is 8 bytes, when exporting 4 tunnel pseudo random signal, the bit wide of every road pseudo random signal is 2 bytes.Owing to have passed through complicated encoding operation, every road signal of output can be regarded as and independently be uniformly distributed pseudo random signal.
After generating equally distributed pseudo random number, just easily generate the pseudo-random noise signal of various distribution.Such as can produce and be uniformly distributed digital white noise signal, Gaussian distribution numeral white noise signal, also can produce other distributed digital loop noise signal, its average, variance, spectral density are adjustable.The circuit block diagram of other distribution pseudo random digital noise signal is converted to as shown in figure 11 by being uniformly distributed digital white noise signal.When generating other distributed digital loop noise signal, be uniformly distributed digital white noise signal becomes required distribution digital noise signal through look-up table conversion.Change the numerical value in look-up table, the distribution of digital noise signal, average, variance can be changed.When generating pseudorandom number white noise signal, the highest half being about circuit clock frequency of digital noise signal bandwidth of output.Every road is uniformly distributed digital white noise signal all through processing of circuit shown in Figure 11, can produce the pseudo-random noise signal of t road different distributions, average, variance.
Generate 8 pseudo random numbers for 32 longest linear feedback shift registers, the specific implementation of the high speed pseudo-random number generation method used in the present invention is described.Get primitive polynomial 1+x
2+ x
6+ x
7+ x
32, the circuit state of current time k is { Q [k] }, and its register value is Q
31[k], Q
30[k] ..., Q
1[k], Q
0[k], Q
32[k] is
Q
32[k]＝Q
30[k]⊕Q
26[k]⊕Q
25[k]⊕Q
0[k]
Then in stepping type, the circuit state { Q [k+8] } in k+8 moment is
Q
0[k+8]＝Q
8[k]
Q
1[k+8]＝Q
9[k]
...
Q
23[k+8]＝Q
31[k]
Q
24[k+8]＝Q
32[k]＝Q
30[k]⊕Q
26[k]⊕Q
25[k]⊕Q
0[k]
Q
25[k+8]＝Q
32[k+1]＝Q
30[k+1]⊕Q
26[k+1]⊕Q
25[k+1]⊕Q
0[k+1]
＝Q
31[k]⊕Q
27[k]⊕Q
26[k]⊕Q
1[k]
Q
26[k+8]＝Q
32[k+2]＝Q
30[k+2]⊕Q
26[k+2]⊕Q
25[k+2]⊕Q
0[k+2]
＝Q
32[k]⊕Q
28[k]⊕Q
27[k]⊕Q
2[k]
＝Q
30[k]⊕Q
28[k]⊕Q
27[k]⊕Q
26[k]⊕Q
25[k]⊕Q
2[k]⊕Q
0[k]
Q
27[k+8]＝Q
32[k+3]＝Q
30[k+3]⊕Q
26[k+3]⊕Q
25[k+3]⊕Q
0[k+3]
＝Q
32[k+1]⊕Q
29[k]⊕Q
28[k]⊕Q
3[k]
＝Q
31[k]⊕Q
29[k]⊕Q
28[k]⊕Q
27[k]⊕Q
26[k]⊕Q
3[k]⊕Q
1[k]
Q
28[k+8]＝Q
32[k+4]＝Q
30[k+4]⊕Q
26[k+4]⊕Q
25[k+4]⊕Q
0[k+4]
＝Q
32[k+2]⊕Q
30[k]⊕Q
29[k]⊕Q
4[k]＝Q
30[k]⊕Q
28[k]⊕Q
27[k]⊕Q
26[k]⊕Q
25[k]⊕Q
2[k]⊕Q
0[k]⊕Q
30[k]⊕Q
29[k]⊕Q
4[k]
＝Q
29[k]⊕Q
28[k]⊕Q
27[k]⊕Q
26[k]⊕Q
25[k]⊕Q
4[k]⊕Q
2[k]⊕Q
0[k]Q
29[k+8]＝Q
32[k+5]＝Q
30[k+5]⊕Q
26[k+5]⊕Q
25[k+5]⊕Q
0[k+5]
＝Q
32[k+3]⊕Q
31[k]⊕Q
30[k]⊕Q
5[k]
＝Q
30[k]⊕Q
29[k]⊕Q
28[k]⊕Q
27[k]⊕Q
26[k]⊕Q
5[k]⊕Q
3[k]⊕Q
1[k]Q
30[k+8]＝Q
32[k+6]＝Q
30[k+6]⊕Q
26[k+6]⊕Q
25[k+6]⊕Q
0[k+6]
＝Q
32[k+4]⊕Q
32[k]⊕Q
31[k]⊕Q
6[k]＝Q
29[k]⊕Q
28[k]⊕Q
27[k]⊕Q
26[k]⊕Q
25[k]⊕Q
4[k]⊕Q
2[k]⊕Q
0[k]⊕Q
30[k]⊕Q
26[k]⊕Q
25[k]⊕Q
0[k]⊕Q
31[k]⊕Q
6[k]
＝Q
31[k]⊕Q
30[k]⊕Q
29[k]⊕Q
28[k]⊕Q
27[k]⊕Q
6[k]⊕Q
4[k]⊕Q
2[k]Q
31[k+8]＝Q
32[k+7]＝Q
30[k+7]⊕Q
26[k+7]⊕Q
25[k+7]⊕Q
0[k+7]
＝Q
30[k+7]⊕Q
26[k+7]⊕Q
25[k+7]⊕Q
0[k+7]＝Q
32[k+5]⊕Q
32[k+1]⊕Q
32[k]⊕Q
7[k]＝Q
30[k]⊕Q
29[k]⊕Q
28[k]⊕Q
27[k]⊕Q
26[k]⊕Q
5[k]⊕Q
3[k]⊕Q
1[k]⊕Q
31[k]⊕Q
27[k]⊕Q
26[k]⊕Q
1[k]⊕Q
30[k]⊕Q
26[k]⊕Q
25[k]⊕Q
0[k]⊕Q
7[k]
＝Q
31[k]⊕Q
29[k]⊕Q
28[k]⊕Q
26[k]⊕Q
25[k]⊕Q
7[k]⊕Q
5[k]⊕Q
3[k]⊕Q
0[k]
Q
32[k+8]＝Q
30[k+8]⊕Q
26[k+8]⊕Q
25[k+8]⊕Q
0[k+8]
Derive above-mentioned various in, the circuit state in k+8 moment only depends on the circuit state in k moment.The parallel organization longest linear feedback shift register designed in this way often carrys out a clock, the internal state being just equivalent to original longest linear feedback shift register changes 8 times, the pseudo random number of 18 can be exported, improve the slow-footed shortcoming of Serial output method.Because 32 longest linear feedback shift registers have 2
32-1 state, it can not be divided exactly by 8, and therefore the cycle of 8 pseudo random numbers is 2
32-1.
The parallel organization feedback logic circuit of 31 longest linear feedback shift registers can be derived by identical method.To generate 8 pseudo random numbers, get primitive polynomial 1+x
3+ x
31, the circuit state of current time k is { Q [k] }, and its register value is Q
30[k], Q
29[k] ..., Q
1[k], Q
0[k], Q
31[k] is
Q
31[k]＝Q
28[k]⊕Q
0[k]
Then in stepping type, the circuit state { Q [k+8] } in k+8 moment is
Q
0[k+8]＝Q
8[k]
Q
1[k+8]＝Q
9[k]
...
Q
22[k+8]＝Q
30[k]
Q
23[k+8]＝Q
31[k]＝Q
28[k]⊕Q
0[k]
Q
24[k+8]＝Q
31[k+1]＝Q
28[k+1]⊕Q
0[k+1]
＝Q
29[k]⊕Q
1[k]
Q
25[k+8]＝Q
31[k+2]＝Q
28[k+2]⊕Q
0[k+2]
＝Q
30[k]⊕Q
2[k]
Q
26[k+8]＝Q
31[k+3]＝Q
28[k+3]⊕Q
0[k+3]
＝Q
28[k]⊕Q
3[k]⊕Q
0[k]
Q
27[k+8]＝Q
31[k+4]＝Q
28[k+4]⊕Q
0[k+4]
＝Q
31[k+1]⊕Q
4[k]＝Q
28[k+1]⊕Q
0[k+1]⊕Q
4[k]
＝Q
29[k]⊕Q
4[k]⊕Q
1[k]
Q
28[k+8]＝Q
31[k+5]＝Q
28[k+5]⊕Q
0[k+5]
＝Q
31[k+2]⊕Q
5[k]＝Q
28[k+2]⊕Q
0[k+2]⊕Q
5[k]
＝Q
30[k]⊕Q
5[k]⊕Q
2[k]
Q
29[k+8]＝Q
31[k+6]＝Q
28[k+6]⊕Q
0[k+6]
＝Q
31[k+3]⊕Q
6[k]＝Q
28[k+3]⊕Q
0[k+3]⊕Q
6[k]
＝Q
28[k]⊕Q
0[k]⊕Q
3[k]⊕Q
6[k]
＝Q
28[k]⊕Q
6[k]⊕Q
3[k]⊕Q
0[k]
Q
30[k+8]＝Q
31[k+7]＝Q
28[k+7]⊕Q
0[k+7]
＝Q
31[k+4]⊕Q
7[k]＝Q
28[k+4]⊕Q
0[k+4]⊕Q
7[k]
＝Q
31[k+1]⊕Q
4[k]⊕Q
7[k]＝Q
28[k+1]⊕Q
0[k+1]⊕Q
4[k]⊕Q
7[k]
＝Q
29[k]⊕Q
7[k]⊕Q
4[k]⊕Q
1[k]
Q
31[k+8]＝Q
28[k+8]⊕Q
0[k+8]＝Q
30[k]⊕Q
8[k]⊕Q
5[k]⊕Q
2[k]
Derive above-mentioned various in, the circuit state in k+8 moment only depends on the circuit state in k moment.The parallel organization longest linear feedback shift register designed in this way often carrys out a clock, the internal state being just equivalent to original longest linear feedback shift register changes 8 times, the pseudo random number of 18 can be exported, improve the slow-footed shortcoming of Serial output method.Because 31 longest linear feedback shift registers have 2
31-1 state, it can not be divided exactly by 8, and therefore the cycle of 8 pseudo random numbers is 2
31-1.
Below for the pseudorandom number generator of two circuit units, illustrate that one of the present invention is specifically implemented.Circuit block diagram as shown in figure 12.Pseudorandom number generator A is 32 bit parallel structure longest linear feedback shift registers, often carrys out a clock and exports one 8 pseudo random number A [k], selects primitive polynomial 1+x
2+ x
6+ x
7+ x
32, before its parallel organization feedback logic, did derivation.Pseudorandom number generator B is 31 bit parallel structure longest linear feedback shift registers, often carrys out a clock and exports one 8 pseudo random number B [k], selects primitive polynomial 1+x
3+ x
31, before its parallel organization feedback logic, did derivation.Pseudo random number A [k] and B [k] are connected in parallel, and generate 16 pseudo random number D [k].The sequence period of pseudo random number A [k] is 2
32-1.The sequence period of pseudo random number B [k] is 2
31-1, be a Mersenne Prime.The sequence period of pseudo random number D [k] is the lowest common multiple of the sequence period of pseudo random number A [k] and the sequence period of pseudo random number B [k], is (2
32-1) (2
31-1), 2 are about
63, greatly increase than the sequence period of A [k].The sequence period of pseudo random number is longer, and performance is more close to ideal random number.
Pseudo random signal D [k] sends into as shown in fig. 13 that after coding circuit, and what can generate very high-quality is uniformly distributed pseudo random signal, can be good at meeting every Randomness test, can be used for there is strict demand in the fields such as cryptography occasion to quality of random numbers.The sequence period exporting pseudo random signal is identical with the sequence period of pseudo random signal D [k], and the sequence period that the sequence period of each data bit all expands to pseudo random signal D [k] is identical, and the entropy of pseudo random signal obtains very big improvement.This coding circuit inputs 16 bit digital noise signals shown in Figure 12,64 bit digital noise signals after output encoder.The digital noise signal of input, through 16 to 256 data bit transition circuit, 16 of two-forty noise signal serioparallel exchange are become 256 noise signals of 1/16 speed, 256 noise signals of phase same rate are generated through SHA-256 coding circuit, again through 256 to 64 data bit transition circuit, 256 of 1/16 speed noise signal parallel-serial conversions are become 64 output noise signals of 1/4 speed.Multiphace clock generating circuit, by input clock signal frequency division, produces the 1/16 speed low-frequency clock signal on 16 tunnels, and phase input clock cycle of every road low-frequency clock signal, for serial-parallel conversion circuit.Multiphace clock generating circuit, by input clock signal frequency division, produces 1/4 speed clock signal, for 256 to 64 parallel-to-serial converters.8 bytes that scrambler exports are uniformly distributed pseudo random number, and be divided into 4 tunnel pseudo random number X [k], Y [k], Z [k], F [k] export simultaneously, every road is still for being uniformly distributed pseudo random number, and bit wide is 2 bytes.Figure 14 is output circuit emulation sequential chart, the input clock signal of CLK to be the cycle be 2ns, and its frequency is 500MHz; The cycle of the output clock CLKA of pseudo random number X [15..0], Y [15..0], Z [15..0], F [15..0] is 8ns, and its frequency is 125MHz.
Below for the pseudorandom number generator of three circuit units, illustrate that of the present invention another is specifically implemented.Circuit block diagram as shown in figure 15.Pseudorandom number generator A is 32 bit parallel structure longest linear feedback shift registers, often carrys out a clock and exports one 8 pseudo random number A [k], selects primitive polynomial 1+x
2+ x
6+ x
7+ x
32.Pseudorandom number generator B is 31 bit parallel structure longest linear feedback shift registers, and often carry out a clock and export one 8 pseudo random number B [k], its primitive polynomial is 1+x
3+ x
31.Pseudorandom number generator C is 19 bit parallel structure longest linear feedback shift registers, and often carry out a clock and export one 8 pseudo random number C [k], its primitive polynomial is 1+x+x
2+ x
5+ x
19, its parallel organization feedback logic can with reference to derivation method above.Pseudo random number A [k] is connected in parallel with B [k] and C [k], generates 24 pseudo random number D [k].The sequence period of pseudo random number A [k] is 2
32-1.The sequence period of pseudo random number B [k] is 2
31-1, be a Mersenne Prime.The sequence period of pseudo random number C [k] is 2
19-1, be a Mersenne Prime.The sequence period of pseudo random number D [k] is pseudo random number A [k] and the lowest common multiple of B [k] with the sequence period of C [k], is (2
32-1) (2
31-1) (2
19-1), 2 are about
82, greatly increase than the sequence period of A [k].Should illustrate, in this example, the exponent number of pseudorandom number generator A and pseudorandom number generator B and pseudorandom number generator C is selected to be arbitrary, as long as three is uncorrelated mutually.
After pseudo random signal D [k] sends into coding circuit as shown in figure 16, what can generate very high-quality is uniformly distributed pseudo random signal.The sequence period exporting pseudo random signal is identical with the sequence period of pseudo random signal D [k], and the sequence period that the sequence period of each data bit all expands to pseudo random signal D [k] is identical, and the entropy of pseudo random signal obtains very big improvement.This coding circuit inputs 24 bit digital noise signals shown in Figure 15,48 bit digital noise signals after output encoder.The digital noise signal of input, through 24 to 384 data bit transition circuit, 24 of two-forty noise signal serioparallel exchange are become 384 noise signals of 1/16 speed, 384 noise signals of phase same rate are generated through SHA-384 coding circuit, again through 384 to 48 data bit transition circuit, 384 of 1/16 speed noise signal parallel-serial conversions are become 48 output noise signals of 1/2 speed.Multiphace clock generating circuit, by input clock signal frequency division, produces the 1/16 speed low-frequency clock signal on 16 tunnels, and phase input clock cycle of every road low-frequency clock signal, for serial-parallel conversion circuit.Multiphace clock generating circuit, by input clock signal frequency division, produces 1/2 speed clock signal, for 384 to 48 parallel-to-serial converters.6 bytes that scrambler exports are uniformly distributed pseudo random number, and be divided into 3 tunnel pseudo random number X [k], Y [k], Z [k] exports simultaneously, every road is still for being uniformly distributed pseudo random number, and bit wide is 2 bytes.Figure 17 is output circuit emulation sequential chart, the input clock signal of CLK to be the cycle be 2ns, and its frequency is 500MHz; The cycle of the output clock CLKB of pseudo random number X [15..0], Y [15..0], Z [15..0] is 4ns, and its frequency is 250MHz.
The present invention can produce and be uniformly distributed digital white noise signal, Gaussian distribution numeral white noise signal, and also can produce other distributed digital loop noise signal, its average, variance are adjustable.
Produce the random number that probability density is f (x), its cumulative distribution function is F (x), has
When y is the uniform random number sequence between [0,1.0], x is the random number sequence that probability density is f (x).
In engineering practice, the random number range of generation is not from minus infinity to positive infinity, but a random number having figure place to limit.Therefore, the random number of actual certain distribution produced is similar to the one of the ideal random number of this distribution.Such as will produce the random number of 8, its numerical range is-128 ~ 127, produce the random number of 16, and its numerical range is-32768 ~ 32767.Obtain x value by y value to realize by a lut circuits.Look-up table is one and is searched the circuit obtaining exporting numerical value by input address values, generally realizes with RAM.
When generation is uniformly distributed digital white noise signal, learnt by above method, the numerical curve stored in look-up table is a straight oblique line.
When producing Gaussian distribution numeral white noise signal, as shown in figure 18, as shown in figure 19, the numerical curve stored in look-up table as shown in figure 20 for its cumulative distribution function curve for its probability density curve.
In order to upper method, the noise signal of other distribution can be produced.Generate different noise signals, only need on request, calculate the numerical curve in look-up table, carry out loading.
Pseudo random number or digital noise signal are sampled, sample sequence is set to { x
i, the average u of N number of sample is:
Variances sigma
2be equivalent to the power asking signal communication part, formula is:
When N value is larger, the average u of sample sequence, variances sigma
2can as an estimation of the true average of this noise signal, true variance, its error is very little.
Average be u, variance is σ
2noise signal sequence { x
ibe normalized into the noise signal sequence { y that average is 0, variance is 1
i, formula is:
With average be 0, variance be 1 noise signal sequence { x
istructure average is u, variance is σ
2noise signal sequence { y
i, formula is:
y
i＝u+σ*x
i
If the bandwidth of bandlimited white noise acoustical signal is B, average is 0, variance is σ
2, then its amplitude spectrum density is:
A(f)＝σ/B
Power spectrum density is:
P(f)＝σ
2/B
In order to upper method, can control to export average, the variance of digital noise signal, and the amplitude spectrum density of digital white noise signal or power spectrum density.
Use the method that high speed FPGA circuit realiration is discussed herein, input clock frequency can reach 500MHz, and exportable multichannel broadband pseudo random digital noise signal, meet causing the demand of multidimensional pseudo random digital noise signal, output clock frequency is higher than 100MHz.Use superfast digital circuit, the digital noise signal of exportable more high bandwidth.
Be to be understood that example as herein described and embodiment only in order to illustrate, those skilled in the art can make various amendment or change according to it, when not departing from Spirit Essence of the present invention, all belong to protection scope of the present invention.
Claims (2)
1. a hyperchannel pseudo random signal method for generation, is characterized in that: based on the N of parallel organization longest linear feedback shift register
aposition pseudorandom number generator A, what generate m position is uniformly distributed pseudo random number, is designated as A [k], take binary representation as A
m-1[k] A
m-2[k] ... A
1[k] A
0[k]; Based on the N of parallel organization
bthe pseudorandom number generator B of position longest linear feedback shift register, what generate m position is uniformly distributed pseudo random number, is designated as B [k], take binary representation as B
m-1[k] B
m-2[k] ... B
1[k] B
0[k]; Pseudo random number A [k] is in parallel with pseudo random number B [k], and generating 2m position pseudo random number D [k], take binary representation as D
2m-1[k] D
2m-2[k] ... D
1[k] D
0[k]; The pseudo random number B [k] that the pseudo random number A [k] requiring pseudorandom number generator A to generate and pseudorandom number generator B generate is uncorrelated, and namely the primitive polynomial of pseudorandom number generator A and the primitive polynomial of pseudorandom number generator B can not be mirror image primitive polynomials; Due to uncorrelated between pseudorandom number generator A and pseudorandom number generator B, each in the pseudo random number D [k] of generation is equally distributed, and therefore D [k] is that 2m position is uniformly distributed pseudo random number;
When m is even number, the sequence period of parallel organization pseudorandom number generator A is 2
nathe sequence period of-1, parallel organization pseudorandom number generator B is 2
nb-1; The sequence period of pseudo random number D [k] is the lowest common multiple of pseudorandom number generator A and B sequence period, and therefore the sequence period of pseudo random number D [k] obtains very big expansion.
2. a kind of hyperchannel pseudo random signal method for generation according to claim 1, is characterized in that: when adopting three groups of pseudorandom number generator circuit structures, based on the N of parallel organization longest linear feedback shift register
aposition pseudorandom number generator A, what generate m position is uniformly distributed pseudo random number, is designated as A [k]; Based on the N of parallel organization longest linear feedback shift register
bposition pseudorandom number generator B, what generate m position is uniformly distributed pseudo random number, is designated as B [k]; Based on the N of parallel organization longest linear feedback shift register
cposition pseudorandom number generator C, what generate m position is uniformly distributed pseudo random number, is designated as C [k]; A [k] is in parallel with C [k] with B [k], and what generate 3m position is uniformly distributed pseudo random number D [k]; Require that pseudorandom number generator A and pseudorandom number generator B and pseudorandom number generator C is uncorrelated mutually;
When m is even number, the sequence period of parallel organization pseudorandom number generator A is 2
nathe sequence period of-1, parallel organization pseudorandom number generator B is 2
nbthe sequence period of-1, parallel organization pseudorandom number generator C is 2
nc-1; The sequence period of pseudo random number D [k] is the lowest common multiple of pseudorandom number generator A and B and C sequence period, and therefore the sequence period of pseudo random number D [k] obtains very big expansion.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510492826.9A CN105159652A (en) | 2015-08-12 | 2015-08-12 | Multi-channel pseudo-random signal generation method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510492826.9A CN105159652A (en) | 2015-08-12 | 2015-08-12 | Multi-channel pseudo-random signal generation method |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN105159652A true CN105159652A (en) | 2015-12-16 |
Family
ID=54800520
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510492826.9A Pending CN105159652A (en) | 2015-08-12 | 2015-08-12 | Multi-channel pseudo-random signal generation method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105159652A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105929403A (en) * | 2016-07-15 | 2016-09-07 | 上海电机学院 | Pseudo code generating method based on automotive anti-collision radar |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1190830A (en) * | 1997-01-16 | 1998-08-19 | 日本电气株式会社 | Circuit for producing pseudorandom number and its application in data communication system |
| CN1914590A (en) * | 2004-01-30 | 2007-02-14 | 日本胜利株式会社 | Pseudo random number generation device and pseudo random number generation program |
| CN103440119A (en) * | 2013-07-08 | 2013-12-11 | 中国航空无线电电子研究所 | M sequence generator-based primitive polynomial pseudo-random sequence generator |
| US20140003805A1 (en) * | 2011-03-14 | 2014-01-02 | Indian Institute Of Technology Bombay | Methods for generating multi-level pseudo-random sequences |
| CN104113940A (en) * | 2013-04-18 | 2014-10-22 | 江苏博悦物联网技术有限公司 | Wireless sensor information transmission device and method for building and industrial control |
-
2015
- 2015-08-12 CN CN201510492826.9A patent/CN105159652A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1190830A (en) * | 1997-01-16 | 1998-08-19 | 日本电气株式会社 | Circuit for producing pseudorandom number and its application in data communication system |
| CN1914590A (en) * | 2004-01-30 | 2007-02-14 | 日本胜利株式会社 | Pseudo random number generation device and pseudo random number generation program |
| US20140003805A1 (en) * | 2011-03-14 | 2014-01-02 | Indian Institute Of Technology Bombay | Methods for generating multi-level pseudo-random sequences |
| CN104113940A (en) * | 2013-04-18 | 2014-10-22 | 江苏博悦物联网技术有限公司 | Wireless sensor information transmission device and method for building and industrial control |
| CN103440119A (en) * | 2013-07-08 | 2013-12-11 | 中国航空无线电电子研究所 | M sequence generator-based primitive polynomial pseudo-random sequence generator |
Non-Patent Citations (2)
| Title |
|---|
| 戴志平 等: "《SystemView数字通信系统仿真设计》", 31 August 2011, 北京邮电大学出版社 * |
| 王澜涛 等: "基于m序列的可重构线性反馈移位寄存器研究", 《电脑与信息技术》 * |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105929403A (en) * | 2016-07-15 | 2016-09-07 | 上海电机学院 | Pseudo code generating method based on automotive anti-collision radar |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105045561A (en) | Pseudo-random number generating method | |
| CN105138306A (en) | Generation method for pseudo-random signals with optional data bits | |
| CN100369404C (en) | Chaotic encipher series generator | |
| CN105183428A (en) | Pseudo-random signal generation method | |
| US8364977B2 (en) | Methods and systems for processing of n-state symbols with XOR and EQUALITY binary functions | |
| Fan et al. | Counteracting the dynamical degradation of digital chaos by applying stochastic jump of chaotic orbits | |
| CN105183427A (en) | Method for generating different-distribution high-speed noise signals | |
| CN204883682U (en) | Multichannel pseudo -random signal generator | |
| CN204856461U (en) | Optional pseudo -random signal generator of data bits | |
| WO2020014993A1 (en) | Fpga-based method for designing parallel pseudo-random sequence generator | |
| CN109683852B (en) | True random number generator | |
| Dubrova | Synthesis of parallel binary machines | |
| Mathukiya et al. | A Novel Approach for Parallel CRC generation for high speed application | |
| Suneel | Cryptographic pseudo-random sequences from the chaotic Hénon map | |
| CN105159652A (en) | Multi-channel pseudo-random signal generation method | |
| Thane et al. | Hardware design and implementation of pseudorandom number generator using piecewise linear chaotic map | |
| Michaels et al. | PRNG sequence combination techniques via Galois extension fields | |
| Yu et al. | Approximate divider design based on counting-based stochastic computing division | |
| Fúster-Sabater et al. | On the linear complexity of nonlinearly filtered PN-sequences | |
| CN111078191A (en) | Pseudo-random number generation method based on FPGA hardware implementation | |
| Choi et al. | Analysis of 90/150 CA Corresponding to the Power of Irreducible Polynomials. | |
| Ma et al. | A pseudo-random sequence generation scheme based on RNS and permutation polynomials | |
| RU2296427C1 (en) | Method for stream encoding of discontinuous information | |
| Jonatan et al. | Gaussian Pseudo-Random Number Generator using LFSR's Rotation and Split | |
| PV et al. | Design and implementation of efficient stochastic number generator |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20151216 |