Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Method and system for allocating discrete resources

A resource allocation and resource technology, applied in the field of communication, can solve the problem of large system overhead of resource allocation signaling format, etc., and achieve the effect of realizing overhead and flexibility, low overhead, and easy implementation

Inactive Publication Date: 2011-07-13
ZTE CORP
View PDF2 Cites 8 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0008] The purpose of the present invention is to provide a discrete resource allocation method and system to solve the problem in the related art that the discrete resource allocation method needs to add a new resource allocation signaling format or the system overhead is large

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
  • Method and system for allocating discrete resources
  • Method and system for allocating discrete resources
  • Method and system for allocating discrete resources

Examples

Experimental program
Comparison scheme
Effect test

Embodiment

[0053] In this embodiment, the number of clusters allocated to a discrete resource is equal to 2 as an example, combined with Figure 3 to Figure 5 The above discrete resource allocation method is described in detail. Assuming that there are N resource blocks that can be allocated, the method includes the following steps:

[0054] Step 1, the system (specifically, it can be a base station) is configured with 4 coprime numbers, set as m 1 , m 2 , m 3 , m 4 . In this example, D 1 = 0; D 2 = 0; D 3 = 0; D 4 = 0, then [0, m 1 ) represents the dynamic range of the starting point of cluster 1; [1, m 2 ] represents the dynamic range of the length of cluster 1; [0, m 3 ) represents the dynamic range of the starting point of cluster 2; [1, m 4 ] represents the dynamic range of the length of cluster 2.

[0055] Step 2, assuming that in a certain resource allocation, the starting point of allocated cluster 1 is x 1 ,D 1 ≤x 1 1 +D 1 , with length L 1 ,D 2 ≤ L 1 -12 +D ...

example 1

[0071] In this example, suppose D 1 = 0; D 2 = 0; D 3 = 0; D 4 =0, system bandwidth=25RB, the number of RBs available for resource allocation is also 25, and the minimum unit of resource allocation in this example is RB. The starting point of the resource allocation of the two clusters adopts the following method, that is, the starting point x of cluster 1 1 The corresponding resource block index is x 1 , the starting point x of cluster 2 2 The corresponding resource block index is N-1-x 2 , further m 1 , m 2 , m 3 , m 4 The value is: m 1 =14,m 2 =9,m 3 =13,m 4 =5, at this time the resource allocation of the two clusters satisfies the following relationship:

[0072] The first RB index of cluster 1 ranges from [RB 0 to RB 13]; the number of RBGs allowed to be allocated in cluster 1 can be 1 to 9;

[0073] The first RB index range of cluster 2 is [RB12~RB24], and the number of RBGs allowed to be allocated by cluster 2 can be 1~5.

[0074] Assuming that the two c...

example 2

[0081] In this example, suppose D 1 = 0; D 2 = 0; D 3 = 0; D 4 = 0, system bandwidth = 50 RB, according to the existing standard, the number of RBGs available for resource allocation is 17, and the smallest unit of resource allocation in this example is RBG. The starting point of the resource allocation of the two clusters adopts the following method, that is, the starting point x of cluster 1 1 The corresponding resource block index is x 1 , the starting point x of cluster 2 2 The corresponding resource block index is x 2 , further m 1 , m 2 , m 3 , m 4 The value is: m 1 =19,m 2 = 3, m 3 =17,m 4 = 2, at this time the resource allocation of the two clusters satisfies the following relationship:

[0082] The range of the first RB index of cluster 1 is [RBG0~RBG16]; the number of RBs allowed to be allocated in cluster 1 can be 1~3;

[0083] The first RB index range of cluster 2 is [RBG0~RBG16], and the number of RBs allowed to be allocated by cluster 2 can be 1~2....

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 invention discloses a method and system for allocating discrete resources. The method comprises the following steps: carrying out joint coding on allocated preset parameters of multiple clusters, and sending the joint coding result to a receiving terminal, wherein the preset parameters comprise the starting point and length of each cluster in the multiple clusters; and calculating the allocated preset parameters of the multiple clusters by the receiving terminal according to the joint coding result. The method and system provided by the invention are convenient to realize, are low in cost and can be used for achieving the balance between the cost and flexibility of the resource allocation through reasonable allocation of the number and size of coprime numbers.

Description

technical field [0001] The present invention relates to the communication field, in particular to a discrete resource allocation method and system. Background technique [0002] The uplink of the Long term evolution system (LTE for short) adopts the Single Carrier-Frequency Division Multiple Access (Single Carrier-Frequency Division Multiple Access, SC-FDMA for short) technology to improve the power amplifier efficiency of the terminal. Correspondingly, in terms of resource allocation, only continuous resource allocation is allowed. The advantage of this allocation is that the overhead is relatively small, and the disadvantage is that the flexibility of scheduling is limited, which also affects the acquisition of frequency diversity gain to a certain extent. [0003] In the optimized LTE-Advanced system, the power amplifier requirements for the terminal are reduced by using small coverage cells, and the system allows uplink discrete resource allocation, thereby improving the...

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
IPC IPC(8): H04W72/04
Inventor 夏树强米德忠梁春丽
Owner ZTE CORP
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com