CN105262557A - Method for generating pseudo-random sequences in LTE (Long Term Evolution) system - Google Patents

Method for generating pseudo-random sequences in LTE (Long Term Evolution) system Download PDF

Info

Publication number
CN105262557A
CN105262557A CN201510564012.1A CN201510564012A CN105262557A CN 105262557 A CN105262557 A CN 105262557A CN 201510564012 A CN201510564012 A CN 201510564012A CN 105262557 A CN105262557 A CN 105262557A
Authority
CN
China
Prior art keywords
sequence
pseudo random
random sequence
mask code
scramble
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
CN201510564012.1A
Other languages
Chinese (zh)
Other versions
CN105262557B (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.)
Southeast University
Original Assignee
Southeast University
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Southeast University filed Critical Southeast University
Priority to CN201510564012.1A priority Critical patent/CN105262557B/en
Publication of CN105262557A publication Critical patent/CN105262557A/en
Application granted granted Critical
Publication of CN105262557B publication Critical patent/CN105262557B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Landscapes

  • Synchronisation In Digital Transmission Systems (AREA)

Abstract

The invention discloses a method for generating pseudo-random sequences in an LTE (Long Term Evolution) system. The method comprises the following steps: acquiring an initial sequence of a first pseudo-random sequence; acquiring an initial sequence of a second pseudo-random sequence; performing a phase mask sequence operation on the first pseudo-random sequence to obtain a self-scrambling sequence; performing a phase mask sequence operation on the second pseudo-random sequence to obtain a self-scrambling sequence; and performing an XOR operation on the two groups of self-scrambling sequences to obtain a scrambling code sequence for scrambling or descrambling. Compared with the prior art, the method has the advantages that the generation time of scrambling codes can be effectively shortened while the calculation complexity is not increased, and the overall performance of a communication system is enhanced.

Description

A kind of generation method of pseudo random sequence in LTE system
Technical field
The invention belongs to wide-band mobile communication technical field, particularly in LTE system scrambling or descrambling are carried out to data time the generation method of scrambler sequence that uses.
Background technology
Along with the development of modern technologies, wide-band mobile communication system is widely used, and people can communicate whenever and wherever possible.But if be not encrypted operation to data in communication system, user data is easy to be stolen by third party, and therefore cryptographic operation is most important.A kind of cryptographic operation of current comparative maturity carries out scrambling by scrambler sequence to data at transmitting terminal exactly, uses identical scrambler sequence to carry out descrambling to data at receiving terminal.So just can effectively prevent data from being obtained by third party.
Use pseudo random sequence as scrambler sequence in LTE, this pseudo random sequence answers position addition mould 2 to form by two m sequence pair.Conveniently algorithm, before each generation pseudo random sequence, two m sequences all want first iteration 1600 times.In addition, in 3GPPLTE system, the multiple occasion that Gold sequence is used as pseudo random sequence, needed for some application scenario system, pseudo random sequence is very short, and so a large amount of iteration only generates very short sequence, and not only the time longlyer wastes a large amount of system resource.For this reason, the present invention proposes a kind of new pseudo random sequence generation method, while not increasing computation complexity, can significantly shorten the rise time of scrambler sequence.
Summary of the invention
Technical problem: the present invention proposes a kind of method that pseudo random sequence generates, solve the generation long problem consuming time of scrambler in a communications system.
Technical scheme: the method that the pseudo random sequence in LTE system that the present invention proposes generates, mainly comprises:
The first step, obtains the initiation sequence of the first pseudo random sequence, obtains the initiation sequence of the second pseudo random sequence.
Second step, generates mask code sequence, and mask code sequence is used for the N calculated with initiation sequence from scramble sequence cposition and later numerical value thereof.The mask code sequence of the first pseudo random sequence is a fixing sequence relevant to phase place, and the mask code sequence of the second pseudo random sequence is relevant with sequence initial value with phase place.
3rd step, two pseudo random sequences carry out step-by-step xor operation with mask code sequence respectively, obtain from scramble sequence.
4th step, the first pseudo random sequence carry out xor operation from scramble sequence and the second pseudo random sequence from scramble sequence, obtain the scrambler sequence for scrambling or descrambling.
Beneficial effect: a kind of method that pseudo random sequence generates in LTE system that the present invention proposes, while not increasing computation complexity, effectively can improve the rise time of scrambler, improve the overall performance of communication system.
Accompanying drawing explanation
In order to be illustrated more clearly in the technical scheme in the embodiment of the present invention, be briefly described to the accompanying drawing used required in embodiment or description of the prior art below, apparently, accompanying drawing in the following describes only shows some embodiments of the present invention, for those of ordinary skill in the art, under the prerequisite not paying creative work, the accompanying drawing of other embodiments can also be obtained according to these accompanying drawings.
The scrambling that Fig. 1 adopts for the embodiment of the present invention or descrambling system structured flowchart.
First pseudo random sequence from scramble sequence generative process schematic diagram in the scrambler sequence that Fig. 2 adopts for the embodiment of the present invention.
Second pseudo random sequence from scramble sequence generative process schematic diagram in the scrambler sequence that Fig. 3 adopts for the embodiment of the present invention.
Mask code sequence M in the second pseudo random sequence that Fig. 4 adopts for the embodiment of the present invention 3acquisition schematic diagram.
Phase place mask code matrix M in the second pseudo random sequence that Fig. 5 adopts for the embodiment of the present invention 2acquisition schematic diagram.
Embodiment
Below in conjunction with accompanying drawing, technical scheme of the invention process is described in further detail.
Scrambling is that transfer sequence and scrambler sequence are carried out xor operation, and the transfer sequence obtained is uncorrelated with original transferring content, serves the effect of protected data.At receiving terminal, use identical scrambler sequence correctly can go out data by descrambling, otherwise the data that descrambling makes mistake.As shown in Figure 1, for the scrambler sequence of scrambling or descrambling by the carrying out xor operation from scramble sequence and obtain from scramble sequence and the second pseudo random sequence of the first pseudo random sequence.The formula of scrambler sequence is:
C (n)=(x 1(n+N c)+x 2(n+N c)) mod2 (formula 1)
Wherein x 1be the first pseudo random sequence, x 2be the second pseudo random sequence, these two sequences are Gold sequence, and initial value is 31, and namely n is from 0 to 30.Therefore, c (n) is also a Gold sequence.For the first pseudo random sequence, its initial value is x 1(0)=1, x 1(n)=0; N=1...30.Like this, can by mask code sequence produce the first pseudo random sequence from scramble sequence, specific implementation process is as follows.
First pseudo random sequence from scramble sequence generator polynomial be:
X 1(n+31)=(x 1(n)+x 1(n+3)) mod2 (formula 2)
In formula, n=1,2 ..., 30, can be known by formula 2, from scramble sequence from the 31st, all with above sequence is relevant for each.Know that scrambler sequence is by N according to formula 1 again cposition produces.N cfor the state offset amount of m sequence, N in LTE system cvalue is 1600.Therefore, from scramble sequence from the 1600th, ordered sequence is only, for generation of scrambler sequence c (n).Obviously, the calculating of 1600 times had both wasted the time and had wasted resource.In order to accelerate computing, can find a mask code sequence, the effect of this mask code sequence makes the initiation sequence of pseudo random sequence by after mask, obtains the 1600th from scramble sequence.Then, initiation sequence produces from scrambling sequence values by formula 2, the data window biased forwards of 31, obtain new sequence, this sequence is the data of the 1600th by what produce after mask, but for whole from scramble sequence, these data are the 1601st from scramble sequence, namely offset along with the skew of data window from scramble sequence.Because phase difference is constant, thus mask code sequence is remained unchanged.Finally, 1600 and later all from scramble sequence data can be drawn.By calculating, this mask code sequence is:
M 1=[0101111001001000010110000100000] (formula 3) can draw:
x 1 ( 1600 + n ) = ( sum ( [ x 1 ( 0 + n ) x 1 ( 1 + n ) x 1 ( 2 + n ) . . . . . . x 1 ( 30 + n ) ] * M 1 T ) ) mod 2 (formula 4) like this, first carries out biased forwards by formula 2, then calculates 1600 and later from scramble sequence by mask code sequence.
The maximum difference of the second pseudo random sequence and the first pseudo random sequence is initiation sequence and the C of the second pseudo random sequence initvalue (scrambling initial value, in LTE protocol, has different definition according to different application scenarios) relevant, the second pseudo random sequence from scramble sequence generator polynomial be:
X 2(n+31)=(x 2(n)+x 2(n+1)+x 2(n+2)+x 2(n+3)) mod2 (formula 5)
Equally, the second pseudo random sequence from scramble sequence at the 1600th and the generation of scrambler sequence could be used for later.Similar with the method for process first pseudo random sequence, different places is the mask code sequence M calculated 3with C initbe worth relevant, then make data window biased forwards by generator polynomial, constantly produce new for scrambling sequence values.
As shown in Figure 4, in order to obtain mask code sequence M 3, first need to obtain C initinitial value and phase place mask code matrix M 2.Fig. 5 describes phase place mask code matrix M 2generative process, first define 31 phase sequences, be respectively:
α 0(0)＝1,α 0(n)＝0；n＝1...30
α 1(1)＝1,α 1(n)＝0；n＝0,2...30
α 2(2)＝1,α 2(n)＝0；n＝0...1,3...30
……
α 30(30)＝1,α 30(n)＝0；n＝0...29
31 phase sequences form one group of base above, can represent any one sequence of 31.Find out the mask code sequence of each phase sequence, draw phase place mask code matrix M 2, as follows:
First phase sequence is α 0(0)=1, α 0(n)=0; N=1...30, calculating generator polynomial is:
x 2(n+1600)
＝sum[x 2(n+1)x 2(n+2)x 2(n+3)x 2(n+8)x 2(n+12)x 2(n+16)x 2(n+19)x 2(n+20)x 2(n+23)]mod2
(formula 6)
Namely phase sequence α 0mask code sequence be
M α0＝[011100001000100010011001000000]
By that analogy, after calculating the mask code sequence of all phase sequences, obtain mask code matrix M 2.
Mask code matrix M 2formula is:
M 2=[M α 0; M α 1; M α 2; ...; M α 30] (formula 7)
Calculate matrix M 2value be:
M 2＝
[0111000010001000100110010000000；0100100011001100110101011000000；1010100111011101111001111000000；1111011111111111000001110000011；0000111111111110000011100000111；0001111111111100000111000001110；0011111111111000001110000011100；0111111111110000011100000111000；1111111111100000111000001110000；0001111111000001110000011100001；0011111110000011100000111000010；0111111100000111000001110000100；1111111000001110000011100001000；0001110000011100000111000010001；0011100000111000001110000100010；0111000001110000011100001000100；1110000011100000111000010001000；0010000111000001110000100010001；0100001110000011100001000100010；1000011100000111000010001000100；1110111000001110000100010001001；0011110000011100001000100010011；0111100000111000010001000100110；1111000001110000100010001001100；0000000011100001000100010011001；0000000111000010001000100110010；0000001110000100010001001100100；0000011100001000100010011001000；0000111000010001000100110010000；0001110000100010001001100100000；0011100001000100010011001000000；
]
Then, C initvalue and matrix M 2make matrix multiplication, obtain mask code sequence:
M 3=M 2* Cinit t(formula 8)
M 3the value of every a line represents C initthe value calculated after being updated to the generator polynomial of this phase place.
Initiation sequence x 2(0)=1, x 2(n)=1; N=1...30 and mask code sequence M 3be multiplied, obtain the numerical value from scramble sequence of the 1600th, then the data window of initiation sequence 31 bit wide calculates new data window sequence by formula 5 biased forwards.
At acquisition first pseudo random sequence and the second pseudo random sequence the 1600th and later after the numerical value of scramble sequence, just scrambler sequence can be calculated according to formula 1.Finally, it should be noted that above mask code sequence is only applicable to N cthe situation of=1600, works as N cwhen value is different, mask code sequence also can be different, but method is constant.
In the embodiment that the application provides, should be understood that, disclosed method, not exceeding in the spirit and scope of the application, can realize in other way.Current embodiment is a kind of exemplary example, should as restriction, and given particular content should in no way limit the object of the application.Such as, multiple unit or assembly can in conjunction with or another system can be integrated into, or some features can be ignored, or do not perform.
The above; be only the specific embodiment of the present invention, but protection scope of the present invention is not limited thereto, is anyly familiar with those skilled in the art in the technical scope that the present invention discloses; change can be expected easily or replace, all should be encompassed within protection scope of the present invention.Therefore, protection scope of the present invention should be as the criterion with the protection range of described claim.

