CN100474974C - Grant channel scheduling - Google Patents

Abstract

The invention discloses methods and apparatus for scheduling grant channels to carry grant messages to a plurality of scheduled mobile stations. The scheduling of grant channels involves statically assigning atleast on grant channel to each mobile station to monitor, and dinamically assigning to a current mobile station of the plurality of scheduled mobile stations, a previously unassigned grant channel from a list of grant channels monitored by the current mobile station (300). If there are more mobile stations to be processed in the plurality of scheduled mobile stations (302), then the scheduling moves to a next mobile station in the plurality of scheduled mobile stations (304), and the assignment process is repeated. Furthermore, if not every grant channel has been assigned a mobile station (306), then the order of the plurality of scheduled mobile stations is rearranged (308), and the assignment and the movement processes are repeated.

Description

Grant channel distributes

Require the priority under 35 sections 119 in U.S.

Present patent application requires in the priority of the 60/463rd, No. 414 provisional application that is entitled as " grant channel distribution " of submission on April 15th, 2003, and licenses to the application's assignee at this, and is hereby incorporated by.

Technical field

Embodiment disclosed by the invention relates in general to communication network, relates to more specifically in this network grant channel is distributed to travelling carriage.

Background technology

It can be that move or fixing being called high speed data rate (HDR) subscriber station or the travelling carriage (MS) that access terminal at this, and can communicate by letter in this HDR base station (BS) that is called modem pool transceiver with one or more.Access terminal and hitherward be called the HDR base station controller transmission packet of modem pool controller and receive packet from the HDR base station controller by one or more modem pool transceiver.Modem pool transceiver and modem pool controller are the parts that is called as the network of access network.Access network is transmits data packets between a plurality of accessing terminal.Access network can also be connected to outside the access network such as other such network of company intranet and internet, and can each access terminal and this external network between transmits data packets.Be called activity and access terminal, and be called as and be in service condition with one or more modem pool transceiver accessing terminal of setting up that active traffic channel is connected.Be in accessing terminal to be called as to be in and be connected the state of foundation in the active traffic channel connection processing of setting up with one or more modem pool transceiver.Accessing terminal can be arbitrarily by wireless channel or the data equipment by wire message way (for example utilizing optical fiber or coaxial cable) communication.Accessing terminal can also be any one of polytype equipment that includes but not limited to PC card, mini-flash, outside or internal modems or mobile or fixed line telephone.Access terminal and be called reverse link to the modem pool transceiver transmission communication link that signal passed through.Modem pool transceiver sends the communication link that signal passed through to accessing terminal and is called forward link.

In the different system configuration of HDR access network, base station (BS) can use special-purpose grant channel (GCH) to issue travelling carriage (MS)-specific allowance, permits such as reverse enhanced auxiliary channel (R-ESCH).According to these system configuration, special-purpose GCH can only transmit the information of single MS.Like this, if more than one MS need be dispatched simultaneously, must use more than one GCH so in particular time-slot.The number of the grant channel that uses is by the number of mobile stations decision that can be dispatched simultaneously in same time slot, and also the existence by public grant channel determines.

Therefore, in order to guarantee notified relevant this allowance of travelling carriage, each travelling carriage can monitor each dedicated channel in the grant channel.Under the sort of situation, as long as the scheduled mobile stations number is no more than the number of grant channel in a time slot, then each scheduled mobile stations can notified relevant this allowance.Yet this supervision to each special-purpose grant channel needs each travelling carriage to monitor the parallel codes channel of suitable big figure, and has increased the complexity that travelling carriage is handled.In order to reduce processing required in the travelling carriage, the subclass of grant channel can be distributed to each travelling carriage and monitor.Yet, require travelling carriage only to monitor that the subclass of grant channel means, may exist not is that each scheduled mobile stations is when can both be informed to relevant this allowance.This performance loss of anticipating comprises the failure of GCH notice, is referred to herein as " GCH break (outage) " and is owing to the contradiction between the subclass that is assigned with causes.

Based on the above discussion, it is apparent that to have a kind of demand, make each travelling carriage supervision be less than whole available dedicated grant channels for each travelling carriage thereby be about to the grant channel vaild notice.The present invention just can address that need.

Summary of the invention

Embodiment disclosed herein distributes to travelling carriage effectively with grant channel, makes each travelling carriage monitor and is less than whole available dedicated grant channels.Grant channel is distributed to travelling carriage comprised that the selection of grant channel is to send notice to each scheduled mobile stations.

On the one hand, grant channel is scheduled and sends a plurality of scheduled mobile stations to will permit message.Particularly, the scheduling of grant channel is comprised that the previous grant channel dynamic assignment that is not assigned with in the grant channel tabulation that will be monitored by current mobile station gives the current mobile station in a plurality of scheduled mobile stations.After having dispatched current mobile station, if also exist other travelling carriage processed in a plurality of scheduled mobile stations, this scheduling moves to the next travelling carriage in a plurality of scheduled mobile stations so, and duplicate allocation is handled.In addition,, rearrange the order of a plurality of scheduled mobile stations so if be not that each grant channel all has been assigned to travelling carriage, and duplicate allocation and mobile the processing.

On the other hand, also comprise to travelling carriage scheduling grant channel and monitor to each travelling carriage at least one grant channel static allocation.In one embodiment, static allocation comprises distributes to one of them grant channel in order with in first group of a plurality of travelling carriage each, till all available grant channels all had been assigned with, wherein first group of a plurality of travelling carriage were subclass of the set of the travelling carriage that comprises that all move in the cdma communication network area.Static allocation has also comprised will remain the grant channel that travelling carriage is distributed to first group of similar number in order.In another embodiment, static allocation comprises that the set of picked at random grant channel from the grant channel that is monitored monitors to distribute to each travelling carriage.

On the other hand, the cdma communication network with a base station and a plurality of travelling carriages has comprised the base station that is equipped with controller, and this controller is configured to dispatch grant channel makes it send allowance information to a plurality of scheduled mobile stations.This controller comprises the grant channel distribution module, and this module is operated the previous grant channel that is not assigned with in the grant channel tabulation that will be monitored by current mobile station and distributed to current mobile station in a plurality of travelling carriages that are scheduled.The base station also comprises the modulator that is configured to handle and expand allowance message.The base station also comprises transmitter unit, and this transmitter unit is configured to regulate the allowance message of having handled, generates forward link signal and sends forward link signal by grant channel.

According to following description to exemplary embodiment, other features and advantages of the present invention will be clearly, and wherein this exemplary embodiment has illustrated principle of the present invention by way of example.

Description of drawings

Fig. 1 has illustrated the exemplary configuration of grant channel being distributed to travelling carriage;

Fig. 2 A, Fig. 2 B and Fig. 2 C have illustrated selection or have distributed and will permit exemplary " dynamically " processing that message sends the grant channel of scheduled mobile stations to;

Fig. 3 has summarized the A at Fig. 2, " greed " technology that the exemplary dynamic described in Fig. 2 B and Fig. 2 C is used in selecting to handle;

Fig. 4 has illustrated that the exemplary grant channel of being represented by relative reverse link efficient distributes the simulation result of performance, wherein the number of mobile stations of every timeslot scheduling 1,2 ..., k} is last evenly to distribute;

Fig. 5 has illustrated by relative reverse link efficient and has represented that exemplary grant channel distributes the simulation result of performance that wherein the number of mobile stations of every time slot allocation is obeyed following probability distribution: P (0), P (1), P (8)={ 0.00860689,0.0458367,0.172538,0.303443,0.269816,0.138511,0.0490392,0.0104083,0.00180144};

Fig. 6 has illustrated the simplified block diagram such as the such cdma communication system of HDR Access Network;

Fig. 7 has illustrated the simplified block diagram such as the such cdma communication system of 1xEV-DV Access Network.

Embodiment

The specific descriptions that following connection with figures proposes are descriptions of wanting as to exemplary embodiment of the present, can not realize unique embodiment of the present invention and really want representative.The term " exemplary " that uses in the whole text during this describes refers to " as an example, example, or legend works ", and should not be understood that than other embodiment more preferably or more favourable.This detailed description has comprised and has been used for thorough specific detail of the present invention.Yet, it should be apparent to those skilled in the art that and not utilize these specific detail also can realize the present invention.In some instances, known structure and equipment show with the figure of block diagram form, thereby avoid confusion notion of the present invention.In these figures, identical Reference numeral is represented identical structure.

As mentioned above, when only monitoring to each travelling carriage the subset allocation of grant channel, may exist not is that each scheduled mobile stations is when can both be informed to allowance.It is this because the estimated performance loss (that is, " GCH broken string ") that the contradiction between the subclass that is assigned with causes is undesirable.As described here, what can illustrate is if each travelling carriage can monitor two or more grant channels, then because the estimated performance that " GCH broken string " causes loss can't be very big.In addition, by being distributed to each travelling carriage effectively, grant channel monitors, and by (from the grant channel that is assigned with) selection grant channel is to send notice to each scheduled mobile stations effectively, the performance loss of expection can further be reduced.

In the following description, grant channel is distributed to each travelling carriage monitor that being called as " static state " distributes, because this distribution is mostly just in the initialization of travelling carriage or similar just execution is once during initialized.From the grant channel of static allocation, select grant channel to be called as " dynamically " distribution,, and may select different grant channels in each time slot because this selection may be repeated.

Fig. 1 has illustrated the exemplary configuration of grant channel being distributed to travelling carriage in cdma system.This exemplary configuration has comprised four special-purpose grant channel GCH1, GCH2, GCH3, GCH4; With seven mobile station MSs 1, MS2, MS3, MS4, MS5, MS6, and MS7.Each travelling carriage just monitors that two grant channels are to receive the allowance notice.GCH1 is all come from the base station to the allowance of GCH4 notice.In illustrated configuration, first mobile station MS 1 monitors grant channel GCH2 and GCH4; Mobile station MS 2 monitors grant channel GCH3 and GCH4; Mobile station MS 3 monitors grant channel GCH3 and GCH4; Mobile station MS 4 monitors grant channel GCH1 and GCH2; Mobile station MS 5 monitors grant channel GCH2 and GCH4; Mobile station MS 6 monitors grant channel GCH1 and GCH4; And mobile station MS 7 monitors grant channel GCH1 and GCH3.In Fig. 1, the grant channel that each travelling carriage monitors is by representing to the line of the grant channel that is monitored that stems from the base station from travelling carriage.

In the exemplary configuration of Fig. 1, the base station can be by sending the allowance to mobile station MS 1 on grant channel GCH4, thereby mobile station MS 1, MS2 and MS5 are dispatched in the allowance of mobile station MS 5 sending on the grant channel GCH3 to send in particular time-slot to the allowance of mobile station MS 2 with on grant channel GCH2.Be shown as dotted line among Fig. 1 corresponding to the line of this scheduling mapping.Because can there be the GCH broken string in the base station for each distribution grant channel of three travelling carriages in this scheduling mapping.Yet, if mobile station MS 3 also will be dispatched in the base station in same time slot, the GCH broken string will take place so, can be the mapping of each the distribution grant channel among four scheduling mobile station MS 1, MS2, MS3 and the MS5 because do not exist for exemplary configuration in the case.That is, in the configuration of Fig. 1, have only three grant channel GCH2, GCH3 and GCH4 are at four mobile station MSs 1, and MS2 is monitored in the middle of MS3 and the MS5.Like this, in the scheduling mapping of this suggestion, because be less than the distribution of effectively grant channel being given travelling carriage, the GCH broken string can take place.

Recognize above-mentioned effective distribution grant channel monitors for each travelling carriage and selects grant channel to transmit be notified to the needs that each dispatches travelling carriage, this disclosure has been described the exemplary embodiment of this distribution and/or selection.Particularly, the technology of " dynamically " and " static state " distribution will be in following detailed description.Even it should be understood, however, that grant channel is carried out " effectively " also can cause " GCH " broken string because of the restriction of system resource when being assigned.

Fig. 2 A, Fig. 2 B and Fig. 2 C have illustrated that exemplary " dynamically " handle, and the selected or distribution of grant channel will be permitted message and send scheduled mobile stations in this processings.In select handling in exemplary " dynamically ", the grant channel of supposing to be less than special-purpose grant channel sum in " static state " allocation process has been assigned to each travelling carriage and has monitored.Static allocation is handled the hypothesis of being done will be described in further detail following.

Suppose that k is the sum of special-purpose grant channel.This digital k also is the maximum number of the travelling carriage that can be dispatched simultaneously.Usually, k is between 2 to 8.Equally, suppose that 1 is the number that is assigned to the grant channel of each travelling carriage supervision.

