CN102651909B - Method and apparatus for allocating resources in multiplexing of uplink control information - Google Patents
Method and apparatus for allocating resources in multiplexing of uplink control information Download PDFInfo
- Publication number
- CN102651909B CN102651909B CN201110046170.XA CN201110046170A CN102651909B CN 102651909 B CN102651909 B CN 102651909B CN 201110046170 A CN201110046170 A CN 201110046170A CN 102651909 B CN102651909 B CN 102651909B
- Authority
- CN
- China
- Prior art keywords
- multiplexing
- control information
- business
- ascending control
- code check
- 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.)
- Active
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/04—Wireless resource allocation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
- H04L1/0072—Error control for data other than payload data, e.g. control data
Abstract
The invention discloses a method and an apparatus for allocating resources in multiplexing of uplink control information. The method comprises the steps as follows: initially allocating Resource Blocks (RBs) for UE according to the Media Access Control Logical Channel Priority (MLP); calculating the coding rate for a service in multiplexing of uplink control information; and spreading the initially allocated RBs according the coding rate for the service. According to the invention, the problem that the throughput of the system is influenced by the increase of the Bit Error Rate (BER) of the traffic channel due to the multiplexing of the uplink control information is solved, thus the RBs can be utilized optimally, the system usage can be improved, and the throughput can be increased.
Description
Technical field
The present invention relates to the communications field, resource allocation methods time multiplexing in particular to a kind of ascending control information and device.
Background technology
LTE (Long Term Evolution, Long Term Evolution) in system, uplink physical channel mainly contains PUCCH (PhysicalUplink Control Channel, Physical Uplink Control Channel), the channel compositions such as PUSCH (Physical Uplink Control Channel, Physical Uplink Shared Channel).Ascending control information comprises the ACK (Acknowledge of uplink feedback, correct response)/NACK (Non-Acknowledge, wrong responses), CQI (Channel Quality Indicator, channel quality indicates), RI (RankIndicator, rank indication information), the information such as PMI (Precoding Matrix Indecator, pre-coding matrix indicates).PUSCH can only transmission Uplink Shared Channel data, also can a transmitting uplink control information, or, transmit Uplink Shared Channel data and ascending control information simultaneously.
In prior art, when carrying out Resourse Distribute to the PUSCH of transmitting uplink control information, be generally distribute corresponding resource according to the size of SR response and uplink signal-channel quality to the multiple user terminals in community, and do not consider the size whether each user carrying ascending control information and ascending control information.Multiplexing due to ascending control information, can allow the code check of business information increase, cause the Traffic Channel error rate to increase, the throughput of influential system.
Summary of the invention
Main purpose of the present invention is resource allocation methods when providing a kind of ascending control information multiplexing and device, multiplexing with what solve due to ascending control information, causes the Traffic Channel error rate to increase, the throughput problem of influential system.
According to an aspect of the present invention, provide a kind of ascending control information multiplexing time resource allocation methods, comprise: according to MLP (MAC (Media Access Control, medium education) Logical Channel Priority, MAC priority of logical channels) to UE (User Equipment, subscriber equipment) original allocation RB (Resource Block, Resource Block); The code check of business when calculating ascending control information is multiplexing; The RB of code check to original allocation according to business expands.
Wherein, calculate ascending control information multiplexing time business the step of code check comprise: judge that whether current MLP is first MLP of UE; If current MLP is first MLP of UE, when then calculating multiplexing without ascending control information according to the RB of original allocation and initial MCS (Modulation Coding Scheme, the Modulation and Coding Scheme) value of distributing for UE the limit bit rate of business and ascending control information multiplexing time business code check; If current MLP is not first MLP of UE, then when calculating multiplexing without ascending control information according to the sum and initial MCS value that to have distributed RB the limit bit rate of business and ascending control information multiplexing time business code check.
Wherein, the step expanded according to the RB of code check to original allocation of business comprises: when the ascending control information that judgement calculates is multiplexing, whether the code check of business is greater than limit bit rate; If the code check of business is greater than limit bit rate when the ascending control information calculated is multiplexing, then the RB of original allocation is expanded.
Wherein, the step that the RB of original allocation expands is comprised: the quantity N calculating the RB that needs expand, and judge whether the sum of unappropriated RB is more than or equal to N; If the sum of unappropriated RB is more than or equal to N, then for UE quantity allotted is the RB of N, wherein, the number ading up to the RB of original allocation and the N sum of the RB of UE has been distributed to; If the sum of unappropriated RB is less than N, then reduce MCS value.
Wherein, calculate and need the step of the quantity N of the RB expanded to comprise: repeat following steps, until the limit bit rate of business when the code check of business is less than or equal to multiplexing without ascending control information when ascending control information is multiplexing: make N=N+1, and when calculating multiplexing without ascending control information according to the sum of the RB distributed and initial MCS value the limit bit rate of business and ascending control information multiplexing time business code check, wherein, the number of the RB of the sum=N+ original allocation of the RB distributed, the initial value of N is 0.
Wherein, under predetermined circumstances, resource allocation methods when ascending control information is multiplexing also comprises: carry out rollback to the RB number expanded after the multiplexing control information of UE, wherein, predetermined condition comprises: for first MLP of UE, for the current MLP of UE expansion RB, UE is not first MLP, and for current MLP, when the ascending control information under current MLP is multiplexing, the code check of business is less than or equal to limit bit rate; Wherein, back-off procedure comprises: repeat following steps, until the limit bit rate of business when the code check of business is greater than multiplexing without ascending control information when ascending control information is multiplexing: when calculating the sum-1 of the RB distributed, time multiplexing without ascending control information the limit bit rate of business and ascending control information multiplexing time business code check, if the code check of business is less than or equal to limit bit rate when now ascending control information is multiplexing, then the sum-1 of the RB of the sum of the RB distributed=distributed.
Wherein, the step reducing MCS value comprises: repeat following steps, until the limit bit rate of business when the code check of business is less than or equal to multiplexing without ascending control information when ascending control information is multiplexing, wherein, if MCS value=0, then stop UE sending data: to make MCS value=MCS value-1, and when calculating multiplexing without ascending control information according to MCS value and the sum of RB that distributed the limit bit rate of business and ascending control information multiplexing time business code check.
Wherein, according to MLP, the step of UE original allocation RB is comprised: according to MLP order from low to high to UE original allocation RB.
According to a further aspect in the invention, provide a kind of ascending control information multiplexing time resource allocation device, comprising: original allocation unit, for according to MLP to UE original allocation RB; Computing unit, for calculate ascending control information multiplexing time the code check of business; Expansion unit, expands for the RB of code check to original allocation according to business.
Wherein, computing unit comprises: the first judge module, for judging that whether current MLP is first MLP of UE; First computing module, during for being first MLP of UE at current MLP, when calculating multiplexing without ascending control information according to the RB of original allocation and the initial MCS value of distributing for UE the limit bit rate of business and ascending control information multiplexing time business code check; Second computing module, for when current MLP is not first MLP of UE, when calculating multiplexing without ascending control information according to the sum of the RB distributed and initial MCS value the limit bit rate of business and ascending control information multiplexing time business code check.
Wherein, expansion unit comprises: the second judge module, and during for judging that the ascending control information that calculates is multiplexing, whether the code check of business is greater than limit bit rate; Enlargement module, when the code check for the business when the ascending control information calculated is multiplexing is greater than limit bit rate, expands the RB of original allocation.
Wherein, enlargement module also comprises: the 3rd calculating sub module, for calculating the quantity N needing the RB expanded; 3rd judges submodule, for judging whether the sum of unappropriated RB is more than or equal to N; Distribution sub module, for when the sum of unappropriated RB is more than or equal to N, for UE quantity allotted is the RB of N, wherein, has distributed to the number ading up to the RB of original allocation and the N sum of the RB of UE; Reduce submodule, for when the sum of unappropriated RB is less than N, reduce MCS value.
Pass through the present invention, adopt the technical scheme that the RB of UE original allocation is expanded, what solve due to ascending control information is multiplexing, the Traffic Channel error rate is caused to increase, the problem of the throughput of influential system, and then reach optimal RB, improve the system availability of RB, improve the effect of throughput.
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:
A kind of preferred flow charts of resource allocation methods when Fig. 1 is multiplexing according to the ascending control information of the embodiment of the present invention;
A kind of preferred structure block diagram of resource allocation device when Fig. 2 is multiplexing according to the ascending control information of the embodiment of the present invention;
The another kind of structured flowchart of resource allocation device when Fig. 3 is multiplexing according to the ascending control information of the embodiment of the present invention;
The another kind of flow chart of resource allocation methods when Fig. 4 is multiplexing according to the ascending control information of 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.
Embodiment 1
A kind of preferred flow charts of resource allocation methods when Fig. 1 is multiplexing according to the ascending control information of the embodiment of the present invention, comprising:
S102, according to MLP to UE original allocation RB, preferably, according to MLP order from low to high to multiple UE original allocation RB;
S104, the code check of business when calculating ascending control information is multiplexing;
S106, the RB of code check to original allocation according to business expands.
In the preferred embodiment, adopt the technical scheme that the RB of UE original allocation is expanded, what solve due to ascending control information is multiplexing, the Traffic Channel error rate is caused to increase, the problem of the throughput of influential system, and then reach optimal RB, improve the system availability of RB, improve the effect of throughput.
Preferably, calculate ascending control information multiplexing time business the step of code check include but are not limited to following steps: S1, judges that whether current MLP is first MLP of UE; S2, if current MLP is first MLP of UE, then when calculating multiplexing without ascending control information according to the RB of original allocation and the initial MCS value of distributing for UE the limit bit rate of business and ascending control information multiplexing time business code check; S3, if current MLP is not first MLP of UE, then when calculating multiplexing without ascending control information according to the sum and initial MCS value that to have distributed RB the limit bit rate of business and ascending control information multiplexing time business code check.Preferably, the span of MCS value is 0-28.
Certainly, the present invention is not limited only to above-mentioned judgement and computational process, such as, if when current MLP is first MLP, multiplexing UCI (Uplink Control information, ascending control information) after code check not high, time then for second MLP, because the RB number distributing to this UE increases, after multiplexing UCI, code check certainly can not be high, therefore, step S3 can not be performed, namely do not need to enter above-mentioned Rate Control flow process and judge a code check again, and stop the expansion to the RB of original allocation, directly carry out the transmission of UE data.Now, whether can be met the demands mark by increase code check, thus can calculation process be simplified.
Before expanding the RB of original allocation, when first can judge that the ascending control information that calculates is multiplexing, whether the code check of business is greater than limit bit rate; If the code check of business is greater than limit bit rate when the ascending control information calculated is multiplexing, then the RB of original allocation is expanded.Certainly, the present invention is not limited only to above-mentioned Rule of judgment, also can judge whether to perform the operation of expanding the RB of original allocation by other Rule of judgment.
In the process that the RB of original allocation is expanded, first can calculate the quantity N needing the RB expanded, and judge whether the sum of unappropriated RB is more than or equal to N; If the sum of unappropriated RB is more than or equal to N, then for UE quantity allotted is the RB of N, wherein, the number ading up to the RB of original allocation and the N sum of the RB of UE has been distributed to.Such as, the number being initially allocated to the RB of this UE is 10, and in expansion process, and again for this UE is assigned with 5 RB, then after expanding, the RB distributed for this UE adds up to 15.
In the process that the RB of original allocation is expanded, following steps can be repeated, until the limit bit rate of business when the code check of business is less than or equal to multiplexing without ascending control information when ascending control information is multiplexing, the quantity N of the RB expanded is needed: make N=N+1 to calculate, and when calculating multiplexing without ascending control information according to the sum of the RB distributed and initial MCS value the limit bit rate of business and ascending control information multiplexing time business code check, wherein, the number of the RB of the sum=N+ original allocation of the RB distributed, the initial value of N is 0.Certainly, the present invention is not limited only to the computational process of above-mentioned recursion, can also be calculated the quantity N of the required RB expanded, such as by similar recursive process, above-mentioned identical recursive process is performed, to reach the object calculating N more rapidly by N=N+2.
After calculating the quantity N needing the RB expanded, if judge, the sum of unappropriated RB is less than N, then perform the operation reducing MCS value, and do not perform the operation of expanding the RB of original allocation.Particularly, performing in the process reducing MSC, following steps can be repeated, until the limit bit rate of business when the code check of business is less than or equal to multiplexing without ascending control information when ascending control information is multiplexing: make MCS value=MCS value-1, and when calculating multiplexing without ascending control information according to MCS value and the sum of RB that distributed the limit bit rate of business and ascending control information multiplexing time business code check.In the process reducing MCS value, if MCS value=0, then UE is stopped to send data.Certainly, the present invention is not limited only to the computational process of above-mentioned recursion, can also reduce MCS value by similar recursive process, such as, performs above-mentioned identical recursive process by MCS value=MCS value-2, to reach the object reducing MCS value fast.
Preferably, under predetermined circumstances, resource allocation methods when ascending control information is multiplexing also comprises: carry out rollback to the RB number expanded after the multiplexing control information of UE, wherein, predetermined condition comprises: for first MLP of UE, for UE expands RB, the current MLP of UE is not first MLP, and for current MLP, when the ascending control information under current MLP is multiplexing, the code check of business is less than or equal to limit bit rate, namely do not need to carry out RB expansion to UE.Concrete, in the process performing rollback, following steps can be repeated, until the limit bit rate of business when the code check of business is greater than multiplexing without ascending control information when ascending control information is multiplexing: when calculating the sum-1 of the RB distributed, time multiplexing without ascending control information the limit bit rate of business and ascending control information multiplexing time business code check, if the code check of business is less than or equal to limit bit rate when now ascending control information is multiplexing, then the sum-1 of the RB of the sum of the RB distributed=distributed.In the preferred embodiment, to expand whole RB or wherein a part of RB discharge, the RB of release can be made for other UE, ensure that RB resource reaches optimization simultaneously, so raising community throughput.Certainly, the present invention is not limited only to the computational process of above-mentioned recursion, can also be carried out rollback RB, such as by similar recursive process, above-mentioned identical back off procedure is performed, to reach the object of fast fallback RB by the sum-2 of the RB of the sum of the RB that distributed=distributed.
In the preferred embodiment, can expand according to the RB of the code check of business to original allocation, carry out RB to UE reasonably to expand, save resource, and ensure that when the expansion of RB cannot be carried out to UE, reduce MCS value, to ensure that UE normally carries out transfer of data, when MCS value drop to zero code rate also high time, then this UE is not dispatched, uses resource to other UE.
Embodiment 2
A kind of preferred structure block diagram of resource allocation device when Fig. 2 is multiplexing according to the ascending control information of the embodiment of the present invention, comprising: original allocation unit 202, for according to MLP to UE original allocation RB; Computing unit 204, for calculate ascending control information multiplexing time the code check of business; Expansion unit 206, expands for the RB of code check to original allocation according to business.
In the preferred embodiment, adopt the technical scheme that the RB of UE original allocation is expanded, what solve due to ascending control information is multiplexing, the Traffic Channel error rate is caused to increase, the problem of the throughput of influential system, and then reach optimal RB, improve the system availability of RB, improve the effect of throughput.
On the basis of Fig. 2, Fig. 3 illustrate the ascending control information of the embodiment of the present invention multiplexing time the another kind of structured flowchart of resource allocation device, wherein:
Computing unit 204 comprises: the first judge module 2041 connecting original allocation unit 202, connects the first computing module 2042 and the second computing module 2043 of the first judge module 2041 respectively; Expansion unit 206 comprises: the second judge module 2061 connecting the first computing module 2042 and the second computing module 2043, connect the enlargement module 2062 of the second judge module 2061, wherein enlargement module 2062 comprises further: the 3rd calculating sub module 20621 connected successively, 3rd judges submodule 20622, and distribution sub module 20623, meanwhile, enlargement module 2062 also comprises the reduction submodule 20624 that connection the 3rd judges submodule 20622.
Preferably, computing unit 204 by but be not limited only to following operation calculate ascending control information multiplexing time business code check: the first judge module 2041 judges that whether current MLP is first MLP of UE; If current MLP is first MLP of UE, when the first RB of computing module 2042 according to original allocation and the initial MCS value of distributing for UE calculate multiplexing without ascending control information the limit bit rate of business and ascending control information multiplexing time business code check; If current MLP is not first MLP of UE, the second computing module 2043 basis distributed the limit bit rate of business when the sum of RB and initial MCS value calculate multiplexing without ascending control information and ascending control information multiplexing time business code check.
Certainly, the present invention is not limited only to the judgement operation of above-mentioned first judge module 2041, and first calculating operation of computing module 2042 and the second computing module 2043, such as, if when current MLP is first MLP, multiplexing UCI (Uplink Controlinformation, ascending control information) after code check not high, time then for second MLP, because the RB number distributing to this UE increases, after multiplexing UCI, code check certainly can not be high, therefore, the calculating operation of the second computing module 2043 can not be carried out, namely do not need to enter above-mentioned Rate Control flow process and judge a code check again, and stop the expansion to the RB of original allocation, directly carry out the transmission of UE data.Now, whether can be met the demands mark by increase code check, thus can calculation process be simplified.
Before expanding the RB of original allocation, when first can judge that the ascending control information that calculates is multiplexing by the second judge module 2061, whether the code check of business is greater than limit bit rate; If the code check of business is greater than limit bit rate when the ascending control information calculated is multiplexing, then the second judge module 2061 informs that the RB of enlargement module 2062 pairs of original allocation expands.Certainly, the present invention is not limited only to above-mentioned Rule of judgment, also can judge whether to perform the operation of expanding the RB of original allocation by other Rule of judgment.Certainly, the judged result of all right active obtaining second judge module 2061 of enlargement module 2062, thus expand according to the RB of judged result to original allocation.
In the process expanded the RB of original allocation, first can calculate by the 3rd calculating sub module 20621 the quantity N needing the RB expanded, the 3rd judges that submodule 20622 judges whether the sum of unappropriated RB is more than or equal to N simultaneously; If the sum of unappropriated RB is more than or equal to N, then the 3rd judges that submodule 20622 informs that distribution sub module 20623 is the RB of N as UE quantity allotted, wherein, has distributed to the number ading up to the RB of original allocation and the N sum of the RB of UE.Such as, the number being initially allocated to the RB of this UE is 10, and in expansion process, and again for this UE is assigned with 5 RB, then after expanding, the RB distributed for this UE adds up to 15.Certainly, distribution sub module 20623 can also judge the judged result of submodule 20622 by active obtaining the 3rd, thus according to the RB of judged result to be UE quantity allotted be N.
In the process that the RB of original allocation is expanded, 3rd calculating sub module 20621 can repeat following operation, until the limit bit rate of business when the code check of business is less than or equal to multiplexing without ascending control information when the second judge module 2061 judges that ascending control information is multiplexing, the quantity N of the RB expanded is needed: make N=N+1 to calculate, and when calculating multiplexing without ascending control information according to the sum of the RB distributed and initial MCS value the limit bit rate of business and ascending control information multiplexing time business code check, wherein, the number of the RB of the sum=N+ original allocation of the RB distributed, the initial value of N is 0.Certainly, the present invention is not limited only to the computational process of above-mentioned recursion, can also be calculated the quantity N of the required RB expanded, such as by similar recursive process, above-mentioned identical recursive process is performed, to reach the object calculating N more rapidly by N=N+2.
After the 3rd calculating sub module 20621 calculates the quantity N needing the RB expanded, if the 3rd judges that submodule 20622 judges that the sum of unappropriated RB is less than N, then the 3rd judges that submodule 20622 informs that reducing submodule 20624 performs the operation reducing MCS value, and does not perform the operation of expanding the RB of original allocation.Particularly, performing in the process reducing MSC, reduce submodule 20624 and can repeat following operation, until the limit bit rate of business when the code check of business is less than or equal to multiplexing without ascending control information when the second judge module 2061 judges that ascending control information is multiplexing: make MCS value=MCS value-1, and when calculating multiplexing without ascending control information according to MCS value and the sum of RB that distributed the limit bit rate of business and ascending control information multiplexing time business code check.In the process reducing MCS value, if MCS value=0, then UE is stopped to send data.Certainly, the present invention is not limited only to the computational process of above-mentioned recursion, can also reduce MCS value by similar recursive process, such as, performs above-mentioned identical recursive process by MCS value=MCS value-2, to reach the object reducing MCS value fast.
Preferably, under predetermined circumstances, distribution sub module 20623 also carries out rollback to the RB number expanded after the multiplexing control information of UE, wherein, predetermined condition comprises: for first MLP of UE, for UE expands RB, the current MLP of UE is not first MLP, and for current MLP, when the second judge module 2061 judges that the ascending control information under current MLP is multiplexing, the code check of business is less than or equal to limit bit rate, namely do not need to carry out RB expansion to UE.Concrete, in the process performing rollback, distribution sub module 20623 can repeat following steps, until the limit bit rate of business when the code check of business is greater than multiplexing without ascending control information when the second judge module 2061 judges that ascending control information is multiplexing: when calculating the sum-1 of the RB distributed, time multiplexing without ascending control information the limit bit rate of business and ascending control information multiplexing time business code check, if the code check of business is less than or equal to limit bit rate when now ascending control information is multiplexing, then the sum-1 of the RB of the sum of the RB distributed=distributed.In the preferred embodiment, to expand whole RB or wherein a part of RB discharge, the RB of release can be made for other UE, ensure that RB resource reaches optimization simultaneously, so raising community throughput.Certainly, the present invention is not limited only to the computational process of above-mentioned recursion, can also be carried out rollback RB, such as by similar recursive process, above-mentioned identical back off procedure is performed, to reach the object of fast fallback RB by the sum-2 of the RB of the sum of the RB that distributed=distributed.
In the preferred embodiment, can expand according to the RB of the code check of business to original allocation, carry out RB to UE reasonably to expand, save resource, and ensure that when the expansion of RB cannot be carried out to UE, reduce MCS value, to ensure that UE normally carries out transfer of data, when MCS value drop to zero code rate also high time, then this UE is not dispatched, uses resource to other UE.
Embodiment 3
Present embodiments provide a kind of ascending control information multiplexing time resource allocation methods, in up Resourse Distribute, according to MLP (MAC Logical Channel Priority, MAC logical control channel priority) Resources allocation is carried out to UE, scheduling and distribution RB carry out according to MLP is ascending, when supposing this module of input, the RB of just sub-distribution and initial MCS value are obtained.
The embodiment of the present invention can be applied in LTE system, such as, LTE system shown in Fig. 3, the another kind of flow chart of resource allocation methods when Fig. 4 is multiplexing according to the ascending control information of the embodiment of the present invention, the flow process of this embodiment realizes especially by base station side, and the RB number supposing each MLP distributes to UE is RB
last, mainly comprise the following steps:
S401: judge whether UCI flag (this value is initialized as 0) equals zero, if equal zero, then carry out ascending control information multiplexing time allocation process, if not 0, then exit this flow process.The consideration of this step is herein mainly for the situation that multiplexing ascending control information is less, if when first MLP, code check is just not high, then can judge that, when second MLP, code check is not high yet, does not therefore need the flow process into RB and MCS value adjustment.
S402: judge that whether current MLP is first MLP of this UE, if so, perform step S403, if not, perform step S409.
In the present embodiment, first MLP and second MLP of UE is treated with a certain discrimination, when first MLP has carried out the expansion of RB, when second MLP, the expansion of RB is carried out if do not need, then only need carry out normal RB allocation flow, just can reach the code check requirement of multiplexing ascending control information, simultaneously, when second MLP, the RB to expanding also is needed to carry out rollback operation, the object done like this allows the RB of rollback that other UE can be used, wherein, when rollback operation can be included in and judge that the code check reaching multiplexing ascending control information requires, discharge all RB expanded, or only discharge a part of RB of expansion.
S403: according to the RB of original allocation
last, and initial MCS value, the code check R of business time multiplexing without ascending control information under calculating this configuration
mCS, and calculate multiplexing without ascending control information time code check upper limit R, wherein R=R
mCS+ (R
mCS+1-R
mCS)/A, for meeting the limit bit rate (wherein the value of A can be the Arbitrary Digit being greater than 1) of service feature, under calculating current MCS value simultaneously, the code check R ' of business during multiplexing CQI/PMI/RI.
S404: judge now multiplexing CQI/PMI/RI time business code check R ' whether be greater than limit bit rate R, now, the Rule of judgment judging whether to be greater than limit bit rate is the Rule of judgment that after current multiplexing ascending control information, whether code check is high, only has now code check height just to need to consider the expansion of RB resource.
If the code check R ' of business is greater than limit bit rate R during multiplexing CQI/PMI/RI, then performs step S405, if be less than, then UCI_flag is set to 1, perform step S408.
The RB number RB that when S405: after calculating multiplexing ascending control information, code check R ' are greater than limit bit rate R, needs expand
uCI_RB, judge whether available RB simultaneously, if having, perform step S406, if nothing, perform step S407.
Need the RB number RB expanded herein
uCI_RBthe method calculated is: make RB
uCI_RB=RB
uCI_RB+ 1, wherein, RB
uCI_RBinitial value be 0, when the RB number expanded as required and the RB number sum of original allocation and initial MCS value recalculate the limit bit rate R of service feature and multiplexing ascending control information, the code check R ' of business, judges whether R ' is greater than R, if be greater than, then proceeds RB
uCI_RB=RB
uCI_RB+ 1 operation, till code check R ' is less than or equal to R.
Judge available RB, mainly judge (RB
most>=RB
uCI_RB) & (RB
last+ RB
uCI_RB≤ RB
rest) whether set up, wherein RB
mostfor the RB number that maximum power can be supported, RB
restfor remaining maximum continuous print RB number.
S406: expand the RB number distributed.
Expand the RB number that this MLP distributes to this UE, RB
last=RB
last+ RB
uCI_RB, the RB number that renewal maximum power can be supported and remaining maximum continuous RB number, RB
most=RB
most-RB
uCI_RB, RB
rest=RB
rest-RB
uCI_RB, and the RB number RB of this UE given in record
uE=RB
last(RB
uEinitialization value is 0) perform step S408.
S407: reduce the MCS value of distributing.
Now, owing to expanding RB, then can only reduce the code check of business after multiplexing ascending control information by falling MCS value, the method for adjustment MCS value is:
Make MCS value=MCS value-1, recalculate the code check R ' of business when the limit bit rate R of service feature and multiplexing ascending control information, judge whether R ' is greater than R, if R ' is greater than R, then proceeds MCS value=MCS value-1 and operate, till code check R ' is less than or equal to R, if when it should be noted that MCS value=0 herein, code check is still high, then abandon the transfer of data of this UE, use the resource of this UE to other UE.
S408: export UCI_flag, RB
uCI_RB, the RB number RB that this MLP distributes
lastand total RB number RB that this UE distributes
uE.
S409: if current MLP is not first MLP of this UE, then first calculate the RB number RB that this UE current has distributed
uE=RB
uE+ RB
last, according to RB
uEand initial MCS value, the code check R of business time multiplexing without UCI under calculating this configuration
mCS, and calculate UCI multiplexing time business limit bit rate R, wherein R=R
mCS+ (R
mCS+1-R
mCS)/A, (value of A is shown in step S403), under calculating current MCS value simultaneously, the code check R ' of business during multiplexing CQI/PMI/RI.
S410: judge whether to meet R < R ', if do not meet, make UCI_flag=1, performs step S411, if meet, performs step S405.
S411: the rollback operation carrying out RB.The RB number now distributed and initial MCS value have met the requirement of multiplexing ascending control information, because the multiplexing of ascending control information introduces extra RB, need the rollback carrying out RB, so that the use of follow-up UE.Now, if in second MLP, because this UE is assigned with again RB resource, the RB resource that twice MLP distributes adds up, after multiplexing uplink information, code check R ' is less than limit bit rate R, whether the RB resource of distributing when considering ascending control information when now needing consideration first MLP during code check height can carry out rollback, if code check R ' is still less than limit bit rate R after rollback, then carries out the rollback of RB, if code check R ' is more than or equal to limit bit rate R after rollback, then not rollback.Introduce the fallback mechanism of RB mainly in order to allow RB resource reach optimization, and then improve the throughput of community.
Above-mentioned back off procedure specifically comprises: make RB
uE_Temp=RB
uE-Δ RB, Δ RB=1 ..., RB
uCI_RB, according to RB
uE_Tempand MCS value, under calculating this configuration, the code check R of business time multiplexing without UCI
mCS, and calculate the limit bit rate R meeting service feature requirement, wherein R=R
mCS+ (R
mCS+1-R
mCS)/A.Under calculating current RB number and MCS value simultaneously, the code check R ' of business during multiplexing CQI/PMI/RI.Judge whether to meet R ' < R, if meet, then make Δ RB=Δ RB+1, continue to calculate R and R ', until Δ RB value corresponding when finding one first R ' < R not meet.
More be newly assigned to the RB number of this UE, and RB
uE=RB
uE-Δ RB+1, considers RB adjusted value RB when ascending control information is multiplexing
uCI_RB=RB
uCI_RBthe RB number that-Δ RB+1, this MLP give this UE is: RB
last=RB
last-Δ RB+1
The resource allocation methods when ascending control information that the present embodiment provides is multiplexing, be applicable to allly in community carry out the multiplexing user of control information, carrying out after by MLP from low to high Resources allocation, carry out again an ascending control information multiplexing time process, the code check of traffic channel data when considering that uplink information controls multiplexing, if code check is greater than limit bit rate, then pay the utmost attention to the process of carrying out expanding RB, if now without available RB, then consider to fall MCS value, till code check is less than or equal to limit bit rate, if simultaneously UE all Resources allocation in two MLP, when second MLP, if code check is less than limit bit rate, then can consider the rollback operation of RB, when even the resource sum of two MLP distribution allows the code check of Traffic Channel be less than limit bit rate, the RB number then increased during rollback first MLP, like this can optimal RB, and then improve the system availability of RB, final raising throughput.
In step 406 and 407, consider the mode of two kinds of multiplexing ascending control informations, if when having available RB, then pay the utmost attention to and increase the process of RB, if without available RB time, then consider the process of falling MCS value.
From above description, can find out, present invention achieves following technique effect: by when dividing RB in advance, add above-mentioned resource allocation device, adopt above-mentioned resource allocation methods, PUSCH channel during multiplexing ascending control information can be allowed to have more suitable RB and suitable MCS value, allow the launching success rate of multiplexing ascending control information on PUSCH channel increase like this, increase the transmission success rate of Traffic Channel simultaneously, effectively improve the throughput of system.
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.
The foregoing is 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 (10)
1. resource allocation methods when ascending control information is multiplexing, is characterized in that, comprising:
According to medium education priority of logical channels MLP to user equipment (UE) original allocation Resource Block RB;
The code check of business when calculating ascending control information is multiplexing;
The RB of code check to described original allocation according to described business expands;
Wherein, when described calculating ascending control information is multiplexing, the step of the code check of business comprises:
Judge that whether current MLP is first MLP of described UE;
If current MLP is first MLP of described UE, then according to the RB of described original allocation and be initial modulation encoding scheme MCS value that described UE distributes calculate multiplexing without ascending control information time the limit bit rate of business and ascending control information multiplexing time business code check;
If current MLP is not first MLP of described UE, then when calculating multiplexing without ascending control information according to the sum of RB distributed and described initial MCS value the limit bit rate of business and ascending control information multiplexing time business code check.
2. method according to claim 1, is characterized in that, the described step expanded according to the RB of code check to described original allocation of described business comprises:
When the described ascending control information that judgement calculates is multiplexing, whether the code check of business is greater than described limit bit rate;
If the code check of business is greater than described limit bit rate when the described ascending control information calculated is multiplexing, then the RB of described original allocation is expanded.
3. method according to claim 2, is characterized in that, describedly comprises the step that the RB of described original allocation expands:
Calculate the quantity N needing the RB expanded, and judge whether the sum of unappropriated RB is more than or equal to described N;
If the sum of unappropriated RB is more than or equal to described N, then for described UE quantity allotted is the RB of N, wherein, the number ading up to the RB of described original allocation of the RB of described UE and described N sum are distributed to;
If the sum of described unappropriated RB is less than described N, then reduce MCS value.
4. method according to claim 3, is characterized in that, described calculating needs the step of the quantity N of the RB expanded to comprise:
Repeat following steps, until when described ascending control information is multiplexing the code check of business be less than or equal to described multiplexing without ascending control information time business limit bit rate:
Make N=N+1, and when calculating multiplexing without ascending control information according to the sum of the RB distributed and described initial MCS value the limit bit rate of business and ascending control information multiplexing time business code check, wherein, the number of the RB of original allocation described in the sum=N+ of the described RB distributed, the initial value of described N is 0.
5. method according to claim 1, it is characterized in that, under predetermined circumstances, also comprise: carry out rollback to the RB number expanded after the multiplexing control information of described UE, wherein, described predetermined condition comprises: for first MLP of described UE, be that described UE expands RB, the current MLP of described UE is not described first MLP, and for described current MLP, when the described ascending control information under described current MLP is multiplexing, the code check of business is less than or equal to described limit bit rate;
Wherein, described back-off procedure comprises: repeat following steps, until when described ascending control information is multiplexing the code check of business be greater than described multiplexing without ascending control information time business limit bit rate:
During the sum-1 of the RB distributed described in calculating, time multiplexing without ascending control information the limit bit rate of business and ascending control information multiplexing time business code check, if the code check of business is less than or equal to described limit bit rate when now ascending control information is multiplexing, then the sum-1 of the sum=described RB distributed of the RB distributed.
6. method according to claim 3, is characterized in that, the step of described reduction MCS value comprises:
Repeat following steps, until when described ascending control information is multiplexing the code check of business be less than or equal to described multiplexing without ascending control information time business limit bit rate, wherein, if MCS value=0, then stop described UE transmission data:
Make MCS value=MCS value-1, and when calculating multiplexing without ascending control information according to described MCS value and the sum of RB that distributed the limit bit rate of business and ascending control information multiplexing time business code check.
7. method according to claim 1, is characterized in that, describedly comprises the step of UE original allocation RB according to MLP: according to described MLP order from low to high to described UE original allocation RB.
8. resource allocation device when ascending control information is multiplexing, is characterized in that, comprising:
Original allocation unit, for according to medium education priority of logical channels MLP to user equipment (UE) original allocation Resource Block RB;
Computing unit, for calculate ascending control information multiplexing time the code check of business;
Expansion unit, expands for the RB of code check to described original allocation according to described business;
Wherein, described computing unit comprises:
First judge module, for judging that whether current MLP is first MLP of described UE;
First computing module, during for being first MLP of described UE at current MLP, according to the RB of described original allocation and be initial modulation encoding scheme MCS value that described UE distributes calculate multiplexing without ascending control information time the limit bit rate of business and ascending control information multiplexing time business code check;
Second computing module, for when current MLP is not first MLP of described UE, when calculating multiplexing without ascending control information according to the sum of the RB distributed and described initial MCS value the limit bit rate of business and ascending control information multiplexing time business code check.
9. device according to claim 8, is characterized in that, described expansion unit comprises:
Second judge module, during for judging that the described ascending control information that calculates is multiplexing, whether the code check of business is greater than limit bit rate;
Enlargement module, when the code check for the business when the described ascending control information calculated is multiplexing is greater than described limit bit rate, expands the RB of described original allocation.
10. device according to claim 9, is characterized in that, described enlargement module also comprises:
3rd calculating sub module, for calculating the quantity N needing the RB expanded;
3rd judges submodule, for judging whether the sum of unappropriated RB is more than or equal to described N;
Distribution sub module, for when the sum of unappropriated RB is more than or equal to described N, for described UE quantity allotted is the RB of N, wherein, has distributed to the number ading up to the RB of described original allocation of the RB of described UE and described N sum;
Reduce submodule, for when the sum of described unappropriated RB is less than described N, reduce MCS value.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110046170.XA CN102651909B (en) | 2011-02-25 | 2011-02-25 | Method and apparatus for allocating resources in multiplexing of uplink control information |
| PCT/CN2011/072477 WO2012113169A1 (en) | 2011-02-25 | 2011-04-06 | Method and apparatus for allocating resources in multiplexing of uplink control information |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110046170.XA CN102651909B (en) | 2011-02-25 | 2011-02-25 | Method and apparatus for allocating resources in multiplexing of uplink control information |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102651909A CN102651909A (en) | 2012-08-29 |
| CN102651909B true CN102651909B (en) | 2015-05-20 |
Family
ID=46693782
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201110046170.XA Active CN102651909B (en) | 2011-02-25 | 2011-02-25 | Method and apparatus for allocating resources in multiplexing of uplink control information |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN102651909B (en) |
| WO (1) | WO2012113169A1 (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9876623B2 (en) * | 2014-12-22 | 2018-01-23 | Samsung Electronics Co., Ltd. | Transmission of uplink control information in carrier aggregation with a large number of cells |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2010074004A1 (en) * | 2008-12-24 | 2010-07-01 | 株式会社エヌ・ティ・ティ・ドコモ | Wireless base station and communication control method |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101902817B (en) * | 2009-05-26 | 2015-07-22 | 中兴通讯股份有限公司 | Uplink radio resource dispatching method and device for wireless communication system |
| US8830920B2 (en) * | 2009-06-17 | 2014-09-09 | Qualcomm Incorporated | Resource block reuse for coordinated multi-point transmission |
| CN101977443B (en) * | 2010-11-09 | 2015-09-30 | 北京邮电大学 | Resource allocation methods and device thereof |
-
2011
- 2011-02-25 CN CN201110046170.XA patent/CN102651909B/en active Active
- 2011-04-06 WO PCT/CN2011/072477 patent/WO2012113169A1/en active Application Filing
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2010074004A1 (en) * | 2008-12-24 | 2010-07-01 | 株式会社エヌ・ティ・ティ・ドコモ | Wireless base station and communication control method |
Non-Patent Citations (1)
| Title |
|---|
| 16QAM for UCI-only PUSCH;InterDigital Communications;《3GPP TSG RAN WG1 Meeting #64,R1-110854》;20110215;参见第1至第4页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| WO2012113169A1 (en) | 2012-08-30 |
| CN102651909A (en) | 2012-08-29 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101911805B (en) | Be used for the method for the channel condition information that transmits UE triggering | |
| US9769805B2 (en) | User equipment, a radio base station and respective method therein for managing uplink resources within a coverage area of the radio base station | |
| CN109309954B (en) | Uplink power control method, base station and terminal | |
| US9107226B2 (en) | Method and system for handling congestion in a communications system | |
| CN105450361A (en) | Method and arrangement in telecommunication system | |
| CN101969663B (en) | Method, device and system for transmitting control information | |
| JP6139686B2 (en) | Method for transmitting downlink control information, network side device, and user equipment | |
| JP6780703B2 (en) | Base station equipment, terminal equipment, wireless communication system and wireless communication system control method | |
| CN104144029A (en) | Method for determining size of transmission block, base station and terminal | |
| EP4181599A1 (en) | Communication method and apparatus | |
| CN105992379B (en) | Scheduling method and terminal | |
| CN104968013A (en) | Method, equipment and system for adjusting feedback cycle of channel quality indicator (CQI) | |
| CN101741707B (en) | Uplink data transmission method, device and communication system | |
| CN101754395B (en) | Feedback information transmission method and system and equipment | |
| EP1352540B1 (en) | Method and radio communications system for reporting status information between a mobile station and a radio access network | |
| CN107147475B (en) | Modulation coding mode adjusting method and base station | |
| CN108631927B (en) | Information transmission method and device | |
| CN109391402B (en) | Transmission method of downlink control information, base station, terminal and storage medium | |
| CN104066113A (en) | Method and apparatus for sending power headroom report | |
| CN102651909B (en) | Method and apparatus for allocating resources in multiplexing of uplink control information | |
| CN102077491B (en) | Controlling allocation of a portion of a shared channel to use for control information | |
| EP3565344A1 (en) | Resource configuration method and apparatus for coverage enhancement | |
| CN104469947A (en) | Uplink and downlink unified resource allocation method | |
| CN109963342B (en) | Physical uplink shared channel transmission method, device, terminal and base station | |
| CN108632884B (en) | Reconfiguration method and device of buffer status report timer |
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 | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20201106 Address after: Xiangtai village, Dayu Town, Rudong County, Nantong City, Jiangsu Province, 226000 Patentee after: Rudong Huanghai water conservancy construction engineering company Address before: 518057 Nanshan District science and technology, Guangdong Province, South Road, No. 55, No. Patentee before: ZTE Corp. |
|
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20210906 Address after: 226400 No.8, wisdom Avenue, Donghu scenic area, Dayu Town, Rudong County, Nantong City, Jiangsu Province Patentee after: Nantong Donghu International Travel Agency Co., Ltd Address before: Xiangtai village, Dayu Town, Rudong County, Nantong City, Jiangsu Province, 226000 Patentee before: Rudong Huanghai water conservancy construction engineering company |
|
| TR01 | Transfer of patent right |