Claims (6)

  1. A kind of generation method of pseudo random sequence in 1.LTE system, it is characterized in that, the method comprises:
    The first step, obtains the initiation sequence of the first pseudo random sequence, obtains the initiation sequence of the second pseudo random sequence;
    Second step, generates the mask code sequence of the first pseudo random sequence and the mask code sequence of the second pseudo random sequence respectively, and described mask code sequence is used for the N calculated with initiation sequence from scramble sequence cposition and later numerical value thereof, N cfor the state offset amount of sequence;
    3rd step, carries out step-by-step xor operation with respective mask code sequence respectively by the initiation sequence of two pseudo random sequences, obtains respective from scramble sequence;
    4th step, carries out xor operation from scramble sequence and the second pseudo random sequence from scramble sequence by the first pseudo random sequence, obtains the scrambler sequence for scrambling or descrambling.
  2. 2. a kind of generation method of pseudo random sequence in LTE system according to claim 1, it is characterized in that, the initiation sequence of described first pseudo random sequence is x 1(0)=1, x 1(n)=0; N=1...30, the mask code sequence of described first pseudo random sequence is
    M 1＝[0101111001001000010110000100000]。
  3. 3. a kind of generation method of pseudo random sequence in LTE system according to claim 1, is characterized in that, in the 3rd step, 1600 of the first pseudo random sequence and the later generator polynomial from scramble sequence are: x 1 ( 1600 + n ) = ( s u m ( [ x 1 ( 0 + n ) x 1 ( 1 + n ) x 1 ( 2 + n ) ... ... x 1 ( 30 + n ) ] * M 1 T ) ) mod 2.
  4. 4. a kind of generation method of pseudo random sequence in LTE system according to claim 1, it is characterized in that, in second step, the generation method of the mask code sequence of the second pseudo random sequence comprises:
    Obtain scrambling initial value C initvalue; Define 31 phase sequences and form one group of base, generate the mask code sequence of each phase sequence, obtain phase place mask code matrix M by rows 2; By C initvalue and matrix M 2make matrix multiplication, obtain the second pseudo random sequence mask code sequence M 3.
  5. 5. a kind of generation method of pseudo random sequence in LTE system according to claim 4, it is characterized in that, described phase place mask code matrix is:
    M 2＝
    [
    0111000010001000100110010000000；
    0100100011001100110101011000000；
    1010100111011101111001111000000；
    1111011111111111000001110000011；
    0000111111111110000011100000111；
    0001111111111100000111000001110；
    0011111111111000001110000011100；
    0111111111110000011100000111000；
    1111111111100000111000001110000；
    0001111111000001110000011100001；
    0011111110000011100000111000010；
    0111111100000111000001110000100；
    1111111000001110000011100001000；
    0001110000011100000111000010001；
    0011100000111000001110000100010；
    0111000001110000011100001000100；
    1110000011100000111000010001000；
    0010000111000001110000100010001；
    0100001110000011100001000100010；
    1000011100000111000010001000100；
    1110111000001110000100010001001；
    0011110000011100001000100010011；
    0111100000111000010001000100110；
    1111000001110000100010001001100；
    0000000011100001000100010011001；
    0000000111000010001000100110010；
    0000001110000100010001001100100；
    0000011100001000100010011001000；
    0000111000010001000100110010000；
    0001110000100010001001100100000；
    0011100001000100010011001000000；
    ]。
  6. 6. a kind of generation method of pseudo random sequence in LTE system according to claim 1, it is characterized in that, described first pseudo random sequence and the second pseudo random sequence are Gold sequence.
