WO2018028515A1 - 一种资源分配方法和装置 - Google Patents
一种资源分配方法和装置 Download PDFInfo
- Publication number
- WO2018028515A1 WO2018028515A1 PCT/CN2017/095955 CN2017095955W WO2018028515A1 WO 2018028515 A1 WO2018028515 A1 WO 2018028515A1 CN 2017095955 W CN2017095955 W CN 2017095955W WO 2018028515 A1 WO2018028515 A1 WO 2018028515A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- resource
- indication value
- resource allocation
- elements
- satisfies
- Prior art date
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/20—Control channels or signalling for resource management
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/04—Wireless resource allocation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L5/00—Arrangements affording multiple use of the transmission path
- H04L5/003—Arrangements for allocating sub-channels of the transmission path
- H04L5/0037—Inter-user or inter-terminal allocation
- H04L5/0039—Frequency-contiguous, i.e. with no allocation of frequencies for one user or terminal between the frequencies allocated to another
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L5/00—Arrangements affording multiple use of the transmission path
- H04L5/003—Arrangements for allocating sub-channels of the transmission path
- H04L5/0037—Inter-user or inter-terminal allocation
- H04L5/0041—Frequency-non-contiguous
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L5/00—Arrangements affording multiple use of the transmission path
- H04L5/0091—Signaling for the administration of the divided path
Definitions
- Embodiments of the present invention relate to, but are not limited to, a wireless communication network, and more particularly to a method and apparatus for resource allocation.
- the base station In the LTE (Long Term Evolution) and the LTE-Advanced (LTE-Advanced) system, the base station carries the Physical Downlink Shared Channel (PDSCH) through the downlink scheduling assignment and the uplink scheduling request information, respectively. And the resource allocation information of the physical uplink shared channel (PUSCH), the user equipment (UE, User Equipment) receives the downlink information or sends the uplink on the corresponding resource block (RB, Resource Block) according to the received resource allocation information. information.
- PUSCH Physical Uplink shared channel
- UE User Equipment
- the downlink resource allocation type 0 is a bitmap mapping allocation. That is, each scheduling resource unit indicates whether to schedule by 1 bit, and the scheduling resource unit is a resource block group (RBG, Resource). Block Group), supports non-contiguous RB scheduling.
- the downlink resource allocation type 1 first uses one or more bits to indicate the RBG subset used by the UE, and uses the bitmap mapping method in the subset, and also supports the non-contiguous RB scheduling.
- the downlink resource allocation type 2 is a continuous RB resource allocated to the UE by using a Resource Indication Value (RIV), where the RIV is a joint coding of the starting position and length of the allocated resource.
- RIV Resource Indication Value
- the resource allocation for the uplink PUSCH includes two allocation modes, and the uplink resource allocation type 0 is a continuous resource allocation mode, which is the same as the downlink resource allocation type 2.
- Uplink resource allocation type 1 supports non-contiguous RB allocation of up to two clusters, each cluster contains one or more consecutive RBGs, and jointly encodes the start resource index and the end resource index of the two clusters.
- short TTI Transmission Time Interval
- reduced processing delay are important technical means to reduce the delay of existing LTE/LTE-A air interface.
- the available resource elements RE, Resource Element
- the transport block size is 16 bits
- the cyclic redundancy check bit is 24. If the resource block allocated with a 2-symbol TTI contains 18 available RE numbers, Quadrature Phase Shift keyin (QPSK) modulation is used.
- QPSK Quadrature Phase Shift keyin
- the lowest bit rate that can be achieved is 1.11. Therefore, it is necessary to limit the minimum number of resources allocated to the UE in the short TTI scenario.
- One of the most effective methods for reducing the processing delay is to reduce the size of the transport block. In this case, it is not necessary to allocate too many resource blocks to the UE. Therefore, it is necessary to limit the maximum number of resources allocated to the UE in the scenario of delay reduction. value.
- the MTC user equipment requires low cost, and reducing the uplink and/or downlink transmission bandwidth of the UE (including baseband and radio frequency bandwidth) is a very low cost of the user equipment.
- An effective way for example, to set the uplink and/or downlink transmission bandwidth of all MTC user equipments to not exceed 1.4 MHz, meaning that no matter how large the system bandwidth is, for example, when the system bandwidth is 20 MHz, the base station has 100 resource blocks that can be used for allocation. The base station can also allocate up to 6 resource blocks to the MTC user equipment.
- the inventors of the present invention found in the design process that when the number of resource blocks allocated to the UE is limited, resource waste will occur if the existing resource allocation method is continued.
- the embodiments of the present invention provide a resource allocation method and apparatus, which can reduce resource allocation overhead under specific resource allocation constraints.
- a resource allocation method including:
- the resource allocation sender allocates a resource of length L in the total resource of the system to the resource allocation receiving end;
- resource allocation information that satisfies a predefined rule is sent to the resource allocation receiving end: L ⁇ X, or L ⁇ Y, or X ⁇ L ⁇ Y; wherein X satisfies 2 ⁇ X ⁇ N-1 integer, Y is a positive integer less than N, and N is the total amount of resources of the system.
- the resource allocation information is Q bits; wherein, where L ⁇ X, or L ⁇ Y, or X ⁇ L ⁇ Y, the number of all possible allocation types is 0, then Indicates rounding up.
- the resource allocation information that satisfies the predefined rule is: the resource allocation information corresponds to at least one resource indication value RIV that satisfies a predetermined condition, and one of the RIVs corresponds to a starting resource index s and an allocated resource. Length L.
- the allocated resource of length L is a continuous resource
- the continuous resource is a virtual continuous resource, or a physical continuous resource.
- the resource indication value RIV corresponds to a decimal number within the range [0, 1, 2, . . . , O-1].
- the RIV uniquely corresponds to a decimal number within the range [0, 1, 2, ..., O-1], where L satisfies the condition L
- L satisfies the condition L
- the number of all possible allocation types ⁇ X satisfies the condition: It is the number of combinations of two elements taken from N-X+2 different elements.
- L is an integer greater than or equal to 1 and not exceeding Y.
- the RIV uniquely corresponds to a decimal number within the range [0, 1, 2, ..., O-1], where L satisfies the condition L ⁇
- L satisfies the condition L ⁇
- the number of all possible allocation types in Y meets the condition: It is the number of combinations of two elements taken from Y different elements.
- L is an integer greater than or equal to X and not exceeding Y.
- the RIV uniquely corresponds to a decimal number within the range [0, 1, 2, ..., O-1], where L satisfies the condition X ⁇
- K is an arbitrary constant; Is the number of combinations of 2 elements taken from N'-s+1 different elements. The number of combinations of two elements is taken from N'+1 different elements, and mod represents the remainder.
- K 0, the RIV satisfies the following predetermined conditions,
- K is an arbitrary constant; Is the number of combinations of 2 elements taken from N-L+2 different elements. The number of combinations of two elements is taken from N'+1 different elements, and mod represents the remainder.
- K 0, the RIV satisfies the following predetermined conditions,
- K is an arbitrary constant; Is the number of combinations of 2 elements taken from N-X+2 different elements. Is the number of combinations of 2 elements taken from N-L+2 different elements. The number of combinations of two elements is taken from N'+1 different elements, and mod represents the remainder.
- K 0, the RIV satisfies the following predetermined conditions,
- K is an arbitrary constant; Rounding down, The number of combinations of two elements is taken from N'+1 different elements, and mod represents the remainder.
- K is an arbitrary constant, Rounding down, The number of combinations of two elements is taken from N'+1 different elements, and mod represents the remainder.
- K is an arbitrary constant, Rounding down, The number of combinations of two elements is taken from N'+1 different elements, and mod represents the remainder.
- K is an arbitrary constant, Rounding down, The number of combinations of two elements is taken from N'+1 different elements, and mod represents the remainder.
- the RIV is encoded by the starting resource index s and the length L of the allocated resource, when s ⁇ NY, Where s ⁇ [0,1,2,...,N-Y], L ⁇ [1,2,3,...,Y], mod represents the remainder, It is the number of combinations of two elements taken from Y different elements.
- the RIV is encoded by the starting resource index s and the length L of the allocated resource, when s>NY, Where s ⁇ [N-Y+1,N-Y+2,...,N-1], L ⁇ [1,2,3,...,N-s], u is an integer equal to or greater than 0, K is Any constant, mod means surplus, It is the number of combinations of two elements taken from Y different elements.
- J is an arbitrary constant, Is the number of combinations of 2 elements taken from N-s+1 different elements. It is the number of combinations of 2 elements taken from different NY elements.
- J 0, or
- the RIV is encoded by the starting resource index s and the length L of the allocated resource, and the RIV satisfies the following predetermined condition, K is an arbitrary constant; Is the number of combinations of 2 elements taken from N-L+2 different elements. It is the combination number of two elements extracted from Y different elements, and mod represents the remainder.
- K 0, the RIV satisfies the following predetermined conditions,
- RIV satisfies the following predetermined conditions, It is the number of combinations of two elements taken from N-Y+1 different elements.
- the RIV is encoded by the starting resource index s and the length L of the allocated resource, and the RIV satisfies the following predetermined condition, Where L ⁇ [X+1,X+2,...,Y],s ⁇ [0,1,2,...,N-L], K is an arbitrary constant; Is the number of combinations of 2 elements taken from N-X+2 different elements. Is the number of combinations of 2 elements taken from N-L+2 different elements. Is the number of combinations of 2 elements taken from Y different elements. The number of combinations of two elements is taken from N+1 different elements, and mod represents the remainder.
- K 0, the RIV satisfies the following predetermined conditions,
- the RIV is encoded by the starting resource index s and the length L of the allocated resource.
- s ⁇ NY
- the RIV satisfies the following predetermined condition.
- L' L-X+1
- Y' Y-X+1
- the RIV is encoded by the starting resource index s and the length L of the allocated resource.
- the RIV satisfies the following predetermined condition.
- s ⁇ [N-Y+1,N-Y+2,...,N-X], L ⁇ [X,X+1,X+2,...,N-s],Y' Y-X+ 1
- u is an integer equal to or greater than
- K is an arbitrary constant. It is the combination number of two elements extracted from Y different elements, and mod represents the remainder.
- J 0, u satisfies the condition or u meet the conditions It is the number of combinations of two elements taken from N-X+2-s different elements.
- the resource indication value RIV corresponds to an allocation situation indicated by resource allocation information of Q bits.
- a resource allocation device is disposed on the resource allocation sending end, and includes:
- An allocation module configured to allocate a resource of length L in the total resource of the system to the resource allocation receiving end;
- a sending module configured to send resource allocation information that satisfies a predefined rule to the resource allocation receiving end when L satisfies one of the following conditions: L ⁇ X, or L ⁇ Y, or X ⁇ L ⁇ Y; wherein, X To satisfy the integer 2 ⁇ X ⁇ N-1, Y is a positive integer less than N, and N is the total amount of resources of the system.
- the resource allocation information is Q bits; wherein, when L ⁇ X, or L ⁇ Y, or X ⁇ L ⁇ Y, the number of all possible allocation types is 0, then Indicates rounding up.
- the resource allocation information that satisfies the predefined rule is: the resource allocation information corresponds to at least one resource indication value RIV that satisfies a predetermined condition, and one of the RIVs corresponds to a starting resource index s and an allocated resource. Length L.
- the resource indication value RIV corresponds to a decimal number within the range [0, 1, 2, . . . , O-1].
- the allocated resource of length L is a continuous resource
- the continuous resource is a virtual continuous resource, or a physical continuous resource.
- a computer readable storage medium storing computer executable instructions for performing the resource allocation method described above.
- the solution of the embodiment of the present invention provides a resource allocation scheme that is effective when the number of resource allocations is limited, and can save resource allocation overhead.
- FIG. 1 is a schematic flowchart of a resource allocation method according to Embodiment 1 of the present application.
- FIG. 6 is a segment mapping relationship between a RIV and a starting resource index s and a length L of a resource when the length of the allocated resource must not be greater than Y in Embodiment 5 of the present application.
- FIG. 9 is a schematic diagram of a resource allocation apparatus according to Embodiment 2 of the present application.
- Embodiment 1 A resource allocation method, as shown in FIG. 1 , includes steps S110 to S120:
- Step S110 The sender allocates a resource of length L in the total resource of the system to the receiving end.
- Step S120 When L satisfies one of the following conditions, the resource allocation information that satisfies the predefined rule is sent to the resource allocation receiving end: L ⁇ X, or L ⁇ Y, or X ⁇ L ⁇ Y; wherein X is satisfied 2 ⁇ X ⁇ N-1 integer, Y is a positive integer less than N, and N is the total amount of resources of the system.
- the resource allocation and sending end may be, but not limited to, a base station; and the resource allocation receiving end may be, but not limited to, a terminal.
- the resource allocation information is Q bits; wherein, when L ⁇ X, or L ⁇ Y, or X ⁇ L ⁇ Y, the number of all possible allocation types is 0, then Indicates rounding up.
- the number of all possible allocation types may refer to a situation in which a total of allocations may occur when a resource of length L is allocated in the total resources of the system; a case of allocation is an allocation type.
- the resource allocation information that satisfies the predefined rule is: the resource allocation information corresponds to at least one resource indication value RIV that satisfies a predetermined condition, and one of the resource indication values corresponds to a starting resource index s and an allocated The length of the resource L.
- the resource indication value RIV corresponds to a decimal number in the range [0, 1, 2, ..., O-1].
- the allocated resource of length L is a continuous resource; the continuous resource may be a virtual continuous resource, or may be a physical continuous resource.
- a resource is a physical contiguous resource, which means that the resource directly corresponds to a physical resource, such as a physical resource block (PRB) or a transmission time unit on a time domain (referred to as a subframe in an LTE system).
- a resource is a virtual contiguous resource, which refers to a corresponding physical resource indirectly through a specific mapping transformation, that is, when the virtual resource is continuous, the corresponding physical resource is not necessarily continuous.
- the RIV may uniquely correspond to a decimal number within the range [0, 1, 2, ..., O-1], where L satisfies the condition L ⁇ X
- L satisfies the condition L ⁇ X
- L is an integer greater than or equal to 1 and not exceeding Y.
- the RIV may correspond to a decimal number within the range [0, 1, 2, ..., O-1], where L satisfies the condition L ⁇
- L satisfies the condition L ⁇
- the number of all possible allocation types in Y meets the condition:
- L is an integer in which L is greater than or equal to X and does not exceed Y.
- the RIV may correspond to a decimal number within the range [0, 1, 2, ..., O-1], where L satisfies the condition X ⁇ The number of all possible allocation types when L ⁇ Y satisfies the condition:
- the RIV can be obtained by using any of the following four alternative methods:
- K is an arbitrary constant; Is the number of combinations of 2 elements taken from N'-s+1 different elements. The number of combinations of two elements is taken from N'+1 different elements, and mod represents the remainder.
- K 0, the RIV satisfies the following predetermined conditions,
- K is an arbitrary constant; Is the number of combinations of 2 elements taken from N-L+2 different elements. The number of combinations of two elements is taken from N'+1 different elements, and mod represents the remainder.
- K 0, the RIV satisfies the following predetermined conditions,
- K is an arbitrary constant; Is the number of combinations of 2 elements taken from N-X+2 different elements. Is the number of combinations of 2 elements taken from N-L+2 different elements. The number of combinations of two elements is taken from N'+1 different elements, and mod represents the remainder.
- K 0, the RIV satisfies the following predetermined conditions,
- K is an arbitrary constant; Rounding down, The number of combinations of 2 elements is taken from N'+1 different elements, and mod represents the remainder;
- K is an arbitrary constant, Rounding down, The number of combinations of two elements is taken from N'+1 different elements, and mod represents the remainder.
- K is an arbitrary constant, Rounding down, The number of combinations of 2 elements is taken from N'+1 different elements, and mod represents the remainder;
- K is an arbitrary constant, Rounding down, The number of combinations of two elements is taken from N'+1 different elements, and mod represents the remainder.
- the RIV can be obtained using any of the following two alternative embodiments.
- the RIV is obtained by encoding the starting resource index s and the length L of the allocated resource
- the RIV When s ⁇ NY, the RIV satisfies the following predetermined conditions, Where s ⁇ [0,1,2,...,N-Y], L ⁇ [1,2,3,...,Y];
- the RIV can be obtained by any one of the following two methods.
- J 0, or
- J is an arbitrary constant
- s' s-(N-Y+1)
- N' Y-1
- L is a positive integer not exceeding N'-s'. Rounding down, It is the number of combinations of two elements taken from N'+1 different elements.
- J is an arbitrary constant
- s' s-(N-Y+1)
- N' Y-1
- L is a positive integer not exceeding N'-s'. Rounding down, It is the number of combinations of two elements taken from N'+1 different elements.
- the resource indication value RIV is encoded by the starting resource index s and the length L of the allocated resource, and the RIV satisfies the following predetermined condition.
- K is an arbitrary constant; Is the number of combinations of 2 elements taken from N-L+2 different elements. It is the combination number of two elements extracted from Y different elements, and mod represents the remainder.
- K 0, the RIV satisfies the following predetermined conditions,
- RIV satisfies the following predetermined conditions, It is the number of combinations of two elements taken from N-Y+1 different elements.
- the RIV can be obtained by any one of the following two methods.
- the RIV is obtained by encoding the starting resource index s and the length L of the allocated resource, and the RIV satisfies the following predetermined conditions.
- K is an arbitrary constant
- the number of combinations of two elements is taken from N+1 different elements, and mod represents the remainder.
- K 0, the RIV satisfies the following predetermined conditions,
- the RIV is obtained by encoding the starting resource index s and the length L of the allocated resource
- the RIV When s>NY, the RIV satisfies the following predetermined conditions.
- s ⁇ [N-Y+1,N-Y+2,...,N-X], L ⁇ [X,X+1,X+2,...,N-s], u is equal to or greater than 0 Integer, Y' Y-X+1, K is an arbitrary constant, The number of combinations of two elements is taken from Y different elements, mod represents the remainder, and u is an integer equal to or greater than zero.
- J 0, u satisfies the condition or u meet the conditions It is the number of combinations of two elements taken from N-X+2-s different elements.
- the resource indication value RIV may correspond to an allocation situation indicated by resource allocation information of Q bits.
- the resource allocation receiving end may convert the Q-bit resource allocation information into a decimal number corresponding to one of the resource indication values RIV.
- the resource allocation receiving end may decode the unique corresponding initial resource index s and the specific length L according to the obtained resource indication value RIV.
- the allocated resources are exemplified as virtual continuous resources.
- the allocated resources are not limited to the virtual continuous resources mentioned in the following examples.
- FIG. 2 shows the mapping relationship between the RIV and the starting resource index s and the length L of the allocated resource when the length of the allocated resource is not limited.
- the base station ie, the resource allocation sender
- the resource indication value for defining the uplink resource allocation is RIV, which can be defined according to this embodiment.
- the mapping relationship between the RIV and the starting resource index s and the length L of the allocated resources is as shown in FIG. 2.
- the resource allocation receiving end obtains the resource indication value RIV according to the received binary resource allocation information, and then obtains the starting resource index s and the length L of the allocated resource by using the correspondence relationship in FIG. 2 .
- the resource allocation receiving end can firstly take the RIV value according to the different s Values are compared to get s and then To get the value of L, an optional implementation can refer to the following code:
- Figure 3 shows the continuous mapping relationship between the RIV and the starting resource index s and the length L of the resource when the length of the allocated resource must not be less than X.
- the base station ie, the resource allocation sender
- the number of available uplink resource RBGs ie, the total amount of resources of the system
- the virtual resource unit index is 0, 1, 2, . . . , N-1
- the allocated resources are consecutive L virtual resource units ( That is, the length of the virtual continuous resource is L).
- the resource indication value for defining the uplink resource allocation is RIV, which can be defined according to this embodiment.
- the mapping relationship between the RIV and the starting resource index s and the length L of the resource is as shown in FIG. 3.
- the resource allocation receiving end obtains the resource indication value RIV according to the received binary resource allocation information, and then obtains the starting resource index s and the length L of the resource by using the correspondence relationship in FIG. 3 .
- An optional implementation can refer to the following code:
- FIG. 4 shows a segmentation mapping relationship between the RIV and the starting resource index s and the length L of the virtual continuous resource when the length of the allocated virtual continuous resource must be not less than X.
- the base station ie, the resource allocation sender
- the number of available downlink virtual resources RBG ie, the total amount of resources of the system
- the virtual resource unit index is 0, 1, 2, . . . , N-1
- the allocated resources are consecutive L virtual resource units (ie, The length of the virtual continuous resource is L).
- RIV Resource indication value for defining the downlink resource allocation
- the mapping relationship between the RIV and the starting resource index s and the length L of the resource is as shown in FIG.
- the resource allocation receiving end obtains the resource indication value RIV according to the received binary resource allocation information, and then acquires the starting resource index s and the length L of the resource by using the correspondence relationship in FIG. 4 .
- An optional implementation can refer to the following code:
- Figure 5 shows the continuous mapping relationship between the RIV and the starting resource index s and the length L of the virtual continuous resource when the length of the allocated resource must not be greater than Y.
- the base station ie, the resource allocation sender
- the number of available virtual resource RBGs ie, total system resources
- the virtual resource unit indexes are 0, 1, 2, . . . , N-1
- the allocated resources are consecutive L virtual resource units (ie, The length of the virtual continuous resource is L).
- the resource indication value for defining the downlink resource allocation is RIV, which can be defined according to this embodiment.
- the RIV can be considered as a decimal number or always calculated as a binary number in the formula calculation.
- the mapping relationship between the RIV and the starting resource index s and the length L of the resource is as shown in FIG. 5.
- the resource allocation receiving end obtains the resource indication value RIV according to the received binary resource allocation information, and then obtains the starting resource index s and the length L of the resource by using the correspondence relationship in FIG. 5.
- An optional implementation can refer to the following code:
- Figure 6 shows the segmentation mapping relationship between the RIV and the starting resource index s and the length L of the virtual continuous resource when the length of the allocated resource must not be greater than Y.
- the base station ie, the resource allocation sender
- the number of available uplink resource RBGs that is, the total system resources
- the virtual resource unit indexes are 0, 1, 2, . . . , N-1
- the allocated resources are consecutive L virtual resource units (ie, The length of the virtual continuous resource is L).
- the mapping relationship between the RIV and the starting resource index s and the length L of the resource is as shown in FIG. 6.
- the resource allocation receiving end obtains the resource indication value RIV according to the received binary resource allocation information, and then obtains the starting resource index s and the length L of the resource by using the correspondence in FIG. 6 .
- Figure 7 shows the continuous mapping relationship between the RIV and the starting resource index s and the length L of the virtual continuous resource when the allocated resource length belongs to the interval [X, Y].
- the base station ie, the resource allocation sender
- the number of available uplink resource RBGs that is, the total system resources
- the virtual resource unit indexes are 0, 1, 2, . . . , N-1
- the allocated resources are consecutive L virtual resource units (ie, The length of the virtual continuous resource is L).
- the resource indication value for defining the uplink resource allocation is RIV, which can be defined according to this embodiment.
- the mapping relationship between the RIV and the starting resource index s and the length L of the resource is as shown in FIG.
- Resource allocation receiver receives The binary resource allocation information obtains the resource indication value RIV, and then uses the correspondence relationship in FIG. 7 to obtain the starting resource index s and the length L of the resource.
- Figure 8 shows the segmentation mapping relationship between the RIV and the starting resource index s and the length L of the virtual continuous resource when the length of the allocated resource belongs to the interval [X, Y]. It is assumed that the base station (ie, the resource allocation sender) transmits the resource allocation information used by the uplink data transmission to the UE (ie, the resource allocation receiving end) through the uplink grant.
- the number of available uplink virtual resources RBG that is, the total amount of resources of the system
- the virtual resource unit index is 0, 1, 2, . . . , N-1
- the allocated resources are consecutive L virtual resource units (ie, The length of the virtual continuous resource is L).
- S ⁇ [0,1,2,...,N-X] L is an integer greater than or equal to 2 and not more than 4.
- the resource allocation receiving end obtains the resource indication value RIV according to the received binary resource allocation information, and then acquires the starting index s and the length L by using the correspondence relationship in FIG. 8.
- Embodiment 2 A resource allocation device, as shown in FIG. 9, is disposed on a resource allocation sending end, and includes:
- the allocating module 91 is configured to allocate a resource of length L in the total resource of the system to the resource allocation receiving end;
- the sending module 92 is configured to: when L meets one of the following conditions, send resource allocation information that meets a predefined rule to the resource allocation receiving end: L ⁇ X, or L ⁇ Y, or X ⁇ L ⁇ Y; X is an integer that satisfies 2 ⁇ X ⁇ N-1, Y is a positive integer less than N, and N is the total amount of the system. Source quantity.
- the resource allocation information is Q bits; wherein, when L ⁇ X, or L ⁇ Y, or X ⁇ L ⁇ Y, the number of all possible allocation types is 0, then Indicates rounding up.
- the resource allocation information that satisfies the predefined rule is: the resource allocation information corresponds to at least one resource indication value RIV that satisfies a predetermined condition, and one of the RIVs corresponds to a starting resource index s and an allocated resource. Length L.
- the resource indication value RIV may correspond to a decimal number in the range [0, 1, 2, ..., O-1] one by one.
- the resource indication value RIV corresponds to an allocation situation indicated by resource allocation information of Q bits.
- the RIV may uniquely correspond to a decimal number within the range [0, 1, 2, ..., O-1], wherein L satisfies the condition L ⁇
- L satisfies the condition L ⁇
- the number of all possible allocation types of X is satisfied by the condition:
- L is an integer greater than or equal to 1 and not exceeding Y.
- the RIV may uniquely correspond to a decimal number within the range [0, 1, 2, ..., O-1], where L satisfies the condition L ⁇ Y
- L satisfies the condition L ⁇ Y
- L is greater than or equal to X and does not exceed Y number.
- the RIV may uniquely correspond to a decimal number within the range [0, 1, 2, ..., O-1], where L satisfies the condition X ⁇ L
- the number of all possible allocation types ⁇ Y satisfies the condition:
- the RIV can be obtained by using any of the following four alternative methods:
- K is an arbitrary constant; Is the number of combinations of 2 elements taken from N'-s+1 different elements. The number of combinations of two elements is taken from N'+1 different elements, and mod represents the remainder.
- K 0, the RIV satisfies the following predetermined conditions,
- K is an arbitrary constant; Is the number of combinations of 2 elements taken from N-L+2 different elements. The number of combinations of two elements is taken from N'+1 different elements, and mod represents the remainder.
- K 0, the RIV satisfies the following predetermined conditions,
- K is an arbitrary constant; Is the number of combinations of 2 elements taken from N-X+2 different elements. Is the number of combinations of 2 elements taken from N-L+2 different elements. The number of combinations of two elements is taken from N'+1 different elements, and mod represents the remainder.
- K 0, the RIV satisfies the following predetermined conditions,
- K is an arbitrary constant; Rounding down, The number of combinations of 2 elements is taken from N'+1 different elements, and mod represents the remainder;
- K is an arbitrary constant, Rounding down, The number of combinations of two elements is taken from N'+1 different elements, and mod represents the remainder.
- K is an arbitrary constant, Rounding down, The number of combinations of 2 elements is taken from N'+1 different elements, and mod represents the remainder;
- K is an arbitrary constant, Rounding down, The number of combinations of two elements is taken from N'+1 different elements, and mod represents the remainder.
- the RIV can be obtained by using any of the following two embodiments:
- the RIV is obtained by encoding the starting resource index s and the length L of the allocated resource
- the RIV can be obtained by any one of the following two methods.
- J 0, or
- J is an arbitrary constant
- s' s-(N-Y+1)
- N' Y-1
- L is a positive integer not exceeding N'-s'. Rounding down, It is the number of combinations of two elements taken from N'+1 different elements.
- J is an arbitrary constant
- s' s-(N-Y+1)
- N' Y-1
- L is a positive integer not exceeding N'-s'. Rounding down, It is the number of combinations of two elements taken from N'+1 different elements.
- the RIV is obtained by encoding the starting resource index s and the length L of the allocated resource, and the RIV satisfies the following predetermined conditions.
- K is an arbitrary constant; Is the number of combinations of 2 elements taken from N-L+2 different elements. It is the combination number of two elements extracted from Y different elements, and mod represents the remainder.
- K 0, the RIV satisfies the following predetermined conditions,
- RIV satisfies the following predetermined conditions, It is the number of combinations of two elements taken from N-Y+1 different elements.
- the RIV can be obtained by using any of the following two methods:
- the RIV is obtained by encoding the starting resource index s and the length L of the allocated resource, and the RIV satisfies the following predetermined conditions.
- K is an arbitrary constant
- the number of combinations of two elements is taken from N+1 different elements, and mod represents the remainder.
- K 0, the RIV satisfies the following predetermined conditions,
- the RIV is obtained by encoding the starting resource index s and the length L of the allocated resource
- the RIV When s>NY, the RIV satisfies the following predetermined conditions.
- s ⁇ [N-Y+1,N-Y+2,...,N-X], L ⁇ [X,X+1,X+2,...,N-s],Y' Y-X+ 1
- u is an integer equal to or greater than
- K is an arbitrary constant. It is the combination number of two elements extracted from Y different elements, and mod represents the remainder.
- J 0, u satisfies the condition or u meet the conditions It is the number of combinations of two elements taken from N-X+2-s different elements.
- the third embodiment is a computer readable storage medium storing computer executable instructions for executing the resource allocation method of the first embodiment.
- the resource allocation method includes: the resource allocation sender allocates a resource of length L in the total resource of the system to the resource allocation receiving end; when L satisfies one of the following conditions, Resource allocation information that satisfies a predefined rule is sent to the resource allocation receiving end: L ⁇ X, or L ⁇ Y, or X ⁇ L ⁇ Y; wherein X is an integer satisfying 2 ⁇ X ⁇ N-1, and Y is less than A positive integer of N, where N is the total amount of resources in the system.
- the embodiment of the invention can reduce the resource allocation overhead under certain resource allocation constraints.
Abstract
本文公布了一种资源分配方法和装置,所述资源分配方法包括:资源分配发送端将系统总资源中的长度为L的资源分配给资源分配接收端;当L满足以下条件之一时,将满足预定义规则的资源分配信息发送给所述资源分配接收端:L≥X,或者L≤Y,或者X≤L≤Y;其中,X为满足2≤X≤N-1整数,Y是小于N的正整数,N为系统总资源量。本发明实施例在特定的资源分配限制条件下可以降低资源分配开销验。
Description
本发明实施例涉及但不限于无线通信网络,尤指一种资源分配的方法和装置。
在长期演进(LTE,Long Term Evolution)及高级长期演进(LTE-A,LTE-Advanced)系统中,基站通过下行调度分配和上行调度请求信息分别携带物理下行共享信道(PDSCH,Physical Downlink Share Channel)和物理上行共享信道(PUSCH,Physical Uplink Share Channel)的资源分配信息,用户终端(UE,User Equipment)根据接收的资源分配信息在相应的资源块(RB,Resource Block)上接收下行信息或发送上行信息。
对PDSCH的资源分配方式包含三种,下行资源分配类型0为位图(bitmap)映射分配,即对每个调度资源单位通过1比特来指示是否调度,调度资源单位为资源块组(RBG,Resource Block Group),支持非连续的RB调度。下行资源分配类型1首先用一个或多个比特指示UE使用的RBG子集,在所在子集内再采用bitmap的映射方法,同样支持非连续的RB调度。下行资源分配类型2是通过编码资源指示值(RIV,Resource Indication Value)来指示分配给UE的一段连续的RB资源,其中RIV是对分配资源的起始位置和长度的联合编码。
对于上行PUSCH的资源分配包含两种分配方式,上行资源分配类型0为连续资源分配方式,与下行资源分配类型2相同。上行资源分配类型1支持多达两个簇的非连续RB分配,每个簇内包含一个或多个连续的RBG,并对两个簇的起始资源索引和结束资源索引联合编码。
随着如智能交通、工业自动化等低时延业务的兴起,短传输时间间隔(short TTI,Transmission Time Interval)和降低处理时延是降低现有LTE/LTE-A空口时延的重要技术手段。对于short TTI,由于变短后的TTI所含符号个数减少,相同频域宽度内所含有的可用资源元素(RE,Resource Element)变少,如果仍然给用户分配较少的频域资源,将会导致即使传输最
小的传输块其码率也会非常大,甚至超过1。比如传输块大小为16比特,循环冗余校验比特为24,如果分配一个2符号TTI的资源块所含可用RE数为18,采用正交相移键控(QPSK,Quadrature Phase Shift keyin)调制时能实现的最低码率为1.11。因此short TTI场景下有必要限制分配给UE的资源数的最小值。对于降低处理时延,一种最有效的方法是降低传输块的大小,此时则没有必要分配给UE太多的资源块,因此时延降低场景下有必要限制分配给UE的资源数的最大值。
另外,机器类型通信(MTC,Machine Type Communication)场景中,MTC用户设备要求低成本,而减小UE上行和/或下行的传输带宽(包括基带和射频带宽)是降低用户设备成本的一种非常有效的方式,例如,设置所有MTC用户设备上行和/或下行传输带宽不能超过1.4MHz的带宽,意味着不管系统带宽有多大,比如系统带宽有20MHz时,基站有100个资源块可以用于分配,基站也最多只能分配6个资源块给MTC用户设备。
然而,本发明的发明人在设计过程中发现,当对分配给UE的资源块数目进行限制时,如果继续采用现有的资源分配方法将会出现资源浪费。
发明内容
以下是对本文详细描述的主题的概述。本概述并非是为了限制权利要求的保护范围。
本发明实施例提供一种资源分配方法和装置,在特定的资源分配限制条件下可以降低资源分配开销。
本发明实施例采用如下技术方案。
一种资源分配方法,包括:
资源分配发送端将系统总资源中的长度为L的资源分配给资源分配接收端;
当L满足以下条件之一时,将满足预定义规则的资源分配信息发送给所述资源分配接收端:L≥X,或者L≤Y,或者X≤L≤Y;其中,X为满足2≤X≤N-1整数,Y是小于N的正整数,N为系统总资源量。
可选地,所述满足预定义规则的资源分配信息是指:所述资源分配信息对应至少一个满足预定条件的资源指示值RIV,一个所述RIV对应一个起始资源索引s和分配的资源的长度L。
可选地,所述分配的长度为L的资源为连续资源,所述连续资源为虚拟连续资源,或者物理连续资源。
可选地,所述资源指示值RIV一一对应于范围[0,1,2,…,O-1]内的一个十进制数。
可选地,当L≥X时,s∈[0,1,2,…,N-X],L∈[X,X+1,X+2,…,N-s];或者L∈[X,X+1,X+2,…,N],s∈[0,1,2,…,N-L]。
可选地,对于特定的所述起始资源索引s和特定的长度L,RIV唯一对应于范围[0,1,2,…,O-1]内的一个十进制数,其中,L满足条件L≥X时的所有可能的分配种类的个数O满足条件:
是从N-X+2个不同元素中取出2个元素的组合数。
可选地,当L≤Y时,L∈[1,2,…,Y],s∈[0,1,2,…,N-L];或者s∈[0,1,2,…,N-1],L为大于或等于1且不超过Y的整数。
可选地,对于特定的所述起始资源索引s和特定的长度L,RIV唯一对应于范围[0,1,2,…,O-1]内的一个十进制数,其中L满足条件L≤Y时的所有可能的分配种类的个数O满足条件:
是从Y个不同元素中取出2个元素的组合数。
可选地,当X≤L≤Y时,L∈[X,X+1,X+2,…,Y],s∈[0,1,2,…,N-L];或者s∈[0,1,2,…,N-X],L为大于或等于X且不超过Y的整数。
可选地,对于特定的所述起始资源索引s和特定的长度L,RIV唯一对应于范围[0,1,2,…,O-1]内的一个十进制数,其中L满足条件X≤L≤Y时的所有可能的分配种类的个数O满足条件:
是从N-X+2个不同元素中取出2个元素的组合数,是从Y个不同元
素中取出2个元素的组合数,是从N+1个不同元素中取出2个元素的组合数。
可选地,资源指示值RIV由起始资源索引s和分配的资源的长度L编码得到,s∈[0,1,2,…,N′-1],L′∈[1,2,3,…,N′-s],或者L′∈[1,2,…,N′],s∈[0,1,2,…,N′-L′];其中,N′=N-X+1,L′=L-(X-1)。
可选地,RIV满足如下预定条件,K为任意常数;是从N-X+2个不同元素中取出2个元素的组合数,是从N-L+2个不同元素中取出2个元素的组合数,是从N'+1个不同元素中取出2个元素的组合数,mod表示求余。
可选地,RIV由起始资源索引s和分配的资源的长度L编码得到,当s>N-Y时,其中s∈[N-Y+1,N-Y+2,…,N-1],L∈[1,2,3,…,N-s],u为等于或者大于0的整数,K为任意常数,mod表示求余,是从Y个不同元素中取出2个元素的组合数。
可选地,当s≤N-Y时,K=0,RIV满足如下预定条件,RIV=sY+L-1。
可选地,当s>N-Y时,K=0,RIV满足如下预定条件,RIV=(N-Y+1)Y+u。
可选地,RIV由起始资源索引s和分配的资源的长度L编码得到,RIV满足如下预定条件,K为任意常数;是从N-L+2个不同元素中取出2个元素的组合数,是从Y个不同元素中取出2个元素的组合数,mod表示求余。
可选地,RIV由起始资源索引s和分配的资源的长度L编码得到,RIV满足如下预定条件,其中,L∈[X+1,X+2,…,Y],s∈[0,1,2,…,N-L],K为任意常数;是从N-X+2个不同元素中取出2个元素的组合数,是从N-L+2个不同元素中取出2个元素的组合数,是从Y个不同元素中取出2个元素的组合数,是从N+1个不同元素中取出2个元素的组合数,mod表示求余。
可选地,RIV由起始资源索引s和分配的资源的长度L编码得到,当s≤N-Y时,RIV满足如下预定条件,其中s∈[0,1,2,…,N-Y],L′=L-X+1,Y′=Y-X+1,L∈[X,X+1,X+2,…,Y],是从Y个不同元素中取出2个元素的组合数,mod表示求余。
可选地,RIV由起始资源索引s和分配的资源的长度L编码得到,当s>N-Y时,RIV满足如下预定条件,
其中s∈[N-Y+1,N-Y+2,…,N-X],L∈[X,X+1,X+2,…,N-s],Y′=Y-X+1,u为等于或者大于0的整数,K为任意常数,是从Y个不同元素中取出2个元素的组合数,mod表示求余。
可选地,当s≤N-Y时,K=0,RIV满足如下预定条件,RIV=sY′+L′-1。
可选地,当s>N-Y时,K=0,RIV满足如下预定条件,RIV=(N-Y+1)Y′+u。
可选地,所述资源指示值RIV对应于Q个比特的资源分配信息所指示的一种分配情况。
一种资源分配装置,设置于资源分配发送端,包括:
分配模块,用于将系统总资源中的长度为L的资源分配给资源分配接收端;
发送模块,用于当L满足以下条件之一时,将满足预定义规则的资源分配信息发送给所述资源分配接收端:L≥X,或者L≤Y,或者X≤L≤Y;其中,X为满足2≤X≤N-1整数,Y是小于N的正整数,N为系统总资源量。
可选地,所述满足预定义规则的资源分配信息是指:所述资源分配信息对应至少一个满足预定条件的资源指示值RIV,一个所述RIV对应一个起始资源索引s和分配的资源的长度L。
可选地,所述资源指示值RIV一一对应于范围[0,1,2,…,O-1]内的一个十进制数。
可选地,所述分配的长度为L的资源为连续资源,所述连续资源为虚拟连续资源,或者物理连续资源。
一种计算机可读存储介质,存储有计算机可执行指令,所述计算机可执行指令用于执行上述资源分配方法。
本发明实施例的方案给出在限制资源分配数目时有效的资源分配方案,能够节省资源分配开销。
本发明的其它特征和优点将在随后的说明书中阐述,并且,部分地从说明书中变得显而易见,或者通过实施本发明而了解。本发明的目的和其他优点可通过在说明书、权利要求书以及附图中所特别指出的结构来实现和获得。
在阅读并理解了附图和详细描述后,可以明白其他方面。
附图概述
附图用来提供对本发明技术方案的进一步理解,并且构成说明书的一部分,与本申请的实施例一起用于解释本发明的技术方案,并不构成对本发明技术方案的限制。
图1为本申请实施例一的资源分配方法的流程示意图;
图2为本申请实施示例1中不限制分配的资源的长度时的RIV与起始资源索引s和资源的长度L之间的映射关系。
图3为本申请实施示例2中当分配的资源的长度必须不小于X时的RIV与起始资源索引s和资源的长度L之间的连续映射关系。
图4为本申请实施示例3中当分配的资源的长度必须不小于X时的RIV与起始资源索引s和资源的长度L之间的分段映射关系。
图5为本申请实施示例4中当分配的资源的长度必须不大于Y时的RIV与起始资源索引s和资源的长度L之间的连续映射关系。
图6为本申请实施示例5中当分配的资源的长度必须不大于Y时的RIV与起始资源索引s和资源的长度L之间的分段映射关系。
图7为本申请实施示例6中当分配的资源的长度属于区间[X,Y]时的RIV与起始资源索引s和资源的长度L之间的连续映射关系。
图8为本申请实施示例7中当分配的资源的长度属于区间[X,Y]时的RIV与起始资源索引s和资源的长度L之间的分段映射关系;
图9为本申请实施例二的资源分配装置的示意图。
本发明的较佳实施方式
下面将结合附图及实施例对本发明的技术方案进行更详细的说明。
需要说明的是,如果不冲突,本发明实施例以及实施例中的各个特征可以相互结合,均在本发明的保护范围之内。另外,虽然在流程图中示出了逻辑顺序,但是在某些情况下,可以以不同于此处的顺序执行所示出或描述的步骤。
实施例一、一种资源分配方法,如图1所示,包括步骤步骤S110~步骤S120:
步骤S110、发送端将系统总资源中的长度为L的资源分配给接收端;
步骤S120、当L满足以下条件之一时,将满足预定义规则的资源分配信息发送给所述资源分配接收端:L≥X,或者L≤Y,或者X≤L≤Y;其中,X为满足2≤X≤N-1整数,Y是小于N的正整数,N为系统总资源量。
本实施例中,所述资源分配发送端可以但不限于为基站;所述资源分配接收端可以但不限于为终端。
其中,所有可能的分配种类的个数可以是指在系统总资源中分配长度为L的资源时,一共可能出现多少种分配的情况;一种分配的情况是一个分配种类。
可选地,所述满足预定义规则的资源分配信息是指:所述资源分配信息对应至少一个满足预定条件的资源指示值RIV,一个所述资源指示值对应一个起始资源索引s和分配的资源的长度L。
其中,所述资源指示值RIV一一对应于范围[0,1,2,…,O-1]内的一个十进制数。
可选地,所述分配的长度为L的资源为连续资源;所述连续资源可以为虚拟连续资源,或者可以为物理连续资源。资源为物理连续资源是指所述资源直接对应物理资源,如物理资源块(PRB)或者时域上的传输时间单元(在LTE系统中称为子帧)。资源为虚拟连续资源是指所述资源经过特定的映射变换间接的对应物理资源,即当虚拟资源连续时其对应的物理资源不一定连续。
可选地,当L≥X时,s∈[0,1,2,…,N-X],L∈[X,X+1,X+2,…,N-s];或者L∈[X,X+1,X+2,…,N],s∈[0,1,2,…,N-L]。
其中,对于特定的所述起始资源索引s和特定的长度L,RIV可以唯一对应于范围[0,1,2,…,O-1]内的一个十进制数,其中L满足条件L≥X时的所有可能的分配种类的个数O满足条件:
可选地,当L≤Y时,L∈[1,2,…,Y],s∈[0,1,2,…,N-L];或者s∈[0,1,2,…,N-1],L为大于或等于1且不超过Y的整数。
其中,对于特定的所述起始资源索引s和特定的长度L,RIV可以一一对应于范围[0,1,2,…,O-1]内的一个十进制数,其中L满足条件L≤Y时的所有可能的分配种类的个数O满足条件:
可选地,当X≤L≤Y时,L∈[X,X+1,X+2,…,Y],s∈[0,1,2,…,N-L];或者s∈[0,1,2,…,N-X],L为L为大于或等于X且不超过Y的整数。
其中,对于特定的所述起始资源索引s和特定的长度L,RIV可以一一对应于范围[0,1,2,…,O-1]内的一个十进制数,其中L满足条件X≤L≤Y时的所有可能的分配种类的个数O满足条件:
可选地,在L≥X时,RIV由起始资源索引s和分配的资源的长度L编码得到,s∈[0,1,2,…,N′-1],L′∈[1,2,3,…,N′-s],或者L′∈[1,2,…,N′],s∈[0,1,2,…,N′-L′];其中,N′=N-X+1,L′=L-(X-1)。
可选地,在L≥X时,可以采用如下4种可选方法中的任一种得到RIV:
方法一:
方法二:
或者,RIV满足如下预定条件,K为任意常数;是从N-X+2个不同元素中取出2个元素的组合数,是从N-L+2个不同元素中取出2个元素的组合数,是从N'+1个不同元素中取出2个元素的组合数,mod表示求余。
方法三:
和/或,
方法四:
和/或,
可选地,在L≤Y时,可以采用如下两种可选的实施方式中的任一种得到RIV。
实施方式一
RIV由起始资源索引s和分配的资源的长度L编码得到;
和/或,
当s≤N-Y时,可选地,K=0,RIV满足如下预定条件,RIV=sY+L-1。
当s>N-Y时,可选地,K=0,RIV满足如下预定条件,RIV=(N-Y+1)Y+u。
实施方式一可采用如下两种方法中的任一种得到RIV。
方法1:
方法2:
实施方式二
资源指示值RIV由起始资源索引s和分配的资源的长度L编码得到,RIV满足如下预定条件,K为任意常数;是从N-L+2个不同元素中取出2个元素的组合数,是从Y个不同元素中取出2个元素的组合数,mod表示求余。
可选地,当X≤L≤Y时,可以采用以下2种方法中的任一种得到RIV。
方法1:
RIV由起始资源索引s和分配的资源的长度L编码得到,RIV满足如下预定条件,其中,L∈[X+1,X+2,…,Y],s∈[0,1,2,…,N-L],K为任意常数;是从N-X+2个不同元素中取出2个元素的组合数,是从N-L+2个不同元素中取出2个元素的组合数,是从Y个不同元素中取出2个元素的组合数,是从N+1个不同元素中取出2个元素的组合数,mod表示求余。
方法2:
RIV由起始资源索引s和分配的资源的长度L编码得到;
当s≤N-Y时,RIV满足如下预定条件,其中s∈[0,1,2,…,N-Y],L′=L-X+1,Y′=Y-X+1,L∈[X,X+1,X+2,…,Y],是从Y个不同元素中取出2个元素的组合数,mod表示求余;
和/或,
当s>N-Y时,RIV满足如下预定条件,其中s∈[N-Y+1,N-Y+2,…,N-X],L∈[X,X+1,X+2,…,N-s],u为等于或者大于0的整数,Y′=Y-X+1,K为任意常数,是从Y个不同元素中取出2个元素的组合数,mod表示求
余,u为等于或者大于0的整数。
可选地,本实施例中,所述资源指示值RIV可以对应于Q个比特的资源分配信息所指示的一种分配情况。
本实施例中,所述资源分配接收端接收到所述Q比特资源分配信息后可以将其转化为十进制数,对应一个所述资源指示值RIV。
本实施例中,所述资源分配接收端可以根据获得的资源指示值RIV解码得到唯一对应的所述起始资源索引s和特定的长度L。
下面用7个实施示例说明本实施例的方案。下述示例中以分配的资源为虚拟连续资源为例进行示范性描述;本实施例的方案中,所分配的资源并不限于下述示例里提及的虚拟连续资源。
实施示例1
图2给出了不限制分配的资源的长度时的RIV与起始资源索引s和分配的资源的长度L的映射关系。假定基站(即:资源分配发送端)通过上行调度授权向UE(即:资源分配接收端)发送上行数据传输使用的资源分配信息。假设上行可用虚拟资源单元数(即系统总资源量)为N=6,虚拟资源单元索引为0,1,2.....N-1,分配的资源为连续的L个虚拟资源单元(即虚拟连续资源的长度为L)。即分配的资源的起始资源索引为s∈[0,1,2,…,N-1],长度为L∈[1,2,3,…,N-s]。定义上行资源分配的资源指示值为RIV,则根据本实施例可定义RIV与起始资源索引s和分
配的资源的长度L之间的映射关系如图2所示。此时十进制数RIV可以编码为对应的Q=5比特的二进制数。资源分配接收端根据接收到的二进制的资源分配信息获得资源指示值RIV,然后利用图2中的对应关系获取起始资源索引s和分配的资源的长度L。资源分配接收端可以首先根据RIV值与取不同s时的值进行比较来获取s,然后根据得到L的值,一种可选的实现方式可以参考如下代码:
s=0;
{
s++;
}
实施示例2
图3给出了当分配的资源的长度必须不小于X时的RIV与起始资源索引s和资源的长度L之间的连续映射关系。假定基站(即:资源分配发送端)通过上行调度授权向UE(即:资源分配接收端)发送上行数据传输使用的资源分配信息。假设上行可用虚拟资源RBG数(即系统总资源量)为N=10,虚拟资源单元索引为0,1,2.....N-1,分配的资源为连续的L个虚拟资源单元(即虚拟连续资源的长度为L)。假定L大于或等于X=5,即s∈[0,1,2,…,N-X],L∈[X,X+1,X+2,…,N-s]。定义上行资源分配的资源指示值为RIV,则根据本实施例可定义RIV与起始资源索引s和资源的长度L之间的映射关系如图3所示。
此时十进制数RIV可以编码为对应的Q=5比特的二进制数。资源分配接收端根据接收到的二进制的资源分配信息获得资源指示值RIV,然后利用图3中的对应关系获取起始资源索引s和资源的长度L。一种可选的实现方式可以参考如下代码:
X=5;
L=X;
{
L++;
}
实施示例3
图4给出了当分配的虚拟连续资源的长度必须不小于X时的RIV与起始资源索引s和虚拟连续资源的长度L之间的分段映射关系。假定基站(即:资源分配发送端)通过下行调度授权向UE(即:资源分配接收端)发送下行数据传输使用的资源分配信息。假设下行可用虚拟资源RBG数(即系统总资源量)为N=6,虚拟资源单元索引为0,1,2.....N-1,分配资源为连续的L个虚拟资源单元(即虚拟连续资源的长度为L)。假定L大于或等于X=3,即s∈[0,1,2,3],L∈[3,4,5,…,6-s]。定义N′=N-X+1=4,L′=L-(X-1)=L-2。其中,L′∈[1,2,3,4],s∈[0,1,…,4-L′]。定义下行资源分配的资源指示值为RIV,则根据本实施例可定义:
RIV与起始资源索引s和资源的长度L之间的映射关系如图4所示。此时十进制数RIV可以编码为对应的Q=4比特的二进制数。资源分配接收端根据接收到的二进制的资源分配信息获得资源指示值RIV,然后利用图4中的对应关系获取起始资源索引s和资源的长度L。一种可选的实现方式可以参考如下代码:
当a+b<N′时,
L=L′+(X-1)=a+1+(X-1)=X+a
s=b
否则,L=L′+(X-1)=N′+1-a+(X-1)=N′-a+X,
s=N′-1-b。
实施示例4
图5给出了当分配的资源的长度必须不大于Y时的RIV与起始资源索引s和虚拟连续资源的长度L之间的连续映射关系。假定基站(即:资源分配发送端)通过下行授权向UE(即:资源分配接收端)发送下行数据传输使用的资源分配信息。假设下行可用虚拟资源RBG数(即系统总资源量)为N=100,虚拟资源单元索引为0,1,2.....N-1,分配资源为连续的L个虚拟资源单元(即虚拟连续资源的长度为L)。假定L小于或等于Y=50,即L∈[1,2,…,Y],s∈[0,1,2,…,N-L]。定义下行资源分配的资源指示值为RIV,则根据本实施例可定义此式中RIV可以认为是十进制数或者在公式计算中始终采用二进制数计算。RIV与起始资源索引s和资源的长度L之间的映射关系如图5所示。
此时RIV对应Q=12比特的资源分配信息。资源分配接收端根据接收到的二进制的资源分配信息获得资源指示值RIV,然后利用图5中的对应关系获取起始资源索引s和资源的长度L。一种可选的实现方式可以参考如下代码:
Y=50;
L=1;
{
L++;
}
实施示例5
图6给出了当分配的资源的长度必须不大于Y时的RIV与起始资源索引s和虚拟连续资源的长度L之间的分段映射关系。假定基站(即:资源分配发送端)通过上行授权向UE(即:资源分配接收端)发送上行数据传输使用的资源分配信息。假设上行可用虚拟资源RBG数(即系统总资源量)为N=100,虚拟资源单元索引为0,1,2.....N-1,分配资源为连续的L个虚拟资源单元(即虚拟连续资源的长度为L)。假定L小于等于Y=50,即s∈[0,1,2,…,N-1],L为大于或等于1且不超过Y的整数。定义上行资源分配的资源指示值为RIV,则根据本实施例可做如下定义:当s≤N-Y时,RIV=sY+L-1;当s>N-Y时,RIV=(N-Y+1)Y+u,J为任意常数,可选的即此式中RIV可以认为是十进制数或者在公式计算中始终采用二进制数计算。RIV与起始资源索引s和资源的长度L之间的映射关系如图6所示。
此时RIV对应Q=12比特的资源分配信息。资源分配接收端根据接收到的二进制的资源分配信息获得资源指示值RIV,然后利用图6中的对应关系获取起始资源索引s和资源的长度L。
实施示例6
图7给出了当分配的资源长度属于区间[X,Y]时的RIV与起始资源索引s和虚拟连续资源的长度L之间的连续映射关系。假定基站(即:资源分配发送端)通过上行授权向UE(即:资源分配接收端)发送上行数据传输使用的资源分配信息。假设上行可用虚拟资源RBG数(即系统总资源量)为N=6,虚拟资源单元索引为0,1,2.....N-1,分配资源为连续的L个虚拟资源单元(即虚拟连续资源的长度为L)。假定L属于区间[X,Y],其中图7示例中X=2,Y=4。L∈[2,3,4],s∈[0,1,2,…,N-L]。定义上行资源分配的资源指示值为RIV,则根据本实施例可定义RIV与起始资源索引s和资源的长度L之间的映射关系如图7所示。
此时RIV对应Q=4比特的资源分配信息。资源分配接收端根据接收到
的二进制的资源分配信息获得资源指示值RIV,然后利用图7中的对应关系获取起始资源索引s和资源的长度L。
实施示例7
图8给出了当分配的资源的长度属于区间[X,Y]时的RIV与起始资源索引s和虚拟连续资源的长度L之间的分段映射关系。假定基站(即:资源分配发送端)通过上行授权向UE(即:资源分配接收端)发送上行数据传输使用的资源分配信息。设上行可用虚拟资源RBG数(即系统总资源量)为N=6,虚拟资源单元索引为0,1,2.....N-1,分配资源为连续的L个虚拟资源单元(即虚拟连续资源的长度为L)。假定L属于区间[X,Y],其中图8示例中X=2,Y=4。s∈[0,1,2,…,N-X],L为大于或等于2且不超过4的整数。定义上行资源分配的资源指示值为RIV,则根据本实施例可做如下定义:当s≤N-Y时,RIV=sY′+L′-1;当s>N-Y时,RIV=(N-Y+1)Y′+u。J为任意常数。其中,L′=L-X+1,N′=Y-X,Y′=Y-X+1,s′=s-(N-Y+1)。其中,示例中J=0,即RIV与起始资源索引s和资源的长度L之间的映射关系如图8所示。
此时RIV对应Q=4比特的资源分配信息。资源分配接收端根据接收到的二进制的资源分配信息获得资源指示值RIV,然后利用图8中的对应关系获取起始索引s和长度L。
实施例二、一种资源分配装置,如图9所示,设置于资源分配发送端,包括:
分配模块91,用于将系统总资源中的长度为L的资源分配给资源分配接收端;
发送模块92,用于当L满足以下条件之一时,将满足预定义规则的资源分配信息发送给所述资源分配接收端:L≥X,或者L≤Y,或者X≤L≤Y;其中,X为满足2≤X≤N-1整数,Y是小于N的正整数,N为系统总资
源量。
可选地,所述满足预定义规则的资源分配信息是指:所述资源分配信息对应至少一个满足预定条件的资源指示值RIV,一个所述RIV对应一个起始资源索引s和分配的资源的长度L。
其中,所述资源指示值RIV可以一一对应于范围[0,1,2,…,O-1]内的一个十进制数。
可选地,所述资源指示值RIV对应于Q个比特的资源分配信息所指示的一种分配情况。
可选地,当L≥X时,s∈[0,1,2,…,N-X],L∈[X,X+1,X+2,…,N-s];或者L∈[X,X+1,X+2,…,N],s∈[0,1,2,…,N-L]。
其中,对于特定的所述起始资源索引s和特定的长度L,RIV可以唯一对应于范围[0,1,2,…,O-1]内的一个十进制数,其中,L满足条件L≥X时的所有可能的分配种类的个数O满足条件:
可选地,当L≤Y时,L∈[1,2,…,Y],s∈[0,1,2,…,N-L];或者s∈[0,1,2,…,N-1],L为大于或等于1且不超过Y的整数。
其中,对于特定的所述起始资源索引s和特定的长度L,RIV可以唯一对应于范围[0,1,2,…,O-1]内的一个十进制数,其中L满足条件L≤Y时的所有可能的分配种类的个数O满足条件:
可选地,当X≤L≤Y时,L∈[X,X+1,X+2,…,Y],s∈[0,1,2,…,N-L];或者s∈[0,1,2,…,N-X],L为大于或等于X且不超过Y的整
数。
其中,对于特定的所述起始资源索引s和特定的长度L,RIV可以唯一对应于范围[0,1,2,…,O-1]内的一个十进制数,其中L满足条件X≤L≤Y时的所有可能的分配种类的个数O满足条件:
可选地,当L≥X时,资源指示值RIV由起始资源索引s和分配的资源的长度L编码得到,s∈[0,1,2,…,N′-1],L′∈[1,2,3,…,N′-s],或者L′∈[1,2,…,N′],s∈[0,1,2,…,N′-L′];其中,N′=N-X+1,L′=L-(X-1)。
可选地,在L≥X时,可以采用如下4种可选方法中的任一种得到RIV:
方法一
方法二
或者,RIV满足如下预定条件,K为任意常数;是从N-X+2个不同元素中取出2个元素的组合数,是从N-L+2个不同元素中取出2个元素的组合数,是从N'+1个不同元素中取出2个元素的组合数,mod表示求余。
方法三
和/或,
方法四
和/或,
可选地,在L≤Y时,可以采用如下2种实施方式中的任一种得到RIV:
实施方式一
RIV由起始资源索引s和分配的资源的长度L编码得到;
和/或,
可选地,当s≤N-Y时,K=0,RIV满足如下预定条件,RIV=sY+L-1。
可选地,当s>N-Y时,K=0,RIV满足如下预定条件,RIV=(N-Y+1)Y+u。
实施方式一可采用如下两种方法中的任一种得到RIV。
方法1
方法2
实施方式二
可选地,在X≤L≤Y时,可以采用如下2种方法中的任一种得到RIV:
方法1
RIV由起始资源索引s和分配的资源的长度L编码得到,RIV满足如下预定条件,其中,L∈[X+1,X+2,…,Y],s∈[0,1,2,…,N-L],K为任意常数;是从N-X+2个不同元素中取出2个元素的组合数,是从N-L+2个不同元素中取出2个元素的组合数,是从Y个不同元素中取出2个元素的组合数,是从N+1个不同元素中取出2个元素的组合数,mod表示求余。
方法2
RIV由起始资源索引s和分配的资源的长度L编码得到;
当s≤N-Y时,RIV满足如下预定条件,其中s∈[0,1,2,…,N-Y],L′=L-X+1,Y′=Y-X+1,L∈[X,X+1,X+2,…,Y],是从Y个不同元素中取出2个元素的组合数,mod表示求余。
和/或,
当s>N-Y时,RIV满足如下预定条件,
其中s∈[N-Y+1,N-Y+2,…,N-X],L∈[X,X+1,X+2,…,N-s],Y′=Y-X+1,u为等于或者大于0的整数,K为任意常数,是从Y个不同元素中取出2个元素的组合数,mod表示求余。
可选地,当s≤N-Y时,K=0,RIV满足如下预定条件,RIV=sY′+L′-1。
可选地,当s>N-Y时,K=0,RIV满足如下预定条件,RIV=(N-Y+1)Y′+u。
实施例三、一种计算机可读存储介质,存储有计算机可执行指令,所述计算机可执行指令用于执行上述实施例一的资源分配方法。
本领域普通技术人员可以理解上述方法中的全部或部分步骤可通过程序来指令相关硬件完成,所述程序可以存储于计算机可读存储介质中,如只读存储器、磁盘或光盘等。可选地,上述实施例的全部或部分步骤也可以使用一个或多个集成电路来实现。相应地,上述实施例中的各模块/单元可以采用硬件的形式实现,也可以采用软件功能模块的形式实现。本发明不限制于任何特定形式的硬件和软件的结合。
虽然本发明所揭露的实施方式如上,但所述的内容仅为便于理解本发明而采用的实施方式,并非用以限定本发明。任何本发明所属领域内的技术人员,在不脱离本发明所揭露的精神和范围的前提下,可以在实施的形式及细节上进行任何的修改与变化,但本发明的专利保护范围,仍须以所附的权利要求书所界定的范围为准。
本发明实施例提出的资源分配方法和装置,所述资源分配方法包括:资源分配发送端将系统总资源中的长度为L的资源分配给资源分配接收端;当L满足以下条件之一时,将满足预定义规则的资源分配信息发送给所述资源分配接收端:L≥X,或者L≤Y,或者X≤L≤Y;其中,X为满足2≤X≤N-1整数,Y是小于N的正整数,N为系统总资源量。本发明实施例在特定的资源分配限制条件下可以降低资源分配开销。
Claims (54)
- 一种资源分配方法,包括:发送端将系统总资源中的长度为L的资源分配给接收端;当L满足以下条件之一时,将满足预定义规则的资源分配信息发送给所述接收端:L≥X,或者L≤Y,或者X≤L≤Y;其中,X为满足2≤X≤(N-1)的整数,Y是小于N的正整数,N为系统总资源量。
- 根据权利要求2所述的资源分配方法,其特征在于,所述满足预定义规则的资源分配信息包括:所述资源分配信息对应至少一个满足预定条件的资源指示值,一个所述资源指示值对应一个起始资源索引s和分配的资源的长度L。
- 根据权利要求1所述的资源分配方法,其中,所述长度为L的资源为连续资源,所述连续资源为虚拟连续资源,或者物理连续资源。
- 根据权利要求3所述的资源分配方法,其中:所述资源指示值一一对应于范围[0,1,2,…,(O-1)]内的一个十进制数。
- 根据权利要求3所述的资源分配方法,其中:当L≥X时,s∈[0,1,2,…,N-X],L∈[X,X+1,X+2,…,N-s];或者L∈[X,X+1,X+2,…,N],s∈[0,1,2,…,N-L]。
- 根据权利要求3所述的资源分配方法,其中:当L≤Y时,L∈[1,2,…,Y],s∈[0,1,2,…,N-L];或者s∈[0,1,2,…,N-1],L为大于或等于1且不超过Y的整数。
- 根据权利要求3所述的资源分配方法,其中:当X≤L≤Y时,L∈[X,X+1,X+2,…,Y],s∈[0,1,2,…,N-L];或者s∈[0,1,2,…,N-X],L为大于或等于X且不超过Y的整数。
- 根据权利要求6述的资源分配方法,其中:所述资源指示值由起始资源索引s和分配的资源的长度L编码得到,s∈[0,1,2,…,N′-1],L′∈[1,2,3,…,N′-s],或者L′∈[1,2,…,N′],s∈[0,1,2,…,N′-L′];其中,N′=N-X+1,L′=L-(X-1)。
- 根据权利要求27所述的资源分配方法,其中:当s≤N-Y时,所述K=0,所述资源指示值满足如下预定条件,资源指示值RIV=sY+L-1。
- 根据权利要求28所述的资源分配方法,其中:当s>N-Y时,所述K=0,所述资源指示值满足如下预定条件,资源指示值RIV=(N-Y+1)Y+u。
- 根据权利要求42所述的资源分配方法,其中:当s≤N-Y时,所述K=0,所述资源指示值满足如下预定条件,资源指示值RIV=sY′+L′-1。
- 根据权利要求43所述的资源分配方法,其中:当s>N-Y时,所述K=0,所述资源指示值满足如下预定条件,资源指示值RIV=(N-Y+1)Y′+u。
- 根据权利要求3所述的资源分配方法,其中:所述资源指示值对应于Q个比特的资源分配信息所指示的一种分配情况。
- 一种资源分配装置,设置于资源分配发送端,包括:分配模块,用于将系统总资源中的长度为L的资源分配给资源分配接收端;发送模块,用于当L满足以下条件之一时,将满足预定义规则的资源分配信息发送给所述资源分配接收端:L≥X,或者L≤Y,或者X≤L≤Y;其中,X为满足2≤X≤(N-1)整数,Y是小于N的正整数,N为系统总资源量。
- 根据权利要求50所述的资源分配装置,其中,所述满足预定义规则的资源分配信息包括:所述资源分配信息对应至少一个满足预定条件的资源指示值,一个所述所述资源指示值对应一个起始资源索引s和分配的资源的长度L。
- 根据权利要求51所述的资源分配装置,其中:所述资源指示值一 一对应于范围[0,1,2,…,(O-1)]内的一个十进制数。
- 根据权利要求49所述的资源分配装置,其中,所述分配的长度为L的资源为连续资源,所述连续资源为虚拟连续资源,或者物理连续资源。
- 一种计算机可读存储介质,存储有计算机可执行指令,所述计算机可执行指令用于执行权利要求1~权利要求48任一项所述的资源分配方法。
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201610659444.5 | 2016-08-11 | ||
CN201610659444.5A CN107734664B (zh) | 2016-08-11 | 2016-08-11 | 一种资源分配方法和装置 |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2018028515A1 true WO2018028515A1 (zh) | 2018-02-15 |
Family
ID=61161734
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/CN2017/095955 WO2018028515A1 (zh) | 2016-08-11 | 2017-08-04 | 一种资源分配方法和装置 |
Country Status (2)
Country | Link |
---|---|
CN (1) | CN107734664B (zh) |
WO (1) | WO2018028515A1 (zh) |
Families Citing this family (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN111065160B (zh) * | 2018-10-17 | 2022-12-02 | 中兴通讯股份有限公司 | 资源的分配方法及装置、存储介质和电子装置 |
Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN1968489A (zh) * | 2006-06-23 | 2007-05-23 | 华为技术有限公司 | 一种资源分配的方法及系统 |
CN101247307A (zh) * | 2008-03-12 | 2008-08-20 | 中兴通讯股份有限公司 | 资源长度受限的连续资源表示方法和装置 |
CN103327615A (zh) * | 2012-03-20 | 2013-09-25 | 华为技术有限公司 | 资源分配指示方法、资源分配方法及设备 |
US20160119911A1 (en) * | 2011-06-21 | 2016-04-28 | Electronics And Telecommunications Research Institute | Methods for transmitting and receiving of control channel in wireless communication systems |
Family Cites Families (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
KR100921467B1 (ko) * | 2008-06-19 | 2009-10-13 | 엘지전자 주식회사 | 셀룰라 다중반송파 시스템에서 조밀도를 조절하는 자원할당시그널링 방식 |
KR20110081017A (ko) * | 2010-01-05 | 2011-07-13 | 주식회사 팬택 | 무선통신 시스템에서 자원할당전송방법 및 그 송신장치, 이에 대응하는 수신장치 |
KR20130028996A (ko) * | 2011-05-18 | 2013-03-21 | 주식회사 팬택 | 무선통신 시스템에서 자원할당전송방법 및 그 송신장치, 이에 대응하는 수신장치 |
KR20130031604A (ko) * | 2011-09-21 | 2013-03-29 | 주식회사 팬택 | 전송단, 자원 할당 방법, 단말, 및 자원 할당 정보 수신 방법 |
-
2016
- 2016-08-11 CN CN201610659444.5A patent/CN107734664B/zh active Active
-
2017
- 2017-08-04 WO PCT/CN2017/095955 patent/WO2018028515A1/zh active Application Filing
Patent Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN1968489A (zh) * | 2006-06-23 | 2007-05-23 | 华为技术有限公司 | 一种资源分配的方法及系统 |
CN101247307A (zh) * | 2008-03-12 | 2008-08-20 | 中兴通讯股份有限公司 | 资源长度受限的连续资源表示方法和装置 |
US20160119911A1 (en) * | 2011-06-21 | 2016-04-28 | Electronics And Telecommunications Research Institute | Methods for transmitting and receiving of control channel in wireless communication systems |
CN103327615A (zh) * | 2012-03-20 | 2013-09-25 | 华为技术有限公司 | 资源分配指示方法、资源分配方法及设备 |
Also Published As
Publication number | Publication date |
---|---|
CN107734664B (zh) | 2023-04-07 |
CN107734664A (zh) | 2018-02-23 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US10420092B2 (en) | Resource allocation information indication method, base station, and user equipment | |
KR101525294B1 (ko) | 이동국들로의 그룹 사이즈 표시 분배 | |
CN106413105B (zh) | 一种资源传输的指示方法、装置、网络侧设备及终端 | |
WO2017157181A1 (zh) | 一种资源调度和分配的方法和装置 | |
EP3400686B1 (en) | System and method of air interface capability exchange | |
TWI699132B (zh) | 用於行動通訊系統之基地台及使用者裝置 | |
WO2018082661A1 (zh) | 一种数据传输方法和装置 | |
WO2019052455A1 (zh) | 数据信道参数配置方法及装置 | |
WO2019091374A1 (zh) | 传输信息的方法和通信设备 | |
CN104125045A (zh) | 一种用于传输ack/nack消息的方法 | |
CN107371270B (zh) | 一种传输方法、设备和系统 | |
WO2019214283A1 (zh) | 一种上行传输功率分配方法和移动通信设备 | |
CN105991248B (zh) | 一种实现混合自动重传请求信息发送的方法及数据接收端 | |
WO2011054176A1 (zh) | 一种上行控制信道资源配置的方法、设备及系统 | |
WO2021018196A1 (zh) | 免调度传输资源的配置方法、装置、发送设备及接收设备 | |
US20180048441A1 (en) | Determining reference signal locations | |
JP7102511B2 (ja) | データのフィードバック、送信、受信方法及び装置、受信機器、送信機器 | |
JPWO2020021770A1 (ja) | 端末、通信方法及び集積回路 | |
US10313083B2 (en) | Method for hybrid automatic repeat request process, network device and terminal device | |
WO2018201915A1 (zh) | 数据处理方法和装置 | |
CN107409381A (zh) | 通过指示数据传输的终止点来辅助第一载波上的数据传输的方法 | |
WO2017076206A1 (zh) | 一种资源分配方法及装置 | |
WO2021000937A1 (zh) | 多时间单元传输方法及相关装置 | |
WO2018028515A1 (zh) | 一种资源分配方法和装置 | |
WO2019192515A1 (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: 17838645 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: 17838645 Country of ref document: EP Kind code of ref document: A1 |