CN1655473A - Node B controlled probability-based speed regulating method and apparatus - Google Patents
Node B controlled probability-based speed regulating method and apparatus Download PDFInfo
- Publication number
- CN1655473A CN1655473A CN 200410004957 CN200410004957A CN1655473A CN 1655473 A CN1655473 A CN 1655473A CN 200410004957 CN200410004957 CN 200410004957 CN 200410004957 A CN200410004957 A CN 200410004957A CN 1655473 A CN1655473 A CN 1655473A
- Authority
- CN
- China
- Prior art keywords
- pointer
- rot
- node
- module
- transmission rate
- 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.)
- Pending
Links
Images
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
This invention relates to a speed dispatching method base on possibility under control of Node B, which comprises the following steps: UE deciding whether sending requirement for increasing UE pointer and sending through RR; Node B statistics hoping improving UE pointer number and measuring the even ROT in this adjusting circuit and computing difference between M_ROT and T_ROT; Node B computing even wireless resources and broadcasting it within community; UE computing and adjusting UE pointer possibility and transporting the speed by this possibility.
Description
Technical field
The present invention relates to third generation partner plan (being called for short 3GPP) and carry out the special uplink channel (being called for short EUDCH) of the enhancing in the third generation mobile, particularly the base station is controlled up transmission, reaches the quick control to up ROT.
Background technology
Second generation mobile communication system comprises global system for mobile communications (being called for short GSM) and IS (Interim Standard)-95, and main target provides voice service.GSM has adopted the TDMA technology, in commercialization in 1992, is mainly used in Europe and China.And IS-95 adopts is CDMA (Code Division Multiple Access), is mainly used in the U.S. and Korea S.
At present, mobile communication technology has been evolved to 3-G (Generation Three mobile communication system), except voice service is provided, also provides two-forty and high-quality data service and multimedia service.3-G (Generation Three mobile communication system) comprises that the asynchronous CDMA system of 3GPP International Standards Organization research (or claims WCDMA, or title UMTS), be that timing between each base station is asynchronous and the synchronous CDMA system of 3GPP2 International Standards Organization research (or claiming CDMA2000).
Synchronous and asynchronous 3-G (Generation Three mobile communication system) is all to providing two-forty, high-quality data packet services to carry out standardization.For example: 3GPP is carrying out standardization to HSDPA (High Speed DownlinkAccess), thereby improves descending data rate, and 3GPP2 is carrying out standardization to 1xEV-DV (Evolution-Data and Voice).3GPP proceeds the enhancing (EUDCH) of ascending packet data transmission again, thereby improves up capacity and covering.EUDCH compares with the up DCH of Rel99/4/5, has introduced HARQ (Hybrid Automatic Retransmission Request) mechanism, and introduces the fast dispatch mechanism of Node B, and sets up new function such as dedicated channel fast.
Accordingly, be necessary the up channel of each sub-district is dispatched so that Resources allocation.EUDCH moves on to Node B to scheduling feature from RNC, to realize fast dispatch.The purpose of uplink scheduling is effectively to utilize finite wireless resources.For example, the target ROT of each sub-district (T ROT) is the target of the up channel scheduling of this sub-district, with the ROT (M_ROT) that keeps measuring in this sub-district as much as possible near T_ROT.In fact, according to the state of this sub-district and adjacent cells, can find the T_ROT of an optimum, and up channel scheduling makes the actual M_ROT that records near T_ROT, and the variation of M_ROT is when very little, then the up of system can obtain optimum performance.Formula (1) is seen in the definition of ROT:
Wherein, Io is all signal strength signal intensity sums that Node B receives, i.e. the overall with band received signal power spectrum density of Node B, and No is the power spectral density of the thermal noise of Node B.
Because No is time to time change hardly, so ROT is mainly determined by Io.If ROT is less, illustrate that signal strength signal intensity that Node B receives a little less than.Though the interference that terminal is received is less, the load of Node B is also less.Yet, if ROT is bigger, illustrate that Node B has higher load, but mean that also the interference that terminal receives is bigger, just cause the reduction of link performance, thereby reduced the performance of whole system.The performance of balance ROT and whole system makes whole system obtain load that the ROT of the optimum of optimum performance can be by taking all factors into consideration Node B and the noise intensity of terminal obtains.
At present, mainly proposed two kinds of scheduling modes among the TR25.896: one is based on the rate scheduling of Node B control, and two are based on the speed and the time scheduling of NodeB control.
In rate scheduling mode based on Node B control, each terminal (being called for short UE) is in the initialization procedure of dedicated transmission channel, UE and base station controller (being called for short RNC) are consulted, both have set up a transmission format composite set (being called for short TFCS), these TFCS have comprised multiple transmission rate, and can sort to the TFC among the TFCS according to transmission rate.For a UE, RNC sets the TFCS subclass (TFCS Subset) that a Node B permission is used this UE, and Node B sets the TFCS subclass (TFCS Subset) that this UE permission is used.The TFCS subclass that Node B allows to use comprises the TFCS subclass that UE allows use, and passes to UE by signaling.Node B can change the TFCS subclass that UE allows use by physical layer signaling each dispatching cycle, thereby can adapt to the variation of ascending load, reaches the purpose of fast dispatch.
Because the TFC among the TFCS can sort according to speed, so each subclass is represented with pointer.Node B allows the subclass of use, with a Node B pointer indication, and the some TFC of Node B pointed, all transmission rates all belong to the subclass that Node B allows use smaller or equal to the element of this TFC.Equally, a TFC of transmission rate maximum in the TFCS subclass of UE pointed UE permission use.Referring to Fig. 1, this is an illustration about Node B pointer and UE pointer.Among the figure, the TFCS of RNC definition has 11, is that TFC0 is to TFC10 after sorting according to transmitting power (with the data rate equivalence).The UE pointer is TFC7, so the TFCS subclass that UE allows to use is that TFC7 is to TFC10.The NodeB pointer is TFC3, so the TFCS subclass that Node B allows this UE is used is that TFC3 is to TFC10.
UE can be in the TFCS subclass that UE allow to use according to Rel99 in existing TFC selection algorithm calculate the current TFC that will use, that is to say that the operable peak transfer rate of UE is exactly the TFC of UE pointer indication.Because the peak transfer rate of UE is UE pointer TFC pointed, so in the description of back, no longer distinguish the peak transfer rate that changes UE and change the UE pointer, they are meanings.UE can improve the peak transfer rate that UE allows to Node B request, has both increased the TFCS subclass that UE allows use, and whether Node B allows to increase according to current up ROT situation decision, tells to UE by dedicated channel.Node B also can initiatively reduce the peak transfer rate that UE allows according to the situation of current ROT.
In speed and time scheduling based on NodeB control, UE is before carrying out transfer of data, the information (as buffer status and power headroom) that the dispatching algorithm of Node B is used need be issued NodeB to carry out the request of transfer of data, Node B is according to the information of receiving, calculate the quality of the wireless channel of UE, and unify scheduling according to current ROT situation.Node B tell UE by physical layer signaling, with great speed, when carries out transfer of data.UE sends in the time of appointment according to Node B specified transmission rate.
In TR25.896, existing two kinds of dispatching methods, a kind of is rate scheduling, another kind is the scheduling of time and speed.In two kinds of schemes, scheduling feature all is present in the Node B entity.
For the rate scheduling of Node B control, need be rate request RR (Rate Request) in the control signaling of special uplink channel transmission, need be speed is confirmed RG (Rate Grant) in the control signaling of downlink dedicated channels transmission.UE utilizes RR to improve the UE pointer to Node B request, increases the peak transfer rate of UE.The ROT situation of Node B reference equivalent and other some schedule informations determine whether to agree the request of this UE, and the result are sent to UE by RG.Do not offer some clarification among the existing TR, when UE asked to improve the UE pointer at every turn, the UE pointer was to improve a TFC or a plurality of TFC.
Below, we may illustrate respectively according to two kinds.Suppose only to comprise the information that improves or reduce the UE pointer in the solicited message of RR, RR only needs an information bit position just much of that so.All must transmit because RR is each frame,, just can reduce more because the reduction of the data transmission capabilities that the transmitting and scheduling signaling is brought so the bit number that it occupies is few more.But problem is, UE receive at every turn Node B sure reply after, the UE pointer all can only improve a TFC.If sometime, there is a large amount of Radio Resources in system, and UE also has lot of data to need transmission, but the raising that the peak data transfer rate of UE can only be step by step transmits on the suitable data speed and can not leap to, and this is a kind of waste of resource.
Suppose that UE in the solicited message of RR, has indicated the position of desired UE pointer, also just say that many bits of RR needs can be represented corresponding information so if allow the UE pointer directly to move on on non-conterminous another TFC from a TFC.If like this, because transmission RR, the reduction of the data transmission capabilities that brings will be bigger.May offset the gain that Node B dispatching office brings like this.
For the time and the rate scheduling of Node B control, owing in each dispatching cycle, all need the needed information of Node B dispatching algorithm is sent to Node B from UE, as the state and the power headroom of buffer.Even it is no exception to transmit a very little packet.This a large amount of additional information that sends for scheduling has also increased the load of system, also may offset the gain that scheduling brings to a certain extent.
Summary of the invention
The purpose of this invention is to provide a kind of method of the rate scheduling based on Node B control, with a kind of probability method the transmission rate of UE is controlled, and reduced the needed signaling consumption of scheduling simultaneously as far as possible.
For achieving the above object, according to an aspect of of the present present invention, the method based on the rate scheduling of probability of a kind of Node B control comprises step:
Whether the UE decision sends the request that improves the UE pointer, and sends by RR;
Node B statistics is wished the number of the UE of raising UE pointer;
Node B measures the average ROT in this dispatching cycle, and the gap of calculating M_ROT and T_ROT;
Node B calculates the average Radio Resource of UE, and broadcasts in the sub-district;
UE calculates the probability of adjusting the UE pointer, and adjusts message transmission rate with this probability.
According to another aspect of the present invention, a kind of Node B equipment of probability of use control speed comprises receiving system, also comprises:
Dispatching control module, according to the RR information of taking out behind the receiving system demultiplexing, statistics sends the number of the UE of RR request, the gap of actual ROT and target ROT, and according to the average Radio Resource X of statistics calculating UE;
Module is gone here and there and is changed scheduling control information;
Module is carried out spread spectrum to I, Q two paths of signals;
Module is carried out 90 ° of phase shifts to Q signal;
Module merges I, Q two paths of signals;
Module is weighted processing to signal;
Module is carried out the scrambling operation to signal;
Module is modulated signal;
Module is carried out radio frequency to signal and is loaded.
According to another aspect of the present invention, a kind of UE equipment of probability of use control speed comprises:
Module is divided into three subclass with setting up at the beginning of the dedicated channel by RNC to the TFCS set of UE appointment;
Module is carried out the selection of the TFC of standard definition in available subset range;
Module, UE makes amendment to the UE pointer of current UE according to the Node B scheduling control information that receives.
Node B of the present invention is by utilizing the control information of common down channel broadcast scheduling, and UE is according to scheduling control information, and the UE pointer is adjusted on probability ground, thereby reaches the purpose to rate controlled.The present invention had both saved the resource of downlink dedicated channels, also saved the power that descending scheduling needs.And can finish the quick control to the speed of UE by Node B, and making that the ROT of Node B is more stable, target ROT can improve accordingly, thereby increases the capacity and the cell coverage area of up-link.
Description of drawings
Fig. 1 is the schematic diagram of Node B pointer and UE pointer;
Fig. 2 is the scheduling process schematic diagram;
Fig. 3 is the explanation of M_ROT and T_ROT;
Fig. 4 is the action flow chart of Node B;
Fig. 5 is the action flow chart of UE;
Fig. 6 is Node B apparatus figure;
Fig. 7 is the apparatus figure of UE.
Embodiment
The present invention is the method based on the rate scheduling of probability of a kind of Node B control.The essential characteristic of this dispatching method is, given UE with the final decision of scheduling, and the function that is present in the scheduling entity Node B in is to broadcast and helps UE to make the scheduling control information that the speed adjustment is adjudicated.Scheduling entity is at first added up the number of the UE that request is arranged, calculate this average available Radio Resource of each UE constantly, and this information announcement is given all UE the most at last.Each UE carries out the speed adjustment according to Radio Resource and now average each UE Radio Resource number of own rate variation needs with certain probability ground.
As shown in Figure 2,201,202 represent two different UE, and 203 represent Node B.At first be that UE sends the request of raising UE pointer respectively by dedicated channel 204,205 separately.Then NodeB (203) statistics has the number of the UE of request, and calculates average Radio Resource, and finally gives all UE by a common channel that is used to dispatch (206) with this information broadcast.Last UE makes the decision that speed is adjusted according to the situation of oneself.
Method of the present invention comprises following important process:
1) statistics is wished the number N of the UE of raising UE pointer;
2) measure this dispatching cycle of interior average ROT (M_ROT), and the gap of M_ROT and target ROT (T_ROT);
3) calculate the available average Radio Resource of each UE, and in the sub-district, broadcast;
4) each UE calculates the probability of adjusting the UE pointer, and adjusts with this probability.
Below, each process is described in detail.
Process 1, Node B statistics are wished the number N of the UE of raising UE pointer.In TR25.896, in the rate scheduling method of Node B control, RR (Rate Request) is that UE is used for notifying Node B, the information that expression is wished to improve the UE pointer or improved the pointer of some UE of going on foot, and whether Node B decides the request of this UE to allow then.
Among the present invention, UE adopts RR to notify Node B, and whether expression wishes to improve the UE pointer.Whether the method for judging is, whether UE has abundant dump power support to increase data rate, and also have lot of data need send etc.This is judged in 25.896 rate scheduling method, existing explanation.If wish to improve the UE pointer, also only expression is wished to improve the UE pointer, does not comprise to wish to improve the UE pointer to which rank of.So RR only needs an information bit just much of that, expression needs to improve the UE pointer or do not need to improve the UE pointer.
What UE are Node B statistics have wish to improve their UE pointer in this dispatching cycle, represent this number with variable N.Certainly, if when M_ROT has surpassed T_ROT, when Node B wished that some UE reduce their UE pointer, the UE of all support EUDCH functions might reduce the UE pointer this sub-district in.In this time, variable N represents that all support the number of the UE of EUDCH function in this sub-district.
Process 2 is measured the M_ROT in this dispatching cycle, and the gap of calculating M_ROT and T_ROT.T_ROT is the optimum ROT of system, if the actual ROT of system surpasses T_ROT, the link performance of system can reduce significantly.If the actual ROT of system is lower than T_ROT, there is the situation of waste Radio Resource.So keeping the ROT of system is the target of Node B scheduling as best one can near T_ROT.Because ROT is a continually varying amount, the mean value that we define ROT in the dispatching cycle is M_ROT.By scheduling, make M_ROT as best one can near T_ROT.
Referring to Fig. 3, the relation of M_ROT and T_ROT is described.The 301st, T_ROT can be by the uplink interference of this sub-district of calculating, the interference of adjacent sub-district, and factors such as system's thermal noise of Node B, the value of an optimum of selection, it generally remained unchanged in a period of time, and was the target of Node B fast dispatch algorithm.The 302nd, M_ROT because M_ROT be one dispatching cycle ROT mean value, be a value in each cycle, between different cycles, always constantly changing.303 are meant the gap between T_ROT and the M_ROT, and it can just can be born.The purpose of Node B scheduling is exactly that will to keep 303 variance as much as possible little.
In this process, Node B is by measuring the M_ROT in this dispatching cycle, and calculates the gap (303) of M_ROT and T_ROT.If M_ROT＜T_ROT, some users still can improve transmission rate, if M_ROT＞T_ROT, some UE need reduce their message transmission rate.Process 3 is calculated the available average Radio Resource of each UE, and broadcasts in the sub-district.We know that ROT is defined as
Wherein, Io is all signal strength signal intensity sums that Node B receives, i.e. the overall with band received signal power spectrum density of Node B, and No is the power spectral density of the thermal noise of Node B.Promptly
S wherein
iBe that i UE is in the received power of Node B end in the sub-district, n is the number of the UE sub-district in, Ioc be all from the power of the interference signal of adjacent sub-district with.If certain UE changes transmission rate, must change transmitting power, at Node B end, the variation of the received power of this UE is bound to the variation of ROT is had contribution, because the received power S of this UE so
iVariation has taken place.Be the variation of UE transmitting power, the ROT of Node B side is had direct influence.
Because No is the power spectral density of the thermal noise of receiving system Node B, it is a time dependent hardly amount, and UE and do not know the size of power spectral density No of the thermal noise of Node B, so will deducting the later result of this factor, we are defined as Radio Resource.
Like this, if there be N UE in the system, the available average Radio Resource of each UE is:
X＝(T_ROT-M_ROT)*N
0/N (3)
Here, N is the result of first step statistics.Be exactly that, as T_ROT during greater than M_ROT, N is the number that sends the UE of RR request in this dispatching cycle, total otherwise N be support EUDCH function in this sub-district UE number.
In fact, this average Radio Resource is exactly the increment that can be used for changing the needed transmitting power of transmission rate for each UE.Node B gives this information broadcast the UE of this sub-district by the common signal channel of a special use.From the angle of scheduling, average wireless resource information is a kind of scheduling control information.
Process 4, each UE calculates the probability of adjusting the UE pointer, and adjusts with this probability.
All UE need to receive the scheduling control information that Node B sends by common signal channel.If the average Radio Resource X that receives on the occasion of, illustrate that then the M_ROT of Node B is lower than T_ROT, exist UE to improve the possibility of UE pointer.And if certain UE had sent the request that improves the UE pointer in a last dispatching cycle by RR, the operation below then continuing:
Increase peak transfer rate to desired speed if UE at first calculates, then need the transmitting power Δ P that increases relatively at present.Then compare Δ P and X (the average Radio Resource of receiving).If X, then shows the transmitting power increment Delta P of the average obtainable average Radio Resource of each UE greater than these UE needs greater than Δ P, then UE can improve the UE pointer certainly on desired transmission rate.Otherwise, the transmitting power increment Delta P that the average obtainable average Radio Resource of each UE needs less than this UE is described, UE should reduce the possibility that improves the UE pointer, and in this case, the probability that UE improves the UE pointer is X/ Δ P.Concrete operation is exactly the random number that produces between 0 to 1, if random number less than X/ Δ P, UE improves the UE pointer of oneself, otherwise does not change current UE pointer.
If certain UE had not sent the request that improves the UE pointer in a last dispatching cycle certainly, UE does not do any response to this message, because this UE does not increase the hope of peak transfer rate.
If the average Radio Resource X that receives is a negative value, illustrate that then the current M_ROT of Node B is higher than T_ROT, the UE of part need reduce transmission rate, so that reduce the current ROT value of Node B.Each UE needs to carry out following operation so:
The transmission rate of UE calculation assumption oneself reduces one-level downwards, and the transmitting power that can reduce is Δ P
1If Δ P
1Less than the absolute value of X, reduce the transmitting power Δ P that two-stage can reduce if then calculate transmission rate
2If, Δ P
2Also, then continue to calculate to reduce more multi-level transmission rate, up to Δ P less than the absolute value of X
kGreater than the absolute value of X or transmission rate reduce to can not be littler till (because the reason of QoS, some business may require the transmission rate of UE must guarantee to be not less than certain value), then make Δ P=Δ P
k, ABS (X/ Δ P) reduces the probable value of UE pointer for this UE.Random number between UE produces one 0 to 1 then, if the random number that UE produces less than ABS (X/ Δ P), then the pointer of UE reduces the k level downwards, otherwise the UE pointer of this UE need not change.
After these four processes finish, just begin Next dispatching cycle, repeating four processes once more.
The action flow chart of Node B in scheduling process seen Fig. 4.
In step 401, Node B added up in this dispatching cycle, and request improves the number of the UE of UE pointer.Concrete operation is that Node B can solve the information of RR when separating the dedicated channel of each UE.Because UE can represent whether wish to improve the UE pointer, so Node B can know each UE whether request is arranged at RR, thereby counts in this dispatching cycle, wish the number N ' of the UE of raising UE pointer request.Then carry out the operation of step 402.
In step 402, Node B measures the average R OT situation in this dispatching cycle, is designated as M_ROT.This is relatively preparing for next step.Then carry out the comparison of step 403.
403 operations are comparisons, are that M_ROT and T_ROT compare.If T_ROT is greater than M_ROT, illustrate that current ROT is less than target ROT, still exist Radio Resource to utilize, also be that some UE have the space of improving the UE pointer, then turn to step 404, otherwise turn to step 405, illustrate that current ROT has still surpassed target ROT, the UE of part need reduce their transmission rate.
In step 404, owing to be the UE pointer that can improve part UE, the number N that the UE pointer may be changed equals to have the number N of the UE of RR request '.Similarly, in step 405, owing to need to reduce the UE pointer of part UE, the number N that the UE pointer may be changed equals to support in this sub-district the number of the UE of EDCH.Here, our supposition, when needs reduce M_ROT, all obligated minimizing transmission rate of the UE of all support EDCH this sub-district in, but except those have used the UE of minimum transmission rate of regulation.
In step 406, Node B calculates the Radio Resource X that average each UE can obtain, if the value of average Radio Resource X illustrate that then UE may promote the UE pointer of oneself, otherwise UE may need to reduce the UE pointer of oneself for just.The formula that calculates average Radio Resource is referring to formula definition 3.
In step 407, Node B broadcasts average Radio Resource X in the sub-district at last.Enter next dispatching cycle then.
The action flow chart of UE in scheduling process seen Fig. 5.
Whether in the first step 501, UE need judge whether need to send to improve the request of UE pointer, and the information of reference has, and whether UE has abundant dump power to increase data rate, and also have lot of data need send etc.In the rate scheduling method of TR25.896, existing explanation not within the scope of the invention, is no longer described in detail in this judgement.Send the request that improves the UE pointer if desired, then make RR=1 (step 502), otherwise make not request of RR=0 (step 503) expression.Send RR then.Then carry out step 504.
In step 504, UE receives the average wireless resource information X of sub-district.Even UE does not send the RR request, UE also needs to receive the broadcasting of average wireless resource information X, because might need UE to reduce the UE pointer.Then in step 505, average wireless resource information X is judged.If X then enters 506 operations for just, otherwise enter 520 operations.
In the step 506, UE then once judges, whether UE had sent the RR request in last dispatching cycle, if, illustrate that UE wishes to improve the UE pointer, then change step 507 over to, otherwise, illustrate that UE wishes to keep present situation constant, then changes step 512 over to.In step 507, UE decides to wish what value the UE pointer brings up to according to dump power and size of data earlier, calculates the transmitting power Δ P that needs increase accordingly then.
In the step 508, the power Δ P that relatively average Radio Resource X of UE and increase UE pointer need, if X is greater than Δ P, illustrate that the average obtainable Radio Resource of each UE is all greater than UE desired power Δ P, so in following step 509, UE improves the UE pointer of oneself to desired value, otherwise, the average obtainable Radio Resource of each UE is all less than UE desired power Δ P, UE can only be with the raising UE pointer of certain probability, so carry out following 510,511,512 operation.
Step 510,511,512 operation be to allow the raising UE pointer of UE with certain probability.In 509, the random number R and between UE produces 0 and 1 earlier then in step 510, compares the size of Rand and X/ Δ P.If Rand is little, then its UE pointer of UE raising arrives desired value (509 operation), otherwise UE hold mode constant (512).No matter UE has finally improved UE pointer (509) or hold mode constant (512), all turn to end (next dispatching cycle of beginning).
In the judgement of preceding step 505,, then change step 520 over to, reduce the sequence of operations (step 520 to 526) of UE pointer if average wireless resource information X is a negative value.Do not reach average Radio Resource because might the UE pointer reduce the transmitting power that one-level reduces,, constantly reduce the UE pointer, up to the gross power Δ P that reduces so 520,521,522,523 are circulations
iTill reducing to the minimum-rate of setting greater than the value Abs (X) of average Radio Resource or transmission rate.I is the progression that the UE pointer need reduce.
Step 524,525,526th, allow the reduction UE pointer of UE with certain probability.In step 524, the random number R and between UE produces 0 to 1 earlier then in step 525, compares Rand and ABS (X/ Δ P
i) size.ABS (X/ Δ P
i) be (X/ Δ P
i) absolute value.If Rand is less than ABS (X/ Δ P
i), then UE reduces its UE pointer i level (526), otherwise UE hold mode constant (512).No matter UE has finally reduced UE pointer (526) or hold mode constant (512), also all turn to end (next dispatching cycle of beginning).
Fig. 6 is to have used the equipment drawing based on the Node B after the method for probability rate controlled of the present invention.
Referring to Fig. 6, the 614th, dispatching control module, its major function has: 1) according to the RR information (606) of taking out behind the receiving system demultiplexing, statistics sends the number of the UE of RR request, 2) the result gap of actual ROT and target ROT, and according to 1) calculates the average Radio Resource X (615) of UE.From the scheduling angle, the average Radio Resource of UE is also referred to as scheduling control information (615).Statistics sends the method for number of UE of RR request and the algorithm that calculates average Radio Resource and sees before in the detailed description of face inventive method.
After dispatching control module 614 produced scheduling control information (615), module 616 to 623 was responsible for by common signal channel it being broadcasted away.
616 modules are gone here and there to scheduling control information and are changed, 617 modules are to I, the Q two paths of signals carries out spread spectrum, 618 modules are carried out 90 phase shifts to Q road signal, 619 modules are to I, and the Q two paths of signals merges, and 620 modules are handled signal weighting, 621 modules are modulated (622) and radio frequency at last again and are loaded (623) again to the signal scrambling operation.Finally, send by antenna 625.
Fig. 7 has been to use the equipment drawing when carrying out the TFC selection of the UE behind the present invention
After the processing through 701 modules, formed the TFCS set A that present UE can use.Be noted that, this UE can with TFCS set A and the UE that describes of the UE pointer TFCS subclass that allows to use be not a notion, the former is that UE operates the set that draws according to the algorithm of information via 701 modules of self, and the latter is, Node B is according to the UE pointer of ROT control, and the UE that forms allows the TFCS subclass of use.
The function of module 703 is to carry out the selection of the operative algorithm-TFC of standard definition in the scope of set A, the next TFC that uses of final decision.
Adopting the module that increases behind the present invention is 702.The function of module 702 is, according to the NodeB scheduling control information that receives the UE pointer of current UE made amendment, and concrete modification algorithm is seen Fig. 5.After the modification through the UE pointer, the UE that has formed up-to-date Node B control allows the TFC subclass of use.
Simultaneously, 703 modules are when doing the TFC selection operation, and the range of choice of TFC is the common factor that the UE of at present available TFC set A (producing from module 701) and Node B control allows the TFC subclass (from module 702 generations) used.
Claims (15)
1. the method based on the rate scheduling of probability of Node B control comprises step:
Whether the UE decision sends the request that improves the UE pointer, and sends by RR;
Node B statistics is wished the number of the UE of raising UE pointer;
Node B measures the average ROT in this dispatching cycle, and the gap of calculating M_ROT and T_ROT;
Node B calculates the average Radio Resource of UE, and broadcasts in the sub-district;
UE calculates the probability of adjusting the UE pointer, and adjusts message transmission rate with this probability.
2. by the described method of claim 1, it is characterized in that when UE sends the request of raising UE pointer, only having comprised the information of whether wishing to improve the UE pointer among the RR.
3. by the described method of claim 1, it is characterized in that the available average Radio Resource of each UE is in the scheduling control information of Node B transmission:
X＝(T_ROT-M_ROT)*N
0/N。
4. by the described method of claim 3, it is characterized in that selecting UE number N: if T_ROT during greater than M_ROT, N is the number that application improves the UE of UE pointer, otherwise N is the number of the UE of the support EUDCH sub-district in.
5. by in the described method of claim 3, it is characterized in that after calculating average Radio Resource NodeB goes out this information broadcast by a common signal channel that is used to dispatch.
6. by the described method of claim 1, it is characterized in that UE all in the sub-district need the receiving scheduling control information when the control information of Node B broadcast scheduling.
7. by the described method of claim 1, it is characterized in that: UE determines whether to have sent in advance the RR request earlier, if not, then do not do any operation, if calculate again owing to improve the needed transmitting power increment Delta of UE pointer P, if Δ P is greater than average Radio Resource X, UE can improve the UE pointer certainly on desired transmission rate, and otherwise, the probability that UE improves the UE pointer is X/ Δ P.
8. by the described method of claim 1, it is characterized in that: when the average Radio Resource X that receives as UE was negative value, the transmission rate of UE calculation assumption oneself reduced one-level downwards, and the transmitting power that can reduce is Δ P
1If, Δ P
1Less than the absolute value of X, reduce the transmitting power Δ P that two-stage can reduce if then calculate transmission rate
2If, Δ P
2Also, then continue to calculate to reduce more multi-level transmission rate, up to Δ P less than the absolute value of X
kGreater than the absolute value of X or transmission rate reduce to can not be littler till.
9. by the described method of claim 8, it is characterized in that the probability that UE reduces the UE pointer is X/ Δ P
k
10. a Node B equipment that uses claim 1 method comprises receiving system, it is characterized in that also comprising:
Dispatching control module (614), according to the RR information of taking out behind the receiving system demultiplexing, statistics sends the number of the UE of RR request, the gap of actual ROT and target ROT, and according to the average Radio Resource X of statistics calculating UE;
Module (616) is gone here and there and is changed scheduling control information;
Module (617) is carried out spread spectrum to I, Q two paths of signals;
Module (618) is carried out 90 ° of phase shifts to Q signal;
Module (619) merges I, Q two paths of signals;
Module (620) is weighted processing to signal;
Module (621) is carried out the scrambling operation to signal;
Module (622) is modulated signal;
Module (623) is carried out radio frequency to signal and is loaded.
11. a UE equipment that uses claim 1 method comprises:
Module (701) is divided into three subclass with setting up at the beginning of the dedicated channel by RNC to the TFCS set of UE appointment;
Module (703) is carried out the selection of the TFC of standard definition in available subset range;
It is characterized in that also comprising module (702), UE makes amendment to the UE pointer of current UE according to the Node B scheduling control information that receives.
12., it is characterized in that described three subclass comprise by the described equipment of claim 11:
Available TFCS set, the TFCS set that surpasses maximum power and disabled TFCS set.
13., it is characterized in that available subclass comprises that the UE that TFC gathers and module (702) produces that is produced by module (701) allows the TFC subclass of using by claim 11 or 12 described equipment.
14. by the described equipment of claim 11, it is characterized in that the UE pointer of current UE made amendment and comprise:: UE determines whether to have sent in advance the RR request earlier, if not, then do not do any operation, if calculate again owing to improve the needed transmitting power increment Delta of UE pointer P, if Δ P is greater than average Radio Resource X, UE can improve the UE pointer certainly on desired transmission rate, and otherwise, the probability that UE improves the UE pointer is X/ Δ P.
15. by the described equipment of claim 11, it is characterized in that the UE pointer of current UE made amendment and comprise: when the average Radio Resource X that receives as UE is negative value, the transmission rate of UE calculation assumption oneself reduces one-level downwards, and the transmitting power that can reduce is Δ P
1If, Δ P
1Less than the absolute value of X, reduce the transmitting power Δ P that two-stage can reduce if then calculate transmission rate
2If, Δ P
2Also, then continue to calculate to reduce more multi-level transmission rate, up to Δ P less than the absolute value of X
kGreater than the absolute value of X or transmission rate reduce to can not be littler till.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 200410004957 CN1655473A (en) | 2004-02-13 | 2004-02-13 | Node B controlled probability-based speed regulating method and apparatus |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 200410004957 CN1655473A (en) | 2004-02-13 | 2004-02-13 | Node B controlled probability-based speed regulating method and apparatus |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN1655473A true CN1655473A (en) | 2005-08-17 |
Family
ID=34892044
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN 200410004957 Pending CN1655473A (en) | 2004-02-13 | 2004-02-13 | Node B controlled probability-based speed regulating method and apparatus |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN1655473A (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101299885A (en) * | 2005-09-22 | 2008-11-05 | 三菱电机株式会社 | Method for communication |
| CN100459751C (en) * | 2006-07-07 | 2009-02-04 | 华为技术有限公司 | Uplink dispatch method controlled by base station |
| WO2010043081A1 (en) * | 2008-10-15 | 2010-04-22 | 中兴通讯股份有限公司 | Method for adjusting broadcast and multicast forward channel resource |
| CN101370274B (en) * | 2007-08-13 | 2011-08-24 | 中兴通讯股份有限公司 | Down-regulation method for special channel transmission rate |
| CN101365171B (en) * | 2007-08-10 | 2011-09-21 | 中兴通讯股份有限公司 | Dedicated channel service transmission rate regulating method and device |
-
2004
- 2004-02-13 CN CN 200410004957 patent/CN1655473A/en active Pending
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101299885A (en) * | 2005-09-22 | 2008-11-05 | 三菱电机株式会社 | Method for communication |
| CN101299885B (en) * | 2005-09-22 | 2014-08-20 | 黑莓有限公司 | Method for communication |
| CN100459751C (en) * | 2006-07-07 | 2009-02-04 | 华为技术有限公司 | Uplink dispatch method controlled by base station |
| CN101365171B (en) * | 2007-08-10 | 2011-09-21 | 中兴通讯股份有限公司 | Dedicated channel service transmission rate regulating method and device |
| CN101370274B (en) * | 2007-08-13 | 2011-08-24 | 中兴通讯股份有限公司 | Down-regulation method for special channel transmission rate |
| WO2010043081A1 (en) * | 2008-10-15 | 2010-04-22 | 中兴通讯股份有限公司 | Method for adjusting broadcast and multicast forward channel resource |
| CN102172083B (en) * | 2008-10-15 | 2013-06-05 | 中兴通讯股份有限公司 | Method for adjusting broadcast and multicast forward channel resource |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN1109477C (en) | Method for channel allocation utilizing power restrictions | |
| CA2730364C (en) | Method and apparatus for high rate data transmission in wireless communication | |
| CN102647796B (en) | Method and device for upstream resource allocation | |
| CN1914835A (en) | An apparatus and method for distributing a transmission power in a cellular communications network | |
| CN1500318A (en) | Method and appts. for controlling transit power of multiple channels in CDMA communication system | |
| CN1893335A (en) | Method for supporting multi-stage modulation by controlling high-speed down-converter grouped access system | |
| CN101080882A (en) | Radio communication system, mobile station, base station, radio communication system control method used for the same, and program of the same | |
| CN1751467A (en) | System and method for uplink rate selection during soft handover | |
| CN1574681A (en) | Adjusting the transmission power of a forward access channel (fach), and a corresponding network for mobile telecommunications | |
| CN1905754A (en) | System and method for scheduling uplink in a communication system | |
| CN1175691C (en) | Method for controlling transmitted power in mobile communication system | |
| CN1893305A (en) | Base station and transmission power control method | |
| CN101064899A (en) | Method for measuring adjacent cell and user terminal | |
| CN1617479A (en) | Method for supporting pilot frequency enhancement in up line special channel enhancement in broad band CDMA | |
| CN1702980A (en) | Method for determining threshold value for on/off controlling output power of mobile communication terminal | |
| CN1913389A (en) | Method of controlling mobile communication system, control device, and mobile communication system | |
| CN1788436A (en) | Base station, mobile station, communication system, and communication method | |
| CN1815923A (en) | Radio communication apparatus | |
| CN1433603A (en) | Apparatus and method for gated transmission in CDMA communication system | |
| CN1839567A (en) | Mobile communication system, mobile station, and radio control device | |
| CN1242646C (en) | Method for processing resource management in a mobile communication system | |
| EP1825606B1 (en) | Power link margin for high-speed downlink packet access | |
| CN1917393A (en) | Method and device for controlling up going transmission power | |
| CN1655472A (en) | Method and apparatus for controlling transmission speed in transmitting power dispatching on a terminal | |
| CN1627844A (en) | Dispatching method controlled from base station for enhancing up going dedicated channel in mobile communication system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C02 | Deemed withdrawal of patent application after publication (patent law 2001) | ||
| WD01 | Invention patent application deemed withdrawn after publication |