CN201510564012.1A 2015-09-07 2015-09-07 A kind of generation method of pseudo-random sequence in LTE system Active CN105262557B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201510564012.1A CN105262557B (en) 2015-09-07 2015-09-07 A kind of generation method of pseudo-random sequence in LTE system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201510564012.1A CN105262557B (en) 2015-09-07 2015-09-07 A kind of generation method of pseudo-random sequence in LTE system

Publications (2)

Publication Number Publication Date
CN105262557A true CN105262557A (en) 2016-01-20
CN105262557B CN105262557B (en) 2019-02-01

Family

ID=55102084

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201510564012.1A Active CN105262557B (en) 2015-09-07 2015-09-07 A kind of generation method of pseudo-random sequence in LTE system

Country Status (1)

Country Link
CN (1) CN105262557B (en)

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107483152A (en) * 2017-08-15 2017-12-15 京信通信系统（中国）有限公司 A kind of method for sending, receiving data, device and computer read/write memory medium
CN108347293A (en) * 2017-01-24 2018-07-31 华为技术有限公司 Transmission method and device
CN109375897A (en) * 2017-08-03 2019-02-22 普天信息技术有限公司 The generation method of pseudo-random sequence
CN112286494A (en) * 2020-11-17 2021-01-29 Oppo广东移动通信有限公司 Method and device for generating pseudorandom sequence and computer readable storage medium
CN112579045A (en) * 2020-12-22 2021-03-30 Oppo广东移动通信有限公司 Method and device for generating pseudorandom sequence and storage medium
CN114553386A (en) * 2022-04-24 2022-05-27 哲库科技(北京)有限公司 Sequence generation method and device and computer readable storage medium

