CN102123499A - Method and system for allocating discrete resources - Google Patents

Method and system for allocating discrete resources Download PDF

Info

Publication number
CN102123499A
CN102123499A CN2010100031478A CN201010003147A CN102123499A CN 102123499 A CN102123499 A CN 102123499A CN 2010100031478 A CN2010100031478 A CN 2010100031478A CN 201010003147 A CN201010003147 A CN 201010003147A CN 102123499 A CN102123499 A CN 102123499A
Authority
CN
China
Prior art keywords
bunch
bunches
mod
resource
starting point
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN2010100031478A
Other languages
Chinese (zh)
Other versions
CN102123499B (en
Inventor
夏树强
米德忠
梁春丽
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
ZTE Corp
Original Assignee
ZTE Corp
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by ZTE Corp filed Critical ZTE Corp
Priority to CN201010003147.8A priority Critical patent/CN102123499B/en
Publication of CN102123499A publication Critical patent/CN102123499A/en
Application granted granted Critical
Publication of CN102123499B publication Critical patent/CN102123499B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Landscapes

  • Compression, Expansion, Code Conversion, And Decoders (AREA)

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

Discrete resource allocation methods and system
Technical field
The present invention relates to the communications field, in particular to a kind of discrete resource allocation methods and system.
Background technology
Long evolving system (Long term evolution, abbreviate LTE as) up link adopts is that single carrier-frequency division multiplexing multiple access (Single Carrier-Frequency DivisionMultiple Access abbreviates SC-FDMA as) technology improves the power amplification efficiency of terminal.Accordingly, in resource allocation, also only allow continuous resource allocation, the advantage of this distribution is that expense is smaller, and shortcoming is that the flexibility of scheduling is restricted, and has also influenced the acquisition of frequency diversity gain to a certain extent.
In the LTE-Advanced system that optimizes, reduce power amplifier requirement by adopting little coverage cell, and this system allows the discrete resource allocation of up link, thereby improves the flexibility and the systematic function of resource allocation to terminal.Fig. 1 shows the diagrammatic representation of discontinuous resource allocation, as can be seen from Figure 1, for certain terminal distribution the polylith resource is arranged, and this polylith resource is distributed in the system bandwidth with discrete form.
In the correlation technique, carry out the discrete resource allocation of up link by following dual mode:
1, reuses the resource allocation methods of existing LTE up link.
In the up link of LTE, owing to be that continuous resource distributes, for the consideration of paring down expenses, the LTE system encodes to the initial index of the Resource Block of Resources allocation, resource block number, promptly, the initial index of Resource Block, resource block number and a unique decimal number are mapped, and the resource block number that supposing the system can be used to distribute is N, and then the needed expense of this resource allocation is
Figure G2010100031478D00021
Bit.Suppose that the resource of distributing is 2 discrete bunch (bunch be 1 or a plurality of continuous Resource Block), then reuse above-mentioned resource allocation methods and get final product for twice that this moment, the expense of needs was:
Figure G2010100031478D00022
Be that expense can be along with discrete bunch the linear increase of number.For the LTE/LTE-Advanced system, the signaling format of resource allocation has multiple, terminal is to determine it is that a kind of signaling format by the mode of blind Detecting, if adopt above-mentioned discrete resource allocation methods, must need to increase new resource allocation signal form, this can cause the increase of terminal blind Detecting complexity, and processing time of terminal has also been proposed very high requirement.
2, adopt the mode of bitmap (position mapping) to realize discrete resource allocation, of this sort mode has been adopted in the resource allocation of LTE system down link.The resource block number that supposing the system can be used to distribute is N, and then this scheme can be described as: use N bit, each bit is all corresponding with a Resource Block.For the Resource Block that will distribute, putting this bit is 1, is 0 otherwise put this bit.The advantage of this scheme is can reuse LTE system existing resources to distribute form, can not increase the blind Detecting complexity; In addition, can also support arbitrarily resource allocation flexibly.The shortcoming of this scheme is that expense is bigger.Consider the realization of physical end, consider it is more rational by combined factors such as 2 discrete bunch performance gains that can obtain of this scheme primary distribution, implementation complexity.Therefore, compare with the actual needs of resource allocation, the expense of this scheme is bigger.
Summary of the invention
The object of the present invention is to provide a kind of discrete resource allocation methods and system, discrete resource allocation methods need increase new resource allocation signal form or the bigger problem of overhead in the correlation technique to solve.
One aspect of the present invention provides a kind of discrete resource allocation methods, comprise: a plurality of bunches the predefined parameter that distributes is carried out combined coding, and the combined coding result is sent to receiving terminal, wherein, predefined parameter comprises the starting point and the length of each bunch in a plurality of bunches; Receiving terminal is according to combined coding a plurality of bunches predefined parameter of dispensed as a result.
Another aspect of the present invention provides a kind of discrete resource allocation system, comprise transmitting terminal and receiving terminal, wherein, transmitting terminal comprises: the combined coding module, be used for a plurality of bunches the predefined parameter that distributes is carried out combined coding, wherein, predefined parameter comprises the starting point and the length of each bunch in a plurality of bunches; Sending module is used for sending the combined coding result to receiving terminal; Receiving terminal comprises: receiver module is used to receive the combined coding result; The combined decoding module is used for according to combined coding a plurality of bunches predefined parameter of dispensed as a result.
By the present invention, employing is carried out combined coding and coding result is sent to receiving terminal a plurality of bunches the starting point and the length of distributing, receiving terminal calculates the starting point and the length of each bunch in a plurality of bunches of distribution from the coding result that receives, solve discrete resource allocation methods and need increase new resource allocation signal form or the bigger problem of overhead, the coding of transmitting terminal and the decode procedure of receiving terminal are simpler, be convenient to realize, and expense is less, by the number and the size of reasonable disposition mutual prime rwmber, can realize the balance of resource allocation overhead and flexibility.
Description of drawings
Accompanying drawing described herein is used to provide further understanding of the present invention, constitutes the application's a part, and illustrative examples of the present invention and explanation thereof are used to explain the present invention, do not constitute improper qualification of the present invention.In the accompanying drawings:
Fig. 1 is the discrete resource allocation schematic diagram according to correlation technique;
Fig. 2 is the flow chart according to the discrete resource allocation methods of the embodiment of the invention;
Fig. 3 is according to the meaning of parameters schematic diagram under two bunches of situations of the embodiment of the invention;
Fig. 4 is the detail flowchart according to the transmitting terminal processing procedure of the embodiment of the invention;
Fig. 5 is the detail flowchart according to the receiving terminal processing procedure of the embodiment of the invention;
Fig. 6 is the structured flowchart according to the discrete resource allocation system of the embodiment of the invention;
Fig. 7 is the detailed block diagram according to the discrete resource allocation system of the embodiment of the invention.
Embodiment
Hereinafter will describe the present invention with reference to the accompanying drawings and in conjunction with the embodiments in detail.Need to prove that under the situation of not conflicting, embodiment and the feature among the embodiment among the application can make up mutually.
The embodiment of the invention provides a kind of discrete resource allocation methods, and Fig. 2 is the flow chart according to the discrete resource allocation methods of the embodiment of the invention, and as shown in Figure 2, this method may further comprise the steps:
Step S202 carries out combined coding to a plurality of bunches the predefined parameter that distributes, and the combined coding result is sent to receiving terminal, and wherein, predefined parameter comprises the starting point and the length of each bunch in a plurality of bunches;
Step S204, receiving terminal is according to combined coding a plurality of bunches predefined parameter of dispensed as a result.
Said method is a plurality of bunches starting point and the unified combined coding that carries out of length (starting point and the length that comprise each bunch in a plurality of bunches) that will distribute, obtain result's (metric numeral) of a combined coding, encode with starting point and the length that adopt in the correlation technique to each bunch, obtain with distribute bunch the identical coding result of number in essence difference is arranged, the coding of transmitting terminal and the decoding of receiving terminal are fairly simple, in addition, compare with the mode of the discrete resource that adopts the bitmap mode to represent in the correlation technique to distribute, the expense that needs is littler, the resource that this method is particularly useful for distributing is limited discrete bunch, and (the number of clusters order is fewer, such as being 2,3,4) situation.
Need to prove that above-mentioned bunch is defined as: 1 or a plurality of continuous Resource Block, these Resource Block can be continuously on the physical significance continuously, also can be on the logical meaning continuously.The resource that can be understood as distribution continuously on the physical significance is continuous on the dimension of time and/or frequency; The Resource Block that can be understood as distribution continuously on the logical meaning is a virtual resource blocks, and these virtual resource blocks are continuous on index.These virtual resource blocks and real Physical Resource Block have fixing mapping relations, and therefore continuous virtual resource blocks corresponding physical Resource Block may be discontinuous.
Preferably, the above-mentioned combined coding and the computational process of receiving terminal are carried out in the following manner, but are not limited to following mode:
Mode one:
A plurality of bunches the predefined parameter that needs are distributed carries out combined coding and comprises: calculate
Figure G2010100031478D00051
Wherein, P is a plurality of bunches a quantity, x iBe i in a plurality of bunches bunch starting point, L iBe i bunch length,
Figure G2010100031478D00052
M=m 1* ... * m 2j-1* m 2j* ... .*m 2P, K iBe satisfied
Figure G2010100031478D00053
Minimum positive integer, m 1... m 2PBe 2P mutual prime rwmber of system configuration, [D 2i-1, m 2i-1+ D 2i-1) be x iScope, [D 2i+ 1, m 2i+ D 2i] be L iScope, D 1... D 2PBe predefined nonnegative integer, i is the positive integer smaller or equal to P;
Receiving terminal according to combined coding as a result a plurality of bunches predefined parameter of dispensed comprise: calculate i bunch starting point r 2i-1=mod (Y, m 2i-1)+D 2i-1, i bunch length r 2i=mod (Y, m 2i)+D 2i+ 1.
Under specific circumstances, mode one can be carried out certain simplification to reduce expense, comprises following two kinds of situations and processing:
Under the identical situation of the length of A, each bunch in a plurality of bunches.
A plurality of bunches the predefined parameter that needs are distributed carries out combined coding and comprises: calculate Y=mod[(x 1-D 1) * c 1+ ...+(x i-D i) * c i+ ...+(x P-D P) * c P+ (L-1-D P+1) * c P+1, M], wherein, P is a plurality of bunches a quantity, x iBe i in a plurality of bunches bunch starting point, L is the length of each bunch,
Figure G2010100031478D00061
M=m 1* ... * m i* ... .*m P+1, K iBe satisfied
Figure G2010100031478D00062
Minimum positive integer, m 1... m P+1Be P+1 mutual prime rwmber of system configuration, [D i, m i+ D i) be x iScope (m i, i=1,2...P represent the dynamic range of i bunch starting point), [D P+1+ 1, m P+1+ D P+1] be the scope (m of L P+1Expression distribute bunch the dynamic range of length), D 1... D P+1Be predefined nonnegative integer, i is smaller or equal to the P positive integer;
Receiving terminal according to combined coding as a result a plurality of bunches predefined parameter of dispensed comprise: calculate i bunch starting point r i=mod (Y, m i)+D i, the length r of each bunch P+1=mod (Y, m P+1)+D P+1+ 1.
Distribute for needs under the situation of individual bunch of P, only need to generate P+1 mutual prime rwmber and get final product, and expense is significantly less than the situation of an above-mentioned generation 2P mutual prime rwmber.
B, in a plurality of bunches bunch with respect to bunch previous bunch original position have under the situation of fixed bias.
A plurality of bunches the predefined parameter that needs are distributed carries out combined coding and comprises: calculate Y=mod[(L 1-1-D 1) * c 1+ ...+(L i-1-D i) * c i+ ...+(L P-1-D 2) * c 2+ (x-D P+1) * c P+1, M], wherein, P is a plurality of bunches a quantity, the starting point of first bunch during x is a plurality of bunches, L iBe i in a plurality of bunches bunch length,
Figure G2010100031478D00063
M=m 1* ... * m i* ... .*m P+1, K iBe satisfied
Figure G2010100031478D00071
Minimum positive integer, m 1... m P+1Be P+1 mutual prime rwmber of system configuration, [D P+1, m P+1+ D P+1) be the scope (m of x P+1The dynamic range of representing the starting point of first bunch), [D i+ 1, m i+ D i] be L iScope ([1, m i], i=1,2...P represent the dynamic range of i bunch length), D 1... D P+1Be predefined nonnegative integer, i is smaller or equal to the P positive integer;
Receiving terminal according to combined coding as a result a plurality of bunches predefined parameter of dispensed comprise: calculate i bunch starting point r i=mod (Y, m i)+D i, the length r of each bunch P+1=mod (Y, m P+1)+D P+1+ 1.
Distribute for needs under the situation of individual bunch of P, only need to generate P+1 mutual prime rwmber and get final product, and expense is significantly less than the situation of an above-mentioned generation 2P mutual prime rwmber.
Preferably, under the situation of P=2, the 1st bunch starting point x 1Corresponding Resource Block index is x 1, the 2nd bunch starting point x 2Corresponding Resource Block index is N-1-x 2Under the situation of P=3, the 1st bunch starting point x 1Corresponding Resource Block index is x 1, the 2nd bunch starting point x 2Corresponding Resource Block index is
Figure G2010100031478D00072
3rd bunch starting point x 3Corresponding Resource Block index is N-1-x 3, wherein, N is the Resource Block sum that can be used for distributing.The index of above-mentioned Resource Block is respectively: 0,1, and 2...N-1.By this method, under the same asset assignment overhead, can support the more resources forms of distribution.
Preferably, predefined parameter comprises the number of the predetermined resource that the starting point of the predetermined resource of each bunch in a plurality of bunches and each bunch comprise, and wherein, it is one of following that predetermined resource comprises: the Resource Block group that the Resource Block of Resource Block, predetermined number is formed.That is to say that the continuous resource piece (logic is continuous or physics is continuous) of some is formed the Resource Block group, and with the least unit of Resource Block group as resource allocation, above-mentioned mode is suitable equally.
Mode two:
A plurality of bunches the predefined parameter that needs are distributed carries out before the combined coding, the resource that will can be used for distributing is divided into a plurality of resource set, selects to distribute to P bunch P resource set from a plurality of resource set, and with P resource set notice receiving terminal, wherein, P is a plurality of bunches a quantity;
A plurality of bunches the predefined parameter that needs are distributed carries out combined coding and comprises: a plurality of bunches the predefined parameter that needs are distributed carries out combined coding and comprises: calculate Wherein, x iBe the starting point of the resource set of bunch correspondence of i in a plurality of bunches, L iBe i bunch length,
Figure G2010100031478D00082
M=m 1* ... * m 2j-1* m 2j* ... .*m 2P, K iBe satisfied
Figure G2010100031478D00083
Minimum positive integer, m 1... m 2PBe 2P mutual prime rwmber of system configuration, [D 2i-1, m 2i-1+ D 2i-1) be x iScope, [D 2i+ 1, m 2i+ D 2i] be L iScope, D 1... D 2PBe predefined nonnegative integer, i is the positive integer smaller or equal to P;
Receiving terminal according to combined coding as a result a plurality of bunches predefined parameter of dispensed comprise: calculate i bunch starting point r 2i-1=mod (Y, m 2i-1)+D 2i-1, i bunch length r 2i=mod (Y, m 2i)+D 2i+ 1.
In the mode two, suppose that the number of clusters order that distributes is P, then at first pass through
Figure G2010100031478D00084
The residing resource set of the resource position that the bit information indication distributes, and then in P the resource set of selecting, adopt with mode one similar method and indicate the P bunch of resource of in each resource set, distributing, wherein, M is the number of the resource set of the identical or different size that is divided into of resource.
In the above-mentioned dual mode, be by bunch starting point and bunch length indicate concrete resource that each bunch distribute.Bunch starting point can with bunch in the index of first or last Resource Block/resource group represent, bunch length can with bunch in Resource Block/resource group number represent, as another possible implementation, also can by bunch starting point and the terminal concrete resource of indicating each bunch to distribute.
Preferably, the mutual prime rwmber of system configuration is configured one of in the following manner:
Method 1: static configuration, such as in standard, setting.
Method 2: semi-static configuration, notify terminal such as system by high-level signaling.These parameters can be passed through the semi-static change of high-level signaling.
Method 3: static configuration/semi-static configuration mixes with dynamic-configuration, and such as the multiple possibility of the semi-static configuration/static configuration of system, it is any utilizing physical layer signaling dynamically to indicate again.
Preferably, the combined coding result is sent to receiving terminal comprises: convert the combined coding result to binary bits information, and be sent to receiving terminal; As a result before a plurality of bunches the predefined parameter of dispensed, receiving terminal becomes metric combined coding result with the binary bits information translation that receives to receiving terminal according to combined coding.
Embodiment
It is example that this embodiment equals 2 with the number of clusters of discrete resource allocation once, describes above-mentioned discrete resource allocation methods in detail in conjunction with Fig. 3 to Fig. 5.Suppose to have the individual Resource Block that can distribute of N, then this method may further comprise the steps:
Step 1,4 relatively prime numbers of system's (particularly, can be the base station) configuration are made as m 1, m 2, m 3, m 4In the present embodiment, D 1=0; D 2=0; D 3=0; D 4=0, and then [0, m 1) dynamic range of starting point of expression bunch 1; [1, m 2] dynamic range of length of expression bunch 1; [0, m 3) dynamic range of starting point of expression bunches 2; [1, m 4] dynamic range of length of expression bunches 2.
Step 2 is supposed in certain resource allocation, and bunch 1 starting point of distribution is x 1, D 1≤ x 1＜m 1+ D 1, length is L 1, D 2≤ L 1-1＜m 2+ D 2Bunches 2 the starting point of distributing is x 2, D 3≤ x 2＜m 3+ D 3, length is L 2, D 4≤ L 2-1＜m 4+ D 4, wherein, D 1, D 2, D 3, D 4Be the constant all known of transmitting terminal, receiving terminal and be nonnegative integer, in the present embodiment, D 1=0; D 2=0; D 3=0; D 4=0.The schematic diagram of foregoing description as shown in Figure 3.After then carrying out resource allocation, the processing of transmitting terminal comprises as shown in Figure 4:
Step 21, transmitting terminal determines that according to resource allocation information the starting point of two bunches of resources is respectively x 1, x 2, length is respectively L 1, L 2
Step 22 is according to the relatively prime parameter m of system configuration 1, m 2, m 3And m 4, and the c that calculates thus 1, c 2, c 3And c 4, to the starting point and the length information (x of above-mentioned each bunch resource 1, L 1, x 2, L 2) carry out combined coding, obtain Y, Y=mod[(x 1-D 1) * c 1+ (L 1-1-D 2) * c 2+ (x 2-D 3) * c 3+ (L 2-1-D 4) * c 4, M].This wherein, D 1=0; D 2=0; D 3=0; D 4=0, M, c 1, c 2, c 3, c 4, can obtain according to Chinese remainder theorem, can be specially: M=m 1* m 2* m 3* m 4,
Figure G2010100031478D00101
Wherein, K iBe satisfied
Figure G2010100031478D00102
Smallest positive integral.
Step 23 converts Y to corresponding binary bits information, by prior art these bits is encoded, is sent after the processing such as modulation.
Step 3, the processing of receiving terminal comprises as shown in Figure 5:
Step 31, receiver is handled as after demodulation, the decoding by some receivers, obtains binary bits information.It can obtain resource allocation information in the following way: above-mentioned binary bits is converted to 10 system numbers, establishes this number and equal Z, need to prove, and under the situation of not considering to transmit the error of bringing, Z=Y.
Step 32, according to Z, m 1, m 2, m 3, m 4Calculate the starting point and the length information r of two bunches of resources 1, r 2, r 3, r 4, wherein,
r 1＝mod(Z，m 1)+D 1；
r 2＝mod(Z，m 2)+1+D 2；
r 3＝mod(Z，m 3)+D 3；
r 4＝mod(Z，m 4)+1+D 4；
r 1Bunch 1 the starting point that expression distributes; r 2Bunch 1 the length that expression distributes; r 3Bunches 2 the starting point that expression distributes; r 4Bunches 2 the length that expression distributes.
Step 33, according to the resource allocation information that obtains, UE carries out the upstream discontinuous resource allocation.
Above-mentioned resource allocation methods can expand to distribution greater than 2 bunches situation, equals to distribute 2 times in number of clusters order as long as satisfy the number of the relatively prime number of system's needs configuration.
Below by instantiation the respective handling process of above-mentioned discrete resource allocation methods is described.
Example 1
In this example, suppose D 1=0; D 2=0; D 3=0; D 4=0, system bandwidth=25RB, the RB number that can be used for resource allocation also is 25, the resource allocation minimum unit of this example is RB.The starting point of two bunches of resource allocations is adopted in the following method, that is, and and bunch 1 starting point x 1Corresponding Resource Block index is x 1, bunches 2 starting point x 2Corresponding Resource Block index is N-1-x 2, further m 1, m 2, m 3, m 4Value be: m 1=14, m 2=9, m 3=13, m 4=5, this moment, two bunches resource allocation conditions satisfied following relation:
The scope of first RB index of bunch 1 is [RB 0～RB 13]; The RBG number that allows in bunch 1 to distribute can be 1～9;
First RB index range of bunches 2 is [RB12～RB24], and bunch 2 RBG numbers that allow to distribute can be 1～5.
Suppose that the base station is that two bunches of resources that UE distributes are [RB2～RB5] and [RB17～RB21], according to distribution method of the present invention and top parameter configuration, bunch 1 the initial index of resource is 2, resource size is 4, bunches 2 the initial index of resource is 3, resource size is 5, according to the present invention above-mentioned parameter is carried out combined coding and gets Y=mod (x 1* c 1+ (L 1-1) * c 2+ x 2* c 3+ (L 2-1) * c 4, M), C in this formula 1=5265, C 2=910, C 3=6930, C 4=3276, M=8190 can get Y=6204 thus.
Because the information behind the combined coding is smaller or equal to M, the bit number that therefore above-mentioned resource allocation methods needs can adopt
Figure G2010100031478D00121
Bit is represented.
Y is converted to corresponding binary bits information, by prior art as these bits being encoded, sending after the processing such as modulation.
At receiving terminal, receiver is handled as after demodulation, the decoding by some receivers, obtains binary bits information, this binary bits is converted to 10 systems counts Z, does not consider to transmit the error of bringing, i.e. Z=Y herein.
According to Z, m 1, m 2, m 3, m 4Calculate x1, L1, x2, L2:
According to these information, UE just can carry out correct resource distribution.
Example 2
In this example, suppose D 1=0; D 2=0; D 3=0; D 4=0, system bandwidth=50RB, according to existing standard, the RBG number that can be used for resource allocation is 17, the resource allocation minimum unit of this example is RBG.The starting point of two bunches of resource allocations is adopted in the following method, i.e. bunch 1 starting point x 1Corresponding Resource Block index is x 1, bunches 2 starting point x 2Corresponding Resource Block index is x 2, further m 1, m 2, m 3, m 4Value be: m 1=19, m 2=3, m 3=17, m 4=2, this moment, two bunches resource allocation conditions satisfied following relation:
The scope of first RB index of bunch 1 is [RBG0～RBG16]; The RB number that allows in bunch 1 to distribute can be 1～3;
First RB index range of bunches 2 is [RBG0～RBG16], and bunch 2 RB numbers that allow to distribute can be 1～2.
Suppose that the base station is that two bunches of resources that UE distributes are [RBG1～RBG3] and [RBG13～RBGG14], according to distribution method of the present invention and top parameter configuration, bunch 1 the initial index of resource is 1, resource size is 3, bunches 2 the initial index of resource is 13, resource size is 2, according to the present invention above-mentioned parameter is carried out combined coding and gets Y=mod (x 1* c 1+ (L 1-1) * c 2+ x 2* c 3+ (L 2-1) * c 4, M), C in this formula 1=1122, C 2=646, C 3=1140, C 4=969, M=1938 can get Y=761 thus.
Because the information behind the combined coding is smaller or equal to M, the bit number that therefore above-mentioned resource allocation methods needs can adopt Bit is represented.
Y is converted to corresponding binary bits information, by prior art as these bits being encoded, sending after the processing such as modulation.
At receiving terminal, receiver is handled as after demodulation, the decoding by some receivers, obtains binary bits information, this binary bits is converted to 10 systems counts Z, does not consider to transmit the error of bringing, i.e. Z=Y herein.
According to Z, m 1, m 2, m 3, m 4Calculate x1, L1, x2, L2:
Figure G2010100031478D00141
According to these information, UE just can carry out correct resource distribution.
Example 3
In this example, suppose D 1=0; D 2=0; D 3=0; D 4=0, system bandwidth=100RB, according to existing standard, the RBG number that can be used for resource allocation is 25, the resource allocation minimum unit of this example be RBG. further suppose to distribute bunch number be 3, and the resource size of each bunch is identical.In order to carry out 3 bunches resource distribution, then need to determine this starting point index of 3 bunches and bunch length, therefore, need definite 4 parameters.The starting point of three bunches of resource allocations is adopted in the following method, i.e. bunch 1 starting point x 1Corresponding Resource Block index is x 1, bunches 2 starting point x 2Corresponding Resource Block index is
Figure G2010100031478D00142
Bunches 3 starting point x 3Corresponding Resource Block index is N-1-x 34 parameters are in this example: m 1=11, m 2=7, m 3=5, m 4=3.Like this, following relation is satisfied in 3 bunches resource allocation:
The scope of first RB index of bunch 1 is [RBG0～RBG10]; The RB number that allows in bunch 1 to distribute can be 1～3;
First RB index range of bunches 2 is [RBG9～RBG15], and RB numbers that allow to distribute in bunches 2 can be 1～3;
First RB index range of bunches 3 is [RBG20～RBG24], and RB numbers that allow to distribute in bunches 3 can be 1～3;
Suppose that the base station is that three bunches of resources that UE distributes are [RBG1～RBG2], [RBG12～RBGG13] and [RBG21～RBGG22].According to distribution method of the present invention and top parameter configuration, bunch 1 the initial index of resource is 1, and bunches 2 the initial index of resource is 3, and bunches 3 the initial index of resource is 2,, these three bunches of resources have identical length 2.According to the present invention above-mentioned parameter is carried out combined coding and get Y=mod (x 1* c 1+ x 2* c 2+ x 3* c 3+ (L-1) * c 4, M), C in this formula 1=210, C 2=330, C 3=231, C 4=385, M=1155 can get Y=892 thus.
Because the information behind the combined coding is smaller or equal to M, the bit number that therefore above-mentioned resource allocation methods needs can adopt
Figure G2010100031478D00151
Bit is represented.
Y is converted to corresponding binary bits information, by prior art as these bits being encoded, sending after the processing such as modulation.
At receiving terminal, receiver is handled as after demodulation, the decoding by some receivers, obtains binary bits information, this binary bits is converted to 10 systems counts Z, does not consider to transmit the error of bringing, i.e. Z=Y herein.
According to Z, m 1, m 2, m 3, m 4Calculate x1, x2, x3, L:
Figure G2010100031478D00152
According to these information, UE just can carry out correct resource distribution.
Example 4
In this example, suppose D 1=0; D 2=0; D 3=0; D 4=0, system bandwidth=50RB, according to existing standard, the RBG number that can be used for resource allocation is 17, the resource allocation minimum unit of this example is RBG.Further, distribute two bunches of resources in this example, first bunch of two bunches of resource used identical starting point index x, the Resource Block index of this starting point correspondence is x, and there is fixed bias in second bunch of relative first bunch of resource of resource, and this value is disposed by high level, this parameter value is 8RBG in this example, like this, the Resource Block index of second bunch starting point correspondence is 8+x, and the length of two bunches of resources is L 1And L 2Dispose three relatively prime parameter m according to the present invention 1, m 2And m 3Value be: m 1=7, m 2=3, m 3=5, this moment, first bunch the starting point index of resource was [RBG0～RBG6], and second bunch starting point index is [RBG8～RBG14], and bunch 1 length is [1～3], and bunches 2 length is [1～5].
Suppose that the base station is that two bunches of resources that UE distributes are [RBG2～RBG4] and [RBG10～RBGG13], according to distribution method of the present invention and top parameter configuration, bunch 1 the initial index of resource is 2, resource size is 3, bunches 2 resource size is 4, according to the present invention above-mentioned parameter is carried out combined coding and gets Y=mod (x*c 1+ (L 1-1) * c 2+ (L 2-1) * c 4, M), C in this formula 1=15, C 2=70, C 3=21, M=105 can get Y=23 thus.
Because the information behind the combined coding is smaller or equal to M, the bit number that therefore above-mentioned resource allocation methods needs can adopt Bit is represented.
Y is converted to corresponding binary bits information, by prior art as these bits being encoded, sending after the processing such as modulation.
At receiving terminal, receiver is handled as after demodulation, the decoding by some receivers, obtains binary bits information, this binary bits is converted to 10 systems counts Z, does not consider to transmit the error of bringing, i.e. Z=Y herein.
According to Z, m 1, m 2, m 3, m 4Calculate x, L1, L2:
Figure G2010100031478D00162
According to these information, UE just can carry out correct resource distribution.
Example 5
In this example, suppose D 1=0; D 2=0; D 3=0; D 4=0, system bandwidth=100RB, according to existing standard, the RBG number that can be used for resource allocation is 25, further above-mentioned resource is divided into 4 resource set, and wherein first resource set is made up of first RB of each RBG, second resource set is made up of second RB of each RBG, the 3rd resource set is made up of the 3rd RB of each RBG, and the 4th resource set is made up of the 4th RB of each RBG, comprises 25 RB like this in each resource set.This example hypothesis distribute bunch number be 2, the base station need be passed through like this
Figure G2010100031478D00171
Which two resource set is the resource that bit information indication UE distributes belong to.The resource that this example hypothesis UE distributes belongs to resource set 1 and resource set 3.Further, determine RB distribution condition in each resource set by 4 parameters, concrete indicating means adopts following form: i.e. bunch 1 starting point x 1Corresponding Resource Block index is x 1, length is L 1, bunches 2 starting point x 2Corresponding Resource Block index is x 2, length is L 24 parameters are in this example: m 1=25, m 2=3, m 3=23, m 4=2.Resource size in such bunch 1 is 3RB, and the resource size in bunches 2 is 2RB.
Suppose that the base station is that two bunches of resources that UE distributes are [RB5, RB9, RB13] and [RB46, RB50].According to distribution method of the present invention and top parameter configuration, bunch 1 is arranged in second resource set, and the initial index of resource is 1, and length is 3; Bunches 2 are arranged in the 3rd resource set, and the initial index of resource is 12, length 2.According to the present invention above-mentioned parameter is carried out combined coding and get Y=mod (x 1* c 1+ x 2* c 2+ x 3* c 3+ (L-1) * c 4, M), C in this formula 1=276, C 2=1150, C 3=300, C 4=1725, M=3450 can get Y=1001 thus.
Because the information behind the combined coding is smaller or equal to M, therefore above-mentioned resource allocation methods adds that the resource set indication information needs altogether
Figure G2010100031478D00172
Bit is represented.
Y is converted to corresponding binary bits information, 3 bit informations that add resource set indication by prior art as these bits being encoded, sending after the processing such as modulation.
At receiving terminal, receiver is handled as after demodulation, the decoding by some receivers, obtain binary bits information, can know two bunches of residing resource set index of resource by preceding 3 bit informations, further remaining binary bits is converted to 10 systems and counts Z, do not consider to transmit the error of bringing, i.e. Z=Y herein.
According to Z, m 1, m 2, m 3, m 4Calculate x1, L2, x2, L2:
Figure G2010100031478D00181
According to these information, UE just can carry out correct resource distribution.
Said method, two parameters of each bunch correspondence suppose that the number of clusters order that distributes is P, and system disposes the individual relatively prime parameter of 2P (disposing P+1 sometimes gets final product) at most and gets final product, and establishing 2P relatively prime parameter is m 1, m 2, m 3... m 2P, the expense of this programme is
Figure G2010100031478D00182
By reasonable disposition, can realize the balance of resource allocation overhead and flexibility, and the decode procedure of the coding of transmitting terminal and receiving terminal is all fairly simple, be convenient to realize.
The embodiment of the invention also provides a kind of discrete resource allocation system, this system is used to realize above-mentioned discrete resource allocation methods, Fig. 6 is the structured flowchart according to the discrete resource allocation system of the embodiment of the invention, as shown in Figure 6, this system comprises: transmitting terminal 61 and receiving terminal 65, wherein, transmitting terminal 61 comprises: combined coding module 62, be used for a plurality of bunches the predefined parameter that distributes is carried out combined coding, wherein, predefined parameter comprises the starting point and the length of each bunch in a plurality of bunches; Sending module 64 is connected in combined coding module 62, is used for sending the combined coding result to receiving terminal 65; Receiving terminal 65 comprises: receiver module 66 is used to receive described combined coding result; Combined decoding module 68 is connected in receiver module 66, is used for according to combined coding a plurality of bunches predefined parameter of dispensed as a result.
Fig. 7 is the detailed block diagram according to the discrete resource allocation system of the embodiment of the invention, and as shown in Figure 7, on the basis of Fig. 6, combined coding module 62 can comprise: the first coding submodule 701, it is used for calculating
Figure G2010100031478D00191
Wherein, P is a plurality of bunches a quantity, x iBe i in a plurality of bunches bunch starting point, L iBe i bunch length,
Figure G2010100031478D00192
M=m 1* ... * m 2j-1* m 2j* ... .*m 2P, K iBe satisfied
Figure G2010100031478D00193
Minimum positive integer, m 1... m 2PBe 2P mutual prime rwmber of system configuration, [D 2i-1, m 2i-1+ D 2i-1) be x iScope, [D 2i+ 1, m 2i+ D 2i] be L iScope, D 1... D 2PBe predefined nonnegative integer, i is the positive integer smaller or equal to P; Combined decoding module 68 can comprise: the first decoding submodule 702, it is used to calculate i bunch starting point r 2i-1=mod (Y, m 2i-1)+D 2i-1, i bunch length r 2i=mod (Y, m 2i)+D 2i+ 1.Combined coding module 62 can comprise: the second coding submodule 703, it is used for calculating under the identical situation of the length of each bunch of a plurality of bunches
Figure G2010100031478D00194
Wherein, P is a plurality of bunches a quantity, x iBe i in a plurality of bunches bunch starting point, L is the length of each bunch,
Figure G2010100031478D00195
M=m 1* ... * m i* ... .*m P+1, K iBe satisfied
Figure G2010100031478D00196
Minimum positive integer, m 1... m P+1Be P+1 mutual prime rwmber of system configuration, [D i, m i+ D i) be x iScope, [D P+1+ 1, m P+1+ D P+1] be the scope of L, D 1... D P+1Be predefined nonnegative integer, i is the positive integer smaller or equal to P; Combined decoding module 68 can comprise: the second decoding submodule 704, it is used for calculating i bunch starting point r under the identical situation of the length of each bunch of a plurality of bunches i=mod (Y, m i)+D i, the length r of each bunch P+1=mod (Y, m P+1)+D P+1+ 1.Combined coding module 62 can comprise: the 3rd coding submodule 705, its be used for a plurality of bunches bunch with respect to bunch previous bunch original position have under the situation of fixed bias, calculate Y=mod [(L 1-1-D 1) * c 1+ ...+(L i-1-D i) * c i+ ...+(L P-1-D 2) * c 2+ (x-D P+1) * c P+1, M], wherein, P is a plurality of bunches a quantity, the starting point of first bunch during x is a plurality of bunches, L iBe i in a plurality of bunches bunch length,
Figure G2010100031478D00201
M=m 1* ... * m i* ... .*m P+1, K iBe satisfied
Figure G2010100031478D00202
Minimum positive integer, m 1... m P+1Be P+1 mutual prime rwmber of system configuration, [D P+1, m P+1+ D P+1) be the scope of x, [D i+ 1, m i+ D i] be L iScope, D 1... D P+1Be predefined nonnegative integer, i is smaller or equal to the P positive integer; Combined decoding module 68 can comprise: the 3rd decoding submodule 706, it is used to calculate i bunch starting point r i=mod (Y, m i)+D i, the length r of each bunch P+1=mod (Y, m P+1)+D P+1+ 1.This system can also comprise: resource set is divided module 707 and resource set distribution module 708, and the resource that resource set division module 707 is used for can be used for distributing is divided into a plurality of resource set; Resource set distribution module 708 is connected in resource set and divides module 707, be used for selecting to distribute to P bunch P resource set from a plurality of resource set, and with P resource set notice receiving terminal, wherein, P is a plurality of bunches a quantity; Combined coding module 62 can comprise: the 4th coding submodule 709, be connected in resource set distribution module 708, and it is used for calculating Wherein, x iBe the starting point of the resource set of bunch correspondence of i in a plurality of bunches, L iBe i bunch length, M=m 1* ... * m 2j-1* m 2i* ... .*m 2P, K iBe satisfied
Figure G2010100031478D00205
Minimum positive integer, m 1... m 2PBe 2P mutual prime rwmber of system configuration, [D 2i-1, m 2i-1+ D 2i-1) be x iScope, [D 2i+ 1, m 2i+ D 2i] be L iScope, D 1... D 2PBe predefined nonnegative integer, i is the positive integer smaller or equal to P; Combined decoding module 68 can comprise: the 4th decoding submodule 710, it is used to calculate i bunch starting point r 2i-1=mod (Y, m 2i-1)+D 2i-1, i bunch length r 2i=mod (Y, m 2i)+D 2i+ 1.
Preferably, as shown in Figure 7, sending module 64 can comprise conversion submodule 711 and send submodule 712 that wherein, conversion submodule 711 is used for converting the combined coding result to binary bits information; Send submodule 712 and be connected in conversion submodule 711, be used for binary bits information is sent to receiving terminal; Receiver module 66 comprises: receive submodule 713, be used to receive binary bits information; Conversion submodule 714 is connected in and receives submodule 713, is used for the binary bits information translation is become metric combined coding result.
In sum, the decode procedure of the coding of transmitting terminal and receiving terminal is simpler in the discrete resource allocation methods that the embodiment of the invention provides, and be convenient to realize, and expense is less, by reasonable disposition, can realize the balance of resource allocation overhead and flexibility.
Obviously, those skilled in the art should be understood that, above-mentioned each module of the present invention or each step can realize with the general calculation device, they can concentrate on the single calculation element, perhaps be distributed on the network that a plurality of calculation element forms, alternatively, they can be realized with the executable program code of calculation element, thereby, they can be stored in the storage device and carry out by calculation element, and in some cases, can carry out step shown or that describe with the order that is different from herein, perhaps they are made into each integrated circuit modules respectively, perhaps a plurality of modules in them or step are made into the single integrated circuit module and realize.Like this, the present invention is not restricted to any specific hardware and software combination.
Be the preferred embodiments of the present invention only below, be not limited to the present invention, for a person skilled in the art, the present invention can have various changes and variation.Within the spirit and principles in the present invention all, any modification of being done, be equal to replacement, improvement etc., all should be included within protection scope of the present invention.

Claims (19)

1. a discrete resource allocation methods is characterized in that, comprising:
A plurality of bunches the predefined parameter that distributes is carried out combined coding, and the combined coding result is sent to receiving terminal, wherein, described predefined parameter comprises the starting point and the length of each bunch in described a plurality of bunches;
Described receiving terminal is according to the described combined coding described a plurality of bunches described predefined parameter of dispensed as a result.
2. method according to claim 1 is characterized in that,
A plurality of bunches the predefined parameter that needs are distributed carries out combined coding and comprises: calculate
Y = mod ( x 1 - D 1 ) * c 1 + ( L 1 - 1 - D 2 ) * c 2 + . . . + ( x i - D 2 i - 1 ) * c 2 i - 1 + ( L i - 1 - D 2 i ) * c 2 i + . . . + ( x P - D 2 P - 1 ) * c 2 P - 1 + ( L P - 1 - D 2 P ) * c 2 P , M
, wherein, P is described a plurality of bunches quantity, x iBe i in described a plurality of bunches bunch starting point, L iBe described i bunch length, c 2 i - 1 = M m 2 i - 1 * K 2 i - 1 , M=m 1* ... * m 2j-1* m 2j* ... .*m 2P, K iBe satisfied Mod ( M mi * K i , mi ) = 1 Minimum positive integer, m 1... m 2PBe 2P mutual prime rwmber of system configuration, [D 2i-1, m 2i-1+ D 2i-1) be x iScope, [D 2i+ 1, m 2i+ D 2i] be L iScope, D 1... D 2PBe predefined nonnegative integer, i is the positive integer smaller or equal to P;
Described receiving terminal according to described combined coding as a result the described a plurality of bunches described predefined parameter of dispensed comprise: calculate described i bunch starting point r 2i-1=mod (Y, m 2i-1)+D 2i-1, described i bunch length r 2i=mod (Y, m 2i)+D 2i+ 1.
3. method according to claim 2 is characterized in that, P=2, and,
In system bandwidth is 25 Resource Block, and the resource that is used to distribute comprises under the situation of 25 Resource Block m 1=14, m 2=9, m 3=13, m 4=5;
In system bandwidth is 50 Resource Block, and the resource that is used to distribute comprises under the situation of 17 Resource Block groups m 1=19, m 2=3, m 3=17, m 4=2.
4. method according to claim 1 is characterized in that, under the identical situation of the length of each bunch in described a plurality of bunches,
A plurality of bunches the predefined parameter that needs are distributed carries out combined coding and comprises: calculate Y=mod[(x 1-D 1) * c 1+ ...+(x i-D i) * c i+ ...+(x P-D P) * c P+ (L-1-D P+1) * c P+1, M], wherein, P is described a plurality of bunches quantity, x iBe i in described a plurality of bunches bunch starting point, L is the length of described each bunch, c i = M m i * K i , M=m 1* ... * m i* ... .*m P+1, K iBe satisfied Mod ( M m i * K i , mi ) = 1 Minimum positive integer, m 1... m P+1Be P+1 mutual prime rwmber of system configuration, [D i, m i+ D i) be x iScope, [D P+1+ 1, m P+1+ D P+1] be the scope of L, D 1... D P+1Be predefined nonnegative integer, i is the positive integer smaller or equal to P;
Described receiving terminal according to described combined coding as a result the described a plurality of bunches described predefined parameter of dispensed comprise: calculate described i bunch starting point r i=mod (Y, m i)+D i, the length r of described each bunch P+1=mod (Y, m P+1)+D P+1+ 1.
5. method according to claim 4 is characterized in that, P=3, and be 100 Resource Block in system bandwidth, and the resource that is used to distribute comprises under the situation of 25 Resource Block groups m1= 11, m2= 7, m3= 5, m4= 3
6. method according to claim 1 is characterized in that, previous bunch the original position bunch with respect to described bunch in described a plurality of bunches has under the situation of fixed bias,
A plurality of bunches the predefined parameter that needs are distributed carries out combined coding and comprises: calculate Y=mod[(L 1-1-D 1) * c 1+ ...+(L i-1-D i) * c i+ ...+(L P-1-D 2) * c 2+ (x-D P+1) * c P+1, M], wherein, P is described a plurality of bunches quantity, x is the starting point of first bunch in described a plurality of bunches, L iBe i in described a plurality of bunches bunch length, c i = M m i * K i , M=m 1* ... * m i* ... .*m P+1, K iBe satisfied Mod ( M m i * K i , mi ) = 1 Minimum positive integer, m 1... m P+1Be P+1 mutual prime rwmber of system configuration, [D P+1, m P+1+ D P+1) be the scope of x, [D i+ 1, m i+ D i] be L iScope, D 1... D P+1Be predefined nonnegative integer, i is smaller or equal to the P positive integer;
Described receiving terminal according to described combined coding as a result the described a plurality of bunches described predefined parameter of dispensed comprise: calculate described i bunch starting point r i=mod (Y, m i)+D i, the length r of described each bunch P+1=mod (Y, m P+1)+D P+1+ 1.
7. method according to claim 6 is characterized in that, P=2, and be 50 Resource Block in system bandwidth, and the resource that is used to distribute comprises under the situation of 17 Resource Block groups m 1=7, m 2=3, m 3=5.
8. according to each described method in the claim 2 to 7, it is characterized in that, under the situation of P=2, the 1st bunch starting point x 1Corresponding Resource Block index is x 1, the 2nd bunch starting point x 2Corresponding Resource Block index is N-1-x 2Under the situation of P=3, the 1st bunch starting point x 1Corresponding Resource Block index is x 1, the 2nd bunch starting point x 2Corresponding Resource Block index is 3rd bunch starting point x 3Corresponding Resource Block index is N-1-x 3, wherein, N is the Resource Block sum that can be used for distributing.
9. according to each described method in the claim 2 to 7, it is characterized in that, described predefined parameter comprises the starting point of the predetermined resource of each bunch in described a plurality of bunches and the number of the predetermined resource that described each bunch comprises, wherein, described predetermined resource comprises one of following: the Resource Block group that the Resource Block of Resource Block, predetermined number is formed.
10. method according to claim 1 is characterized in that,
A plurality of bunches the predefined parameter that needs are distributed carries out before the combined coding, described method also comprises: the resource that will can be used for distributing is divided into a plurality of resource set, from described a plurality of resource set, select to distribute to P bunch P resource set, and notify described receiving terminal with a described P resource set, wherein, P is described a plurality of bunches quantity;
A plurality of bunches the predefined parameter that needs are distributed carries out combined coding and comprises: calculate
Y = mod ( x 1 - D 1 ) * c 1 + ( L 1 - 1 - D 2 ) * c 2 + . . . + ( x i - D 2 i - 1 ) * c 2 i - 1 + ( L i - 1 - D 2 i ) * c 2 i + . . . + ( x P - D 2 P - 1 ) * c 2 P - 1 + ( L P - 1 - D 2 P ) * c 2 P , M
, wherein, x iBe the starting point of the resource set of bunch correspondence of i in described a plurality of bunches, L iBe described i bunch length, c 2 i - 1 = M m 2 i - 1 * K 2 i - 1 , M=m 1* ... * m 2j-1* m 2j* ... .*m 2P, K iBe satisfied Mod ( M mi * K i , mi ) = 1 Minimum positive integer, m 1... m 2PBe 2P mutual prime rwmber of system configuration, [D 2i-1, m 2i-1+ D 2i-1) be x iScope, [D 2i+ 1, m 2i+ D 2i] be L iScope, D 1... D 2PBe predefined nonnegative integer, i is the positive integer smaller or equal to P;
Described receiving terminal according to described combined coding as a result the described a plurality of bunches described predefined parameter of dispensed comprise: calculate described i bunch starting point r 2i-1=mod (Y, m 2i-1)+D 2i-1, described i bunch length r 2i=mod (Y, m 2i)+D 2i+ 1.
11. method according to claim 10 is characterized in that, P=2, and be 100 Resource Block in system bandwidth, and the resource that is used to distribute comprises under the situation of 25 Resource Block groups m 1=25, m 2=3, m 3=23, m 4=2.
12. according to each described method in the claim 2 to 7,10 to 11, it is characterized in that the mutual prime rwmber of described system configuration is configured one of in the following manner: the mixed configuration of static configuration, semi-static configuration, static configuration/semi-static configuration and dynamic-configuration.
13. method according to claim 1 is characterized in that,
Described combined coding result is sent to described receiving terminal to be comprised: convert described combined coding result to binary bits information, and be sent to described receiving terminal;
As a result before the described a plurality of bunches described predefined parameter of dispensed, described method also comprises: the described binary bits information translation that described receiving terminal will receive becomes metric described combined coding result to described receiving terminal according to described combined coding.
14. a discrete resource allocation system is characterized in that, comprises transmitting terminal and receiving terminal, wherein,
Described transmitting terminal comprises:
The combined coding module is used for a plurality of bunches the predefined parameter that distributes is carried out combined coding, and wherein, described predefined parameter comprises the starting point and the length of each bunch in described a plurality of bunches;
Sending module is used for sending the combined coding result to described receiving terminal;
Described receiving terminal comprises:
Receiver module is used to receive described combined coding result;
The combined decoding module is used for according to the described combined coding described a plurality of bunches described predefined parameter of dispensed as a result.
15. system according to claim 14 is characterized in that,
Described combined coding module comprises: the first coding submodule, the described first coding submodule is used for calculating
Y = mod ( x 1 - D 1 ) * c 1 + ( L 1 - 1 - D 2 ) * c 2 + . . . + ( x i - D 2 i - 1 ) * c 2 i - 1 + ( L i - 1 - D 2 i ) * c 2 i + . . . + ( x P - D 2 P - 1 ) * c 2 P - 1 + ( L P - 1 - D 2 P ) * c 2 P , M
, wherein, P is described a plurality of bunches quantity, x iBe i in described a plurality of bunches bunch starting point, L iBe described i bunch length, c 2 i - 1 = M m 2 i - 1 * K 2 i - 1 , M=m 1* ... * m 2j-1* m 2j* ... .*m 2P, K iBe satisfied Mod ( M mi * K i , mi ) = 1 Minimum positive integer, m 1... m 2PBe 2P mutual prime rwmber of system configuration, [D 2i-1, m 2i-1+ D 2i-1) be x iScope, [D 2i+ 1, m 2i+ D 2i] be L iScope, D 1... D 2PBe predefined nonnegative integer, i is the positive integer smaller or equal to P;
Described combined decoding module comprises: the first decoding submodule, the described first decoding submodule is used to calculate described i bunch starting point r 2i-1=mod (Y, m 2i-1)+D 2i-1, described i bunch length r 2i=mod (Y, m 2i)+D 2i+ 1.
16. according to claim 14 described systems, it is characterized in that,
Described combined coding module comprises: the second coding submodule, the described second coding submodule is used under the identical situation of the length of each described a plurality of bunches bunch, calculates Y = mod ( x 1 - D 1 ) * c 1 + . . . + ( x i - D i ) * c i + . . . + ( x P - D P ) * c P + ( L - 1 - D P + 1 ) * c P + 1 , M , Wherein, P is described a plurality of bunches quantity, x iBe i in described a plurality of bunches bunch starting point, L is the length of described each bunch, c i = M m i * K i , M=m 1* ... * m i* ... .*m P+1, K iBe satisfied Mod ( M m i * K i , mi ) = 1 Minimum positive integer, m 1... m P+1Be P+1 mutual prime rwmber of system configuration, [D i, m i+ D i) be x iScope, [D P+1+ 1, m P+1+ D P+1] be the scope of L, D 1... D P+1Be predefined nonnegative integer, i is the positive integer smaller or equal to P;
Described combined decoding module comprises: the second decoding submodule, the described second decoding submodule is used under the identical situation of the length of each described a plurality of bunches bunch, calculates described i bunch starting point r i=mod (Y, m i)+D i, the length r of described each bunch P+1=mod (Y, m P+1)+D P+1+ 1.
17. system according to claim 14 is characterized in that,
Described combined coding module comprises: the 3rd coding submodule, described the 3rd coding submodule is used for having under the situation of fixed bias described a plurality of bunches bunch of previous bunch original position with respect to described bunch, calculates Y=mod[(L 1-1-D 1) * c 1+ ...+(L i-1-D i) * c i+ ...+(L P-1-D 2) * c 2+ (x-D P+1) * c P+1, M], wherein, P is described a plurality of bunches quantity, x is the starting point of first bunch in described a plurality of bunches, L iBe i in described a plurality of bunches bunch length, c i = M m i * K i , M=m 1* ... * m i* ... .*m P+1, K iBe satisfied Mod ( M m i * K i , mi ) = 1 Minimum positive integer, m 1... m P+1Be P+1 mutual prime rwmber of system configuration, [D P+1, m P+1+ D P+1) be the scope of x, [D i+ 1, m i+ D i] be L iScope, D 1... D P+1Be predefined nonnegative integer, i is smaller or equal to the P positive integer;
Described combined decoding module comprises: the 3rd decoding submodule, described the 3rd decoding submodule is used to calculate described i bunch starting point r i=mod (Y, m i)+D i, the length r of described each bunch P+1=mod (Y, m P+1)+D P+1+ 1.
18. according to claim 14 described systems, it is characterized in that,
Described system also comprises: resource set is divided module and resource set distribution module, wherein,
The resource that described resource set division module is used for can be used for distributing is divided into a plurality of resource set;
Described resource set distribution module is used for selecting to distribute to P bunch P resource set from described a plurality of resource set, and notifies described receiving terminal with a described P resource set, and wherein, P is described a plurality of bunches quantity;
Described combined coding module comprises: the 4th coding submodule, described the 4th coding submodule is used for calculating
Y = mod ( x 1 - D 1 ) * c 1 + ( L 1 - 1 - D 2 ) * c 2 + . . . + ( x i - D 2 i - 1 ) * c 2 i - 1 + ( L i - 1 - D 2 i ) * c 2 i + . . . + ( x P - D 2 P - 1 ) * c 2 P - 1 + ( L P - 1 - D 2 P ) * c 2 P , M
, wherein, x iBe the starting point of the resource set of bunch correspondence of i in described a plurality of bunches, L iBe described i bunch length, c 2 i - 1 = M m 2 i - 1 * K 2 i - 1 , M=m 1* ... * m 2j-1* m 2j* ... .*m 2P, K iBe satisfied Mod ( M mi * K i , mi ) = 1 Minimum positive integer, m 1... m 2PBe 2P mutual prime rwmber of system configuration, [D 2i-1, m 2i-1+ D 2i-1) be x iScope, [D 2i+ 1, m 2i+ D 2i] be L iScope, D 1... D 2PBe predefined nonnegative integer, i is the positive integer smaller or equal to P;
Described combined decoding module comprises: the 4th decoding submodule, described the 4th decoding submodule is used to calculate described i bunch starting point r 2i-1=mod (Y, m 2i-1)+D 2i-1, described i bunch length r 2i=mod (Y, m 2i)+D 2i+ 1.
19. according to claim 14 described systems, it is characterized in that,
Described sending module comprises:
The conversion submodule is used for converting described combined coding result to binary bits information;
Send submodule, be used for described binary bits information is sent to described receiving terminal;
Described receiver module comprises:
Receive submodule, be used to receive described binary bits information;
The conversion submodule is used for described binary bits information translation is become metric described combined coding result.
CN201010003147.8A 2010-01-07 2010-01-07 discrete resource distribution method and system Expired - Fee Related CN102123499B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201010003147.8A CN102123499B (en) 2010-01-07 2010-01-07 discrete resource distribution method and system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201010003147.8A CN102123499B (en) 2010-01-07 2010-01-07 discrete resource distribution method and system

Publications (2)

Publication Number Publication Date
CN102123499A true CN102123499A (en) 2011-07-13
CN102123499B CN102123499B (en) 2015-10-21

Family

ID=44251905

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201010003147.8A Expired - Fee Related CN102123499B (en) 2010-01-07 2010-01-07 discrete resource distribution method and system

Country Status (1)

Country Link
CN (1) CN102123499B (en)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106656444A (en) * 2015-11-03 2017-05-10 中兴通讯股份有限公司 Resource allocation method and device
CN108809567A (en) * 2017-05-04 2018-11-13 华为技术有限公司 resource indicating method and device
CN110210844A (en) * 2019-05-27 2019-09-06 维沃移动通信有限公司 A kind of resource transfers method, server and terminal

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101064903A (en) * 2006-04-25 2007-10-31 华为技术有限公司 Communication system resource distribution indicated method, base station and user equipment
JP2008301422A (en) * 2007-06-04 2008-12-11 Mitsubishi Electric Corp Communication system, terminal and base station

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101064903A (en) * 2006-04-25 2007-10-31 华为技术有限公司 Communication system resource distribution indicated method, base station and user equipment
JP2008301422A (en) * 2007-06-04 2008-12-11 Mitsubishi Electric Corp Communication system, terminal and base station

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106656444A (en) * 2015-11-03 2017-05-10 中兴通讯股份有限公司 Resource allocation method and device
WO2017076206A1 (en) * 2015-11-03 2017-05-11 中兴通讯股份有限公司 Resource allocation method and apparatus
CN106656444B (en) * 2015-11-03 2019-03-26 中兴通讯股份有限公司 A kind of resource allocation methods and device
CN108809567A (en) * 2017-05-04 2018-11-13 华为技术有限公司 resource indicating method and device
CN108809567B (en) * 2017-05-04 2022-03-08 华为技术有限公司 Resource indication method and device
CN110210844A (en) * 2019-05-27 2019-09-06 维沃移动通信有限公司 A kind of resource transfers method, server and terminal
CN110210844B (en) * 2019-05-27 2021-07-20 维沃移动通信有限公司 Resource transfer method, server and terminal

Also Published As

Publication number Publication date
CN102123499B (en) 2015-10-21

Similar Documents

Publication Publication Date Title
CN100578966C (en) The method of the downlink resource allocations in the partitioned environment
CN109565861A (en) The method and apparatus of data transmission in next generation cellular network
CN102487548B (en) Machine type communication system, information sending and obtaining method, base station and terminals
CN106332286A (en) Frequency spectrum resource allocation method and device
CN107343297A (en) A kind of method and apparatus in radio communication
CN101682917B (en) Communication method, wireless communication system, transmitter, and receiver
US9020550B2 (en) Methods and apparatuses for radio resource allocation and identification
JP5174164B2 (en) Signaling method
CN104125045A (en) Method for transmitting ACK/NACK messages
CN101689987A (en) Method of downlink resource allocation in a sectorized environment
AU2021206754B2 (en) Resource unit combination indication method and communications apparatus
CN102238627A (en) Resource allocating method and device of downlink shared channel
CN102056306A (en) Method and device for allocating uplink shared channel resources and communication system
US8509204B2 (en) Efficient encoding of control signaling for communication systems with scheduling and link
CN102196574B (en) The indicating means of Resources allocation and base station
CN110192416A (en) A kind of resource allocation method and device for coverage enhancement
KR20080104518A (en) Apparatus and method for bandwidth request and allocation of uplink based on a group in wireless communication system
CN107343316A (en) A kind of method and apparatus in UE and base station in radio communication
CN102123499A (en) Method and system for allocating discrete resources
US20120263132A1 (en) Method for encoding resource indexes in wireless communication system, and base station
KR100970185B1 (en) Method and apparatus for resource allocation in multiple channel system
CN101222728B (en) Method and system for using time frequency resource in OFDMA system
US20100208831A1 (en) Techniques for quick access channel information loading in wireless networks
EP3629648A1 (en) Signalling receiving method and related device
US7693539B2 (en) Mobile communication system, radio network controller, base station and communication method

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant
CF01 Termination of patent right due to non-payment of annual fee
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20151021

Termination date: 20180107