CN107483152A - A kind of method for sending, receiving data, device and computer read/write memory medium - Google Patents
A kind of method for sending, receiving data, device and computer read/write memory medium Download PDFInfo
- Publication number
- CN107483152A CN107483152A CN201710696550.5A CN201710696550A CN107483152A CN 107483152 A CN107483152 A CN 107483152A CN 201710696550 A CN201710696550 A CN 201710696550A CN 107483152 A CN107483152 A CN 107483152A
- Authority
- CN
- China
- Prior art keywords
- positive integer
- data
- pseudo
- sequence
- random sequence
- 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
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
- H04L1/0041—Arrangements at the transmitter end
- H04L1/0043—Realisations of complexity reduction techniques, e.g. use of look-up tables
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
- H04L1/0045—Arrangements at the receiver end
- H04L1/0052—Realisations of complexity reduction techniques, e.g. pipelining or use of look-up tables
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
- H04L1/0056—Systems characterized by the type of code used
- H04L1/0064—Concatenated codes
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
- H04L1/0056—Systems characterized by the type of code used
- H04L1/0071—Use of interleaving
Abstract
The present invention provides a kind of method for sending, receiving data, device and computer read/write memory medium, in the case where consuming resource is few, realizing quick scrambling or the descrambling of the communication information.This, which states method, includes：Obtain the concatenated code and UCI control information of upstream data；Channel multiplexing is carried out with interweaving to the concatenated code and the UCI control information, obtains information to be scrambled；Obtain scramble sequence corresponding with initial value N, wherein, the scramble sequence is obtained based on the first pseudo-random sequence and the second pseudo-random sequence, and first pseudo-random sequence is obtained based on positive integer N1_data corresponding with the initial value N and positive integer x1_data；Second pseudo-random sequence is obtained based on positive integer N2_data corresponding with the initial value N and positive integer x2_data；Using the scramble sequence, the information to be scrambled is scrambled, obtains scrambled information；The scrambled information is sent to base station.
Description
Technical field
The present invention relates to communication technical field, more particularly to a kind of method for sending, receiving data, device and computer can
Read storage medium.
Background technology
With the continuous development of modern communication technology, 4G communication of the communication technology from original 2G Communication Developments till now,
And while with development communication technologies, also along with the lifting of communication function and network performance, as traffic rate is higher, communication
It is more reliable, communication spectrum utilization rate is higher, communication overlay face is wider etc., and during stating function in realization, technical staff
By being handled using multiple processing methods and step the initial data of communication, the information after being handled is to meet each
Demand is wirelessly transferred under kind scene.
, can in order to ensure information in LTE (Long Term Evolution, Long Term Evolution) wireless communication field
By transmitting, the error control mechanism of HARQ (mixed spin system) is employed.In the harq, transmitting terminal can be sent with one
Determine the data of redundancy, receiving terminal carries out forward error correction (FEC) first, and debit passes through if still correct decoding is unable to
ACK (positive acknowledgment)/NACK (NACK) tells sender to resend data, the general abbreviation A/N of ACK/NACK.Therefore A/
N transmitting plays vital effect in HARQ retransmission mechanism.
It is good and when channel relevancy is low in channel quality in LTE wireless communications field, can use enter more it is more
Go out (MIMO), transmit more data as far as possible, to improve the speed of communication；Channel relevancy by the order RI of channel matrix come
Represent, the order that receiving terminal estimates channel matrix by calculating feeds back to transmitting terminal, and transmitting terminal selects according to feedack
Suitable transmission mode.
It can be seen that the transmitting of the control information such as A/N, RI (UCI) is related to the transmitting of data, traffic rate and frequency
Utilization rate is composed, and in the prior art, technical staff is in UCI information processing procedure before sending, just including at scrambling
Reason, so that UCI information more conforms to the technical requirements of transmission in transmitting procedure, lift the accuracy rate of transmission.
But in specific implementation process, those skilled in the art at least have found following problem：
On the one hand, in LTE wireless communications, Scrambling Operation is carried out before transmission to the information transmitted of needs, it is necessary to
Corresponding scrambler sequence is firstly generated, and the generation method of scrambler sequence is defined in LTE wireless network communication standards, it is given birth to
Into computation complexity it is relevant with preset constant Nc value, in LTE wireless communications, it is specified that Nc value be 1600, that is, exist
, it is necessary to carry out the prefix operation of 1600 times before generating effective scrambler sequence, this considerably increases in generation scrambler sequence mistake
System resource in journey takes, and the time of required consuming, it is clear that can not meet in current high-speed communication to UCI information
The quick requirement for scrambling and descrambling.
On the other hand, a kind of method of direct result look-up table is also provided in the prior art, i.e., in advance whole with movement
When holding UE foundation connections, the corresponding scrambler sequence in value different networks temporary mark (RNTI) in all subframes is generated
Look-up table, so as to when receiving terminal receives the information that mobile terminal sends over and descrambles to it, can directly pass through
The mode quick obtaining scrambler sequence tabled look-up, so as to realize quick descrambling operation.But because UE is in present sub-frame occupancy resource
Difference, scrambling code sequence length is also different, therefore the scrambler sequence look-up table to be generated must be generated by maximum length, especially
The maximum length scrambler sequence of 10 subframes must be then generated in frequency duplex communications (FDD) system.Meanwhile in big system
The growth of UE connection numbers also makes the memory headroom that expends required for scrambler sequence look-up table also in the growth of synchronous geometry quantity,
This just constrains big system cost and capacity.
The content of the invention
The embodiment of the present invention provides a kind of method for sending, receiving data, device and computer read/write memory medium, uses
In solving to exist in the prior art in the scrambling to the communication information or descrambling procedure, in the presence of expending, the time is long, it is excessive to take resource
Technical problem.
First aspect, there is provided a kind of method for sending data, applied to mobile terminal, methods described includes：Obtain up
The concatenated code and UCI control information of data；Channel multiplexing is carried out with interweaving to the concatenated code and the UCI control information, obtained
Obtain information to be scrambled；Scramble sequence corresponding with initial value N is obtained, wherein, the scramble sequence is to be based on the first pseudorandom sequence
Row obtain with the second pseudo-random sequence, and first pseudo-random sequence is to be based on positive integer N1_ corresponding with the initial value N
Data and positive integer x1_data is obtained；Second pseudo-random sequence is to be based on positive integer N2_ corresponding with the initial value N
Data and positive integer x2_data is obtained；Using the scramble sequence, the information to be scrambled is scrambled, obtained scrambled
Information；The scrambled information is sent to base station.
With reference in a first aspect, in the first possible embodiment of first aspect, the acquisition is corresponding with initial value N
Scramble sequence, including：The positive integer N1_data and positive integer x1_data corresponding with the initial value N is obtained, and
Based on the positive integer N1_data and the positive integer x1_data, first pseudo-random sequence is obtained；Obtain and described first
The positive integer N2_data and positive integer x2_data corresponding to initial value N, and based on the positive integer N2_data and it is described just
Integer x2_data, obtain second pseudo-random sequence；Based on first pseudo-random sequence and the second pseudorandom sequence
Row, obtain scramble sequence.
In embodiments of the present invention, by the way that the direct of first pseudo-random sequence and the second pseudo-random sequence will be obtained
Method is computed repeatedly, is converted into by obtaining positive integer N1_data and positive integer x1_ corresponding with first pseudo-random sequence
Data, and the positive integer N2_data and positive integer x2_data corresponding with second pseudo-random sequence is obtained, so as to
Quick obtaining is to first pseudo-random sequence and second pseudo-random sequence, so as to greatly optimize computing complexity
Degree, reduces operand, saves the occupancy of system operation time and system resource.
With reference to the first possible embodiment of first aspect, in second of possible embodiment of first aspect
In, it is described to be based on first pseudo-random sequence and second pseudo-random sequence, scramble sequence is obtained, including：Based on formula：
C (n)=(x1(n+N)+x2(n+N)) %2, scramble sequence is obtained；Wherein, x1(n+N) first pseudo-random sequence, x are characterized2
(n+N) second pseudo-random sequence is characterized, n value is the positive integer from 0 to 30, and %2 is used for sign progress Modulo-two operation and asked
Value, N is positive integer value.
With reference to first aspect the first and second in any one possible embodiment, the of first aspect
It is described to obtain the positive integer N1_data and positive integer x1_ corresponding with the initial value N in three kinds of possible embodiments
Data, including：Based on formula：x1(n+31)=(x1(n)+x1(n+3)) %2, obtain first pseudo-random sequence first are pre-
It is if regular：x1(N)=N10*x1(0)+N11*x1(1)+…+N130*x1(30), wherein, first pseudo-random sequence it is initial
Value is characterized as：x1(0)=1, x1(n)=0；N value is the positive integer from 0 to 30；Based on first preset rules, obtain with
First positive integer sequence N corresponding to the initial value N10、N11...N130, wherein, x1(N) first pseudo-random sequence is characterized
N-th value；Modulo-two operation evaluation is carried out respectively to the first positive integer sequence, first through computing positive integer corresponding to acquisition
Sequence N1’0,N1’1,…,N1’30；With N1' 0 is low level, N1' 30 carry out group to described first for a high position through computing positive integer sequence
Close, obtain the positive integer N1_data；With x1(0) it is low level, x1(30) to be high-order to the initial of first pseudo-random sequence
Value is combined, and obtains the positive integer x1_data.
With reference to the third possible embodiment of first aspect, in the 4th kind of possible embodiment of first aspect
In, it is described to be based on the positive integer N1_data and positive integer x1_data, first pseudo-random sequence is obtained, including：
By the N1_data and x1_data progress and computing, the first operation values are obtained；Based on first operation values, institute is obtained
State the number C1 that each bit in the first operation values is 1；The evaluation of mould 2 is carried out to the C1, obtains the first pseudo-random sequence x1
(N) value, so as to obtain first pseudo-random sequence；It is described to be based on the positive integer N2_data and positive integer x2_
Data, second pseudo-random sequence is obtained, including：The N2_data and the x2_data are carried out and computing, obtain the
Two operation values；Based on second operation values, the number C2 that each bit in second operation values is 1 is obtained；The C2 is entered
The evaluation of row mould 2, obtain the second pseudo-random sequence x2(N) value, so as to obtain second pseudo-random sequence.
In embodiments of the present invention, from first preset rules, due to x1(N) it is actually to be worth by multiple for 0
Or 1 value it is cumulative after, then carry out modulus to 2, the value finally given is also 0 or 1.Therefore, can be to N10、N11...N130 this
Positive integer sequence carries out the evaluation of mould 2, N corresponding to acquisition respectively1’0,N1’1,…,N1' 30 are simultaneously combined into 32 expressions just
Integer N 1_data, likewise, N10、N11...N130 are combined into another positive integer x1_data, now, described first just
Integer N 1_data and positive integer x1_data is carried out and computing, and carries out follow-up calculation step, can be achieved with quickly obtaining institute
State the first pseudo-random sequence, it is clear that, by implementing the embodiment of the present invention, because the operand in calculating process can be avoided just
Influence of the initial value N or scrambling code number n value size to computational complexity, therefore only need to use few operand, so that it may
First pseudo-random sequence is quickly obtained, there is the advantages of computing is time-consuming few, and system resource takes less, and real-time is high；Simultaneously
During the embodiment of the present invention is implemented, any influence will not be produced on normal information processing, without setting again
New module of software and hardware is counted, can greatly reduce system cost.Based on same principle, the technique effect of the embodiment of the present invention
It is equally applicable in the acquisition methods of second pseudo-random sequence, and it is described in corresponding receiving terminal progress descrambling procedure
In the acquisition methods of first pseudo-random sequence and second pseudo-random sequence, do not do excessively repeat herein.
With reference to the first possible embodiment of first aspect, in the 5th kind of possible embodiment of first aspect
In, it is described to be based on the positive integer N1_data and positive integer x1_data, first pseudo-random sequence is obtained, including：
The value of the positive integer N1_data is generated as a known look-up table, as the first pseudo-random sequence x1(n) computing
Look-up table B1；Based on the operation table B1, the first pseudo-random sequence x is obtained with reference to the positive integer x1_data1(n)；Institute
State and be based on the positive integer N2_data and positive integer x2_data, obtain second pseudo-random sequence, including：By described in
Positive integer N2_data value is generated as a known look-up table, as the second pseudo-random sequence x2(n) computing look-up table
B2；Based on the operation table B2, the second pseudo-random sequence x is obtained with reference to the positive integer x2_data2(n)。
In embodiments of the present invention, the value of the positive integer N1_data is generated into a known look-up table and preserved,
It is follow-up need to carry out Scrambling Operation every time before, can by the method for direct look-up table, directly find corresponding to just
Integer N 1_data, first pseudo-random sequence just can be quickly obtained with reference to positive integer x1_data, based on same principle,
Second pseudo-random sequence can be quickly obtained, therefore by the embodiment of the present invention, can further optimize and obtain in the prior art
The efficiency of first pseudo-random sequence and second pseudo-random sequence, the operand and system resource for reducing system disappear
Consumption, more meet the demand of high-speed communication system.
With reference to first aspect the first and second in any one possible embodiment, the of first aspect
It is described to obtain the positive integer N2_data and positive integer x2_ corresponding with the initial value N in six kinds of possible embodiments
Data, including：Based on formula：x2(n+31)=(x2(n)+x2(n+1)+x2(n+2)+x2(n+3)) %2, it is pseudo- to obtain described second
Second preset rules of random sequence：x2(N)=N20*x2(0)+N21*x2(1)+…+N230*x2(30), wherein, described second
The initial value x of pseudo-random sequence2(i) formula is passed through：Obtain, wherein, cinitValue be based on it is described it is mobile eventually
The parameter at end and the up frame number at place obtain；Based on second preset rules, corresponding with the initial value N the is obtained
Two positive integer sequence N20、N21...N230, wherein, x2(N) the n-th value of second pseudo-random sequence is characterized；To described
Two positive integer sequences carry out the evaluation of mould 2 respectively, and second through computing positive integer sequence N corresponding to acquisition2’0,N2’1,…,N2’30；
With N2' 0 is low level, N2' 30 are combined for a high position to described second through computing positive integer sequence, obtain the positive integer N2_
data；With x2(0) it is low level, x2(30) it is combined for the high-order initial value to first pseudo-random sequence, acquisition is described just
Integer x2_data.
Second aspect, there is provided a kind of method for receiving data, applied in base station, methods described includes：Receive mobile whole
Hold the communication information sent；The communication information is handled, obtains scrambled information；Obtain solution corresponding with initial value N
Disturb sequence, wherein, the scrambling sequence is obtained based on the first pseudo-random sequence and the second pseudo-random sequence, described first it is pseudo- with
Machine sequence is obtained based on positive integer N1_data corresponding with the initial value N and positive integer x1_data；Described second it is pseudo- with
Machine sequence is obtained based on positive integer N2_data corresponding with the initial value N and positive integer x2_data；Utilize the descrambling
Sequence, the scrambled information is descrambled, obtain ascending control information.
The third aspect, there is provided a kind of device for sending data, applied to mobile terminal, described device includes：Receiving module,
For obtaining the concatenated code and UCI control information of upstream data；Pretreatment module, for the concatenated code and UCI controls
Information processed carries out channel multiplexing with interweaving, and obtains information to be scrambled；Acquisition module, for obtaining scrambling corresponding with initial value N
Sequence, wherein, the scramble sequence is obtained based on the first pseudo-random sequence and the second pseudo-random sequence, first pseudorandom
Sequence is obtained based on positive integer N1_data corresponding with the initial value N and positive integer x1_data；Second pseudorandom
Sequence is obtained based on positive integer N2_data corresponding with the initial value N and positive integer x2_data；Scrambling module, for profit
With the scramble sequence, the information to be scrambled is scrambled, obtains scrambled information；Sending module, for by the warp
Scramble information is sent to base station.
Fourth aspect, there is provided a kind of device for receiving data, applied in base station, described device includes：Receiving module, use
In the communication information for receiving mobile terminal transmission；Processing module, for handling the communication information, obtain scrambled letter
Breath；Acquisition module, for obtaining scrambling sequence corresponding with initial value N, wherein, the scrambling sequence is to be based on the first pseudorandom
Sequence obtains with the second pseudo-random sequence, and first pseudo-random sequence is to be based on positive integer N1_ corresponding with the initial value N
Data and positive integer x1_data is obtained；Second pseudo-random sequence is to be based on positive integer N2_ corresponding with the initial value N
Data and positive integer x2_data is obtained；Descrambling module, for utilizing the scrambling sequence, the scrambled information is solved
Disturb, obtain descrambling information.
5th aspect, there is provided a kind of computer read/write memory medium, be stored with computer program instructions, the computer
When programmed instruction performs on computers so that the computer performs the method described in above-mentioned each side.
Technical scheme in the one or more embodiments provided by the invention described above, the present invention at least have following skill
Art effect：
1st, in embodiments of the present invention, due to by obtain in the prior art the first pseudo-random sequence and second it is pseudo- with
The formula of machine sequence is optimized, and the formula after optimization is handled, and simplifies operation content, is not being increased so as to realize
While computation complexity, the generation time of required scrambler is greatly shortened, so as to realize the quick scrambling of the communication information
Or descrambling.
2nd, in embodiments of the present invention, due to implementing to obtain first pseudo-random sequence and described the by the present invention
During two pseudo-random sequences, influence of initial value N or scrambling code number n the value size to computational complexity is avoided, because
This solves the technical problem for needing to expend a large amount of operation times and memory headroom in the prior art, greatly reduces scrambler
The generation time, and memory headroom in calculating process takes.
3rd, in embodiments of the present invention, because processing of the implementation process to the normal communication information of the embodiment of the present invention does not have
Have an impact, existing module of software and hardware is not also conflicted, therefore the module of software and hardware of system need not be redesigned again, so as to
Realize the relatively low technique effect of compatible all systems, cost of implementation.
4th, in embodiments of the present invention, by passing through the look-up table that the embodiment of the present invention is generated and the mobile terminal that communicates
It is not in contact with, therefore the effective connection number or system type for avoiding mobile terminal in the connection of big system in the prior art
The system resources consumption brought, while the positive integer value of needs can be quickly got from look-up table, so as to further drop
The low consumption during the scrambler sequence is obtained to system resource, realize the technology effect of scrambler needed for quick obtaining
Fruit.
Brief description of the drawings
Fig. 1 is the specific implementation flow chart of the communication message processing method of mobile terminal side provided in an embodiment of the present invention；
Fig. 2 is the specific implementation flow chart of the communication message processing method of base station side provided in an embodiment of the present invention；
Fig. 3 is a kind of specific implementation flow chart of method for sending data provided in an embodiment of the present invention；
Fig. 4 is a kind of specific implementation flow chart of method for receiving data provided in an embodiment of the present invention；
Fig. 5 is a kind of structural representation of device for sending data provided in an embodiment of the present invention；
Fig. 6 is the structural representation of the acquisition module in the device of the transmission data of the embodiment of the present invention；
Fig. 7 is a kind of structural representation of device for receiving data provided in an embodiment of the present invention；
Fig. 8 is the structural representation of the acquisition module in the device of the reception data of the embodiment of the present invention.
Embodiment
The embodiment of the present invention provides a kind of method for sending, receiving data, device and computer read/write memory medium, uses
In solving the generation technical problem that the time is longer, the resource consumption in generating process is excessive of scrambler sequence in the prior art.
To make the purpose, technical scheme and advantage of the embodiment of the present invention clearer, below in conjunction with the embodiment of the present invention
In accompanying drawing, the technical scheme in the embodiment of the present invention is described.
Technology described herein is not limited only to scrambling or descrambling in LTE wireless communications, it may also be used for Duo Zhongwu
Scrambling or descrambling in line network service.
Hereinafter, the part term in the embodiment of the present invention is explained, in order to skilled artisan understands that.
(1).UCI:Uplink Control Information, ascending control information.Believe including CQI, HARQ, RI, PMI
Breath, is transmitted on PUSCH, and content is that terminal reports to some control information of base station feedback, such as measurement, dispatch request, confirms to disappear
Breath etc..
(2) Physical Uplink Shared Channel (PUSCH, Physical Uplink Shared Channel) comes from for carrying
Transmission channel USCH data.One UE can have a plurality of USCH parallel, and these parallel USCH data can be in physical layer
Carry out coded combination.
(3) IDFT (Inverse Discrete Fourier Transform) inverse discrete Fourier transform.By in time domain
Reluctant signal is converted into easy-to-handle frequency-region signal, and progress Fourier inversion obtains original after the completion of analysis
Time-domain signal.
(4) scramble：It is the processing and treating method of data signal, is exactly to be multiplied with scrambler with primary signal, it is new so as to obtain
Signal.Compared with primary signal, new signal is broken up in time, in frequency.
(5) interweave：The scattered method of subsequent bits in a piece of news, i.e., the subsequent bits in a piece of news are with non-
Consecutive way is sent.
(6) term in the embodiment of the present invention " system " and " network " can be used interchangeably." multiple " refer to two or two
More than individual, in consideration of it, " multiple " can also be interpreted as " at least two " in the embodiment of the present invention."and/or", description association pair
The incidence relation of elephant, expression may have three kinds of relations, for example, A and/or B, can be represented：Individualism A, at the same exist A and
These three situations of B, individualism B.In addition, character "/", unless otherwise specified, it is a kind of to typically represent forward-backward correlation object
The relation of "or".In addition, it is necessary to understand, in the description of the embodiment of the present invention, the vocabulary such as " first ", " second ", only use
In distinguish description purpose, and it is not intended that instruction or imply relative importance, can not be interpreted as indicating or hint order.
First, the technical background of the embodiment of the present invention is introduced.
, can for ensure signal in LTE (LongTermEvolution, Long Term Evolution) wireless network access communications field
By transmission, inform that to be transmitted end current wireless by ascending control information (UCI, Uplink Control Information)
The reliability of network service, therefore, the transmitting of UCI information be related to transmission end in LTE wireless communications and by
Transmitting, traffic rate and the availability of frequency spectrum between transmission end.
On the one hand, in existing communication technology, to ensure the transmitting of information, mixed spin system is employed
(HARQ) error control mechanism.In the harq, transmitting terminal can send the data with certain redundancy, and receiving terminal first can
Forward error correction (FEC) is carried out, receiving terminal is by sending positive acknowledgment (ACK)/NACK if still correct decoding is unable to
(NACK) transmitting terminal is told to resend data, the general abbreviation A/N of ACK/NACK.
It is on the other hand, good and when channel relevancy is low in channel quality in LTE wireless network access communications field,
More data can be transmitted as far as possible by the way of multiple-input, multiple-output (MIMO), to improve the speed of communication.Channel relevancy
Represented by the order RI of channel matrix, the order that receiving terminal estimates channel matrix by calculating feeds back to transmitting terminal, transmitting terminal
Suitable transmission mode is selected according to feedack.
Therefore, understood based on above-mentioned background information, the transmitting of the ascending control information such as A/N, RI (UCI) LTE without
Gauze network access communications field plays vital effect, and it is related to traffic rate in communication process, the availability of frequency spectrum
Deng important performance.Therefore in the prior art, transmitting terminal such as precoding, is adjusted by handling before being transmitted UCI information
System, scrambling, channel multiplexing and intertexture etc., to realize the technique effect for ensureing reliability of the UCI information in transmitting procedure, relatively
Answer, be also required to handle UCI information in receiving terminal, such as precoding, demodulation, descrambling and deinterleaving, to parse
Above-mentioned processed UCI information, and reliable UCI information is obtained from the data after processing.Below in conjunction with the accompanying drawings, to the present invention
Technical scheme in embodiment is described in detail.
Referring to accompanying drawing 1, in a kind of possible implementation：
In transmitting terminal, when carrying out net operation by mobile phone, mobile phone is attached user with mobile base station first, to protect
The reliability of connection and the efficiency of communication are demonstrate,proved, mobile phone to mobile base station while data are uploaded, also on the mobile base station
UCI information is passed, specific implementation process can be：After the data that acquisition for mobile terminal is sent to needs, the data are handled,
Such as CRC check, code block segmentation, encoding block CRC check, turbo codings, rate-matched and encoding block cascade, then will
The concatenated code of acquisition carries out channel multiplexing with the UCI information obtained and interweaved, and obtains the communication information after channel interleaving, then,
Mobile terminal carries out Scrambling Operation by the scrambler of generation to the communication information, with the communication information after scramble, moves end
The communication information after the scrambling is further processed again for end, such as after the operation such as modulation, up precoding, after processing
The communication information send.
Referring to accompanying drawing 2, in alternatively possible implementation：
In receiving terminal, after mobile base station receives the communication information of user mobile phone transmission, the communication information is carried out immediately
Dissection process, so as to obtain communication data and UCI information, specific implementation process can be：Dock first the mobile base station
The information that receives carry out Fast Fourier Transform (FFT) coprocessor (FFTC), physical resource demapping, channel estimation, channel equalization,
The processing of discrete Fourier transform (IDFT) step, obtains the communication information of Preliminary Analysis, now mobile base station is according to generation
Scrambler carries out descrambling operation to the scrambled communication information of Preliminary Analysis, so as to get UCI information and data after descrambling
Information, further, the data message after descrambling is carried out channel deinterleaving, uplink demodulation, decoding, decoding block cascade and
CRC check etc. is handled, the data content after being parsed.
In embodiments of the present invention, transmitting terminal adds before the information sent to needs carries out Scrambling Operation, it is necessary to generate
Sequence is disturbed, in LTE wireless communication fields, the scramble sequence is alternatively referred to as " scrambler sequence ".Based on same principle, receiving
End, before descrambling operation is carried out to the information of reception, it is also desirable to scrambling sequence is generated, because descrambling operation is relative to scrambling behaviour
Make simply to carry out a contrary operation to the information after above-mentioned scrambled operation processing, therefore the scramble sequence and descrambling generated
Sequence is same sequence, and its generation method is also identical, therefore in following embodiments, scramble sequence is referred to scrambler sequence
Or scrambling sequence.It will be further described below the generation method of the scrambler sequence.
In existing LTE wireless communication standards, pass through formula：C (n)=(x1(n+Nc)+x2(n+Nc)) %2, obtain scrambler
Sequence c (n), wherein, x1(n+Nc) it is characterized as the first pseudo-random sequence, x2(n+Nc) it is characterized as the second pseudo-random sequence, n value
For the positive integer from 0 to 30, %2, which is used to characterize, carries out Modulo-two operation evaluation, and Nc is positive integer value, in LTE wireless communication standards
In, Nc values are 1600, therefore, scrambler sequence c (n) and a pseudo-random sequence.
By the above formula, scrambler sequence c (n) value passes through to the first pseudo-random sequence and the second pseudo-random sequence
Obtained after carrying out Modulo-two operation processing after being summed, therefore, to obtain scrambler sequence c (n) value, it is necessary to obtain the respectively
The value of one pseudo-random sequence and the second pseudo-random sequence.
Further, formula x is passed through1(n+31)=(x1(n)+x1(n+3)) %2, the first pseudo-random sequence is obtained, wherein,
Set the initial value of the first pseudo-random sequence as：x1(0)=1, x1(n)=0；N=0...30.
And pass through formula x2(n+31)=(x2(n)+x2(n+1)+x2(n+2)+x2(n+3)) %2, it is pseudo- to obtain generation second
Random sequence, wherein, the initial value of the second pseudo-random sequence passes through formulaObtain, wherein, cinitValue
Cell frame number when sending the communication information by the parameter of mobile terminal UE and the mobile terminal obtains.
Therefore by above-mentioned formula, the transmitting terminal of the communication information generates the scrambler sequence c (n) of the information sent to needs,
So as to carry out Scrambling Operation, the information after being scrambled to the information for needing to send；Based on same principle, logical
The receiving terminal of letter information, can also generate scrambler sequence c (n) by above-mentioned formula, and descrambling operation is carried out to the information received,
Information after being descrambled.
But it was found from above-mentioned formula, scrambler sequence c (n) ordered sequence is as caused by Nc positions, and in LTE channel radios
In beacon standard, Nc values are 1600, i.e., in existing LTE wireless communication technologys, to obtain scrambler sequence c (n) value, it is necessary to head
The prefix operation of 1600 times is first carried out, scrambler sequence c (n) ordered sequence value could be drawn according to above-mentioned formula, it is clear that 1600
Secondary repetitive operation both needs to expend substantial amounts of operation time, it is also desirable to takes excessive system resource, this obviously can not meet
The requirement of communication information independence fast decoding in high-speed communication.
And in the prior art there is also another scheme, by using the method for direct result look-up table, i.e., exist in advance
When establishing connection with mobile terminal UE, generate corresponding in value different networks temporary mark (RNTI) in all subframes
Scrambler sequence look-up table, can be with so as to when receiving terminal receives the information that mobile terminal sends over and it is descrambled
The quick obtaining scrambler sequence value directly by way of tabling look-up, so as to realize quick descrambling operation.
But due to mobile terminal UE present sub-frame take resource difference, scrambling code sequence length is also different, thus will
The scrambler sequence look-up table of generation must be generated by maximum length, especially then necessary in frequency duplex communications (FDD) system
Generate the maximum length scrambler sequence of 10 subframes.Meanwhile the growth of mobile terminal UE connection number also makes to disturb in big system
For the memory headroom expended required for code sequence look-up table also in the growth of synchronous geometry quantity, this just constrains the cost of big system
And capacity.
Below in conjunction with the accompanying drawings, the technical scheme in the embodiment of the present invention is described in detail.It should be noted that this hair
Embodiment in bright is served only for explaining the present invention, and cannot be used for the limitation present invention.All meet the embodiment of inventive concept
Within protection scope of the present invention, how those skilled in the art naturally is become according to the thought of the present invention if knowing
Shape.
It refer to shown in accompanying drawing 3, the embodiment of the present invention provides a kind of method for sending data, applied to mobile terminal, institute
The method of stating includes：
S10, obtain the concatenated code and UCI control information of upstream data；
S20, channel multiplexing is carried out with interweaving to the concatenated code and the UCI control information, obtains information to be scrambled；
S30, scramble sequence corresponding with initial value N is obtained, wherein, the scramble sequence is to be based on the first pseudo-random sequence
Obtained with the second pseudo-random sequence, first pseudo-random sequence is to be based on positive integer N1_data corresponding with the initial value N
Obtained with positive integer x1_data；Second pseudo-random sequence is to be based on positive integer N2_data corresponding with the initial value N
Obtained with positive integer x2_data；
S40, using the scramble sequence, the information to be scrambled is scrambled, obtains scrambled information；
S50, the scrambled information is sent to base station.
During specific implementation, mobile terminal will scramble to the communication information, will obtain a communication information first,
And the scrambler of the communication information is generated according to the communication information, the scrambler for being then based on obtaining to the communication information to carrying out
Scrambling Operation, so as to the communication information after being scrambled.Specific implementation process, it will illustrate by way of example below.
In embodiments of the present invention, mobile terminal gets first communication information and institute by performing step S10
The first parameter information is stated, by performing step S20 to obtain information to be scrambled, now above-mentioned first communication information is added
Processing is disturbed, then firstly the need of generation scrambler sequence, in embodiments of the present invention, by further performing step S30 to be disturbed
Code sequence.Illustrated below in conjunction with specific embodiment.
In embodiments of the present invention, step S30 can be during concrete implementation：
S31, the positive integer N1_data and positive integer x1_data corresponding with the initial value N is obtained, and be based on
The positive integer N1_data and positive integer x1_data, obtain first pseudo-random sequence；
S32, the positive integer N2_data and positive integer x2_data corresponding with the initial value N is obtained, and be based on
The positive integer N2_data and positive integer x2_data, obtain second pseudo-random sequence；
S33, based on first pseudo-random sequence and second pseudo-random sequence, obtain scramble sequence.
Further, in embodiments of the present invention, step S33 can be during concrete implementation：
Based on formula：C (n)=(x1(n+N)+x2(n+N)) %2, scramble sequence is obtained；
Wherein, x1(n+N) first pseudo-random sequence, x are characterized2(n+N) second pseudo-random sequence, n value are characterized
For the positive integer from 0 to 30, %2, which is used to characterize, carries out Modulo-two operation evaluation, and N is positive integer value.
From the description in background technology, the scramble sequence is obtained, it is necessary to obtain the first pseudo-random sequence first
And second pseudo-random sequence, that is, need that step S31-S32 is first carried out, and be easy to by the content disclosed in background technology
Know, the value of the first pseudo-random sequence and the second pseudo-random sequence since the 31st, the value of each all with the sequence before it
Train value is relevant, therefore can be easy to draw by recurrence relation, first pseudo-random sequence and the second pseudo-random sequence
The value of any position can be showed by its initial value.It was found from the description in background technology, based on same principle, sheet
Method described in inventive embodiments can also be used for the quick obtaining that base station end carries out the scrambling sequence of descrambling operation, therefore, rear
Repeated description is not done in continuous content.
In embodiments of the present invention, it is described to obtain the positive integer N1_ corresponding with the initial value N in step S31
Data and positive integer x1_data, can be during concrete implementation：Based on formula：x1(n+31)=(x1(n)+x1(n+
3)) %2, the first preset rules of first pseudo-random sequence are obtained：x1(N)=N10*x1(0)+N11*x1(1)+…+N130*
x1(30), wherein, the initial value of first pseudo-random sequence is characterized as：x1(0)=1, x1(n)=0；N value is from 0 to 30
Positive integer；Based on first preset rules, first positive integer sequence N corresponding with the initial value N is obtained10、
N11...N130, wherein, x1(N) the n-th value of first pseudo-random sequence is characterized；The first positive integer sequence is distinguished
Modulo-two operation evaluation is carried out, first through computing positive integer sequence N corresponding to acquisition1’0,N1’1,…,N1’30；With N1' 0 be low level,
N1' 30 are combined for a high position to described first through computing positive integer sequence, obtain the positive integer N1_data；With x1(0) it is
Low level, x1(30) it is combined for the high-order initial value to first pseudo-random sequence, obtains the positive integer x1_data.
Based on same principle, the value of the positive integer N1_data and positive integer x1_data when n takes other values can be obtained.
Further, in embodiments of the present invention, in step S31, it is described based on the positive integer N1_data and it is described just
Integer x1_data, first pseudo-random sequence is obtained, can be during concrete implementation：
By the N1_data and x1_data progress and computing, the first operation values are obtained；Based on first computing
Value, obtain the number C1 that each bit in first operation values is 1；The evaluation of mould 2 is carried out to the C1, obtain described first it is pseudo- with
Machine sequence x1(N) value, so as to obtain first pseudo-random sequence.
Different from the method for acquisition scramble sequence c (n) of the prior art from above-mentioned embodiment, the present invention is real
Multiple repetition fortune need not be carried out during first scramble sequence and second scramble sequence is obtained by applying example
Calculate, especially in existing LTE communication standard, in the case where Nc values are 1600, the embodiment of the present invention avoids a large amount of weights
Multiple computing, substantial amounts of system resource is saved, shorten the time of system generation scramble sequence, reduce and scramble sequence in generation
Caused a large amount of energy consumptions, improve Consumer's Experience during row.
In specific implementation process, the first pseudo-random sequence is quickly obtained to realize, avoids extra unnecessary fortune
Calculate, therefore preserved also by the value that the positive integer N1_data obtained is calculated first, to generate a look-up table, so as to
When needing to use the value of the positive integer N1_data each time, it is not necessary to the computing repeated again, directly pass through look-up table
Mode obtains the positive integer, just can quickly obtain first pseudo-random sequence, so as to quickly obtain scramble sequence, below will
It is illustrated in connection with specific embodiments.
In embodiments of the present invention, it is described to be based on the positive integer N1_data and positive integer x1_data, obtain institute
The first pseudo-random sequence is stated, can be during concrete implementation：The value of the positive integer N1_data one has been generated as
Look-up table is known, as the first pseudo-random sequence x1(n) computing look-up table B1；Based on the operation table B1, with reference to described
Positive integer x1_data obtains the first pseudo-random sequence x1(n)；
In a kind of possible embodiment, work as n=0, x1(31)=(1*x1(0)+0*x1(1)
+0*x1(2)+1*x1(3)+0*x1(4)+0*x1(5)+0*x1(6)+0*x1(7)+0*x1(8)+0*x1(9)
+0*x1(10)+0*x1(11)+0*x1(12)+0*x1(13)+0*x1(14)+0*x1(15)+0*x1(16)+0*x1(17)
+0*x1(18)+0*x1(19)+0*x1(20)+0*x1(21)+0*x1(22)+0*x1(23)+0*x1(24)
+0*x1(25)+0*x1(26)+0*x1(27)+0*x1(28)+0*x1(29)+0*x1(30)) %2, can be seen that just in formula
Integer sequence N10、N11...N130 value is 0 or 1, therefore with N10 is low level, N130 be a high position, then during n=0, N1_data
Real number value be represented by 5, then carry out mutually and computing, obtaining end value as 1, each bit is 1 during numerical value represents with x1_data
Result after number progress Modulo-two operation is also 1.Get the first pseudo-random sequence x1(31) value is 1.
Work as n=3, x1(34)=(0*x1(0)+0*x1(1)+0*x1(2)+1*x1(3)+0*x1(4)+0*x1(5)
+1*x1(6)+0*x1(7)+0*x1(8)+0*x1(9)+0*x1(10)+0*x1(11)+0*x1(12)+0*x1(13)
+0*x1(14)+0*x1(15)+0*x1(16)+0*x1(17)+0*x1(18)+0*x1(19)+0*x1(20)
+0*x1(21)+0*x1(22)+0*x1(23)+0*x1(24)+0*x1(25)+0*x1(26)+0*x1(27)
+0*x1(28)+0*x1(29)+0*x1(30)) %2, positive integer sequence N is can be seen that in formula10、N11...N130 take
It is worth for 0 or 1, therefore with N10 is low level, N130 for a high position, then during n=3, N1_data real number value is represented by 36, then with x1_
Data carries out phase and computing, and it is 0 to obtain end value, and each bit is that 1 number carries out the result after Modulo-two operation during numerical value represents
It is 0.Get the first pseudo-random sequence x1(34) value is 0.
Work as n=31, x1(62)=(x1(31)+x1(34)) %2, then x1And x (31)1(34) expansion substitutes into obtain：
x1(62)=(1*x1(0)+0*x1(1)+0*x1(2)+2*x1(3)+0*x1(4)+0*x1(5)+1*x1(6)
+0*x1(7)+0*x1(8)+0*x1(9)+0*x1(10)+0*x1(11)+0*x1(12)+0*x1(13)+0*x1(14)
+0*x1(15)+0*x1(16)+0*x1(17)+0*x1(18)+0*x1(19)+0*x1(20)+0*x1(21)
+0*x1(22)+0*x1(23)+0*x1(24)+0*x1(25)+0*x1(26)+0*x1(27)+0*x1(28)
+0*x1(29)+0*x1(30)) %2, N is can be seen that in formula13 value is 2, regardless of whether x1(3) it is 0 or 1, due to final
Modulo-two operation, therefore N will be passed through13*x1(3) all equivalent to (N13%2) * x1(3) value.Therefore to N10、N11...N130 sequences
Row carry out Modulo-two operation evaluation respectively, obtain corresponding through computing positive integer sequence N1’0,N1’1,…,N1' 30, wherein N1' 3
It is worth for 0, remaining positive integer sequence through computing is all 0 or 1, then can be with N1' 0 is low level, N1' 30 are a high position, then during n=31,
N1_data real number value is represented by 33, then carries out phase and computing with x1_data, and it is 1 to obtain end value, and numerical value is each in representing
Result after the number progress Modulo-two operation that bit is 1 is also 1.Get the first pseudo-random sequence x1(62) value is 1.
By above-mentioned embodiment, when n takes different values, different N1_data values can be generated, are searched so as to form
Table B1..
Based on same principle, the N2_data and corresponding look-up table B2 of the second pseudo-random sequence can be obtained, is not done herein
Excessively repeat.
Before the mobile terminal carries out Scrambling Operation to the communication data of the second bag, the mobile terminal is got first
The value of the look-up table B1 and positive integer x1_data, and quickly find corresponding positive integer N1_data's by N value
Value, so as to the first pseudo-random sequence x according to corresponding to the acquisition of above-mentioned embodiment1(n) value, based on the same principle, can be fast
Speed obtains the first pseudo-random sequence x1(n) other values, i.e., the first positive integer sequence is quickly obtained, so as to quickly obtain institute
State scramble sequence.Certainly, in the descrambling procedure of the second pseudo-random sequence and the communication information described in quick obtaining, may be based on
Same principle quickly obtains scrambling/scrambling sequence, does not do excessively repeating herein.
Obvious, can be in the case where taking considerably less system resource, greatly by above-mentioned two computing look-up table
Lifting means generates the speed of scramble sequence, with needing in the prior art according to required for different terminal equipment and different system
The system resource of occupancy, compared especially in big system, it is necessary to take substantial amounts of system resource, the embodiment of the present invention can take
In the case of considerably less system resource, while realization does not increase computation complexity, required scrambled bits are greatly shortened
Generate the time.
Further, in embodiments of the present invention, be to obtain second pseudo-random sequence, by perform step S32 come
Further realize, it is in step s 32, described to obtain the positive integer N2_data corresponding with the initial value N and positive integer
X2_data, can be during concrete implementation：Based on formula：x2(n+31)=(x2(n)+x2(n+1)+x2(n+2)+x2(n
+ 3)) %2, the second preset rules of second pseudo-random sequence are obtained：x2(N)=N20*x2(0)+N21*x2(1)+…+
N230*x2(30), wherein, the initial value x of second pseudo-random sequence2(i) formula is passed through：Obtain, its
In, cinitCell frame number when sending the communication information of parameter of the value based on the mobile terminal and the mobile terminal obtain
；Based on second preset rules, second positive integer sequence N corresponding with the initial value N is obtained20、N21...N230, its
In, x2(N) the n-th value of second pseudo-random sequence is characterized；The evaluation of mould 2 is carried out respectively to the second positive integer sequence,
Second through computing positive integer sequence N corresponding to acquisition2’0,N2’1,…,N2’30；With N2' 0 is low level, N2' 30 are a high position to described
Second is combined through computing positive integer sequence, obtains the positive integer N2_data；With x2(0) it is low level, x2(30) it is a high position
The initial value of first pseudo-random sequence is combined, obtains the positive integer x2_data.
Further, in embodiments of the present invention, in step S32, it is described based on the positive integer N2_data and it is described just
Integer x2_data, second pseudo-random sequence is obtained, can be during concrete implementation：By the N2_data and institute
X2_data progress and computing are stated, obtains the second operation values；Based on second operation values, obtain each in second operation values
Bit is 1 number C2；The evaluation of mould 2 is carried out to the C2, obtains the second pseudo-random sequence x2(N) value, so as to obtain
Second pseudo-random sequence.
Further, in embodiments of the present invention, the second pseudo-random sequence is quickly obtained to realize, it is described based on described
The positive integer N2_data and positive integer x2_data, second pseudo-random sequence is obtained, can during concrete implementation
Think：The value of the positive integer N2_data is generated as a known look-up table, as the second pseudo-random sequence x2(n)
Computing look-up table B2；Based on the operation table B2, the second pseudo-random sequence x is obtained with reference to the positive integer x2_data2
(n)。
Scramble sequence generation method described in the embodiment of the present invention, the parsing on normal control message do not influence, together
When can avoid the influence of scramble sequence generation complexity that is brought by Nc value size, realize and quick obtain scramble sequence
Technique effect.Meanwhile the embodiment of the present invention does not conflict to existing module of software and hardware, it is not necessary to design is re-started, and
And number or system type with connecting UE in big system etc. is unrelated, therefore greatly reduce system cost.
In embodiments of the present invention, after obtaining the scramble sequence by above-mentioned embodiment, by performing step
S40, the information to be scrambled is scrambled, so as to obtain scrambled information, then perform step S50, will be described scrambled
Information is sent to base station.
Referring to accompanying drawing 4, the embodiment of the present invention provides a kind of method for receiving data, applied in base station, methods described
Including：
S60, receive the communication information that mobile terminal is sent；
S70, the communication information is handled, obtain scrambled information；
S80, scrambling sequence corresponding with initial value N is obtained, wherein, the scrambling sequence is to be based on the first pseudo-random sequence
Obtained with the second pseudo-random sequence, first pseudo-random sequence is to be based on positive integer N1_data corresponding with the initial value N
Obtained with positive integer x1_data；Second pseudo-random sequence is to be based on positive integer N2_data corresponding with the initial value N
Obtained with positive integer x2_data；
S90, using the scrambling sequence, the scrambled information is descrambled, obtain descrambling information.
During specific implementation, base station is after the communication information of mobile terminal transmission is received, after being handled
Communication information content, it is necessary to descramble to the communication information received, therefore given birth to firstly the need of according to the communication information
Into the scrambler of the communication information, the scrambler for being then based on obtaining to the communication information to carrying out descrambling operation, so as to be solved
Communication information content after disturbing.
In embodiments of the present invention, base station gets the communication information after step S60 is performed, then to the communication
Information performs step S70 to carry out preposition processing, so as to obtain scrambled information, in embodiments of the present invention, by entering one
Step performs step S80 to obtain scrambling sequence, and the scrambled information is carried out based on the scrambler sequence in step S90
Descrambling, so as to obtain the content of the communication information.Illustrated below in conjunction with specific embodiment.
In embodiments of the present invention, step S80 can be during concrete implementation：
S81, the positive integer N1_data and positive integer x1_data corresponding with the initial value N is obtained, and be based on
The positive integer N1_data and positive integer x1_data, obtain first pseudo-random sequence；
S82, the positive integer N2_data and positive integer x2_data corresponding with the initial value N is obtained, and be based on
The positive integer N2_data and positive integer x2_data, obtain second pseudo-random sequence；
S83, based on first pseudo-random sequence and second pseudo-random sequence, obtain scrambling sequence.
In embodiments of the present invention, based on same technical principle, step S80 is performed to obtain the side of the scrambling sequence
Method is identical with the method that step S30 acquisition scrambler sequences are performed in above-mentioned embodiment, therefore does not do repetitive description again.
Further, in embodiments of the present invention, base station is by performing above-mentioned embodiment so as to quickly be descrambled
Sequence, now the base station is by performing step S90, treats that descrambling information carries out descrambling operation to described, after obtaining descrambling
Communication information content, i.e. descrambling information.
Further, in embodiments of the present invention, by performing above-mentioned embodiment, it is achieved thereby that the communication information is only
Vertical scrambling and a kind of implementation method simple and quick, resource cost is few of descrambling.
The equipment that the embodiment of the present invention is provided is introduced below in conjunction with the accompanying drawings.
Accompanying drawing 5 is referred to, based on same inventive concept, one embodiment of the invention provides a kind of device 100 for sending data,
Applied to mobile terminal, device 100 includes：
Receiving module 101, for obtaining the concatenated code and UCI control information of upstream data；
Pretreatment module 102, for carrying out channel multiplexing with interweaving to the concatenated code and the UCI control information, obtain
Obtain information to be scrambled；
Acquisition module 103, for obtaining corresponding with initial value N scramble sequence, wherein, the scramble sequence is to be based on the
One pseudo-random sequence obtains with the second pseudo-random sequence, and first pseudo-random sequence is based on corresponding with the initial value N
Positive integer N1_data and positive integer x1_data is obtained；Second pseudo-random sequence is based on corresponding with the initial value N
Positive integer N2_data and positive integer x2_data is obtained；
Scrambling module 104, for utilizing the scramble sequence, the information to be scrambled is scrambled, obtained scrambled
Information；
Sending module 105, for the scrambled information to be sent into base station.
Referring to accompanying drawing 6, in embodiments of the present invention, acquisition module 103 includes：
First acquisition submodule 111, for obtaining the positive integer N1_data corresponding with the initial value N and just whole
Number x1_data, and based on the positive integer N1_data and the positive integer x1_data, obtain the first pseudorandom sequence
Row；
Second acquisition submodule 112, for obtaining the positive integer N2_data corresponding with the initial value N and just whole
Number x2_data, and based on the positive integer N2_data and the positive integer x2_data, obtain the second pseudorandom sequence
Row；
3rd acquisition submodule 113, for based on first pseudo-random sequence and second pseudo-random sequence, obtaining
Scramble sequence.
In embodiments of the present invention, the 3rd acquisition submodule 113 is specifically used for：Based on formula：C (n)=(x1(n+N)+x2
(n+N)) %2, scramble sequence is obtained；Wherein, x1(n+N) first pseudo-random sequence, x are characterized2(n+N) described second is characterized
Pseudo-random sequence, n value is the positive integer from 0 to 30, and %2, which is used to characterize, carries out Modulo-two operation evaluation, and N is positive integer value.
Further, in embodiments of the present invention, it is corresponding with the initial value N to be used for acquisition for the first acquisition submodule 111
The positive integer N1_data and positive integer x1_data, including：Based on formula：x1(n+31)=(x1(n)+x1(n+3)) %2,
Obtain the first preset rules of first pseudo-random sequence：x1(N)=N10*x1(0)+N11*x1(1)+…+N130*x1(30),
Wherein, the initial value of first pseudo-random sequence is characterized as：x1(0)=1, x1(n)=0；N value is just whole from 0 to 30
Number；Based on first preset rules, first positive integer sequence N corresponding with the initial value N is obtained10、N11...N130, its
In, x1(N) the n-th value of first pseudo-random sequence is characterized；Modulo-two operation is carried out respectively to the first positive integer sequence to ask
It is worth, first through computing positive integer sequence N corresponding to acquisition1’0,N1’1,…,N1’30；With N1' 0 is low level, N1' 30 are high-order right
Described first is combined through computing positive integer sequence, obtains the positive integer N1_data；With x1(0) it is low level, x1(30) it is
The high-order initial value to first pseudo-random sequence is combined, and obtains the positive integer x1_data.
In embodiments of the present invention, the first acquisition submodule 111 is used for based on the positive integer N1_data and described just whole
Number x1_data, first pseudo-random sequence is obtained, including：
First computing submodule, for the N1_data and the x1_data to be carried out and computing, obtain the first computing
Value；
Second computing submodule, for based on first operation values, it to be 1 to obtain each bit in first operation values
Number C1；
3rd computing submodule, for carrying out the evaluation of mould 2 to the C1, obtain the first pseudo-random sequence x1(N)
Value, so as to obtain first pseudo-random sequence.
In embodiments of the present invention, the first acquisition submodule 111 is used for based on the positive integer N1_data and described just whole
Number x1_data, first pseudo-random sequence is obtained, in addition to：
7th computing submodule 114, for the value of the positive integer N1_data to be generated as into a known look-up table, make
For the first pseudo-random sequence x1(n) computing look-up table B1；
8th computing submodule 115, for based on the operation table B1, with reference to described in being obtained the positive integer x1_data
First pseudo-random sequence x1(n)。
Further, in embodiments of the present invention, it is corresponding with the initial value N to be used for acquisition for the second acquisition submodule 112
The positive integer N2_data and positive integer x2_data, including：Based on formula：x2(n+31)=(x2(n)+x2(n+1)+x2(n
+2)+x2(n+3)) %2, the second preset rules of second pseudo-random sequence are obtained：x2(N)=N20*x2(0)+N21*x2(1)
+…+N230*x2(30), wherein, the initial value x of second pseudo-random sequence2(i) formula is passed through：Obtain
, wherein, cinitCell frame when sending the communication information of parameter of the value based on the mobile terminal and the mobile terminal
Number obtain；Based on second preset rules, second positive integer sequence N corresponding with the initial value N is obtained20、
N21...N230, wherein, x2(N) the n-th value of second pseudo-random sequence is characterized；The second positive integer sequence is distinguished
The evaluation of mould 2 is carried out, second through computing positive integer sequence N corresponding to acquisition2’0,N2’1,…,N2’30；With N2' 0 is low level, N2’30
It is combined for a high position to described second through computing positive integer sequence, obtains the positive integer N2_data；With x2Be (0) low level,
x2(30) it is combined for the high-order initial value to first pseudo-random sequence, obtains the positive integer x2_data.
In embodiments of the present invention, the second acquisition submodule 112 is used for based on the positive integer N2_data and described just whole
Number x2_data, second pseudo-random sequence is obtained, including：
4th computing submodule, for the N2_data and the x2_data to be carried out and computing, obtain the second computing
Value；
5th computing submodule, for based on second operation values, it to be 1 to obtain each bit in second operation values
Number C2；
6th computing submodule, for carrying out the evaluation of mould 2 to the C2, obtain the second pseudo-random sequence x2(N)
Value, so as to obtain second pseudo-random sequence.
In embodiments of the present invention, the second acquisition submodule 112 is used for based on the positive integer N2_data and described just whole
Number x2_data, second pseudo-random sequence is obtained, including：
9th computing submodule, for the value of the positive integer N2_data to be generated as into a known look-up table, as institute
State the second pseudo-random sequence x2(n) computing look-up table B2；
Tenth computing submodule, for based on the operation table B2, described second to be obtained with reference to the positive integer x2_data
Pseudo-random sequence x2(n)。
Referring to accompanying drawing 7, the embodiment of the present invention provides a kind of device 200 for receiving data, applied in base station, device
200 include：
Receiving module 201, for receiving the communication information of mobile terminal transmission；
Processing module 202, for handling the communication information, obtain scrambled information；
Acquisition module 203, for obtaining corresponding with initial value N scrambling sequence, wherein, the scrambling sequence is to be based on the
One pseudo-random sequence obtains with the second pseudo-random sequence, and first pseudo-random sequence is based on corresponding with the initial value N
Positive integer N1_data and positive integer x1_data is obtained；Second pseudo-random sequence is based on corresponding with the initial value N
Positive integer N2_data and positive integer x2_data is obtained；
Descrambling module 204, for utilizing the scrambling sequence, the scrambled information is descrambled, obtain descrambling letter
Breath.
Referring to accompanying drawing 8, in embodiments of the present invention, acquisition module 203 includes：
First acquisition submodule 211, for obtaining the positive integer N1_data corresponding with the initial value N and just whole
Number x1_data, and based on the positive integer N1_data and the positive integer x1_data, obtain the first pseudorandom sequence
Row；
Second acquisition submodule 212, for obtaining the positive integer N2_data corresponding with the initial value N and just whole
Number x2_data, and based on the positive integer N2_data and the positive integer x2_data, obtain the second pseudorandom sequence
Row；
3rd acquisition submodule 213, for based on first pseudo-random sequence and second pseudo-random sequence, obtaining
Scrambling sequence.
Further, in embodiments of the present invention, the 3rd acquisition submodule 213 is specifically used for：Based on formula：C (n)=
(x1(n+N)+x2(n+N)) %2, scrambling sequence is obtained；Wherein, x1(n+N) first pseudo-random sequence, x are characterized2(n+N) table
Second pseudo-random sequence is levied, n value is the positive integer from 0 to 30, and %2, which is used to characterize, carries out Modulo-two operation evaluation, and N is just
Integer value.
In embodiments of the present invention, it is corresponding with the initial value N described just whole to be used for acquisition for the first acquisition submodule 211
Number N1_data and positive integer x1_data, including：Based on formula：x1(n+31)=(x1(n)+x1(n+3)) %2, described the is obtained
First preset rules of one pseudo-random sequence：x1(N)=N10*x1(0)+N11*x1(1)+…+N130*x1(30), wherein, it is described
The initial value of first pseudo-random sequence is characterized as：x1(0)=1, x1(n)=0；N value is the positive integer from 0 to 30；Based on described
First preset rules, obtain first positive integer sequence N corresponding with the initial value N10、N11...N130, wherein, x1(N) table
Levy the n-th value of first pseudo-random sequence；Carry out Modulo-two operation evaluation, acquisition pair respectively to the first positive integer sequence
First answered is through computing positive integer sequence N1’0,N1’1,…,N1’30；With N1' 0 is low level, N1' 30 pass through to be high-order to described first
Computing positive integer sequence is combined, and obtains the positive integer N1_data；With x1(0) it is low level, x1(30) to be high-order to described
The initial value of first pseudo-random sequence is combined, and obtains the positive integer x1_data.
In embodiments of the present invention, the first acquisition submodule 211 is used for based on the positive integer N1_data and described just whole
Number x1_data, first pseudo-random sequence is obtained, including：
First computing submodule, for the N1_data and the x1_data to be carried out and computing, obtain the first computing
Value；
Second computing submodule, for based on first operation values, it to be 1 to obtain each bit in first operation values
Number C1；
3rd computing submodule, for carrying out the evaluation of mould 2 to the C1, obtain the first pseudo-random sequence x1(N)
Value, so as to obtain first pseudo-random sequence.
In embodiments of the present invention, the first acquisition submodule 211 is used for based on the positive integer N1_data and described just whole
Number x1_data, first pseudo-random sequence is obtained, including：
7th computing submodule, for the value of the positive integer N1_data to be generated as into a known look-up table, as institute
State the first pseudo-random sequence x1(n) computing look-up table B1；
8th computing submodule, for based on the operation table B1, described first to be obtained with reference to the positive integer x1_data
Pseudo-random sequence x1(n)。
Further, in embodiments of the present invention, the second acquisition submodule is used to obtain institute corresponding with the initial value N
Positive integer N2_data and positive integer x2_data are stated, including：Based on formula：x2(n+31)=(x2(n)+x2(n+1)+x2(n+2)+
x2(n+3)) %2, the second preset rules of second pseudo-random sequence are obtained：x2(N)=N20*x2(0)+N21*x2(1)+…+
N230*x2(30), wherein, the initial value x of second pseudo-random sequence2(i) formula is passed through：Obtain, its
In, cinitCell frame number when sending the communication information of parameter of the value based on the mobile terminal and the mobile terminal obtain
；Based on second preset rules, second positive integer sequence N corresponding with the initial value N is obtained20、N21...N230, its
In, x2(N) the n-th value of second pseudo-random sequence is characterized；The evaluation of mould 2 is carried out respectively to the second positive integer sequence,
Second through computing positive integer sequence N corresponding to acquisition2’0,N2’1,…,N2’30；With N2' 0 is low level, N2' 30 are a high position to described
Second is combined through computing positive integer sequence, obtains the positive integer N2_data；With x2(0) it is low level, x2(30) it is a high position
The initial value of first pseudo-random sequence is combined, obtains the positive integer x2_data.
In embodiments of the present invention, the second acquisition submodule 212 is used for based on the positive integer N2_data and described just whole
Number x2_data, second pseudo-random sequence is obtained, including：
4th computing submodule, for the N2_data and the x2_data to be carried out and computing, obtain the second computing
Value；
5th computing submodule, for based on second operation values, it to be 1 to obtain each bit in second operation values
Number C2；
6th computing submodule, for carrying out the evaluation of mould 2 to the C2, obtain the second pseudo-random sequence x2(N)
Value, so as to obtain second pseudo-random sequence.
In embodiments of the present invention, the second acquisition submodule 212 is used for based on the positive integer N2_data and described just whole
Number x2_data, second pseudo-random sequence is obtained, including：
9th computing submodule, for the value of the positive integer N2_data to be generated as into a known look-up table, as institute
State the second pseudo-random sequence x2(n) computing look-up table B2；
Tenth computing submodule, for based on the operation table B2, described second to be obtained with reference to the positive integer x2_data
Pseudo-random sequence x2(n)。
Further, the embodiment of the present invention also provides a kind of computer read/write memory medium, is stored with computer program
Instruction, when the computer program instructions perform on computers so that the computer is performed described in the various embodiments described above
Method.
It should be understood by those skilled in the art that, embodiments of the invention can be provided as method, system or computer program
Product.Therefore, the present invention can use the reality in terms of complete hardware embodiment, complete software embodiment or combination software and hardware
Apply the form of example.Moreover, the present invention can use the computer for wherein including computer usable program code in one or more
The computer program production that usable storage medium is implemented on (including but is not limited to magnetic disk storage, CD-ROM, optical memory etc.)
The form of product.
The present invention is the flow with reference to method according to embodiments of the present invention, equipment (system) and computer program product
Figure and/or block diagram describe.It should be understood that can be by every first-class in computer program instructions implementation process figure and/or block diagram
Journey and/or the flow in square frame and flow chart and/or block diagram and/or the combination of square frame.These computer programs can be provided
The processors of all-purpose computer, special-purpose computer, Embedded Processor or other programmable data processing devices is instructed to produce
A raw machine so that produced by the instruction of computer or the computing device of other programmable data processing devices for real
The device for the function of being specified in present one flow of flow chart or one square frame of multiple flows and/or block diagram or multiple square frames.
These computer program instructions, which may be alternatively stored in, can guide computer or other programmable data processing devices with spy
Determine in the computer-readable memory that mode works so that the instruction being stored in the computer-readable memory, which produces, to be included referring to
Make the manufacture of device, the command device realize in one flow of flow chart or multiple flows and/or one square frame of block diagram or
The function of being specified in multiple square frames.
These computer program instructions can be also loaded into computer or other programmable data processing devices so that counted
Series of operation steps is performed on calculation machine or other programmable devices to produce computer implemented processing, so as in computer or
The instruction performed on other programmable devices is provided for realizing in one flow of flow chart or multiple flows and/or block diagram one
The step of function of being specified in individual square frame or multiple square frames.
Although preferred embodiments of the present invention have been described, but those skilled in the art once know basic creation
Property concept, then can make other change and modification to these embodiments.So appended claims be intended to be construed to include it is excellent
Select embodiment and fall into having altered and changing for the scope of the invention.
Obviously, those skilled in the art can carry out various changes and modification without departing from this hair to the embodiment of the present invention
The spirit and scope of bright embodiment.So, if these modifications and variations of the embodiment of the present invention belong to the claims in the present invention
And its within the scope of equivalent technologies, then the present invention is also intended to comprising including these changes and modification.
Claims (29)
1. a kind of method for sending data, applied in mobile terminal, methods described includes：
Obtain the concatenated code and UCI control information of upstream data；
Channel multiplexing is carried out with interweaving to the concatenated code and the UCI control information, obtains information to be scrambled；
Scramble sequence corresponding with initial value N is obtained, wherein, the scramble sequence is pseudo- with second based on the first pseudo-random sequence
Random sequence obtains, and first pseudo-random sequence is to be based on positive integer N1_data corresponding with the initial value N and positive integer
X1_data is obtained；Second pseudo-random sequence is to be based on positive integer N2_data corresponding with the initial value N and positive integer
X2_data is obtained；
Using the scramble sequence, the information to be scrambled is scrambled, obtains scrambled information；
The scrambled information is sent to base station.
2. the method as described in claim 1, it is characterised in that it is described to obtain corresponding with initial value N scramble sequence, including：
The positive integer N1_data and positive integer x1_data corresponding with the initial value N is obtained, and based on described just whole
The number N1_data and positive integer x1_data, obtains first pseudo-random sequence；
The positive integer N2_data and positive integer x2_data corresponding with the initial value N is obtained, and based on described just whole
The number N2_data and positive integer x2_data, obtains second pseudo-random sequence；
Based on first pseudo-random sequence and second pseudo-random sequence, scramble sequence is obtained.
3. method as claimed in claim 2, it is characterised in that described pseudo- with described second based on first pseudo-random sequence
Random sequence, scramble sequence is obtained, including：
Based on formula：C (n)=(x1(n+N)+x2(n+N)) %2, scramble sequence is obtained；
Wherein, x1(n+N) first pseudo-random sequence, x are characterized2(n+N) characterize second pseudo-random sequence, n value be from
0 to 30 positive integer, %2, which is used to characterize, carries out Modulo-two operation evaluation, and N is positive integer value.
4. method as claimed in claim 3, it is characterised in that described to obtain the positive integer corresponding with the initial value N
N1_data and positive integer x1_data, including：
Based on formula：x1(n+31)=(x1(n)+x1(n+3)) %2, the first default rule of first pseudo-random sequence are obtained
Then：x1(N)=N10*x1(0)+N11*x1(1)+…+N130*x1(30), wherein, the initial-value table of first pseudo-random sequence
Levy and be：x1(0)=1, x1(n)=0；N value is the positive integer from 0 to 30；
Based on first preset rules, first positive integer sequence N corresponding with the initial value N is obtained10、N11...N130,
Wherein, x1(N) the n-th value of first pseudo-random sequence is characterized；
Carry out Modulo-two operation evaluation respectively to the first positive integer sequence, first through computing positive integer sequence N corresponding to acquisition1’
0,N1’1,…,N1’30；
With N1' 0 is low level, N1' 30 are combined for a high position to described first through computing positive integer sequence, obtain the positive integer
N1_data；
With x1(0) it is low level, x1(30) it is combined for the high-order initial value to first pseudo-random sequence, acquisition is described just
Integer x1_data.
5. method as claimed in claim 4, it is characterised in that described to be based on the positive integer N1_data and the positive integer
X1_data, first pseudo-random sequence is obtained, including：
By the N1_data and x1_data progress and computing, the first operation values are obtained；
Based on first operation values, the number C1 that each bit in first operation values is 1 is obtained；
The evaluation of mould 2 is carried out to the C1, obtains the first pseudo-random sequence x1(N) value, so as to obtain first pseudorandom
Sequence；
It is described to be based on the positive integer N2_data and positive integer x2_data, second pseudo-random sequence is obtained, including：
By the N2_data and x2_data progress and computing, the second operation values are obtained；
Based on second operation values, the number C2 that each bit in second operation values is 1 is obtained；
The evaluation of mould 2 is carried out to the C2, obtains the second pseudo-random sequence x2(N) value, so as to obtain second pseudorandom
Sequence.
6. method as claimed in claim 2, it is characterised in that described to be based on the positive integer N1_data and the positive integer
X1_data, first pseudo-random sequence is obtained, including：
The value of the positive integer N1_data is generated as a known look-up table, as the first pseudo-random sequence x1(n)
Computing look-up table B1；
Based on the operation table B1, the first pseudo-random sequence x is obtained with reference to the positive integer x1_data1(n)；
It is described to be based on the positive integer N2_data and positive integer x2_data, second pseudo-random sequence is obtained, including：
The value of the positive integer N2_data is generated as a known look-up table, as the second pseudo-random sequence x2(n)
Computing look-up table B2；
Based on the operation table B2, the second pseudo-random sequence x is obtained with reference to the positive integer x2_data2(n)。
7. the method as described in any claim in claim 2-3, it is characterised in that the acquisition is corresponding with the initial value N
The positive integer N2_data and positive integer x2_data, including：
Based on formula：x2(n+31)=(x2(n)+x2(n+1)+x2(n+2)+x2(n+3)) %2, the second pseudorandom sequence is obtained
Second preset rules of row：x2(N)=N20*x2(0)+N21*x2(1)+…+N230*x2(30), wherein, second pseudorandom
The initial value x of sequence2(i) formula is passed through：Obtain, wherein, cinitGinseng of the value based on the mobile terminal
Cell frame number when several and described mobile terminal sends the communication information obtains；
Based on second preset rules, second positive integer sequence N corresponding with the initial value N is obtained20、N21...N230,
Wherein, x2(N) the n-th value of second pseudo-random sequence is characterized；
Carry out the evaluation of mould 2 respectively to the second positive integer sequence, second through computing positive integer sequence N corresponding to acquisition2’0,N2’
1,…,N2’30；
With N2' 0 is low level, N2' 30 are combined for a high position to described second through computing positive integer sequence, obtain the positive integer
N2_data；
With x2(0) it is low level, x2(30) it is combined for the high-order initial value to first pseudo-random sequence, acquisition is described just
Integer x2_data.
8. a kind of method for receiving data, applied in base station, methods described includes：
Receive the communication information that mobile terminal is sent；
The communication information is handled, obtains scrambled information；
Scrambling sequence corresponding with initial value N is obtained, wherein, the scrambling sequence is pseudo- with second based on the first pseudo-random sequence
Random sequence obtains, and first pseudo-random sequence is to be based on positive integer N1_data corresponding with the initial value N and positive integer
X1_data is obtained；Second pseudo-random sequence is to be based on positive integer N2_data corresponding with the initial value N and positive integer
X2_data is obtained；
Using the scrambling sequence, the scrambled information is descrambled, obtains descrambling information.
9. method as claimed in claim 8, it is characterised in that it is described to obtain corresponding with initial value N scrambling sequence, including：
The positive integer N1_data and positive integer x1_data corresponding with the initial value N is obtained, and based on described just whole
The number N1_data and positive integer x1_data, obtains first pseudo-random sequence；
The positive integer N2_data and positive integer x2_data corresponding with the initial value N is obtained, and based on described just whole
The number N2_data and positive integer x2_data, obtains second pseudo-random sequence；
Based on first pseudo-random sequence and second pseudo-random sequence, scrambling sequence is obtained.
10. method as claimed in claim 9, it is characterised in that described to be based on first pseudo-random sequence and described second
Pseudo-random sequence, scrambling sequence is obtained, including：
Based on formula：C (n)=(x1(n+N)+x2(n+N)) %2, scrambling sequence is obtained；
Wherein, x1(n+N) first pseudo-random sequence, x are characterized2(n+N) characterize second pseudo-random sequence, n value be from
0 to 30 positive integer, %2, which is used to characterize, carries out Modulo-two operation evaluation, and N is positive integer value.
11. the method as described in any claim in claim 9-10, it is characterised in that the acquisition and N pairs of the initial value
The positive integer N1_data and positive integer x1_data answered, including：
Based on formula：x1(n+31)=(x1(n)+x1(n+3)) %2, the first default rule of first pseudo-random sequence are obtained
Then：x1(N)=N10*x1(0)+N11*x1(1)+…+N130*x1(30), wherein, the initial-value table of first pseudo-random sequence
Levy and be：x1(0)=1, x1(n)=0；N value is the positive integer from 0 to 30；
Based on first preset rules, first positive integer sequence N corresponding with the initial value N is obtained10、N11...N130,
Wherein, x1(N) the n-th value of first pseudo-random sequence is characterized；
Carry out Modulo-two operation evaluation respectively to the first positive integer sequence, first through computing positive integer sequence N corresponding to acquisition1’
0,N1’1,…,N1’30；
With N1' 0 is low level, N1' 30 are combined for a high position to described first through computing positive integer sequence, obtain the positive integer
N1_data；
With x1(0) it is low level, x1(30) it is combined for the high-order initial value to first pseudo-random sequence, acquisition is described just
Integer x1_data.
12. method as claimed in claim 11, it is characterised in that
It is described to be based on the positive integer N1_data and positive integer x1_data, first pseudo-random sequence is obtained, including：
By the N1_data and x1_data progress and computing, the first operation values are obtained；
Based on first operation values, the number C1 that each bit in first operation values is 1 is obtained；
The evaluation of mould 2 is carried out to the C1, obtains the first pseudo-random sequence x1(N) value, so as to obtain first pseudorandom
Sequence；
It is described to be based on the positive integer N2_data and positive integer x2_data, second pseudo-random sequence is obtained, including：
By the N2_data and x2_data progress and computing, the second operation values are obtained；
Based on second operation values, the number C2 that each bit in second operation values is 1 is obtained；
The evaluation of mould 2 is carried out to the C2, obtains the second pseudo-random sequence x2(N) value, so as to obtain second pseudorandom
Sequence.
13. method as claimed in claim 9, it is characterised in that described to be based on the positive integer N1_data and the positive integer
X1_data, first pseudo-random sequence is obtained, including：
The value of the positive integer N1_data is generated as a known look-up table, as the first pseudo-random sequence x1(n)
Computing look-up table B1；
Based on the operation table B1, the first pseudo-random sequence x is obtained with reference to the positive integer x1_data1(n)；
It is described to be based on the positive integer N2_data and positive integer x2_data, second pseudo-random sequence is obtained, including：
The value of the positive integer N2_data is generated as a known look-up table, as the second pseudo-random sequence x2(n)
Computing look-up table B2；
Based on the operation table B2, the second pseudo-random sequence x is obtained with reference to the positive integer x2_data2(n)。
14. the method as described in any claim in claim 9-10, it is characterised in that the acquisition and N pairs of the initial value
The positive integer N2_data and positive integer x2_data answered, including：
Based on formula：x2(n+31)=(x2(n)+x2(n+1)+x2(n+2)+x2(n+3)) %2, the second pseudorandom sequence is obtained
Second preset rules of row：x2(N)=N20*x2(0)+N21*x2(1)+…+N230*x2(30), wherein, second pseudorandom
The initial value x of sequence2(i) formula is passed through：Obtain, wherein, cinitGinseng of the value based on the mobile terminal
Cell frame number when several and described mobile terminal sends the communication information obtains；
Based on second preset rules, second positive integer sequence N corresponding with the initial value N is obtained20、N21...N230,
Wherein, x2(N) the n-th value of second pseudo-random sequence is characterized；
Carry out the evaluation of mould 2 respectively to the second positive integer sequence, second through computing positive integer sequence N corresponding to acquisition2’0,N2’
1,…,N2’30；
With N2' 0 is low level, N2' 30 are combined for a high position to described second through computing positive integer sequence, obtain the positive integer
N2_data；
With x2(0) it is low level, x2(30) it is combined for the high-order initial value to first pseudo-random sequence, acquisition is described just
Integer x2_data.
A kind of 15. device for sending data, applied to mobile terminal, it is characterised in that described device includes：
Receiving module, for obtaining the concatenated code and UCI control information of upstream data；
Pretreatment module, for the concatenated code and the UCI control information to be carried out channel multiplexing and interweaved, obtain to be scrambled
Information；
Acquisition module, for obtaining corresponding with initial value N scramble sequence, wherein, the scramble sequence be based on the first puppet with
Machine sequence obtains with the second pseudo-random sequence, and first pseudo-random sequence is to be based on positive integer corresponding with the initial value N
N1_data and positive integer x1_data is obtained；Second pseudo-random sequence is to be based on positive integer corresponding with the initial value N
N2_data and positive integer x2_data is obtained；
Scrambling module, for utilizing the scramble sequence, the information to be scrambled is scrambled, obtains scrambled information；
Sending module, for the scrambled information to be sent into base station.
16. device as claimed in claim 15, it is characterised in that the acquisition module includes：
First acquisition submodule, for obtaining the positive integer N1_data and positive integer x1_ corresponding with the initial value N
Data, and based on the positive integer N1_data and the positive integer x1_data, obtain first pseudo-random sequence；
Second acquisition submodule, for obtaining the positive integer N2_data and positive integer x2_ corresponding with the initial value N
Data, and based on the positive integer N2_data and the positive integer x2_data, obtain second pseudo-random sequence；
3rd acquisition submodule, for based on first pseudo-random sequence and second pseudo-random sequence, obtaining scrambling sequence
Row.
17. device as claimed in claim 16, it is characterised in that the 3rd acquisition submodule is specifically used for：
Based on formula：C (n)=(x1(n+N)+x2(n+N)) %2, scramble sequence is obtained；
Wherein, x1(n+N) first pseudo-random sequence, x are characterized2(n+N) characterize second pseudo-random sequence, n value be from
0 to 30 positive integer, %2, which is used to characterize, carries out Modulo-two operation evaluation, and N is positive integer value.
18. the device as described in any claim in claim 16-17, it is characterised in that first acquisition submodule is used for
The positive integer N1_data and positive integer x1_data corresponding with the initial value N is obtained, including：
Based on formula：x1(n+31)=(x1(n)+x1(n+3)) %2, the first default rule of first pseudo-random sequence are obtained
Then：x1(N)=N10*x1(0)+N11*x1(1)+…+N130*x1(30), wherein, the initial-value table of first pseudo-random sequence
Levy and be：x1(0)=1, x1(n)=0；N value is the positive integer from 0 to 30；
Based on first preset rules, first positive integer sequence N corresponding with the initial value N is obtained10、N11...N130,
Wherein, x1(N) the n-th value of first pseudo-random sequence is characterized；
Carry out Modulo-two operation evaluation respectively to the first positive integer sequence, first through computing positive integer sequence N corresponding to acquisition1’
0,N1’1,…,N1’30；
With N1' 0 is low level, N1' 30 are combined for a high position to described first through computing positive integer sequence, obtain the positive integer
N1_data；
With x1(0) it is low level, x1(30) it is combined for the high-order initial value to first pseudo-random sequence, acquisition is described just
Integer x1_data.
19. device as claimed in claim 18, it is characterised in that
First acquisition submodule is used to be based on the positive integer N1_data and positive integer x1_data, acquisition described the
One pseudo-random sequence, including：
First computing submodule, for the N1_data and the x1_data to be carried out and computing, obtain the first operation values；
Second computing submodule, for based on first operation values, obtaining the number that each bit in first operation values is 1
C1；
3rd computing submodule, for carrying out the evaluation of mould 2 to the C1, obtain the first pseudo-random sequence x1(N) value, from
And obtain first pseudo-random sequence；
Second acquisition submodule is used to be based on the positive integer N2_data and positive integer x2_data, acquisition described the
Two pseudo-random sequences, including：
4th computing submodule, for the N2_data and the x2_data to be carried out and computing, obtain the second operation values；
5th computing submodule, for based on second operation values, obtaining the number that each bit in second operation values is 1
C2；
6th computing submodule, for carrying out the evaluation of mould 2 to the C2, obtain the second pseudo-random sequence x2(N) value, from
And obtain second pseudo-random sequence.
20. device as claimed in claim 16, it is characterised in that
First acquisition submodule is used to be based on the positive integer N1_data and positive integer x1_data, acquisition described the
One pseudo-random sequence, including：
7th computing submodule, for the value of the positive integer N1_data to be generated as into a known look-up table, as described
One pseudo-random sequence x1(n) computing look-up table B1；
8th computing submodule, for based on the operation table B1, with reference to the positive integer x1_data obtain described first it is pseudo- with
Machine sequence x1(n)；
Second acquisition submodule is used to be based on the positive integer N2_data and positive integer x2_data, acquisition described the
Two pseudo-random sequences, including：
9th computing subelement, for the value of the positive integer N2_data to be generated as into a known look-up table, as described
Two pseudo-random sequence x2(n) computing look-up table B2；
Tenth computing subelement, for based on the operation table B2, with reference to the positive integer x2_data obtain described second it is pseudo- with
Machine sequence x2(n)。
21. the device as described in any claim in claim 16-17, it is characterised in that second acquisition submodule is used for
The positive integer N2_data and positive integer x2_data corresponding with the initial value N is obtained, including：
Based on formula：x2(n+31)=(x2(n)+x2(n+1)+x2(n+2)+x2(n+3)) %2, the second pseudorandom sequence is obtained
Second preset rules of row：x2(N)=N20*x2(0)+N21*x2(1)+…+N230*x2(30), wherein, second pseudorandom
The initial value x of sequence2(i) formula is passed through：Obtain, wherein, cinitGinseng of the value based on the mobile terminal
Cell frame number when several and described mobile terminal sends the communication information obtains；
Based on second preset rules, second positive integer sequence N corresponding with the initial value N is obtained20、N21...N230,
Wherein, x2(N) the n-th value of second pseudo-random sequence is characterized；
Carry out the evaluation of mould 2 respectively to the second positive integer sequence, second through computing positive integer sequence N corresponding to acquisition2’0,N2’
1,…,N2’30；
With N2' 0 is low level, N2' 30 are combined for a high position to described second through computing positive integer sequence, obtain the positive integer
N2_data；
With x2(0) it is low level, x2(30) it is combined for the high-order initial value to first pseudo-random sequence, acquisition is described just
Integer x2_data.
A kind of 22. device for receiving data, applied in base station, it is characterised in that described device includes：
Receiving module, for receiving the communication information of mobile terminal transmission；
Processing module, for handling the communication information, obtain scrambled information；
Acquisition module, for obtaining corresponding with initial value N scrambling sequence, wherein, the scrambling sequence be based on the first puppet with
Machine sequence obtains with the second pseudo-random sequence, and first pseudo-random sequence is to be based on positive integer corresponding with the initial value N
N1_data and positive integer x1_data is obtained；Second pseudo-random sequence is to be based on positive integer corresponding with the initial value N
N2_data and positive integer x2_data is obtained；
Descrambling module, for utilizing the scrambling sequence, the scrambled information is descrambled, obtains descrambling information.
23. device as claimed in claim 22, it is characterised in that the acquisition module includes：
First acquisition submodule, for obtaining the positive integer N1_data and positive integer x1_ corresponding with the initial value N
Data, and based on the positive integer N1_data and the positive integer x1_data, obtain first pseudo-random sequence；
Second acquisition submodule, for obtaining the positive integer N2_data and positive integer x2_ corresponding with the initial value N
Data, and based on the positive integer N2_data and the positive integer x2_data, obtain second pseudo-random sequence；
3rd acquisition submodule, for based on first pseudo-random sequence and second pseudo-random sequence, obtaining descrambling sequence
Row.
24. device as claimed in claim 23, it is characterised in that the 3rd acquisition submodule is specifically used for：
Based on formula：C (n)=(x1(n+N)+x2(n+N)) %2, scrambling sequence is obtained；
Wherein, x1(n+N) first pseudo-random sequence, x are characterized2(n+N) characterize second pseudo-random sequence, n value be from
0 to 30 positive integer, %2, which is used to characterize, carries out Modulo-two operation evaluation, and N is positive integer value.
25. the device as described in any claim in claim 23-24, it is characterised in that first acquisition submodule is used for
The positive integer N1_data and positive integer x1_data corresponding with the initial value N is obtained, including：
Based on formula：x1(n+31)=(x1(n)+x1(n+3)) %2, the first default rule of first pseudo-random sequence are obtained
Then：x1(N)=N10*x1(0)+N11*x1(1)+…+N130*x1(30), wherein, the initial-value table of first pseudo-random sequence
Levy and be：x1(0)=1, x1(n)=0；N value is the positive integer from 0 to 30；
Based on first preset rules, first positive integer sequence N corresponding with the initial value N is obtained10、N11...N130,
Wherein, x1(N) the n-th value of first pseudo-random sequence is characterized；
Carry out Modulo-two operation evaluation respectively to the first positive integer sequence, first through computing positive integer sequence N corresponding to acquisition1’
0,N1’1,…,N1’30；
With N1' 0 is low level, N1' 30 are combined for a high position to described first through computing positive integer sequence, obtain the positive integer
N1_data；
With x1(0) it is low level, x1(30) it is combined for the high-order initial value to first pseudo-random sequence, acquisition is described just
Integer x1_data.
26. device as claimed in claim 25, it is characterised in that
First acquisition submodule is used to be based on the positive integer N1_data and positive integer x1_data, acquisition described the
One pseudo-random sequence, including：
First computing submodule, for the N1_data and the x1_data to be carried out and computing, obtain the first operation values；
Second computing submodule, for based on first operation values, obtaining the number that each bit in first operation values is 1
C1；
3rd computing submodule, for carrying out the evaluation of mould 2 to the C1, obtain the first pseudo-random sequence x1(N) value, from
And obtain first pseudo-random sequence；
Second acquisition submodule is used to be based on the positive integer N2_data and positive integer x2_data, acquisition described the
Two pseudo-random sequences, including：
4th computing submodule, for the N2_data and the x2_data to be carried out and computing, obtain the second operation values；
5th computing submodule, for based on second operation values, obtaining the number that each bit in second operation values is 1
C2；
6th computing submodule, for carrying out the evaluation of mould 2 to the C2, obtain the second pseudo-random sequence x2(N) value, from
And obtain second pseudo-random sequence.
27. device as claimed in claim 23, it is characterised in that
First acquisition submodule is used to be based on the positive integer N1_data and positive integer x1_data, acquisition described the
One pseudo-random sequence, including：
7th computing submodule, for the value of the positive integer N1_data to be generated as into a known look-up table, as described
One pseudo-random sequence x1(n) computing look-up table B1；
8th computing submodule, for based on the operation table B1, with reference to the positive integer x1_data obtain described first it is pseudo- with
Machine sequence x1(n)；
Second acquisition submodule is used to be based on the positive integer N2_data and positive integer x2_data, acquisition described the
Two pseudo-random sequences, including：
9th computing submodule, for the value of the positive integer N2_data to be generated as into a known look-up table, as described
Two pseudo-random sequence x2(n) computing look-up table B2；
Tenth computing submodule, for based on the operation table B2, with reference to the positive integer x2_data obtain described second it is pseudo- with
Machine sequence x2(n)。
28. the device as described in any claim in claim 23-24, it is characterised in that second acquisition submodule is used for
The positive integer N2_data and positive integer x2_data corresponding with the initial value N is obtained, including：
Based on formula：x2(n+31)=(x2(n)+x2(n+1)+x2(n+2)+x2(n+3)) %2, the second pseudorandom sequence is obtained
Second preset rules of row：x2(N)=N20*x2(0)+N21*x2(1)+…+N230*x2(30), wherein, second pseudorandom
The initial value x of sequence2(i) formula is passed through：Obtain, wherein, cinitGinseng of the value based on the mobile terminal
Cell frame number when several and described mobile terminal sends the communication information obtains；
Based on second preset rules, second positive integer sequence N corresponding with the initial value N is obtained20、N21...N230,
Wherein, x2(N) the n-th value of second pseudo-random sequence is characterized；
Carry out the evaluation of mould 2 respectively to the second positive integer sequence, second through computing positive integer sequence N corresponding to acquisition2’0,N2’
1,…,N2’30；
With N2' 0 is low level, N2' 30 are combined for a high position to described second through computing positive integer sequence, obtain the positive integer
N2_data；
With x2(0) it is low level, x2(30) it is combined for the high-order initial value to first pseudo-random sequence, acquisition is described just
Integer x2_data.
29. a kind of computer read/write memory medium, it is characterised in that be stored with computer program instructions, the computer journey
When sequence instruction performs on computers so that the computer performs the method as described in any claim in claim 1-14.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710696550.5A CN107483152B (en) | 2017-08-15 | 2017-08-15 | Method, device and computer readable storage medium for sending and receiving data |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710696550.5A CN107483152B (en) | 2017-08-15 | 2017-08-15 | Method, device and computer readable storage medium for sending and receiving data |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107483152A true CN107483152A (en) | 2017-12-15 |
| CN107483152B CN107483152B (en) | 2020-04-14 |
Family
ID=60600554
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710696550.5A Active CN107483152B (en) | 2017-08-15 | 2017-08-15 | Method, device and computer readable storage medium for sending and receiving data |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107483152B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108965173A (en) * | 2018-06-12 | 2018-12-07 | 深圳市华星光电技术有限公司 | De-scrambling method, equipment and readable storage medium storing program for executing |
| CN112019324A (en) * | 2019-05-31 | 2020-12-01 | 中国移动通信有限公司研究院 | Method and device for generating initial phase of pseudorandom sequence and communication equipment |
| CN113452425A (en) * | 2020-03-24 | 2021-09-28 | 大唐移动通信设备有限公司 | Data processing method and device |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101925056A (en) * | 2009-06-10 | 2010-12-22 | 华为技术有限公司 | Scrambling code sequence generation method, device and system for scrambling or descrambling |
| EP2381584A2 (en) * | 2009-01-20 | 2011-10-26 | Pantech Co., Ltd. | Apparatus and method for generating scrambling codes in a radio communication system |
| CN103812596A (en) * | 2012-11-09 | 2014-05-21 | 联芯科技有限公司 | Pseudo random sequence generation method and apparatus |
| CN105262557A (en) * | 2015-09-07 | 2016-01-20 | 东南大学 | Method for generating pseudo-random sequences in LTE (Long Term Evolution) system |
| CN105391545A (en) * | 2015-11-27 | 2016-03-09 | 东南大学 | Method of generating pseudo-random sequence in LTE system |
-
2017
- 2017-08-15 CN CN201710696550.5A patent/CN107483152B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP2381584A2 (en) * | 2009-01-20 | 2011-10-26 | Pantech Co., Ltd. | Apparatus and method for generating scrambling codes in a radio communication system |
| US20110274193A1 (en) * | 2009-01-20 | 2011-11-10 | Pantech Co., Ltd. | Apparatus and method for generating scrambling codes in a radio communication system |
| CN101925056A (en) * | 2009-06-10 | 2010-12-22 | 华为技术有限公司 | Scrambling code sequence generation method, device and system for scrambling or descrambling |
| CN103812596A (en) * | 2012-11-09 | 2014-05-21 | 联芯科技有限公司 | Pseudo random sequence generation method and apparatus |
| CN105262557A (en) * | 2015-09-07 | 2016-01-20 | 东南大学 | Method for generating pseudo-random sequences in LTE (Long Term Evolution) system |
| CN105391545A (en) * | 2015-11-27 | 2016-03-09 | 东南大学 | Method of generating pseudo-random sequence in LTE system |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108965173A (en) * | 2018-06-12 | 2018-12-07 | 深圳市华星光电技术有限公司 | De-scrambling method, equipment and readable storage medium storing program for executing |
| CN108965173B (en) * | 2018-06-12 | 2020-07-31 | 深圳市华星光电技术有限公司 | Descrambling method, descrambling device and readable storage medium |
| CN112019324A (en) * | 2019-05-31 | 2020-12-01 | 中国移动通信有限公司研究院 | Method and device for generating initial phase of pseudorandom sequence and communication equipment |
| CN113452425A (en) * | 2020-03-24 | 2021-09-28 | 大唐移动通信设备有限公司 | Data processing method and device |
| CN113452425B (en) * | 2020-03-24 | 2022-07-22 | 大唐移动通信设备有限公司 | Data processing method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107483152B (en) | 2020-04-14 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11522655B2 (en) | Method and device for notifying and determining DMRS ports or mapping relationship | |
| CN108650001B (en) | A kind of signal scrambling, de-scrambling method and device | |
| US11212054B2 (en) | Data transmission method and apparatus | |
| CN105429683B (en) | A kind of 3D MIMO transmission method and device | |
| CN103248468A (en) | Demodulation pilot signal processing method, base station and user equipment | |
| CN105898872A (en) | Uplink transmission method and device | |
| CN108347318A (en) | A kind of ascending transmission method and device | |
| CN106470495B (en) | A kind of dispatching method and device | |
| CN106559365A (en) | Self-interference removing method and equipment | |
| CN107483152A (en) | A kind of method for sending, receiving data, device and computer read/write memory medium | |
| CN106302269A (en) | The feedback of a kind of channel condition information and control method thereof and device | |
| CN107294660A (en) | A kind of ACK/NACK feedback sequences determine method and apparatus | |
| CN105636105A (en) | Measurement pilot transmitting method, measurement pilot detecting method, measurement pilot transmitting device, measurement pilot detecting device, base station and terminal | |
| CN103312446A (en) | Transmission method, device and system of uplink control information | |
| CN107517503A (en) | A kind of processing unit, BBU, RRU and antenna correcting method | |
| CN107181509A (en) | A kind of data transmission method and device | |
| CN105992379A (en) | Scheduling method and terminal | |
| CN106888062A (en) | CQI estimates, SINR determines method and relevant device | |
| CN102075294B (en) | One kind cooperation method for precoding and system | |
| CN106992837A (en) | Method, the network equipment, terminal device and the system of multi-antenna data transmission | |
| CN110034894A (en) | The transmission method and device of a kind of control signaling, data | |
| CN107371270A (en) | A kind of transmission method, equipment and system | |
| US20160150562A1 (en) | Transmission device | |
| CN106452662A (en) | Precoding method and apparatus | |
| CN103209053B (en) | A kind of information bit sending method, device and system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| TA01 | Transfer of patent application right | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20200107 Address after: 510663 Shenzhou Road 10, Guangzhou Science City, Guangzhou economic and Technological Development Zone, Guangzhou, Guangdong Applicant after: Jingxin Communication System (China) Co., Ltd. Address before: 510663 Luogang District Science City, Guangzhou, Shenzhou Road, No. 10, Guangdong Applicant before: Jingxin Communication System (China) Co., Ltd. Applicant before: Jingxin Communication System (Guangzhou) Co., Ltd. Applicant before: Jingxin Communication Technology (Guangzhou) Co., Ltd. Applicant before: TIANJIN COMBA TELECOM SYSTEMS CO., LTD. |
|
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CP01 | Change in the name or title of a patent holder | ||
| CP01 | Change in the name or title of a patent holder |
Address after: 510663 Shenzhou Road 10, Guangzhou Science City, Guangzhou economic and Technological Development Zone, Guangzhou, Guangdong Patentee after: Jingxin Network System Co.,Ltd. Address before: 510663 Shenzhou Road 10, Guangzhou Science City, Guangzhou economic and Technological Development Zone, Guangzhou, Guangdong Patentee before: Comba Telecom System (China) Ltd. |