CN103812596A - Pseudo random sequence generation method and apparatus - Google Patents

Pseudo random sequence generation method and apparatus Download PDF

Info

Publication number
CN103812596A
CN103812596A CN201210445879.1A CN201210445879A CN103812596A CN 103812596 A CN103812596 A CN 103812596A CN 201210445879 A CN201210445879 A CN 201210445879A CN 103812596 A CN103812596 A CN 103812596A
Authority
CN
China
Prior art keywords
random sequence
pseudo random
sequence
reduced form
generation
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN201210445879.1A
Other languages
Chinese (zh)
Other versions
CN103812596B (en
Inventor
徐兵
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Leadcore Technology Co Ltd
Original Assignee
Leadcore Technology Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Leadcore Technology Co Ltd filed Critical Leadcore Technology Co Ltd
Priority to CN201210445879.1A priority Critical patent/CN103812596B/en
Publication of CN103812596A publication Critical patent/CN103812596A/en
Application granted granted Critical
Publication of CN103812596B publication Critical patent/CN103812596B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Landscapes

  • Mobile Radio Communication Systems (AREA)
  • Tests Of Electronic Circuits (AREA)

Abstract

The invention relates to the technical field f wireless communications, and discloses a pseudo random sequence generation method and apparatus. In the invention, the method comprises: by use of the generation relation of a first m sequence, performing recursion on a first pseudo random sequence x1(n+D), obtaining a simplification form of the x1(n+D), which is expressed by using the mode 2 sum of x1(n), x1(n+1),..., x1(n+T1), and generating a first pseudo random sequence such that original data after multiple times of recycling can be directly obtained, there is no need to generate useless data firstly, the generation of a pseudo random sequence is more rapid, the processing time delay is reduced, and the parallel calculating is facilitated.

Description

The generation method and apparatus of pseudo random sequence
Technical field
The present invention relates to wireless communication technology field, particularly the generation method and apparatus of pseudo random sequence.
Background technology
Pseudo random sequence is the sequence with similar random noise statistical property, and can repeat to produce and process, avoid random noise to be difficult to repeat the shortcoming of generation, therefore in various communication systems, obtain a wide range of applications, be generally used for as the scrambler of community, scrambler, the pilot tone etc. of terminal, carry out randomize interference or as training sequence.Third generation partner program Long Term Evolution (3rd Generation Partnership Project Long Term Evolution, be called for short " 3GPP LTE ") be accurate 4G mobile communication technology, the target of this project is to realize higher data rate, shorter time delay, lower cost, higher power system capacity and improved coverage.With pseudo random sequence generating reference signal, scrambler, frequency pattern etc., purposes is very extensive.Other communication systems such as WCDMA are also similar, are introduced below as an example of LTE example.
Pseudo random sequence has multiple, comprises m sequence, Gold sequence, quadratic residue sequence etc., and wherein Gold sequence is a kind of code sequence based on m sequence that RGold proposes.In 3GPP LTE standard, Gold pseudo random sequence is to be added by the corresponding position of two m sequences the code sequence that mould 2 obtains, wherein, m sequence has sharp-pointed autocorrelation performance, and code element is in a basic balance, complexity is little, is generally to utilize the generation that is shifted by turn of linear displacement feedback register; And Gold sequence has good auto-correlation and cross correlation, and simple structure, the sequence number of generation is many, thereby obtains application widely.In 3GPP LTE standard, pseudo random sequence c (n) generates according to following formula:
c(n)=(x 1(n+N C)+x 2(n+N C))mod2
x 1(n+31)=(x 1(n+3)+x 1(n))mod2
x 2(n+31)=(x 2(n+3)+x 2(n+2)+x 2(n+1)+x 2(n))mod2
Wherein, N c=1600, sequence x 1(n), n=0,1,2 ..., 30 and x 2(n), n=0,1,2 ..., 30 difference initialization are as follows:
x 1(0)=1,x 1(n)=0,n=1,2,...,30
c init = Σ i = 0 30 x 2 ( i ) · 2 i
Can find out that Gold sequence has two m sequence shifter-adders to obtain, conventional generation method and apparatus as shown in Figure 1.Wherein box indicating shift register, arranges N in LTE c=1600 object is mainly in order to allow sequence randomization as far as possible, utilizes said apparatus to generate pseudo random sequence, can obtain just first will generate the pseudo random sequence that needs after 1600 hashes at every turn.Generating afterwards random sequence also can only one claps and progressively generates this sequence.For LTE system, in each subframe, need the such pseudo random sequence of generated many groups, the initial condition difference of each group sequence, i.e. c initdifferent (c initmay follow subframe numbers, notation index, channel type to have relation, the pseudo random sequence that everywhere is used), cannot be multiplexing, therefore all must regenerate at every turn.
If therefore adopt said apparatus to carry out pseudo random sequence generation, will be more time-consuming, if simultaneously for hardware or distributed system, if in order to reduce processing delay, may need to consider to carry out parallel computation, but the above-mentioned code generating method of disturbing can only adopt the method that serial generates to generate for each group pseudo random sequence, this has limited other places that need to use scrambler and has carried out parallel computation, for example terminal considers PDSCH piecemeal to carry out parallel processing, but scrambler sequence cannot be supported parallel processing, a kind of consideration method is that then generated scrambler stores in advance, during for parallel computation, but scrambler is not fixed as previously described, initial condition itself just has certain randomness, storage is by the very large memory space of needs, cost is too large.
Summary of the invention
The object of the present invention is to provide a kind of generation method and apparatus of pseudo random sequence, make to generate quickly pseudo random sequence.
For solving the problems of the technologies described above, embodiments of the present invention provide a kind of generation method of pseudo random sequence, comprise following steps:
Adopt the generation relation of a m sequence, to the first pseudo random sequence x 1(n+D) carry out recursion, obtain described x 1(n+D) use x 1(n), x 1(n+1) ..., x 1(n+T 1) mould 2 add the reduced form of expression: x 1 ( n + D ) = ( a T 1 x 1 ( n + T 1 ) + a T 1 - 1 x 1 ( n + T 1 - 1 ) + · · · + a 0 x 1 ( n ) ) mod 2 ; Wherein, coefficient a i∈ 0,1}, and i=0,1,2,3 ... T 1; Described n is random natural number;
By described x 1(n+D) a in reduced form igetting 0 item number removes;
According to described removal a iget the x obtaining after 0 item number 1(n+D), generate described the first pseudo random sequence.
Embodiments of the present invention also provide a kind of generating apparatus of pseudo random sequence, comprise:
The first pseudo random sequence generator, for according to the first pseudo random sequence x 1(n+D) use x 1(n), x 1(n+1) ..., x 1(n+T 1) mould 2 add the reduced form of expression x 1 ( n + D ) = ( a T 1 x 1 ( n + T 1 ) + a T 1 - 1 x 1 ( n + T 1 - 1 ) + · · · + a 0 x 1 ( n ) ) mod 2 , And by described x 1(n+D) a in reduced form iget 0 item number and remove, generate described the first pseudo random sequence; Wherein, described x 1(n+D) reduced form adopts the generation relation of a m sequence to carry out recursion and obtains; In formula, coefficient a i∈ 0,1}, and i=0,1,2,3 ... T 1; Described n is random natural number.
Embodiment of the present invention in terms of existing technologies, by adopting the generation relation of a m sequence, to the first pseudo random sequence x 1(n+D) carry out recursion, obtain x 1(n+D) use x 1(n), x 1(n+1) ..., x 1(n+T 1) mould 2 add the reduced form of expression, generate the first pseudo random sequence, can directly obtain the data after original repeatedly circulation, do not need first to generate hash, make to generate quickly pseudo random sequence, reduce processing delay, be conducive to parallel computation.
In addition, according to described removal a iget the x obtaining after 0 item number 1(n+D),, before generating the step of described the first pseudo random sequence, also comprise following steps:
Adopt the generation relation of the 2nd m sequence, to the second pseudo random sequence x 2(n+D) carry out recursion, obtain described x 2(n+D) use x 2(n), x 2(n+1) ..., x 2(n+T 2) mould 2 add the reduced form of expression: x 2 ( n + D ) = ( b T 2 x 2 ( n + T 2 ) + b T 2 - 1 x 2 ( n + T 2 - 1 ) + · · · + b 0 x 2 ( n ) ) mod 2 ; Wherein, coefficient b j∈ 0,1}, and j=0,1,2,3 ... T 2;
By described x 2(n+D) b in reduced form jgetting 0 item number removes;
According to described removal a iget the x obtaining after 0 item number 1(n+D), generate in the step of described the first pseudo random sequence, also comprise following sub-step:
According to described removal b jget the x obtaining after 0 item number 2(n+D), generate described the second pseudo random sequence;
According to described removal a iget the x obtaining after 0 item number 1(n+D),, after generating the step of described the first pseudo random sequence, also comprise following steps:
The first pseudo random sequence of described generation and the second pseudo random sequence exclusive-OR that is shifted is generated to Gold sequence c (n), and the expression of described c (n) is c (n)=(x 1(n+D)+x 2(n+D)) mod2.
While adopting two m sequences to generate Gold sequence, also can recursion obtain the reduced representation form of each m sequence, thereby generate Gold sequence, can further reduce processing delay, be conducive to parallel computation, make to generate quickly pseudo random sequence.
In addition, also comprise following steps:
In advance long pseudo-random sequence is divided into the m section of every section of N data, use c (n+N), c (n+2N) ..., c (n+mN) represent, wherein, described n=0,1 ..., N-1;
Obtaining described x 1(n+D) use x 1(n), x 1(n+1) ..., x 1(n+T 1) mould 2 add in the step of reduced form of expression, also comprise following sub-step:
Adopt the generation relation of a m sequence, will be used for generating described c (n+N), c (n+2N) ..., c (n+mN) the first pseudo random sequence x 1(n+D) carry out recursion, obtain described c (n+N), c (n+2N) ..., x in c (n+mN) 1(n+D) use x 1(n), x 1(n+1) ..., x 1(n+T 1) mould 2 add the reduced form of expression;
By described x 1(n+D) a in reduced form iget in the step that 0 item number removes, also comprise following sub-step:
By described c (n+N), c (n+2N) ..., x in c (n+mN) 1(n+D) a in reduced form igetting 0 item number removes;
Obtaining described x 2(n+D) use x 2(n), x 2(n+1) ..., x 2(n+T 2) mould 2 add in the step of reduced form of expression, also comprise following sub-step:
Adopt the generation relation of the 2nd m sequence, will be used for generating described c (n+N), c (n+2N) ..., c (n+mN) the second pseudo random sequence x 2(n+D) carry out recursion, obtain described c (n+N), c (n+2N) ..., x in c (n+mN) 2(n+D) use x 2(n), x 2(n+1) ..., x 2(n+T 2) mould 2 add the reduced form of expression;
By described x 2(n+D) b in reduced form jget in the step that 0 item number removes, also comprise following sub-step:
By described c (n+N), c (n+2N) ..., x in c (n+mN) 2(n+D) b in reduced form jgetting 0 item number removes;
Generate in the step of described pseudo random sequence c (n) at exclusive-OR that the first pseudo random sequence of described generation and the second pseudo random sequence are shifted, also comprise following sub-step:
Parallel generation Gold sequence c (n+N), c (n+2N) ..., c (n+mN), obtain described long pseudo-random sequence.
By by long pseudo-random sequence segmentation parallel generation, can further accelerate the generation of pseudo random sequence.
Accompanying drawing explanation
Fig. 1 is the principle schematic of existing pseudo random sequence generation method;
Fig. 2 is according to the flow chart of the pseudo random sequence generation method of first embodiment of the invention;
Fig. 3 is according to the flow chart of the pseudo random sequence generation method of second embodiment of the invention;
Fig. 4 is according to the flow chart of the pseudo random sequence generation method of third embodiment of the invention;
Fig. 5 is according to the schematic diagram of the pseudo random sequence generating apparatus of four embodiment of the invention;
Fig. 6 realizes schematic diagram according to the pseudo random sequence generating apparatus of fifth embodiment of the invention in LTE system;
Fig. 7 is according to the schematic diagram of the pseudo random sequence generating apparatus of sixth embodiment of the invention.
embodiment
For making the object, technical solutions and advantages of the present invention clearer, below in conjunction with accompanying drawing, the embodiments of the present invention are explained in detail.But, persons of ordinary skill in the art may appreciate that in the each execution mode of the present invention, in order to make reader understand the application better, many ins and outs are proposed.But, even without these ins and outs and the many variations based on following execution mode and modification, also can realize the each claim of the application technical scheme required for protection.
The first execution mode of the present invention relates to a kind of generation method of pseudo random sequence, and idiographic flow as shown in Figure 2, comprises following steps:
Step 201, the generation relation of employing the one m sequence, to the first pseudo random sequence x 1(n+D) carry out recursion, obtain x 1(n+D) use x 1(n), x 1(n+1) ..., x 1(n+T 1) mould 2 add the reduced form of expression:
x 1 ( n + D ) = ( a T 1 x 1 ( n + T 1 ) + a T 1 - 1 x 1 ( n + T 1 - 1 ) + · · · + a 0 x 1 ( n ) ) mod 2 ;
Wherein, coefficient a i∈ 0,1}, and i=0,1,2,3 ... T 1; N is random natural number.
Step 202, by x 1(n+D) a in reduced form igetting 0 item number removes.
In LTE standard or WCDMA standard, and the generation relation of a m sequence all has deterministic expression, correspondingly, and T 1also there is determined value with the value of D, refer to relevant criterion, do not repeat them here.Describe with LTE standard below.
The generation relation of the one m sequence can be x 1(n+31)=(x 1(n+3)+x 1(n)) mod2, in fact this generation relation has described a kind of recurrence relation, can be equivalent to:
x 1(n+D)=(x 1(n+D-28)+x 1(n+D-31))mod2,D≥31，
Recursion so always, because all additions are all that mould 2 adds, can obtain x 1(n+D) use x 1(n), x 1(n+1) ..., x 1(n+30) form that mould 2 adds, as follows:
x 1(n+D)=(x 1(n+D-28)+x 1(n+D-31))mod2
=(x 1(n+D-28-28)+x 1(n+D-28-31))mod2+(x 1(n+D-31-28)+x 1(n+D-31-31))mod2
=(x 1(n+D-28*2)+x 1(n+D-31*2))mod2
...
=(a 30x 1(n+30)+a 29x 1(n+29)+…+a 0x 1(n))mod2
Wherein, coefficient a i∈ { 0,1}.
In order to allow sequence randomization as far as possible, D can get 1600.
Generation by a m sequence is related to x 1(n+31)=(x 1(n+3)+x 1(n)) mod2 rewrites
x 1(n+31)=(x 1(n+3)+x 1(n))mod2
=(x 1(n+3-31+31)+x 1(n-31+31))mod2
=(x 1(n-25)+x 1(n-28))mod2+(x 1(n-28)+x 1(n-31))mod2 （1.1）
=(x 1(n-25)+x 1(n-31))mod2
...
Same:
x 1(n)=(x 1(n-28)+x 1(n-31))mod2
=(x 1(n-28-28)+x 1(n-28-31))mod2+(x 1(n-31-28)+x 1(n-31-31))mod2
=(x 1(n-28*2)+x 1(n-31*2))mod2 （1.2）
=(x 1(n-28*4)+x 1(n-31*4))mod2
...
Comprehensive 1.1 and 1.2 formulas, recursion is gone down always, can obtain x 1(n+1600) calculating formula is:
x 1 ( n + 1600 ) = x 1 ( n + 25 ) + x 1 ( n + 20 ) + x 1 ( n + 19 ) + x 1 ( n + 17 ) + x 1 ( n + 12 ) + x 1 ( n + 9 ) + x 1 ( n + 6 ) + x 1 ( n + 5 ) + x 1 ( n + 4 ) + x 1 ( n + 3 ) + x 1 ( n + 1 ) mod 2 .
Step 203, according to removing a iget the x obtaining after 0 item number 1(n+D), generate the first pseudo random sequence.
Compared with prior art, present embodiment is by adopting the generation relation of a m sequence, to the first pseudo random sequence x 1(n+D) carry out recursion, obtain x 1(n+D) use x 1(n), x 1(n+1) ..., x 1(n+T 1) mould 2 add the reduced form of expression, generate the first pseudo random sequence, can directly obtain the data after original repeatedly circulation, do not need first to generate hash, make to generate quickly pseudo random sequence, reduce processing delay, be conducive to parallel computation.
The second execution mode of the present invention relates to a kind of generation method of pseudo random sequence.The second execution mode has been done further improvement on the first execution mode basis, main improvements are: in second embodiment of the invention, while adopting two m sequences to generate Gold sequence, also can recursion obtain the reduced representation form of each m sequence, thereby generate Gold sequence, can further reduce processing delay, be conducive to parallel computation, make to generate quickly pseudo random sequence.
Specifically, as shown in Figure 3, comprise following steps:
Step 301 to 302 with step 201 similar to step 202, recursion obtains the first pseudo random sequence x 1(n+D) reduced form, and remove wherein coefficient and get 0 item, do not repeat them here.
Step 303, the generation relation of employing the 2nd m sequence, to the second pseudo random sequence x 2(n+D) carry out recursion, obtain described x 2(n+D) use x 2(n), x 2(n+1) ..., x 2(n+T 2) mould 2 add the reduced form of expression: x 2 ( n + D ) = ( b T 2 x 2 ( n + T 2 ) + b T 2 - 1 x 2 ( n + T 2 - 1 ) + · · · + b 0 x 2 ( n ) ) mod 2 ; Wherein, coefficient b j∈ 0,1}, and j=0,1,2,3 ... T 2.
Step 304, by described x 2(n+D) b in reduced form jgetting 0 item number removes.
Step 303 to 304 in, recursion obtains the second pseudo random sequence x 2(n+D) reduced form, and remove wherein coefficient and get 0 item, with similar in the first execution mode, T 2determine according to the regulation of Long Term Evolution LTE standard or Wideband Code Division Multiple Access (WCDMA) WCDMA standard.Take LTE system as example, the generation of the 2nd m sequence is closed and is:
x 2(n+31)=(x 2(n+3)+x 2(n+2)+x 2(n+1)+x 2(n))mod2
Carry out recursion, obtain x 2(n+1600) calculating formula is:
x 2 ( n + 1600 ) = x 2 ( n + 23 ) + x 2 ( n + 20 ) + x 2 ( n + 19 ) + x 2 ( n + 16 ) + x 2 ( n + 12 ) + x 2 ( n + 8 ) + x 2 ( n + 3 ) + x 2 ( n + 2 ) + x 2 ( n + 1 ) mod 2
Obtain the reduced form of the first pseudo random sequence and the second pseudo random sequence in recursion, and remove after coefficient gets 0 item, execution step 305 and 306, generates the first pseudo random sequence and the second pseudo random sequence.
Specifically, step 305, according to removing a iget the x obtaining after 0 item number 1(n+D), generate the first pseudo random sequence;
Step 306, according to removing b jget the x obtaining after 0 item number 2(n+D), generate the second pseudo random sequence.
Then, in step 307, by generate the first pseudo random sequence and the second pseudo random sequence be shifted exclusive-OR generate Gold sequence c (n), wherein, the expression of c (n) is c (n)=(x 1(n+D)+x 2(n+D)) mod2.
From above-mentioned steps, in the time adopting two m sequences to generate Gold sequence, can first recursion obtain the reduced representation form of each m sequence, exclusive-OR is again shifted two m sequences, thereby generate Gold sequence, can further reduce processing delay, be conducive to parallel computation, make to generate quickly pseudo random sequence.
The 3rd execution mode of the present invention relates to a kind of generation method of pseudo random sequence.The 3rd execution mode has been done further improvement on the second execution mode basis, and main improvements are: in third embodiment of the invention, by by long pseudo-random sequence segmentation parallel generation, can further accelerate the generation of pseudo random sequence.
Specifically, as shown in Figure 4, comprise following steps:
Step 401, is divided into long pseudo-random sequence the m section of every section of N data in advance, with c (n+N), c (n+2N) ..., c (n+mN) represent, wherein, n=0,1 ..., N-1.
Step 402, adopts the generation relation of a m sequence, will be used for generating c (n+N), c (n+2N) ..., c (n+mN) the first pseudo random sequence x 1(n+D) carry out recursion, obtain c (n+N), c (n+2N) ..., x in c (n+mN) 1(n+D) use x 1(n), x 1(n+1) ..., x 1(n+30) mould 2 adds the reduced form of expression; Similar with step 301, do not repeat them here.
Step 403, by c (n+N), c (n+2N) ..., x in c (n+mN) 1(n+D) a in reduced form igetting 0 item number removes; Similar with step 302, do not repeat them here.
Step 404, adopts the generation relation of the 2nd m sequence, will be used for generating c (n+N), c (n+2N) ..., c (n+mN) the second pseudo random sequence x 2(n+D) carry out recursion, obtain c (n+N), c (n+2N) ..., x in c (n+mN) 2(n+D) use x 2(n), x 2(n+1) ..., x 2(n+30) mould 2 adds the reduced form of expression; Similar with step 303, do not repeat them here.
Step 405, by c (n+N), c (n+2N) ..., x in c (n+mN) 2(n+D) b in reduced form jgetting 0 item number removes; Similar with step 304, do not repeat them here.
Step 406, parallel generation Gold sequence c (n+N), c (n+2N) ..., c (n+mN), obtain long pseudo-random sequence.
In the data to longer need to walk abreast descrambling or similar operations, while needing the scrambler of the each segment data of parallel generation, adopt present embodiment can reduce processing delay, generate quickly long pseudo-random sequence.
The step of the whole bag of tricks is divided above, just in order being described clearly, can to merge into a step or some step is split while realization, is decomposed into multiple steps, as long as comprise identical logical relation, all in the protection range of this patent; To adding inessential modification in algorithm or in flow process or introducing inessential design, but the core design that does not change its algorithm and flow process is all in the protection range of this patent.
Four embodiment of the invention relates to a kind of generating apparatus of pseudo random sequence, comprises:
The first pseudo random sequence generator, for according to the first pseudo random sequence x 1(n+D) use x 1(n), x 1(n+1) ..., x 1(n+T 1) mould 2 add the reduced form of expression x 1 ( n + D ) = ( a T 1 x 1 ( n + T 1 ) + a T 1 - 1 x 1 ( n + T 1 - 1 ) + · · · + a 0 x 1 ( n ) ) mod 2 , And by x 1(n+D) a in reduced form iget 0 item number and remove, generate the first pseudo random sequence; Wherein, x 1(n+D) reduced form adopts the generation relation of a m sequence to carry out recursion and obtains; In formula, coefficient a i∈ 0,1}, and i=0,1,2,3 ... T 1; N is random natural number.
Take LTE system as example, as shown in Figure 5, in figure, box indicating shift register, in First ray maker, by i=1,3,4,5,6,9,12,17,19, the result output that exclusive-OR is carried out in the output of 20,23 these 11 registers is the first pseudo random sequence.
Be not difficult to find, present embodiment is the system embodiment corresponding with the first execution mode, present embodiment can with the enforcement of working in coordination of the first execution mode.The correlation technique details of mentioning in the first execution mode is still effective in the present embodiment, in order to reduce repetition, repeats no more here.Correspondingly, the correlation technique details of mentioning in present embodiment also can be applicable in the first execution mode.
It is worth mentioning that, each module involved in present embodiment is logic module, and in actual applications, a logical block can be a physical location, can be also a part for a physical location, can also realize with the combination of multiple physical locations.In addition, for outstanding innovation part of the present invention, in present embodiment, the unit not too close with solving technical problem relation proposed by the invention do not introduced, but this does not show not exist in present embodiment other unit.
Fifth embodiment of the invention relates to a kind of generating apparatus of pseudo random sequence.The 5th execution mode has done further improvement on the 4th execution mode basis, main improvements are: in fifth embodiment of the invention, while adopting two m sequences to generate Gold sequence, also adopt two pseudo random sequence generators, by the Output rusults displacement exclusive-OR of two pseudo random sequences, generate Gold sequence, can further reduce processing delay, be conducive to parallel computation, make to generate quickly pseudo random sequence.
Specifically, on the first execution mode basis, also comprise the second pseudo random sequence generator, for according to the second pseudo random sequence x 2(n+D) use x 2(n), x 2(n+1) ..., x 2(n+T 2) mould 2 add the reduced form of expression x 2 ( n + D ) = ( b T 2 x 2 ( n + T 2 ) + b T 2 - 1 x 2 ( n + T 2 - 1 ) + · · · + b 0 x 2 ( n ) ) mod 2 , And by x 2(n+D) b in reduced form jget 0 item number and remove, generate the second pseudo random sequence; Wherein, x 2(n+D) reduced form adopts the generation relation of the 2nd m sequence to carry out recursion and obtains; In formula, coefficient b j∈ 0,1}, and j=0,1,2,3 ... T 2;
Adder, for the first pseudo random sequence generating and the second pseudo random sequence exclusive-OR that is shifted are obtained to Gold sequence c (n), wherein, the expression of c (n) is c (n)=(x 1(n+D)+x 2(n+D)) mod2.
Take LTE system as example, the calculating formula that First ray maker adopts is:
x 1 ( n + 1600 ) = x 1 ( n + 25 ) + x 1 ( n + 20 ) + x 1 ( n + 19 ) + x 1 ( n + 17 ) + x 1 ( n + 12 ) + x 1 ( n + 9 ) + x 1 ( n + 6 ) + x 1 ( n + 5 ) + x 1 ( n + 4 ) + x 1 ( n + 3 ) + x 1 ( n + 1 ) mod 2 ;
The calculating formula that the second sequence generator adopts is:
x 2 ( n + 1600 ) = x 2 ( n + 23 ) + x 2 ( n + 20 ) + x 2 ( n + 19 ) + x 2 ( n + 16 ) + x 2 ( n + 12 ) + x 2 ( n + 8 ) + x 2 ( n + 3 ) + x 2 ( n + 2 ) + x 2 ( n + 1 ) mod 2 ;
According to above-mentioned two calculating formulas, can obtain random sequence generator new in LTE as shown in Figure 6, in figure, box indicating shift register, in First ray maker, by i=1,3,4,5,6,9,12,17, the output of 19,20,23 these 11 registers is carried out the result of exclusive-OR and is exported to adder; In the second sequence generator by j=1,2,3,8,12, the output of 16,19,20,23 these 9 registers is carried out the result of exclusive-OR and is exported to adder, two output displacement exclusive-OR are obtained required Gold sequence by adder.
Be not difficult to find, present embodiment is the system embodiment corresponding with the second execution mode, present embodiment can with the enforcement of working in coordination of the second execution mode.The correlation technique details of mentioning in the second execution mode is still effective in the present embodiment, in order to reduce repetition, repeats no more here.Correspondingly, the correlation technique details of mentioning in present embodiment also can be applicable in the second execution mode.
Sixth embodiment of the invention relates to a kind of generating apparatus of pseudo random sequence.The 6th execution mode has done further improvement on the 5th execution mode basis, main improvements are: in sixth embodiment of the invention, by by long pseudo-random sequence segmentation, and build several pseudo random sequence generators, generate the pseudo random sequence of segmentation simultaneously, can parallel generation long pseudo-random sequence, further accelerate the generation of pseudo random sequence.
Specifically, present embodiment comprises deserializer, in advance long pseudo-random sequence being divided into the m section of every section of N data, use c (n+N), c (n+2N) ..., c (n+mN) represent, n=0,1 ..., N-1;
M segmentation pseudo random sequence generator, as shown in Figure 7, for parallel generation pseudo random sequence c (n+N), c (n+2N) ..., c (n+mN), obtain long pseudo-random sequence;
Each segmentation pseudo random sequence generator comprises First ray maker, the second sequence generator and adder;
Wherein, the calculating formula that First ray maker adopts is respectively to adopt the generation relation of a m sequence, will be used for generating c (n+N), c (n+2N) ..., c (n+mN) the first pseudo random sequence x 1(n+D) carry out recursion, obtain c (n+N), c (n+2N) ..., x in c (n+mN) 1(n+D) use x 1(n), x 1(n+1) ..., x 1(n+T 1) mould 2 add the reduced form of expression, and remove a iget 0 item number, the calculating formula obtaining;
The calculating formula that the second sequence generator adopts is respectively to adopt the generation relation of the 2nd m sequence, will be used for generating c (n+N), c (n+2N) ..., c (n+mN) the second pseudo random sequence x 2(n+D) carry out recursion, obtain c (n+N), c (n+2N) ..., x in c (n+mN) 2(n+D) use x 2(n), x 2(n+1) ..., x 2(n+T 2) mould 2 add the reduced form of expression, and remove b jget 0 item number, the calculating formula obtaining.
Because the 3rd execution mode is mutually corresponding with present embodiment, therefore present embodiment can with the enforcement of working in coordination of the 3rd execution mode.The correlation technique details of mentioning in the 3rd execution mode is still effective in the present embodiment, and the technique effect that can reach in the 3rd execution mode can be realized in the present embodiment too, in order to reduce repetition, repeats no more here.Correspondingly, the correlation technique details of mentioning in present embodiment also can be applicable in the 3rd execution mode.
Persons of ordinary skill in the art may appreciate that the respective embodiments described above are to realize specific embodiments of the invention, and in actual applications, can do various changes to it in the form and details, and without departing from the spirit and scope of the present invention.

Claims (7)

1. a generation method for pseudo random sequence, is characterized in that, comprises following steps:
Adopt the generation relation of a m sequence, to the first pseudo random sequence x 1(n+D) carry out recursion, obtain described x 1(n+D) use x 1(n), x 1(n+1) ..., x 1(n+T 1) mould 2 add the reduced form of expression: x 1 ( n + D ) = ( a T 1 x 1 ( n + T 1 ) + a T 1 - 1 x 1 ( n + T 1 - 1 ) + · · · + a 0 x 1 ( n ) ) mod 2 ; Wherein, coefficient a i∈ 0,1}, and i=0,1,2,3 ... T 1; Described n is random natural number;
By described x 1(n+D) a in reduced form igetting 0 item number removes;
According to described removal a iget the x obtaining after 0 item number 1(n+D), generate described the first pseudo random sequence.
2. the generation method of pseudo random sequence according to claim 1, is characterized in that, according to described removal a iget the x obtaining after 0 item number 1(n+D),, before generating the step of described the first pseudo random sequence, also comprise following steps:
Adopt the generation relation of the 2nd m sequence, to the second pseudo random sequence x 2(n+D) carry out recursion, obtain described x 2(n+D) use x 2(n), x 2(n+1) ..., x 2(n+T 2) mould 2 add the reduced form of expression: x 2 ( n + D ) = ( b T 2 x 2 ( n + T 2 ) + b T 2 - 1 x 2 ( n + T 2 - 1 ) + · · · + b 0 x 2 ( n ) ) mod 2 ; Wherein, coefficient b j∈ 0,1}, and j=0,1,2,3 ... T 2;
By described x 2(n+D) b in reduced form jgetting 0 item number removes;
According to described removal a iget the x obtaining after 0 item number 1(n+D), generate in the step of described the first pseudo random sequence, also comprise following sub-step:
According to described removal b jget the x obtaining after 0 item number 2(n+D), generate described the second pseudo random sequence;
According to described removal a iget the x obtaining after 0 item number 1(n+D),, after generating the step of described the first pseudo random sequence, also comprise following steps:
The first pseudo random sequence of described generation and the second pseudo random sequence exclusive-OR that is shifted is generated to Gold sequence c (n), and the expression of described c (n) is c (n)=(x 1(n+D)+x 2(n+D)) mod2.
3. the generation method of pseudo random sequence according to claim 2, is characterized in that, also comprises following steps:
In advance long pseudo-random sequence is divided into the m section of every section of N data, use c (n+N), c (n+2N) ..., c (n+mN) represent, wherein, described n=0,1 ..., N-1;
Obtaining described x 1(n+D) use x 1(n), x 1(n+1) ..., x 1(n+T 1) mould 2 add in the step of reduced form of expression, also comprise following sub-step:
Adopt the generation relation of a m sequence, will be used for generating described c (n+N), c (n+2N) ..., c (n+mN) the first pseudo random sequence x 1(n+D) carry out recursion, obtain described c (n+N), c (n+2N) ..., x in c (n+mN) 1(n+D) use x 1(n), x 1(n+1) ..., x 1(n+T 1) mould 2 add the reduced form of expression;
By described x 1(n+D) a in reduced form iget in the step that 0 item number removes, also comprise following sub-step:
By described c (n+N), c (n+2N) ..., x in c (n+mN) 1(n+D) a in reduced form igetting 0 item number removes;
Obtaining described x 2(n+D) use x 2(n), x 2(n+1) ..., x 2(n+T 2) mould 2 add in the step of reduced form of expression, also comprise following sub-step:
Adopt the generation relation of the 2nd m sequence, will be used for generating described c (n+N), c (n+2N) ..., c (n+mN) the second pseudo random sequence x 2(n+D) carry out recursion, obtain described c (n+N), c (n+2N) ..., x in c (n+mN) 2(n+D) use x 2(n), x 2(n+1) ..., x 2(n+T 2) mould 2 add the reduced form of expression;
By described x 2(n+D) b in reduced form jget in the step that 0 item number removes, also comprise following sub-step:
By described c (n+N), c (n+2N) ..., x in c (n+mN) 2(n+D) b in reduced form jgetting 0 item number removes;
Generate in the step of described Gold sequence c (n) at exclusive-OR that the first pseudo random sequence of described generation and the second pseudo random sequence are shifted, also comprise following sub-step:
Parallel generation Gold sequence c (n+N), c (n+2N) ..., c (n+mN), obtain described long pseudo-random sequence.
4. according to the generation method of the pseudo random sequence described in claims 1 to 3 any one, it is characterized in that described T 1, described T 2, described D value according to the regulation of Long Term Evolution LTE standard or Wideband Code Division Multiple Access (WCDMA) WCDMA standard determine.
5. a generating apparatus for pseudo random sequence, is characterized in that, comprises:
The first pseudo random sequence generator, for according to the first pseudo random sequence x 1(n+D) use x 1(n), x 1(n+1) ..., x 1(n+T 1) mould 2 add the reduced form of expression x 1 ( n + D ) = ( a T 1 x 1 ( n + T 1 ) + a T 1 - 1 x 1 ( n + T 1 - 1 ) + · · · + a 0 x 1 ( n ) ) mod 2 , And by described x 1(n+D) a in reduced form iget 0 item number and remove, generate described the first pseudo random sequence; Wherein, described x 1(n+D) reduced form adopts the generation relation of a m sequence to carry out recursion and obtains; In formula, coefficient a i∈ 0,1}, and i=0,1,2,3 ... T 1; Described n is random natural number.
6. the generating apparatus of pseudo random sequence according to claim 5, is characterized in that, also comprises:
The second pseudo random sequence generator, for according to the second pseudo random sequence x 2(n+D) use x 2(n), x 2(n+1) ..., x 2(n+T 2) mould 2 add the reduced form of expression x 2 ( n + D ) = ( b T 2 x 2 ( n + T 2 ) + b T 2 - 1 x 2 ( n + T 2 - 1 ) + · · · + b 0 x 2 ( n ) ) mod 2 , And by described x 2(n+D) b in reduced form jget 0 item number and remove, generate described the second pseudo random sequence; Wherein, described x 2(n+D) reduced form adopts the generation relation of the 2nd m sequence to carry out recursion and obtains; In formula, coefficient b j∈ 0,1}, and j=0,1,2,3 ... T 2;
Adder, obtains Gold sequence c (n) for exclusive-OR that the first pseudo random sequence of described generation and the second pseudo random sequence are shifted, and the expression of described c (n) is c (n)=(x 1(n+D)+x 2(n+D)) mod2.
7. the generating apparatus of pseudo random sequence according to claim 6, is characterized in that, also comprises:
Deserializer, in advance long pseudo-random sequence being divided into the m section of every section of N data, use c (n+N), c (n+2N) ..., c (n+mN) represent, described n=0,1 ..., N-1;
M segmentation pseudo random sequence generator, for parallel generation Gold sequence c (n+N), c (n+2N) ..., c (n+mN), obtain described long pseudo-random sequence;
Each segmentation pseudo random sequence generator comprises described First ray maker, described the second sequence generator and described adder;
Wherein, the calculating formula that described First ray maker adopts is respectively to adopt the generation relation of a m sequence, will be used for generating described c (n+N), c (n+2N) ..., c (n+mN) the first pseudo random sequence x 1(n+D) carry out recursion, obtain described c (n+N), c (n+2N) ..., x in c (n+mN) 1(n+D) use x 1(n), x 1(n+1) ..., x 1(n+T 1) mould 2 add the reduced form of expression, and remove a iget 0 item number, the calculating formula obtaining;
The calculating formula that described the second sequence generator adopts is respectively to adopt the generation relation of the 2nd m sequence, will be used for generating described c (n+N), c (n+2N) ..., c (n+mN) the second pseudo random sequence x 2(n+D) carry out recursion, obtain described c (n+N), c (n+2N) ..., x in c (n+mN) 2(n+D) use x 2(n), x 2(n+1) ..., x 2(n+T 2) mould 2 add the reduced form of expression, and remove b jget 0 item number, the calculating formula obtaining.
CN201210445879.1A 2012-11-09 2012-11-09 The generation method and device of pseudo-random sequence Active CN103812596B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201210445879.1A CN103812596B (en) 2012-11-09 2012-11-09 The generation method and device of pseudo-random sequence

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201210445879.1A CN103812596B (en) 2012-11-09 2012-11-09 The generation method and device of pseudo-random sequence

