CN101925056B - Scrambling code sequence generation method, device and system for scrambling or descrambling - Google Patents
Scrambling code sequence generation method, device and system for scrambling or descrambling Download PDFInfo
- Publication number
- CN101925056B CN101925056B CN 200910087145 CN200910087145A CN101925056B CN 101925056 B CN101925056 B CN 101925056B CN 200910087145 CN200910087145 CN 200910087145 CN 200910087145 A CN200910087145 A CN 200910087145A CN 101925056 B CN101925056 B CN 101925056B
- Authority
- CN
- China
- Prior art keywords
- sequence
- scrambling
- pseudo random
- row
- matrix
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
The embodiment of the invention provides a scrambling code sequence generation method, a device and a system for scrambling or descrambling. The method comprises the following steps: obtaining the initial sequence of a first pseudo-random sequence; obtaining a self-scrambled sequence of a second pseudo-random sequence after self-scrambling the initial sequence of the second pseudo-random sequence, multiplying the initial sequence of the first pseudo-random sequence with a preset M matrix, and generating the self-scrambled sequence of the first pseudo-random sequence; and carrying out XOR operation on the self-scrambled sequence of the first pseudo-random sequence and the self-scrambled sequence of the second pseudo-random sequence according to bits and obtaining a scrambling code sequence for scrambling or descrambling. The embodiment can simplify the generation process of the scrambling code sequence, shorten the generation time of the scrambling code sequence, further shorten the time for scrambling or descrambling transmitted data, accelerate the scrambling or descrambling processing speed of a wireless communication system and save system resources.
Description
Technical field
The embodiment of the invention relates to communication technical field, particularly a kind of scrambling code sequence generation method for scrambling or descrambling, Apparatus and system.
Background technology
Growing along with science and technology, wireless communication technology has obtained extensive use, and the user can be in any place, obtain the effective information that wireless communication system brings any time.Yet; if in the wireless communication system transmission data are not done any safety precautions; then the third party can obtain the data message that the active user receives easily; therefore; it is the prerequisite of wireless communications application that the transmission data are effectively protected, and it is important how the transmission data effectively being protected the lattice that seem.A kind of mode is to adopt signal scrambling technique at transmitting terminal the transmission data to be protected, and at receiving terminal the transmission data through scrambling is carried out scramble process, obtains former transmission data.
A kind of scrambling code sequence generation method of prior art, adopt the synthetic pseudo random sequence of two sequences as the scrambler sequence that is used for scrambling or descrambling, in building-up process, the synthetic sequence after scrambling of at first will be respectively the initiation sequence of these two sequences being carried out some bits could be carried out scrambling or descrambling to former transmission data as formal scrambler sequence.
In realizing process of the present invention, the inventor finds that there are the following problems at least in the prior art: in be used for scrambling or descrambling scrambler sequence generative process complexity, time, prolong, and cause wireless communication system scrambling or scramble process speed slow, waste system resource.
Summary of the invention
The embodiment of the invention provides a kind of scrambling code sequence generation method for scrambling or descrambling, and this method comprises:
Obtain the initiation sequence of first pseudo random sequence;
Obtain second pseudo random sequence of initiation sequence process after scrambling of second pseudo random sequence from scramble sequence, and initiation sequence and the default Metzler matrix of described first pseudo random sequence multiplied each other, generate first pseudo random sequence from scramble sequence;
Described first pseudo random sequence is carried out XOR from scramble sequence by bit from scramble sequence and described second pseudo random sequence, obtain the scrambler sequence for scrambling or descrambling.
The embodiment of the invention also provides a kind of scrambler sequence generator for scrambling or descrambling, and this device comprises:
First acquisition module is for the initiation sequence that obtains first pseudo random sequence;
First generation module is used for obtaining second pseudo random sequence of initiation sequence process after scrambling of second pseudo random sequence from scramble sequence;
Second generation module is used for initiation sequence and the default Metzler matrix of described first pseudo random sequence are multiplied each other, and generates first pseudo random sequence from scramble sequence;
The 3rd generates module, is used for described first pseudo random sequence is carried out XOR from scramble sequence by bit from scramble sequence and described second pseudo random sequence, obtains the scrambler sequence for scrambling or descrambling.
The embodiment of the invention provides a kind of scrambling or descrambling system again, and this system comprises:
Scrambler sequence generator for the initiation sequence that obtains first pseudo random sequence, multiplies each other according to the initiation sequence of described first pseudo random sequence and the Metzler matrix of presetting, and generates first pseudo random sequence from scramble sequence; Obtain second pseudo random sequence of initiation sequence process after scrambling of second pseudo random sequence from scramble sequence; And described first pseudo random sequence carried out XOR from scramble sequence by bit from scramble sequence and described second pseudo random sequence, obtain the scrambler sequence for scrambling or descrambling;
Scrambling or descrambler are used for according to described scrambler sequence the transmission data being carried out scrambling or descrambling.
The scrambling code sequence generation method that is used for scrambling or descrambling that the embodiment of the invention provides, Apparatus and system, according to the Metzler matrix that sets in advance with the initiation sequence of pseudo random sequence be converted into through default bit after scrambling from scramble sequence, and then obtain scrambler sequence for scrambling or descrambling, overcome prior art scrambler sequence generative process complexity, Shi Yanchang, cause wireless communication system scrambling or scramble process speed slow, the defective of waste system resource, simplified the scrambler sequence generative process, shorten the scrambler sequence rise time, and then shortened transmitting the time of data scrambling or descrambling, accelerate wireless communication system scrambling or scramble process speed, conserve system resources.
Description of drawings
The scrambling code sequence generation method flow chart that is used for scrambling or descrambling that Fig. 1 provides for one embodiment of the invention;
The scrambling code sequence generation method flow chart that is used for scrambling or descrambling that Fig. 2 provides for another embodiment of the present invention;
The scrambler sequence generator structural representation that is used for scrambling or descrambling that Fig. 3 provides for one embodiment of the invention;
The scrambler sequence generator structural representation that is used for scrambling or descrambling that Fig. 4 provides for another embodiment of the present invention;
Scrambling or descrambling system structural representation that Fig. 5 provides for one embodiment of the invention.
Embodiment
Below by by reference to the accompanying drawings, the technical scheme of the embodiment of the invention is described in further detail.
The scrambling code sequence generation method flow chart that is used for scrambling or descrambling that Fig. 1 provides for one embodiment of the invention, as shown in Figure 1, this method comprises:
101, obtain the initiation sequence of first pseudo random sequence;
Scrambling refers to add scrambler sequence at the transmitting terminal of transmission data in transfer sequence, thereby changes the feature that is transmitted data, makes the content of former transport stream be difficult to prediction, and then has reached the protective effect to former transmission data.
According to formula c (n)=(x
1(n+N
c)+x
2(n+N
c)) mod2, be used for the scrambler sequence c (n) of scrambling or descrambling by the first pseudo random sequence x
1(n) and the second pseudo random sequence x
2(n) synthetic, the first pseudo random sequence x
1(n) and the second pseudo random sequence x
2(n) can be the Gold sequence.Wherein, n=0,1 ..., 30, respectively corresponding 31 bits, therefore the synthetic c (n) that obtains afterwards also can be the Gold sequence of 31 bits.The second pseudo random sequence x
2(n) x in the initiation sequence
2(0)=1, x
2(n)=0, i.e. x
2(n)=0 initiation sequence is fixed value, and the variation with channel does not change.And the first pseudo random sequence x
1(n) initiation sequence by
Expression, c
InitDifferent along with the difference of channel type, the initiation sequence of first pseudo random sequence can generate according to the wireless communication system configuration information, and this information comprises current area number, subframe numbers and user ID (identification, identity; Hereinafter to be referred as: information such as ID).For example at long-term technology evolution (Long Term Evolution; Hereinafter to be referred as: LTE) in the system, for Physical Downlink Shared Channel (Physical Downlink Shared Channel; Hereinafter to be referred as: PDSCH), Physical Downlink Control Channel (Physical Downlink Control Channel; Hereinafter to be referred as: PDCCH), physical down broadcast channel (Physical Broadcast Channel; Hereinafter to be referred as: PBCH), Physical Control Format Indicator Channel (Physical Control Format IndictChannel; Hereinafter to be referred as: PCFICH), the first pseudo random sequence x
1(n) initiation sequence is respectively by following formula definition:
PDSCH definition initiation sequence be:
Wherein, when a subframe has only single codeword, q=0; In a subframe, support two code words, corresponding q=0 or 1 at most;
The first pseudo random sequence x of PCFICH and PHICH definition
1(n) initiation sequence is:
The first pseudo random sequence x of PDCCH definition
1(n) initiation sequence is:
The first pseudo random sequence x of PBCH definition
1(n) initiation sequence is:
Wherein, n
RNTIThe expression ID users, Ns represents the particular location of time slot in every frame;
Expression rounds, and what obtain is the value of subframe numbers; N
ID CellRepresent residential quarter ID number.
Therefore, can be configured according to the initiation sequence of above-mentioned definition to first pseudo random sequence, owing to comprised the various configuration informations of user in the initiation sequence of this scrambler sequence, therefore, at receiving terminal, the user can resolve according to the configuration information of self, realizes having only the specific user can obtain the data of transmission, and the third party can't obtain, thereby has guaranteed the safety of radio communication.Except the LTE system, present embodiment can also be applied to mobile partnership of future generation according to the method for the various information generation initiation sequences of wireless communication system configuration, perhaps be applied to other various forms of wireless communication systems, to guarantee the fail safe of transmission data.
102, the initiation sequence that obtains second pseudo random sequence, and multiplies each other initiation sequence and the default Metzler matrix of first pseudo random sequence from scramble sequence through second pseudo random sequence after scrambling, generates first pseudo random sequence from scramble sequence;
At formula c (n)=(x
1(n+N
c)+x
2(n+N
c)) among the mod 2, N
cRepresent the first pseudo random sequence x
1(n) and the second pseudo random sequence x
2(n) need pass through N separately
cInferior c (n) sequence synthetic after scrambling could be used for scrambling or descrambling operation, N
cBe default bit number.Be example with the LTE system still, get N
c=1600, but be not limited in other application scenarios 1600 bits from scrambling.Work as N
c=1600 o'clock, the first pseudo random sequence x
1(n) and the second pseudo random sequence x
2(n) need respectively through 1600 bits after scrambling, carry out binary arithmetic operation more namely by the bit XOR, synthetic scrambler sequence c (n) could carry out scrambling or scramble process to former transmission data.Because what first pseudo random sequence and second pseudo random sequence were carried out 1600 bits respectively causes very long time delay from the scrambling meeting, this can cause the great wasting of resources to wireless communication system, and make scrambler sequence c (n) production process become very loaded down with trivial details, and, by x
1(n) and x
2(n) formula as can be seen, according to:
x
1(n+31)=(x
1(n+3)+x
1(n+2)+x
1(n+1)+x
1(n)) mod2 and
x
2(n+31)＝(x
2(n+3)+x
2(n))mod2
As can be seen, x
1(n) and x
2(n) each sequence all strictness is subject to a sequence, therefore, and x
1(n) and x
2(n) through each c (n) sequence of 1600 bits synthetic output after scrambling all strictness be subject to a last c (n) sequence.Because the second pseudo random sequence x
2(n) initiation sequence is fixed value, and the variation with channel does not change, therefore can be according to existing x
2(n) formula directly obtains the second pseudo random sequence x
2(n) in second pseudo random sequence of 1600 bits after scrambling from scramble sequence.
For the first pseudo random sequence x
1(n), because x
1(n) initiation sequence changes along with the variation of current area number, subframe numbers, ID users and channel type, therefore sets in advance matrix M, makes the first pseudo random sequence x
1(n) initiation sequence and x
1(n) initiation sequence forms the corresponding relation that is not subjected to a last sequence variation and changes through first pseudo random sequence of 1600 bits after scrambling from scramble sequence, and Metzler matrix can be according to the first pseudo random sequence x
1(n) formula obtains, be specifically as follows: because first pseudo random sequence of the default bit gained after scrambling of process is the initiation sequence of first pseudo random sequence and the product of Metzler matrix from scramble sequence, therefore, the initiation sequence that can draw first pseudo random sequence according to the formula definition of first pseudo random sequence carries out 1 bit from the process of scrambling, and then the initiation sequence that obtains first pseudo random sequence through 1 bit from the corresponding Metzler matrix of scrambling, again because the first pseudo random sequence x
1(n) each time that initial scrambler sequence is carried out is identical from its process of scrambling, therefore, the initiation sequence that can obtain first pseudo random sequence from the method for the corresponding Metzler matrix of scrambling through 1 bit according to the initiation sequence that obtains first pseudo random sequence through 1600 bits from the corresponding Metzler matrix of scrambling, the initiation sequence that can obtain first pseudo random sequence by this Metzler matrix and does not need to obtain the first pseudo random sequence x through the iterative process of complexity from scramble sequence through 1600 bits, first pseudo random sequence after scrambling
1(n) first pseudo random sequence that initiation sequence obtains after scrambling through 1600 bits is from scramble sequence.Though the second pseudo random sequence x in addition
2(n) be fixed value, but still can adopt the mode of default Metzler matrix to generate through second pseudo random sequence of 1600 bits after scrambling from scramble sequence.
103, first pseudo random sequence is carried out XOR from scramble sequence by bit from scramble sequence and second pseudo random sequence, obtain the scrambler sequence for scrambling or descrambling.
According to c (n)=(x
1(n+N
c)+x
2(n+N
c)) mod 2, first pseudo random sequence is carried out by the bit XOR from scramble sequence from scramble sequence and second pseudo random sequence, generate the scrambler sequence c (n) that is used for scrambling or descrambling.
The scrambling code sequence generation method that is used for scrambling or descrambling that present embodiment provides, according to the Metzler matrix that sets in advance with initial scrambler sequence be converted into through default bit after scrambling from scramble sequence, and then obtain scrambler sequence for scrambling or descrambling, simplify the scrambler sequence generative process, shorten the scrambler sequence rise time, accelerate wireless communication system scrambling or scramble process speed, conserve system resources.
The scrambling code sequence generation method flow chart that is used for scrambling or descrambling that Fig. 2 provides for another embodiment of the present invention, as shown in Figure 2, this method comprises:
201, obtain Metzler matrix, this matrix is used for obtaining first pseudo random sequence of initiation sequence process after scrambling of first pseudo random sequence from scramble sequence;
This process is specially:
201a, the initial matrix of Metzler matrix is set, initial matrix is to have on the 0th row～the 30 row, the 0th row～the 30 row and the counter-diagonal that element is 1, all the other elements are 0 square formation;
201b, with each numerical value of the 0th row～the 3 row of matrix by the row operation that adds up, the numerical value of k row is odd number after the operation if add up, then the numerical value of matrix the 30th row k row is put 1, if even number, then the numerical value of matrix the 30th row k row is put 0, and former the 1st～former the 30th row in the matrix upwards is offset delegation successively, obtains the matrix through bit correspondence after scrambling, wherein, 0≤k≤30;
201c, to repeating the 201b operation through a bit corresponding matrix after scrambling, obtain through default bit corresponding Metzler matrix after scrambling.
Because the first pseudo random sequence x
1(n) and the second pseudo random sequence x
2(n) be respectively 31 bits, then can think the first pseudo random sequence x
1(n) and the second pseudo random sequence x
2(n) take register from the 0th～the 30th 31 bits respectively, each bit register storage x
1(n) or x
2(n) bit value corresponding in.
According to: x
1(n+31)=(x
1(n+3)+x
1(n+2)+x
1(n+1)+x
1(n)) mod2 and x
2(n+31)=(x
2(n+3)+x
2(n)) mod2
With x
1(n) generative process of Metzler matrix is described for example, the first pseudo random sequence x
1(n) initiation sequence comprises 31 bits, and this 31 bit information is sent to x respectively
1(n) in 31 bit register, this 31 bit is expressed as a from high to low
30, a
29, a
28... a
2, a
0, through the x of 1 bit after scrambling
1(n) 31 bits of sequence are for being expressed as b from high to low
30, b
29, b
28... b
2, b
0, through the x of 1600 bits after scrambling
1(n) 31 bits of sequence are expressed as c from high to low
30, c
29, c
28... c
2, c
1, because x
1(n) initiation sequence with can be expressed as through the sequence of 0 bit after scrambling:
[a
30?a
29?a
28...a
2?a
0]
T＝M
0×[a
30?a
29?a
28...a
2?a
0]
T；
As can be seen,
With M
0Be set to the initial matrix of Metzler matrix, x
1(n) initiation sequence with can be expressed as through the sequence of 1 bit after scrambling:
[b
30?b
29?b
28...b
2?b
0]
T＝M
1×[a
30?a
29?a
28...a
2?a
0]
T；
X then
1(n) initiation sequence with can be expressed as through the sequence of 1600 bits after scrambling:
[c
30?c
29?c
28...c
2?c
0]
T＝M
1600×[a
30?a
29?a
28...a
2?a
0]
T；
Wherein, M
1, M
1600Be transition matrix, T is expressed as transpose of a matrix.M
2... M
nRepresent x respectively
2(n) initiation sequence respectively with through 2 bits to the corresponding transition matrix of the sequence of n bit after scrambling.M then
nCan obtain by the following method:
Initial matrix M
00～30 the row respectively with x
1(n) each register correspondence of initiation sequence;
According to x
1(n+31)=(x
1(n+3)+x
1(n+2)+x
1(n+1)+x
1(n)) mod2 works as x
1(n) initiation sequence carry out 1 bit when scrambling, x
1(n) numerical value in the 0th in initiation sequence register～3rd 0 carries out being input in the 30th bit register behind the xor operation, original numerical value moves in the 29th bit register in the 30th bit register, the rest may be inferred, the former the 29th～the 1st moves forward successively for the numerical value in the register, namely the numerical value in the 30th～the 1st bit register enters respectively in the 29th～the 0th bit register, at this moment x
1(n) initiation sequence finished 1 bit from scrambling, export a scrambler bit value.Around this principle, with M
0The numerical value of the 0th～3 row carry out adding up as the numerical value of the 30th row by row, if the numerical value of k row is odd number after the operation that adds up, then with initial matrix M
0The numerical value of the 30th row k row puts 1, if even number then puts 0 with the numerical value of initial matrix the 30th row k row, and the 1st in the initial matrix～the 30th row upwards is offset delegation successively and goes as the 0th～29 of initial matrix, has formed new matrix M this moment
1, with matrix M
1As new initial matrix, repeat aforesaid operations, then can obtain x
1(n) initiation sequence by that analogy, can obtain the Metzler matrix through 1600 bits correspondence after scrambling through the sequence of 2 bits after scrambling.
202, obtain the initiation sequence of first pseudo random sequence;
The initiation sequence of first pseudo random sequence can generate according to the configuration information of wireless communication system, this configuration information comprises cell id, information such as subframe numbers and ID users, in the LTE system, can determine the initiation sequence of first pseudo random sequence according to the type of different channels, owing to comprised the various configuration informations of user in the initiation sequence of this scrambler sequence, therefore, at receiving terminal, the user can resolve according to the configuration information of self, realization has only the specific user can obtain the data of transmission, and the third party can't obtain, thereby has guaranteed the safety of radio communication.Except the LTE system, present embodiment can also be applied to mobile partnership of future generation according to the method for the various information generation initiation sequences of wireless communication system configuration, perhaps be applied to other various forms of wireless communication systems, to guarantee the fail safe of transmission data.
203, obtain second pseudo random sequence that the initiation sequence of second pseudo random sequence carries out obtaining from scramble sequence after scrambling;
Because the initiation sequence of second pseudo random sequence is definite value, therefore, can directly obtain second pseudo random sequence that after scrambling, obtains through 1600 bits from scramble sequence from the method for scramble sequence according to existing second pseudo random sequence of obtaining.Also can adopt the mode of default Metzler matrix, initiation sequence and the default Metzler matrix of second pseudo random sequence multiplied each other, to obtain second pseudo random sequence that after scrambling, obtains through 1600 bits from scramble sequence.
204, the initiation sequence of first pseudo random sequence and default Metzler matrix are multiplied each other, generate first pseudo random sequence from scramble sequence;
Because a
30, a
29, a
28... a
2, a
0Can pass through the first pseudo random sequence x
1(n) initiation sequence draws, because the initiation sequence of first pseudo random sequence is initiation sequence and the M of first pseudo random sequence from scramble sequence through first pseudo random sequence that the n bit obtains after scrambling
nProduct, therefore, can be according to M
1600Directly draw x
1(1600)～x
1(1630) sequence and x
1(n) initiation sequence bit a
30, a
29, a
28... a
2, a
0Corresponding relation, and then can draw x
1(1600)～x
1(1630) the concrete numerical value of each bit in, x
1(1600)～x
1(1630) sequence and x
1(n) initiation sequence bit a
30, a
29, a
28... a
2, a
0Corresponding relation as follows:
x
1(1600)＝a5+a6+a13+a14+a20+a22+a25+a26+a29+a30；
x
1(1601)＝a0+a1+a2+a3+a6+a7+a14+a15+a21+a23+a26+a27+a30；
x
1(1602)＝a0+a4+a7+a8+a15+a16+a22+a24+a27+a28；
x
1(1603)＝a1+a5+a8+a9+a16+a17+a23+a25+a28+a29；
x
1(1604)＝a2+a6+a9+a10+a17+a18+a24+a26+a29+a30；
x
1(1605)＝a0+a1+a2+a7+a10+a11+a18+a19+a25+a27+a30；
x
1(1606)＝a0+a8+a11+a12+a19+a20+a26+a28；
x
1(1607)＝a1+a9+a12+a13+a20+a21+a27+a29；
x
1(1608)＝a2+a10+a13+a14+a21+a22+a28+a30；
x
1(1609)＝a0+a1+a2+a11+a14+a15+a22+a23+a29；
x
1(1610)＝a1+a2+a3+a12+a15+a16+a23+a24+a30；
x
1(1611)＝a0+a1+a4+a13+a16+a17+a24+a25；
x
1(1612)＝a1+a2+a5+a14+a17+a18+a25+a26；
x
1(1613)＝a2+a3+a6+a15+a18+a19+a26+a27；
x
1(1614)＝a3+a4+a7+a16+a19+a20+a27+a28；
x
1(1615)＝a4+a5+a8+a17+a20+a21+a28+a29；
x
1(1616)＝a5+a6+a9+a18+a21+a22+a29+a30；
x
1(1617)＝a0+a1+a2+a3+a6+a7+a10+a19+a22+a23+a30；
x
1(1618)＝a0+a4+a7+a8+a11+a20+a23+a24；
x
1(1619)＝a1+a5+a8+a9+a12+a21+a24+a25；
x
1(1620)＝a2+a6+a9+a10+a13+a22+a25+a26；
x
1(1621)＝a3+a7+a10+a11+a14+a23+a26+a27；
x
1(1622)＝a4+a8+a11+a12+a15+a24+a27+a28；
x
1(1623)＝a5+a9+a12+a13+a16+a25+a28+a29；
x
1(1624)＝a6+a10+a13+a14+a17+a26+a29+a30；
x
1(1625)＝a0+a1+a2+a3+a7+a11+a14+a15+a18+a27+a30；
x
1(1626)＝a0+a4+a8+a12+a15+a16+a19+a28；
x
1(1627)＝a
1+a
5+a
9+a
13+a
16+a
17+a
20+a
29；
x
1(1628)＝a
2+a
6+a
10+a
14+a
17+a
18+a
21+a
30；
x
1(1629)＝a
0+a
1+a
2+a
7+a
11+a
15+a
18+a
19+a
22；
x
1(1630)＝a
1+a
2+a
3+a
8+a
12+a
16+a
19+a
20+a
23
205, first pseudo random sequence is carried out XOR from scramble sequence by bit from scramble sequence and second pseudo random sequence, obtain the scrambler sequence for scrambling or descrambling.
According to formula c (n)=(x
1(n+N
c)+x
2(n+N
c)) mod 2 and the first pseudo random sequence x that gets access to
1(n) initiation sequence is through N
cFirst pseudo random sequence of bit after scrambling is from scramble sequence and the second pseudo random sequence x
2(n) initiation sequence is through N
cSecond pseudo random sequence of bit after scrambling obtained scrambler sequence c (n) for scrambling or descrambling from scramble sequence.
The scrambling code sequence generation method that present embodiment provides, the Metzler matrix that sets in advance according to the generation principle of scrambler sequence, with initial scrambler sequence be converted into through default bit after scrambling from scramble sequence, this sequence can be directly used in carries out scrambling or descrambling to the transmission data, overcome prior art scrambler sequence generative process complexity, Shi Yanchang, cause wireless communication system scrambling or scramble process speed slow, the defective of the problem of waste system resource, realize simplifying the scrambler sequence generative process, shorten the scrambler sequence rise time, accelerate wireless communication system scrambling or scramble process speed, conserve system resources.
One of ordinary skill in the art will appreciate that: all or part of step that realizes said method embodiment can be finished by the relevant hardware of program command, aforesaid program can be stored in the computer read/write memory medium, this program is carried out the step that comprises said method embodiment when carrying out; And aforesaid storage medium comprises: various media that can be program code stored such as ROM, RAM, magnetic disc or CD.
The scrambler sequence generator structural representation that is used for scrambling or descrambling that Fig. 3 provides for one embodiment of the invention, as shown in Figure 3, this device comprises: first acquisition module 31, first generation module 32, second generation module 33 and the 3rd generate module 34; Wherein, first acquisition module 31 is used for obtaining the initiation sequence of first pseudo random sequence; The initiation sequence that first generation module 32 is used for obtaining second pseudo random sequence through second pseudo random sequence that after scrambling, obtains from scramble sequence; Second generation module 33 is used for initiation sequence and the default Metzler matrix of first pseudo random sequence are multiplied each other, and generates first pseudo random sequence from scramble sequence; The 3rd generates module 34 is used for first pseudo random sequence is carried out XOR from scramble sequence by bit from scramble sequence and second pseudo random sequence, obtains the scrambler sequence for scrambling or descrambling.
Wherein, be used for the scrambler sequence c (n) of scrambling or descrambling by sequence x
1(n) and x
2(n) synthetic, the second pseudo random sequence x
2(n) x in the initiation sequence
2(0)=1, x
2(n)=0, i.e. x
2(n)=0 initiation sequence is fixed value, and the variation with channel does not change; And the first pseudo random sequence x
1(n) initiation sequence is different along with the difference of channel type, the initiation sequence of first pseudo random sequence is obtained by first acquisition module 31, the initiation sequence of this first pseudo random sequence can generate according to the wireless communication system configuration information, this information comprises current area number, subframe numbers, information such as ID users, for example in the LTE system environments, the initiation sequence of all kinds channel is all inequality, first acquisition module 31 can different channel types obtains the initiation sequence of first pseudo random sequence, the generation that faces down moves partnership and other various forms of wireless communication systems and applied environment also can obtain initiation sequence according to the wireless communication system configuration information, the scrambler sequence of this initiation sequence through after scrambling, generating, the user can be resolved according to the configuration information of self at receiving terminal, make the transmission data be difficult to be obtained by the third party, guaranteed the fail safe of transmission data.
According to formula c (n)=(x
1(n+N
c)+x
2(n+N
c)) among the mod 2, the first pseudo random sequence x
1(n) initiation sequence and the second pseudo random sequence x
2(n) initiation sequence needs through N respectively
cBit after scrambling, carry out the binary arithmetic operation by the bit XOR again, synthetic sequence c (n) could carry out scrambling or scramble process to former transmission data as scrambler sequence.This is to be determined by the randomness of scrambler sequence, scrambler sequence through several times after scrambling, in the scrambler sequence 0 and 1 probability that occurs about equally, randomicity of sequences is better, makes the scramble sequence that obtains after the scrambling operation have very strong anti-interference.And can determine N in the LTE system according to different applied environments and demand from the number of times of scrambling
c=1600, but be not limited in other application scenarios 1600 bits from scrambling.
And 1600 times can make the generation of scrambler sequence become very complicated from the scrambling process, and the time prolong waste system resource.Because x
2(n) initiation sequence is fixed value, therefore directly draws x by first generation module 32
2(n) be that second pseudo random sequence is from scramble sequence in the sequence of 1600 bits after scrambling.For x
1(n), because x
1(n) initiation sequence changes along with the variation of current area number, subframe numbers, ID users and channel type, therefore sets in advance matrix M in second generation module 33, makes x
1(n) initiation sequence multiplies each other with default matrix M, directly obtains through first pseudo random sequence of 1600 bits after scrambling from scramble sequence, and Metzler matrix can be according to the first pseudo random sequence x
1(n) formula obtains, be specifically as follows: because first pseudo random sequence of the default bit gained after scrambling of process is the initiation sequence of first pseudo random sequence and the product of Metzler matrix from scramble sequence, therefore, the initiation sequence that can draw first pseudo random sequence according to the formula definition of first pseudo random sequence carries out 1 bit from the process of scrambling, and then the initiation sequence that obtains first pseudo random sequence through 1 bit from the corresponding Metzler matrix of scrambling, again because the first pseudo random sequence x
1(n) each time that initial scrambler sequence is carried out is identical from its process of scrambling, therefore, the initiation sequence that can obtain first pseudo random sequence from the method for the corresponding Metzler matrix of scrambling through 1 bit according to the initiation sequence that obtains first pseudo random sequence through 1600 bits from the corresponding Metzler matrix of scrambling, the initiation sequence that can obtain first pseudo random sequence by this Metzler matrix through 1600 bits after scrambling first pseudo random sequence from scramble sequence, though the second pseudo random sequence x
2(n) be fixed value, but still can in second generation module 33, adopt the mode of default Metzler matrix to generate through second pseudo random sequence of 1600 bits after scrambling from scramble sequence.Again according to c (n)=(x
1(n+N
c)+x
2(n+N
c)) mod 2, in the 3rd generation module 34, first pseudo random sequence is carried out by the bit XOR from scramble sequence from scramble sequence and second pseudo random sequence, generate the scrambler sequence c (n) that is used for scrambling or descrambling.
The scrambler sequence generator that present embodiment provides, according to the Metzler matrix that sets in advance with initial scrambler sequence be converted into through default bit after scrambling from scramble sequence, this scrambler sequence is used for the transmission data are carried out scrambling or descrambling, simplify the scrambler sequence generative process, shorten the scrambler sequence rise time, accelerate wireless communication system scrambling or scramble process speed, conserve system resources.
The scrambler sequence generator structural representation that is used for scrambling or descrambling that Fig. 4 provides for another embodiment of the present invention, as shown in Figure 4, this device comprises: first acquisition module 31, first generation module 32, second generation module 33 and the 3rd generate module 34.Wherein, second generation module 33 can comprise: Metzler matrix generation module 331 is used for generating and storing Metzler matrix; This Metzler matrix generation module 331 can specifically comprise: first processing sub 3311, second processing sub 3312 and control submodule 3313; Wherein, first processing sub 3311 is used for arranging the initial matrix of Metzler matrix, and initial matrix is to have on the 0th row～the 30 row, the 0th row～the 30 row and the width of cloth diagonal that element is 1, all the other elements are 0 square formation; Second processing sub 3312 is used for according to first pseudo random sequence each numerical value of the 0th row～the 3 row of matrix by the row operation that adds up, the numerical value of k row is odd number after the operation if add up, then the numerical value of matrix the 30th row k row is put 1, if even number, then the numerical value of matrix the 30th row k row is put 0, and former the 1st～former the 30th row in the matrix upwards is offset delegation successively, obtain through a bit corresponding matrix after scrambling, 0≤k≤30; Control submodule 3313 to handling through the matrix of n bit after scrambling, obtains the matrix through n+1 bit correspondence after scrambling for control second processing sub 3312, up to the matrix that obtains through default bit correspondence after scrambling, wherein n 〉=1.
Wherein, the generative process of Metzler matrix sees method embodiment for details, repeats no more.Generate Metzler matrix in advance by Metzler matrix generation module 331, first obtains the configuration information that submodule 311 gets access to wireless communication system, and this configuration information comprises cell id, subframe numbers and ID users, and these information are different along with the difference of channel type.Second obtains submodule 312 generates the initiation sequence of first pseudo random sequence according to the configuration information of this wireless communication system, again by second generation module 33 according to Metzler matrix, initiation sequence and the Metzler matrix of first pseudo random sequence multiplied each other, obtain through N
cFrom first pseudo random sequence of scrambling from scramble sequence; And the second pseudo random sequence x
2(n) initiation sequence is fixed value, and therefore first generation module 32 can directly obtain through N
cThe inferior second pseudo random sequence x from scrambling
2(n) from scramble sequence.
The scrambler sequence generator that present embodiment provides, according to the Metzler matrix that sets in advance with initial scrambler sequence be converted into initiation sequence through default bit after scrambling from scramble sequence, and then obtain scrambler sequence for scrambling or descrambling, simplify the scrambler sequence generative process, shorten the scrambler sequence rise time, wireless communication system scrambling or scramble process speed have been accelerated, conserve system resources.
Scrambling or descrambling system structural representation that Fig. 5 provides for one embodiment of the invention, as shown in Figure 5, this system comprises: scrambler sequence generator 51 and scrambling or descrambler 52; Wherein, scrambler sequence generator 51 is used for obtaining the initiation sequence of first pseudo random sequence, multiplies each other according to the initiation sequence of this first pseudo random sequence and the Metzler matrix of presetting, and generates first pseudo random sequence from scramble sequence; Obtain second pseudo random sequence of initiation sequence process after scrambling of second pseudo random sequence from scramble sequence; And this first pseudo random sequence carried out XOR from scramble sequence by bit from scramble sequence and this second pseudo random sequence, obtain the scrambler sequence for scrambling or descrambling; Scrambling or descrambler 52 are used for according to scrambler sequence the transmission data being carried out scrambling or descrambling.
Obtain process for the scrambler sequence of scrambling or descrambling referring to aforesaid scrambler sequence generator embodiment for scrambling or descrambling by scrambler sequence generator 51, repeat no more.After c (n) sequence that draws for scrambling or descrambling, can carry out scrambling or scramble process according to c (n) to the transmission data by scrambling or descrambler 52.Be example with the scrambling, the transmission data carried out scrambling handle the scrambling algorithm of foundation and be:
Wherein, q represents a day wire size, in the scrambling processing procedure, also can not consider this parameter, namely can not consider concrete sky wire size in the scrambling process; B (i) is expressed as former transfer sequence, and c (i) is expressed as the scrambler sequence for scrambling,
The sequence of back output is handled in expression through scrambling; B (i) sequence and c (i) sequence step-by-step XOR can obtain sequence
Utilize the formula of scrambling algorithm can realize the parallel scrambling of former transfer sequence or serial scrambling; Parallel scrambling can be simultaneously carried out scrambling to the former transfer sequence of N bit, and N is the degree of parallelism of parallel scrambling, and N can be configured according to demand, for example: can be simultaneously to the scrambling that walks abreast of the list entries of 8 bits or 16 bits.When walking abreast scrambling, need to produce the scrambler sequence of 8 bits or 16 bits, because the initial length of scrambler sequence is 31 bits, therefore, this scrambler sequence can be the scrambling that walks abreast of 31 list entries to degree of parallelism at most.When carrying out the serial scrambling, bit of every input, the corresponding scrambler that produces a bit carries out XOR with input bit position and scrambler, exports the scrambling bit of this input bit position correspondence.Descrambling refers at receiving terminal, uses the operation of identical scrambler sequence to reducing through the transport stream of transmitting terminal scrambling, can obtain former transmission data by this operation.
Owing to the configuration information of the scrambler sequence that is used for scrambling with wireless system changes, therefore, after the scrambling
Also change along with change in information such as different channels, user ID or residential quarter ID, make the data of wireless communication system transmission to be received by specific user, other users can't obtain, and have realized the protection to the transmission data.
Descrambling is identical with the process of scrambling, at first needs to produce and the on all four scrambler sequence c of transmitting terminal (n), this scrambler sequence and the scramble sequence of handling through scrambling is carried out the step-by-step XOR, thereby obtain scrambling sequence.
The scrambling that present embodiment provides or descrambling system, according to the Metzler matrix that sets in advance with initial scrambler sequence be converted into initiation sequence through default bit after scrambling from scramble sequence, and then obtain scrambler sequence for scrambling or descrambling, according to the scrambler sequence that generates the transmission data are carried out scrambling or descrambling again, simplify the scrambler sequence generative process, shorten the scrambler sequence rise time, and then shortened the transmission data have been carried out scrambling or descrambling time, wireless communication system scrambling or scramble process speed have been accelerated, conserve system resources.
It should be noted that at last: above embodiment only in order to technical scheme of the present invention to be described, is not intended to limit; Although with reference to previous embodiment the present invention is had been described in detail, those of ordinary skill in the art is to be understood that: it still can be made amendment to the technical scheme that aforementioned each embodiment puts down in writing, and perhaps part technical characterictic wherein is equal to replacement; And these modifications or replacement do not make the essence of appropriate technical solution break away from the spirit and scope of various embodiments of the present invention technical scheme.
Claims (8)
1. a scrambling code sequence generation method that is used for scrambling or descrambling is characterized in that, comprising:
A, the initial matrix of Metzler matrix is set, described initial matrix is to have on the 0th row～the 30 row, the 0th row～the 30 row and the counter-diagonal that element is 1, all the other elements are 0 square formation;
B, according to first pseudo random sequence with each numerical value of the 0th row～the 3 row of matrix by the row operation that adds up, if the numerical value of k row is odd number after the described operation that adds up, then the numerical value of matrix the 30th row k row is put 1, if even number, then the numerical value of matrix the 30th row k row is put 0, and former the 1st～former the 30th row in the matrix upwards is offset delegation successively, obtain through a bit corresponding matrix after scrambling, 0≤k≤30;
C, repeat the b operation to described through a bit corresponding matrix after scrambling, obtain through default bit corresponding Metzler matrix after scrambling;
Obtain the initiation sequence of first pseudo random sequence;
Obtain second pseudo random sequence of initiation sequence process after scrambling of second pseudo random sequence from scramble sequence, and initiation sequence and the default described Metzler matrix of described first pseudo random sequence multiplied each other, generate first pseudo random sequence from scramble sequence;
Described first pseudo random sequence is carried out XOR from scramble sequence by bit from scramble sequence and described second pseudo random sequence, obtain the scrambler sequence for scrambling or descrambling.
2. method according to claim 1 is characterized in that, described default Metzler matrix is with corresponding from the default bit of scramble sequence for generating first pseudo random sequence.
3. method according to claim 1 is characterized in that, the initiation sequence of described second pseudo random sequence is default definite value.
4. method according to claim 1 is characterized in that, the initiation sequence of described first pseudo random sequence generates according to the configuration information of wireless communication system.
5. method according to claim 4 is characterized in that, described configuration information comprises cell id, subframe numbers and ID users.
6. a scrambler sequence generator that is used for scrambling or descrambling is characterized in that, comprising:
First acquisition module is for the initiation sequence that obtains first pseudo random sequence;
First generation module is used for obtaining second pseudo random sequence of initiation sequence process after scrambling of second pseudo random sequence from scramble sequence;
Second generation module is used for initiation sequence and the default Metzler matrix of described first pseudo random sequence are multiplied each other, and generates first pseudo random sequence from scramble sequence; Described second generation module comprises: the Metzler matrix generation module is used for generating and storing described Metzler matrix; Described Metzler matrix generation module comprises: first processing sub, second processing sub and control submodule, wherein, first processing sub, be used for arranging the initial matrix of described Metzler matrix, described initial matrix is to have on the 0th row～the 30 row, the 0th row～the 30 row and the counter-diagonal that element is 1, all the other elements are 0 square formation; Second processing sub, be used for according to first pseudo random sequence each numerical value of the 0th row～the 3 row of matrix by the row operation that adds up, if the numerical value of k row is odd number after the described operation that adds up, then the numerical value of matrix the 30th row k row is put 1, if even number, then the numerical value that matrix the 30th row k is listed as puts 0, and former the 1st～former the 30th row in the matrix upwards is offset delegation successively, obtain the matrix through bit correspondence after scrambling, 0≤k≤30; The control submodule for described second processing sub of control, to handling through the matrix of n bit after scrambling, obtains the matrix through n+1 bit correspondence after scrambling, until the matrix that obtains through default bit correspondence after scrambling, wherein n 〉=1;
The 3rd generates module, is used for described first pseudo random sequence is carried out XOR from scramble sequence by bit from scramble sequence and described second pseudo random sequence, obtains the scrambler sequence for scrambling or descrambling.
7. device according to claim 6 is characterized in that, described first acquisition module comprises:
First obtains submodule, is used for obtaining the configuration information of wireless communication system;
Second obtains submodule, is used for generating according to the configuration information of described wireless communication system the initiation sequence of described first pseudo random sequence.
8. a scrambling or descrambling system is characterized in that, comprising:
Scrambler sequence generator is used for: a, the initial matrix of Metzler matrix is set, described initial matrix is to have on the 0th row～the 30 row, the 0th row～the 30 row and the counter-diagonal that element is 1, all the other elements are 0 square formation; B, according to first pseudo random sequence with each numerical value of the 0th row～the 3 row of matrix by the row operation that adds up, if the numerical value of k row is odd number after the described operation that adds up, then the numerical value of matrix the 30th row k row is put 1, if even number, then the numerical value of matrix the 30th row k row is put 0, and former the 1st～former the 30th row in the matrix upwards is offset delegation successively, obtain through a bit corresponding matrix after scrambling, 0≤k≤30; C, repeat the b operation to described through a bit corresponding matrix after scrambling, obtain through default bit corresponding Metzler matrix after scrambling; Obtain the initiation sequence of first pseudo random sequence, multiply each other according to the initiation sequence of described first pseudo random sequence and the described Metzler matrix of presetting, generate first pseudo random sequence from scramble sequence; Obtain second pseudo random sequence of initiation sequence process after scrambling of second pseudo random sequence from scramble sequence; And described first pseudo random sequence carried out XOR from scramble sequence by bit from scramble sequence and described second pseudo random sequence, obtain the scrambler sequence for scrambling or descrambling;
Scrambling or descrambler are used for according to described scrambler sequence the transmission data being carried out scrambling or descrambling.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 200910087145 CN101925056B (en) | 2009-06-10 | 2009-06-10 | Scrambling code sequence generation method, device and system for scrambling or descrambling |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 200910087145 CN101925056B (en) | 2009-06-10 | 2009-06-10 | Scrambling code sequence generation method, device and system for scrambling or descrambling |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101925056A CN101925056A (en) | 2010-12-22 |
| CN101925056B true CN101925056B (en) | 2013-08-28 |
Family
ID=43339622
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN 200910087145 Active CN101925056B (en) | 2009-06-10 | 2009-06-10 | Scrambling code sequence generation method, device and system for scrambling or descrambling |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101925056B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2023200350A1 (en) * | 2022-04-14 | 2023-10-19 | Александр Валерьевич ИВАНОВ | Scrambling digital data using a base other than a power of two |
Families Citing this family (17)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP3407506A1 (en) * | 2011-02-11 | 2018-11-28 | Electronics and Telecommunications Research Institute | Wireless communication system using multiple transmission and reception points |
| CN102405602B (en) * | 2011-07-18 | 2014-04-02 | 华为技术有限公司 | Data sequence generating method and device for generating pseudorandom sequence data |
| CN104243148A (en) * | 2013-06-24 | 2014-12-24 | 中科英华湖州工程技术研究中心有限公司 | Encryption method and encryption device |
| CN104468434A (en) * | 2013-09-22 | 2015-03-25 | 中兴通讯股份有限公司 | LTE-based descrambling device and method |
| JP6535970B2 (en) * | 2014-02-26 | 2019-07-03 | シャープ株式会社 | Base station apparatus, terminal apparatus, and wireless communication method |
| CN105262557B (en) * | 2015-09-07 | 2019-02-01 | 东南大学 | A kind of generation method of pseudo-random sequence in LTE system |
| CN105391545B (en) * | 2015-11-27 | 2018-11-16 | 东南大学 | The generation method of pseudo-random sequence in a kind of LTE system |
| CN108123903B (en) * | 2016-11-29 | 2021-12-14 | 上海诺基亚贝尔股份有限公司 | Signal processing method and apparatus in communication system |
| EP3566348A1 (en) * | 2017-01-06 | 2019-11-13 | IDAC Holdings, Inc. | Error check-based synchronization and broadcast channel |
| EP3562248B1 (en) | 2017-01-11 | 2022-05-04 | Huawei Technologies Co., Ltd. | Message transmission method and device |
| CN107483152B (en) * | 2017-08-15 | 2020-04-14 | 京信通信系统（中国）有限公司 | Method, device and computer readable storage medium for sending and receiving data |
| CN110661591B (en) * | 2018-06-28 | 2022-01-25 | 中兴通讯股份有限公司 | Data processing method, apparatus and computer readable storage medium |
| CN109889863A (en) * | 2019-02-11 | 2019-06-14 | 湖南国科微电子股份有限公司 | A kind of scrambling code acquisition methods and relevant apparatus |
| CN111585777B (en) * | 2019-02-15 | 2022-04-08 | 中国移动通信有限公司研究院 | Method for generating and configuring initial phase of pseudorandom sequence and network equipment |
| CN112019325B (en) * | 2019-05-31 | 2023-07-21 | 中国移动通信有限公司研究院 | Pseudo-random sequence initialization value generation method and device and communication equipment |
| CN114884711B (en) * | 2022-04-26 | 2023-12-26 | 邦彦技术股份有限公司 | Data processing method, device, system, equipment, control device and storage medium |
| CN117785388B (en) * | 2024-02-27 | 2024-04-26 | 牛芯半导体(深圳)有限公司 | Method, device, medium and equipment for generating pseudo random sequence calculation program |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP0939552A2 (en) * | 1998-02-27 | 1999-09-01 | Kabushiki Kaisha Toshiba | Scrambler, descrambler and recording medium |
| US6414957B1 (en) * | 1997-11-28 | 2002-07-02 | Electronics And Telecommunications Research Institute | Parallel processor for use in distributed sample scrambler |
| CN101447216A (en) * | 2007-09-28 | 2009-06-03 | 英特尔公司 | Suppressing power supply noise using data scrambling in double data rate memory systems |
-
2009
- 2009-06-10 CN CN 200910087145 patent/CN101925056B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6414957B1 (en) * | 1997-11-28 | 2002-07-02 | Electronics And Telecommunications Research Institute | Parallel processor for use in distributed sample scrambler |
| EP0939552A2 (en) * | 1998-02-27 | 1999-09-01 | Kabushiki Kaisha Toshiba | Scrambler, descrambler and recording medium |
| CN101447216A (en) * | 2007-09-28 | 2009-06-03 | 英特尔公司 | Suppressing power supply noise using data scrambling in double data rate memory systems |
Non-Patent Citations (1)
| Title |
|---|
| JP特开2008-165008A 2008.07.17 |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2023200350A1 (en) * | 2022-04-14 | 2023-10-19 | Александр Валерьевич ИВАНОВ | Scrambling digital data using a base other than a power of two |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101925056A (en) | 2010-12-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101925056B (en) | Scrambling code sequence generation method, device and system for scrambling or descrambling | |
| CN102227888B (en) | Method and apparatus for generating pseudo random sequence in broadband wireless communication system | |
| US9898623B2 (en) | Method for performing an encryption with look-up tables, and corresponding encryption apparatus and computer program product | |
| Akeela et al. | Design and verification of IEEE 802.11 ah for IoT and M2M applications | |
| CN110381569A (en) | Monitor method, user equipment and the network side equipment of Physical Downlink Control Channel | |
| US11510141B2 (en) | Method, user equipment and network side device for monitoring physical downlink control channel | |
| CN104782062A (en) | Sequence generation for cell specific reference signal (crs) | |
| CN102624520B (en) | 192 bit key expansion system and method based on AES (Advanced Encryption Standard) | |
| CN116488794B (en) | Method and device for realizing high-speed SM4 password module based on FPGA | |
| CN105262557A (en) | Method for generating pseudo-random sequences in LTE (Long Term Evolution) system | |
| US7817707B2 (en) | Apparatus and method for generating ranging pseudo noise code | |
| CN103414552A (en) | Method and device for encrypting and decrypting by using binary tree traversal mode | |
| US20200052818A1 (en) | Information adding method and apparatus | |
| CN111567074A (en) | Channel transmission method and device | |
| EP2827516B1 (en) | Scrambling code generation method, apparatus and scrambling code processing apparatus | |
| CN103346878A (en) | Secret communication method based on FPGA high-speed serial IO | |
| Hegde et al. | Capacity of frequency-hop spread-spectrum multiple-access communication systems | |
| WO2014059921A1 (en) | Method and device for parallel scrambling | |
| Hao et al. | Helical interleaver set design for interleave-division multiplexing and related techniques | |
| EP3817251A1 (en) | Data processing method, device, and computer-readable storage medium | |
| WO2016128463A1 (en) | Method to generate high quality random mask from small entropy source | |
| CN102543182B (en) | Randomization circuit, memory control unit, memory, communicating system and method | |
| CN110071927B (en) | Information encryption method, system and related components | |
| Petryshyn et al. | Error protected data tranmissionon on the recursive encryption base | |
| CN111052820B (en) | System message transmission method and network equipment |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant |