WO2018006762A1 - 伪随机序列的处理方法、装置及系统、存储介质 - Google Patents
伪随机序列的处理方法、装置及系统、存储介质 Download PDFInfo
- Publication number
- WO2018006762A1 WO2018006762A1 PCT/CN2017/091285 CN2017091285W WO2018006762A1 WO 2018006762 A1 WO2018006762 A1 WO 2018006762A1 CN 2017091285 W CN2017091285 W CN 2017091285W WO 2018006762 A1 WO2018006762 A1 WO 2018006762A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- pseudo
- random sequence
- dimension
- resource
- sequence
- Prior art date
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/04—Wireless resource allocation
Definitions
- the present invention relates to the field of communications, and in particular, to a method, an apparatus, and a system, and a storage medium for processing a pseudo random sequence.
- channel access technology mainly focuses on a wireless local area network.
- distributed media access technology for wireless local area networks semi-random backoff method for realizing resource reservation in wireless local area networks, and the like.
- the probability of collision increases greatly, resulting in serious waste of resources.
- the embodiments of the present invention provide a method, a device, a system, and a storage medium for processing a pseudo-random sequence, so as to at least solve the problem of low resource utilization during channel access in the related art.
- a method for processing a pseudo-random sequence including: a transmitting end configuring a random seed, and transmitting the random seed; wherein the random seed is used to generate a corresponding pseudo-random sequence,
- the pseudo random sequence is used for at least one of the following: data transmission resource allocation, channel access resource allocation.
- the sending end when the pseudo random sequence is used for data transmission resource allocation, the sending end further determines a corresponding allocated resource according to the pseudo random sequence, and receives data from the data; or when the pseudo random sequence is used for When the channel access resource is allocated, the transmitting end further determines a corresponding access resource according to the pseudo random sequence, and receives data from the same.
- the determining the corresponding allocated resource or the access resource further includes: determining, by the sending end, a total length of the pseudo-random sequence, corresponding to the total number of resource units allocated by the plan.
- the total number of resource units allocated by the corresponding plan is a sum of resource units required by multiple dimensions, where the dimension includes at least one of the following: a first dimension: a time domain Dimension, second dimension: frequency domain dimension, third dimension: airspace dimension, fourth dimension: code domain dimension.
- the sending end determines that the total number of resource units allocated in each unit of one of the plurality of dimensions includes: all the dimensions except the dimension of the specified dimension and the dimension number of the specified dimension need to be allocated The sum of resource units.
- the determining, by the sending end, the corresponding allocated resource or access resource includes:
- the transmitting end determines the number of frequency domain units required in the time domain unit
- the corresponding frequency domain unit number is estimated from the selected sequence element as a frequency domain unit allocated or usable in the time domain unit, wherein each element in the pseudo random sequence corresponds to one assignable resource unit.
- the corresponding frequency domain unit number is calculated from the selected sequence element, including:
- the sequence element is multiplied by the total number of frequency domain units available for allocation in the time domain unit, and rounded down to obtain a frequency domain unit number, wherein the frequency domain unit number is 1 or 1 in sequence. The added integer.
- the method further includes:
- the transmitting end determines the generated pseudo-random sequence according to one of the following preset algorithms: a Kent mapping, a linear congruence method.
- generating a pseudo-random sequence of a preset length according to the Kent mapping by using the random seed includes:
- the pseudo-random sequence x n+1 is calculated according to the following formula:
- x n is a pseudo-random sequence of length n
- n is the total resource unit that can be allocated
- a is a constant
- the a 0.7.
- generating a corresponding pseudo random sequence according to the preset algorithm according to the random seed includes:
- the pseudo-random sequence x n+1 is calculated according to the following formula:
- a, c and m are integers, the m is an integer greater than A, A is the total number of resource units in the dimension to be allocated, and a and c are respectively preset values associated with the A, and x n is A pseudo-random sequence of length n, where n is the total resource unit that can be allocated, and c and m are prime numbers.
- a method for processing a pseudo-random sequence including: receiving, by a receiving end, a random seed sent by a sending end; and receiving, by the receiving end, generating a corresponding pseudo random according to a preset algorithm according to the random seed a sequence; the receiving end performs data transmission resource allocation and/or channel access resource allocation according to the pseudo random sequence.
- the preset algorithm includes one of the following: a Kent mapping, a linear congruence method.
- generating a pseudo-random sequence of a preset length according to the Kent mapping by using the random seed includes:
- the pseudo-random sequence x n+1 is calculated according to the following formula:
- x n is a pseudo-random sequence of length n
- n is the total resource unit that can be allocated
- a is a constant
- the a 0.7.
- generating a corresponding pseudo random sequence according to the preset algorithm according to the random seed includes:
- a, c and m are all integers.
- the m is an integer greater than A, and A is the total number of resource units in the dimension to be allocated (for example, a frequency domain unit in each time domain unit needs to be allocated, then A is an available frequency domain unit in the time domain unit)
- the total number) a, c are the preset values associated with the A, x n is a pseudo-random sequence of length n, n is the total resource unit that can be allocated, and c and m are the prime numbers.
- the receiving end performs data transmission resource allocation and/or channel access resource allocation according to the pseudo random sequence, where the method further includes: the receiving end and the sending end agree on the number of resource units to be allocated in each dimension. Or the receiving end receives the signaling of the transmitting end to know the number of resource units that need to be allocated in each dimension; the receiving end determines the total length of the generated pseudo-random sequence, corresponding to the total number of resource units allocated by the plan.
- the total number of resource units allocated by the corresponding plan is a sum of resource units required by multiple dimensions, where the dimension includes at least one of the following: a first dimension: a time domain Dimension, second dimension: frequency domain dimension, third dimension: airspace dimension, fourth dimension: code domain dimension.
- the receiving end determines that the total number of resource units allocated in each unit of one of the plurality of dimensions includes: all other dimensions except the dimension of the specified dimension and the dimension number of the specified dimension need to be allocated The sum of resource units.
- the receiving end determines that the corresponding allocated resource or access resource includes:
- the receiving end determines the number of frequency domain units required in the time domain unit
- the corresponding frequency domain unit number is estimated from the selected sequence element as a frequency domain unit allocated or usable in the time domain unit, wherein each element in the pseudo random sequence corresponds to one assignable resource unit.
- the corresponding frequency domain unit number is calculated from the selected sequence element, including:
- the sequence element is multiplied by the total number of frequency domain units available for allocation in the time domain unit, and rounded down to obtain a frequency domain unit number, wherein the frequency domain unit number is 1 or 1 in sequence. The added integer.
- a pseudo random sequence processing apparatus comprising: a configuration module configured to configure a random seed; a sending module configured to send the random seed; wherein the random seed is used A corresponding pseudo-random sequence is generated, the pseudo-random sequence being used for at least one of: data transmission resource allocation, channel access resource allocation.
- a processing device for providing another pseudo-random sequence includes: a receiving module configured to receive a random seed sent by a transmitting end; and a calculating module configured to follow a preset algorithm based on the random seed Generating a corresponding pseudo-random sequence; the processing module is configured to perform data transmission resource allocation and/or channel access resource allocation according to the pseudo-random sequence.
- a processing system of a pseudo-random sequence including a base station and a user equipment UE, the base station includes: a configuration module configured to configure a random seed; and a sending module configured to send the a random seed; wherein the random seed is used to generate a corresponding pseudo random sequence, the pseudo random sequence being used for at least one of: data transmission resource allocation, channel access resource allocation; the UE includes: a receiving module, setting Receiving a random seed sent by the base station; the calculating module is configured to generate a corresponding pseudo random sequence according to the preset algorithm according to the random seed; and the processing module is configured to perform data transmission resource allocation according to the pseudo random sequence and/or Channel access resource allocation.
- a storage medium is also provided.
- the storage medium is arranged to store program code for performing the following steps:
- the sender configures a random seed and sends the random seed
- the random seed is used to generate a corresponding pseudo-random sequence
- the pseudo-random sequence is used At least one of the following: data transmission resource allocation, channel access resource allocation.
- the transmitting end configures a random seed, and sends the random seed; wherein the random seed is used to generate a corresponding pseudo random sequence, and the pseudo random sequence is used for at least one of the following: data transmission resource allocation
- the channel access resource allocation because the communication UE end allocates random seed resources, the UE can generate a pseudo-random sequence to improve the utilization of the radio resources. Since the randomness of the pseudo-random sequence is better, the same time slot is accessed the same. The probability of the resource is reduced, the resource collision occurring during the contention of the competition can be reduced, and the resource access of the UE can be quickly realized without being controlled by the base station, which can solve the problem of low resource utilization during channel access in the related art. problem.
- FIG. 1 is a network architecture diagram in accordance with an embodiment of the present invention.
- FIG. 2 is a flowchart of a method for processing a pseudo-random sequence according to an embodiment of the present invention
- FIG. 3 is a flowchart of another method for processing a pseudo-random sequence according to an embodiment of the present invention.
- FIG. 4 is a structural block diagram of a processing apparatus for a pseudo random sequence according to an embodiment of the present invention.
- FIG. 5 is a structural block diagram of another apparatus for processing a pseudo-random sequence according to an embodiment of the present invention.
- FIG. 6 is a structural block diagram of a processing system of a pseudo-random sequence according to an embodiment of the present invention.
- FIG. 7 is a flow chart of generating a pseudo-random sequence according to an embodiment of the present invention.
- FIG. 8 is a flow diagram of another method of generating a pseudo-random sequence in accordance with an embodiment of the present invention.
- FIG. 1 is a network architecture diagram according to an embodiment of the present invention. As shown in FIG. 1 , the network architecture includes: a base station, multiple terminals, and a base station and a terminal. .
- FIG. 2 is a flowchart of a method for processing a pseudo-random sequence according to an embodiment of the present invention. The process includes the following steps:
- Step S202 the sending end configures a random seed
- Step S204 Send a random seed, where the random seed is used to generate a corresponding pseudo random sequence, and the pseudo random sequence is used for at least one of the following: data transmission resource allocation, channel access resource allocation.
- the sending end configures a random seed and sends a random seed; wherein, the random seed is used to generate a corresponding pseudo random sequence, and the pseudo random sequence is used for at least one of: data transmission resource allocation, channel access resource allocation, A random seed resource is allocated to the communication UE, so the UE can generate a pseudo-random sequence and improve the utilization of the radio resource. Since the randomness of the pseudo-random sequence is relatively good, the probability of accessing the same resource in the same time slot is reduced, which can be reduced. Competing for the resource collision that occurs during the access, and realizing the resource access of the UE quickly without being controlled by the base station, the problem of low resource utilization during channel access in the related art can be solved.
- the sending end of the execution body of the foregoing step may be a network side device, such as a base station, etc., but is not limited thereto.
- the sending end determines a corresponding allocated resource according to the pseudo random sequence, and receives data from the data.
- the transmitting end determines a corresponding access resource according to a pseudo random sequence, and receives data therefrom.
- the method further includes: determining, by the sending end, a total length of the pseudo-random sequence, corresponding to the total number of resource units allocated by the plan. If a resource is assigned to multiple dimensions, the total quantity is the sum of the resource units required for multiple dimensions. For example, when the time domain frequency domain has 2 dimensions (the immediate domain is the first dimension and the frequency domain is the second dimension), the frequency domain units in each time domain unit on the time domain dimension need to be accumulated to obtain the total number.
- the sender determines that the total number of resource units allocated in each unit of a dimension is: the sum of the resource units needs to be allocated except for the dimension and the previous dimension.
- the transmitting end determines the number of frequency domain units required in a certain time domain unit, and then selects a corresponding number of sequence elements from the pseudo random sequence, and then estimates the corresponding frequency domain unit position (or number) from the selected sequence element, as The frequency domain unit allocated or usable in the time domain unit, that is, the resource unit that can be allocated or used in the time domain unit in this example.
- each element in the sequence corresponds to an assignable resource unit.
- the corresponding frequency domain unit position (or number) is calculated from the selected sequence element, specifically, the sequence element is multiplied by the total number of frequency domain units available for allocation in the time domain unit, and rounded down. Wait until the frequency domain unit number.
- the frequency domain unit number is an integer that increases by 1 in order from 1 or 0.
- the sending end determines the generated pseudo-random sequence in the following manner: the preset algorithm includes one of the following: a Kent mapping, a linear congruence method.
- generating a pseudo-random sequence of a preset length according to the Kent mapping based on the random seed includes:
- x n is a pseudo-random sequence of length n
- n is the total resource unit that can be allocated
- a is a constant, a ⁇ (0, 1).
- a 0.7.
- the random seed is generated according to a preset algorithm.
- the corresponding pseudo-random sequence includes:
- a, c and m are all integers.
- m is an integer greater than A, and A is the total number of resource units in the dimension to be allocated (for example, the frequency domain unit in each time domain unit needs to be allocated, then A is the frequency domain unit available for allocation in the time domain unit.
- Total a and c are preset values associated with A, x n is a pseudo-random sequence of length n, and n is the total resource unit that can be allocated.
- c and m are prime numbers.
- FIG. 3 is a flowchart of another method for processing a pseudo-random sequence according to an embodiment of the present invention, as shown in FIG. As shown, the process includes the following steps:
- Step S302 the receiving end receives the random seed sent by the sending end
- Step S304 the receiving end generates a corresponding pseudo random sequence according to a preset algorithm based on the random seed.
- Step S306 the receiving end performs data transmission resource allocation and/or channel access resource allocation according to a pseudo random sequence.
- the receiving end of the foregoing step may be a user equipment UE, a terminal, or the like, but is not limited thereto.
- the preset algorithm includes one of the following: a Kent mapping, a linear congruence method.
- generating a pseudo-random sequence of a preset length according to the Kent mapping based on the random seed includes:
- x n is a pseudo-random sequence of length n
- n is the total resource unit that can be allocated
- generating a corresponding pseudo-random sequence x n+1 according to a preset algorithm based on the random seed includes:
- x n+1 ((ax n +c)modm)/m;
- a, c and m are all integers.
- m is an integer greater than A, and A is the total number of resource units in the dimension to be allocated (for example, the frequency domain unit in each time domain unit needs to be allocated, then A is the frequency domain unit available for allocation in the time domain unit. Total), a and c are preset values associated with A, x n is a pseudo-random sequence of length n, n is the total resource unit that can be allocated, and c and m are prime numbers.
- the data transmission resource allocation and/or the channel access resource allocation according to the pseudo random sequence at the receiving end includes: the receiving end and the transmitting end agree on the number of resource units to be allocated in each dimension; or the receiving end receives the signaling of the transmitting end. It is known that the number of resource units needs to be allocated in each dimension; the receiving end determines the total length of the generated pseudo-random sequence, corresponding to the total number of resource units allocated by the plan.
- the total number of resource units allocated by the corresponding plan is a sum of resource units required by multiple dimensions, where the dimension may include the following four: a first dimension: a time domain dimension, and a second Dimensions: Frequency Domain Dimensions, Third Dimensions: Airspace Dimensions, Fourth Dimensions: Code Domain Dimensions.
- a first dimension a time domain dimension
- a second Dimensions Frequency Domain Dimensions
- Third Dimensions Airspace Dimensions
- Fourth Dimensions Code Domain Dimensions.
- the receiving end determines the total number of resource units allocated in each unit of the specified dimension of the plurality of dimensions, including: the dimension other than the dimension of the specified dimension and the dimension of the specified dimension needs to allocate the sum of the resource units.
- the receiving end determines that the corresponding allocated resource or access resource may be, but is not limited to, the following:
- the receiving end determines the number of frequency domain units required in the time domain unit
- the corresponding frequency domain unit number is estimated from the selected sequence element as a frequency domain unit allocated or usable in the time domain unit, wherein each element in the pseudo random sequence corresponds to one assignable resource unit.
- estimating the corresponding frequency domain unit number from the selected sequence element comprises: placing the sequence element The prime is multiplied by the total number of frequency domain units available for allocation in the time domain unit, and rounded down to obtain a frequency domain unit number, wherein the frequency domain unit number is an integer that increases by 1 from 1 or 0.
- the method according to the above embodiment can be implemented by means of software plus a necessary general hardware platform, and of course, by hardware, but in many cases, the former is A better implementation.
- the technical solution of the present invention which is essential or contributes to the prior art, may be embodied in the form of a software product stored in a storage medium (such as ROM/RAM, disk,
- the optical disc includes a number of instructions for causing a terminal device (which may be a cell phone, a computer, a server, or a network device, etc.) to perform the methods of various embodiments of the present invention.
- a processing device and a system for the pseudo-random sequence are provided, which are used to implement the foregoing embodiments and preferred embodiments, and are not described again.
- the term "module” may implement a combination of software and/or hardware of a predetermined function.
- the apparatus described in the following embodiments is preferably implemented in software, hardware, or a combination of software and hardware, is also possible and contemplated.
- FIG. 4 is a structural block diagram of a processing apparatus for a pseudo-random sequence according to an embodiment of the present invention, which is applied to a base station side, as shown in FIG. 4, the apparatus includes:
- the configuration module 40 is configured to configure a random seed
- the sending module 42 is configured to send a random seed
- the random seed is used to generate a corresponding pseudo random sequence, and the pseudo random sequence is used for at least one of the following: data transmission resource allocation, channel access resource allocation.
- FIG. 5 is a structural block diagram of another pseudo random sequence processing apparatus according to an embodiment of the present invention, which is applied to a terminal side, as shown in FIG. 5, the apparatus includes:
- the receiving module 50 is configured to receive a random seed sent by the sending end
- the calculating module 52 is configured to generate a corresponding pseudo random sequence according to a preset algorithm based on the random seed Column
- the processing module 54 is configured to perform data transmission resource allocation and/or channel access resource allocation according to a pseudo random sequence.
- FIG. 6 is a structural block diagram of a processing system of a pseudo-random sequence according to an embodiment of the present invention. As shown in FIG. 6, the system includes: a base station 60, a user equipment UE62, and the base station 60 further includes:
- the configuration module 602 is configured to configure a random seed
- the sending module 604 is configured to send a random seed
- the random seed is used to generate a corresponding pseudo random sequence, and the pseudo random sequence is used for at least one of: data transmission resource allocation, channel access resource allocation;
- UE62 includes:
- the receiving module 622 is configured to receive a random seed sent by the base station
- the calculating module 624 is configured to generate a corresponding pseudo random sequence according to a preset algorithm based on the random seed;
- the processing module 626 is configured to perform data transmission resource allocation and/or channel access resource allocation according to a pseudo random sequence.
- each of the above modules may be implemented by software or hardware.
- the foregoing may be implemented by, but not limited to, the foregoing modules are all located in the same processor; or, the above modules are in any combination.
- the forms are located in different processors.
- This embodiment is an optional embodiment according to the present invention, which is used to describe the present application in detail in conjunction with specific scenarios and examples:
- a method for processing a pseudo-random sequence based on a pseudo-random sequence is proposed, which can reduce the collision probability caused by random backoff, and can solve how fast the receiving end and the transmitting end are not controlled by the base station.
- the problem with the connection takes the channel access as an example to improve the deficiencies of the existing solutions, further reduce the delay of data transmission, and improve resource utilization. Use rate to enhance the user experience. Therefore, the present invention communicates channel access technologies in unlicensed frequency bands, and considers how to reduce collision problems between different UEs:
- This embodiment includes two and different solutions, corresponding to different implementations.
- FIG. 7 is a flowchart of generating a pseudo random sequence according to an embodiment of the present invention. As shown in FIG. 7, the first scheme includes:
- Step 1 Determine the initial value X 0 of the initial random seed.
- the initial random seed is generated and allocated by the base station to a certain UE, and the initial random seed has a value range of (0, 1).
- a pseudo-random sequence L1 of length l is generated in accordance with the Kent mapping.
- the kent map is a chaotic map with piecewise linearity, and its dynamic equation is:
- the length l of the sequence L1 is equal to the number of resource units that the time domain resource can allocate (for example, the time domain has a number of subframes or time slots, etc.). For example, if the number of time domain resource units is a time slot and is assumed to be 4 time slots, the random sequence length l is 4.
- the reason for selecting the Kent mapping is that the distribution function is relatively uniform and can be mapped to the corresponding resource block unit (Mini Resource Block, MRB for short) (equivalent to the Physical Resource Block (PRB)). And also has excellent statistical characteristics.
- Step 2 Assume that 50 MRBs can be allocated in the frequency domain in each time slot, and the above L1 sequence is assigned to mi (this process is only introduced for convenience of explanation). Then proceed to the following processing.
- the number of the MRB corresponding to each time slot N i , i and slot index is as follows:
- N i 35, 47, 7, and 11 in order. That is, the MRB number assigned by the UE in the first time slot is 35, the MRB number assigned by the UE in the first time slot is 47, and the MRB number assigned by the UE in the first time slot is 7, and the UE is in the first time.
- the MRB number assigned to the slot is 11.
- the service that the UE needs to transmit may require multiple MRBs to complete.
- the following methods are proposed: The UE allocates multiple MRBs corresponding to one time slot. It is assumed that there are 4 time slots, and each time slot needs to allocate 3 PRBs for one D2D UE.
- the base station directly delivers three random seeds, and three random sequences can be generated corresponding to different random seeds. For example, the base station allocates random seeds 0.4, 0.5, and 0.6 to UE1.
- the shared time slot can be Q, for example, four, and the sequence length generated by the random seed is 4.
- the sequence generated by the random seed 0.4 by Kent mapping is 0.5714, 0.8163, 0.6122, 0.8746, and the corresponding MRB numbers are 28, 40, 30, 43; the sequence generated by the random seed 0.5 by Kent mapping is 0.7143, 0.9524, 0.1587, 0.2268, The MRB numbers corresponding to the mapping are 35, 47, 7, and 11; the sequences generated by the random seed 0.6 through the Kent mapping are 0.8571, 0.4762, 0.6803, and 0.9712, and the corresponding MRB numbers are 42, 23, 34, and 48. Therefore, the resource blocks numbered 28, 35, and 42 may be occupied in the first shared time slot, and the resource blocks numbered 40, 23, and 47 may be occupied on the second shared time slot, and so on. If the base station allocates more than three random seeds, the method is the same as above;
- the base station allocates a random seed and offset to the UE (can be agreed upon, once agreed) Then send by signaling) and the value of 3. Using this offset, the values of the other 2 random seeds can be calculated. For example, if the number of random seeds allocated by the base station is 0.5 and the offset is 0.02, if three MRBs are occupied in one time slot, the random seeds actually generated are 0.5, 0.52, and 0.54, and then the random seed is used to generate a random sequence. Map.
- the sequence generated by the Kent mapping is 0.7143, 0.9524, 0.1587, 0.2268, 0.3239, 0.4628, 0.6611, 0.9444, 0.1852, 0.2646, 0.3780, 0.5400, and the corresponding MRB number is 35 after mapping. 47, 7, 11, 16, 23, 33, 47, 9, 13, 18, 27.
- resource blocks required for each time slot it may be selected according to a certain rule order, for example, resource blocks with MRB numbers 35, 47, and 7 are allocated to the first time slot, and resource blocks are allocated for 11, 16, and 23. To the second time slot, and so on;
- the selection of resource blocks on each time slot may be adopted.
- the sequential selection method is to allocate the resource blocks of numbers 35 and 47 to the first time slot, the resource blocks numbered 7, 11, and 16 to the second time slot, and so on; In the block mode, two resource blocks are selected for the first time slot, the second time slot selects three MRBs from the remaining 10 resource blocks, and so on.
- the base station allocates the same random seed to the sender and the receiver, the corresponding sender and The state of the chaotic time sequence generated by the receiving end is consistent, and the same MRB resource block can be accessed at the same time for data transmission.
- This randomized resource allocation requires knowledge of two parameters, the initial random seed and the total resources that need to be allocated (if multidimensional needs to be converted into total resources, such as time domain and frequency domain, time domain * frequency domain is required to obtain total of).
- FIG. 8 is a flowchart of generating a pseudo-random sequence according to an embodiment of the present invention. As shown in FIG. 8, the method includes:
- Step 1 Same as step 1 of scenario 1.
- the pseudo-random sequence that is only utilized produces different equations.
- the linear congruence method is used in this scenario.
- the initial value X 0 of the initial random seed is determined.
- the initial random seed is generated and allocated by the base station to a certain UE, and the initial random seed value ranges from 1 to 10 frequency domain resources.
- a pseudo-random sequence L1 of length l is generated according to the linear congruence method mapping.
- the method of generating a pseudo-random sequence by the linear congruence method is as follows:
- a, c and m are integers, and the randomness of the sequence is derived from the modulo operation.
- the choice of the modulus m should be as large as possible because the period of the sequence cannot be greater than m. In the present invention it is assumed that there are 50 MRBs per time slot, so the value of m should be at least 50. M. Greenberger proves that the condition of generating a pseudo-random number sequence with a period m using the linear multiplication congruence method is as follows:
- A-1 is a multiple of prime number p, where p is the common divisor of a-1 and m;
- n is a multiple of 4
- a-1 is also a multiple of 4.
- the number of shared time slots is four, and the MRB of each time slot is 50
- the length of the generated random sequence should be 4
- the sequence X generated by the linear congruence method is It is 52, 19, 14, 37.
- Each sequence in L1 corresponds to 4 time slots.
- Step 3 Map the random value y n obtained in step 2 to the frequency band corresponding to each MRB. If there are 50 MRBs in the corresponding frequency domain in one time slot, multiply y n distributed in the range of [0, 1] by 50 and then round up to obtain the corresponding MRB number.
- the calculation method is as follows:
- N [y n *50], [] means rounding down
- the MRB number assigned by the UE in the first time slot is 47
- the MRB number assigned by the UE in the first time slot is 16
- the MRB number assigned by the UE in the first time slot is 12, and the UE is in the first time.
- the MRB number assigned to the slot is 33.
- the base station directly delivers three random seeds, and three random sequences can be generated corresponding to different random seeds. For example, the base station assigns random seeds 1, 2 and 3 to UE1.
- the shared time slot is four, and the sequence length generated by the random seed is 4.
- the sequence generated by the linear congruence method using the random seed 1 is 52, 19, 14, 37, and the corresponding MRB numbers are 46, 16, 12, 33;
- the sequence generated by the random seed 2 by the linear congruence method is 25, 20, 43, 38, and the corresponding MRB numbers are 22, 17, 38, 33;
- the sequence generated by the random seed 3 by the linear congruence method is 54, 21, 16, and 39, and the corresponding MRB numbers are 48, 18, 14, and 34.
- the resource blocks numbered 46, 22, and 48 may be occupied in the first shared time slot, and the resource blocks numbered 16, 17, and 18 may be occupied on the second shared time slot, and so on.
- Ruoji The station allocates more than three random seeds in the same way as above;
- the base station allocates a random seed and an offset to the UE (it can be agreed that it will not be sent by signaling once agreed). Using this offset, the values of the other 2 random seeds can be calculated. For example, if the number of random seeds allocated by the base station is 1, and the offset is 1, if three MRBs are occupied in one time slot, the randomly generated random seeds are 1, 2, and 3, and then the random seed is used to generate a random sequence. Map.
- resource blocks required for each time slot it may be selected according to a certain rule order, for example, resource blocks with MRB numbers 46, 16, and 12 are allocated to the first time slot, and resource blocks are allocated for 33, 28, and 49.
- resource blocks are allocated for 33, 28, and 49.
- there are different resource blocks required in each time slot For example, if two, 3, 3, and 4 resource blocks are needed on four time slots, the selection of resource blocks on each time slot may be adopted.
- the sequential selection method is to allocate the resource blocks of numbers 46 and 16 to the first time slot, the resource blocks numbered 12, 33, and 28 to the second time slot, and so on; In the block mode, two resource blocks are selected for the first time slot, the second time slot selects three MRBs from the remaining 10 resource blocks, and so on.
- the base station Since the base station allocates the same random seed to the transmitting end and the receiving end, the corresponding transmitting end and the receiving end generate the same state of the linear congruence sequence, and can access the same MRB resource block at the same time for data transmission.
- the embodiment includes the following specific implementation manners.
- the base station allocates a resource pool to the UE.
- the UE calculates the PRB specifically used in the resource pool according to the random seed configured before the base station and the code in the time domain direction in the resource pool.
- the resource pool is periodically generated.
- the scheduling unit of the resource pool in the time domain direction (one scheduling unit includes several symbols) is numbered from 0 to 9, and the resource pool is allocated in the direction of the frequency domain.
- PRB is 50, which is recorded as 1-50.
- the period index is 0-99 and the loop appears.
- the UE uses 2 PRBs for transmission each time it transmits in each scheduling unit.
- the base station After the base station configures the resource pool, the base station allocates a random seed X0 to the UE.
- the UE determines the PRB index used by the UE in each scheduling unit in the following manner.
- Xn performs the following calculation to convert the PRB number converted to the frequency domain in each scheduling unit.
- Ni sequentially takes 20 values in order to form a new sequence, denoted as Pk, which corresponds to the period index number. Where k is equal to the value of the periodic index.
- Pk sequence contains 20 values.
- the data is sent in the PRB corresponding to the scheduling unit in the corresponding resource pool according to the random seed allocated by the base station.
- the base station allocates a PRB index for transmitting data of the UE in each scheduling unit in each resource pool according to the configuration of the random seed for the UE, and then receives the data of the UE in the PRB.
- the technical effect is that this method has significant signaling overhead, one-time allocation, long-term resource allocation, and the PRB allocation in all scheduling units has a randomization effect, which greatly reduces the PRB conflict when the UE randomly preempts the PRB in the resource pool. problem.
- the problem that the base station side needs to blindly check all possible PRB resources to discover the complexity of sending data by the UE is also solved when the UE randomly acquires the PRB in the resource pool for uplink data transmission.
- the base station assigns a random seed X0 to it.
- the UE calculates a frequency domain resource for transmitting the service according to the method in the foregoing method 1 or method 2.
- the calculation is that the time domain direction can be performed by the scheduling unit of the service in the time domain number, for example, the frame number similar to the low latency service.
- a time direction number can be obtained according to the frame number, the subframe number, or the slot number in the system.
- the PRB that can be used in each scheduling unit corresponding to the number is calculated (if there is a service, if it is not sent, the base station can schedule other non-low latency services).
- the following is an example of the time direction numbering mechanism of LTE.
- Frame number 0-1023 in LTE loop number.
- this low-latency service is sent in units of one subframe (which can be smaller, such as time slots, OFDM symbols, etc., but the calculation is more complicated), and
- Each PRB reserves 1 PRB for this transmission as well (multiple is also possible, but the best per subframe is a fixed number, the complexity will be complicated due to computation Too much).
- the UE or the base station, the base station needs to calculate when receiving) according to the initial random seed X0, according to the example in Embodiment 1 above, similarly, the PRB reserved for the service in each subframe can be calculated.
- the base station side also calculates the resources for the UE to send low-latency services in each subframe, and then only needs to detect the resources, and does not need to blindly check other resources. This can reduce the complexity of base station detection.
- this method Compared with semi-persistent scheduling, this method has randomization efficiency and can be more frequency domain diversity.
- this method is equivalent to an "infinite" number of hopping patterns and has excellent randomness in different time units.
- the common patterns of frequency hopping are limited. Colleagues cannot support many UEs, and different time units use limited pattern polling, and the randomization effect is poor.
- This method is not only simple to calculate, but also excellent in randomization effect.
- the UE that sends uplink data in the resource pool can perform uplink data transmission only when there is a random seed allocated by the base station.
- a UE that does not have a random seed configured by the base station cannot autonomously preempt the resources in the resource pool for uplink data transmission. In this way, whether the resources in the resource pool are actually used, and the base station can calculate the random seed that has been allocated, and the base station will calculate the resources that will not be used for other types of UEs after the calculation (ie, not through the resource pool preemption mode).
- the UE, or the UE that transmits the authorization information by the base station transmits the uplink data.
- Embodiments of the present invention also provide a storage medium.
- the foregoing storage medium may be configured to store program code for performing the following steps:
- the sender configures a random seed and sends a random seed
- the random seed is used to generate a corresponding pseudo-random sequence
- the pseudo-random sequence is used to One of the less: data transmission resource allocation, channel access resource allocation.
- the foregoing storage medium may include, but not limited to, a USB flash drive, a Read-Only Memory (ROM), a Random Access Memory (RAM), a mobile hard disk, and a magnetic memory.
- ROM Read-Only Memory
- RAM Random Access Memory
- a mobile hard disk e.g., a hard disk
- magnetic memory e.g., a hard disk
- the processor performs a sending end configuration random seed according to the stored program code in the storage medium, and sends a random seed;
- the random seed is used to generate a corresponding pseudo random sequence, and the pseudo random sequence is used for at least one of the following: data transmission resource allocation, channel access resource allocation.
- modules or steps of the present invention described above can be implemented by a general-purpose computing device that can be centralized on a single computing device or distributed across a network of multiple computing devices. Alternatively, they may be implemented by program code executable by the computing device such that they may be stored in the storage device by the computing device and, in some cases, may be different from the order herein.
- the steps shown or described are performed, or they are separately fabricated into individual integrated circuit modules, or a plurality of modules or steps thereof are fabricated as a single integrated circuit module.
- the invention is not limited to any specific combination of hardware and software.
- the transmitting end configures a random seed and sends the random seed; wherein the random seed is used to generate a corresponding pseudo random sequence, and the pseudo random sequence is used for the following At least one of: data transmission resource allocation, channel access resource allocation, because a random seed resource is allocated to the communication UE, the UE may generate a pseudo-random sequence, improve the utilization of the radio resource, and the randomness of the pseudo-random sequence is better. Therefore, the probability of accessing the same resource in the same time slot is reduced, the resource collision occurring during the contention access can be reduced, and the resource access of the UE can be quickly implemented without being controlled by the base station, and the channel in the related art can be solved. The problem of low resource utilization during access.
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
本发明提供了一种伪随机序列的处理方法、装置及系统、存储介质,其中,该方法包括:发送端配置随机种子,并发送所述随机种子;其中,所述随机种子用于产生相应的伪随机序列,所述伪随机序列用于以下至少之一:数据传输资源分配、信道接入资源分配。通过本发明,解决了相关技术中在信道接入时资源利用率低的问题。
Description
本发明涉及通信领域,具体而言,涉及一种伪随机序列的处理方法、装置及系统、存储介质。
由于多媒体业务需求的急剧增长,频谱资源短缺成为移动通信面临的挑战。在传统的蜂窝网络中,不允许用户之间直接通信,这种集中式工作方式虽然便于对资源和干扰的管理和控制,但资源利用率低。
相关技术中,关于信道接入技术的研究,主要集中在无线局域网上。例如:用于无线局域网的分布式媒体接入技术、在无线局域网中实现资源预留的半随机退避方法等。但是当传输的用户数目增多时,冲突概率会大大增大,造成严重的资源浪费。
针对相关技术中存在的上述问题,目前尚未发现有效的解决方案。
发明内容
本发明实施例提供了一种伪随机序列的处理方法、装置及系统、存储介质,以至少解决相关技术中在信道接入时资源利用率低的问题。
根据本发明的一个实施例,提供了一种伪随机序列的处理方法,包括:发送端配置随机种子,并发送所述随机种子;其中,所述随机种子用于产生相应的伪随机序列,所述伪随机序列用于以下至少之一:数据传输资源分配、信道接入资源分配。
可选的,当所述伪随机序列用于数据传输资源分配时,所述发送端还根据所述伪随机序列确定对应的分配资源,并从中接收数据;或,当所述伪随机序列用于信道接入资源分配时,所述发送端还根据所述伪随机序列确定对应的接入资源,并从中接收数据。
可选的,述确定对应的分配资源或接入资源,还包括:发送端确定伪随机序列的总长度,对应计划分配的资源单位总数量。
可选的,在分配资源为多个维度时,所述对应计划分配的资源单位总数量为多个维度需要的资源单位总和,其中,所述维度包括以下至少之一:第一维度:时域维度,第二维度:频域维度,第三维度:空域维度,第四维度:码域维度。
可选的,所述发送端确定多个维度中的一个指定维度的每个单位中分配的资源单位总数包括:除所述指定维度和所述指定维度的维度序号之前维度外的其他维度需要分配资源单位总和。
可选的,所述发送端确定对应的分配资源或接入资源包括:
所述发送端确定时域单位中需要的频域单位数量;
从所述伪随机序列中选取对应数量的序列元素;
从选取的序列元素推算对应的频域单位编号,作为该时域单位中分配的或可以使用的频域单位,其中,所述伪随机序列中每一个元素对应一个可分配资源单位。
可选的,从选取的序列元素推算对应的频域单位编号包括:
将序列元素乘以该时域单位中可供分配的频域单位总数,并向下取整,得到频域单位编号,其中,所述频域单位编号为从1或0开始依次以1为单位增加的整数。
可选的,在发送端配置随机种子之后,所述方法还包括:
所述发送端按照以下预设算法之一确定产生的伪随机序列:Kent映射、线性同余法。
可选的,在所述预设算法为Kent映射时,基于所述随机种子按照Kent映射产生预设长度的伪随机序列包括:
按照以下公式计算所述伪随机序列xn+1:
其中,xn为长度为n的伪随机序列,n为可分配的总资源单位,a为常量,a∈(0,1)。
可选的,所述a=0.7。
可选的,在所述预设算法为线性同余法时,基于所述随机种子按照预设算法产生相应的伪随机序列包括:
按照以下公式计算所述伪随机序列xn+1:
xn+1=((axn+c)modm)/m
其中,a,c和m皆为整数,所述m为大于A的整数,A为待分配维度中总的资源单位数,a、c分别为与所述A相关的预设值,xn为长度为n的伪随机序列,n为可分配的总资源单位,c和m为互质数。
可选的,若每个时域单位中有50个频域单位,则a=29,c=23,m=56;若每个时域单位中有100个频域单位,则a=53,c=37,m=104。
根据本发明的一个实施例,提供了另一种伪随机序列的处理方法,包括:接收端接收发送端发送的随机种子;所述接收端基于所述随机种子按照预设算法产生相应的伪随机序列;所述接收端根据所述伪随机序列进行数据传输资源分配和/或信道接入资源分配。
可选的,所述预设算法包括以下之一:Kent映射、线性同余法。
可选的,在所述预设算法为Kent映射时,基于所述随机种子按照Kent映射产生预设长度的伪随机序列包括:
按照以下公式计算所述伪随机序列xn+1:
其中,xn为长度为n的伪随机序列,n为可分配的总资源单位,a为常量,a∈(0,1)。
可选的,所述a=0.7。
可选的,在所述预设算法为线性同余法时,基于所述随机种子按照预设算法产生相应的伪随机序列包括:
xn+1=((axn+c)modm)/m
其中,a,c和m皆为整数。所述m为大于A的整数,A为待分配维度中总的资源单位数(例如需要分配每个时域单位中的频域单位,则A为时域单位中的可供分配的频域单位的总数),a、c分别为与所述A相关的预设值,xn为长度为n的伪随机序列,n为可分配的总资源单位,c和m为互质数。
可选的,在所述接收端根据所述伪随机序列进行数据传输资源分配和/或信道接入资源分配,所述方法还包括:接收端与发送端约定每个维度中需要分配资源单位数量;或者接收端接收发送端的信令获知每个维度中需要分配资源单位数量;接收端确定产生的伪随机序列的总长度,对应计划分配的资源单位总数量。
可选的,在分配资源为多个维度时,所述对应计划分配的资源单位总数量为多个维度需要的资源单位总和,其中,所述维度包括以下至少之一:第一维度:时域维度,第二维度:频域维度,第三维度:空域维度,第四维度:码域维度。
可选的,所述接收端确定多个维度中的一个指定维度的每个单位中分配的资源单位总数包括:除所述指定维度和所述指定维度的维度序号之前维度外的其他维度需要分配资源单位总和。
可选的,所述接收端确定对应的分配资源或接入资源包括:
所述接收端确定时域单位中需要的频域单位数量;
从所述伪随机序列中选取对应数量的序列元素;
从选取的序列元素推算对应的频域单位编号,作为该时域单位中分配的或可以使用的频域单位,其中,所述伪随机序列中每一个元素对应一个可分配资源单位。
可选的,从选取的序列元素推算对应的频域单位编号包括:
将序列元素乘以该时域单位中可供分配的频域单位总数,并向下取整,得到频域单位编号,其中,所述频域单位编号为从1或0开始依次以1为单位增加的整数。
根据本发明的另一个实施例,提供了一种伪随机序列的处理装置,包括:配置模块,设置为配置随机种子;发送模块,设置为发送所述随机种子;其中,所述随机种子用于产生相应的伪随机序列,所述伪随机序列用于以下至少之一:数据传输资源分配、信道接入资源分配。
根据本发明的另一个实施例,提供了另一种伪随机序列的处理装置,包括:接收模块,设置为接收发送端发送的随机种子;计算模块,设置为基于所述随机种子按照预设算法产生相应的伪随机序列;处理模块,设置为根据所述伪随机序列进行数据传输资源分配和/或信道接入资源分配。
根据本发明的另一个实施例,提供了又一种伪随机序列的处理系统,包括基站、用户设备UE,所述基站包括:配置模块,设置为配置随机种子;发送模块,设置为发送所述随机种子;其中,所述随机种子用于产生相应的伪随机序列,所述伪随机序列用于以下至少之一:数据传输资源分配、信道接入资源分配;所述UE包括:接收模块,设置为接收所述基站发送的随机种子;计算模块,设置为基于所述随机种子按照预设算法产生相应的伪随机序列;处理模块,设置为根据所述伪随机序列进行数据传输资源分配和/或信道接入资源分配。
根据本发明的又一个实施例,还提供了一种存储介质。该存储介质设置为存储用于执行以下步骤的程序代码:
发送端配置随机种子,并发送所述随机种子;
其中,所述随机种子用于产生相应的伪随机序列,所述伪随机序列用
于以下至少之一:数据传输资源分配、信道接入资源分配。
通过本发明实施例,发送端配置随机种子,并发送所述随机种子;其中,所述随机种子用于产生相应的伪随机序列,所述伪随机序列用于以下至少之一:数据传输资源分配、信道接入资源分配,由于对通信UE端分配随机种子资源,因此UE可以产生伪随机序列,提高无线资源的利用率,由于伪随机序列的随机性比较好,所以在同一时隙接入相同资源的概率减少,可以减少在竞争接入时发生的资源碰撞,同时实现在不受基站控制的情况下快速实现UE的资源接入,可以解决相关技术中在信道接入时资源利用率低的问题。
此处所说明的附图用来提供对本发明的进一步理解,构成本申请的一部分,本发明的示意性实施例及其说明用于解释本发明,并不构成对本发明的不当限定。在附图中:
图1是根据本发明实施例的网络构架图;
图2是根据本发明实施例的一种伪随机序列的处理方法的流程图;
图3是根据本发明实施例的另一种伪随机序列的处理方法的流程图;
图4是根据本发明实施例的一种伪随机序列的处理装置的结构框图;
图5是根据本发明实施例的另一种伪随机序列的处理装置的结构框图;
图6是根据本发明实施例的伪随机序列的处理系统的结构框图;
图7是根据本发明实施例的一种产生伪随机序列的流程图;
图8是根据本发明实施例的另一种产生伪随机序列的流程图。
下文中将参考附图并结合实施例来详细说明本发明。需要说明的是,在不冲突的情况下,本申请中的实施例及实施例中的特征可以相互组合。
需要说明的是,本发明的说明书和权利要求书及上述附图中的术语
“第一”、“第二”等是用于区别类似的对象,而不必用于描述特定的顺序或先后次序。
实施例1
本申请实施例可以运行于图1所示的网络架构上,图1是根据本发明实施例的网络构架图,如图1所示,该网络架构包括:基站、多个终端,基站与终端连接。
在本实施例中提供了一种运行于上述网络架构的伪随机序列的处理方法,图2是根据本发明实施例的一种伪随机序列的处理方法的流程图,如图2所示,该流程包括如下步骤:
步骤S202,发送端配置随机种子;
步骤S204,发送随机种子,其中,随机种子用于产生相应的伪随机序列,伪随机序列用于以下至少之一:数据传输资源分配、信道接入资源分配。
通过上述步骤,发送端配置随机种子,并发送随机种子;其中,随机种子用于产生相应的伪随机序列,伪随机序列用于以下至少之一:数据传输资源分配、信道接入资源分配,由于对通信UE端分配随机种子资源,因此UE可以产生伪随机序列,提高无线资源的利用率,由于伪随机序列的随机性比较好,所以在同一时隙接入相同资源的概率减少,可以减少在竞争接入时发生的资源碰撞,同时实现在不受基站控制的情况下快速实现UE的资源接入,可以解决相关技术中在信道接入时资源利用率低的问题。
可选地,上述步骤的执行主体的发送端可以为网络侧设备,如基站等,但不限于此。
可选的,当上述伪随机序列用于资源分配目的时,发送端根据伪随机序列确定对应的分配资源,并从中接收数据。或者,当上述伪随机序列用于信道接入目的时,发送端根据伪随机序列确定对应的接入资源,并从中接收数据。
可选的,确定对应的分配资源或接入资源,还包括:发送端确定伪随机序列的总长度,对应计划分配的资源单位总数量。如果资源分配为多个维度时,则总数量为多个维度需要的资源单位总和。例如时域频域2个维度时(即时域为第一维度、频域为第二维度),则需要把时域维度上每个时域单位中的频域单位进行累加得到总数量。
可选的,发送端确定某一维度的每个单位中分配的资源单位总数为:除该维度以及之前维度外其余维度需要分配资源单位总和。例如,发送端确定某个时域单位中需要的频域单位数量,然后从伪随机序列中选取对应数量的序列元素,再从选取的序列元素推算对应的频域单位位置(或编号),作为该时域单位中分配的或可以使用的频域单位,即该例中该时域单位中可分配的或可以使用的资源单位。显然,序列中每一个元素对应一个可分配资源单位。
可选的,再从选取的序列元素推算对应的频域单位位置(或编号),具体为,将序列元素乘以该时域单位中可供分配的频域单位总数,并向下取整,等到频域单位编号。其中频域单位编号为从1或0开始依次以1为单位增加的整数。
可选的,发送端按照下面方式确定产生的伪随机序列:预设算法包括以下之一:Kent映射、线性同余法。
可选的,在预设算法为Kent映射时,基于随机种子按照Kent映射产生预设长度的伪随机序列包括:
按照以下公式计算伪随机序列xn+1:
其中,xn为长度为n的伪随机序列,n为可分配的总资源单位,a为常量,a∈(0,1)。优选的,a=0.7。
可选的,在预设算法为线性同余法时,基于随机种子按照预设算法产
生相应的伪随机序列包括:
按照以下公式计算伪随机序列xn+1:
xn+1=((axn+c)modm)/m
其中,a,c和m皆为整数。m为大于A的整数,A为待分配维度中总的资源单位数(例如,需要分配每个时域单位中的频域单位,则A为时域单位中的可供分配的频域单位的总数),a、c分别为与A相关的预设值,xn为长度为n的伪随机序列,n为可分配的总资源单位。c和m为互质数。下面进行举例说明:若每个时域单位中有50个频域单位,则a=29,c=23,m=56;若每个时域单位中有100个频域单位,则a=53,c=37,m=104。
在本实施例中,还提供了另一种运行于上述网络架构的伪随机序列的处理方法,图3是根据本发明实施例的另一种伪随机序列的处理方法的流程图,如图3所示,该流程包括如下步骤:
步骤S302,接收端接收发送端发送的随机种子;
步骤S304,接收端基于随机种子按照预设算法产生相应的伪随机序列;
步骤S306,接收端根据伪随机序列进行数据传输资源分配和/或信道接入资源分配。
可选地,上述步骤的执行主体接收端可以为用户设备UE,终端等,但不限于此。
可选的,预设算法包括以下之一:Kent映射、线性同余法。
可选地,在预设算法为Kent映射时,基于随机种子按照Kent映射产生预设长度的伪随机序列包括:
按照以下公式计算伪随机序列xn+1:
其中,xn为长度为n的伪随机序列,n为可分配的总资源单位,a为
常量,a∈(0,1),优选的,a=0.7。
可选地,在预设算法为线性同余法时,基于随机种子按照预设算法产生相应的伪随机序列xn+1包括:
xn+1=((axn+c)modm)/m;
其中,a,c和m皆为整数。m为大于A的整数,A为待分配维度中总的资源单位数(例如,需要分配每个时域单位中的频域单位,则A为时域单位中的可供分配的频域单位的总数),a、c分别为与A相关的预设值,xn为长度为n的伪随机序列,n为可分配的总资源单位,c和m为互质数。
可选地,在接收端根据伪随机序列进行数据传输资源分配和/或信道接入资源分配包括:接收端与发送端约定每个维度中需要分配资源单位数量;或者接收端接收发送端的信令获知每个维度中需要分配资源单位数量;接收端确定产生的伪随机序列的总长度,对应计划分配的资源单位总数量。
可选地,在分配资源为多个维度时,对应计划分配的资源单位总数量为多个维度需要的资源单位总和,其中,维度可以包括以下四个:第一维度:时域维度,第二维度:频域维度,第三维度:空域维度,第四维度:码域维度。当然,还可以除了上述四个维度之外的其他维度。
可选地,接收端确定多个维度中的一个指定维度的每个单位中分配的资源单位总数包括:除指定维度和指定维度的维度序号之前维度外的其他维度需要分配资源单位总和。
可选地,接收端确定对应的分配资源或接入资源可以但不限于为以下:
接收端确定时域单位中需要的频域单位数量;
从伪随机序列中选取对应数量的序列元素;
从选取的序列元素推算对应的频域单位编号,作为该时域单位中分配的或可以使用的频域单位,其中,伪随机序列中每一个元素对应一个可分配资源单位。
可选地,从选取的序列元素推算对应的频域单位编号包括:将序列元
素乘以该时域单位中可供分配的频域单位总数,并向下取整,得到频域单位编号,其中,频域单位编号为从1或0开始依次以1为单位增加的整数。
通过以上的实施方式的描述,本领域的技术人员可以清楚地了解到根据上述实施例的方法可借助软件加必需的通用硬件平台的方式来实现,当然也可以通过硬件,但很多情况下前者是更佳的实施方式。基于这样的理解,本发明的技术方案本质上或者说对现有技术做出贡献的部分可以以软件产品的形式体现出来,该计算机软件产品存储在一个存储介质(如ROM/RAM、磁碟、光盘)中,包括若干指令用以使得一台终端设备(可以是手机,计算机,服务器,或者网络设备等)执行本发明各个实施例的方法。
实施例2
在本实施例中还提供了一种伪随机序列的处理装置、系统,用于实现上述实施例及优选实施方式,已经进行过说明的不再赘述。如以下所使用的,术语“模块”可以实现预定功能的软件和/或硬件的组合。尽管以下实施例所描述的装置较佳地以软件来实现,但是硬件,或者软件和硬件的组合的实现也是可能并被构想的。
图4是根据本发明实施例的一种伪随机序列的处理装置的结构框图,应用在基站侧,如图4所示,该装置包括:
配置模块40,设置为配置随机种子;
发送模块42,设置为发送随机种子;
其中,随机种子用于产生相应的伪随机序列,伪随机序列用于以下至少之一:数据传输资源分配、信道接入资源分配。
图5是根据本发明实施例的另一种伪随机序列的处理装置的结构框图,应用在终端侧,如图5所示,该装置包括:
接收模块50,设置为接收发送端发送的随机种子;
计算模块52,设置为基于随机种子按照预设算法产生相应的伪随机序
列;
处理模块54,设置为根据伪随机序列进行数据传输资源分配和/或信道接入资源分配。
图6是根据本发明实施例的伪随机序列的处理系统的结构框图,如图6所示,该系统包括:基站60、用户设备UE62,基站60还包括:
配置模块602,设置为配置随机种子;
发送模块604,设置为发送随机种子;
其中,随机种子用于产生相应的伪随机序列,伪随机序列用于以下至少之一:数据传输资源分配、信道接入资源分配;
UE62包括:
接收模块622,设置为接收基站发送的随机种子;
计算模块624,设置为基于随机种子按照预设算法产生相应的伪随机序列;
处理模块626,设置为根据伪随机序列进行数据传输资源分配和/或信道接入资源分配。
需要说明的是,上述各个模块是可以通过软件或硬件来实现的,对于后者,可以通过以下方式实现,但不限于此:上述模块均位于同一处理器中;或者,上述各个模块以任意组合的形式分别位于不同的处理器中。
实施例3
本实施例是根据本发明的可选实施例,用于结合具体的场景和实例对本申请进行详细说明:
而本实施例提出了一种基于伪随机序列的半随机的伪随机序列的处理方法,可以降低随机退避带来的冲突概率,并且可以解决在不受基站控制的情况下收端和发端如何快速连接的问题。本发明以如何进行信道接入为例,以改进现有方案的不足,进一步降低数据传输的时延,提高资源利
用率,提升用户体验。因此,本发明通信在非授权频段的信道接入技术,考虑如何减少不同UE之间的碰撞问题:
本实施例包括两个并且的方案,对应于不同的实现方式。
其中,图7是根据本发明实施例的一种产生伪随机序列的流程图,如图7所示,方案一包括:
Step(步骤)1:确定初始随机种子的初始值X0。初始随机种子由基站产生和分配给某一UE,初始随机种子取值范围为(0,1)。然后,按照Kent映射产生长度为l的伪随机序列L1。其中,kent映射是一种具有逐段线性的混沌映射,其动力学方程为:
其中,a∈(0,1)。
序列L1的长度l与时域资源可分配的资源单位的数量相等(例如时域共有若干个子帧或时隙等)。例如,若时域资源单位的数量为时隙,且假定为4个时隙,则随机序列长度l为4。
选择Kent映射的原因是因为其分布函数比较均匀,可以比较好的映射到相应的资源块单位(Mini Resource Block,简称为MRB)(等效于物理资源块(Physical Resource Block,简称为PRB))上,并且还具有优秀的统计特性。通常采用的Kent映射取参数a=0.5,但是由于处理器精度的缺失,该序列会迅速归零,所以在本发明中产生混沌序列时取参数a=0.7。举例,假设基站分配的随机种子的值为0.5,可用共享时隙的个数为4,则可得产生的随机序列l的长度应为4,通过Kent映射产生的混沌序列L1为:0.7143、0.9524、0.1587、0.2268。该L1中每个序列分别为4个时
隙所对应。
Step 2:假设每个时隙中在频域都有50个MRB可以分配,并将上述L1序列赋予mi(这个过程仅仅是为了便于讲解方便而引入的)。然后进行下面的处理。
每个时隙对应的MRB的编号Ni,i与时隙索引:算法如下:
Ni=[mi*50]
Ni依次为35、47、7、11。即该UE在第一个时隙分配的MRB编号为35,UE在第一个时隙分配的MRB编号为47,UE在第一个时隙分配的MRB编号为7,UE在第一个时隙分配的MRB编号为11。
考虑到实际传输的过程中,UE需要传输的业务可能需要多个MRB才能够完成,提出了如下几种:UE对应一个时隙分配多个MRB的方法。假设共有4个时隙,每个时隙需要为一个D2DUE分配3个PRB。
1.基站直接下发3个随机种子,对应不同的随机种子可以产生3个随机序列。例如基站给UE1分配随机种子0.4、0.5和0.6。共享时隙可以为Q个,具体如4个,则随机种子产生的序列长度均为4。随机种子0.4通过Kent映射产生的序列为0.5714、0.8163、0.6122、0.8746,映射对应的MRB编号为28、40、30、43;随机种子0.5通过Kent映射产生的序列为0.7143、0.9524、0.1587、0.2268,映射对应的MRB编号为35、47、7、11;随机种子0.6通过Kent映射产生的序列为0.8571、0.4762、0.6803、0.9712,映射对应的MRB编号为42、23、34、48。所以对应在第一个共享时隙可以占用编号为28、35和42资源块,第二个共享时隙上可以占用编号为40、23和47的资源块,依次类推。若基站分配三个以上的随机种子,方法同上;
2.基站向UE分配一个随机种子、偏移量(可以约定,一旦约定后不
再通过信令发送)和数量值3。利用该偏移量可以计算出其他2个随机种子的值。比如说基站分配随机种子数为0.5,偏移量为0.02,若此时一个时隙上占用3个MRB,则实际上产生的随机种子为0.5、0.52和0.54,然后利用上述随机种子产生随机序列进行映射。
3.不管UE需要占用多少个MRB,基站都向UE分配一个随机种子。假设存在UE1,共享时隙为4个,若此时在每个时隙上占用3个MRB,则实际生成的序列长度为4×3=12,4表示时隙数量,3为每个时隙需要分配的MRB个数,12为该随机种子需要产生的总的序列长度。假设基站分配的随机种子为0.5,则通过Kent映射产生的序列为0.7143、0.9524、0.1587、0.2268、0.3239、0.4628、0.6611、0.9444、0.1852、0.2646、0.3780、0.5400,映射后对应的MRB编号为35、47、7、11、16、23、33、47、9、13、18、27。
在选取每个时隙所需的资源块时,可以按照一定的规则顺序选择,例如将MRB编号为35、47和7的资源块分配到第一个时隙,11、16和23资源块分配到第二个时隙,依次类推;
也可以任意选择3个MRB分配到第一个时隙,第二个时隙从剩余的9个MRB中再任选3个MRB分配到第二个时隙,依此类推。
同时,还存在每个时隙上需要的资源块不同情况,例如四个时隙上分别需要2、3、3、4个资源块,则对每个时隙上资源块的选择,既可以采用顺序选择的方式,即把编号35、47的资源块分配给第一个时隙,编号为7、11、16的资源块分配给第二个时隙,依此类推;也可以采取任意选择资源块的方式,对于第一个时隙任选2个资源块,第二个时隙从剩余10个资源块中选择3个MRB,依此类推。
由于基站给发送端和接收端分配相同的随机种子,故相应的发送端和
接收端产生混沌时间序列的状态是一致的,在同一时刻可以接入到相同的MRB资源块,进行数据传输。
这种随机化的资源分配,需要获知两个参数,初始随机种子和总的需要分配的资源(如果是多维需要换算为总共资源,例如时域、频域时,需要时域*频域获得总的)。
方案二,图8是根据本发明实施例的另一种产生伪随机序列的流程图,如图8所示,包括:
Step 1:同方案1的step1。只是利用的伪随机序列产生的等式不同。此方案中使用线性同余法。
确定初始随机种子的初始值X0。初始随机种子由基站产生和分配给某一UE,初始随机种子取值范围为1-频域资源数量。然后,按照线性同余法映射产生长度为l的伪随机序列L1。其中,利用线性同余法产生伪随机序列的方法如下:
xn+1=(axn+c)modm
上式中,a,c和m皆为整数,其序列的随机性来源于取模运算。对于模数m的选择,应该尽可能的大,因为序列的周期不可能大于m。在本发明中假设每个时隙上有50个MRB,所以m的数值至少应该大于50。M.Greenberger证明:用线性乘同余方法产生伪随机数序列具有周期m的条件如下:
c和m为互质数;
a-1是质数p的倍数,其中p是a-1和m的公约数;
如果m是4的倍数,a-1也是4的倍数。
具体a,c和m的取值可以根据实际应用情况确定。若每个时隙上有50个MRB,一种可能的情况为a=29,c=23,m=56。若每个时隙对应的频域
上有100个MRB,一种可能的取值情况为a=53,c=37,m=104。
假设基站分配的随机种子的值为1,共享时隙的数量4个,每个时隙MRB为50,则可得产生的随机序列的长度应为4,通过线性同余法产生的序列X内为52、19、14、37。该L1中每个序列分别为4个时隙所对应。
Step 2:将步骤1得到的随机序列L1转换为[0,1]范围内的随机序列,转换公式如下:yn=L1/m
Step 3:将步骤2中得到的随机数值yn映射至各个MRB对应的频段。若一个时隙内在对应频域上有50个MRB,则将分布在[0,1]范围内的yn乘以50之后再取整可得其对应的MRB编号,其计算方法如下:
N=[yn*50],[]表示向下取整,
即该UE在第一个时隙分配的MRB编号为47,UE在第一个时隙分配的MRB编号为16,UE在第一个时隙分配的MRB编号为12,UE在第一个时隙分配的MRB编号为33。
1.基站直接下发3个随机种子,对应不同的随机种子可以产生3个随机序列。例如基站给UE1分配随机种子1、2和3。共享时隙为4个,则随机种子产生的序列长度均为4。
利用随机种子1通过线性同余法产生的序列为52、19、14、37,映射对应的MRB编号为46、16、12、33;
随机种子2通过线性同余法产生的序列为25、20、43、38,映射对应的MRB编号为22、17、38、33;
随机种子3通过线性同余法产生的序列为54、21、16、39,映射对应的MRB编号为48、18、14、34。
所以对应在第一个共享时隙可以占用编号为46、22和48资源块,第二个共享时隙上可以占用编号为16、17和18的资源块,依次类推。若基
站分配三个以上的随机种子,方法同上;
2.基站向UE分配随机种子、偏移量(可以约定,一旦约定后不再通过信令发送)。利用该偏移量可以计算出其他2个随机种子的值。比如说基站分配随机种子数为1,偏移量为1,若此时一个时隙上占用3个MRB,则实际上产生的随机种子为1、2和3,然后利用上述随机种子产生随机序列进行映射。
3.不管UE需要占用多少个MRB,基站都向UE分配一个随机种子。假设存在UE1,其对应共享时隙为4个,若此时在一个时隙上占用3个MRB,则实际生成的序列长度为4×3=12。假设基站分配的随机种子为1,则通过线性同余法产生的序列为52、19、14、37、32、55、50、17、12、35、30、53,映射后对应的MRB编号为46、16、12、33、28、49、44、15、10、31、26、47。在选取每个时隙所需的资源块时,可以按照一定的规则顺序选择,例如将MRB编号为46、16和12的资源块分配到第一个时隙,33、28和49资源块分配到第二个时隙,依次类推;也可以任意选择3个MRB分配到第一个时隙,第二个时隙从剩余的9个MRB中再任选3个MRB分配到第二个时隙,依此类推。同时,还存在每个时隙上需要的资源块不同情况,例如四个时隙上分别需要2、3、3、4个资源块,则对每个时隙上资源块的选择,既可以采用顺序选择的方式,即把编号46、16的资源块分配给第一个时隙,编号为12、33、28的资源块分配给第二个时隙,依此类推;也可以采取任意选择资源块的方式,对于第一个时隙任选2个资源块,第二个时隙从剩余10个资源块中选择3个MRB,依此类推。
由于基站给发送端和接收端分配相同的随机种子,故相应的发送端和接收端产生线性同余序列的状态是一致的,在同一时刻可以接入到相同的MRB资源块,进行数据传输。
基于上述方案,本实施例包括如下具体实施方式
具体实施例1
基站为UE分配一个资源池,当UE有上行业务需要发送时,UE根据基站之前配置的随机种子,结合资源池中时域方向的编码计算资源池中具体使用的PRB。
例如,资源池为周期性出现的,每一个周期内资源池时域方向的调度单位(一个调度单位包括若干个符号)编号为0-9,假设资源池频域方向的可供分配的单位(例如为PRB)为50个,记为1-50。周期索引为0-99,循环出现。UE每次在每个调度单位传输时使用2个PRB进行传输。
基站在配置好资源池后,为UE分配随机种子X0。
UE(或基站)按照下面的方式确定每个调度单位内该UE使用的PRB索引。
假设UE在每个调度单位都有数据进行传输,并且使用2个PRB,那么UE在一次完整的(0-99)资源池周期内所需要的资源为10*2*100=2000,其中10表示每个资源池调度单位个数,2表示UE在每个调度单位需要的PRB数量,100表示一次完整的周期。
UE(或基站)使用X0,按照方法1或方法2中等于等式进行Xn序列的产生,序列长度n=2000,与计划分配的总的PRB数量相同;
Xn在进行下面计算换算到每个调度单位中频域的PRB编号。
Ni=Xn*50所得值向下取整后与PRB编号对应。其中,50表示每个调度单位中可供分配的PRB数量。Ni为PRB编号。
然后,Ni按照顺序依次20个取值形成一个新的序列,记为Pk,该编号与周期索引编号对应。其中k取值等于周期索引的取值。每一个Pk序列包含20个取值。
Pk中按照顺序依次2个为周期内每个调度单位中UE使用的PRB索引。
当UE有数据需要发送时,就按照基站分配的随机种子根据上述方式在对应的资源池内的调度单位对应的PRB中进行数据发送。
基站根据为UE配置随机种子,使用上述的方式,推算每个资源池中每个调度单位中UE发送数据的PRB索引,然后在该PRB中接收UE的数据。
技术效果在于:这种方式具有显著的信令开销小,一次分配,长期资源分配,且所有调度单位中的PRB分配具有随机化效果,大大降低了UE随机在资源池中抢占PRB时的PRB冲突问题。同时也解决了资源池中UE随机抢占PRB进行上行数据发送时,基站侧需要盲检所有可能PRB资源来发现UE发送数据的复杂度问题。
具体实施例2
对于具有低延时业务需求的UE,基站为其分配随机种子X0。当该UE有低时延业务需要发送时,该UE根据上述方法1或方法2中方式,计算发送该业务的频域资源。
此时,计算是时域方向可以该业务的调度单位在时域的编号进行,例如类似于低时延业务的帧号。总之,可以按照系统中的的帧号、子帧号或时隙号等获得一个时间方向的编号。然后计算该编号对应的每个调度单位中可以使用的PRB(如果有业务就发送,如果没有业务就不发送,基站可以调度发送其他非低时延业务)。
下面以LTE的时间方向编号机制举例。
LTE中帧号0-1023,循环编号。每个帧中有10个子帧,编号0-9,我们假设这种低时延业务就是一子帧为单位发送的(可以更小,例如时隙、OFDM符号等,只是计算复杂些),且每个子帧预留1个PRB为该也为传输(多个也可以的,但是最好的每个子帧固定数量的,复杂会由于计算复杂
度太大)。那么UE(或基站,基站接收时需要计算)根据初始随机种子X0,根据上述的实施例1中的例子,类似的可以计算出每一个子帧中预留给该业务的PRB。
基站侧也计算在每个子帧中UE发送低时延业务的资源,然后只需要检测该资源即可,不需要盲检其他资源。这样可以降低基站检测的复杂度。
相对于半静态调度,该方法具有随机化的效率,可以更大频域分集。
相对于半静态+跳频图样的方式,该方式相当于有“无限”数量的跳频图样,且在不同时间单位内具有优秀的随机性。常见的跳频的图样都是有限的,不能同事支持很多UE,且不同时间单位使用有限的图样轮询,随机化效果差。该方式不仅计算简单,且随机化效果优秀。
具体实施例3
基于具体实施例1、2,一种进一步减少资源池中资源浪费的问题。
方式1,资源池中发送上行数据的UE,只有在具有基站分配的随机种子时,才能进行上行数据发送。没有基站配置的随机种子的UE,不能自主抢占资源池中的资源进行上行数据发送。这样实际上资源池中的资源是否被使用,基站通过已经分配的随机种子计算后就可以得出,基站将计算后,不会使用的资源调度给其他类型的UE(即不通过资源池抢占方式的UE,或通过基站发送授权信息调度的UE)发送上行数据。
显然这种方式可以一定程度降低资源池中的资源浪费。
实施例4
本发明的实施例还提供了一种存储介质。可选地,在本实施例中,上述存储介质可以被设置为存储用于执行以下步骤的程序代码:
S1,发送端配置随机种子,并发送随机种子;
其中,随机种子用于产生相应的伪随机序列,伪随机序列用于以下至
少之一:数据传输资源分配、信道接入资源分配。
可选地,在本实施例中,上述存储介质可以包括但不限于:U盘、只读存储器(ROM,Read-Only Memory)、随机存取存储器(RAM,Random Access Memory)、移动硬盘、磁碟或者光盘等各种可以存储程序代码的介质。
可选地,在本实施例中,处理器根据存储介质中已存储的程序代码执行发送端配置随机种子,并发送随机种子;
其中,随机种子用于产生相应的伪随机序列,伪随机序列用于以下至少之一:数据传输资源分配、信道接入资源分配。
可选地,本实施例中的具体示例可以参考上述实施例及可选实施方式中所描述的示例,本实施例在此不再赘述。
显然,本领域的技术人员应该明白,上述的本发明的各模块或各步骤可以用通用的计算装置来实现,它们可以集中在单个的计算装置上,或者分布在多个计算装置所组成的网络上,可选地,它们可以用计算装置可执行的程序代码来实现,从而,可以将它们存储在存储装置中由计算装置来执行,并且在某些情况下,可以以不同于此处的顺序执行所示出或描述的步骤,或者将它们分别制作成各个集成电路模块,或者将它们中的多个模块或步骤制作成单个集成电路模块来实现。这样,本发明不限制于任何特定的硬件和软件结合。
以上所述仅为本发明的优选实施例而已,并不用于限制本发明,对于本领域的技术人员来说,本发明可以有各种更改和变化。凡在本发明的精神和原则之内,所作的任何修改、等同替换、改进等,均应包含在本发明的保护范围之内。
通过本发明实施例,发送端配置随机种子,并发送所述随机种子;其中,所述随机种子用于产生相应的伪随机序列,所述伪随机序列用于以下
至少之一:数据传输资源分配、信道接入资源分配,由于对通信UE端分配随机种子资源,因此UE可以产生伪随机序列,提高无线资源的利用率,由于伪随机序列的随机性比较好,所以在同一时隙接入相同资源的概率减少,可以减少在竞争接入时发生的资源碰撞,同时实现在不受基站控制的情况下快速实现UE的资源接入,可以解决相关技术中在信道接入时资源利用率低的问题。
Claims (27)
- 一种伪随机序列的处理方法,其中,包括:发送端配置随机种子,并发送所述随机种子;其中,所述随机种子用于产生相应的伪随机序列,所述伪随机序列用于以下至少之一:数据传输资源分配、信道接入资源分配。
- 根据权利要求1所述的方法,其中,当所述伪随机序列用于数据传输资源分配时,所述发送端还根据所述伪随机序列确定对应的分配资源,并从中接收数据;或,当所述伪随机序列用于信道接入资源分配时,所述发送端还根据所述伪随机序列确定对应的接入资源,并从中接收数据。
- 根据权利要求2所述的方法,其中,所述确定对应的分配资源或接入资源,还包括:发送端确定伪随机序列的总长度,对应计划分配的资源单位总数量。
- 根据权利要求3所述的方法,其中,在分配资源为多个维度时,所述对应计划分配的资源单位总数量为多个维度需要的资源单位总和,其中,所述维度包括以下至少之一:第一维度:时域维度,第二维度:频域维度,第三维度:空域维度,第四维度:码域维度。
- 根据权利要求4所述的方法,其中,所述发送端确定多个维度中的一个指定维度的每个单位中分配的资源单位总数包括:除所述指定维度和所述指定维度的维度序号之前维度外的其他维度需要分配资源单位总和。
- 根据权利要求3所述的方法,其中,所述发送端确定对应的分配资源或接入资源包括:所述发送端确定时域单位中需要的频域单位数量;从所述伪随机序列中选取对应数量的序列元素;从选取的序列元素推算对应的频域单位编号,作为该时域单位中分配的或可以使用的频域单位,其中,所述伪随机序列中每一个元素对应一个可分配资源单位。
- 根据权利要求6所述的方法,其中,从选取的序列元素推算对应的频域单位编号包括:将序列元素乘以该时域单位中可供分配的频域单位总数,并向下取整,得到频域单位编号,其中,所述频域单位编号为从1或0开始依次以1为单位增加的整数。
- 根据权利要求1所述的方法,其中,在发送端配置随机种子之后,所述方法还包括:所述发送端按照以下预设算法之一确定产生的伪随机序列:Kent映射、线性同余法。
- 根据权利要求9所述的方法,其中,所述a=0.7。
- 根据权利要求8所述的方法,其中,在所述预设算法为线性同余法时,基于所述随机种子按照预设算法产生相应的伪随机序列包 括:按照以下公式计算所述伪随机序列xn+1:xn+1=((axn+c)mod m)/m其中,a,c和m皆为整数,所述m为大于A的整数,A为待分配维度中总的资源单位数,a、c分别为与所述A相关的预设值,xn为长度为n的伪随机序列,n为可分配的总资源单位,c和m为互质数。
- [根据细则26改正22.09.2017]
根据权利要求11所述的方法,其中,若每个时域单位中有50个频域单位,则a=29,c=23,m=56;若每个时域单位中有100个频域单位,则a=53,c=37,m=104。 - [根据细则26改正22.09.2017]
一种伪随机序列的处理方法,其中,包括:接收端接收发送端发送的随机种子;所述接收端基于所述随机种子按照预设算法产生相应的伪随机序列;所述接收端根据所述伪随机序列进行数据传输资源分配和/或信道接入资源分配。 - [根据细则26改正22.09.2017]
根据权利要求14所述的方法,其中,所述预设算法包括以下之一:Kent映射、线性同余法。 - [根据细则26改正22.09.2017]
根据权利要求16所述的方法,其中,所述a=0.7。 - [根据细则26改正22.09.2017]
根据权利要求15所述的方法,其中,在所述预设算法为线性同余法时,基于所述随机种子按照预设算法产生相应的伪随机序列包括:xn+1=((axn+c)mod m)/m其中,a,c和m皆为整数。所述m为大于A的整数,A为待分配维度中总的资源单位数,a、c分别为与所述A相关的预设值,xn为长度为n的伪随机序列,n为可分配的总资源单位,c和m为互质数。 - [根据细则26改正22.09.2017]
根据权利要求14所述的方法,其中,在所述接收端根据所述伪随机序列进行数据传输资源分配和/或信道接入资源分配,所述方法还包括:接收端与发送端约定每个维度中需要分配资源单位数量;或者接收端接收发送端的信令获知每个维度中需要分配资源单位数量;接收端确定产生的伪随机序列的总长度,对应计划分配的资源单位总数量。 - [根据细则26改正22.09.2017]
根据权利要求14所述的方法,其中,在分配资源为多个维度时,所述对应计划分配的资源单位总数量为多个维度需要的资源单位总和,其中,所述维度包括以下至少之一:第一维度:时域维度,第二维度:频域维度,第三维度:空域维度,第四维度:码域维度。 - [根据细则26改正22.09.2017]
根据权利要求14所述的方法,其中,所述接收端确定多个维度中的一个指定维度的每个单位中分配的资源单位总数包括:除所述指定维度和所述指定维度的维度序号之前维度外的其他维度需要分配资源单位总和。 - [根据细则26改正22.09.2017]
根据权利要求14所述的方法,其中,所述接收端确定对应的分配资源或接入资源包括:所述接收端确定时域单位中需要的频域单位数量;从所述伪随机序列中选取对应数量的序列元素;从选取的序列元素推算对应的频域单位编号,作为该时域单位中分配的或可以使用的频域单位,其中,所述伪随机序列中每一个元素对应一个可分配资源单位。 - [根据细则26改正22.09.2017]
根据权利要求22所述的方法,其中,从选取的序列元素推算对应的频域单位编号包括:将序列元素乘以该时域单位中可供分配的频域单位总数,并向下取整,得到频域单位编号,其中,所述频域单位编号为从1或0开始依次以1为单位增加的整数。 - [根据细则26改正22.09.2017]
一种伪随机序列的处理装置,其中,包括:配置模块,设置为配置随机种子;发送模块,设置为发送所述随机种子;其中,所述随机种子用于产生相应的伪随机序列,所述伪随机序列用于以下至少之一:数据传输资源分配、信道接入资源分配。 - [根据细则26改正22.09.2017]
一种伪随机序列的处理装置,其中,包括:接收模块,设置为接收发送端发送的随机种子;计算模块,设置为基于所述随机种子按照预设算法产生相应的伪随机序列;处理模块,设置为根据所述伪随机序列进行数据传输资源分配和/或信道接入资源分配。 - [根据细则26改正22.09.2017]
一种伪随机序列的处理系统,包括基站、用户设备UE,其中,所述基站包括:配置模块,设置为配置随机种子;发送模块,设置为发送所述随机种子;其中,所述随机种子用于产生相应的伪随机序列,所述伪随机序列用于以下至少之一:数据传输资源分配、信道接入资源分配。所述UE包括:接收模块,设置为接收所述基站发送的随机种子;计算模块,设置为基于所述随机种子按照预设算法产生相应的伪随机序列;处理模块,设置为根据所述伪随机序列进行数据传输资源分配和/或信道接入资源分配。 - [根据细则26改正22.09.2017]
一种存储介质,其特征在于,所述存储介质包括存储的程序,其中,所述程序运行时执行权利要求1至13中任一项所述的方法。 - [根据细则26改正22.09.2017]
一种存储介质,其特征在于,所述存储介质包括存储的程序,其中,所述程序运行时执行权利要求14至23中任一项所述的方法。
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201610538404.5A CN107592673B (zh) | 2016-07-08 | 2016-07-08 | 伪随机序列的处理方法、装置及系统 |
CN201610538404.5 | 2016-07-08 |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2018006762A1 true WO2018006762A1 (zh) | 2018-01-11 |
Family
ID=60901289
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/CN2017/091285 WO2018006762A1 (zh) | 2016-07-08 | 2017-06-30 | 伪随机序列的处理方法、装置及系统、存储介质 |
Country Status (2)
Country | Link |
---|---|
CN (1) | CN107592673B (zh) |
WO (1) | WO2018006762A1 (zh) |
Families Citing this family (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN110611895B (zh) * | 2019-09-25 | 2020-10-09 | 西京学院 | 一种基于四维码映射的室内定位方法 |
WO2023240566A1 (zh) * | 2022-06-16 | 2023-12-21 | Oppo广东移动通信有限公司 | 生成序列的方法和设备 |
CN114978461B (zh) * | 2022-07-27 | 2022-11-01 | 天地信息网络研究院(安徽)有限公司 | 一种面向最大化分离的用户参数调度方法 |
Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN104159307A (zh) * | 2014-07-25 | 2014-11-19 | 京信通信系统(中国)有限公司 | 下行资源分配方法与装置 |
CN104754744A (zh) * | 2013-12-30 | 2015-07-01 | 中兴通讯股份有限公司 | Lte小区的资源分配方法、装置及基站 |
WO2015140501A1 (en) * | 2014-03-18 | 2015-09-24 | British Telecommunications Public Limited Company | Small cell resource allocation |
WO2016023517A1 (en) * | 2014-08-15 | 2016-02-18 | Huawei Technologies Co., Ltd. | System and method for generating codebooks with small projections per complex dimension and utilization thereof |
Family Cites Families (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN103716895B (zh) * | 2012-09-29 | 2020-11-17 | 中兴通讯股份有限公司 | 物理随机接入信道的资源确定方法及装置 |
-
2016
- 2016-07-08 CN CN201610538404.5A patent/CN107592673B/zh active Active
-
2017
- 2017-06-30 WO PCT/CN2017/091285 patent/WO2018006762A1/zh active Application Filing
Patent Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN104754744A (zh) * | 2013-12-30 | 2015-07-01 | 中兴通讯股份有限公司 | Lte小区的资源分配方法、装置及基站 |
WO2015140501A1 (en) * | 2014-03-18 | 2015-09-24 | British Telecommunications Public Limited Company | Small cell resource allocation |
CN104159307A (zh) * | 2014-07-25 | 2014-11-19 | 京信通信系统(中国)有限公司 | 下行资源分配方法与装置 |
WO2016023517A1 (en) * | 2014-08-15 | 2016-02-18 | Huawei Technologies Co., Ltd. | System and method for generating codebooks with small projections per complex dimension and utilization thereof |
Also Published As
Publication number | Publication date |
---|---|
CN107592673B (zh) | 2020-09-08 |
CN107592673A (zh) | 2018-01-16 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN106535351B (zh) | 传输数据的方法和装置 | |
JP7209667B2 (ja) | リソース設定のための方法及び装置、並びに基地局 | |
CN110214464B (zh) | 资源调度方法、终端设备及网络设备 | |
WO2019062399A1 (zh) | 一种信息传输方法及装置 | |
US20160366717A1 (en) | Signal Processing Method and Device | |
US20230239193A1 (en) | Signaling of demodulation reference signal configuration for uplink short tti transmissions | |
JP7084993B2 (ja) | 短シーケンス信号のグループ化および使用 | |
KR20160038017A (ko) | 디바이스 투 디바이스 데이터 채널 시그널링 | |
WO2017092535A1 (zh) | 参考信号序列的传输方法和设备 | |
KR20190125355A (ko) | Nb iot 시스템들에서의 스케줄링 요청을 위한 방법 및 장치 | |
CN109618309B (zh) | 一种基于时隙复用的机器通信随机接入方法 | |
WO2015016970A1 (en) | Coverage-deficient terminal connection procedures | |
JP2017533658A (ja) | 情報処理方法、基地局および端末 | |
WO2014187413A1 (zh) | Lte小区的资源分配方法、装置及基站、存储介质 | |
WO2018006762A1 (zh) | 伪随机序列的处理方法、装置及系统、存储介质 | |
CN110912660B (zh) | 生成参考信号的方法和装置 | |
US10581574B2 (en) | Data transmission method, and apparatus | |
KR20100126547A (ko) | 모바일 시스템에서의 통신을 위한 방법 | |
CN111567074B (zh) | 一种信道传输方法及装置 | |
CN110603872B (zh) | 用于配置调度请求的方法和装置 | |
WO2018006759A1 (zh) | 信道接入方法、装置及系统、存储介质 | |
CN110971362B (zh) | 一种发现参考信号发送方法及装置 | |
US11245564B2 (en) | Method and device for determining sequence group and cyclic shift | |
WO2017031643A1 (zh) | 资源分配、指示及识别资源类型、接收数据的方法及装置 | |
WO2018141214A1 (zh) | 数据发送方法、终端设备及存储介质 |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
121 | Ep: the epo has been informed by wipo that ep was designated in this application |
Ref document number: 17823574 Country of ref document: EP Kind code of ref document: A1 |
|
NENP | Non-entry into the national phase |
Ref country code: DE |
|
122 | Ep: pct application non-entry in european phase |
Ref document number: 17823574 Country of ref document: EP Kind code of ref document: A1 |