Unlock instant, AI-driven research and patent intelligence for your innovation.

A method and apparatus for resource allocation in a wireless communication network

A resource allocation and wireless communication system technology, applied in the field of resource allocation, can solve the problems of large PHICH, waste of PHICH resources, namely downlink resources, etc., and achieve the effect of reducing PHICH resources

Active Publication Date: 2018-03-06
ALCATEL LUCENT SHANGHAI BELL CO LTD
View PDF7 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, this PHICH resource allocation method in the prior art requires a large number of reserved PHICH resources, and in actual use, the number of schedulable grants under each TTI (Transmission Time Interval, transmission time interval) usually does not exceed 10 Therefore, the use of this PHICH resource allocation method in the prior art will waste a lot of PHICH resources, that is, downlink resources.

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • A method and apparatus for resource allocation in a wireless communication network
  • A method and apparatus for resource allocation in a wireless communication network
  • A method and apparatus for resource allocation in a wireless communication network

Examples

Experimental program
Comparison scheme
Effect test

example 1

[0033] For example, in the current TTI, the uplink scheduling grants in the pending scheduling grant set are {g_x1, g_x2,...,g_x15}, and the corresponding number of PHICH candidate sets is {k0, k1,...,k14}, if k0 and k1 are the smallest numbers among {k0,k1,...,k14}, that is, the number of PHICH candidate sets corresponding to k0 and k1 is the least, then the uplink scheduling grant set corresponding to k0 and k1 under the current TTI g_x1 and g_x2 are the uplink scheduling grants with the least PHICH candidate set in the current TTI.

[0034] In step S102, the base station acquires the PHICH resources that can be used by the uplink scheduling grant with the PHICH candidate set meeting the first predetermined condition.

[0035] Hereinafter, still taking the first predetermined condition that the PHICH candidate set is the least as an example, the base station acquires the PHICH resource that can be used by the uplink scheduling grant with the least PHICH candidate set.

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 corresponding PHICH candidate sets is {k0,k1,...,k14 }, if k0 and k1 are the smallest number among {k0,k1,...,k14}, that is, the number of PHICH candidate sets corresponding to k0 and k1 is the least, then the uplink scheduling grant under the current TTI corresponding to k0 and k1 The PHICH resources g0 and g1 that can be scheduled in the set are the available PHICH resources for the uplink scheduling grant with the least PHICH candidate set.

[0038] In step S103, the base station determines the PHICH resources whose number of associated grants satisfies the second predetermined condition from the PHICH resources available for the uplink scheduling grants with the PHICH candidate set satisfying the first predetermined condition.

[0039] Wherein, the second predetermined condition includes:

[0040]- The number of assoc...

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 uplink scheduling grant 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 The number of authorizations associated with {p0_0,p1_0,…} 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,…} PHICH index pair p0_1 corresponding to the minimum value m0_1.

[0046] When the number of grants m0_0...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The present invention discloses a PHICH resource allocation method and device, wherein the method includes: obtaining an uplink scheduling grant with a PHICH candidate set satisfying a first predetermined condition in a current transmission time interval from a pending scheduling grant set; obtaining The PHICH resources available for the uplink scheduling grant with the PHICH candidate set meeting the first predetermined condition; from the PHICH resources available for the uplink scheduling grant with the PHICH candidate set meeting the first predetermined condition, Determining the PHICH resource whose number of associated grants satisfies the second predetermined condition; assigning the PHICH resource whose number of associated grants satisfies the second predetermined condition to the uplink with the PHICH candidate set satisfying the first predetermined condition under the current transmission time interval Scheduling authorization. The present invention can reduce PHICH resources required for PUSCH transmission.

Description

technical field [0001] The present invention relates to wireless communication technology, in particular to a method and device for resource allocation in a wireless communication network. Background technique [0002] In the LTE (Long Term Evolution, long-term evolution) system, each PUSCH (Physical Uplink Shared Channel, Physical Uplink Shared Channel) transmission needs to allocate a corresponding PHICH (Physical HARQ Indicator Channel, Physical HARQ Indicator Channel) resource, which is used to send to the UE ( User Equipment, user equipment) feeds back HARQ (Hybrid Automatic Repeat Request, Hybrid Automatic Repeat Request) ACK (acknowledgement) / NACK (non-acknowledgement) information. Among them, the PUSCH is used for scheduling transmission of uplink data, and is the main uplink data bearing channel of the LTE physical layer, which can carry different transmission contents from the upper layer, including control information and user service information. The transmissio...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Patents(China)
IPC IPC(8): H04W72/04
CPCH04W72/29H04W72/541
Inventor 侯志华季利军
Owner ALCATEL LUCENT SHANGHAI BELL CO LTD