Publications (2)

Publication Number Publication Date
CN103812596A true CN103812596A (en) 2014-05-21
CN103812596B CN103812596B (en) 2017-07-04

Family

ID=50708855

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201210445879.1A Active CN103812596B (en) 2012-11-09 2012-11-09 The generation method and device of pseudo-random sequence

Country Status (1)

Country Link
CN (1) CN103812596B (en)

Cited By (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105262557A (en) * 2015-09-07 2016-01-20 东南大学 Method for generating pseudo-random sequences in LTE (Long Term Evolution) system
CN107483152A (en) * 2017-08-15 2017-12-15 京信通信系统（中国）有限公司 A kind of method for sending, receiving data, device and computer read/write memory medium
CN108023661A (en) * 2016-10-31 2018-05-11 深圳市中兴微电子技术有限公司 A kind of method and apparatus for obtaining pseudo-random sequence
CN108400829A (en) * 2018-02-09 2018-08-14 北京松果电子有限公司 The generation method and device of ZC sequences
CN109218564A (en) * 2018-11-13 2019-01-15 深圳市金城保密技术有限公司 Generation method, device, storage medium and the video interferometer of video jamming signal
CN109375897A (en) * 2017-08-03 2019-02-22 普天信息技术有限公司 The generation method of pseudo-random sequence
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
CN113595672A (en) * 2021-07-28 2021-11-02 重庆重邮汇测电子技术研究院有限公司 Modular implementation method based on 5G pseudo-random sequence

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101547040A (en) * 2008-03-26 2009-09-30 三星电子株式会社 Method for initializing pseudo random sequence generator
US20110274193A1 (en) * 2009-01-20 2011-11-10 Pantech Co., Ltd. Apparatus and method for generating scrambling codes in a radio communication system
CN102281116A (en) * 2010-06-11 2011-12-14 重庆重邮信科通信技术有限公司 Method and device for generating GOLD sequence

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101547040A (en) * 2008-03-26 2009-09-30 三星电子株式会社 Method for initializing pseudo random sequence generator
US20110274193A1 (en) * 2009-01-20 2011-11-10 Pantech Co., Ltd. Apparatus and method for generating scrambling codes in a radio communication system
CN102281116A (en) * 2010-06-11 2011-12-14 重庆重邮信科通信技术有限公司 Method and device for generating GOLD sequence

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
吴明捷等: "伪随机码及计算机的产生", 《辽宁工程技术大学学报（自然科学版）》 *

Cited By (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105262557A (en) * 2015-09-07 2016-01-20 东南大学 Method for generating pseudo-random sequences in LTE (Long Term Evolution) system
CN108023661A (en) * 2016-10-31 2018-05-11 深圳市中兴微电子技术有限公司 A kind of method and apparatus for obtaining pseudo-random sequence
CN109375897A (en) * 2017-08-03 2019-02-22 普天信息技术有限公司 The generation method of pseudo-random sequence
CN107483152A (en) * 2017-08-15 2017-12-15 京信通信系统（中国）有限公司 A kind of method for sending, receiving data, device and computer read/write memory medium
CN107483152B (en) * 2017-08-15 2020-04-14 京信通信系统（中国）有限公司 Method, device and computer readable storage medium for sending and receiving data
CN108400829A (en) * 2018-02-09 2018-08-14 北京松果电子有限公司 The generation method and device of ZC sequences
CN109218564A (en) * 2018-11-13 2019-01-15 深圳市金城保密技术有限公司 Generation method, device, storage medium and the video interferometer of video jamming signal
CN109218564B (en) * 2018-11-13 2021-02-26 深圳市金城保密技术有限公司 Method and device for generating video interference signal, storage medium and video interference instrument
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
WO2022001427A1 (en) * 2020-07-01 2022-01-06 浙江三维利普维网络有限公司 Dsp-based pseudo random sequence generating method and device, and storage medium
CN113595672A (en) * 2021-07-28 2021-11-02 重庆重邮汇测电子技术研究院有限公司 Modular implementation method based on 5G pseudo-random sequence
CN113595672B (en) * 2021-07-28 2024-08-06 重庆重邮汇测电子技术研究院有限公司 Modularized implementation method based on 5G pseudo-random sequence

Also Published As

Publication number Publication date
CN103812596B (en) 2017-07-04

Similar Documents

Publication Publication Date Title
CN103812596A (en) Pseudo random sequence generation method and apparatus
François et al. Pseudo-random number generator based on mixing of three chaotic maps
Avaroğlu et al. Hybrid pseudo-random number generator for cryptographic systems
Wang et al. Secure chaotic system with application to chaotic ciphers
CN102866878B (en) The method accelerating the calculating to characteristic 2 elliptic curve cipher system
Dastgheib et al. A digital pseudo-random number generator based on sawtooth chaotic map with a guaranteed enhanced period
KR102154164B1 (en) Method for generating a pseudorandom sequence, and method for coding or decoding a data stream
CN104158557B (en) Gold sequence method for parameter estimation
El-Razouk et al. New implementations of the WG stream cipher
Coron et al. Side-channel masking with pseudo-random generator
Jinpeng et al. An Innovative FPGA Implementations of the Secure frequency hopping communication system based on the improved ZUC algorithm
Panda et al. FPGA prototype of low latency BBS PRNG
CN103441813B (en) A kind of low associated binary sequence set creation method for cdma system
CN104506271A (en) Method and device for generating ZC (Zadoff-Chu) sequence
Sadkhan et al. Simulink based implementation of developed A5/1 stream cipher cryptosystems
Thane et al. Hardware design and implementation of pseudorandom number generator using piecewise linear chaotic map
Paul et al. Triple pendulum based nonlinear chaos generator and its applications in cryptography
CN102201912A (en) Blind recognition method for self-synchronization scrambling code generation polynomial
Mandal et al. Cryptographic D-morphic analysis and fast implementations of composited de Bruijn sequences
Molina-Gil et al. Pseudorandom generator to strengthen cooperation in VANETs
CN101599775B (en) Method and device for constructing spread spectrum code
Mandal Design and analysis of cryptographic pseudorandom number/sequence generators with applications in RFID
Özkaynak The Effects on Performance of Using Chaotic Systems in Entropy Source of Deterministic Random Number Generators
Wang et al. Constructing Digitized Chaotic Time Series with a Guaranteed Enhanced Period
CN107846272B (en) Device and method for rapidly generating Golden sequence

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant
TR01 Transfer of patent right

Effective date of registration: 20191113

Address after: 300450 1-1-609-a, North Zone, financial and Trade Center, 6865 Asia Road, Tianjin Free Trade Zone (Dongjiang Free Trade Port Area), Binhai New Area, Tianjin

Patentee after: Huiyi finance leasing (Tianjin) Co., Ltd

Address before: 201206 No. 1258 Mingyue Road, Shanghai, Pudong New Area

Patentee before: Leadcore Technology Co., Ltd.

TR01 Transfer of patent right
EE01 Entry into force of recordation of patent licensing contract

Application publication date: 20140521

Assignee: Leadcore Technology Co., Ltd.

Assignor: Huiyi finance leasing (Tianjin) Co., Ltd

Contract record no.: X2020990000002

Denomination of invention: Pseudo random sequence generation method and apparatus

Granted publication date: 20170704

License type: Exclusive License

Record date: 20200103

EE01 Entry into force of recordation of patent licensing contract
TR01 Transfer of patent right

Effective date of registration: 20220309

Address after: 201206 Ming Yue Road, Pudong New Area, Shanghai, No. 1258

Patentee after: LEADCORE TECHNOLOGY Co.,Ltd.

Address before: 300450 1-1-609-a, north area of financial and Trade Center, No. 6865, Asia Road, Tianjin pilot free trade zone (Dongjiang Bonded Port Area), Binhai New Area, Tianjin

Patentee before: Huiyi finance leasing (Tianjin) Co.,Ltd.

TR01 Transfer of patent right