CN100559900C - Uplink load estimation using varying data rates - Google Patents

Abstract

A multi-level scheduling method for determining reverse link communication. Examples include estimating reverse link capacity based on sector load. Examples include estimating load impact based on signal-to-noise ratio. Examples include estimating available scheduling capacity based on measured interference-to-thermal-noise ratios of other cells and sector load. Examples include methods for allocating sector capacity at base stations (BS) and base station controllers (BSCs). Examples include determining station priority based on the ratio of pilot energy to noise plus interference, soft handover factor, fairness value, and fairness factor α.

Description

Uplink load estimation using varying data rates

background

This application claims priority to US Provisional Application No. 60/409,820, filed September 10, 2002, which is assigned to the assignee of the present invention and is incorporated herein by reference.

field

The disclosed embodiments relate generally to wireless communications, and more particularly to reverse link rate scheduling within a communication system with variable data transmission rates.

background

The field of communications has many applications including, for example, paging, wireless local loop, Internet telephony, and satellite communication systems. An example application is a cellular telephone system for mobile subscribers. (As used herein, the term "cellular" system includes both cellular and Personal Communications Service (PCS) system frequencies). Modern communication systems designed to allow access by multiple users have been developed for such cellular systems. These modern communication systems may be based on code division multiple access (CDMA), time division multiple access (TDMA), frequency division multiple access (FDMA), space division multiple access (SDMA), polar division multiple access (PDMA) or other known in the art modulation technique. These modulation techniques demodulate received signals from multiple users of the communication system, thereby increasing communication system capacity. In connection with this, various wireless systems have been established including, for example, Advanced Mobile Phone Service (AMPS), Global System for Mobile Communications (GSM), and some other wireless systems.

In an FDMA system, the total frequency spectrum is divided into a number of smaller sub-bands, and each user is given its own sub-band to access the communication medium. Or in a TDMA system, each user is given the entire frequency spectrum in periodically consecutive time slots. CDMA systems offer potential advantages over other types of systems, including increased system capacity. In a CDMA system, each user is given the entire spectrum at all times, but distinguishes its transmissions by using a unique code.

A CDMA system may be designed to support one or more CDMA standards such as (1) "TIA/EIA-95-B Mobile Station-Base Station Compatibility Standard for Dual-Mode Wideband Spread Spectrum Cellular System" (IS-95 standard); (2) Standards provided by a consortium called the Third Generation Partnership Project (3GPP), embodied in a set of documents including document numbers 3G TS 25.211, 3G TS 25.212, 3G TS 25.213, and 3G TS 25.214 (W-CDMA standards); (3) standards provided by a consortium called "3rd Generation Partnership Project 2" (3GPP2), which are embodied in "TR-45.5 Physical Layer Standard for cdma2000 SpreadSpectrum Systems" (IS-2000 standard) and (4) Some other standards.

Within the above-mentioned CDMA communication systems and standards, the available spectrum is shared among multiple users simultaneously, and techniques such as handover can be used to maintain a quality sufficient to support delay-sensitive services such as voice. Data services are also available. Recently, systems have been proposed that enhance data service capacity by using higher order modulation, very fast scheduling, and scheduling of services with more relaxed delay requirements. The only example of such a data communication system using these techniques is a High Data Rate (HDR) system (IS-856 standard) compliant with the TIA/EIA/IS-856 standard.

In contrast to the aforementioned standards, IS-856 systems use all available spectrum within each cell to send data to a single user at a time. One factor that determines which user is served is link quality. By using link quality as a factor in selecting which user is served, the system spends a greater proportion of the time sending data at a higher rate when the channel is better, thus avoiding sacrificing resources for inefficient rate transmission. The net effect is higher data capacity, higher peak data rates, and higher average throughput.

The system may include support for delay sensitive data, such as voice channels or data channels supported within the IS-2000 standard, along with support for packet data services such as described within the IS-856 standard. One such system is proposed to the 3rd Generation Partnership Project 2 (3GPP2) by LG Electronics, LSI Logic, Lucent Technologies, Nortel Networks, Qualcomm Incorporated, and Samsung. The proposal is described in detail in the following documents: "Updated Joint Physical Layer Proposal for 1xEV-DV", submitted to 3GPP2 on June 11, 2001 as document number C50-20010611-009; "Results of L3NQSSimulation Study", submitted to 3GPP2 at Submitted as document number C50-20010820-011 on 20 August 2001; and "System Simulation Results for the L3NQSFramework Proposal for cdma2000 1x-EVDV", submitted to 3GPP2 as document number C50-20010820-012 on 20 August 2001 . These are hereafter referred to as IxEV-DV proposals.

Multi-level scheduling may be useful for more efficient capacity utilization on the reverse link.

Summary of the invention

Embodiments disclosed herein meet the above needs by providing a method and system for multi-level scheduling of rate allocation within a communication system.

In one aspect, a method for estimating capacity on the reverse link includes measuring a plurality of signal-to-noise ratios at a station for a plurality of rates; based on the measured plurality of signal-to-noise ratios, the assigned transmission rate, and the expected The transmission rate determines sector loading; and estimates capacity on the reverse link based on the sector loading.

In another aspect, a method of estimating loading effects on sector antennas includes: allocating a transmission rate R _i on a first communication channel; determining an expected transmission rate E[R] on a second communication channel; estimating the signal-to-noise ratio of the station based on the assigned transmission rate R _i on and the expected transmission rate E[R] on the second communication channel; and estimating the load impact based on the estimated signal-to-noise ratio.

In another aspect, a method of estimating capacity available for scheduling includes measuring other cell interference (I _oc ), determining thermal noise (N ₀ ), determining sector load (Load _j ), and based on the measurement Other cell interference versus thermal noise, and thermal rise (ROT _j ) is determined based on sector load.

In another aspect, a method of allocating sector capacity at a base station (BS) and a base station controller (BSC) includes measuring other cell interference (I _oc ), determining thermal noise (N ₀ ), determining a maximum thermal rise (ROT(max)), determine the estimated distribution load at the BSC (LOAD _j (BSC)) and determine based on the measured ratio of other cell interference to thermal noise, the maximum thermal rise, and the estimated distribution load at the BSC The sector capacity allocated to the base station.

In another aspect, a method of determining station priority includes determining a pilot energy-to-noise-plus-interference ratio (Ecp/Nt), determining a soft handoff factor (SHO factor), determining a fairness value (F), determining a proportional fairness value (PF ), determine the fairness factor α, and determine the maximum capacity utilization based on the pilot-to-noise-plus-interference ratio, the soft handoff factor, the fairness value, and the fairness factor α.

Detailed description of the drawings

Fig. 1 is a wireless communication system embodiment with three mobile stations and two base stations;

Figure 2 illustrates setpoint adjustments due to transrating on the R-SCH, according to an embodiment.

FIG. 3 shows a scheduling delay sequence according to an embodiment;

Figure 4 illustrates parameters associated with mobile station scheduling on the reverse link;

Fig. 5 is a scheduling process flow diagram according to an embodiment;

Figure 6 is a block diagram of a base station according to an embodiment; and

Fig. 7 is a block diagram of a mobile station according to an embodiment.

A detailed description

The word "example" is used herein only to mean "serving as an example, instance, or illustration." Any embodiment described herein as "example" is not necessarily to be construed as preferred or preferred over other embodiments.

A wireless communication system may include multiple mobile stations and multiple base stations. FIG. 1 is an embodiment of a wireless communication system with three mobile stations 10A, 10B and 10C and two base stations 12 . In FIG. 1, three base stations are shown as a mobile telephone unit installed in a vehicle 10A, a portable computer remote 10B and a fixed location unit 10C, such as might be found in a wireless local loop or odometer reading system. The mobile station may be any type of communication unit, such as for example a handheld personal communication system unit, a portable data unit like a personal digital assistant, or a fixed location data unit such as a mile reading device. FIG. 1 shows a forward link 14 from a base station 12 to a mobile station 10 and a reverse link 16 from the mobile station 10 to the base station 12 .

As the mobile station moves within the physical environment, the signal path numbers and signal strengths received at the mobile station and on these paths as received at the base station change all the time. Accordingly, the receiver within an embodiment uses a specific processing element called a searcher element, which continuously searches the channel in the time domain to determine the presence, time offset and signal strength of signals within a multipath environment. A searcher element is also referred to as a searcher engine. The output of the searcher element provides information used to ensure that the demodulation element follows the best path.

A method and system for assigning demodulation elements to sets of signals available to mobile stations and base stations is disclosed in US Patent No. 5,490,165, entitled "DEMODULATION ELEMENT ASSIGNMENT IN ASYSTEM CAPABLE OF RECEIVING MULTIPLE SIGNALS", issued February 6, 1996 dated, assigned to the assignee of the present invention.

When multiple mobiles transmit at the same time, the radio transmission from one mobile is interfering with the radio transmissions of the other mobiles, thereby limiting the achievable throughput on the reverse link (also known as the uplink). For effective capacity utilization on the reverse link, centralized scheduling at the base station is recommended in US Patent No. 5914950 and US Patent No. 5923650, the former titled "METHOD AND APPARATUS FORREVERSE LINK RATE SCHEDULING", published on June 1999 22, 1999, the latter entitled "METHODAND APPARATUS FOR REVERSE LINK RATE SCHEDULING," filed 13 June 1999, both assigned to the assignee of the present invention.

In an example embodiment, multi-level scheduling is implemented. In an embodiment, multi-level scheduling includes base station layer scheduling, selector layer scheduling and/or network layer scheduling.

In an embodiment, the detailed design of the flexible scheduling algorithm is based on the basic theoretical principle of limiting the capacity of the reverse link system, while using existing network parameters available or measured by the base station.

In one embodiment, the base station estimate of the capacity impact of each move, given the current transmission rate, is based on the measured signal-to-noise ratio (Snr) or pilot-to-noise-plus-interference ratio (Ecp/(Io+No)), Together are referred to as (Ecp/Nt). Pilot Ecp/Nt measurements from all fingers under multipath conditions are disclosed in US Application Serial No. 10/011519, entitled "METHOD AND APPARATUS FOR DETERMINING REVERSE LINKLOAD LEVEL FOR REVERSE LINK DATA RATE SCHEDULING IN A CDMA COMMUNICATION SYSTEM", filed at November 5, 2001, and assigned to the assignee of the present invention.

From the pilot Ecp/Nt measurements at the current rate on different channels, the capacity impact of movement is estimated at the new rate on these channels.

In one embodiment, mobile requests for rate allocations are prioritized. A list of all moves that the scheduler is responsible for scheduling is maintained depending on which layer the scheduling is implemented. In one embodiment, there is a list of all moves. Alternatively, there are two lists for all moves. A mobile station belongs to the first list if the scheduler is responsible for scheduling all base stations that the mobile station has in its active set. A separate second list may be maintained for base stations for which the mobile has base stations within its active set for which the scheduler is not responsible for scheduling. Prioritization of mobility rate requests is based on maximizing system throughput while allowing mobility fairness and various reported, measured or known parameters of its importance status.