Citations (6)

* 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
US20090323942A1 (en) * 2008-06-30 2009-12-31 Eran Sharon Method for page- and block based scrambling in non-volatile memory
CN101925056A (en) * 2009-06-10 2010-12-22 华为技术有限公司 Scrambling code sequence generation method, device and system for scrambling or descrambling
US20120128096A1 (en) * 2009-08-12 2012-05-24 Zte Corporation Method and device for generating scrambling code
CN103812596A (en) * 2012-11-09 2014-05-21 联芯科技有限公司 Pseudo random sequence generation method and apparatus
CN103873181A (en) * 2014-04-04 2014-06-18 中国科学院自动化研究所 Pseudorandom sequence parallel generation method in LTE system

Patent Citations (6)

* 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
US20090323942A1 (en) * 2008-06-30 2009-12-31 Eran Sharon Method for page- and block based scrambling in non-volatile memory
CN101925056A (en) * 2009-06-10 2010-12-22 华为技术有限公司 Scrambling code sequence generation method, device and system for scrambling or descrambling
US20120128096A1 (en) * 2009-08-12 2012-05-24 Zte Corporation Method and device for generating scrambling code
CN103812596A (en) * 2012-11-09 2014-05-21 联芯科技有限公司 Pseudo random sequence generation method and apparatus
CN103873181A (en) * 2014-04-04 2014-06-18 中国科学院自动化研究所 Pseudorandom sequence parallel generation method in LTE system

Cited By (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108347293A (en) * 2017-01-24 2018-07-31 华为技术有限公司 Transmission method and device
CN108347293B (en) * 2017-01-24 2023-10-24 华为技术有限公司 Transmission method and device
US11963197B2 (en) 2017-01-24 2024-04-16 Huawei Technologies Co., Ltd. Transmission method and apparatus
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
CN112286494A (en) * 2020-11-17 2021-01-29 Oppo广东移动通信有限公司 Method and device for generating pseudorandom sequence and computer readable storage medium
WO2022105338A1 (en) * 2020-11-17 2022-05-27 Oppo广东移动通信有限公司 Pseudo-random sequence generation method, generation apparatus, and computer-readable storage medium
CN112286494B (en) * 2020-11-17 2024-05-24 Oppo广东移动通信有限公司 Pseudo random sequence generation method, generation device and computer readable storage medium
CN112579045A (en) * 2020-12-22 2021-03-30 Oppo广东移动通信有限公司 Method and device for generating pseudorandom sequence and storage medium
CN112579045B (en) * 2020-12-22 2024-08-06 Oppo广东移动通信有限公司 Pseudo-random sequence generation method, pseudo-random sequence generation device and storage medium
CN114553386A (en) * 2022-04-24 2022-05-27 哲库科技(北京)有限公司 Sequence generation method and device and computer readable storage medium

Also Published As

Publication number Publication date
CN105262557B (en) 2019-02-01

Similar Documents

Publication Publication Date Title
CN105262557A (en) Method for generating pseudo-random sequences in LTE (Long Term Evolution) system
CN105391545A (en) Method of generating pseudo-random sequence in LTE system
US10892850B2 (en) Method and apparatus for carrying identification information
CN110661618B (en) Data transmission method and device and electronic equipment
CN110071794B (en) AES algorithm-based information encryption method, system and related components
CN104158557B (en) Gold sequence method for parameter estimation
CN101378314A (en) Method for generating key sequence and apparatus for generating cipher key
CN102176693A (en) NRSR (nonlinear ring shifting register)
US6909785B1 (en) Method and apparatus for efficient irregular synchronization of a stream cipher
CN109375897B (en) Method for generating pseudo-random sequence
CN110650119B (en) Data transmission method and device and electronic equipment
US11218250B2 (en) Information adding method and apparatus
US20150188703A1 (en) Key processing method and apparatus
CN103780794A (en) Image encryption improved method based on chaotic system
CN106452743B (en) Communication key obtaining method and device and communication message decryption method and device
CN112148661A (en) Data processing method and electronic equipment
CN112579045A (en) Method and device for generating pseudorandom sequence and storage medium
CN110661591B (en) Data processing method, apparatus and computer readable storage medium
CN116684071A (en) Method and system for realizing acceleration of white box protection scheme based on Boolean circuit
CN102281116A (en) Method and device for generating GOLD sequence
CN113452508B (en) Data encryption method, device, equipment and computer readable storage medium
Shah et al. A new guess-and-determine attack on the A5/1 stream cipher
RU97885U1 (en) DATA STREAM ENCRYPTION DEVICE
Kitbumrung et al. ECC dynamic point encoding on mobile device
CN117978388B (en) Method, apparatus, device, medium and program product for key generation

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
CB02 Change of applicant information

Address after: 210009 No. 87 Dingjiaqiao, Gulou District, Nanjing City, Jiangsu Province

Applicant after: Southeast University

Address before: 210096 No. four archway, 2, Jiangsu, Nanjing

Applicant before: Southeast University

CB02 Change of applicant information
GR01 Patent grant
GR01 Patent grant