Resource size limited continuous resource representation method and device
A resource and resource block technology, applied in the field of communication, can solve the problem of less signaling overhead
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0110] Embodiment 1 (method-)
[0111] Assume that the number of available resources N RB =12, the maximum resource quantity L that can be continuously allocated Max =6, then,
[0112] The resulting tree structure is as Figure 5 shown. In the figure, the number of nodes at the bottom layer is 12 (equal to the number of available resources), the number of layers is 6 (equal to the maximum number of resources that can be continuously allocated), and the number of nodes in each layer is one less from bottom to top.
[0113] According to the first numbering rule, move the nodes of layer 6-k to the right of layer k-1 (k=1, 2, ..., ceil(6 / 2)) in order from right to left , and then number the moved layers in order from bottom to top and from left to right, and the generated tree nodes with node numbers are as follows Figure 5 shown;
[0114] When the starting position of the allocated continuous resource is RB start =1, the length L of continuous resources CRBs = 2, the corre...
Embodiment 2
[0124] Embodiment 2 (method 1, as a special case of limited resource length)
[0125] Assume that the number of available resources N RB =6, the maximum resource quantity L that can be continuously allocated Max =6, then,
[0126] The resulting tree structure is as Figure 6 shown. In the figure, the number of nodes at the bottom is 6 (equal to the number of available resources), and the number of layers is 6 (equal to the maximum number of resources that can be continuously allocated), and the number of nodes in each layer is one less from bottom to top.
[0127] According to the first numbering rule, move the nodes of layer 6-k to the right of layer k-1 (k=1, 2, ..., ceil(6 / 2)) in order from right to left , and then number the moved layers from bottom to top and from left to right, and the resulting tree structure with node numbers is as follows Figure 6 shown;
[0128] When the starting position of the allocated continuous resource is RB start =1, the length L of co...
Embodiment 3
[0138] Embodiment 3, adopt method two
[0139] Assume that the number of available resources N RB =12, the maximum resource quantity L that can be continuously allocated Max =6, then,
[0140] The resulting tree structure is as Figure 7 shown. In the figure, the number of nodes at the bottom layer is 12 (equal to the number of available resources), the number of layers is 6 (equal to the maximum number of resources that can be continuously allocated), and the number of nodes in each layer is one less from bottom to top.
[0141] According to the second numbering rule, move the nodes of layer 6-k to the right side of layer k (k=1, 2, ..., floor(6 / 2)) in order from right to left, and then The moved layers are numbered from bottom to top and from left to right, and the resulting tree structure with node numbers is as follows: Figure 7 shown;
[0142] When the starting position of the allocated continuous resource is RB start =1, the length L of continuous resources CRBs...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 