In an embodiment, Greedy filling is used. Within Greedy padding, higher priority moves get available sector capacity. The highest rate that can be allocated is determined to be the highest rate that a mobile can transmit at this rate. In an embodiment, the highest rate is determined based on the measured SNR. In one embodiment, the highest rate is determined based on Ecp/Nt. In an embodiment, the highest rate is also determined based on a limit parameter. In one embodiment, the highest rate is determined by moving buffer estimates. The choice of a high rate reduces the transmission delay and reduces the interference received by the sending mobile. The remaining sector capacity can be allocated to the next lower priority move. This approach helps maximize the gain due to interference reduction while maximizing capacity utilization at the same time.

By choosing different prioritization functions, the Greedy filling algorithm can be tuned to regular round-robin, proportionally fair or least fair scheduling depending on the specified filling algorithm. Under the scheduling class considered, the above approach helps to maximize capacity utilization.

A mobile station initiates a call by sending a request message to the base station. Once the mobile receives the channel assignment message from the base station, it can use the logical dedicated channel for further communication with the base station. In a scheduled system, when a base station has data to send, it can initiate a high-speed data transmission on the reverse link by sending a request message on the reverse link.

Consider the rate request and rate allocation structures currently specified in IS 2000 Rev. C. However, it is obvious to those skilled in the art that the design scope is not limited to IS 2000. It will be apparent to those skilled in the art that embodiments may be implemented in any multiple access system with a rate allocation centralized scheduler.

mobile station process

In one embodiment, a mobile station (MS) supports concurrent operation of at least the following channels:

1. Reverse Fundamental Channel (R-FCH)

2. Reverse Supplementary Channel (R-SCH)

Reverse Fundamental Channel (R-FCH): It is carried on the R-FCH when a voice-only MS has an active voice call. For data-only MSs, the R-FCH carries both signaling and data. Example R-FCH channel frame sizes, coding, modulation and interleaving are specified in TIA/EIA-IS-2000.2, entitled "MobileStation-Base Station Compatibility Standard for Dual-Mode WidebandSpread Spectrum Cellular System", June 2002.

In an example embodiment, a zero-rate R-FCH is used for outer loop power control (PC) when the MS is not transmitting voice, data or signaling on the R-FCH. The lowest rate R-FCH can be used to maintain outer loop power control even when there is no transmission on the R-SCH.

Reverse Supplementary Channel (R-SCH): According to an embodiment the MS supports one R-SCH for packet data transmission. In an example embodiment, the R-SCH uses the rate specified by the Radio Configuration (RC3) within TIA/EIA-IS-2000.2.

In an embodiment, where only a single data channel (R-SCH) is supported, signaling and power control can be done on the control channel. Alternatively, the signaling can be carried on the R-SCH and, when present, the outer loop PC can be carried on the R-SCH.

In one embodiment, the mobile station performs the following procedure:

●Multiple channels to adjust the gain

●Discontinuous transmission and variable auxiliary adjustment gain

●Overhead transmission of R-CQICH and other control channels

● Closed-loop power control (PC) command

● Rate request using the Secondary Channel Request Mini Message (SCRMM) on the 5 ms R-FCH or the Secondary Channel Request Message (SCRM) on the 20 ms R-FCH

Multiple Channel Adjustment Gains: Implement multiple channel gain table adjustments as specified in TIA/EIA-IS-2000.2 to maintain correct transmit power for R-FCH when R-FCH and R-SCH are active simultaneously. The traffic-to-pilot (T/P) ratio for all channel rates is also specified in the Nominal Attribute Gain table in Appendix A as the Nominal Attribute Gain value. Traffic-to-pilot ratio means the ratio of traffic channel power to pilot channel power.

Discontinuous transmission and variable auxiliary adjustment gain: The MS can be assigned an R-SCH rate by the scheduler within each scheduling period. When the MS is not assigned an R-SCH rate, it does not transmit on the R-SCH. If the MS is allocated to transmit on the R-SCH, but it does not have any data or sufficient power to transmit at the allocated rate, it disables transmission on the R-SCH (DTX). If allowed by the system, the MS may automatically transmit on the R-SCH at a lower than allocated rate. In an embodiment, the variable rate R-SCH operation is accompanied by variable rate SCH gain adjustments as specified in TIA/EIA-IS-2000.2. The R-FCHT/P is adjusted assuming that the received pilot SNR is high enough to support the rate allocated on the R-SCH.

Overhead transmission of R-CQICH and other control channels: A data-only MS transmits additional power on CQICH and/or other control channels at a CQICH-to-pilot (or control-to-pilot) (C/P) ratio, its multichannel gain The adjustment is achieved to maintain the correct transmission power of the R-CQICH (or control channel). The (C/P) value may be different for MSs in soft handoff than for MSs not in soft handoff. (C/P) represents the ratio of the total power used by the control channel to the pilot power without multi-channel gain adjustment.

Closed-loop power control (PC) commands: In one embodiment, the MS receives one PC command per power control group (PCG) at a rate of 800 Hz from all base stations (BSs) within the MS's active set. PCG is a 1.25 millisecond gap on the reverse traffic channel and reverse pilot channel. After combining PC commands from co-located BSs (sectors within a given cell), the pilot power is updated +-1 dB based on "Or-of-Downs" criteria.

Rate requests are accomplished in one of two ways. In a first method, the rate request is implemented using a Secondary Channel Request Mini-Message (SCRMM) on the 5 ms R-FCH as specified in TIA/EIA-IS-2000.5.

Secondary Channel Request Mini-Message (SCRMM) on 5 ms R-FCH: In one embodiment, each SCRMM transmission is 24 bits (or 48 bits with a physical layer frame within each 5 ms FCH frame at 9.6 kbps overhead).

The MS sends SCRMMs in any periodic interval of 5 ms. If a 5 millisecond SCRMM needs to be sent, the MS interrupts its transmission of the current 20 millisecond R-FCH frame and instead sends a 5 millisecond frame on the R-FCH. After the 5 millisecond frame has been transmitted, any remaining time within the 20 millisecond period on the R-FCH is not transmitted. The discontinuous transmission of the 20 ms R-FCH is re-established at the beginning of the next 20 ms frame.

In the second method, the rate request is implemented using a Secondary Channel Request Message (SCRM) on the 20ms R-FCH.

Depending on the different embodiments, different information may be sent within the request message. Within IS2000, a Secondary Channel Request Mini-Message (SCRMM) or Secondary Channel Request Message (SCRM) is sent on the reverse link for a rate request.

In an embodiment, the following information may be reported by the MS to the BS on every SCRM/SCRMM transmission:

●Maximum request rate

●Queue information

Maximum Request Rate: It can be the maximum data rate that the MS can send under the current channel conditions, and can leave headroom for fast channel changes. The MS can determine its maximum rate using the following equation:

${\mathrm{<span\; class="notranslate">\; R</span>}}_{\mathrm{<span\; class="notranslate">\; max</span>}}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; power</span>}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; =</span>\underset{\mathrm{<span\; class="notranslate">\; R</span>}}{\mathrm{<span\; class="notranslate">\; arg</span>}\mathrm{<span\; class="notranslate">\; max</span>}}\left\{\begin{array}{c}\mathrm{<span\; class="notranslate">\; R</span>}<span\; class="notranslate">\; :</span>\mathrm{<span\; class="notranslate">\; pref</span>}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; R</span>}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; *</span>\mathrm{<span\; class="notranslate">\; NormAvPiTx</span>}{<span\; class="notranslate">\; (</span>{\mathrm{<span\; class="notranslate">\; PCG</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; )</span>}^{<span\; class="notranslate">\; *</span>}\\ <span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; 1</span>}<span\; class="notranslate">\; +</span>{<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; 1</span>}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; T</span>}<span\; class="notranslate">\; /</span>\mathrm{<span\; class="notranslate">\; P</span>}<span\; class="notranslate">\; )</span>}_{\mathrm{<span\; class="notranslate">\; R</span>}}<span\; class="notranslate">\; +</span><span\; class="notranslate">\; (</span>{<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; T</span>}<span\; class="notranslate">\; /</span>\mathrm{<span\; class="notranslate">\; P</span>}<span\; class="notranslate">\; )</span>}_{\mathrm{<span\; class="notranslate">\; 9.6</span>}\mathrm{<span\; class="notranslate">\; k</span>}}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; C</span>}<span\; class="notranslate">\; /</span>\mathrm{<span\; class="notranslate">\; P</span>}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; (</span>\frac{\mathrm{<span\; class="notranslate">\; pref</span>}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; 9.6</span>}\mathrm{<span\; class="notranslate">\; k</span>}<span\; class="notranslate">\; )</span>}{\mathrm{<span\; class="notranslate">\; pref</span>}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; R</span>}<span\; class="notranslate">\; )</span>}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; )</span>\\ <span\; class="notranslate">\; \&le;</span>\mathrm{<span\; class="notranslate">\; Tx</span>}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; max</span>}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; /</span>\mathrm{<span\; class="notranslate">\; Headroom</span>}<span\; class="notranslate">\; \_</span>\mathrm{<span\; class="notranslate">\; req</span>}\end{array}\right\}$

$\mathrm{<span\; class="notranslate">\; NormAvPiTx</span>}<span\; class="notranslate">\; (</span>{\mathrm{<span\; class="notranslate">\; PCG</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; =</span>{\mathrm{<span\; class="notranslate">\; \&alpha;</span>}}_{\mathrm{<span\; class="notranslate">\; Headroom</span>}}\frac{\mathrm{<span\; class="notranslate">\; wxya</span>}<span\; class="notranslate">\; (</span>{\mathrm{<span\; class="notranslate">\; PCG</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; )</span>}{\mathrm{<span\; class="notranslate">\; pref</span>}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; Rassigned</span>}<span\; class="notranslate">\; )</span>}<span\; class="notranslate">\; +</span><span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; 1</span>}<span\; class="notranslate">\; -</span>{\mathrm{<span\; class="notranslate">\; \&alpha;</span>}}_{\mathrm{<span\; class="notranslate">\; Headroom</span>}}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; \&times;</span>\mathrm{<span\; class="notranslate">\; NormAvPiTx</span>}<span\; class="notranslate">\; (</span>{\mathrm{<span\; class="notranslate">\; PCG</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}<span\; class="notranslate">\; -</span>\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; )</span>$

where Pref(R) is the "pilot reference level" value specified in the attribute gain table in TIA/EIA-IS-2000.2, TxPiPwr(PCG _i ) is the post power limit applied to the MS side in case of power interruption is the actual transmitted pilot power, and NormAvPiTx(PCG _i ) is the normalized average transmitted pilot power. The MS can be more conservative or aggressive in choosing the headroom, and the determination of the maximum request rate depends on what the BS allows.

In one embodiment, the MS receives authorization information through one of two following methods:

Method a: Enhanced Assisted Channel Assignment Mini-Message (ESCAMM) from BS on Dedicated Control Channel (F-DCCH) 5 milliseconds ago with rate assignment for specified scheduling duration.

Method b: Enhanced Assisted Channel Assignment Message (ESCAM) from BS on Forward Physical Data Channel (F-PDCH) with rate assignment for specified scheduling duration.

These allocation delays depend on backhaul and transmission delays, and vary depending on which method is used for rate granting. During the scheduled duration, the following procedures are implemented:

- In an embodiment where the R-FCH is used to send automatic data and for the outer loop PC, the MS sends data at an autonomous rate of 9600 bits per second (bps) if there is some data in its buffer . Otherwise, the MS sends zero R-FCH frames at 1500 bps.

● If the MS has more data that can be carried on the R-FCH and if the MS decides that it will have sufficient power to transmit at the allocated rate (keeping headroom for channel changes), then the MS at the given 20ms It is sent at the allocated R-SCH rate within the time period. Otherwise, there is no transmission on the R-SCH during the frame, or the MS transmits at a lower rate to satisfy power constraints. Before the start of the 20 ms period, the MS decides that it has sufficient power to transmit on the R-SCH at the allocated rate R within the given 20 ms period Encode_Delay if the following equation is satisfied:

$\mathrm{<span\; class="notranslate">\; pref</span>}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; R</span>}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; *</span>\mathrm{<span\; class="notranslate">\; NormAvPiTx</span>}<span\; class="notranslate">\; (</span>{\mathrm{<span\; class="notranslate">\; PCG</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; [</span>\mathrm{<span\; class="notranslate">\; 1</span>}<span\; class="notranslate">\; +</span>{<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; T</span>}<span\; class="notranslate">\; /</span>\mathrm{<span\; class="notranslate">\; P</span>}<span\; class="notranslate">\; )</span>}_{\mathrm{<span\; class="notranslate">\; R</span>}}<span\; class="notranslate">\; +</span><span\; class="notranslate">\; (</span>{<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; T</span>}<span\; class="notranslate">\; /</span>\mathrm{<span\; class="notranslate">\; P</span>}<span\; class="notranslate">\; )</span>}_{{\mathrm{<span\; class="notranslate">\; R</span>}}_{\mathrm{<span\; class="notranslate">\; FCH</span>}}}<span\; class="notranslate">\; +</span><span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; C</span>}<span\; class="notranslate">\; /</span>\mathrm{<span\; class="notranslate">\; P</span>}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; )</span><span\; class="notranslate">\; (</span>\frac{\mathrm{<span\; class="notranslate">\; pref</span>}<span\; class="notranslate">\; (</span>{\mathrm{<span\; class="notranslate">\; R</span>}}_{\mathrm{<span\; class="notranslate">\; FCH</span>}}<span\; class="notranslate">\; )</span>}{\mathrm{<span\; class="notranslate">\; pref</span>}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; R</span>}<span\; class="notranslate">\; )</span>}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; ]</span><span\; class="notranslate">\; <</span>\frac{\mathrm{<span\; class="notranslate">\; Tx</span>}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; max</span>}<span\; class="notranslate">\; )</span>}{\mathrm{<span\; class="notranslate">\; Headroom</span>}<span\; class="notranslate">\; \_</span>\mathrm{<span\; class="notranslate">\; Tx</span>}}$

where Pref(R) is the "pilot reference level" value specified in the attribute gain table in TIA/EIA-IS-2000.2, NormAvPiTx(PCG _i ) is the normalized average transmit pilot power, (T/P) _R is the traffic-to-pilot ratio corresponding to rate R, and all channel rates are specified as nominal attribute gain values in the table of nominal attribute gains in Appendix A, (T/P) _RFCH is the traffic-to-pilot ratio on FCH Frequency ratio, (C/P) is the total power to pilot power ratio used by the control channel without multi-channel gain adjustment, T _x (max) is the maximum MS transmit power, and Headroom_Tx is the headroom reserved by the MS to allow channel changes .

Before R-SCH transmission, a DTX determination is completed every frame Encode_Delay PCG. If the MS disables transmissions on the R-SCH, it transmits with the following powers:

$\mathrm{<span\; class="notranslate">\; wxya</span>}<span\; class="notranslate">\; (</span>{\mathrm{<span\; class="notranslate">\; PCG</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; =</span>\mathrm{<span\; class="notranslate">\; PiTxPwr</span>}<span\; class="notranslate">\; (</span>{\mathrm{<span\; class="notranslate">\; PCG</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; [</span>\mathrm{<span\; class="notranslate">\; 1</span>}<span\; class="notranslate">\; +</span><span\; class="notranslate">\; (</span>{<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; T</span>}<span\; class="notranslate">\; /</span>\mathrm{<span\; class="notranslate">\; P</span>}<span\; class="notranslate">\; )</span>}_{{\mathrm{<span\; class="notranslate">\; R</span>}}_{\mathrm{<span\; class="notranslate">\; FCH</span>}}}<span\; class="notranslate">\; +</span><span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; C</span>}<span\; class="notranslate">\; /</span>\mathrm{<span\; class="notranslate">\; P</span>}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; )</span><span\; class="notranslate">\; (</span>\frac{\mathrm{<span\; class="notranslate">\; pref</span>}<span\; class="notranslate">\; (</span>{\mathrm{<span\; class="notranslate">\; R</span>}}_{\mathrm{<span\; class="notranslate">\; FCH</span>}}<span\; class="notranslate">\; )</span>}{\mathrm{<span\; class="notranslate">\; pref</span>}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; R</span>}<span\; class="notranslate">\; )</span>}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; ]</span>$

The MS encodes the transmission frame Encode_Delay before the actual transmission.

base station process

In one embodiment, the BS implements the following key functions:

●R-FCH/R-SCH decoding

●Power control

Decoding of R-FCH/R-SCH

When an MS transmits multiple traffic channels simultaneously, each traffic channel is decoded after being associated with a corresponding Walsh sequence.

Power Control

Power control within a CDMA system is critical to maintaining the desired Quality of Service (QoS). In IS-2000, each MS's RL Pilot Channel (R-PICH) is closed-loop power controlled to a desired threshold. At the BS, this threshold, called the power control setpoint, is compared to the received Ecp/Nt to generate power control commands (closed loop PC), where Ecp is the pilot channel energy per chip. To obtain the desired QoS on the traffic channel, the threshold at the BS changes with erasures on the traffic channel and must be adjusted when the data rate changes.

Set point corrections occur because:

● Outer loop power control

●Speed conversion

Outer loop power control: If R-FCH is present, based on R-FCH erasure correction power control set point. When MS sends data, if R-FCH is absent, the outer loop PC is corrected based on erasure of some control channel or R-SCH.

Rate conversion: Different data rates on the R-SCH require different optimal set points for the reverse pilot channel. When the data rate is changed on the R-SCH, the BS changes the Ecp/Nt received by the MS by the difference of the pilot reference level (Pref(R)) between the current and the next R-SCH data rate. In one embodiment, the pilot reference level for a given data rate R is specified in the Nominal Attribute Gain table in C.S0002-C. Since the closed loop power control brings the received pilot Ecp/Nt to the setpoint, the BS adjusts the outer loop setpoint according to the next allocated R-SCH data rate:

Δ=pref(Rnew)-pref(Rold)

PCG。否则，该调整发生在R-SCH帧边界处。导频功率因此如图2内示出向正确电平接近，以大致闭环的1分贝步长上升或下降。If R _new >R _old , the setpoint adjustment is done ahead of the new R-SCH data rate

PCG. Otherwise, the adjustment occurs at R-SCH frame boundaries. The pilot power thus approaches the correct level as shown in Figure 2, ramping up or down in roughly closed-loop 1 dB steps.

Figure 2 illustrates setpoint adjustment due to transrate on R-SCH, according to an embodiment. The vertical axis of FIG. 2 shows the base station controller (BSC) 202 setpoint, the base transceiver subsystem (BTS) receiver pilot power 204 and the mobile station rate 206 . MS rate starts at R ₀ 208. When the R-SCH data rate increases, ie R1>R10 210, the set point is adjusted according to _Pref (R ₁ )-P _ref (R ₀ ) 212 . When the R-SCH data rate decreases, ie R2<R214, then the set point is according to _Pref ( _R2 ) _-Pref ( _R1 )216.

scheduler process

The scheduler can be co-located with the BSC or BTS or some elements within the network layer. The scheduler may be multi-tiered with each part of the MS responsible for scheduling shared lower-level resources. For example, MSs not in Soft Handoff (SHO) may be scheduled by the BTS, while MSs in SHO may be scheduled by a part of the scheduler co-located with the BSC. Reverse link capacity is allocated between the BTS and BSC for scheduling purposes.

In an embodiment, the following assumptions are used for scheduling and various parameters related to scheduling according to an embodiment:

1. Centralized scheduling: the scheduler is co-located with the BSC, and is responsible for simultaneous scheduling of MSs spanning multiple cells.

2. Synchronous scheduling: All R-SCH data rate transmissions are time aligned. All data rate allocations are for the duration of a scheduled period, which is time aligned for all MSs in the system. The scheduled duration period is denoted SCH_PRD.

3. Voice and autonomous R-SCH transmissions: Before allocating capacity for transmission on the R-SCH through rate allocation, the scheduler looks at pending rate requests from MSs and ignores voice and autonomous transmissions within a given cell.

4. Rate request latency: The uplink request latency associated with a rate request via SCRM/SCRMM is denoted as D_RL(request). It is the delay from the time a request is sent when it becomes available to the scheduler. D_RL(request) includes the requested over-the-air transmission delay segment, the requested decoding time at the cell, and the backhaul delay from the cell to the BSC, and is modeled as a uniformly distributed random variable.

5. Rate allocation delay: The downlink allocation delay associated with rate allocation by ESCAM/ESCAMM is denoted as D_FL(allocation). It is the time between making a rate decision and receiving the resulting assignment at the MS. D_FL (allocation) includes the backhaul delay from the scheduler to the cell, the over-the-air time of the allocation (based on the chosen method) and its decoding time at the MS.

6. Available Ecp/Nt measurements: The Ecp/Nt measurements for the scheduler shall be the latest available measurements at the last frame boundary. The measured Ecp/Nt is reported periodically by the BTS receiver to the scheduler, so it is delayed for the BSC receiver.

Fig. 3 shows a scheduling delay sequence according to an embodiment. The numbers shown are an example of typical numbers that may be used by a scheduler located at the BSC, although the actual numbers depend on the backhaul latency and the load conditions of the system.

The horizontal axis shows SCH frame boundary 250, which is the last SCH frame boundary before point A 252, point A 254, schedule time 256, and action time 258. The Ec/Nt measurement window is shown starting at SCH frame boundary 250 and ending at the last SCH frame boundary before point A 252. The time to last frame boundary 262 is shown from the last SCH frame boundary before point A 252 to point A 254. The time to send information from the BTS to the BSC (6PCG) 264 is shown starting at point A 254 and ending at scheduled time 256. ActionTimeDelay (25 PCG for method a, 62 PCG for method b) 266 is shown starting at schedule time 256 and ending at action time 258 .

Scheduling, Rate Allocation and Transmission Timeline

Given the assumed synchronous schedule, a number of requests, grants, and transmission-related event periods are period SCH_PRD.

Fig. 4 illustrates a timing diagram of rate request, scheduling and rate allocation according to an embodiment. The vertical axis shows the timeline of BSC (scheduler) 402 and movement 404 . MS sets up SCRMM 406 and sends rate request to BSC (scheduler) 408. The Rate Request is included in the SCRMM, which is sent on the R-FCH. The uplink request delay associated with a rate request via SCRM/SCRMM is denoted D_RL(request) 410 . Scheduling decisions 412 are made once every scheduling period 414 . After the scheduling decision 412, an ESCAM/ESCAMM 416 is sent on the forward channel from the BSC to the MS indicating the rate allocation 418. D_FL 420 is the downlink allocation delay associated with the rate allocation via ESCAM/ESCAMM. Transition time 422 is the time required for the transition rate request. It is the time from rate request to rate allocation.

Here are the timeline features:

●Scheduling Timing

●Scheduled rate transmission

● MS R-SCH rate request

Scheduling timing: The scheduler operates once every scheduling period. If the first scheduling decision is implemented at t _i , the scheduler operates at t _i , t _i +SCH_PRD, t _i +2SCH_PRD . . .

Scheduling rate transmission: Since it takes sufficient time to notify the MS of the scheduling decision, the scheduling decision must arrive at the action time of the ESCAM/ESCAMM message minus the fixed delay ActionTimeDelay. The general values of ActionTimeDelay for method a and method b are given in Table 1.

MS R-SCH Rate Request: The R-SCH Rate Request is triggered as given by:

Before the coding boundary of each SCRM/SCRMM frame starts, the MS checks whether any of the following three conditions are met:

1. New data arrives, and the data in the MS buffer exceeds a certain buffer depth (BUF_DEPTH), and the MS has sufficient power to send at a non-zero rate; or

_{or _}

3. If the last SCRM/SCRMM was sent at time τ _i , and the current time is greater than or equal to τ _i + SCH_PRD, and if the MS side current allocation rate based on the received ESCAMM/ESCAM is non-zero (regardless of whether the MS may not data or power to request a non-zero rate). "Current Allocation Rate" is the allocation rate applicable to the current rate of transmission. The assigned rate is considered to be zero if no ESCAM is received for the current scheduled duration. The action time is after some time and the rate assigned in the ESCAM/ESCAMM message takes effect after the action time.

If any one of the above three conditions is met, the MS sends a SCRMM/SCRM rate request.

In an embodiment, SCRM/SCRMM requests made at τ _i are available to the scheduler after a random delay of τ _i +D_RL(request). In another embodiment, different combinations within the MS data buffer, changes within the MS maximum supportable rate, and MS last request timeout may be used to determine when a rate request is sent.

Scheduler Description and Procedure

以及最大调度速率(Rmax(s))。In one embodiment, there is one centralized scheduler element for a large number of cells. The scheduler maintains a list of all MSs in the system and the BSs in each MS's active set. The scheduler associated with each MS stores the MS queue size estimate

and the maximum scheduling rate (Rmax(s)).

Queue Size Estimation Updated after the following events:

被更新为：1. Receive SCRMM/SCRM: SCRMM/SCRM is received after D_RL(request) delay.

is updated to:

If the SCRMM/SCRM is missing, the scheduler uses the previous (and last) information it had.

2. After each R-FCH and R-SCH frame decoding:

After ignoring the physical layer overhead and the RLP layer overhead, where Data _tx (FCH) and Data _tx (SCH) are the corresponding data sent in the last R-FCH and R-SCH frame (if the frame is decoded correctly).

3. At scheduling time t _i , the scheduler estimates a maximum scheduling rate for the MS according to an embodiment. Buffer size estimation is done as follows:

The maximum dispatch rate can be obtained as the minimum of the maximum power limit rate and the maximum buffer size limit rate. The maximum power limited rate is the maximum rate that can be achieved with the power available to the MS, and the maximum buffer size limited rate is the maximum rate at which data is sent less than or equal to the estimated buffer size.

${\mathrm{<span\; class="notranslate">\; R</span>}}_{\mathrm{<span\; class="notranslate">\; max</span>}}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; the\; s</span>}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; =</span>\mathrm{<span\; class="notranslate">\; min</span>}\left\{\begin{array}{c}{\mathrm{<span\; class="notranslate">\; R</span>}}_{\mathrm{<span\; class="notranslate">\; max</span>}}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; power</span>}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; ,</span>\\ \underset{\underset{\mathrm{<span\; class="notranslate">\; R</span>}<span\; class="notranslate">\; \&le;</span>\mathrm{<span\; class="notranslate">\; 307.2</span>}\mathrm{<span\; class="notranslate">\; kbps</span>}}{\mathrm{<span\; class="notranslate">\; R</span>}}}{\mathrm{<span\; class="notranslate">\; arg</span>}\mathrm{<span\; class="notranslate">\; max</span>}}<span\; class="notranslate">\; \{</span>\mathrm{<span\; class="notranslate">\; R</span>}<span\; class="notranslate">\; |</span>\stackrel{<span\; class="notranslate">\; ^</span>}{\mathrm{<span\; class="notranslate">\; Q</span>}}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; f</span>}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; \&Greater\; Equal;</span><span\; class="notranslate">\; (</span><span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; R</span>}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 9600</span>}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; \&times;</span>\mathrm{<span\; class="notranslate">\; 20</span>}\mathrm{<span\; class="notranslate">\; ms</span>}<span\; class="notranslate">\; -</span>\mathrm{<span\; class="notranslate">\; PL</span>}<span\; class="notranslate">\; \_</span>\mathrm{<span\; class="notranslate">\; FCH</span>}<span\; class="notranslate">\; \_</span>\mathrm{<span\; class="notranslate">\; OHD</span>}\\ <span\; class="notranslate">\; -</span>\mathrm{<span\; class="notranslate">\; PL</span>}<span\; class="notranslate">\; \_</span>\mathrm{<span\; class="notranslate">\; SCH</span>}<span\; class="notranslate">\; \_</span>\mathrm{<span\; class="notranslate">\; OHD</span>}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; \&times;</span><span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; SCH</span>}<span\; class="notranslate">\; \_</span>\mathrm{<span\; class="notranslate">\; PRD</span>}<span\; class="notranslate">\; /</span>\mathrm{<span\; class="notranslate">\; 20</span>}\mathrm{<span\; class="notranslate">\; ms</span>}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; \}</span>\end{array}\right\}$

where SCH _Assigned is the indicator function of the current scheduling period.

R _assigned is the rate assigned on the R-SCH during the current scheduling period, and the MS is assumed to transmit on the R-SCH until the next assigned action time. PL_FCH_OHD is the basic channel overhead of the physical layer. PL_FCH_OHD is the physical layer auxiliary channel overhead.

R _max (power) is the maximum rate the MS can support within its power limit. If the MS's maximum request rate is determined according to embodiments described herein, R _max (power) is the maximum rate reported in the most recently received SCRM/SCRMM message. If the maximum rate is determined according to a different embodiment, the scheduler may estimate R _max (power) from the reported information and the MS's ability to transmit at the allocated rate. For example, in another embodiment, the scheduler may estimate R _max (power) according to the following equation:

R _assigned is the rate assigned during the current scheduling period, and R _tx is the rate transmitted on the R-SCH during the current scheduling period. R _assigned +1 is a rate that is one higher than the rate currently assigned to the MS; R _assigned -1 is a rate that is one lower than the rate currently assigned to the MS. R(Reported) is the maximum rate reported by the MS in Rate Request messages such as SCRM/SCRMM. The method described above can be used when the MS's R(reported) does not correlate to the maximum rate at which the MS can transmit under its power limit.

Arg max provides the maximum supportable rate of the scheduler.

Capacity Calculation

The sector capacity of the jth sector is estimated from the measured Sinrs of the MS. Sinr is the average pilot weighted combined Sinr per antenna. In one embodiment, the combination per power control group (PCG) is a pilot weighted combination on different antennas of multiple fingers and associated sectors. In one embodiment, the combining per power control group (PCG) is a maximum ratio combining over multiple fingers and different antennas. Combining is not done on different sectors in case of softer handover MS. Averaging can be done over frame duration, or it can be a filtered average over multiple PCGs.

The following equations are used to estimate the loading impact on sector antennas:

