CN102123499B - discrete resource distribution method and system - Google Patents
discrete resource distribution method and system Download PDFInfo
- Publication number
- CN102123499B CN102123499B CN201010003147.8A CN201010003147A CN102123499B CN 102123499 B CN102123499 B CN 102123499B CN 201010003147 A CN201010003147 A CN 201010003147A CN 102123499 B CN102123499 B CN 102123499B
- Authority
- CN
- China
- Prior art keywords
- bunch
- resource
- starting point
- multiple bunches
- combined coding
- 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.)
- Expired - Fee Related
Links
Landscapes
- Compression, Expansion, Code Conversion, And Decoders (AREA)
Abstract
The invention discloses a kind of discrete resource distribution method and system, the method comprises: carry out combined coding to the predefined parameter of multiple bunches distributed, and combined coding result is sent to receiving terminal, wherein, predefined parameter comprises starting point and the length of in multiple bunches each bunch; Receiving terminal is according to the predefined parameter of multiple bunches of combined coding result dispensed.The present invention is convenient to realize, and expense is less, by number and the size of reasonable disposition mutual prime rwmber, can realize the balance of resource allocation overhead and flexibility.
Description
Technical field
The present invention relates to the communications field, in particular to a kind of discrete resource distribution method and system.
Background technology
Long evolving system (Long term evolution, referred to as LTE) up link adopt be the power amplification efficiency that the multiplexing multiple access of Single Carrier-Frequency Division (Single Carrier-Frequency DivisionMultiple Access, referred to as SC-FDMA) technology improves terminal.Accordingly, on Resourse Distribute, also only allow continuous print Resourse Distribute, the advantage of this distribution is that expense is smaller, and shortcoming is that the flexibility of scheduling is restricted, and also have impact on the acquisition of frequency diversity gain to a certain extent.
In the LTE-Advanced system optimized, by adopting little coverage cell to reduce the power amplifier requirement to terminal, and this system allows up link discrete resource to distribute, thus improves flexibility and the systematic function of Resourse Distribute.Fig. 1 shows the diagrammatic representation of discontinuous Resourse Distribute, as can be seen from Figure 1, has polylith resource for certain terminal distribution, and this polylith resource with discrete formal distribution in system bandwidth.
In correlation technique, carry out the distribution of up link discrete resource by following two kinds of modes:
1, the resource allocation methods of existing LTE up link is reused.
In the up link of LTE, owing to being continuous resource distribution, for the consideration of paring down expenses, the initial index of the Resource Block of LTE system to Resources allocation, resource block number are encoded, namely, initial for Resource Block index, resource block number are mapped with a unique decimal number, the resource block number that supposing the system may be used for distributing is N, then the expense required for this Resourse Distribute is
bit.Suppose the resource of distributing be 2 discrete bunch (bunch be 1 or multiple continuous print Resource Block), then reuse above-mentioned resource allocation methods twice, the expense now needed is:
namely expense can the linear increase along with the number of discrete bunch.For LTE/LTE-Advanced system, the signaling format of Resourse Distribute has multiple, terminal determines it is that a kind of signaling format by the mode of blind Detecting, if adopt above-mentioned discrete resource distribution method, must need to increase new resource allocation signal form, this can cause the increase of terminal blind Detecting complexity, it is also proposed very high requirement to the processing time of terminal.
2, adopt the mode of bitmap (replacement response) to realize discrete resource to distribute, LTE system downlink resource allocations have employed of this sort mode.The resource block number that supposing the system may be used for distributing is N, then the program can be described as: use N number of bit, and each bit is corresponding with a Resource Block.For the Resource Block that will distribute, putting this bit is 1, otherwise to put this bit be 0.The advantage of this scheme to reuse the existing resource allocation format of LTE system, can not increase blind Detecting complexity; In addition, Resourse Distribute flexibly can also be supported arbitrarily.The shortcoming of the program is that expense is larger.Consider the realization of physical end, consider that it is more rational for getting up by combined factors such as bunch performance gain that can obtain, implementation complexity that program primary distribution 2 is discrete.Therefore, compared with the actual needs of Resourse Distribute, the expense of the program is larger.
Summary of the invention
The object of the present invention is to provide a kind of discrete resource distribution method and system, need to increase new resource allocation signal form or the larger problem of overhead to solve discrete resource distribution method in correlation technique.
One aspect of the present invention provides a kind of discrete resource distribution method, comprise: combined coding is carried out to the predefined parameter of multiple bunches distributed, and combined coding result is sent to receiving terminal, wherein, predefined parameter comprises starting point and the length of in multiple bunches each bunch; Receiving terminal is according to the predefined parameter of multiple bunches of combined coding result dispensed.
Another aspect of the present invention provides a kind of discrete resource distribution system, comprise transmitting terminal and receiving terminal, wherein, transmitting terminal comprises: combined coding module, for carrying out combined coding to the predefined parameter of multiple bunches distributed, wherein, predefined parameter comprises starting point and the length of in multiple bunches each bunch; Sending module, for sending combined coding result to receiving terminal; Receiving terminal comprises: receiver module, for receiving combined coding result; Combined decoding module, for the predefined parameter of multiple bunches according to combined coding result dispensed.
Pass through the present invention, adopt and the starting point of multiple bunches of distributing and length are carried out to combined coding and coding result is sent to receiving terminal, receiving terminal calculates starting point and the length of in multiple bunches of distribution each bunch from the coding result received, solve discrete resource distribution method to need to increase new resource allocation signal form or the larger problem of overhead, the coding of transmitting terminal and the decode procedure of receiving terminal simpler, be convenient to realize, and expense is less, by number and the size of reasonable disposition mutual prime rwmber, the balance of resource allocation overhead and flexibility can be realized.
Accompanying drawing explanation
Accompanying drawing described herein is used to provide a further understanding of the present invention, and form a application's part, schematic description and description of the present invention, for explaining the present invention, does not form inappropriate limitation of the present invention.In the accompanying drawings:
Fig. 1 distributes schematic diagram according to the discrete resource of correlation technique;
Fig. 2 is the flow chart of the discrete resource distribution method according to the embodiment of the present invention;
Fig. 3 is according to the meaning of parameters schematic diagram in two bunches of situations of the embodiment of the present invention;
Fig. 4 is the detail flowchart of the transmitting terminal processing procedure according to the embodiment of the present invention;
Fig. 5 is the detail flowchart of the receiving terminal processing procedure according to the embodiment of the present invention;
Fig. 6 is the structured flowchart of the discrete resource distribution system according to the embodiment of the present invention;
Fig. 7 is the detailed block diagram of the discrete resource distribution system according to the embodiment of the present invention.
Embodiment
Hereinafter also describe the present invention in detail with reference to accompanying drawing in conjunction with the embodiments.It should be noted that, when not conflicting, the embodiment in the application and the feature in embodiment can combine mutually.
Embodiments provide a kind of discrete resource distribution method, Fig. 2 is the flow chart of the discrete resource distribution method according to the embodiment of the present invention, and as shown in Figure 2, the method comprises the following steps:
Step S202, carry out combined coding to the predefined parameter of multiple bunches distributed, and combined coding result is sent to receiving terminal, wherein, predefined parameter comprises starting point and the length of in multiple bunches each bunch;
Step S204, receiving terminal is according to the predefined parameter of multiple bunches of combined coding result dispensed.
Said method is that the starting point of multiple bunches of distributing and length (comprising starting point and the length of in multiple bunches each bunch) unification are carried out combined coding, obtain the result (metric numeral) of a combined coding, with encoding to the starting point of each bunch and length of adopting in correlation technique, obtain with distribute bunch the identical coding result of number have difference in essence, the coding of transmitting terminal and the decoding of receiving terminal fairly simple, in addition, represent compared with the mode of the discrete/continuous resource of distribution with adopting bitmap mode in correlation technique, the expense needed is less, the resource that the method is particularly useful for distributing is limited discrete bunch, and (number of clusters order is fewer, be such as 2, 3, 4) situation.
It should be noted that, above-mentioned bunch is defined as: 1 or multiple continuous print Resource Block, these Resource Block can be continuous in physical significance continuously, also can be continuous on logical meaning.The resource that can be understood as distribution continuously in physical significance is continuous print in the dimension of time and/or frequency; The Resource Block that can be understood as distribution continuously on logical meaning is virtual resource blocks, and these virtual resource blocks are continuous print on index.These virtual resource blocks and real Physical Resource Block have fixing mapping relations, and the Physical Resource Block that therefore continuous print virtual resource blocks is corresponding may be discontinuous.
Preferably, above-mentioned combined coding and the computational process of receiving terminal are carried out in the following manner, but are not limited to under type:
Mode one:
Carry out combined coding to needing the predefined parameter of multiple bunches distributed to comprise: calculate
wherein, P is the quantity of multiple bunches, x
ifor the starting point of the i-th bunch in multiple bunches, L
ibe the length of the i-th bunch,
m=m
1* ... * m
2j-1* m
2j* ... .*m
2P, K
isatisfied
minimum positive integer, m
1... m
2P2P 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 the nonnegative integer preset, i is the positive integer being less than or equal to P;
Receiving terminal comprises according to the predefined parameter of multiple bunches of combined coding result dispensed: the starting point r calculating the i-th bunch
2i-1=mod (Y, m
2i-1)+D
2i-1, the length r of i-th bunch
2i=mod (Y, m
2i)+D
2i+ 1.
Under specific circumstances, mode one can carry out certain simplification to reduce expense, comprises following two kinds of situations and process:
A, the length of each bunch in multiple bunches are identical.
Carry out combined coding to needing the predefined parameter of multiple bunches distributed to comprise: 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 the quantity of multiple bunches, x
ifor the starting point of the i-th bunch in multiple bunches, L is the length of each bunch,
m=m
1* ... * m
i* ... .*m
p+1, K
isatisfied
minimum positive integer, m
1... m
p+1p+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 the starting point of the i-th bunch), [D
p+1+ 1, m
p+1+ D
p+1] be the scope (m of L
p+1represent distribute bunch the dynamic range of length), D
1... D
p+1be the nonnegative integer preset, i is for being less than or equal to P positive integer;
Receiving terminal comprises according to the predefined parameter of multiple bunches of combined coding result dispensed: the starting point r calculating the i-th bunch
i=mod (Y, m
i)+D
i, the length r of each bunch
p+1=mod (Y, m
p+1)+D
p+1+ 1.
For when needing to distribute P bunch, only need to generate P+1 mutual prime rwmber, and expense is significantly less than the situation of an above-mentioned generation 2P mutual prime rwmber.
B, in multiple bunches bunch relative to bunch the original position of previous bunch there is fixed bias.
Carry out combined coding to needing the predefined parameter of multiple bunches distributed to comprise: 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 the quantity of multiple bunches, the starting point of the first bunch during x is multiple bunches, L
ifor the length of the i-th bunch in multiple bunches,
m=m
1* ... * m
i* ... .*m
p+1, K
isatisfied
minimum positive integer, m
1... m
p+1p+1 mutual prime rwmber of system configuration, [D
p+1, m
p+1+ D
p+1) be the scope (m of x
p+1represent the dynamic range of the starting point of the first bunch), [D
i+ 1, m
i+ D
i] be L
iscope ([1, m
i], i=1,2...P represent the dynamic range of the length of the i-th bunch), D
1... D
p+1be the nonnegative integer preset, i is for being less than or equal to P positive integer;
Receiving terminal comprises according to the predefined parameter of multiple bunches of combined coding result dispensed: the starting point r calculating the i-th bunch
i=mod (Y, m
i)+D
i, the length r of each bunch
p+1=mod (Y, m
p+1)+D
p+1+ 1.
For when needing to distribute P bunch, only need to generate P+1 mutual prime rwmber, and expense is significantly less than the situation of an above-mentioned generation 2P mutual prime rwmber.
Preferably, when P=2, the starting point x of the 1st bunch
1corresponding Resource Block index is x
1, the 2nd bunch starting point x
2corresponding Resource Block index is N-1-x
2; When P=3, the starting point x of the 1st bunch
1corresponding Resource Block index is x
1, the starting point x of the 2nd bunch
2corresponding Resource Block index is
the starting point x of 3rd bunch
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,2...N-1.By the method, more Resourse Distribute form can be supported under same asset assignment overhead.
Preferably, predefined parameter comprises the starting point of the predetermined resource of in multiple bunches each bunch and the number of each bunch of predetermined resource comprised, and wherein, predetermined resource comprises one of following: the Resource Block group of the Resource Block composition of Resource Block, predetermined number.That is, by the continuous resource block (logic is continuous or physics is continuous) of some composition Resource Block group, using the least unit of Resource Block group as Resourse Distribute, above-mentioned mode is applicable equally.
Mode two:
Before combined coding is carried out to the predefined parameter of multiple bunches of needs distribution, the resource that can be used for distributing is divided into multiple resource set, from multiple resource set, selects P the resource set distributing to P bunch, and by P resource set notice receiving terminal, wherein, P is the quantity of multiple bunches;
Carry out combined coding to needing the predefined parameter of multiple bunches distributed to comprise: carry out combined coding to the predefined parameter of multiple bunches of needs distribution and comprise: calculate
wherein, x
ifor the starting point of the i-th bunch of corresponding resource set in multiple bunches, L
ibe the length of the i-th bunch,
m=m
1* ... * m
2j-1* m
2j* ... .*m
2P, K
isatisfied
minimum positive integer, m
1... m
2P2P 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 the nonnegative integer preset, i is the positive integer being less than or equal to P;
Receiving terminal comprises according to the predefined parameter of multiple bunches of combined coding result dispensed: the starting point r calculating the i-th bunch
2i-1=mod (Y, m
2i-1)+D
2i-1, the length r of i-th bunch
2i=mod (Y, m
2i)+D
2i+ 1.
In mode two, suppose that the number of clusters order distributed is P, then first pass through
the resource set position residing for resource that bit information instruction distributes, and then in P the resource set selected, adopt the method similar with mode one to indicate the P bunch of resource of distributing in each resource set, wherein, M is the number of the resource set of the identical or different size that resource is divided into.
In two kinds of above-mentioned modes, be by bunch starting point and bunch the length concrete resource that indicates each bunch to 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, alternatively feasible execution mode, also can by bunch starting point and the terminal concrete resource that indicates 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 sets in a standard.
Method 2: semi-static configuration, such as system is by high-level signaling notification terminal.These parameters can pass through the semi-static change of high-level signaling.
Method 3: static configuration/semi-static configuration mixes with dynamic-configuration, the multiple possibility of the semi-static configuration/static configuration of such as system, it is any that recycling physical layer signaling dynamically indicates.
Preferably, combined coding result is sent to receiving terminal and comprises: combined coding results conversion is become binary bits information, and is sent to receiving terminal; Receiving terminal is according to before the predefined parameter of multiple bunches of combined coding result dispensed, and receiving terminal converts the binary bits information received to metric combined coding result.
Embodiment
The number of clusters that this embodiment is distributed for discrete resource equals 2, and composition graphs 3 to Fig. 5 describes above-mentioned discrete resource distribution method in detail.Suppose there is N number of Resource Block that can distribute, then the method comprises the following steps:
Step 1, system (particularly, can be base station) configures 4 relatively prime numbers, is set to m
1, m
2, m
3, m
4.In the present embodiment, D
1=0; D
2=0; D
3=0; D
4=0, then [0, m
1) represent the dynamic range of the starting point of bunch 1; [1, m
2] represent the dynamic range of the length of bunch 1; [0, m
3) represent the dynamic range of the starting point of bunches 2; [1, m
4] represent the dynamic range of the length of bunches 2.
Step 2, supposes in certain Resourse Distribute, distribution bunch 1 starting point be x
1, D
1≤ x
1< m
1+ D
1, length is L
1, D
2≤ L
1-1 < m
2+ D
2; The starting point of distribute bunches 2 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
4transmitting terminal, the constant all known of 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 Resourse Distribute, the process of transmitting terminal as shown in Figure 4, comprising:
Step 21, according to resource allocation information, transmitting terminal determines that the starting point of two bunches of resources is respectively x
1, x
2, length is respectively L
1, L
2.
Step 22, according to the relatively prime parameter m of system configuration
1, m
2, m
3and m
4, and the c calculated thus
1, c
2, c
3and c
4, to starting point and the length information (x of above-mentioned each bunch of 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,
wherein, K
isatisfied
smallest positive integral.
Step 23, sends after Y is converted to corresponding binary bits information, is encoded by prior art to these bits, modulation etc. is processed.
Step 3, the process of receiving terminal as shown in Figure 5, comprising:
Step 31, receiver as after demodulation, decoding, obtains binary bits information by some receiver process.It can obtain resource allocation information in the following way: above-mentioned binary bits is converted to 10 system numbers, if this number equals Z, it should be noted that, when not considering to transmit the error brought, and Z=Y.
Step 32, according to Z, m
1, m
2, m
3, m
4calculate 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
1represent the starting point of distribute bunch 1; r
2represent the length of distribute bunch 1; r
3represent the starting point of distribute bunches 2; r
4represent the length of distribute bunches 2.
Step 33, according to the resource allocation information obtained, UE carries out upstream discontinuous Resourse Distribute.
Above-mentioned resource allocation methods can expand to the situation of distributing and being greater than 2 bunches, as long as the number meeting the relatively prime number of system needs configuration equals to distribute 2 times, number of clusters order.
The respective handling process of above-mentioned discrete resource distribution method is described below by way of instantiation.
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 Resourse Distribute is also 25, and the Resourse Distribute minimum unit of this example is RB.The starting point of two bunches of Resourse Distribute is adopted in the following method, that is, the starting point x of bunch 1
1corresponding Resource Block index is x
1, the starting point x of bunches 2
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, now the resource allocation conditions of two bunches meets following relation:
The scope of first RB index of bunch 1 is [RB 0 ~ RB 13]; Allow the RBG number distributed can be 1 ~ 9 in bunch 1;
First RB index range of bunches 2 is [RB12 ~ RB24], and bunches 2 allow the RBG number distributed can be 1 ~ 5.
Suppose that base station is that UE two bunches of resources of distributing are for [RB2 ~ RB5] and [RB17 ~ RB21], according to distribution method of the present invention and parameter configuration above, the initial index of resource of bunch 1 is 2, resource size is 4, the initial index of resource of bunches 2 is 3, resource size is 5, carries out combined coding obtain Y=mod (x according to the present invention to above-mentioned parameter
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 obtain Y=6204 thus.
Because the information after combined coding is less than or equal to M, the bit number that therefore above-mentioned resource allocation methods needs can adopt
bit represents.
Y is converted to corresponding binary bits information, by prior art as encoded to these bits, send after the process such as modulation.
At receiving terminal, receiver as after demodulation, decoding by some receiver process, is obtained binary bits information, this binary bits is converted to 10 system number Z, does not consider to transmit the error brought, 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 Resourse Distribute is 17, and the Resourse Distribute minimum unit of this example is RBG.The starting point of two bunches of Resourse Distribute is adopted in the following method, i.e. the starting point x of bunch 1
1corresponding Resource Block index is x
1, the starting point x of bunches 2
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, now the resource allocation conditions of two bunches meets following relation:
The scope of first RB index of bunch 1 is [RBG0 ~ RBG16]; Allow the RB number distributed can be 1 ~ 3 in bunch 1;
First RB index range of bunches 2 is [RBG0 ~ RBG16], and bunches 2 allow the RB number distributed can be 1 ~ 2.
Suppose that base station is that UE two bunches of resources of distributing are for [RBG1 ~ RBG3] and [RBG13 ~ RBGG14], according to distribution method of the present invention and parameter configuration above, the initial index of resource of bunch 1 is 1, resource size is 3, the initial index of resource of bunches 2 is 13, resource size is 2, carries out combined coding obtain Y=mod (x according to the present invention to above-mentioned parameter
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 obtain Y=761 thus.
Because the information after combined coding is less than or equal to M, the bit number that therefore above-mentioned resource allocation methods needs can adopt
bit represents.
Y is converted to corresponding binary bits information, by prior art as encoded to these bits, send after the process such as modulation.
At receiving terminal, receiver as after demodulation, decoding by some receiver process, is obtained binary bits information, this binary bits is converted to 10 system number Z, does not consider to transmit the error brought, 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 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 Resourse Distribute is 25, the Resourse Distribute minimum unit of this example be RBG. suppose further to distribute bunch number be 3, and the resource size of each bunch is identical.In order to the resource distribution of 3 bunches can be carried out, then need to determine this starting point index of 3 bunches and bunch length, therefore, need to determine 4 parameters.The starting point of three bunches of Resourse Distribute is adopted in the following method, i.e. the starting point x of bunch 1
1corresponding Resource Block index is x
1, the starting point x of bunches 2
2corresponding Resource Block index is
the starting point x of bunches 3
3corresponding Resource Block index is N-1-x
3.In this example, 4 parameters are: m
1=11, m
2=7, m
3=5, m
4=3.Like this, the Resourse Distribute of 3 bunches meets following relation:
The scope of first RB index of bunch 1 is [RBG0 ~ RBG10]; Allow the RB number distributed can be 1 ~ 3 in bunch 1;
First RB index range of bunches 2 is [RBG9 ~ RBG15], allows the RB numbers distributed can be 1 ~ 3 in bunches 2;
First RB index range of bunches 3 is [RBG20 ~ RBG24], allows the RB numbers distributed can be 1 ~ 3 in bunches 3;
Suppose that base station is that UE three bunches of resources of distributing are for [RBG1 ~ RBG2], [RBG12 ~ RBGG13] and [RBG21 ~ RBGG22].According to distribution method of the present invention and parameter configuration above, the initial index of resource of bunch 1 is 1, and the initial index of resource of bunches 2 is 3, and the initial index of resource of bunches 3 is 2, these three bunches of resources have identical length 2.According to the present invention, combined coding is carried out to above-mentioned parameter and obtain 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 obtain Y=892 thus.
Because the information after combined coding is less than or equal to M, the bit number that therefore above-mentioned resource allocation methods needs can adopt
bit represents.
Y is converted to corresponding binary bits information, by prior art as encoded to these bits, send after the process such as modulation.
At receiving terminal, receiver as after demodulation, decoding by some receiver process, is obtained binary bits information, this binary bits is converted to 10 system number Z, does not consider to transmit the error brought, i.e. Z=Y herein.
According to Z, m
1, m
2, m
3, m
4calculate x1, x2, x3, L:
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 Resourse Distribute is 17, and the Resourse Distribute minimum unit of this example is RBG.Further, two bunches of resources are distributed in this example, first bunch of two bunches of resource uses identical starting point index x, Resource Block index corresponding to this starting point is x, and second bunch of relative first bunch of resource of resource exists fixed bias, and this value is configured by high level, in this example, this parameter value is 8RBG, like this, Resource Block index corresponding to the starting point of second bunch is 8+x, and the length of two bunches of resources is L
1and L
2.Three relatively prime parameter m are configured according to the present invention
1, m
2and m
3value be: m
1=7, m
2=3, m
3=5, now the starting point index of resource of first bunch is [RBG0 ~ RBG6], and the starting point index of second bunch is [RBG8 ~ RBG14], and the length of bunch 1 is [1 ~ 3], and the length of bunches 2 is [1 ~ 5].
Suppose that base station is that UE two bunches of resources of distributing are for [RBG2 ~ RBG4] and [RBG10 ~ RBGG13], according to distribution method of the present invention and parameter configuration above, the initial index of resource of bunch 1 is 2, resource size is 3, the resource size of bunches 2 is 4, carries out combined coding obtain Y=mod (x*c according to the present invention to above-mentioned parameter
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 obtain Y=23 thus.
Because the information after combined coding is less than or equal to M, the bit number that therefore above-mentioned resource allocation methods needs can adopt
bit represents.
Y is converted to corresponding binary bits information, by prior art as encoded to these bits, send after the process such as modulation.
At receiving terminal, receiver as after demodulation, decoding by some receiver process, is obtained binary bits information, this binary bits is converted to 10 system number Z, does not consider to transmit the error brought, i.e. Z=Y herein.
According to Z, m
1, m
2, m
3, m
4calculate x, L1, L2:
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 Resourse Distribute 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, 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 in each like this resource set.This example hypothesis distribute bunch number be 2, such base station needs to pass through
which two resource set is the resource that bit information instruction UE distributes belong to.The resource that this example hypothesis UE distributes belongs to resource set 1 and resource set 3.Further, determined the RB distribution condition in each resource set by 4 parameters, concrete indicating means adopts following form: i.e. the starting point x of bunch 1
1corresponding Resource Block index is x
1, length is L
1, the starting point x of bunches 2
2corresponding Resource Block index is x
2, length is L
2.In this example, 4 parameters are: 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 base station is that UE two bunches of resources of distributing are for [RB5, RB9, RB13] and [RB46, RB50].According to distribution method of the present invention and parameter configuration above, 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, combined coding is carried out to above-mentioned parameter and obtain 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 obtain Y=1001 thus.
Because the information after combined coding is less than or equal to M, therefore above-mentioned resource allocation methods adds that resource set indication information needs altogether
bit represents.
Y being converted to corresponding binary bits information, adding 3 bit informations that resource set indicates by prior art as encoded to these bits, send after the process such as modulation.
At receiving terminal, receiver passes through some receiver process as after demodulation, decoding, obtain binary bits information, the resource set index residing for two bunches of resources can be known by front 3 bit informations, further remaining binary bits is converted to 10 system number Z, do not consider to transmit the error brought, i.e. Z=Y herein.
According to Z, m
1, m
2, m
3, m
4calculate x1, L2, x2, L2:
According to these information, UE just can carry out correct resource distribution.
Said method, each bunch of correspondence two parameters, suppose that the number of clusters order distributed is P, and system configures at most 2P (sometimes configuring P+1) individual relatively prime parameter, if 2P relatively prime parameter is m
1, m
2, m
3... m
2P, the expense of this programme is
by reasonable disposition, the balance of resource allocation overhead and flexibility can be realized, and the decode procedure of the coding of transmitting terminal and receiving terminal is all fairly simple, is convenient to realize.
The embodiment of the present invention additionally provides a kind of discrete resource distribution system, this system is for realizing above-mentioned discrete resource distribution method, Fig. 6 is the structured flowchart of the discrete resource distribution system according to the embodiment of the present 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, for carrying out combined coding to the predefined parameter of multiple bunches distributed, wherein, predefined parameter comprises starting point and the length of in multiple bunches each bunch; Sending module 64, is connected to combined coding module 62, for sending combined coding result to receiving terminal 65; Receiving terminal 65 comprises: receiver module 66, for receiving described combined coding result; Combined decoding module 68, is connected to receiver module 66, for the predefined parameter of multiple bunches according to combined coding result dispensed.
Fig. 7 is the detailed block diagram of the discrete resource distribution system according to the embodiment of the present invention, and as shown in Figure 7, on the basis of Fig. 6, combined coding module 62 can comprise: the first encoding submodule 701, and it is for calculating
wherein, P is the quantity of multiple bunches, x
ifor the starting point of the i-th bunch in multiple bunches, L
ibe the length of the i-th bunch,
m=m
1* ... * m
2j-1* m
2j* ... .*m
2P, K
isatisfied
minimum positive integer, m
1... m
2P2P 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 the nonnegative integer preset, i is the positive integer being less than or equal to P; Combined decoding module 68 can comprise: the first decoding sub-module 702, its starting point r for calculating the i-th bunch
2i-1=mod (Y, m
2i-1)+D
2i-1, the length r of i-th bunch
2i=mod (Y, m
2i)+D
2i+ 1.Combined coding module 62 can comprise: the second encoding submodule 703, its length for each bunch in multiple bunches is identical, calculates
wherein, P is the quantity of multiple bunches, x
ifor the starting point of the i-th bunch in multiple bunches, L is the length of each bunch,
m=m
1* ... * m
i* ... .*m
p+1, K
isatisfied
minimum positive integer, m
1... m
p+1p+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 the nonnegative integer preset, i is the positive integer being less than or equal to P; Combined decoding module 68 can comprise: the second decoding sub-module 704, its length for each bunch in multiple bunches is identical, calculates the starting point r of the i-th bunch
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 encoding submodule 705, its in multiple bunches bunch relative to bunch the original position of previous bunch there is 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 the quantity of multiple bunches, the starting point of the first bunch during x is multiple bunches, L
ifor the length of the i-th bunch in multiple bunches,
m=m
1* ... * m
i* ... .*m
p+1, K
isatisfied
minimum positive integer, m
1... m
p+1p+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 the nonnegative integer preset, i is for being less than or equal to P positive integer; Combined decoding module 68 can comprise: the 3rd decoding sub-module 706, its starting point r for calculating the i-th bunch
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 divides module 707 and resource set distribution module 708, and resource set divides module 707 for the resource that can be used for distributing is divided into multiple resource set; Resource set distribution module 708, is connected to resource set and divides module 707, and for selecting P the resource set distributing to P bunch from multiple resource set, and by P resource set notice receiving terminal, wherein, P is the quantity of multiple bunches; Combined coding module 62 can comprise: the 4th encoding submodule 709, is connected to resource set distribution module 708, and it is for calculating
wherein, x
ifor the starting point of the i-th bunch of corresponding resource set in multiple bunches, L
ibe the length of the i-th bunch,
m=m
1* ... * m
2j-1* m
2i* ... .*m
2P, K
isatisfied
minimum positive integer, m
1... m
2P2P 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 the nonnegative integer preset, i is the positive integer being less than or equal to P; Combined decoding module 68 can comprise: the 4th decoding sub-module 710, its starting point r for calculating the i-th bunch
2i-1=mod (Y, m
2i-1)+D
2i-1, the length r of i-th bunch
2i=mod (Y, m
2i)+D
2i+ 1.
Preferably, as shown in Figure 7, sending module 64 can comprise transform subblock 711 and send submodule 712, and wherein, transform subblock 711 is for becoming binary bits information by combined coding results conversion; Send submodule 712 and be connected to transform subblock 711, for binary bits information is sent to receiving terminal; Receiver module 66 comprises: receive submodule 713, for receiving binary bits information; Transform subblock 714, is connected to and receives submodule 713, for converting binary bits information to metric combined coding result.
In sum, in the discrete resource distribution method that the embodiment of the present invention provides, the decode procedure of the coding of transmitting terminal and receiving terminal is comparatively simple, 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 of the present invention each module or each step can realize with general calculation element, they can concentrate on single calculation element, or be distributed on network that multiple calculation element forms, alternatively, they can realize with the executable program code of calculation element, thus, they can be stored and be performed by calculation element in the storage device, and in some cases, step shown or described by can performing with the order be different from herein, or they are made into each integrated circuit modules respectively, or the multiple module in them or step are made into single integrated circuit module to realize.Like this, the present invention is not restricted to any specific hardware and software combination.
These are only the preferred embodiments of the present invention, be not limited to the present invention, for a person skilled in the art, the present invention can have various modifications and variations.Within the spirit and principles in the present invention all, any amendment done, equivalent replacement, improvement etc., all should be included within protection scope of the present invention.
Claims (11)
1. a discrete resource distribution method, is characterized in that, comprising:
Carry out combined coding to the predefined parameter of multiple bunches distributed, and combined coding result is sent to receiving terminal, wherein, described predefined parameter comprises starting point and the length of in described multiple bunches each bunch;
Described receiving terminal is according to the described predefined parameter of described multiple bunches of described combined coding result dispensed;
Wherein, comprise needing the predefined parameter of multiple bunches distributed to carry out combined coding: calculate
, wherein, P is the quantity of described multiple bunches, x
ifor the starting point of the i-th bunch in described multiple bunches, L
ifor the length of described i-th bunch,
m=m
1* ... * m
2j-1* m
2j* ... .*m
2P, K
isatisfied
minimum positive integer, m
1... m
2P2P 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 the nonnegative integer preset, i is the positive integer being less than or equal to P; Described receiving terminal comprises according to the described predefined parameter of described multiple bunches of described combined coding result dispensed: the starting point r calculating described i-th bunch
2i-1=mod (Y, m
2i-1)+D
2i-1, the length r of described i-th bunch
2i=mod (Y, m
2i)+D
2i+ 1; Or,
The length of each bunch in described multiple bunches is identical,
Carry out combined coding to needing the predefined parameter of multiple bunches distributed to comprise: 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 the quantity of described multiple bunches, x
ifor the starting point of the i-th bunch in described multiple bunches, L is the length of described each bunch,
m=m
1* ... * m
i* ... .*m
p+1, K
isatisfied
minimum positive integer, m
1... m
p+1p+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 the nonnegative integer preset, i is the positive integer being less than or equal to P; Described receiving terminal comprises according to the described predefined parameter of described multiple bunches of described combined coding result dispensed: the starting point r calculating described i-th bunch
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; Or,
The original position of previous bunch bunch relative to described bunch in described multiple bunches has fixed bias,
Carry out combined coding to needing the predefined parameter of multiple bunches distributed to comprise: 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 the quantity of described multiple bunches, and x is the starting point of the first bunch in described multiple bunches, L
ifor the length of the i-th bunch in described multiple bunches,
m=m
1* ... * m
i* ... .*m
p+1, K
isatisfied
minimum positive integer, m
1... m
p+1p+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 the nonnegative integer preset, i is for being less than or equal to P positive integer; Described receiving terminal comprises according to the described predefined parameter of described multiple bunches of described combined coding result dispensed: the starting point r calculating described i-th bunch
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; Or,
Before combined coding is carried out to the predefined parameter of multiple bunches of needs distribution, described method also comprises: the resource that can be used for distributing is divided into multiple resource set, P the resource set distributing to P bunch is selected from described multiple resource set, and a described P resource set is notified described receiving terminal, wherein, P is the quantity of described multiple bunches;
Carry out combined coding to needing the predefined parameter of multiple bunches distributed to comprise: calculate
, wherein, x
ifor the starting point of the i-th bunch of corresponding resource set in described multiple bunches, L
ifor the length of described i-th bunch,
m=m
1* ... * m
2j-1* m
2j* ... .*m
2P, K
isatisfied
minimum positive integer, m
1... m
2P2P 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 the nonnegative integer preset, i is the positive integer being less than or equal to P;
Described receiving terminal comprises according to the described predefined parameter of described multiple bunches of described combined coding result dispensed: the starting point r calculating described i-th bunch
2i-1=mod (Y, m
2i-1)+D
2i-1, the length r of described i-th bunch
2i=mod (Y, m
2i)+D
2i+ 1.
2. method according to claim 1, is characterized in that, P=2, and,
Be 25 Resource Block in system bandwidth, and when the resource for distributing comprises 25 Resource Block, m
1=14, m
2=9, m
3=13, m
4=5;
Be 50 Resource Block in system bandwidth, and when the resource for distributing comprises 17 Resource Block groups, m
1=19, m
2=3, m
3=17, m
4=2.
3. method according to claim 1, is characterized in that, P=3, and is 100 Resource Block in system bandwidth, and when the resource for distributing comprises 25 Resource Block groups, m1=11, m2=7, m3=5, m4=3.
4. method according to claim 1, is characterized in that, P=2, and is 50 Resource Block in system bandwidth, and when the resource for distributing comprises 17 Resource Block groups, m
1=7, m
2=3, m
3=5.
5. method according to any one of claim 1 to 4, is characterized in that, when P=2, and the starting point x of the 1st bunch
1corresponding Resource Block index is x
1, the 2nd bunch starting point x
2corresponding Resource Block index is N-1-x
2; When P=3, the starting point x of the 1st bunch
1corresponding Resource Block index is x
1, the starting point x of the 2nd bunch
2corresponding Resource Block index is
the starting point x of 3rd bunch
3corresponding Resource Block index is N-1-x
3, wherein, N is the Resource Block sum that can be used for distributing.
6. method according to any one of claim 1 to 4, it is characterized in that, described predefined parameter comprises the starting point of the predetermined resource of in described multiple bunches each bunch and the number of the described each bunch of predetermined resource comprised, wherein, described predetermined resource comprises one of following: the Resource Block group of the Resource Block composition of Resource Block, predetermined number.
7. method according to claim 1, is characterized in that, P=2, and is 100 Resource Block in system bandwidth, and when the resource for distributing comprises 25 Resource Block groups, m
1=25, m
2=3, m
3=23, m
4=2.
8. the method according to any one of Claims 1-4,7, 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.
9. method according to claim 1, is characterized in that,
Described combined coding result is sent to described receiving terminal comprise: described combined coding results conversion is become binary bits information, and is sent to described receiving terminal;
Described receiving terminal is according to before the described predefined parameter of described multiple bunches of described combined coding result dispensed, and described method also comprises: described receiving terminal converts the described binary bits information received to metric described combined coding result.
10. a discrete resource distribution system, is characterized in that, comprises transmitting terminal and receiving terminal, wherein,
Described transmitting terminal comprises:
Combined coding module, for carrying out combined coding to the predefined parameter of multiple bunches distributed, wherein, described predefined parameter comprises starting point and the length of in described multiple bunches each bunch;
Sending module, for sending combined coding result to described receiving terminal;
Described receiving terminal comprises:
Receiver module, for receiving described combined coding result;
Combined decoding module, for the described predefined parameter of described multiple bunches according to described combined coding result dispensed;
Wherein, described combined coding module comprises: the first encoding submodule, and described first encoding submodule is used for calculating
, wherein, P is the quantity of described multiple bunches, x
ifor the starting point of the i-th bunch in described multiple bunches, L
ifor the length of described i-th bunch,
m=m
1* ... * m
2j-1* m
2j* ... .*m
2P, K
isatisfied
minimum positive integer, m
1... m
2P2P 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 the nonnegative integer preset, i is the positive integer being less than or equal to P; Described combined decoding module comprises: the first decoding sub-module, the starting point r of described first decoding sub-module for calculating described i-th bunch
2i-1=mod (Y, m
2i-1)+D
2i-1, the length r of described i-th bunch
2i=mod (Y, m
2i)+D
2i+ 1; Or,
Described combined coding module comprises: the second encoding submodule, described second encoding submodule is identical for the length of each bunch in described multiple bunches, 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 the quantity of described multiple bunches, x
ifor the starting point of the i-th bunch in described multiple bunches, L is the length of described each bunch,
m=m
1* ... * m
i* ... .*m
p+1, K
isatisfied
minimum positive integer, m
1... m
p+1p+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 the nonnegative integer preset, i is the positive integer being less than or equal to P;
Described combined decoding module comprises: the second decoding sub-module, described second decoding sub-module is identical for the length of each bunch in described multiple bunches, calculates the starting point r of described i-th bunch
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; Or,
Described combined coding module comprises: the 3rd encoding submodule, the described 3rd encoding submodule original position of previous bunch bunch relative to described bunch be used in described multiple bunches has fixed bias, 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 the quantity of described multiple bunches, and x is the starting point of the first bunch in described multiple bunches, L
ifor the length of the i-th bunch in described multiple bunches,
m=m
1* ... * m
i* ... .*m
p+1, K
isatisfied
minimum positive integer, m
1... m
p+1p+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 the nonnegative integer preset, i is for being less than or equal to P positive integer; Described combined decoding module comprises: the 3rd decoding sub-module, the described 3rd starting point r of decoding sub-module for calculating described i-th bunch
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; Or,
Described system also comprises: resource set divides module and resource set distribution module, and wherein, described resource set divides module and is used for the resource that can be used for distributing to be divided into multiple resource set; Described resource set distribution module is used for P the resource set selecting to distribute to P bunch from described multiple resource set, and a described P resource set is notified described receiving terminal, and wherein, P is the quantity of described multiple bunches;
Described combined coding module comprises: the 4th encoding submodule, and described 4th encoding submodule is used for calculating
, wherein, x
ifor the starting point of the i-th bunch of corresponding resource set in described multiple bunches, L
ifor the length of described i-th bunch,
m=m
1* ... * m
2j-1* m
2j* ... .*m
2P, K
isatisfied
minimum positive integer, m
1... m
2P2P 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 the nonnegative integer preset, i is the positive integer being less than or equal to P;
Described combined decoding module comprises: the 4th decoding sub-module, the described 4th starting point r of decoding sub-module for calculating described i-th bunch
2i-1=mod (Y, m
2i-1)+D
2i-1, the length r of described i-th bunch
2i=mod (Y, m
2i)+D
2i+ 1.
11. systems according to claim 10, is characterized in that,
Described sending module comprises:
Transform subblock, for becoming binary bits information by described combined coding results conversion;
Send submodule, for described binary bits information is sent to described receiving terminal;
Described receiver module comprises:
Receive submodule, for receiving described binary bits information;
Transform subblock, for converting described binary bits information to metric described combined coding result.
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 CN102123499A (en) | 2011-07-13 |
| CN102123499B true 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) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106656444B (en) * | 2015-11-03 | 2019-03-26 | 中兴通讯股份有限公司 | A kind of resource allocation methods and device |
| CN108809567B (en) * | 2017-05-04 | 2022-03-08 | 华为技术有限公司 | Resource indication method and device |
| CN110210844B (en) * | 2019-05-27 | 2021-07-20 | 维沃移动通信有限公司 | Resource transfer method, server and terminal |
Citations (2)
| 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 |
-
2010
- 2010-01-07 CN CN201010003147.8A patent/CN102123499B/en not_active Expired - Fee Related
Patent Citations (2)
| 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 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102123499A (en) | 2011-07-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106332286B (en) | Spectrum resource allocation method and device | |
| CN103327615B (en) | Resource allocation indicating method, resource allocation methods and equipment | |
| CN110932832B (en) | Method and device in wireless communication | |
| CN102487548B (en) | Machine type communication system, information sending and obtaining method, base station and terminals | |
| CN110650542A (en) | Method and device for uplink data transmission | |
| TWI606743B (en) | Method of multiuser superposition transmission and base station using the same | |
| CN101132267A (en) | Method for generating and analyzing continuous resource allocation signal and device thereof | |
| CN101361339A (en) | A method of resource allocation in a communication system | |
| CN105471543A (en) | Transmitting device and transmitting method | |
| CN104125045A (en) | Method for transmitting ACK/NACK messages | |
| CN101689987A (en) | Method of downlink resource allocation in a sectorized environment | |
| US20090245337A1 (en) | Method for reducing channel quality information in ofdma systems | |
| CN102123499B (en) | discrete resource distribution method and system | |
| US8718080B2 (en) | Techniques for quick access channel information loading in wireless networks | |
| CN102196574B (en) | The indicating means of Resources allocation and base station | |
| 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 | |
| Shajaiah et al. | Towards an application-aware resource scheduling with carrier aggregation in cellular systems | |
| CN108282313B (en) | Resource pool processing method and device | |
| US20120263132A1 (en) | Method for encoding resource indexes in wireless communication system, and base station | |
| CN104811289A (en) | Orthogonal and non-orthogonal combined large-scale user uplink multiple access transmission method | |
| CN109391398B (en) | Downlink control information indication method and network side equipment | |
| CN101562839A (en) | Method and device for allocating resource | |
| CN102638851B (en) | A kind of data sharing and sending method, Apparatus and system | |
| CN107135178B (en) | Pilot frequency sequence sending method and device |
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 |
Granted publication date: 20151021 Termination date: 20180107 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |