Method for resource allocation in wireless communication network and device thereof
A resource allocation and allocation device technology, applied in the direction of wireless communication, electrical components, etc., can solve the problems of large PHICH, waste of PHICH resources, that is, downlink resources, etc., and achieve the effect of reducing PHICH resources
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
example 1
[0033] For example, under the current TTI, the uplink scheduling grant in the pending scheduling grant set is {g_x1,g_x2,...,g_x15}, and the number of PHICH candidate sets corresponding to it is {k0,k1,...,k14}, if k0 and k1 are the smallest number in {k0,k1,...,k14}, that is, the number of PHICH candidate sets corresponding to k0 and k1 is the smallest, then k0 and k1 correspond to the uplink scheduling grant set in the current TTI g_x1 and g_x2 are the uplink scheduling grants with the least PHICH candidate set under the current TTI.
[0034] In step S102, the base station obtains PHICH resources that can be used by the uplink scheduling grant with the PHICH candidate set that meets the first predetermined condition.
[0035] In the following, taking the first predetermined condition that the PHICH candidate set is the smallest as an example, it is described that the base station obtains the PHICH resources that can be used by the uplink scheduling grant with the smallest PHICH c...
example 2
[0037] For example, the PHICH resource that can be scheduled in the uplink scheduling grant set under the current TTI is G={g0,g1,...,g14}, and the number of PHICH candidate sets corresponding to it is {k0,k1,...,k14 }, if k0 and k1 are the smallest number in {k0,k1,...,k14}, that is, the number of PHICH candidate sets corresponding to k0 and k1 is the smallest, then the uplink scheduling grants under the current TTI corresponding to k0 and k1 The PHICH resources g0 and g1 that can be scheduled in the set are the PHICH resources that can be used for the uplink scheduling authorization with the least PHICH candidate set.
[0038] In step S103, the base station determines the PHICH resource whose associated grant number meets the second predetermined condition from among the PHICH resources available for the uplink scheduling grant with the PHICH candidate set meeting the first predetermined condition.
[0039] Wherein, the second predetermined condition includes:
[0040] -The number...
example 3
[0044] According to the PHICH resources g0 and g1 that can be scheduled in the uplink scheduling grant set under the current TTI corresponding to k0 and k1 obtained in the above example 2, select the available PHICH resources for the uplink scheduling grant with the least PHICH candidate set. PHICH resources.
[0045] For example, the PHICH resource that can be scheduled in the uplink scheduling grant set under the current TTI is G={g0,g1,...,g14}, the PHICH index pair corresponding to g0 is {p0_0,p1_0,...}, the index pair {p0_0,p1_0,...} The associated authorization number is {m0_0,m1_0,...}, select the PHICH index pair p0_0 corresponding to the minimum value m0_0 in {m0_0,m1_0,...}. Similarly, the PHICH index pair corresponding to g1 is {p0_1,p1_1,...}, and the number of authorizations associated with the index pair {p0_1,p1_1,...} is {m0_1,m1_1,...}, select {m0_1,m1_1,...} The PHICH index pair p0_1 corresponding to the minimum value m0_1.
[0046] When the number of grants m0_...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 