${\mathrm{<span\; class="notranslate">\; load</span>}}_{\mathrm{<span\; class="notranslate">\; j</span>}}<span\; class="notranslate">\; =</span>\underset{\mathrm{<span\; class="notranslate">\; j</span>}<span\; class="notranslate">\; \&Element;</span>\mathrm{<span\; class="notranslate">\; ActiveSet</span>}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; i</span>}<span\; class="notranslate">\; )</span>}{\mathrm{<span\; class="notranslate">\; \&Sigma;</span>}}\frac{{\mathrm{<span\; class="notranslate">\; Sinr</span>}}_{\mathrm{<span\; class="notranslate">\; j</span>}}<span\; class="notranslate">\; (</span>{\mathrm{<span\; class="notranslate">\; R</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; ,</span>\mathrm{<span\; class="notranslate">\; E.</span>}<span\; class="notranslate">\; [</span>{\mathrm{<span\; class="notranslate">\; R</span>}}_{\mathrm{<span\; class="notranslate">\; FCH</span>}}<span\; class="notranslate">\; ]</span><span\; class="notranslate">\; )</span>}{\mathrm{<span\; class="notranslate">\; 1</span>}<span\; class="notranslate">\; +</span>{\mathrm{<span\; class="notranslate">\; Sinr</span>}}_{\mathrm{<span\; class="notranslate">\; j</span>}}<span\; class="notranslate">\; (</span>{\mathrm{<span\; class="notranslate">\; R</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; ,</span>\mathrm{<span\; class="notranslate">\; E.</span>}<span\; class="notranslate">\; [</span>{\mathrm{<span\; class="notranslate">\; R</span>}}_{\mathrm{<span\; class="notranslate">\; FCH</span>}}<span\; class="notranslate">\; ]</span><span\; class="notranslate">\; )</span>}$

where Sinr _j (R _i , E[ _RFCH ]) is the estimated Sinr if the MS is assigned a rate R _i on the R-SCH and E[R _FCH ] is the desired transmission rate on the R-FCH.

Assume that the measured pilot Sinr (frame average or filtered average pilot Sinr over two antennas) is (E _cp /N _t ) _j , and it is assigned the Rassign(SCH) rate on the R-SCH. but,

${\mathrm{<span\; class="notranslate">\; Sinr</span>}}_{\mathrm{<span\; class="notranslate">\; j</span>}}<span\; class="notranslate">\; (</span>{\mathrm{<span\; class="notranslate">\; R</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; ,</span>{\mathrm{<span\; class="notranslate">\; R</span>}}_{\mathrm{<span\; class="notranslate">\; FCH</span>}}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; =</span>\frac{\mathrm{<span\; class="notranslate">\; pref</span>}<span\; class="notranslate">\; (</span>{\mathrm{<span\; class="notranslate">\; R</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; )</span>}{\mathrm{<span\; class="notranslate">\; pref</span>}<span\; class="notranslate">\; (</span>{\mathrm{<span\; class="notranslate">\; R</span>}}_{\mathrm{<span\; class="notranslate">\; assign</span>}}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; SCH</span>}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; )</span>}{<span\; class="notranslate">\; (</span>{\mathrm{<span\; class="notranslate">\; E.</span>}}_{\mathrm{<span\; class="notranslate">\; cp</span>}}<span\; class="notranslate">\; /</span>{\mathrm{<span\; class="notranslate">\; N</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; )</span>}_{\mathrm{<span\; class="notranslate">\; j</span>}}<span\; class="notranslate">\; [</span>\mathrm{<span\; class="notranslate">\; 1</span>}<span\; class="notranslate">\; +</span>{<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; T</span>}<span\; class="notranslate">\; /</span>\mathrm{<span\; class="notranslate">\; P</span>}<span\; class="notranslate">\; )</span>}_{{\mathrm{<span\; class="notranslate">\; R</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}}<span\; class="notranslate">\; +</span><span\; class="notranslate">\; (</span>{<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; T</span>}<span\; class="notranslate">\; /</span>\mathrm{<span\; class="notranslate">\; P</span>}<span\; class="notranslate">\; )</span>}_{{\mathrm{<span\; class="notranslate">\; R</span>}}_{\mathrm{<span\; class="notranslate">\; FCH</span>}}}<span\; class="notranslate">\; +</span><span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; C</span>}<span\; class="notranslate">\; /</span>\mathrm{<span\; class="notranslate">\; P</span>}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; )</span><span\; class="notranslate">\; (</span>\frac{\mathrm{<span\; class="notranslate">\; pref</span>}<span\; class="notranslate">\; (</span>{\mathrm{<span\; class="notranslate">\; R</span>}}_{\mathrm{<span\; class="notranslate">\; FCH</span>}}<span\; class="notranslate">\; )</span>}{\mathrm{<span\; class="notranslate">\; pref</span>}<span\; class="notranslate">\; (</span>{\mathrm{<span\; class="notranslate">\; R</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; )</span>}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; ]</span>$

C/P can be an average (CQICH/Pilot) or (Control to Pilot) ratio.

For a voice-only MS, the following equation is used to estimate the average received Sinr:

${\mathrm{<span\; class="notranslate">\; Sinr</span>}}_{\mathrm{<span\; class="notranslate">\; j</span>}}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; 0</span>}<span\; class="notranslate">\; ,</span>\mathrm{<span\; class="notranslate">\; E.</span>}<span\; class="notranslate">\; [</span>{\mathrm{<span\; class="notranslate">\; R</span>}}_{\mathrm{<span\; class="notranslate">\; FCH</span>}}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; v</span>}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; ]</span><span\; class="notranslate">\; )</span><span\; class="notranslate">\; =</span>\frac{{<span\; class="notranslate">\; (</span>{\mathrm{<span\; class="notranslate">\; E.</span>}}_{\mathrm{<span\; class="notranslate">\; cp</span>}}<span\; class="notranslate">\; /</span>{\mathrm{<span\; class="notranslate">\; N</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; )</span>}_{\mathrm{<span\; class="notranslate">\; j</span>}}}{\mathrm{<span\; class="notranslate">\; pref</span>}<span\; class="notranslate">\; (</span>{\mathrm{<span\; class="notranslate">\; R</span>}}_{\mathrm{<span\; class="notranslate">\; assign</span>}}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; SCH</span>}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; )</span>}<span\; class="notranslate">\; \&times;</span><span\; class="notranslate">\; [</span>\mathrm{<span\; class="notranslate">\; 1</span>}<span\; class="notranslate">\; +</span>\left(\begin{array}{c}{<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; T</span>}<span\; class="notranslate">\; /</span>\mathrm{<span\; class="notranslate">\; P</span>}<span\; class="notranslate">\; )</span>}_{\mathrm{<span\; class="notranslate">\; 9.6</span>}\mathrm{<span\; class="notranslate">\; k</span>}}\mathrm{<span\; class="notranslate">\; P</span>}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; 9.6</span>}\mathrm{<span\; class="notranslate">\; k</span>}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; +</span>\\ {<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; T</span>}<span\; class="notranslate">\; /</span>\mathrm{<span\; class="notranslate">\; P</span>}<span\; class="notranslate">\; )</span>}_{\mathrm{<span\; class="notranslate">\; 4.8</span>}\mathrm{<span\; class="notranslate">\; k</span>}}\mathrm{<span\; class="notranslate">\; P</span>}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; 4.8</span>}\mathrm{<span\; class="notranslate">\; k</span>}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; +</span>\\ {<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; T</span>}<span\; class="notranslate">\; /</span>\mathrm{<span\; class="notranslate">\; P</span>}<span\; class="notranslate">\; )</span>}_{\mathrm{<span\; class="notranslate">\; 2.7</span>}\mathrm{<span\; class="notranslate">\; k</span>}}\mathrm{<span\; class="notranslate">\; P</span>}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; 2.7</span>}\mathrm{<span\; class="notranslate">\; k</span>}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; +</span>\\ <span\; class="notranslate">\; (</span>{<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; T</span>}<span\; class="notranslate">\; /</span>\mathrm{<span\; class="notranslate">\; P</span>}<span\; class="notranslate">\; )</span>}_{\mathrm{<span\; class="notranslate">\; 1.5</span>}\mathrm{<span\; class="notranslate">\; k</span>}}\mathrm{<span\; class="notranslate">\; P</span>}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; 1.5</span>}\mathrm{<span\; class="notranslate">\; k</span>}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; +</span>\\ <span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; C</span>}<span\; class="notranslate">\; /</span>\mathrm{<span\; class="notranslate">\; P</span>}<span\; class="notranslate">\; )</span>\end{array}\right)\mathrm{<span\; class="notranslate">\; pref</span>}<span\; class="notranslate">\; (</span>{\mathrm{<span\; class="notranslate">\; R</span>}}_{\mathrm{<span\; class="notranslate">\; FCH</span>}}^{\mathrm{<span\; class="notranslate">\; max</span>}}<span\; class="notranslate">\; =</span>\mathrm{<span\; class="notranslate">\; 9.6</span>}\mathrm{<span\; class="notranslate">\; k</span>}<span\; class="notranslate">\; ]</span>$

where P(R) is the speech codec probability sent at the rate. In another embodiment, where a speech codec with a different rate selection is used, the same equation is used with a different rate to estimate the expected Sinr due to speech transmission on the R-FCH.

In a more general formulation, the voice-activity factor (v) can be used to estimate the average received Sinr when there is no data transmission for data-voice mobility on the R-FCH, as follows:

${\mathrm{<span\; class="notranslate">\; Sinr</span>}}_{\mathrm{<span\; class="notranslate">\; j</span>}}<span\; class="notranslate">\; (</span>{\mathrm{<span\; class="notranslate">\; R</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; ,</span>\mathrm{<span\; class="notranslate">\; E.</span>}<span\; class="notranslate">\; [</span>{\mathrm{<span\; class="notranslate">\; R</span>}}_{\mathrm{<span\; class="notranslate">\; FCH</span>}}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; v</span>}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; ]</span><span\; class="notranslate">\; )</span><span\; class="notranslate">\; =</span>\frac{\mathrm{<span\; class="notranslate">\; pref</span>}<span\; class="notranslate">\; (</span>{\mathrm{<span\; class="notranslate">\; R</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; )</span>{<span\; class="notranslate">\; (</span>{\mathrm{<span\; class="notranslate">\; E.</span>}}_{\mathrm{<span\; class="notranslate">\; cp</span>}}<span\; class="notranslate">\; /</span>{\mathrm{<span\; class="notranslate">\; N</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; )</span>}_{\mathrm{<span\; class="notranslate">\; j</span>}}}{\mathrm{<span\; class="notranslate">\; pref</span>}<span\; class="notranslate">\; (</span>{\mathrm{<span\; class="notranslate">\; R</span>}}_{\mathrm{<span\; class="notranslate">\; assign</span>}}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; SCH</span>}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; )</span>}<span\; class="notranslate">\; [</span>\mathrm{<span\; class="notranslate">\; 1</span>}<span\; class="notranslate">\; +</span>{<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; T</span>}<span\; class="notranslate">\; /</span>\mathrm{<span\; class="notranslate">\; P</span>}<span\; class="notranslate">\; )</span>}_{{\mathrm{<span\; class="notranslate">\; R</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}}<span\; class="notranslate">\; +</span><span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; v</span>}<span\; class="notranslate">\; -</span>\mathrm{<span\; class="notranslate">\; 1</span>}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; v</span>}{<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; T</span>}<span\; class="notranslate">\; /</span>\mathrm{<span\; class="notranslate">\; P</span>}<span\; class="notranslate">\; )</span>}_{{\mathrm{<span\; class="notranslate">\; R</span>}}_{\mathrm{<span\; class="notranslate">\; FCH</span>}}^{\mathrm{<span\; class="notranslate">\; max</span>}}}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; (</span>\frac{\mathrm{<span\; class="notranslate">\; pref</span>}<span\; class="notranslate">\; (</span>{\mathrm{<span\; class="notranslate">\; R</span>}}_{\mathrm{<span\; class="notranslate">\; FCH</span>}}^{\mathrm{<span\; class="notranslate">\; max</span>}}<span\; class="notranslate">\; )</span>}{\mathrm{<span\; class="notranslate">\; pref</span>}<span\; class="notranslate">\; (</span>{\mathrm{<span\; class="notranslate">\; R</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; )</span>}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; ]</span>$

A more direct measure of reverse link capacity known as rise over thermal (ROT) can be obtained if interference from adjacent sectors and average thermal noise can be measured. Let the other cell interference measured during the previous transmission denote I _oc and the thermal noise be N _o , then the estimated ROT during the next transmission can be estimated as:

${\mathrm{<span\; class="notranslate">\; ROT</span>}}_{\mathrm{<span\; class="notranslate">\; j</span>}}<span\; class="notranslate">\; =</span>\frac{\mathrm{<span\; class="notranslate">\; 1</span>}}{<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; 1</span>}<span\; class="notranslate">\; -</span>{\mathrm{<span\; class="notranslate">\; load</span>}}_{\mathrm{<span\; class="notranslate">\; j</span>}}<span\; class="notranslate">\; )</span>}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; 1</span>}<span\; class="notranslate">\; +</span>{\mathrm{<span\; class="notranslate">\; I</span>}}_{\mathrm{<span\; class="notranslate">\; oc</span>}}<span\; class="notranslate">\; /</span>{\mathrm{<span\; class="notranslate">\; N</span>}}_{\mathrm{<span\; class="notranslate">\; o</span>}}<span\; class="notranslate">\; )</span>$

If the scheduler is a multi-level scheduler, with different layers of scheduler elements scheduling different MSs, sector capacity needs to be allocated on different scheduling elements. In one embodiment, wherein the scheduler has two scheduling elements, one at the BTS place and one at the BSC place, the distribution load estimated at the BSC place is Load _j (BSC), and the distribution load estimated at the BTS place is Load _j (BTS). but,

Load _j (BSC)+Load _j (BTS)＜＝1-1(1+I _oc /N _o )/ROT(max)

Since the timing delay of BSC scheduling is greater than that of BTS, the estimated distribution load Load _j (BSC) at BSC can be known at BTS before BTS scheduling. The BTS scheduler has the following restrictions on the allocated payload before scheduling:

Load _j (BTS)＜＝1-(1+I _oc /N _o )/ROT(max)-Load _j (BSC)

Scheduling Algorithm

The scheduling algorithm has the following characteristics:

a) In order to increase the TDM gain scheduling minimum number of MSs,

b) CDM has fewer users for maximum capacity utilization, and

c) Prioritization of MS rate requests

Mobile prioritization may be based on one or more of the reported or measured quantities of change. A priority function that increases system throughput can have one or more of the following properties:

The higher the measurement pilot Ecp/Nt (normalized), the lower the mobile priority. Instead of using measured Ecp/Nt, a pilot Ecp/Nt setpoint maintained by the base station for the power control outer loop may be used. A lower Ecp/Nt (measured or setpoint) means that if the channel changes little there will be a higher instantaneous channel thus increasing throughput.

可以作为SHO因数，其中P_i ^rx(k)是第i个移动通过其活动集合内第k个基站的平均接收到导频功率，P_i ^rx(j)是第i个移动通过其活动集合内最强的第j个基站的平均接收到导频功率，且M是移动活动集合内的基站数(与移动进行软切换的基站集合)。For movement within SHO, the pilot Ecp/Nt (measurement/setpoint) can be weighted by the SHO factor to reduce other cell interference. For example, if the average received pilot power at all SHO legs is available, then

can be used as the SHO factor, where P _i ^rx (k) is the average received pilot power of the i-th mobile through the k-th base station in its active set, and P _i ^rx (j) is the average received pilot power of the i-th mobile through its active set The average received pilot power of the strongest j-th base station, and M is the number of base stations in the mobile active set (the set of base stations that perform soft handover with the mobile).

The higher the measured or estimated propagation loss, the lower the priority. If the mobile reports the transmitted pilot power periodically in request messages such as SCRM, the propagation loss can be calculated from the measured received pilot. Or else, it can estimate which move has better propagation loss based on the strength reported by FL Ecp/Nt.

Rate-based priority function: If the base station estimates the rate of mobile movements using some rate estimation algorithm, stationary movements are given the highest priority and medium-speed movements are given the lowest priority.

A priority function based on the above measured or reported parameters is an unfair priority function aimed at increasing reverse link system throughput. Additionally, priority may be increased or decreased by a cost metric determined by the user's registered service level. In addition to the above, a certain degree of fairness may be provided by a fairness factor. Two different degrees of fairness are described as follows:

Proportional Fairness (PF): PF is the ratio of the maximum request rate to the average obtained transfer rate. therefore $\mathrm{PF}=R_i^{\mathrm{req}}/R_i^{\mathrm{alloc}},$ where R _i ^req is the request rate, and R _i ^alloc is the average rate allocated by the scheduler.

Round-Robin Fairness (RRF): Round-robin scheduling attempts to provide all users with equal transmission opportunities. When a mobile enters the system, RRF is initialized to some value, eg 0. The RRF is incremented by one every scheduling period when no rate is assigned to the mobile. RRF is reset to a starting value of 0 each time a rate (or request rate) is allocated to a move. This is similar to how a move scheduled during the last scheduling period is the last in the queue.

Fairness can be used with a priority function to prioritize moves within a priority list. When fairness is used alone to prioritize mobility, it provides proportional fair or round-robin fair scheduling, which provides optimal throughput for the reverse link and allows multiple transmissions with full capacity utilization.

An embodiment using a previously defined priority function and a different aspect of proportional fairness may determine the i-th user's priority as follows:

${\mathrm{<span\; class="notranslate">\; w</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; =</span>\frac{\mathrm{<span\; class="notranslate">\; 1</span>}}{\mathrm{<span\; class="notranslate">\; Ecp</span>}<span\; class="notranslate">\; /</span>{\mathrm{<span\; class="notranslate">\; Nt</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; setpt</span>}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; *</span>\mathrm{<span\; class="notranslate">\; SHOfactor</span>}}<span\; class="notranslate">\; \&CenterDot;</span>{<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; PF</span>}<span\; class="notranslate">\; )</span>}^{\mathrm{<span\; class="notranslate">\; \&alpha;</span>}}$

Among them, the parameter α called fairness factor can be used to make a trade-off between fairness and system throughput. As α increases, the fairness becomes worse. Schedulers with higher α have higher throughput.

Next consider a particular embodiment where the scheduler wakes up every scheduling period and makes rate allocation decisions based on pending rate requests. The scheduling algorithm is similar to that described below.

使得MS_i的主扇区为扇区j}Initialization: MS rate requests are prioritized. Associated with each MS is a priority count PRIORITY. MS's PRIORITY is initially initialized to 0. When a new MS enters the system with sector j as the primary sector, its PRIORITY is equally set to min{PRIORITY _i ,

Make the primary sector of MS _i be sector j}

1. Let the load limit be Load _j ≤ max load (maximum load), so as to limit the overshoot of thermal rise above a certain threshold. For calibration purposes, the scheduler uses a maximum load value of 0.45. Computing the capacity consumed due to pilot transmissions and transmissions on the fundamental channel (due to voice or data), and available capacity available is calculated as:

$\mathrm{<span\; class="notranslate">\; Cav</span>}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; j</span>}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; =</span>\mathrm{<span\; class="notranslate">\; max</span>}\mathrm{<span\; class="notranslate">\; load</span>}<span\; class="notranslate">\; -</span>\underset{\mathrm{<span\; class="notranslate">\; j</span>}<span\; class="notranslate">\; \&Element;</span>\mathrm{<span\; class="notranslate">\; ActiveSet</span>}}{\mathrm{<span\; class="notranslate">\; \&Sigma;</span>}}\frac{{\mathrm{<span\; class="notranslate">\; Sinr</span>}}_{\mathrm{<span\; class="notranslate">\; j</span>}}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; 0</span>}<span\; class="notranslate">\; ,</span>\mathrm{<span\; class="notranslate">\; E.</span>}<span\; class="notranslate">\; [</span>{\mathrm{<span\; class="notranslate">\; R</span>}}_{\mathrm{<span\; class="notranslate">\; FCH</span>}}<span\; class="notranslate">\; ]</span><span\; class="notranslate">\; )</span>}{\mathrm{<span\; class="notranslate">\; 1</span>}<span\; class="notranslate">\; +</span>{\mathrm{<span\; class="notranslate">\; Sinr</span>}}_{\mathrm{<span\; class="notranslate">\; j</span>}}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; 0</span>}<span\; class="notranslate">\; ,</span>\mathrm{<span\; class="notranslate">\; E.</span>}<span\; class="notranslate">\; [</span>{\mathrm{<span\; class="notranslate">\; R</span>}}_{\mathrm{<span\; class="notranslate">\; FCH</span>}}<span\; class="notranslate">\; ]</span><span\; class="notranslate">\; )</span>}$

Wherein the maximum load (max Load) is the maximum load that satisfies the specified thermal rise interruption criteria.

MS rate requests are prioritized by their PRIORITY in descending order. The MS with the highest PRIORITY is at the top of the queue. When multiple MSs with the same PRIORITY are at the top of the queue, the scheduler randomly selects among these MSs with equal probability.

2. Set k=1

3. The data-only MS at position k in the queue is assigned a rate R _k , given as:

${\mathrm{<span\; class="notranslate">\; R</span>}}_{\mathrm{<span\; class="notranslate">\; k</span>}}<span\; class="notranslate">\; =</span>\mathrm{<span\; class="notranslate">\; min</span>}<span\; class="notranslate">\; \{</span>{\mathrm{<span\; class="notranslate">\; R</span>}}_{\mathrm{<span\; class="notranslate">\; max</span>}}^{\mathrm{<span\; class="notranslate">\; k</span>}}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; the\; s</span>}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; ,</span>\underset{\mathrm{<span\; class="notranslate">\; R</span>}}{\mathrm{<span\; class="notranslate">\; arg</span>}\mathrm{<span\; class="notranslate">\; max</span>}}\left[\begin{array}{c}\mathrm{<span\; class="notranslate">\; R</span>}<span\; class="notranslate">\; |</span>\mathrm{<span\; class="notranslate">\; Cav</span>}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; j</span>}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; -</span>\frac{{\mathrm{<span\; class="notranslate">\; Sinr</span>}}_{\mathrm{<span\; class="notranslate">\; j</span>}}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; R</span>}<span\; class="notranslate">\; ,</span>\mathrm{<span\; class="notranslate">\; E.</span>}<span\; class="notranslate">\; [</span>{\mathrm{<span\; class="notranslate">\; R</span>}}_{\mathrm{<span\; class="notranslate">\; FCH</span>}}<span\; class="notranslate">\; ]</span><span\; class="notranslate">\; )</span>}{\mathrm{<span\; class="notranslate">\; 1</span>}<span\; class="notranslate">\; +</span>{\mathrm{<span\; class="notranslate">\; Sinr</span>}}_{\mathrm{<span\; class="notranslate">\; j</span>}}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; R</span>}<span\; class="notranslate">\; ,</span>\mathrm{<span\; class="notranslate">\; E.</span>}<span\; class="notranslate">\; [</span>{\mathrm{<span\; class="notranslate">\; R</span>}}_{\mathrm{<span\; class="notranslate">\; FCH</span>}}<span\; class="notranslate">\; ]</span><span\; class="notranslate">\; )</span>}\\ <span\; class="notranslate">\; +</span>\frac{{\mathrm{<span\; class="notranslate">\; Sinr</span>}}_{\mathrm{<span\; class="notranslate">\; j</span>}}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; 0</span>}<span\; class="notranslate">\; ,</span>\mathrm{<span\; class="notranslate">\; E.</span>}<span\; class="notranslate">\; [</span>{\mathrm{<span\; class="notranslate">\; R</span>}}_{\mathrm{<span\; class="notranslate">\; FCH</span>}}<span\; class="notranslate">\; ]</span><span\; class="notranslate">\; )</span>}{\mathrm{<span\; class="notranslate">\; 1</span>}<span\; class="notranslate">\; +</span>{\mathrm{<span\; class="notranslate">\; Sinr</span>}}_{\mathrm{<span\; class="notranslate">\; j</span>}}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; 0</span>}<span\; class="notranslate">\; ,</span>\mathrm{<span\; class="notranslate">\; E.</span>}<span\; class="notranslate">\; [</span>{\mathrm{<span\; class="notranslate">\; R</span>}}_{\mathrm{<span\; class="notranslate">\; FCH</span>}}<span\; class="notranslate">\; ]</span><span\; class="notranslate">\; )</span>}<span\; class="notranslate">\; \&Greater\; Equal;</span>\mathrm{<span\; class="notranslate">\; 0</span>}<span\; class="notranslate">\; ;</span>{<span\; class="notranslate">\; \&ForAll;</span>}_{\mathrm{<span\; class="notranslate">\; j</span>}}<span\; class="notranslate">\; \&Element;</span>\mathrm{<span\; class="notranslate">\; ActiveSet</span>}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; k</span>}<span\; class="notranslate">\; )</span>\end{array}\right]<span\; class="notranslate">\; \}</span>$

Available capacity is updated to:

$\mathrm{<span\; class="notranslate">\; Cav</span>}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; j</span>}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; =</span>\mathrm{<span\; class="notranslate">\; Cav</span>}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; j</span>}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; -</span>\frac{{\mathrm{<span\; class="notranslate">\; Sinr</span>}}_{\mathrm{<span\; class="notranslate">\; j</span>}}<span\; class="notranslate">\; (</span>{\mathrm{<span\; class="notranslate">\; R</span>}}_{\mathrm{<span\; class="notranslate">\; k</span>}}<span\; class="notranslate">\; ,</span>\mathrm{<span\; class="notranslate">\; E.</span>}<span\; class="notranslate">\; [</span>{\mathrm{<span\; class="notranslate">\; R</span>}}_{\mathrm{<span\; class="notranslate">\; FCH</span>}}<span\; class="notranslate">\; ]</span><span\; class="notranslate">\; )</span>}{\mathrm{<span\; class="notranslate">\; 1</span>}<span\; class="notranslate">\; +</span>{\mathrm{<span\; class="notranslate">\; Sinr</span>}}_{\mathrm{<span\; class="notranslate">\; j</span>}}<span\; class="notranslate">\; (</span>{\mathrm{<span\; class="notranslate">\; R</span>}}_{\mathrm{<span\; class="notranslate">\; k</span>}}<span\; class="notranslate">\; ,</span>\mathrm{<span\; class="notranslate">\; E.</span>}<span\; class="notranslate">\; [</span>{\mathrm{<span\; class="notranslate">\; R</span>}}_{\mathrm{<span\; class="notranslate">\; FCH</span>}}<span\; class="notranslate">\; ]</span><span\; class="notranslate">\; )</span>}<span\; class="notranslate">\; +</span>\frac{{\mathrm{<span\; class="notranslate">\; Sinr</span>}}_{\mathrm{<span\; class="notranslate">\; j</span>}}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; 0</span>}<span\; class="notranslate">\; ,</span>\mathrm{<span\; class="notranslate">\; E.</span>}<span\; class="notranslate">\; [</span>{\mathrm{<span\; class="notranslate">\; R</span>}}_{\mathrm{<span\; class="notranslate">\; FCH</span>}}<span\; class="notranslate">\; ]</span><span\; class="notranslate">\; )</span>}{\mathrm{<span\; class="notranslate">\; 1</span>}<span\; class="notranslate">\; +</span>{\mathrm{<span\; class="notranslate">\; Sinr</span>}}_{\mathrm{<span\; class="notranslate">\; j</span>}}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; 0</span>}<span\; class="notranslate">\; ,</span>\mathrm{<span\; class="notranslate">\; E.</span>}<span\; class="notranslate">\; [</span>{\mathrm{<span\; class="notranslate">\; R</span>}}_{\mathrm{<span\; class="notranslate">\; FCH</span>}}<span\; class="notranslate">\; ]</span><span\; class="notranslate">\; )</span>}<span\; class="notranslate">\; ;</span>{<span\; class="notranslate">\; \&ForAll;</span>}_{\mathrm{<span\; class="notranslate">\; j</span>}}<span\; class="notranslate">\; \&Element;</span>\mathrm{<span\; class="notranslate">\; ActiveSet</span>}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; k</span>}<span\; class="notranslate">\; )</span>$

4. If $R_{\max }^k\left(\mathrm{the\; s}\right)>0$ And R _k =0, increment the PRIORITY of MS

Otherwise, do not change the PRIORITY of MS

5. k=k+1, if k is less than the total number of MSs in the list, go to step 3, otherwise stop.

Table 1

Baseline Specific Parameters

parameters Typical value Notes Headroom_Req 5 decibels Conservative rate request to reserve power headroom for long-term channel changes Reduce DTX on R-SCH Headroom_Tx 2dB Reduce the probability of power outage during R-SCH transmission Average transmit power filter coefficient α_Headroom 1/16 The normalized average transmit pilot power is calculated as a filtered version over several PCGs ActionTimeDelay(method a) 31.25 milliseconds Based on expected ESCAMM delay, including 2PCG MS encoding delay ActionTimeDelay(method b) 77.5 milliseconds Expected ESCAM delay on F-PDCH based on -5dB main sector geometry. This includes 2PCG MS encoding delay

It will be obvious to those skilled in the art that other values can also be used for the parameters in Table 1. It will be apparent to those skilled in the art that more or fewer parameters may be used for a particular implementation.

Fig. 5 is a flowchart of the scheduling process in the embodiment. In an embodiment, mobile i and mobile j send the requested rate to the scheduler in step 300 . Alternatively mobile i and mobile j send the request rate to the scheduler in step 310 .

In step 300, the scheduler builds a list of moves (Mi) that it wants to schedule. The scheduler then builds a list of base stations (BTS) that the scheduler is responsible for scheduling. Also, the scheduler builds a list of moves that are not in the list of base stations that the scheduler is responsible for scheduling, and said moves are in Soft Handover (SHO) with the base station (Ui) that the scheduler is responsible for scheduling. Control flow proceeds to step 302 .

The BTS provides the DTX reported by the mobile to the scheduler. In step 302, a check is made to determine if the scheduled movement reports DTX, in which case resources may be reallocated from the scheduled movement if a _i is less than the last scheduled time minus 1 plus the scheduling period. ai is the current time. T _i is the last scheduling time. In step 302, resources are reallocated before the scheduled time. The rate of scheduled moves is reset and available capacity is reallocated to other requesting moves. In step 306, it is checked whether the current time reaches the scheduling point. If the current time has not reached the scheduling point, the control flow goes to step 302 . If the current time reaches the scheduling point, the control flow goes to step 308 .

In step 308, the scheduler provides loc and piolot estimates of {M _i } and {U _i } from the BTS. The capacity of each Bi is initialized given the loc estimate. For each Bi, the contribution to capacity is subtracted from the available capacity given the voice activity and autonomous transmissions on the R-FCH/R-DCCH. The measure used to subtract is the pilot Ecp/Nt. And for each Bi, what is subtracted from the available capacity is the expected impact of {Ui}. Control flow then proceeds to step 310 .

In step 310, the pilot Ec/Nt and setpoint of {Mi} and the Rx pilot power are provided to the scheduler and used by the prioritization function. Movement rate requests are prioritized in a priority queue. In one embodiment, a prioritization function is used using measured and reported information. In an embodiment, the prioritization function provides fairness. Control flow proceeds to step 312 .

At step 312, a maximum rate is assigned to the highest priority mobile so as not to violate the capacity constraints of all BSs within the soft handover. Maximum Rate is the maximum rate supported by the highest priority mobile. The highest priority move is placed at the end of the priority queue. Available capacity is updated by subtracting the effect of movement on capacity at the maximum rate allocated. Control flow proceeds to step 314 .

At step 314, a check is made to determine if all moves in the {Mi} list have been scanned. If all moves within {Mi} have not been scanned, control flow proceeds to step 312 . Control flow proceeds to step 302 if all moves within the {Mi} list have been scanned.

Those skilled in the art can understand that methods and steps can be interchanged without departing from the scope of the present invention. Those skilled in the art would also understand that information and signals may be represented using any of a variety of technologies and techniques. For example, data, instructions, commands, information, signals, bits, symbols, and chips are preferably represented by voltages, currents, electromagnetic waves, magnetic fields or particles thereof, optical fields or particles thereof, or any combination thereof.

Those of skill in the art would understand that information and signals may be represented using a variety of different technologies and techniques. For example, the data, instructions, commands, information, signals, bits, symbols, and chips that may be involved in the above description are preferably composed of voltages, circuits, electromagnetic waves, magnetic fields or particles thereof, light fields or particles thereof, or any combination thereof To represent.

Figure 6 is a block diagram of the BS 12, according to an embodiment. On the downlink, data for the downlink is received and processed (eg, formatted, encoded, etc.) by a transmit (TX) data processor 612 . The processing of each channel is determined by the parameter set associated with that parameter, and in one embodiment, may be implemented as described in the standard document. The processed data may be provided to a modulator (MOD) 614 and further processed (eg, channelized, scrambled, etc.) to provide modulated data. A transmitter (TMTR) unit 616 then converts the modulated data into one or more analog signals, which are further conditioned (eg, amplified, filtered, and frequency upconverted) to provide a downlink signal. Downlink signals are routed through duplexer (D) 622 and sent through antenna 624 to the designated MS.

Figure 7 is a block diagram of MS 106, under an embodiment. The downlink is received by antenna 712 , routed through duplexer 714 and provided to receiver (RCVR) unit 722 . Receiver unit 722 conditions (eg, filters, amplifies, and frequency downconverts) the received signal and further digitizes the conditioned signal to provide samples. A demodulator 724 then receives and processes (eg, descrambles, channelizes, and data demodulates) the samples to provide symbols. Demodulator 724 can implement rake receivers that can process multiple instances (or multipath components) of a received signal and provide combined symbols. A receive (RX) data processor 726 then decodes the symbols, verifies received packets and provides decoded packets. The processing by demodulator 724 and RX data processor 726 is complementary to that by modulator 614 and TX data processor 612 , respectively.

On the uplink, uplink data, pilot data, and feedback information are processed (e.g., formatted, encoded, etc.) by the transmit (TX) data processor and further processed (e.g., channelized , scrambling, etc.), and conditioned (eg, converted to analog, amplified, filtered, and frequency upconverted) by the transmitter unit 746 to provide an uplink signal. Uplink data processing is described by standard documents. The uplink signal is routed through duplexer 714 and sent through antenna 712 to one or more BSs 12.

Referring to FIG. 6, at BS 12, uplink signals are received by antenna 624, routed through duplexer 622 and provided to receiver unit 628. Receiver unit 628 conditions (eg, frequency downconverts, filters, and amplifies) the received signal and further digitizes the conditional signal to provide a sample stream.

In the embodiment shown in FIG. 6, BS 12 includes a plurality of channel processors 630a through 630n. Each channel processor 630 may be assigned to process the sample stream for one MS to recover data and feedback information sent by the assigned MS on the uplink. Each channel processor 630 includes (1) a demodulator 632, which processes (e.g., descrambles, channelizes, etc.) the samples to provide symbols, and (2) an RX data processor 634, which further processes the symbols for distribution The MS provides the decoded data.

The controllers 640 and 730 control corresponding processes at the BS and at the MS. Each controller can also be designed to implement all or part of the scheduling process. Program codes and data required by controllers 640 and 730 may be stored in memory units 642 and 732, respectively.

Those skilled in the art can also understand that various illustrative logical blocks, modules, circuits and algorithm steps disclosed herein and described in conjunction with the embodiments described herein may be implemented by electronic hardware, computer software or a combination of both. To clearly illustrate this interchangeability of hardware and software, various illustrative components, blocks, modules, circuits, and steps have generally been described in terms of their functionality. Whether such functionality is implemented as hardware or software depends upon the particular application and design being used for the overall system. Skilled artisans may implement the described functionality in numerous ways for each particular application, but such implementation decisions should not cause any departure from the scope of the present invention.

Implementation or execution of the various logical blocks, modules, and circuits disclosed in the illustrative embodiments herein may be implemented using a general purpose processor, digital signal processor (DSP) or other processor, application specific integrated circuit (ASIC), field programmable A gate array (FPGA) or other programmable logic device, discrete gate or transistor logic, discrete hardware components, or a combination of any of the above can be programmed to implement the functions described herein. A general purpose processor is preferably a microprocessor, however, alternatively, the processor can be any conventional processor, controller, microcontroller or state machine. A processor may be implemented as a combination of computing devices, eg, a combination of a DSP and a microprocessor, multiple microprocessors, one or more microprocessors in conjunction with a DSP core, or any such configuration.

The method steps or algorithms disclosed in the embodiments herein may be implemented directly in hardware, in software modules executed by a processor, or in a combination of both. A software module may reside in RAM memory, flash memory, ROM memory, EPROM memory, EEPROM memory, registers, hard disk, removable disk, CD-ROM, or any other form of storage medium known in the art . An exemplary processor is preferably coupled to the processor to enable the processor to read information from, and write information to, the storage medium. Alternatively, the storage medium may be integrated into the processor. The processor and storage medium may reside in an application specific integrated circuit, ASIC. The ASIC may reside within the user terminal. Alternatively, the processor and storage medium may reside in discrete components of the user terminal.

The above description of the preferred embodiment enables any person skilled in the art to make or use the invention. Various modifications to these embodiments will be readily apparent to those skilled in the art, and the general principles defined herein may be applied to other embodiments without the exercise of inventiveness. Thus, the present invention is not intended to be limited to the embodiments shown herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.

appendix

Reverse Link Rated Attribute Gain Table (Part 1 of 2)

Data rate (bits per second) frame length (milliseconds) encoding Nominal_Attribute_Gain Pilot_Reference_Level TargetErrorRate¹ 1,200 80 Convolution -56 0 0.05 1,350 40 Convolution -54 0 0.05 1,500 20 Convolution -47 0 0.01 1,800 20 Convolution -42 3 0.01 1,800 40 or 80 Convolution -45 3 0.05 2,400 40 or 80 Convolution -30 0 0.05 2,700 20 Convolution -twenty two 0 0.01 3,600 20 Convolution -13 3 0.01 3,600 40 or 80 Convolution -17 3 0.05 4,800 20 Convolution -2 0 0.01 4,800 40 or 80 Convolution -3 0 0.05 7,200 20 Convolution 15 3 0.01 7,200 40 or 80 Convolution 10 3 0.05 9,600 20 Convolution 30 0 0.01 9,600 40 or 80 Convolution twenty four 0 0.05 9,600 (RC 3 and 5) 5 Convolution 58 0 0.01 9,600 (RC 4 and 6) 5 Convolution 54 3 0.01 14,400 20 Convolution 44 3 0.01 14,400 40 or 80 Convolution 40 3 0.05 19,200 20, 40 or 80 Convolution 50 1 0.05

28,800 20, 40 or 80 Convolution 56 11 0.05 38,400 20, 40 or 80 Convolution 60 11 0.05 57,600 20, 40 or 80 Convolution 72 18 0.05 76,800 20, 40 or 80 Convolution 72 twenty one 0.05 115,200 20, 40 or 80 Convolution 80 32 0.05

Reverse Link Rated Attribute Gain Table (Part 2 of 2)

Data rate (bits per second) frame length (milliseconds) encoding Nominal_Attribute_Gain Pilot_Reference_Level TargetErrorRate¹ 153,600 20, 40 or 80 Convolution 84 36 0.05 230,400 20 or 40 Convolution 88 46 0.05 259,200 80 Convolution 96 50 0.05 307,200 20 or 40 Convolution 96 54 0.05 460,800 20 Convolution 104 61 0.05 518,400 40 Convolution 104 64 0.05 614,400 20 Convolution 112 68 0.05 1036,800 20 Convolution 128 83 0.05 4,800 80 Turbo 2 0 0.05 7,200 80 Turbo twenty four 0 0.05 9,600 40 or 80 Turbo 34 0 0.05 14,400 40 or 80 Turbo 42 0 0.05 19,200 20, 40 or 80 Turbo 44 2 0.05 28,800 20, 40 or 80 Turbo 52 9 0.05 38,400 20, 40 or 80 Turbo 56 10 0.05 57,600 20, 40 or 80 Turbo 64 19 0.05 76,800 20, 40 or 80 Turbo 68 19 0.05 115,200 20, 40 or 80 Turbo 76 29 0.05

153,600 20, 40 or 80 Turbo 76 33 0.05 230,400 20 or 40 Turbo 88 39 0.05 259,200 80 Turbo 88 48 0.05 307,200 20 or 80 Turbo 88 50 0.05 450,800 20 Turbo 104 54 0.05 518,400 40 Turbo 108 56 0.05 614,400 20 Turbo 112 58 0.05 1036,800 20 Turbo 125 78 0.05

¹ The error rate is the frame error rate when a single transmission unit is used; otherwise the logical transmission unit (LTU) error rate is used. This applies to the case where the target error rate is 0.05.

Claims (15)

1. A method for estimating capacity on a reverse link, comprising: Measuring multiple signal-to-noise ratios at a station for multiple rates; The measured multiple signal-to-noise ratios are averaged over multiple pilot control groups; determining sector loading based on the averaged plurality of signal-to-noise ratios, the assigned transmission rate, and the desired transmission rate; and Capacity on the reverse link is estimated based on sector loading. 2. The method of claim 1, wherein the station is a base station. 3. A method of estimating the load impact on sector antennas, comprising: allocating a transmission rate R _i on the first communication channel; determining an expected transmission rate E[R] on the second communication channel; estimating the signal-to-noise ratio of the station for the assigned transmission rate R _i on the first communication channel and the expected transmission rate E[R] on the second communication channel; and The load impact is estimated based on the estimated signal-to-noise ratio. 4. The method of claim 3, wherein the estimation of the load impact on sector antenna j is based on: ${\mathrm{load}}_j=\underset{j\&Element;\mathrm{ActiveSet}\left(i\right)}{\mathrm{\&Sigma;}}\frac{{\mathrm{Sinr}}_j(R_i,\mathrm{E.}[R_{\mathrm{FCH}}\left]\right)}{1+{\mathrm{Sinr}}_j(R_i,\mathrm{E.}[R_{\mathrm{FCH}}\left]\right)},$ where E[R _FCH ] is the expected transmission rate on R-FCH, and Sinr _j (R _i , E[R _FCH ]) is the estimated Sinr if the mobile station is assigned rate Ri on R-SCH. 5. The method of claim 4, wherein the first communication channel is a reverse link auxiliary channel and the second communication channel is a reverse link fundamental channel. 6. A method for allocating sector capacity on base station BS and base station controller BSC, characterized in that, comprising: Measuring the other cell interference I _oc during the previous transmission; Determine the thermal noise N _o ; Determine the maximum thermal rise ROT(max); determining the estimated distributed load _Loadj (BSC) at the BSC; and The sector capacity allocated to the base station is determined based on the measured ratio of other cell interference to thermal noise, the maximum thermal rise, and the estimated allocated load at the BSC. 7. The method according to claim 6, wherein the determination of the sector capacity allocated to the base station is such that: Load _j (BTS)<=1-(1+I _oc /N _o )/ROT(max)-Load _j (BSC), where Load _j (BSC) is the estimated distribution load at the BSC, and Load _j (BTS) is the estimated distribution load at the BTS. 8. A method for determining station priority, comprising: Determine the ratio Ecp/Nt of pilot energy to noise plus interference; Determine the soft handover factor SHOfactor; determine the fair value F; determine the pro rata fair value PF; determine the fairness factor α; and The station priority is determined based on the ratio of pilot energy to noise plus interference, soft handoff factor, fairness value and fairness factor α. 9. The method of claim 8, wherein determining the soft handover factor is based on average received pilot power. 10. The method of claim 8, wherein the fair value is a proportional fair value. 11. The method of claim 8, wherein the fair value is a round-robin fair value. 12. The method of claim 10, wherein said determining a proportional fairness value is based on a ratio of a maximum request rate to an average transmission rate. 13. The method of claim 12, wherein said determining station priority _w is based on: $w_i=\frac{1}{\mathrm{Ecp}/{\mathrm{Nt}}_i\left(\mathrm{SHOfactor}\right)}\&Center\; Dot;{\left(\mathrm{PF}\right)}^{\mathrm{\&alpha;}},$ where SHOfactor is the soft handover factor, PF is the proportional fairness value and α is the fairness factor. 14. A method for estimating capacity for use on a reverse link, comprising: means for measuring multiple signal-to-noise ratios at a station for multiple rates; means for averaging the measured signal-to-noise ratios over the plurality of pilot control groups; means for determining sector loading based on the averaged plurality of signal-to-noise ratios, the assigned transmission rate, and the desired transmission rate; and Means for estimating capacity on a reverse link based on sector loading. 15. An apparatus for estimating loading effects on sector antennas, comprising: means for allocating a transmission rate R _i on a first communication channel; means for determining an expected transmission rate E[R] on the second communication channel; means for estimating the signal-to-noise ratio of the station for the assigned transmission rate R _i on the first communication channel and the expected transmission rate E[R] on the second communication channel; and Means for estimating load effects based on an estimated signal-to-noise ratio.

Images