In one embodiment, one group of r travelling carriage is scheduled in each time slot (for example, 5 milliseconds cycle), wherein can be different from a time slot to another time slot r.The size of travelling carriage set, r can be assumed to { 1,2,, k} is last evenly to distribute, i.e. P (r)=1/k, r=1,, k perhaps obeys following probability distribution: P (r=0), P (r=1),, P (r=8)={ 0.00860689,0.0458367,0.172538,0.303443,0.269816,0.138511,0.0490392,0.0104083,0.00180144}.The probability distribution of back is based on the independent system-level simulation result of reverse link, and this simulation result is to have the FTP user of ten full buffers to obtain in the sector by hypothesis.In addition, the grant channel set { GCH that selects at random ₁, GCH ₂..., GCH ₁Be assigned to each travelling carriage and monitor.

In different embodiment and system configuration, to the distribution of the grant channel that will monitor by travelling carriage or can be by the base station ACTIVE CONTROL, perhaps can be by hash (hash), wherein grant channel is based on predetermined technique and is distributed by pseudorandom ground.

As mentioned above, when each travelling carriage monitors the channel that is less than special-purpose grant channel sum (, 1＜k), wish that then the base station can distribute to grant channel specific travelling carriage effectively at every time slot.This " dynamically " allocating task can be carried out by the search solution, wherein can successfully be distributed to scheduled mobile stations number (being appointed as the r ') maximum of grant channel.

In different embodiment, " dynamically " distribute can adopt check all 1 ^rThe individual exhaustive search that may distribute.Whenever finding this search of branch timing that can make r '=r just can premature termination.For example, when 1=3 and k=r=8, the length of the exhaustive search under the worst case is 3 ⁸=6561.

The another kind of mode of carrying out exhaustive search is to adopt recursion method.In this method, search is carried out in the mode of attempting one by one.In each the trial, be assigned to each travelling carriage from the first available grant channel in 1 grant channel tabulation that is monitored.This distribution is sequentially carried out r travelling carriage according to the tabulation or the ordering of travelling carriage.When travelling carriage because its all grant channels that are monitored all allocate in advance can not be assigned with grant channel to other travelling carriage the time by this technology, this technology traceback (that is, recalling the ordering of travelling carriage with order in the other direction) is until finding one to have at least one and be monitored but till the travelling carriage of the grant channel that is assigned with not yet so.Distribution to that travelling carriage is switched to the next available grant channel that is monitored.Then to remaining this allocation process of travelling carriage retry (that is, this technology is by the ordering of initial direction sequential track travelling carriage).This forward direction-sweep backward is proceeded the distribution that can make r '=r until finding, perhaps until all possibilities all by exhaustive mistake.This recursive algorithm can be less than 1 usually ^rFinish during inferior operation, but that number still may be considered to oversize for some actual enforcements.

In other embodiments, " dynamically " distribution can be taked relatively short search (being sometimes referred to as " greed " technology).In this short search, be assigned to each travelling carriage from the first available grant channel in 1 grant channel tabulation that is monitored.This distribution is carried out r travelling carriage in proper order according to the tabulation or the ordering of travelling carriage.Like this, this distribution will try to distribute grant channel to give travelling carriage 1 * r time, in this mode the tabulation of travelling carriage and/or for the tabulation that is monitored grant channel of each travelling carriage all between these are attempted by (rotate) by turns, or rearrange.For the example of 1=3 and k=r=8, under worst case, 3 * 8=24 sub-distribution will only be arranged, this is than 3 of exhaustive search under the worst case ⁸=6561 less important much smaller number of times.

At Fig. 2 A, during the exemplary dynamic that illustrates among Fig. 2 B and Fig. 2 C is selected to handle, eight grant channels (k=8) are arranged, GCH1 is to GCH8, and each travelling carriage monitors three grant channels (1=3).In addition, eight travelling carriages (r=8) are dispatched in the base station in particular time-slot.Ten travelling carriages are arranged, and MS1 moves in the running boundary of base station to MS10.

Fig. 2 A has shown " static state " of the grant channel that will be monitored by each travelling carriage has been distributed.For example, mobile station MS 1 is assigned to monitor grant channel GCH1, GCH2, and GCH3, and mobile station MS 2 is assigned to monitor grant channel GCH4, GCH5, and GCH6.Also be aligned to form to MS10 for the distribution of the grant channel that will monitor for other mobile station MS 3.

Fig. 2 B has shown a plurality of sequences that may distribute to travelling carriage, and wherein these travelling carriages are dispatched with notified allowance in a particular time-slot.For example, R0 is first sequence, and R1 is second sequence, or the like.Like this, may sequence for first of the exemplary time slot of Fig. 2 B or iteration (iteration) in, mobile station MS 2, MS3, MS4, MS6, MS7, MS8, MS9 and MS10 are carried out scheduling initially, as shown in the R0 of Fig. 2 B is capable.It should be noted, MS2, MS3 ..., the original allocation ordering of MS10 is the default sort of selecting for the purpose that reaches this example at random.Other original allocation ordering also can be used, and depends on system requirements or design performance.In this example, mobile station MS 1 and MS5 are not scheduled.To second of travelling carriage and grant channel may assigned sequence as shown in the R1 of Fig. 2 B is capable, comprising sequence MS3, MS4, MS6, MS7, MS8, MS9, MS10 and MS2.Equally, MS1 and MS5 are not scheduled.

Fig. 2 C has illustrated " dynamically " allocation process of using above-mentioned " greed " technology.For example, by using the tabulation of the scheduled mobile stations in time slot (R0) that shows among the distribution of grant channel being distributed to travelling carriage listed among Fig. 2 A and Fig. 2 B, try travelling carriage is assigned to each grant channel GCH1 to GCH8 in the base station.Use distribute trial to be displayed in the row that are denoted as R0 of Fig. 2 C the first time of the tabulation R0 of Fig. 2 B.

According to " greed " technology, first wants scheduled mobile stations, and MS2 (seeing Fig. 2 B, row R0) is assigned to first grant channel that MS2 is monitoring.Because Fig. 2 A shows that MS2 is monitoring grant channel GCH4, GCH5 and GCH6, mobile station MS 2 is assigned with first channel of these channels, grant channel GCH4.Second mobile station MS that will dispatch 3 monitors grant channel GCH1, GCH7 and GCH8.Like this, because GCH1 before was not assigned with, mobile station MS 3 is assigned with grant channel GCH1.The 3rd mobile station MS that will dispatch 4 monitors grant channel GCH2, GCH3 and GCH4.Like this, mobile station MS 4 is assigned to grant channel GCH2.By distributing other travelling carriage, can produce as result displayed in the row that are denoted as R0 of Fig. 2 C for the distribution of grant channel travelling carriage with similar processing.This has represented and has passed through to use the distribution of the first sequence R0 travelling carriage of travelling carriage to grant channel.Therefore, Fig. 2 C result shows that mobile station MS 3 is assigned with grant channel GCH1, mobile station MS 4 is assigned with grant channel GCH2, mobile station MS 7 is assigned with grant channel GCH3, mobile station MS 2 is assigned with grant channel GCH4, mobile station MS 10 is assigned with grant channel GCH5, and mobile station MS 8 is assigned with grant channel GCH6, and mobile station MS 6 is assigned with grant channel GCH8.Yet this result points out that also mobile station MS 9 can not be scheduled in this time slot, because all available grant channels all are assigned with, this can cause " GCH broken string ".

Refer again to Fig. 2 B, thereby scheduled mobile stations is generated next assigned sequence R1 one by one by turns in the R0 sequence.Capable scheduled mobile stations sequence such as the MS3 of having shown of the R1 of Fig. 2 B, MS4, MS6, MS7, MS8, MS9, MS10 and MS2 are like this." greed " technology is applied on this sequence, and first mobile station MS 3 that will be scheduled in R1 is assigned with first grant channel GCH1 (seeing Fig. 2 A) that MS3 is monitoring.Distribute other travelling carriage by similar processing, travelling carriage can produce as result displayed in the R1 row of Fig. 2 C to the distribution of grant channel.Therefore, this result shows that mobile station MS 3 is assigned with grant channel GCH1, mobile station MS 4 is assigned with grant channel GCH2, mobile station MS 7 is assigned with grant channel GCH3, mobile station MS 10 is assigned with grant channel GCH4, mobile station MS 2 is assigned with grant channel GCH5, and mobile station MS 8 is assigned with grant channel GCH6, and mobile station MS 6 is assigned with grant channel GCH8.Yet this result points out once more that also mobile station MS 9 can not be scheduled in this time slot, and this will cause " GCH broken string " once more.

The above-mentioned sequence of rotating for the travelling carriage that is scheduled can be repeated till the number of the travelling carriage that is scheduled that can successfully distribute to grant channel (r ') is maximum, perhaps up to r ' equal to be scheduled travelling carriage sum (r '=r) till.When r '=r, will no longer include " GCH broken string ".

Because the loss of the reverse link efficient that the GCH broken string causes can be estimated as follows.Suppose the travelling carriage sum of r in a time slot, dispatching.Suppose and come from r the travelling carriage to have only individual can the passing through of r ' to use grant channel notified.So, the individual travelling carriage of remaining r-r ' just is in the GCH broken string state.Then the efficient in this time slot can be calculated as $1-\frac{r-r\′}{r}=\frac{r\′}{r}.$ This efficiency value is guarded, because the loss that causes can be alleviated by methods any or below all because GCH breaks.For example, if there is the travelling carriage that can not be informed to because GCH breaks, other travelling carriage that has outstanding demand so still can be scheduled in identical time slot.The individual travelling carriage of r-r ' that can not be informed to because GCH breaks can be selected from low priority user (between the user who is scheduled).The individual travelling carriage of r-r ' that can not be informed to because GCH breaks can still be scheduled by public grant channel.

Refer again to Fig. 2 B, thereby then consider to be generated by turns the sequence of the travelling carriage that is scheduled of sequence shown in the row R4.The capable R4 of Fig. 2 B has shown the sequence such as the MS7 of the travelling carriage that is scheduled, MS8, and MS9, MS10, MS2, MS3, MS4 and MS6 are like this." greed " technology is applied on this sequence, and first mobile station MS 7 that will be scheduled in this sequence is assigned to the first grant channel GCH3 that MS7 is monitoring.By distributing other travelling carriage, distribute grant channel can produce travelling carriage as result displayed in the row that are denoted as R4 among Fig. 2 C with similar processing.Therefore, this result points out that mobile station MS 9 is assigned with grant channel GCH1, mobile station MS 4 is assigned with grant channel GCH2, mobile station MS 7 is assigned with grant channel GCH3, mobile station MS 10 is assigned with grant channel GCH4, and mobile station MS 2 is assigned with grant channel GCH5, and mobile station MS 8 is assigned with grant channel GCH6, mobile station MS 3 is assigned with grant channel GCH7, and mobile station MS 6 is assigned with grant channel GCH8.Therefore, each in these eight scheduled mobile stations all has been assigned to a grant channel, thereby causes not having " GCH broken string ", as shown in Fig. 2 C.

Summarized among Fig. 3 in Fig. 2 A, Fig. 2 B and described " greed " technology that is used in the exemplary dynamic selection processing of Fig. 2 C.This technology comprises the interior a plurality of sequence permutations by the travelling carriage that is scheduled of a time slot.In one embodiment, first available (unallocated) grant channel during the grant channel that is monitored by current mobile station is tabulated is assigned to current mobile station (seeing box 300).In another embodiment, any unallocated grant channel in the grant channel tabulation is assigned to current mobile station.

To handle (being box 302 output "Yes") if determine in the sequence of travelling carriage that is scheduled, also to exist other travelling carriage, this processing moves to next travelling carriage in the sequence of the travelling carriage that is scheduled on box 304 so, and repeats the processing shown in the box 300.In case grant channel is assigned with, then that grant channel is removed from the tabulation of all available grant channels.Otherwise, to handle (box 302 output "No") if determine in the sequence of travelling carriage that is scheduled, to no longer include other travelling carriage, to determine at box 306 places so whether each grant channel has been assigned to travelling carriage.There is not the GCH broken string in this result who determines for "Yes" will be illustrated in the scheduling grant channel, and the result will represent to exist the GCH broken string and should attempt new distribution for "No".Like this, if detect the GCH broken string at box 306 places, the sequence of the travelling carriage that then is scheduled and/or will be resequenced at box 308 places to the tabulation that is monitored grant channel of each travelling carriage.In one embodiment, the sequence of scheduled mobile stations and/or the grant channel that the is monitored mode of being rotated with the order of the travelling carriage shown in Fig. 2 B is resequenced.For example, in Fig. 2 B, sequence R1 is the distortion by turns of sequence R0.In another embodiment, the sequence of scheduled mobile stations and/or the grant channel that is monitored is resequenced in any way, so that new sequence is different with previous sequence.

If at box 306 places, detect GCH broken string, then after the sequence of the tabulation of the grant channel that has rearranged scheduled mobile stations and/or be monitored, the process of describing in the box 300 and 304 is repeated.If GCH broken string last till always sequence reset by exhaustive and no longer exist before the sequence that is not assigned with, travelling carriage is informed to allowance in the crack at this moment so.In this case, the base station can wait until always that next time slot attempts dispatching by the travelling carriage of GCH broken string influence once more.

Fig. 4 and Fig. 5 have illustrated that exemplary grant channel distributes the simulation result of performance, and its relative reverse link efficient by the grant channel (1) of the different numbers that monitor about each travelling carriage is expressed.If GCH broken string never takes place, then can obtain is 1.0 relative reverse link efficient.Each figure has comprised the curve of the different sums of seven available grant channels of expression (k).Fig. 4 illustrated the supposition every timeslot scheduling the travelling carriage number 1,2 ..., k} is last evenly to distribute, that is, P (r)=1/k, r=1 ..., the reverse link rate during k.Fig. 5 has illustrated that the travelling carriage number of supposing every timeslot scheduling obeys following probability distribution: P (r=0), P (r=1) ..., P (r=8)={ 0.00860689,0.0458367,0.172538,0.303443,0.269816,0.138511,0.0490392,0.0104083, the reverse link efficient during 0.00180144}.

Because the relative efficiency value that Fig. 4 and Fig. 5 show, is not compared so should not do efficiency value between curve by standardization at every curve.That is, these curves do not provide the understanding of the performance difference between the situation of corresponding different value of K.But this curve has provided the understanding for the performance difference between the corresponding different 1 value situations of any given k really.It should be understood that and when calculating chart 4 and reverse link loss in efficiency illustrated in fig. 5, used conservative hypothesis.Therefore, result displayed should be interpreted as the lower limit of aspect of performance herein.

Fig. 4 and emulation shown in Figure 5 are pointed out to monitor that at each travelling carriage (that is, under situation 1=2), the loss of efficient only is about 3% to 5% (that is, relative efficiency is about 95% to 97%) to two grant channels.When each travelling carriage monitored at least three grant channels (that is, 1 〉=3), loss in efficiency is shown can be very big.Like this, this result shows by making each travelling carriage monitor two or three special-purpose grant channels, and reverse link performance can be expected and reached the performance that realizes when making each travelling carriage monitor all grant channels.It should be noted that for select distributing at random, the performance measurement that is more suitable in some cases, is to distribute the probability that GCH broken string number of times is less than or equals given level greater than certain critical value.

Based on above grant channel distribution result, below hypothesis will guarantee enough performances of cdma2000 reverse link.Suppose that travelling carriage has the ability that monitors at least two special-purpose grant channels simultaneously.Suppose that also the base station has to send the ability of the signal of GCH allocation of parameters to travelling carriage such as three layers of such (L3) message of enhanced channel assignment messages (ECAM) and general hand-off direction message (UHDM).On February 17th, 2003 in the file of the standard setting association of 3GPP2 suggestion, be entitled as " cdma2000 reverse link suggestion Rev.D ", in the C30-20030217-011 file, the cdma2000 reverse link has been described.

Explanation more than has been discussed because the simulation result of the estimated performance loss that the GCH broken string causes.Yet these results obtain by supposing that each travelling carriage has under one group of grant channel of selecting at random distributing to it situation of (that is " static state " distributes, at random).Below described different embodiment, it uses the grant channel of nonrandom set.What can demonstrate is that the performance of using the set of the grant channel that is clearly distributed to provide to each travelling carriage is better than the performance of using random collection to provide.In addition, for the even probability distribution of the size of the travelling carriage dispatched in each time slot set (that is, and 1,2 ..., k} is last evenly to distribute), it is best that the reverse link efficient that can demonstrate the grant channel that uses nonrandom set is actually.That is, described belowly be used for that grant channel is gathered the nonrandom technology of distributing to travelling carriage maximum reverse link efficient is provided.

Suppose and be 10 by travelling carriage sum (n) (that is (that is, 1=1), and the grant channel number that can be dispatched simultaneously is 8 (that is, k=8), n=10), to distribute to grant channel number (1) that each travelling carriage monitors and be 1.Travelling carriage is designated as from MS1 to MS10, and grant channel is designated as from GCH1 to GCH8.In addition, the size of supposing the travelling carriage set of dispatching in each time slot is obeyed evenly distribution.So, distribute for the actual optimum that maximal efficiency is provided, this efficient not can less than

$c(n,k)=1-\underset{r=0}{\overset{k}{\mathrm{\Σ}}}P\left(r\right)\frac{\left(\begin{array}{c}n-2\\ r-2\end{array}\right)+\left(\begin{array}{c}n-3\\ r-2\end{array}\right)+\left(\begin{array}{c}n-4\\ r-3\end{array}\right)+\left(\begin{array}{c}n-4\\ r-4\end{array}\right)}{r\·\left(\begin{array}{c}n\\ r\end{array}\right)},---\left(1\right)$

Wherein

$\left(\begin{array}{c}y\\ x\end{array}\right)=0,$ If x＜0, $\left(\begin{array}{c}y\\ x\end{array}\right)=1,$ If x=0, and

P (r) is the probability distribution of the travelling carriage set sizes of dispatching in a time slot.

In the exemplary embodiment that nonrandom " static state " distributes, make many hypothesis as described above, comprised that the size of the travelling carriage set that hypothesis is dispatched is obeyed P (r)=1/k in each time slot, r=1 ..., the even distribution of k.In this exemplary embodiment, by respectively with grant channel GCH1, GCH2, GCH3, GCH4, GCH5, GCH6, GCH7, GCH8, GCH1 and GCH2 distribute to scheduled mobile stations MS1 respectively, MS2, MS3, MS4, MS5, MS6, MS7, MS8, MS9 and MS10 can realize maximum reverse link efficient.

Can realize maximum reverse link efficient in order to verify and to prove, consider following situation by as above definition, grant channel being distributed to travelling carriage.For n=10 travelling carriage, k=8 grant channel that is scheduled, distribute to the grant channel that each travelling carriage monitors with 1=1, the 1st grant channel (being called numbering 1) is assigned to mobile station MS 1 and MS9, and numbers 2 and be assigned to mobile station MS 2 and MS10.In addition, grant channel numbering i, i=3 wherein, 4,5,6,7,8 are assigned to mobile station MS i.

The combination of r different mobile stations by definition, can cause the GCH broken string if it comprises the travelling carriage with identical numbering.From the combination viewpoint, considered unordered combination here.And if the number of different numberings is k-m in the combination, then Zu He broken string Repeated m is inferior, wherein m≤k-1.The combination of r travelling carriage is the set of the travelling carriage dispatched in the time slot.

Cause the number U of the combination of GCH broken string, calculated following.This broken string takes place under three kinds of situations, if x＜0 wherein, $\left(\begin{array}{c}y\\ x\end{array}\right)=0,$ If with x=0, $\left(\begin{array}{c}y\\ x\end{array}\right)=1.$

Under first kind of situation, mobile station MS 1 and MS9 are in combination and mobile station MS 10 does not exist.The number of this various combination is $\left(\begin{array}{c}n-3\\ r-2\end{array}\right).$ In this case, 2 among the r-2 is the numbers that must join the travelling carriage (that is, MS1 and MS9) in all such combinations.Other r-2 travelling carriage is from n-3 mobile station MS 2 in this combination, MS3, and MS4, MS5, MS6 extracts among MS7 and the MS8.

Under second kind of situation, mobile station MS 2 and MS10 be no any additional limits in combination.The number of this various combination is $\left(\begin{array}{c}n-2\\ r-2\end{array}\right).$ In this case, 2 among the r-2 refers to the mobile station MS 2 and the MS10 that must join in all such combinations.Other r-2 travelling carriage is from n-2 mobile station MS 1 in this combination, MS3, and MS4, MS5, MS6, MS7 extracts among MS8 and the MS9.

Under the third situation, mobile station MS 1, MS9 and MS10 are in combination and MS2 does not exist.The number of this various combination is $\left(\begin{array}{c}n-4\\ r-3\end{array}\right).$ In this case, 3 among the r-3 refers to the mobile station MS 1 that must join in all such combinations, MS9, and MS10.Other r-3 travelling carriage is from n-4 mobile station MS 3 in this combination, MS4, and MS5, MS6 extracts among MS7 and the MS8.

More than the combination in three kinds of situations of Kao Lving is different, like this,

$U=\left(\begin{array}{c}n-2\\ r-2\end{array}\right)+\left(\begin{array}{c}n-3\\ r-2\end{array}\right)+\left(\begin{array}{c}n-4\\ r-3\end{array}\right)---\left(3\right)$

So, broken string repeats the number U of twice combination ₂, calculate as follows:

${\mathrm{<figure-callout\; id="2"\; label="U"\; filenames="C200480014395E00261.png,C200480014395E00272.png"\; state="\{\{state\}\}">U</figure-callout>}}_2=\left(\begin{array}{c}n-4\\ r-4\end{array}\right)---\left(4\right)$

Like this, the formula of equation (4) points out that each combination that repeats twice of breaking should comprise mobile station MS 1, MS2, and other r-4 travelling carriage in MS9 and MS10 and this combination is from n-4 mobile station MS 3, MS4, MS5, MS6 extracts among MS7 and the MS8.

For the distribution of above consideration, broken string repeats twice above combination and does not exist.Therefore, expression formula U and U ₂Equation (3) and (4) provide following to U ₁The universal expression formula, U wherein ₁Be to make broken string repeat the number of combination once:

${\mathrm{<figure-callout\; id="1"\; label="U"\; filenames="C200480014395E00261.png,C200480014395E00272.png"\; state="\{\{state\}\}">U</figure-callout>}}_1=\left(\begin{array}{c}n-2\\ r-2\end{array}\right)+\left(\begin{array}{c}n-3\\ r-2\end{array}\right)+\left(\begin{array}{c}n-4\\ r-3\end{array}\right)-\left(\begin{array}{c}n-4\\ r-4\end{array}\right)---\left(5\right)$

Extract r from the sum of n travelling carriage combination is given as at every turn $\left(\begin{array}{c}n\\ r\end{array}\right)$ 。If should combination not have broken string, all r travelling carriage in the channel combination can be by using allowance notified so.If combination repeats once broken string, a travelling carriage in the combination can not use grant channel so.If combination makes broken string repeat twice, two travelling carriages can not use grant channel in the combination so.

If all $\left(\begin{array}{c}n\\ r\end{array}\right)$ Individual combination has identical probability of occurrence, and the average number of so notified travelling carriage is

$b\left(r\right)=\frac{U_0}{\left(\begin{array}{c}n\\ r\end{array}\right)}r+\frac{U_1}{\left(\begin{array}{c}n\\ r\end{array}\right)}(r-1)+\frac{U_2}{\left(\begin{array}{c}n\\ r\end{array}\right)}(r-2)=r-\frac{U_1}{\left(\begin{array}{c}n\\ r\end{array}\right)}-\frac{{2U}_2}{\left(\begin{array}{c}n\\ r\end{array}\right)},---\left(6\right)$

Wherein ${\mathrm{<figure-callout\; id="0"\; label="U"\; filenames="C200480014395E00272.png"\; state="\{\{state\}\}">U</figure-callout>}}_0=\left(\begin{array}{c}n\\ r\end{array}\right)-U_1-{\mathrm{<figure-callout\; id="2"\; label="U"\; filenames="C200480014395E00261.png,C200480014395E00272.png"\; state="\{\{state\}\}">U</figure-callout>}}_2$ Be number and the b (0)=0 that does not have the combination of broken string.Suppose that r is for obeying the stochastic variable of distribution P (r).

The average number of doing standardized notified travelling carriage about r is:

$a\left(r\right)=\frac{b\left(r\right)}{r},$ a(0)＝0 a(1)＝1 (7)

And efficient c (n k) is defined as

$c(n,k)\widehat{=}\underset{r=0}{\overset{k}{\mathrm{\&Sigma;}}}P\left(r\right)a\left(r\right)---\left(8\right)$

By using equation (4) to equation (7), obtain equation (1), be used for grant channel GCH1, GCH2, GCH3, GCH4, GCH5, GCH6, GCH7, GCH8, GCH1, GCH2 distribute to mobile station MS 1, MS2, MS3 respectively, MS4, MS5, MS6, MS7, MS8, MS9, MS10.

For even distribution P (r)=1/k, r=1, k, the distribution that grant channel is distributed to travelling carriage listed above is shown as optimized in fact, because for this in ten numberings arbitrarily, 8 have different numberings, and 2 distributions with the additional different numbering that from those 8 numberings, extracts, (n is identical k) to c.Be less than 8 different numberings or have 8 different numberings for having arbitrarily, but have the distribution of two same additional numbers, c (n, k) c that calculates according to equation (8) of beguine (n, k) little.

In an example, consider n=10, k=8, and P (r)=1/k, r=1 ..., the situation of k.So, according to equation (8), as grant channel GCH1, GCH2, GCH3, GCH4, GCH5, GCH6, GCH7, GCH8, GCH1, GCH2 are optimally distributed to mobile station MS 1, MS2, MS3, MS4, MS5 respectively, MS6, MS7, MS8, MS9, during MS10, c (n, k)=0.922.Yet for identical situation but to distribute be when selecting at random, efficient is shown as 0.82 left and right sides (see figure 4).

In another example, consider n=10, k=8, and probability distribution is situation as follows: P (0)=0.00860689, P (1)=0.0458367, P (2)=0.172538, P (3)=0.303443, P (4)=0.269816, P (5)=0.138511, P (6)=0.0490392, P (7)=0.0104083, P (8)=0.00180144.Work as grant channel GCH1 so, GCH2, GCH3, GCH4, GCH5, GCH6, GCH7, GCH8, GCH1, GCH2 are optimally distributed to mobile station MS 1 respectively, MS2, MS3, MS4, MS5, MS6, MS7, MS8, MS9, during MS10, according to equation (8), c (n, k)=0.937.Yet for same case but be assigned as when selecting at random, efficient is shown as 0.86 left and right sides (see figure 5).

Therefore, can find out that grant channel provides the reverse link efficient higher than Random assignment to the nonrandom distribution of travelling carriage.

In the exemplary embodiment that another nonrandom " static state " is distributed, make some hypothesis as described below like this.The sum (n) of supposing travelling carriage is the even number numbering, and the number of distributing to the grant channel (1) that each travelling carriage monitors is that 1 (that is, 1=1), and the number of the grant channel that can be scheduled simultaneously (k) is k=n/2.Travelling carriage is designated as from MS1 to MSn, and grant channel is designated as from GCH1 to GCHk.In addition, the size of supposing the travelling carriage set of scheduling in each time slot is obeyed even the distribution.So, for the distribution of the essence optimum that can provide maximal efficiency, this efficient is no less than

Wherein

$\left(\begin{array}{c}y\\ x\end{array}\right)=0,$ If x＜0, $\left(\begin{array}{c}y\\ x\end{array}\right)=1,$ If x=0

P (r) is the probability distribution of the set sizes of the travelling carriage dispatched set in a time slot.

In this exemplary embodiment, can pass through grant channel GCH1, GCH2 ..., GCH (n/2), GCH1, GCH2 ..., and GCH (n/2) distributes to scheduled mobile stations MS1 respectively, MS2 ... and MSn realizes maximum reverse link efficient.

Can realize maximum reverse link efficient by as above definition, grant channel being distributed to scheduled mobile stations in order to verify and to prove, consider following situation.For the given travelling carriage n of even number and the given number grant channel k=n/2 that can be dispatched simultaneously of ading up to, suppose U (n, k, r, m) expression has the number of the combination of r different travelling carriage and GCH broken string Repeated m time.Suppose that (r m) represents these U (n, k, r, m) set of individual combination to S for n, k.In this proof, the definition of the broken string that combination, numbering, broken string and Repeated m are inferior keeps identical with the definition among above-mentioned first embodiment.

For 0≤r＜2m,

U(n，k，r，m)＝0 (10)

For 2m≤r≤k

$U(n,k,r,m)=\left(\begin{array}{c}n/2\\ m\end{array}\right)\left(\begin{array}{c}(n/2)-m\\ r-2m\end{array}\right)\&CenterDot;2^{r-2m}---\left(11\right)$

Equation (11) can be verified as follows.S (n, k, r, m) each combination in just in time has such m to travelling carriage, and making wherein, the travelling carriage of every centering has same numbering.The right number of different m like this equals $\left(\begin{array}{c}n/2\\ m\end{array}\right)$ 。This m is twin to (twins pairs) to being called as sometimes.For S (n, k, r, each combination in m), exists the right set of residue (that is, not m individual twin among to).Remain right number and equal (n/2)-m.

Residue a pair of of centering can offer this combination with the travelling carriage that is no more than of its travelling carriage.This combination can just in time obtain r-2m such travelling carriage from residue centering, and it means this for given twin to individual right with given residue centering r-2m, and residue is to providing 2 ^R-2mIndividual different travelling carriages combination.For given twin right, r-2m remains ading up to of right different sets $\left(\begin{array}{c}(n/2)-m\\ r-2m\end{array}\right),$ It provides in equation (11).

Take out that r is individual to be written as from the sum of the combination of n travelling carriage at every turn $\left(\begin{array}{c}n\\ r\end{array}\right)$ 。Like this, if own $\left(\begin{array}{c}n\\ r\end{array}\right)$ Individual combination has identical probability of occurrence, and the average number of so notified travelling carriage is

Equation (9) can be in that (n, k r) obtain after carrying out averaging about the standardization of r and to r to b.

In an example, consider n=10, k=5 and P (r)=1/k, r=1 ..., the situation of k.So, as grant channel GCH1, GCH2 ..., GCH (n/2), GCH1, GCH2 ..., and GCH (n/2) optimally distributed to scheduled mobile stations MS1 respectively, MS2 ... and during MSn, according to equation (9), and c (n, k)=0.889.Yet for same case but to distribute be when selecting at random, efficient is shown as 0.83 left and right sides (see figure 4).

Another have uniform probability distribution (be P (r)=1/k, r=1 ..., in example k), consider [n=16, k=8] [n=14, k=7], the situation of [n=12, k=6].Again, according to equation (9), as grant channel GCH1, GCH2,, GCH (n/2), GCH1, GCH2,, and GCH (n/2) is optimally distributed to scheduled mobile stations MS1, MS2 respectively, and during MSn, divide other, c (n, k)=0.883, c (n, k)=0.885, and c (n, k)=0.886.For same case but, do not provide the efficient numeral for select dividing a timing at random.Yet the efficient number expected is lower more herein than the efficient that the nonrandom situation that shows provides.

Fig. 6 is that the flow chart that travelling carriage monitors is distributed in the above-mentioned set with grant channel nonrandom " static state " of explanation.The allocation process hypothesis n that summarizes among Fig. 6 represents the sum of travelling carriage and the sum of the grant channel that the k representative can be dispatched simultaneously.Like this, k must be the same with r at least big, and wherein r equals the number of the travelling carriage dispatched in a time slot.

At box 600, nonrandom " static state " allocation process is distributed to k grant channel respectively with first group in entire n travelling carriage k travelling carriage continuously.At box 602, back to back (n-k) individual travelling carriage is assigned to first group of (n-k) individual grant channel.Like this, first group of (n-k) individual grant channel will have at least two travelling carriages of distributing to them.

Fig. 7 is the simplified block diagram such as the such cdma communication system 700 of 1xEV-DV access network.System 700 comprises at least one base station 750 and the travelling carriage 710 that can realize different aspect of the present invention.For specific communications, speech data, grouped data and/or message can be exchanged between base station 750 and travelling carriage 710.Can send dissimilar message, such as being used to set up the message of the communication session between base station and the travelling carriage and being used for the message (for example, power control, data rate message, affirmation or the like) that control data sends.

About the forward link aspect, 750 places in the base station, voice and/or grouped data (for example, from data source 776) and message (for example, coming self-controller 764) are sent out (TX) data processor 774 and (for example handle, format and coding), and modulated device (MOD) 772 further handles (for example, by mask (cover) and spread spectrum), and (for example regulated by transmitter unit (TMTR) 770, be converted into analog signal, amplification, filtering and quadrature modulation), to generate forward link signal.

The message that base station controller 764 is handled can comprise has carried special allowance message of giving allowance such as the R-ESCH allowance of travelling carriage.These message can be used the special-purpose grant channel according to above-mentioned technology optimum allocation.By handling and distributing to each scheduled mobile stations grant channel, controller 764 is dispatched travelling carriage in particular time-slot.Controller has comprised memory, and in this memory, one (memory) keeps the tabulation and the ordering of travelling carriage, grant channel and time slot configuration, such as distributing and scheduling, and as Fig. 2 A, 2B, what illustrate among the 2C is the same.In one embodiment, controller 764 comprises grant channel distribution module 780, and the previous grant channel that is not assigned with during the grant channel that this module monitors current mobile station is tabulated is distributed to the current mobile station of a plurality of scheduled mobile stations.Controller 764 has also comprised and has rearranged module 782, if this module is configured to not be each grant channel when all being assigned to travelling carriage that it is configured to reset the order of a plurality of scheduled mobile stations and repeats the allocation process that the grant channel distribution module is carried out.Forward link signal passes through duplexer 754 then, and is sent to travelling carriage 710 via antenna 752.

At travelling carriage 710 places, forward link signal is received by antenna 732, by duplexer 730, and is provided for acceptor unit 728.The signal that these acceptor unit 728 adjustings (for example, down conversion filters, and amplifies quadrature demodulation, and digitlization) receive also provides sampling.This sampling is handled (for example, mask is removed in despreading, and pilot demodulated) by demodulator 726 thereby symbol is provided, and this symbol be received data processor 724 handles (for example, decoding and verification) further thus recover data and message by the forward link transmission.Data recovered is provided for data sink, and the message of recovering is provided for controller 720.

About the reverse link aspect, at travelling carriage 710 places, voice and/or grouped data are (for example, from data source 712) and message is (for example, come self-controller 720) be provided for transmission (TX) data processor 714, it utilizes one or more encoding schemes that data and message are formatd and encodes to generate coded data.Each encoding scheme has comprised Cyclic Redundancy Check, convolution, Turbo, piecemeal and other coding, perhaps codeless at all combination in any.Usually, speech data, grouped data and message use different schemes to encode, and dissimilar message also can be carried out different coding.

Then, the data behind the coding are provided for modulator (MOD) 716 and are further processed (for example, by mask, the short PN sequence of utilization is expanded and utilized the long PN sequence of distributing to user terminal to carry out scramble).Modulated then data are provided for transmitter unit (TMTR) 718 and are conditioned (for example, convert one or more analog signals to, amplify, filtration, and quadrature modulation) thereby the generation reverse link signal.Reverse link signal is sent to base station 750 by duplexer (D) 730 and via antenna 732.

750 places in the base station, reverse link signal is received by antenna 752, by duplexer 754 and be provided for acceptor unit (RCVR) 756.The signal that acceptor unit 756 adjustings (for example, filter, amplify down conversion, and digitlization) receive also provides sampling.Demodulator (DEMOD) 758 receives and handles (for example, mask is removed in despreading, and pilot demodulated) this sampling so that the symbol that is resumed to be provided.The RAKE receiver that demodulator 758 can be realized handling a plurality of samples of received signal and generate composite symbol.Receive (RX) data processor 760 then with data and the message of symbol decoding to recover to send by reverse link.The message that the voice/packet data of having recovered is provided for data sink 762 recoveries can be provided for controller 764.The processing of demodulator 758 and RX data processor 760 is replenishing the processing of travelling carriage 710 execution.

Those skilled in the art will appreciate that, can utilize multiple different technology and in the method any one to come performance information and signal.For example, data, instruction, order, information, signal, bit, symbol and the chip mentioned in the whole text in more than describing can be used power supply, electric current, electromagnetic wave, magnetic field or magnetic particle, light field or light particle, or above arbitrarily combination is represented.

Those skilled in the art also can further understand, may be implemented as electronic hardware about logic function block, module, circuit and the technology of describing among the embodiment disclosed herein, computer software, or the combination of the two.In order to clearly demonstrate this interchangeability of hardware and software, more than usually according to its functional description different illustrative components, functional block, module, circuit and step.This function is to realize depending on application-specific and the design constraints that whole system is applied by hardware or software.Those of skill in the art can realize described function in a different manner for each application-specific, but this realization is determined should not be interpreted as departing from protection scope of the present invention.

Can realize or carry out described different descriptive logic function block, module and circuit with the combination that general processor, digital signal processor (DSP), application specific integrated circuit (ASIC), field programmable gate array (FPGA) or other programmable logical device, discrete gate or transistor-transistor logic circuit, discrete hardware element or its design are used for carrying out function described here in conjunction with disclosed embodiment.General processor can be a microprocessor, but optionally, this processor can be the processor of any conventional, controller, microcontroller, or state machine.Processor also can be used as the combination of computing equipment, for example, the combination of DSP and microprocessor, a plurality of microprocessors, one or more microprocessors that link to each other with the DSP core, or other this configuration is implemented arbitrarily.

The technology of describing in conjunction with the disclosed embodiments or the step of method can directly be embedded in the hardware, in the software module by processor operations, or in above the two the combination.Software module can reside in the RAM memory, flash memory, and the ROM memory, eprom memory, eeprom memory, register, hard disk, removable hard disk, CD-ROM, or arbitrarily in other storage medium known in the art.An exemplary storage medium is connected on the processor, makes the processor can be from read information like this, or information is write on the storage medium.Optionally, described storage medium can be integrated in the processor.Processor and medium can reside among the ASIC.ASIC can reside in the user terminal.Optionally, processor and storage medium can be used as discrete component and reside in the user terminal.

The above-mentioned explanation of disclosed embodiment makes any those skilled in the art can make and use the present invention.Different modification to these embodiment is conspicuous to those skilled in the art, and under the situation that does not deviate from the spirit or scope of the present invention, the rule that is limited can be used other embodiment here.Therefore, the present invention is not the embodiment shown in being limited to here, but will be awarded and principle disclosed herein and novel features the wideest corresponding to scope

Claims (14)

1. the base station in the cdma communication network, described base station comprises:

Controller, it is configured to dispatch grant channel and sends a plurality of scheduled mobile stations in the zone of described cdma communication network to will permit message, and described controller comprises the grant channel distribution module, is used for:

The previous grant channel that is not assigned with in the grant channel tabulation that will be monitored by current mobile station is distributed to the current mobile station in the ordering of described a plurality of scheduled mobile stations; With

If in the ordering of described scheduled mobile stations, also exist other travelling carriage to handle, then the next travelling carriage in the ordering of scheduled mobile stations repeated described distribution;

Modulator, it is configured to handle described allowance message, and described processing comprises expansion; With

Transmitter unit, it is configured to modulate the allowance message of having handled, generates forward link signal, and sends described forward link signal by grant channel.

2. base station as claimed in claim 1, wherein, each message in the described allowance message comprises special message of giving travelling carriage.

3. base station as claimed in claim 1, wherein, described allowance message comprises that reverse enhanced auxiliary channel R-ESCH permits.

4. base station as claimed in claim 1, wherein, described controller comprises:

Rearrange module, if it is configured to not is that each grant channel all has been assigned to travelling carriage, then rearrange the order of described a plurality of scheduled mobile stations, if and be not that each grant channel all has been assigned to travelling carriage, repeat the allocation process of carrying out by described grant channel distribution module.

5. base station as claimed in claim 4, wherein, the described module that rearranges rearranges the order of being tabulated by the grant channel of described current mobile station supervision.

6. base station as claimed in claim 5 wherein, describedly rearranges the mode that module rotated with the travelling carriage order and comes described tabulation rearrangement.

7. base station as claimed in claim 1, wherein, the described grant channel that before is not assigned with comprises first the available grant channel in the grant channel tabulation that is monitored by described current mobile station.

8. base station as claimed in claim 1, wherein, described a plurality of scheduled mobile stations are subclass of the set of the travelling carriage that comprises that all move in described zone.

9. cdma communication network comprises:

First group of a plurality of travelling carriage, it moves in described cdma communication network; With

The base station comprises:

Controller, it is configured to dispatch grant channel and sends a plurality of scheduled mobile stations in the zone of described cdma communication network to will permit message, described controller comprises the grant channel distribution module, and the previous not allotted channel in the grant channel tabulation that described grant channel distribution module is used for being monitored by described current mobile station is distributed to the current mobile station in the ordering of described a plurality of scheduled mobile stations; And if in the ordering of described scheduled mobile stations, also existed other travelling carriage to handle, then the next travelling carriage in the ordering of scheduled mobile stations would be repeated described distribution;

Modulator, it is configured to handle described allowance message, and described processing comprises expansion; With

Transmitter unit, it is configured to modulate the allowance message of having handled, generates forward link signal, and sends described forward link signal by grant channel.

10. communication network as claimed in claim 9, wherein the controller in described base station also comprises:

Rearrange module, if it is configured to not is that each grant channel all has been assigned to travelling carriage, then rearrange the order of described a plurality of scheduled mobile stations, if and be not that each grant channel all has been assigned to travelling carriage, repeat the allocation process of carrying out by described grant channel distribution module.

11. communication network as claimed in claim 10, wherein, the described module that rearranges rearranges the order of being tabulated by the grant channel of described current mobile station supervision.

12. communication network as claimed in claim 11 wherein, describedly rearranges the mode that module rotated with the travelling carriage order and comes described tabulation rearrangement.

13. communication network as claimed in claim 9, wherein, the described grant channel that before is not assigned with comprises first the available grant channel in the grant channel tabulation that is monitored by described current mobile station.

14. communication network as claimed in claim 9, wherein, described a plurality of scheduled mobile stations are subclass of the set of the travelling carriage that comprises that all move in described zone.

Images