EP0974237A2 - Method of and apparatus for scheduling data transmissions in a communication network - Google Patents

Method of and apparatus for scheduling data transmissions in a communication network

Info

Publication number
EP0974237A2
EP0974237A2 EP98919748A EP98919748A EP0974237A2 EP 0974237 A2 EP0974237 A2 EP 0974237A2 EP 98919748 A EP98919748 A EP 98919748A EP 98919748 A EP98919748 A EP 98919748A EP 0974237 A2 EP0974237 A2 EP 0974237A2
Authority
EP
European Patent Office
Prior art keywords
transmission rate
data
scheduled
cell
remote station
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
EP98919748A
Other languages
German (de)
French (fr)
Other versions
EP0974237B1 (en
Inventor
Edward G. Tiedemann, Jr.
Tao Chen
Yu-Cheun Jou
Yu-Chuan Lin
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Qualcomm Inc
Original Assignee
Qualcomm Inc
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Qualcomm Inc filed Critical Qualcomm Inc
Priority to EP06118019A priority Critical patent/EP1713288B1/en
Publication of EP0974237A2 publication Critical patent/EP0974237A2/en
Application granted granted Critical
Publication of EP0974237B1 publication Critical patent/EP0974237B1/en
Anticipated expiration legal-status Critical
Expired - Lifetime legal-status Critical Current

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management
    • H04W72/50Allocation or scheduling criteria for wireless resources
    • H04W72/56Allocation or scheduling criteria for wireless resources based on priority criteria
    • H04W72/566Allocation or scheduling criteria for wireless resources based on priority criteria of the information or information source or recipient
    • H04W72/569Allocation or scheduling criteria for wireless resources based on priority criteria of the information or information source or recipient of the traffic information
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/10Flow control; Congestion control
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/10Flow control; Congestion control
    • H04L47/24Traffic characterised by specific attributes, e.g. priority or QoS
    • H04L47/2425Traffic characterised by specific attributes, e.g. priority or QoS for supporting services specification, e.g. SLA
    • H04L47/2433Allocation of priorities to traffic types
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/10Flow control; Congestion control
    • H04L47/30Flow control; Congestion control in combination with information about buffer occupancy at either end or at transit nodes
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W28/00Network traffic management; Network resource management
    • H04W28/16Central resource management; Negotiation of resources or communication parameters, e.g. negotiating bandwidth or QoS [Quality of Service]
    • H04W28/18Negotiating wireless communication parameters
    • H04W28/22Negotiating communication rate
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W52/00Power management, e.g. TPC [Transmission Power Control], power saving or power classes
    • H04W52/04TPC
    • H04W52/06TPC algorithms
    • H04W52/12Outer and inner loops
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W52/00Power management, e.g. TPC [Transmission Power Control], power saving or power classes
    • H04W52/04TPC
    • H04W52/30TPC using constraints in the total amount of available transmission power
    • H04W52/36TPC using constraints in the total amount of available transmission power with a discrete range or set of values, e.g. step size, ramping or offsets
    • H04W52/367Power values between minimum and maximum limits, e.g. dynamic range
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management
    • H04W72/20Control channels or signalling for resource management
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W8/00Network data management
    • H04W8/02Processing of mobility data, e.g. registration information at HLR [Home Location Register] or VLR [Visitor Location Register]; Transfer of mobility data, e.g. between HLR, VLR or external networks
    • H04W8/04Registration at HLR or HSS [Home Subscriber Server]
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W36/00Hand-off or reselection arrangements
    • H04W36/0005Control or signalling for completing the hand-off
    • H04W36/0055Transmission or use of information for re-establishing the radio link
    • H04W36/0069Transmission or use of information for re-establishing the radio link in case of dual connectivity, e.g. decoupled uplink/downlink
    • H04W36/00692Transmission or use of information for re-establishing the radio link in case of dual connectivity, e.g. decoupled uplink/downlink using simultaneous multiple data streams, e.g. cooperative multipoint [CoMP], carrier aggregation [CA] or multiple input multiple output [MIMO]
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W36/00Hand-off or reselection arrangements
    • H04W36/02Buffering or recovering information during reselection ; Modification of the traffic flow during hand-off
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W36/00Hand-off or reselection arrangements
    • H04W36/16Performing reselection for specific purposes
    • H04W36/18Performing reselection for specific purposes for allowing seamless reselection, e.g. soft reselection
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management
    • H04W72/12Wireless traffic scheduling
    • H04W72/1263Mapping of traffic onto schedule, e.g. scheduled allocation or multiplexing of flows
    • H04W72/1268Mapping of traffic onto schedule, e.g. scheduled allocation or multiplexing of flows of uplink data flows
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management
    • H04W72/50Allocation or scheduling criteria for wireless resources
    • H04W72/52Allocation or scheduling criteria for wireless resources based on load
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management
    • H04W72/50Allocation or scheduling criteria for wireless resources
    • H04W72/56Allocation or scheduling criteria for wireless resources based on priority criteria
    • H04W72/566Allocation or scheduling criteria for wireless resources based on priority criteria of the information or information source or recipient

Definitions

  • the present invention relates to a method of and apparatus for scheduling data transmissions in a communication network. More particularly, the present invention relates to a method of and apparatus for scheduling data transmissions on a reverse link in a communication network.
  • CDMA code division multiple access
  • the CDMA system allows for voice and data communications between users over a terrestrial link.
  • the use of CDMA techniques in a multiple access communication system is disclosed in U.S. Patent No. 4,901,307, entitled “SPREAD SPECTRUM MULTIPLE ACCESS COMMUNICATION SYSTEM USING SATELLITE OR TERRESTRIAL REPEATERS", and U.S. Patent No.
  • base station refers to the hardware with which the remote stations communicate.
  • Cell refers to the hardware or the geographic coverage area, depending on the context in which the term is used.
  • communications between users are conducted through one or more cells which are serviced by base stations.
  • a first user on one remote station communicates to a second user on a second remote station, or a standard telephone, by transmitting voice data on the reverse link to a cell.
  • the cell receives the voice data and can route the data to another cell or a public switched telephone network (PSTN). If the second user is on a remote station, the data is transmitted on the forward link of the same cell, or a second cell, to the second remote station. Otherwise, the data is routed through the PSTN to the second user on the standard phone system.
  • PSTN public switched telephone network
  • the forward link and the reverse link are allocated separate frequencies and are independent of one another.
  • the remote station communicates with at least one cell during a communication.
  • CDMA remote stations are capable of communicating with multiple cells simultaneously during soft handoff.
  • Soft handoff is the process of establishing a link with a new cell before breaking the link with the previous cell. Soft handoff minimizes the probability of dropped calls.
  • the method and system for providing a communication with a remote station through more than one cell during the soft handoff process are disclosed in U.S. Patent No. 5,267,261, entitled "MOBILE ASSISTED SOFT HANDOFF IN A CDMA CELLULAR TELEPHONE SYSTEM," assigned to the assignee of the present invention and incorporated by reference herein.
  • Soft handoff impacts various aspects of the CDMA system design because considerations must be given to the status and capacity of each of the multiple cells involved in the soft handoff when a new allocation of resource is made.
  • each remote station is assigned a transmission rate of 28.8Ksps on the reverse link for the duration of the communication with a cell.
  • the data rate of each remote station approaches 9.6Kbps.
  • higher data rates can by supported by the use of other code rates.
  • a data rate of 14.4Kbps is achieved by using a rate 1/2 convolutional encoder.
  • the CDMA system is a spread spectrum communication system. The benefits of spread spectrum communication are well known in the art and can be appreciated by reference to the above cited references. The CDMA system must work within the pre-existing non-contiguous frequency allocation in the cellular band.
  • a CDMA system which conforms to IS-95A standard is allotted a 1.2288MHz bandwidth to fully utilize the cellular band.
  • the reverse link refers to transmission from the remote stations to a cell.
  • the 28.8Ksps transmission rate is spread over the entire 1.2288MHz system bandwidth.
  • each transmitting remote station acts as an interference to other remote stations in the network. Therefore, the reverse link capacity is limited by the total interference which a remote station experiences from other remote stations.
  • the IS-95A CDMA system increases the reverse link capacity by transmitting fewer bits, thereby using less power and reducing interference, when the user is not speaking.
  • the transmit power of each remote station is controlled by two power control loops.
  • the first power control loop adjusts the transmit power of the remote station such that the signal quality, as measured by the energy-per-bit-to- noise-plus-interference ratio, Et,/(N 0 +I 0 ), of the signal received at the cell is maintained at a constant level. This level is referred to as the Et,/(N 0 +I 0 ) set point.
  • the second power control loop adjusts the set point such that the desired level of performance, as measured by the frame-error-rate (FER), is maintained.
  • the power control mechanism for the reverse link is disclosed in detail in U.S. Patent No. 5,056,109, entitled "METHOD AND APPARATUS FOR CONTROLLING TRANSMISSION POWER IN A CDMA CELLULAR MOBILE TELEPHONE SYSTEM", assigned to the assignee of the present invention and incorporated by reference herein
  • variable rate speech vocoder provides speech data at full rate when the user is actively speaking and at low rate during period of silence, e.g. pauses.
  • the variable rate vocoder is described in detail in U.S. Patent No. 5,414,796, entitled “VARIABLE RATE VOCODER,” assigned to the assignee of the present invention and incorporated by reference herein.
  • the reverse link capacity for voice communication between the remote stations and the cell can be determined by the transmission rate of the user on each remote station. This is because other parameters determinative of the reverse link capacity are fixed by the system design or are given. For example, the maximum transmit power available for each remote station is limited by FCC regulations and also by system design constraints. The E b /(N 0 +I 0 ) required to maintain the desired level of performance is dependent on the channel condition which cannot be controlled. Finally, the CDMA system bandwidth of 1.2288MHz is selected by design.
  • the amount of speech activity at any given moment is non- deterministic. Also, there is typically no correlation in the level of speech activities among users. Therefore, the total power received at the cell from all transmitting remote stations varies over time and can be approximated as a Gaussian distribution. During periods of active speech, the remote station transmits at higher power and causes more interference to other remote stations. More interference lowers the received E b /(N 0 +I 0 ) of other remote stations, which increases the probability of frame errors in the voice data received by the cell if the power control is not able to track the dynamics. Therefore, the number of users able to have access to the communication system is limited so that only a small portion of the transmitted frames is lost through excessive interference.
  • Limiting the reverse link capacity to maintain the desired frame error rate (FER) has the effect of forcing the cell to operate at less than full capacity, on the average, thereby under-utilizing the reverse link capacity.
  • FER frame error rate
  • up to half of the reverse link capacity is wasted to maintain a headroom of up to 3dB.
  • the headroom is the difference between the maximum power the cell can receive and the average power the cell actually receives. The headroom is only utilized during the period when the speech activities of the users at the remote stations are high.
  • Data communication within the CDMA system has different characteristics than voice communication.
  • data communication is typically characterized by long period of inactivity, or low activity, punctuated by high bursts of data traffic.
  • An important system requirement for data communication is the transmission delay required to transfer the burst of data. Transmission delay does not have the same impact in data communication as it does for voice communication, but it is an important metric for measuring of the quality of the data communication system.
  • a method for transmitting data traffic in code channel frames of fixed size, wherein the data source provides data at a variable rate is described in detail in U.S. Patent No. 5,504,773, entitled "METHOD AND APPARATUS FOR THE FORMATTING OF DATA FOR TRANSMISSION", assigned to the assignee of the present invention and incorporated by reference herein.
  • Data is partitioned into data frames and each data frame may be further partitioned into data portions.
  • the data portions are then encoded into code channel frames which can be 20 msec wide. At the 28.8Ksps symbol rate, each 20 msec wide code channel frame contains 576 symbols.
  • a rate 1/2 or rate 1/3 convolutional encoder is used to encode the data, depending on the application. Using a rate 1/3 encoder, the data rate is approximately 9.6Kbps.
  • High speed data transmission on the reverse link can be achieved by concurrently transmitting the data traffic over multiple code channels.
  • the use of multiple code channels for data transmission is disclosed in U.S.
  • Patent Application No. 08/656,649 entitled “METHOD AND APPARATUS FOR PROVIDING RATE SCHEDULED DATA IN A SPREAD SPECTRUM COMMUNICATION SYSTEM", filed May 31, 1996, and in U.S. Patent Application No. 08/654,443, entitled “HIGH DATA RATE CDMA WIRELESS COMMUNICATION SYSTEM”, filed May 28, 1996, both assigned to the assignee of the present invention and incorporated by reference herein.
  • the demand for the reverse link continuously changes over time, due to variations in the level of voice activities.
  • the inefficient use of the reverse link can be improved by transmitting data traffic during the period of low voice activity.
  • the data transmission should be dynamically adjusted to match the available reverse link capacity of the cell.
  • a system In dealing with large sporadic bursts of data traffic, a system should be designed with the capability to transmit at high data rates and the ability to allocate the reverse link capacity to the users whenever requested, based on the availability of the capacity.
  • the design should address other existing system considerations. First, since voice communication cannot tolerate extensive delay, priority should be given to transmission of voice data over transmission of any data traffic. Second, since the amount of voice activity at any given moment is unpredictable, the reverse link should be continuously monitored and the data transmission should be dynamically adjusted so that the reverse link capacity is not exceeded. Third, since the remote station may be in soft handoff between multiple cells, the data transmission rate should be assigned based on the reverse link capacity of each of the base stations participating in the soft handoff. These and other considerations are addressed by the present invention.
  • the present invention aims to improve utilization of the reverse link and decreases the transmission delay in data communication in a CDMA system by providing for a means of transmitting data traffic at a high speed transmission rate.
  • each remote station can transmit unscheduled transmissions at rates up to a maximum unscheduled transmission rate over the reverse link.
  • the maximum unscheduled transmission rate is 28.8Ksps.
  • the unscheduled transmissions can be used to send small amounts of data and control messages without the additional delay caused by scheduling.
  • each remote station can be assigned a maximum scheduled transmission rate which can be higher than the maximum unscheduled transmission rate.
  • a channel scheduler determines the maximum scheduled transmission rate for high speed data transmission. The maximum scheduled transmission rate is assigned at each scheduling period according to the availability of the reverse link capacity.
  • the present invention also aims to improve utilization of the reverse link capacity in a CDMA system.
  • the channel scheduler collects information on how much data is to be transmitted, the available reverse link capacity for each cell in the network and other parameters to be discussed below. Based on the collected information and in accordance with a list of system goals and a list of system constraints, the channel scheduler assigns the maximum scheduled transmission rate. The maximum scheduled transmission rate is sent to the remote station. The remote station partitions the data into data frames and transmits the data frames over the reverse link at or below the maximum scheduled transmission rate.
  • the present invention also aims to minimize the transmission delay of data traffic over the reverse link.
  • the maximum scheduled transmission rate is assigned by the channel scheduler based on the amount of data to be transmitted. Small amounts of data are transmitted immediately over the reverse link at or below the maximum unscheduled transmission rate. For larger amounts of data, the channel scheduler assigns a maximum scheduled transmission rate.
  • the present invention further aims to optimize utilization of the reverse link by allocating the available reverse link capacity to users based on a set of priorities.
  • the users within the system are assigned a priority based on a set of factors. These factors include the energy-per-bit required by the user for the requisite level of performance, the list of cells supporting the user, the amount of data to be transmitted, the type of data to be transmitted, the type of data service being provided to the user, the amount of delay already experienced by the user, and other factors.
  • the available capacity is allocated to the highest priority user first and the lowest priority user last.
  • the invention provides a method for scheduling data transmissions on a reverse link in a communication network comprising at least one cell and at least one scheduled user, said method comprising: determining a reverse link capacity available for each of said at least one cell; assigning an assigned transmission rate to each of said at least one scheduled user; and sending said assigned transmission rate to said at least one scheduled user; wherein said assigned transmission rate is based on said reverse link capacity available for each of said at least one cell.
  • the invention provides an apparatus for scheduling data transmission on a reverse link in a communication network comprising at least one cell and at least one scheduled user, said apparatus comprising: controller means for collecting a status information for said communication network and for scheduling data transmissions from said at least one cell to said at least one scheduled user; memory means connected to said controller means for storing said status information; and timing means connected to said controller means for providing timing signals to said controller means, said timing signals enable said controller means to perform scheduling of data transmission.
  • the invention provides a system in which communication is controlled by scheduling selected data for transfer between one or more bases and a plurality of independent remotes each having individual communication requirements, which transfer is scheduled depending on the individual requirements of the remotes and communication resources available in the one or more bases.
  • FIG. 1 is a diagram of a cellular network comprising a plurality of cells, a plurality of base stations and a plurality of remote stations.
  • FIG. 2 is a block diagram illustrating an exemplary implementation of the present invention in a CDMA communication system
  • FIG. 3 is a block diagram of the channel controller
  • FIG.4 is a block diagram of an exemplary encoder within the remote station
  • FIG. 5 is a block diagram of an exemplary modulator at the remote station
  • FIG. 6 is a block diagram of an alternative encoder and modulator structure at the remote station
  • FIG. 7 is a flow diagram of the reverse link rate scheduling embodying the present invention.
  • FIG. 8 is a flow diagram of the data transmission rate assignment embodying the present invention.
  • FIG. 9 is a flow diagram of the data transmission rate re-assignment embodying the present invention.
  • FIG. 10 is a timing diagram showing the transmission rate assignment and the data transmission at the assigned transmission rate; and FIG. 11 is a diagram showing an exemplary utilization of the reverse link rate scheduling embodying the present invention.
  • FIG. 1 represents an exemplary cellular communication network composed of multiple cells 2a - 2g. Each cell 2 is serviced by a corresponding base station 4.
  • the cellular network is a CDMA communication network, although the present invention is applicable to all wireless communication formats.
  • various remote stations 6 are dispersed throughout. Each of remote stations 6 communicate with one or more base stations 4, depending on whether the remote station is in soft handoff. For example, remote stations 6a and 6b communicate exclusively with base station 4c, remote stations 6d and 6e communicate exclusively with base station 4d, but remote station 6c which is located near a cell boundary is in soft handoff and communicates simultaneously with base stations 4c and 4d.
  • the use of soft handoff in a CDMA system is described in detail in the aforementioned U.S. Patent No. 5,267,261.
  • FIG. 2 A block diagram illustrating the basic architecture of a CDMA network embodying the present invention is shown in FIG. 2.
  • Base station controller 10 interfaces with packet network interface 24, PSTN 30, and all base stations 4 in the CDMA network (only one base station 4 is shown in
  • Base station controller 10 coordinates the communication between remote stations 6 in the CDMA network and other users connected to packet network interface 24 and PSTN 30.
  • Base station controller 10 contains many selector elements 14, although only one is shown in FIG. 2 for simplicity.
  • One selector element 14 is assigned to control the communication between one or more base stations 4 and remote station
  • remote station 6 initiates a call by transmitting a request message to base station 4.
  • Base station 4 receives the message and forwards the message to call control processor 16.
  • Call control processor 16 sends a command to selector element 14 to direct base station 4 to assign a forward link traffic channel.
  • Base station 4 uses one channel element 40 to control the call with remote station 6. After assigning the traffic channel, call control processor 40 is informed. Call control processor 40 then commands base station 4 to transmits a channel assignment message to remote station 6 on the forward link.
  • Remote station 6 initiates high speed data transmission on the reverse link by requesting permission from channel scheduler 12.
  • Controller 68 within remote station 6 processes the request by routing the request command to encoder 72.
  • Controller 68 can be implemented in a microcontroller, a microprocessor, a digital signal processing (DSP) chip, or an ASIC programmed to perform the function as described herein.
  • encoder 72 encodes the request command consistent with the Blank and Burst signaling data format described in the aforementioned U.S. Patent No. 5,504,773.
  • Encoder 72 generates and appends a set of cyclic redundancy check (CRC) bits, appends a set of code tail bits, convolutionally encodes the data and appended bits, and reorders the encoded data symbols.
  • CRC cyclic redundancy check
  • the interleaved bits are provided to modulator (MOD) 74.
  • Modulator 74 maps the interleaved bits into another signal space using Walsh code mapping. Specifically, the interleaved bits are grouped into groups of six bits. The six bits are then mapped to a corresponding 64 chips Walsh sequence. Modulator 74 then spreads the Walsh code chips with a long pseudo noise (PN) code and short PN codes.
  • PN pseudo noise
  • the modulated signal is provided to front end 62. Front end 62 filters, amplifies, and transmits the signal over the air, through antenna 60, on reverse link 52.
  • Remote station 6 modulates the reverse link data in accordance with a long PN sequence.
  • each reverse link channel is defined in accordance with the temporal offset of a common long
  • each remote station 6 transmits on one uncorrelated reverse link channel determined in accordance with its unique electronic serial number.
  • the reverse link signal is received by antenna 44 and provided to RF unit 42.
  • RF unit 42 filters, amplifies, downconverts, and quantizes the reverse link signal and provides the digitized baseband signal to channel element 40.
  • Channel element 40 demodulates and decodes the baseband signal, the inverse of the signal processing functions done at remote station 6.
  • Channel element 40 despreads the digitized baseband signal with the short PN codes and the long PN code.
  • Channel element 40 then signal maps the despread data. Specifically, the despread data is grouped into blocks of 64 chips and assigned a Walsh code having a Walsh sequence closest to the block of despread data. The Walsh code comprises the demodulated data.
  • Channel element 40 then reorders the demodulated data, convolutionally decodes the de-interleaved data, and performs the CRC check function.
  • the decoded data e.g. the request command, is provided to selector element 14.
  • Selector element 14 routes the request command to channel scheduler 12.
  • Channel scheduler 12 connects to all selector elements 14 within base station controller 10.
  • Channel scheduler 12 assigns the maximum scheduled transmission rate that can be used by each remote station 6 for high speed data transmission on the reverse link.
  • the maximum scheduled transmission rates for remote stations 6 are provided to selector element 14.
  • Selector element 14 routes the scheduling information to channel element 40 which encodes and modulates the scheduling information.
  • the modulated signal is provided to RF unit 42 which upconverts and conditions the signal.
  • the signal is transmitted by antenna 44 over forward link 50.
  • the forward link signal is received by antenna 60 and routed to front end 62.
  • Front end 62 filters, amplifies, downconverts, and quantizes the received signal and provides the digitized baseband signal to demodulator (DEMOD) 64.
  • the digitized baseband signal is demodulated by demodulator 64 and decoded by decoder 66, the inverse of the signal processing performed by channel element 40.
  • the decoded data which contains the maximum scheduled transmission rate, is routed to controller
  • Controller 68 receives the scheduling information and configures the hardware to begin data transmission at or below the maximum scheduled transmission rate.
  • High speed data transmission occurs in essentially the same manner as that described above for transmission of the request command, with the exception that data transmission can occur at rates up to the maximum scheduled transmission rate.
  • the data is partitioned into data frames.
  • a data frame refers to the amount of data which is transmitted from remote station 6 to base station 4 within one frame time period.
  • the data frame can be further partitioned into smaller units called data portions.
  • the data frames are sent from data source 70 to encoder 72.
  • Encoder 72 formats the data frames, inserts the set of generated CRC bits and a set of code tail bits, convolutionally encodes the data, and reorders the encoded data.
  • a method for encoding and interleaving the data is described in detail in the aforementioned U.S. Patent No. 5,504,773.
  • the encoded data frames are provided to modulator 74 which performs signal mapping using Walsh code.
  • Modulator 74 then spreads the mapped data with a long pseudo noise code and short PN codes and provides the spread data to front end 62.
  • Front end 62 filters, amplifies, upconverts and transmits the signal over the air through antenna 44 on reverse link 52.
  • Base station 4 receives the reverse link signal and demodulates and decodes the reverse link signal in the manner described above.
  • the decoded data is provided by channel element 40 to selector element 14.
  • Selector element 14 provides the data to packet network interface 24 which routes the data to data sink 22.
  • the hardware as described above, supports transmission of both data and voice communication over the CDMA network.
  • channel scheduler 12 and selector element 14 can be included within base stations 4. This distributed processing allows each base station 4 to perform its own scheduling, thereby possibly minimizing the processing delay. Conversely, channel scheduler 12 can be designed to control communication with all base stations 4 in the network. This centralized processing may result in the optimal utilization of system resources.
  • channel scheduler 12 does not have to be incorporated in base station controller 10 as shown in the exemplary embodiment.
  • Other implementations of the above described functions can be contemplated and are within the scope of the present invention.
  • the reverse link transmissions can be classified into two classes.
  • the first class contains unscheduled tasks which, in the preferred embodiment, are not scheduled because of intolerance to additional processing delay.
  • This class includes voice communications and certain types of data communication (e.g. acknowledgment messages for higher layers).
  • the second class encompasses scheduled tasks which can tolerate additional processing and queuing delay.
  • This class includes most data communications between remote stations 6 and base stations 4.
  • channel scheduler 12 coordinates transmissions of the scheduled and unscheduled tasks over the entire CDMA network.
  • the transmission of the scheduled tasks on the reverse link are scheduled by channel scheduler 12, based on the availability of the reverse link capacity, in order to avoid degradation in the transmission of the scheduled and unscheduled tasks.
  • Channel scheduler 12 is tasked with the function of assigning the data transmission rate to each scheduled user on remote station 6 within the CDMA network such that a set of goals is optimized.
  • Controller 92 collects the pertinent information from all base stations 4 in the CDMA network and assigns the data transmission rates. Controller 92 can be implemented in a microcontroller, a microprocessor, a digital signal processing (DSP) chip, or an ASIC programmed to perform the function as described herein. Controller 92 connects to all selector elements 14 within base station controller 10. Controller 92 collects information regarding the demand and capacity for the reverse link. The collected information is stored in memory element 94 and retrieved by controller 92 as needed. Memory element 94 can be implemented using a storage element or one of any number of memory devices, such as RAM memory devices, latches, or other types of memory devices, that are known in the art. Controller 92 also connects to timing element 96.
  • DSP digital signal processing
  • Timing element 96 can be implemented with a counter run by a system clock, an on board oscillator locked to an external signal, or a storage element for receiving system timing from an external source. Timing element 96 provides controller 92 with the timing signals necessary to perform the reverse link rate scheduling. The timing signals also allow controller 92 to send the maximum scheduled transmission rates to selector element 14 at the appropriate interval.
  • the flow diagram of the reverse link rate scheduling methodology embodying the present invention is shown in FIG. 7.
  • the first step in the scheduling process, step 200 involves the collection of all pertinent information necessary for the optimal assignment of the data transmission rates for each scheduled user at remote station 6.
  • the pertinent information may include the number of scheduled and unscheduled tasks, the transmit power available to each remote station 6, the queue size indicating the amount of data to be transmitted by each remote station 6, the Et,/(N 0 +I 0 ) set point and the measured E b /(N 0 +I 0 ) for each remote station 6 at base station 4, the transmission rate for the unscheduled task for each remote station 6 during the prior scheduling periods, the active member set of each remote station 6 listing the cells with which remote station 6 is in communication, the priority of remote stations 6, and the total power received at each cell for the prior scheduling period.
  • channel scheduler 12 assigns a maximum scheduled transmission rate for each scheduled user based on the collected information, the set of aforementioned goals, and the list of system constraints described below at step 202.
  • Channel scheduler 12 sends the scheduling information which contains the maximum scheduled transmission rate to each remote station at step 204.
  • the data is transmitted by remote station 6 at or below the maximum scheduled transmission rate which has been assigned to remote station 6 a predetermined number of frames later.
  • Channel scheduler 12 then waits, at step 206, until the next scheduling period to restart the scheduling cycle.
  • channel scheduler 12 assigns the maximum scheduled transmission rate to each scheduled user. And in the second embodiment, the scheduled user requests a maximum scheduled transmission rate.
  • Channel scheduler 12 assigns the maximum scheduled transmission rate for the scheduled task of each remote station 6 such that the aforementioned goals are achieved.
  • channel scheduler 12 conforms to the following system constraints : (1) remote station 6 transmit power - the power required to transmit at the maximum scheduled transmission rate must be available to remote station 6; (2) cell received power - the total power received by each cell must not exceed a predetermined threshold so that the interference to remote stations 6 is not excessive; (3) soft handoff - the maximum scheduled transmission rate is the same for all cells supporting remote station 6 in soft handoff. (4) remote station 6 queue size - a high transmission rate is only assigned to remote station 6 which has sufficient amount of data to transmit.
  • the transmit power available for each remote station 6 is sent to channel scheduler 12 some amount of time prior to the start of each scheduling period, along with the queue size, and can be considered in the assignment of the maximum scheduled transmission rate. If this information is not available to channel scheduler 12, the rate assignment is performed without consideration of the transmit power of remote station 6.
  • Channel scheduler 12 enters the flow diagram of FIG. 8 after having collected the pertinent information necessary for the optimal assignment of data transmission rates to the scheduled users.
  • Channel scheduler 12 starts at state 210.
  • channel scheduler 12 calculates the total capacity available for each cell in the CDMA network at step 212.
  • the total capacity available for scheduled transmission for each cell is calculated as :
  • P r is the received power at the cell that is not from the same cell scheduled tasks
  • P max is maximum allowable total received power at the cell.
  • the power received at the cell that is not from the same cell scheduled tasks includes the background thermal noise power N 0 W, the power P adj from remote stations 6 in the adjacent cells, and the power
  • the capacity Q ava i l available for scheduled transmission can be defined or calculated by other methods than that shown in equation (1).
  • Q aVa il can ⁇ e influenced by controlling the transmissions of the unscheduled tasks.
  • channel scheduler 12 can increase Q aVa ii by limiting the transmission rates of one or more remote stations 6 to decrease P r .
  • Other methods to define and manipulate Q a a il can be contemplated and are within the scope of the present invention.
  • the predicted set point ⁇ , of the scheduled user for the upcoming scheduling period is assumed to be the same as the set point ⁇ for the prior scheduling period. Therefore, having a prediction of the capacity available for the cells and the set point of a particular remote station 6, channel scheduler 12 is able to determine the maximum transmission rate which can be supported by the cells for this particular remote station 6.
  • Channel scheduler 12 then creates a priority list of all scheduled users at step 214.
  • the priority list is a function of numerous factors, each of which is discussed in detail below.
  • the scheduled users are arranged according to their relative priority, with the scheduled user having the highest priority placed at the top of the list and the scheduled user having the lowest priority placed at the bottom of the list.
  • Channel scheduler 12 then enters a loop and assigns the available reverse link capacity to the scheduled users in accordance with the priority list.
  • channel scheduler 12 selects the scheduled user on the priority list having the highest priority at step 216.
  • Channel scheduler 12 identifies the cells supporting this scheduled user. These cells are listed in the active member set of the scheduled user. If the scheduled user is in soft handoff, each of the cells supporting the user simultaneously receives the data transmitted by the user. Thus, for each cell in the active member set, channel scheduler 12 calculates the maximum supportable transmission rate for the scheduled user at step 218.
  • the maximum supportable transmission rate for each cell can be calculated by multiplying the quantity on the right hand side of equation (2) with W/ ⁇
  • Remote station 6 can also transmit a requested transmission rate to the cell.
  • the requested transmission rate can be based on the queue size which is indicative of the amount of data to be transmitted, the total transmit power available to remote station 6, the predicted transmit energy- per-bit required for the upcoming scheduling period, and the backoff power of remote station 6.
  • the requested transmission rate represents the maximum transmission rate which remote station 6 can support. This value is derived in detail below.
  • Channel scheduler 12 can also recommend a preferred transmission rate based on the amount of data, as measured by the queue size, to be transmitted by the scheduled user at step 222.
  • the preferred transmission rate can also be made a function of the transmit power available to remote station 6, if this information is available to channel scheduler 12.
  • the queue size and the transmit power available to remote station 6 are sent from remote station 6 to channel scheduler 12 at the start of each scheduling period.
  • the preferred transmission rate is selected to be at or below the transmission rate required to transmit the data in the queue within the scheduling interval.
  • channel scheduler 12 selects the minimum transmission rate from the list of maximum supportable transmission rates, the requested transmission rate, and the preferred transmission rate at step 220.
  • the selected minimum transmission rate is defined as the maximum scheduled transmission rate for this scheduled user. Having assigned a transmission rate to this scheduled user, channel scheduler 12 removes the scheduled user from the priority list at step 226.
  • the capacity available for each cell is then updated, at step 228, to reflect the capacity Q j allocated to the scheduled user just removed from the priority list.
  • the capacity is updated by subtracting the capacity just allocated, computed as Qj from the quantity on the right hand side of equation (2) for each cell in the active member set. The updated capacity is used in the subsequent transmission rate assignment.
  • Channel scheduler 12 determines whether all scheduled users on the priority list have been assigned a transmission rate at step 230. If the priority list is not empty, channel scheduler 12 returns to step 216 and assigns a data transmission rate to the scheduled user with the next highest priority. The assignment loop is repeated until the priority list contains no scheduled user. If the priority list is empty, the assignment process terminates at state 232.
  • the allocation of the reverse link capacity can also be accomplished by an allocation of capacity to the scheduled users instead of an assignment of a maximum scheduled transmission rate.
  • channel scheduler 12 allocates a reverse link capacity to the scheduled users.
  • the allocated capacity, Q j is routed to selector element 14 which computes the maximum scheduled transmission rate based on the allocated capacity and the set point of the scheduled user (e.g. R Qi'W/ j).
  • selector element 14 can assign new maximum scheduled transmission rates for the scheduled users at each frame in the scheduling period based on the changes in the set point of the scheduled users. This allows selector element 14 to maintain a quality communication for the scheduled and unscheduled tasks on the reverse link by maintaining the interference at an acceptable level.
  • Other embodiments to allocate the reverse link capacity can be contemplated and are within the scope of the present invention.
  • the capacity available for each cell can also be allocated to the scheduled users without the use of a loop.
  • the available reverse link capacity can be allocated according to a weighting function.
  • the weighting function can be based on the priority of the scheduled users and/or some other factors.
  • the priority list determines the allocation of the reverse link capacity to the scheduled users.
  • a scheduled user having a higher priority is allocated more capacity than one having a lower priority.
  • the available resource can be allocated in any order, and all are within the scope of the present invention.
  • the reverse link rate scheduling of the present invention can be performed continuously, periodically, or in a staggered manner. If the scheduling is performed continuously or periodically, the scheduling interval is selected such that the reverse link capacity of the cells is fully utilized for the duration of the scheduling period. This objective can be accomplished by the following embodiments. Other embodiments which are variations or combinations of the following embodiments can be contemplated and are within the scope of the present invention.
  • the scheduling is performed every frame.
  • This embodiment allows channel scheduler 12 to dynamically adjust the maximum scheduled transmission rate of the scheduled user at each frame to fully utilize the capacity available for each cell in the network. More processing is required to assign the maximum scheduled transmission rate at each frame. Also, more overhead is required to transmit the necessary scheduling information to each scheduled user at each frame.
  • remote stations 6 may be required to provide information to channel scheduler 12 concerning its current transmit power, it maximum transmit power, and its capabilities more frequently.
  • the scheduling is performed every K frames, where K is an integer greater than one.
  • channel scheduler 12 assigns the maximum scheduled transmission rate for each scheduled user.
  • the maximum scheduled transmission rate can be calculated by using a high value for P max in equation (2).
  • the maximum scheduled transmission rate can be calculated by using a lower value for the set point than the set point j for the prior scheduling period.
  • the users who are scheduled are notified.
  • the schedule of the maximum scheduled transmission rates is transmitted to the scheduled users once per scheduling period. Data transmissions at the high speed transmission rates occur a predetermined number of frames later, as discussed below.
  • the maximum scheduled transmission rate for the scheduled tasks is allocated by channel scheduler 12 for the duration of the scheduling period. During a scheduling period, if the capacity of the cells does not support data transmission at the maximum scheduled transmission rates, channel scheduler 12 can direct data transmission at lower transmission rates.
  • each remote station 6 has permission to transmit at a rate up to its maximum scheduled transmission rate. If remote station 6 is not able to transmit at the maximum scheduled transmission rate, remote station 6 may notify the cell of data transmission at a lower transmission rate. Remote station 6 then concurrently, or soon thereafter, transmits data at the lower transmission rate. Likewise, if the reverse link capacity for the cells does not support data transmission at the maximum scheduled transmission rates, channel scheduler 12 directs data transmission at a lower transmission rate.
  • the second embodiment is preferable to the first embodiment for several reasons.
  • a scheduling delay exists from the time the data is made available to remote station 6 to the time of data transmission at the high speed transmission rate.
  • the scheduling delay can be up to seven frames in length.
  • the scheduling delay impacts the responsiveness of channel scheduler 12 to changes in the reverse link capacity and demand.
  • the reverse link is lightly loaded, allowing remote station 6 to transmit at any rate, up to the maximum scheduled transmission rate, reduces the scheduling delay.
  • remote station 6 has no more data to transmit, remote station 6 can immediately reduce the transmission rate and, thus, reduce the reverse link interference to other remote stations 6.
  • the signal processing and the transmit power resources are not as limited at the cell as in remote station 6.
  • the cell can demodulate at the maximum scheduled transmission rates without a major performance penalty.
  • the second embodiment also has the advantage of requiring less overhead to transmit the schedule of the maximum scheduled transmission rates to the scheduled users.
  • the scheduling information is transmitted at each frame to the scheduled users. A portion of the forward link resource is thus allocated to this overhead.
  • the scheduling information is transmitted once per scheduling period to the scheduled users. For example, if the scheduling interval is ten frames, the second embodiment requires slightly more than 1/10 of the overhead of the first embodiment while still maintaining efficient utilization of the reverse link.
  • the transmission rate reassignment can be performed at each frame in the scheduling period to allow channel scheduler 12 to dynamically reassign the transmission rates at each frame.
  • the reverse link rate scheduling can be staggered.
  • the scheduling can be triggered by certain events. For example, channel scheduler 12 can perform the reverse link rate scheduling whenever a request for high speed data transmission is received or whenever a scheduled high speed data transmission by remote station 6 is completed. Channel scheduler 12 has knowledge of the amount of data to be transmitted by each remote station 6 and the maximum scheduled transmission rate.
  • remote station 6 transmits at the maximum scheduled transmission rate except in extenuating circumstances, e.g. lack of available transmit power.
  • channel scheduler 12 is able to determine when the high speed data transmission is completed. Upon termination of a scheduled transmission by remote station 6, channel scheduler 12 can perform the scheduling and allocate the reverse link capacity to other remote stations 6. The schedule of the maximum scheduled transmissions rate is only transmitted to remote stations 6 which has been assigned or reassigned a transmission rate.
  • the reverse link rate scheduling can be performed by channel scheduler 12 for all cells in the CDMA network.
  • This embodiment enables channel scheduler 12 to effectively schedule high speed data transmission for remote stations 6 which are in soft handoff and are in communication with multiple cells. Scheduling for the entire network is more complex because of the various interactions between the cells and remote stations 6.
  • the scheduled tasks can be divided into two categories, specifically, scheduled tasks from remote stations 6 which are in soft handoff and scheduled tasks from remote stations 6 which are not in soft handoff.
  • the reverse link rate scheduling for remote stations 6 which are communication with only one cell can be performed at the cell level.
  • Remote stations 6 which are in communication with multiple cells can be scheduled by channel scheduler 12.
  • the present invention is applicable to all embodiments of the forward link rate scheduling, including centralized scheduling, distributed scheduling, and any combinations thereof.
  • the reverse link capacity can be reallocated during the scheduling period to match the reverse link demand with the available capacity.
  • the scheduling delay may have resulted in sub-optimal capacity allocation.
  • the status of the system may have changed.
  • the initial predictions may not have been accurate and may require modification.
  • the transmission rate can be reassigned during the scheduling period to match the reverse link demand with the available reverse link capacity.
  • data transmission occurs at or below the maximum scheduled transmission rate for the duration of the scheduling period, without the use of the transmission rate reassignment routine. This simplifies the scheduling routine but can result in a lower E b /(N 0 +I 0 ) which can degrade the quality of the communication.
  • the maximum scheduled transmission rates can be reassigned at each frame to maintain a quality communication.
  • channel scheduler 12 directs data transmissions at lower transmission rates. For each frame in which the reverse link capacity for the cells is inadequate to service the demand by the scheduled and unscheduled tasks, channel scheduler 12 determines the amount of increase in the reverse link demand and the available reverse link capacity. Channel scheduler 12 then assigns lower transmission rates for some or all scheduled users such that the capacity required by the users does not exceed the total capacity available for the cells. In the exemplary embodiment, the lower transmission rates are referred to as the temporary transmission rates and are used for only one frame. For subsequent frames in the scheduling period, the maximum scheduled transmission rates are used unless they are modified, again, by channel scheduler 12.
  • Channel scheduler 12 can also attempt to minimize the transmission rate reassignment by increasing the total capacity available for the cells. Increasing the total capacity can be achieved by lowering the transmission rates of the unscheduled users (e.g. limiting the transmission rates of the voice users to lower rates).
  • the transmission rate reassignment is performed every frame to ensure that the capacity required for the scheduled and unscheduled tasks for each cell is less than the total reverse link capacity available for the cells.
  • the schedule of the temporary transmission rates is transmitted to the scheduled users who have been reassigned with temporary transmission rates. For each frame, the scheduled user verifies that the transmission rate has not been reassigned. At each frame within the scheduling period, each scheduled user transmits data at or below the maximum scheduled transmission rate or the temporary transmission rate.
  • Channel scheduler 12 starts at state 240.
  • channel scheduler 12 creates a cell list of cells in the network for which the reverse link capacity required for the scheduled and unscheduled tasks exceeds the total capacity available for the cell.
  • Channel scheduler 12 calculates the total reverse link capacity available for each cell in the CDMA network using equation (2) at step 244.
  • channel scheduler 12 creates the priority list of all scheduled users which are in communication with at least one cell in the cell list and which have been assigned a transmission rate for the current scheduling period at step 246.
  • the scheduled users in the priority list are referred to as the affected scheduled users.
  • Channel scheduler 12 then enters a loop and reassigns the transmission rate of some or all affected scheduled users in accordance with the priority list and the cell list.
  • channel scheduler 12 selects the affected scheduled user having the highest priority at step 248. Channel scheduler 12 then identifies the cells supporting the affected scheduled user for high speed data transmission. These cells are referred to as the selected cells. Next, channel scheduler 12 calculates the maximum supportable transmission rate for the affected scheduled user by each selected cell at step 250. To ensure that the reverse link capacity allocated to this scheduled user can be provided by each selected cell, channel scheduler 12 selects the minimum transmission rate from the list of maximum supportable transmission rates and the maximum scheduled transmission rate at step 252. The selected minimum transmission rate is defined as the temporary transmission rate. In the exemplary embodiment, the temporary transmission rate is lower than the maximum scheduled transmission rate and is only assigned to the scheduled user for the upcoming frame at step 254.
  • the affected scheduled user is removed from the priority list at step 256.
  • the total reverse link capacity available for each selected cell is then updated, at step 258, to reflect the capacity allocated to the affected scheduled user just removed from the priority list.
  • Channel scheduler 12 then updates the cell list and removes the cells for which the total reverse link capacity is zero at step 260.
  • channel scheduler 12 determines whether the cell list is empty at step 262. If the cell list is not empty, channel scheduler 12 determines if the priority list is empty at step 264. If the priority list is not empty, channel scheduler 12 returns to step 248 and reassigns a data transmission rate to the affected scheduled user with the next highest priority. The transmission rate reassignment loop continues until the cell list or the priority list is empty.
  • Channel scheduler 12, selector element 14, or the cell can also temporarily assign lower transmission rates to remote stations 6 if the FER at the cell is high or if the measured total received power Pt o al * s above a predetermined threshold.
  • the temporary transmission rates can be sent to remote stations 6 immediately, without having to wait for the next scheduling period, and data transmissions at the temporary transmission rates can occur immediately or soon thereafter. This reduces the processing delay and allows channel scheduler 12 or the cell to take quick action to improve the quality of the communication on the reverse link.
  • the maximum scheduled transmission rate represents a permission given by channel scheduler 12 to remote station 6 to transmit up to the maximum scheduled transmission rate.
  • Remote station 6 can transmit at lower transmission rates. If remote station 6 determines that its available transmit power does not support data transmission at the maximum scheduled transmission rate, remote station 6 can send a rate reduction message to all cells in communication with remote station 6.
  • the rate reduction message indicates the lower transmission rate which remote station 6 intends to use.
  • remote station 6 transmits at the lower transmission rate at the same frame that the rate reduction message is transmitted, or at a predetermined number of frames thereafter. Allowing remote station 6 to decrease the transmission rate unilaterally, without having to be reassigned by channel scheduler 12, reduces the processing delay and improves the quality of the communications on the reverse link. It is preferable that remote station 6 transmits at the maximum scheduled transmission rate since the reverse link capacity has already been allocated. Data transmission at the lower transmission rate can result in an under-utilization of the reverse link capacity.
  • remote station 6 can request for a rate increase during the scheduling period.
  • the request for higher transmission rate can be transmitted to all cells supporting remote station 6 in soft handoff. If any one of the cells determines that the reverse link capacity for that cell is full, the request for higher transmission rate is denied. Otherwise, the request is routed to channel scheduler 12 which can consider the request during the scheduling period.
  • Each remote station 6 is constrained by the maximum transmit power available to it.
  • the maximum transmit power is determined by FCC regulations, battery capacity, and the interference to other remote stations 6 in the CDMA network.
  • Remote station 6 requires E ⁇ energy-per-bit to transmit data to the cell for the requisite level of performance. For voice communication 1% FER is an acceptable level of performance but the requirement for data communication can be more stringent.
  • the power constraint which should be satisfied by each remote station 6 is :
  • E b j required transmit energy-per-bit by the i-th remote station
  • P maX/ maximum transmit power available to the i-th remote station.
  • the energy-per-bit-to-noise-plus-interference ratio E b /(N 0 +I 0 ), as measured at the cell, for each remote station 6 is controlled such that the requisite level of performance is maintained while minimizing the transmit power of remote station 6.
  • This power control is critical on the reverse link because the transmit power of each remote station 6 is an interference to other remote stations 6 in the CDMA network.
  • each remote station 6 maintains a power control mechanism which dynamically adjusts the transmit power to combat changes in the channel condition.
  • each remote station 6 is allowed a range of 60dB for the reverse link power control and the transmit power can be increased or decreased by ldB per 1.25 msec.
  • Equation (3) can be expressed as :
  • the required energy-per-bit ⁇ j, j can be predicted from the transmit power Pj and the transmission rate Rj for the prior scheduling period as follows :
  • ⁇ (Rj, Rj) is the correction factor to be used if the prior transmission rate Rj and the scheduled transmission rate Rj have different required energy-per-bit.
  • the frame error rate (F ⁇ R) can also be taken into account to predict the required energy-per-bit. Specifically, the predicted energy-per-bit can be increased if the F ⁇ R is high or decreased if the F ⁇ R is low.
  • equation (5) becomes :
  • Pe is the F ⁇ R and. /(Re) j is a function of Pe.
  • ⁇ f(Pe) can be implemented as an equation or a look-up table.
  • is a positive value and increases as Pe decreases.
  • Equation (7) can be calculated at remote station 6 and the maximum transmission rate R max can be used by remote station 6, along with the queue size, to determine the requested transmission rate.
  • remote station 6 can convey the maximum transmit power P maX/ i , the predicted required energy-per-bit , and the queue size to channel scheduler 12 for consideration in assigning a transmission rate to remote station 6.
  • the capacity of the reverse link in a CDMA system is predominantly determined by the interference each remote station 6 causes to other remote stations 6. This is because each remote station 6 spreads the data over the system bandwidth and transmits the signal over the same frequency band.
  • the cell receives the power transmitted by all remote stations 6 and demodulates the signal of each remote station 6.
  • the total power received by the cell from M remote stations 6, for the scheduled and unscheduled tasks, can be expressed as :
  • P r power received by the cell that is not from the same cell scheduled tasks
  • Pj power received from scheduled task of the i-th remote station
  • M number of transmitting scheduled remote stations.
  • N 0 background noise density of the system
  • I 0 interference to the signal received from the i-th remote station by other sources in the system.
  • Each remote station 6 requires different E b /(N 0 +I 0 ) for the requisite level of performance. In fact, a particular remote station 6 can require different Et,/(N 0 +I 0 ) at different times during a communication with the cell.
  • the major factor affecting the required E] ⁇ ,/(N 0 +I 0 ) is the channel condition. For example, the speed at which remote station 6 moves about the CDMA network affects the amount of fading and, therefore, the channel condition. At low speed, the power control mechanism is effective in counteracting the slow fades and the required Ej-,/(N 0 +I 0 ) is low. At high speed, the power control is not effective in counteracting the fast fading and the effect of interleaving is increasingly beneficial.
  • the required Et,/(N 0 +I 0 ) is the highest because neither the power control nor the interleaving is as effective. Other factors can also effect the channel condition and , thus, the required E ]D /(N 0 +I 0 ).
  • the total received power P total * s highly related to the reverse link capacity.
  • the term in the denominator of equation (10) relates to the loading of the system. As 1.0 in equation (10), P total approaches infinity, an operating point which cannot be reached by the system. Higher loading on the reverse link results in higher level of interference. The higher level of interference forces remote station 6 to transmit at higher power to maintain the requisite level of performance. Since the transmit power of each remote station 6 has an upper bound, the upper bound of Ptot a l i s limited to guarantee the coverage for the unscheduled tasks.
  • the operating point P max depends on the system design and is related to the achievable E b j/(N 0 +I 0 ) of remote station 6 located at the cell edge.
  • E b j/(N 0 +I 0 ) is directly related to the FER performance. Operating at higher loading results in worse E], i /(N 0 +I 0 ) for the unscheduled users at the edge of the coverage area and, correspondingly, higher FER.
  • the cell contains two power control loops for each remote station 6 to maintain the requisite level of FER performance while minimizing interference to other remote stations 6.
  • the first power control loop referred to as the inner loop, adjusts the transmit power of remote station 6 such that the signal quality, measured by E b /(N 0 +I 0 ), as received at the cell is maintained at a set point.
  • the cell measures the Et,j/(N 0 +I 0 ) of the received signal and transmits a control signal to remote station 6 commanding remote station 6 to increase the transmit power, by ldB step increment, if the measured Et,/(N 0 +I 0 ) is below the set point.
  • the cell commands remote station 6 to decrease the transmit power if the measured E b /(N 0 +I 0 ) is above the set point.
  • the inner loop adjusts the transmit power of remote station 6 such that the transmit power is minimized while maintaining the measured E f -,/(N 0 +I 0 ) equal to the set point.
  • the second power control loop referred to as the outer loop, adjusts the set point such that the desired level of performance, as measured by the frame-error-rate (FER), is maintained.
  • the cell increases the set point if the measured FER is higher than a predetermined level.
  • the cell decreases the set point if the FER is lower than the predetermined level.
  • the time constant of the outer loop is made slower than that of the inner loop.
  • remote station 6 may utilize an open loop power control system in which it adjusts its transmit power in accordance with changes in the power of the received forward link signals.
  • Channel scheduler 12 assigns the data transmission rate for the scheduled tasks for each remote station 6 while maintaining P total below P max .
  • the set point is a good prediction of the required Et, j /(N 0 +I 0 ) because the outer loop maintains the set point at the setting which produces the desired level of performance.
  • the set point is not a good estimate of the required E bi /(N 0 +I 0 ) in certain extreme circumstances.
  • remote station 6 transmits at the maximum transmit power but the FER is still high. In this case, the power control loop will keep increasing the set point.
  • remote station 6 is in soft handoff with multiple cells and each cell measures a different E b /(N 0 +I 0 ). To minimize interference to other remote stations 6 in the system, remote station 6 decreases the transmit power if any cell commands remote station 6 to decrease power. Therefore, for the cells with weaker reverse links, the measured Efc/(N 0 +I 0 ) is lower than the set point.
  • the current transmission rate and the scheduled transmission rate have different required E ] -,/(N 0 +I 0 ).
  • the FER at the cell is likely to be high.
  • the inner power control loop attempts to increase the transmit power to maintain the measured E D /(N 0 +I 0 ) at the set point. If this fails and excessive FER occurs, channel scheduler 12 recognizes that the channel condition is degraded and can place remote station 6 in the hold state until the channel condition improves.
  • the power P r received by the cell that is not from the same cell scheduled tasks can be predicted by measurements from one or more prior scheduling period by subtracting the power received for the scheduled tasks from the total power received by the cell as follows :
  • Equation (12) indicates that the available reverse link capacity, e.g. the data transmission rate which can be assigned for the upcoming scheduling period, can be determined from the information from prior scheduling periods.
  • the term on the right hand side of equation (12) indicates the reverse link capacity available for the upcoming scheduling period and is based on information from the prior scheduling period.
  • the value of P max can be used to adjust the total reverse link capacity to be scheduled to remote stations 6.
  • P max can be adjusted according to the statistics of Ptotal or the statistics of the FER. For example, if the averaged FER increases or the average of P to t al * s to o high, channel scheduler 12 can reduce P max for the upcoming scheduling period, thereby operating the reverse link at a lower loading to improve the FER.
  • channel scheduler 12 In assigning a maximum scheduled transmission rate to remote station 6 in soft handoff, channel scheduler 12 ensures that each cell participating in the soft handoff satisfies the constraint of equation (2).
  • selector elements 14 sends the active member set of each remote station 6 in the CDMA network to channel scheduler 12.
  • the active member set contains the list of cells in communication with remote station 6.
  • channel scheduler 12 calculates the maximum transmission rate which can be supported by the cell.
  • the maximum supportable transmission rates from all cells on the active member set form a list of possible data transmission rates. Since equation (2) must be satisfied for all cells, the minimum data transmission rate from the list of maximum supportable transmission rates satisfies the constraint of equation (2) for all cells.
  • the maximum transmission rate which can be assigned to a particular remote station 6 is the minimum of the list of maximum supportable transmission rates.
  • the queue size of remote station 6 is taken into consideration in assigning the maximum scheduled transmission rate.
  • the queue size is indicative of the amount of data to be transmitted by remote station 6 as of the time remote station 6 receives the data.
  • the queue size of all scheduled tasks are sent to channel scheduler 12.
  • Channel scheduler 12 assigns a high speed transmission rate in accordance with the queue size. For example, channel scheduler 12 can assign a high speed transmission rate only if the queue size is above a predetermined threshold. Alternately or additionally, channel scheduler 12 can assign a high speed transmission rate if the rate of change in the queue size is above another predetermined threshold. Furthermore, channel scheduler 12 can assign a high speed transmission rate if the queue size of remote station 6 approaches the maximum queue size. In this regard, channel scheduler 12 can assist remote stations 6 which are nearing its storage capacity limit.
  • channel scheduler 12 assigns the minimum transmission rate such that the data in the queue can be transmitted during the K frame scheduling period. If the queue size is small, channel scheduler 12 ignores the task since the small amount of data can be transmitted within the maximum unscheduled transmission rate which is assigned to each remote station 6 in communication with a cell.
  • a scheduling delay exists from the time the data is made available to remote station 6 to the time of actual data transmission at the high speed transmission rate. The scheduling delay is due to the processing delays, which, in the exemplary embodiment, can be seven frames in duration.
  • the queue size is transmitted to channel scheduler 12 at the start of each scheduling period. Channel scheduler 12 adjusts the queue size to take into account any predictable changes to the queue size during the scheduling delay. Specifically, the data which is to be transmitted to the cell during the scheduling delay and new data which is known to arrive during the scheduling delay are considered in adjusting the queue size. Furthermore, data which is to be retransmitted is also taken into account in the queue size prediction.
  • the amount of data transmitted during the scheduling delay can be predicted by summing the maximum scheduled transmission rate which is assigned to remote station 6 for each frame in the scheduling delay. This is a moderately accurate adjustment to the queue size since, in most cases, remote station 6 transmits at the maximum scheduled transmission rate. If remote station 6 transmits at a lower transmission rate, e.g. maybe due to inadequate transmit power, the actual queue size is larger than the adjusted queue size. Transmission of the additional data in the queue can be scheduled at the subsequent scheduling period.
  • remote station 6 measures the queue size of the data to be transmitted.
  • remote station 6 sends the queue size to channel scheduler 12. Because of scheduling delay, channel scheduler 12 knows that data transmission at the high speed transmission rate does not occur until frame k+7. Channel scheduler 12 also knows that some of the data in the queue is transmitted during the scheduling delay, the time between frame k+1 and frame k+6. Data transmission during the scheduling delay is at or below the maximum scheduled transmission rate assigned to frames k+1 through k+6. Therefore, channel scheduler 12 adjusts the queue size as it appears at frame k+7, by subtracting the amount of data to be transmitted during frame k+1 through frame k+6. Data which channel scheduler 12 knows will arrive between frame k+1 and k+6 at remote station 6 is added to the calculated queue size.
  • the reverse link rate scheduling method and apparatus of the present invention can be applied to any communication system capable of variable rate data transmission.
  • the present invention is applicable to a CDMA system, a GLOBALSTAR system, a time division multiple access (TDMA) system, or a frequency division multiple access (FDMA) system.
  • TDMA time division multiple access
  • FDMA frequency division multiple access
  • the applications of the present invention to a CDMA system or other variable rate communication systems, using the concept of a single variable rate channel, or multiple channels having a fixed rate, or a combination of variable and fixed rate channels, are within the scope of the present invention.
  • high speed data transmission occurs over a single variable rate channel.
  • remote station 6 is assigned the maximum unscheduled transmission rate of 1 (or 9.6Kbps) on the variable rate channel. Therefore, remote station 6 can transmit unscheduled transmissions at any rate up to 1, including rate 1/8, 1/4, 1/2 and 1. Remote station 6 is not allowed to transmit at higher transmission rates unless permitted by channel scheduler 12.
  • the variable rate channel as used in this manner is also referred to as a traffic channel in this specification.
  • remote station 6 can be assigned a maximum scheduled transmission rate greater than 1. Remote station 6 can then transmit at higher rates, up to the maximum scheduled transmission rate, for high speed data transmission.
  • high speed data transmission occurs over multiple channels, herein after referred to as traffic channel and secondary code channel.
  • the traffic channel is assigned to each remote station 6 during the call set up with a cell and allows unscheduled transmission up to a maximum unscheduled transmission rate of 1.
  • the secondary code channels can be fixed or variable rate channels. The concept and implementation of secondary code channels for use in high speed data transmission are described in detail in U.S. Patent Application No. 08/798,951, entitled "METHOD AND APPARATUS FOR FORWARD LINK
  • channel scheduler 12 equates the maximum scheduled transmission rate to a set of secondary code channels.
  • Remote station 6 is directed to transmit data over the assigned secondary code channels.
  • the identity of the assigned secondary code channels is transmitted to remote station 6 in one of three embodiments. In the first embodiment, the identity of each secondary code channel is transmitted to remote station 6 at each scheduling period. This requires more overhead but allows the most flexibility.
  • the secondary code channels are grouped into channel sets, with each channel set defined by a unique grouping of secondary code channels.
  • the definition of the channel sets is transmitted to remote station 6 during the call set up stage of a communication with a cell or during the call set up stage of a soft handoff.
  • Channel scheduler 12 assigns the maximum scheduled transmission rate and selects a channel set corresponding to the maximum scheduled transmission rate.
  • the identity of the channel set is transmitted to remote station 6. This embodiment requires less overhead than the first embodiment since only the identity of the channel set, and not the identity of each secondary code channel, is transmitted to remote station 6.
  • the third embodiment is a subset of the second embodiment.
  • Each channel set is defined by a Walsh code and the member of channel set N is composed of secondary code channels 1 through N.
  • the assigned transmission rate is equated to a Walsh code and the Walsh code is transmitted to remote station 6.
  • Higher transmission rate is equated with more secondary code channels and a higher Walsh code.
  • Remote station 6 transmits data over all secondary code channels associated with the Walsh code.
  • Walsh code 5 is equated with secondary code channels 1 through 5.
  • An assignment of Walsh code 5 indicates that remote station 6 can transmit data over secondary code channels 1 through 5. If remote station 6 decides to transmit at a lower transmission rate, e.g. using three secondary code channels, remote station 6 transmits Walsh code 3 to the cell indicating the intention to transmit over secondary code channels 1 through 3.
  • Data source 70 contains the large amount of information which is to be transmitted to the cell.
  • the data is provided to a bank of BPSK and QPSK channel encoders 104 and 106 through DEMUX 102.
  • DEMUX 102 demultiplexes the data from data source 70 to the selected BPSK or QPSK channel encoders 104 and 106.
  • BPSK and QPSK channel encoders 104 and 106 encode and reorder the data and provide the encoded data to modulator 74.
  • the type of channel encoder to be selected, BPSK or QPSK, is dependent on the system design.
  • Encoder 72 can be configured with a bank of BPSK channel encoders 104, a bank of QPSK channel encoders 106, or a combination of BPSK and QPSK channel encoders 104 and 106.
  • BPSK channel encoder 104 the data from data source 70 is partitioned into data frames and provided to CRC generator 110.
  • CRC generator 110 generates the CRC bits for the data frames, inserts the code tail bits, and provides the CRC encoded data to convolutional encoder 112.
  • Convolutional encoder 112 convolutionally encodes the CRC encoded data.
  • Block interleaver 114 receives the encoded bits and reorders the bits to provide time diversity. The time diversity spreads the burst errors received by the cell and improves the performance of the Viterbi decoding at the cell.
  • Variable starting point repeater 116 receives the interleaved data and repeats each bit N ⁇ number of times to provide a constant output symbol rate of 307.2Ksps. In accordance with the IS-95A standard, each code channel frame is 20msec long and corresponds to 6,144 symbols at the 307.2Ksps symbol rate.
  • variable starting point repeater 116 uses a different starting point to begin the repetition for each data frame.
  • the resulting repeated symbols are provided to BPSK mapper 118 which generates a +1 or -1 value for each repeated symbol.
  • QPSK channel encoder 106 functions in the almost same manner as BPSK channel encoder 104.
  • the data from data source 70 is partitioned into data frames, routed through DEMUX 102, and provided to CRC generator 130.
  • CRC generator 130 block encodes the data frames and provides the CRC encoded data to convolutional encoder 132.
  • Block interleaver 134 receives the encoded bits, reorders the bits, and provides the interleaved data to variable starting point repeater 136.
  • Variable starting point repeater 136 repeats each bit NQ number of time to obtain a fixed output symbol rate of 614.4Ksps. The repeated symbols are provided to
  • QPSK mapper which groups the repeated symbols by two and generates one of four possible state for the in-phase (QPSKT) and quadrature (QPSKQ) outputs.
  • QPSKT in-phase
  • QPSKQ quadrature
  • the symbol rate at the QPSKT and QPSKQ outputs is 307.2Ksps.
  • data from data source 70 is provided directly to one CRC generator 110 which generates the CRC bits for the data frames being transmitted.
  • the CRC encoded data is provided to one convolutional encoder 112 which convolutionally encodes the CRC encoded data.
  • the encoded bits are provided to one block interleaver 114 which reorders the code bits to provide time diversity.
  • the interleaved data is provided to a bank of variable starting point repeaters 116 and 136, one for each BPSK and QPSK channel encoder 104 and 106, through DEMUX 102. Combining the CRC block encoding, the convolutional encoding, and the block interleaving for all BPSK and QPSK channel encoders with a set of one CRC generator, one convolutional encoder, and one block interleaver minimizes the hardware requirement.
  • the exemplary block diagram of modulator 74 within remote station 6 for the first embodiment is shown in FIG. 5.
  • the BPSK, QPSK j and QPSKQ outputs from encoder 72 are provided to modulator 74.
  • Each BPSK output is provided to a unique BPSK Walsh modulator 146.
  • the BPSK encoded data is modulated by a unique Walsh code by multiplier 150 and amplified by a unique gain by gain adjust 160.
  • BPSKj output is modulated by Walsh code Wi and amplified by gain Bj.
  • each QPSKj and QPSKQ output pair is provided to a unique QPSK Walsh modulator 148.
  • the QPSK encoded data is modulated by a unique Walsh code by multipliers 152-156 and amplified by a unique gain by gain adjust 162-166.
  • QPSKJ and QPSKQJ output pair is modulated by Walsh code W ⁇ +1 and amplified by gain Qj.
  • Gain adjust 158 receives the PILOT signal, which in the exemplary embodiment is comprised of the logic level associated with a positive logic voltage, and adjusts the amplitude according to gain P.
  • the PILOT signal contains no data but provides a reference carrier signal which RF unit 42 within base station 4 can use to coherently demodulate the data on the remaining BPSK and QPSK channels.
  • the Walsh code modulated and gain adjusted QPSK signals are summed together by summer 168a.
  • the Walsh code modulated and gain adjusted QPSKQ signals are summed together by summer 168b to form the signal XQ.
  • the Walsh code modulated and gain adjusted BPSK signals, the gain adjusted PILOT signal, and summer 168a output are summed together by summer 170 to form the signal X .
  • the subsequent signal processing functions to further spread the signals Xj and XQ, with the long PN code and the short PNj and PNQ codes, and distributes the PN modulated signals evenly over both in-phase (I) and quadrature (Q) components of the QPSK modulated signal.
  • the long PN code is modulated with the short PNj code by multiplier 172a to produce the signal LPNj.
  • the long PN code is also modulated with the short PNQ code by multiplier 172b to produce the signal LPNQ.
  • Multipliers 174 and summers 176 perform a complex multiply of the signals Xj and XQ and the LPNj and LPNQ codes. Using j to represent the imaginary part of a complex number and multiply the two complex terms above, the following equation can be obtained :
  • the signal X is first modulated with LPN j by multiplier 174a to produce the product term XJ LPNJ, and with LPNQ by multiplier 174d to produce the product term XJ»LPNQ.
  • the signal XQ is modulated with LPNj by multiplier 174b to produce the product term XQ'LPNJ, and with LPNQ by multiplier 174c to produce the product term XQ*LPNQ.
  • the signals Yj and YQ are filtered (not shown in FIG. 5) and modulated with an in-phase sinusoidal COS(Wct) and a quadrature sinusoidal SIN(Wct) by mixers 178a and 178b, respectively.
  • the I component from mixer 178a and the Q component from mixers 178b are combined by summer 180 and the resultant QPSK modulator output is provided to front end 62.
  • Modulator 74 evenly distributes the data from BPSK and QPSK channel encoders 104 and 106 over both I and Q components of the QPSK modulator output.
  • X j contains the QPSK data and XQ contains the QPSKQ data.
  • the QPSKj data is spread with different short PN codes and distributed evenly between the I and Q components.
  • the QPSKQ data is spread with different short PN codes and distributed evenly between the I and Q components.
  • the minus sign in the equation for Y results from the complex multiply operation.
  • the number of BPSK or QPSK channel encoder is selected by system design.
  • one BPSK Walsh modulator 146 is assigned to each BPSK channel encoder 104 and one QPSK Walsh modulator 148 is assigned to each QPSK channel encoder 106.
  • Each pair of BPSK channel encoder 104 and BPSK Walsh modulator 146 is collectively referred to as a secondary code channel throughout the specification.
  • each pair of QPSK channel encoder 106 and QPSK Walsh modulator 148 is collectively referred to as a secondary code channel.
  • the data transmission rate over the BPSK and QPSK channels can be made variable, by changing the repetition value Nj and NQ.
  • the inclusion of a pilot tone allows the cell to use partial coherent demodulation to improve the FER performance.
  • the pilot tone allows the reverse link to operate at a lower E D j/(N 0 +I 0 ) for the same FER performance. Also, when the data transmission rate is high, the percentage of the transmit power utilized by the pilot tone is small.
  • the disadvantage of the first embodiment is that the QPSK modulator output does not conform to the IS-95A standard for the modulated signal on the reverse link. Therefore, the modulated signal generated in accordance to the first embodiment is not backward compatible with the CDMA systems that conform to IS-95A standard.
  • the exemplary block diagram of encoder 72 and modulator 74 of the second embodiment is shown in FIG. 6.
  • the secondary code channels are created by the use of Walsh code spreading to provide orthogonality between the secondary code channels.
  • the orthogonality improves signal detection at the cell by providing a correlated signal on the secondary code channel being demodulated and spreading the signals of other secondary code channels.
  • the Walsh code spread signal is then signal mapped, in accordance with the IS-95A standard, to improve the signal detection.
  • the mapped signal is spread by short PN codes to provide quadrature spreading, again to improve signal detection at the cell.
  • data from data source 70 is provided to CRC generator 140 which generates the CRC bits for the data frames being transmitted and inserts the code tail bits.
  • the CRC encoded data is provided to convolutional encoder 142 which convolutionally encodes the CRC encoded data.
  • the encoded bits are provided to block interleaver 144 which reorders the encoded bits to provide time diversity.
  • the interleaved data is provided to modulator 74.
  • the encoded data is routed through DEMUX 146 and provided to a bank of Walsh code modulators 182.
  • Walsh code modulators 182 spreads the encoded data with unique Walsh codes to provide orthogonality between the code channels.
  • the Walsh code modulated data is provided to ortho-modulator 184.
  • Ortho-modulator 184 maps the input signal into another signal space using Walsh code mapping.
  • the input bit sequence is grouped into groupings of 6-bits. Each 6-bit grouping selects a unique 64-chip Walsh sequence.
  • the mapped signal from ortho-modulator 184a is provided to data burst randomizer 186.
  • Data burst randomizer 186 turns off the transmitter within front end 62 when remote station 6 is transmitting at less than full rate to reduce the transmit power.
  • Walsh code WQ is defined as the all zeros sequence (0, 0, ...0).
  • Walsh code modulator 182a does not perform any function. Therefore, the first Walsh code channel WQ, comprising Walsh code modulator 182a, ortho-modulator 184a, and data burst randomizer 186, conforms to the signal processing defined by the IS-95A standard for the reverse link.
  • the secondary Walsh code channels Wj-Wjv comprising Walsh code modulator
  • the outputs from the first Walsh code channel and secondary Walsh code channels are combined by summer 188 and the resultant signal is modulated with the long PN code by multiplier 190.
  • the long PN code modulated signal is further spread by the short PN and PNQ codes by multipliers 192a and 192b, respectively.
  • the PNJ modulated signal is mixed with the in-phase sinusoidal COS(Wct) by mixer 196a.
  • the PNj modulated signal is delayed for half a chip, through delay 194, and mixed with the quadrature sinusoidal SIN(Wct) by mixer 196b.
  • the I component from mixer 196a and the and Q component from mixer 196b are combined by summer 198 and the resultant OQPSK modulator output is provided to front end 62.
  • This embodiment has the advantage of providing a modulated signal which is backward compatible with the modulated signal for the reverse link in accordance with the IS-95A standard.
  • Each secondary Walsh code channel W j -W ⁇ is referred to as a secondary code channel in this specification.
  • the CRC bits are appended to each data frame to allow detection of frame error by the cell.
  • twelve CRC bits are appended.
  • the number of CRC bits can be increase or decrease, depending on the required detection certainty. More CRC bits allows detection of frame error with greater certainty but requires more overhead. Conversely, less CRC bits decreases the certainty of frame error detection but requires less overhead.
  • high speed transmission rate can occur over one variable rate channel or multiple secondary code channels.
  • the data frame can be further partitioned into data portions, with each data portion being encoded into a code channel frame and transmitted over one secondary code channel.
  • CRC bits generation is applied to the embodiment using secondary code channels, although the concept can be extended to other hardware embodiments.
  • each secondary code channel transmits at the maximum unscheduled transmission rate.
  • the secondary code channel and the traffic channel are each referred to as a code channel.
  • the CRC bits for the multiple code channels can be generated by at least two embodiments. In the first embodiment, each data portion is appended with its own set of CRC bits, similar to the IS-95A standard. This embodiment requires more overhead but allows detection of frame error on each code channel frame. Only the code channel frame received in error is retransmitted.
  • the data frame which is to be transmitted over the code channels assigned to remote station 6 within one frame is encoded by one CRC generator.
  • the generated CRC bits can be transmitted in one of several modes.
  • the data frame is partitioned into data portions as described above.
  • the CRC bits are also partitioned and appended to each data portion.
  • each code channel frame contains a data portion and some CRC bits.
  • the CRC bits are transmitted over one code channel frame. All code channel frames, except the last code channel frame, contain only the data portion.
  • the last code channel frame contains the CRC bits and some possibly data.
  • the second mode provides time diversity of the CRC bits and improves frame error detection by the cell. At the cell, the code channel frames are reassembled to the data frame.
  • the cell is only able to determine whether all code channel frames are received correctly or whether one or more code channel frame error has occurred.
  • the cell is not able to determine which ones of the code channel frames are received in error. Therefore, a data frame error dictates that all code channel frames for that data frame need to be retransmitted by the cell.
  • the second embodiment has the advantage of using a smaller number of CRC bits for the data frame.
  • each of the twelve data portions is appended with its own set of twelve CRC bits.
  • a total of 144 CRC bits is required for the twelve code channel frames.
  • These 144 CRC bits allow detection of frame error on each individual code channel frame. Therefore, if the code channel frame on a particular code channel is received in error, only the error frame needs to be retransmitted.
  • the entire data frame is encoded with one set of CRC bits.
  • the number of CRC bits used is less than the total number of CRC bits used in the first embodiment. In the example shown above, for twelve code channel frames, the number of CRC bits used is at least 12 but less than 144.
  • the 24 CRC bits can be partitioned into twelve CRC blocks, with each CRC block containing two CRC bits. One CRC block is appended to each of the twelve data portions. Alternately, the 24 CRC bits can be transmitted over one code channel frame. At the cell, the data portions and the 24 CRC bits are reassembled. The cell is only able to determine whether all twelve code channel frames are received correctly. If a frame error is indicated, the cell is not able to determine which ones of the code channel frames are received in error. Therefore, all twelve code channel frames must be retransmitted by remote station 6. For a saving of 120 CRC bits in overhead, the cell is still able to detect frame error, but without the precision of the first embodiment. The second embodiment requires a tradeoff between less overhead and redundant retransmission of code channel frames.
  • the accuracy of the prediction of the available reverse link capacity for the unscheduled tasks is improved by making the prediction at a moment as close as possible to the time at which the estimate will be used.
  • the status of the network may have changed. For example, other remote stations 6 may have started or stopped transmitting, remote stations 6 may have been added or dropped from the network, or the channel conditions may have changed.
  • the processing delay is seven frames or less.
  • Channel scheduler 12 can make predictions at a short time intervals, e.g.
  • the predictions are made every K frames, the maximum scheduled transmission rates are assigned every K frames or reassigned every frame, and the schedule of the maximum scheduled transmission rates is transmitted to remote stations 6 every K frames.
  • FIG. 10 An exemplary illustration of the timing diagram of the reverse link rate scheduling is shown in FIG. 10.
  • remote station 6 has a large amount of data to transmit to the cell.
  • Remote station 6 measures the queue size of the data and the total transmit power available to remote station 6 at block 300.
  • remote station 6 transmit the information to the cell at block 302.
  • base station 4 serving the cell receives the information and routes the information to selector element 14 at block 304.
  • the status of the entire CDMA network is measured by- selector elements 14 and sent to channel scheduler 12 at block 306.
  • the status of the CDMA network includes the reverse link capacity available for scheduled tasks at each cell, the amount of data to be transmitted by each scheduled user, the total transmit power available to each remote station 6, the active member set of each remote station 6, and the priority of remote stations 6.
  • channel scheduler 12 assigns the maximum scheduled transmission rates and sends the scheduling information to selector element 14 at block 308.
  • the maximum scheduled transmission rates are to be utilized at frame k+7.
  • selector element 14 sends the data frames which is to be transmitted at frame k+5 on the forward link to channel element 40 at block 310.
  • Channel element 40 receives the data frames from selector element 14 within frame k+4 at block 312.
  • channel element 40 transmits the scheduling information containing the maximum scheduled transmission rate for frame k+7 to remote station 6 on the forward link at block 314.
  • remote station 6 processes the forward link signal, determines the maximum scheduled transmission rate, and reconfigures the hardware, if necessary, for data transmission at the high speed transmission rate at block 316.
  • the data is transmitted at or below the maximum scheduled transmission rate over the reverse link to base station 4 at block 318.
  • the processing delay between the time remote station 6 determines it has a large amount of data to transmit to base station 4 to the time of data transmission at the high speed transmission rate is seven frames.
  • remote station 6 measures the queue size and the total transmit power available to it.
  • remote station 6 transmit the data at the high speed transmission rate to base station 4.
  • each frame of delay represents a 20 msec delay.
  • the seven frames of processing delay represents 140 msec of delay. This period of delay is short enough so that other communications on the reverse link is not significantly degraded.
  • the initial prediction of the required reverse link capacity for the unscheduled tasks is not overly critical in the present invention because of the ability of channel scheduler 12 to continuously monitor the reverse link usage and dynamically reassigns the transmission rate of the scheduled tasks.
  • the processing delays represented by blocks 304, 306, 308, 310, and 312 can be shortened to one or two frames, instead of the three frames shown in FIG. 10, by optimizing the hardware to minimize processing delay.
  • the scheduling information containing the maximum scheduled transmission rates can be transmitted to remote stations 6 in one of a number of embodiments. In the first embodiment, certain bits in the code channel frame on the forward link is reserved for the scheduling information. In the second embodiment, the scheduling information is transmitted by the use of separate signaling messages. The signaling message can be transmitted to remote station 6 whenever there is a new assignment of a data transmission rate. Other embodiments to transmit the scheduling information using variations or combination of the above described embodiments can be contemplated and are within the scope of the present invention.
  • FIG. 11 An exemplary diagram of the reverse link rate scheduling and high speed data transmission is shown in FIG. 11.
  • remote station 6 is assigned a maximum unscheduled transmission rate (rate 1) for the duration of the communication with the cell.
  • rate 1 the maximum unscheduled transmission rate
  • remote station 6 transmits at rate 1/8 when idle and at rate 1 when transmitting data.
  • the backlog of the data to be transmitted to the cell is represented by the solid line and given in terms of the number of code channel frames.
  • the number of code channel frames equals to the maximum unscheduled transmission rate times the number of frames necessary to send the data. For example, 20 code channel frames can be transmitted by rate 1 over 20 frames or by a rate 4 over five frames.
  • remote station 6 is assigned a maximum unscheduled transmission rate (rate 1) but remote station 6 has no data to transmit to the cell at frames 1 and 2. Therefore, remote station 6 transmits at rate 1/8 over the reverse link.
  • rate 1 the maximum unscheduled transmission rate
  • remote station 6 receives two code channel frames for transmission to the cell.
  • Remote station 6 transmits one code channel frame at frames 3 and 4, at rate 1, to bring the backlog to zero at the end of frame 3.
  • remote station 6 can transmit data up to rate 1 over the reverse link without scheduling.
  • the data received during frame 2 is transmitted immediately at frame 3. Immediate transmission at or below rate 1 allows the signaling from the remote station 6 to the cell to get through quickly.
  • the TCP acknowledgment requires approximately 40 bytes and, with header compression, can be fitted into one data frame.
  • the TCP acknowledgment can be transmitted immediately over the reverse link within one frame.
  • remote station 6 transmits at rate 1/8 while idle and waiting for data.
  • remote station 6 receives a large amount of data to transmit to the cell.
  • remote station 6 transmit to the cell the queue size and the total transmit power available to remote station 6.
  • channel scheduler 12 receives the information from selector element 14 and collects other information pertaining to the status of the network (e.g. the reverse link capacity available for each cell in the network).
  • channel scheduler 12 assigns the maximum scheduled transmission rates and conveys the schedule to the cell. In this example, channel scheduler 12 assigns a maximum scheduled transmission rate four times the rate of the maximum unscheduled transmission rate (rate 4).
  • the cell transmits the scheduling information to remote station 6 over the forward link.
  • remote station 6 continues to transmit data at rate 1 and brings the backlog down to 26 code channel frames.
  • remote station 6 receives the scheduling information and configures its hardware to transmit data at the high speed transmission rate.
  • the high speed data transmission occurs at the maximum scheduled transmission rate (rate 4) at frames 14 through 19.
  • remote station 6 realizes that the queue is nearly empty and that a transmission rate of 2 is needed to transmit the remaining data at frame 20.
  • remote station 6 transmits the rate reduction message to the cell indicating the intention to transmit at the lower transmission rate. Also at frame 20, remote station 6 transmits the two remaining code channel frames at the lower transmission rate.
  • remote station 6 request termination of transmission at the maximum scheduled transmission rate (rate 4). At frame 21, having transmitted all the data, remote station 6 transmits at rate 1/8 at frame 21 while idle and waiting for more data.
  • the above example shows that there is seven frames of processing delay between the time the data is made available to remote station 6 (at frame 7 in FIG. 11) and the time of data transmission at the high speed transmission rate (at frame 14 in FIG. 11).
  • the example also illustrates that the transmission rate can be reduced by remote station 6 at each frame such that the reverse link is fully utilized at each frame.
  • the maximum scheduled transmission rates for the scheduled tasks are assigned to remote stations 6 in accordance with the priority of remote stations 6.
  • the reverse link capacity is assigned first to remote station 6 having the highest priority and last to remote station 6 having the lowest priority. Numerous factors can be used to determine the priority of remote station 6. The following discussion details an exemplary list of some of the factors which can be considered in assigning priority. Other factors can also be considered and are within the scope of the present invention.
  • the reverse link capacity which supports data transmission at 38.4Kbps by the first remote station 6 only supports data transmission at 9.6Kbps by the second remote station 6 (1/4 the symbol rate) if the required E D /(N 0 +I 0 ) of the second remote station 6 is approximately
  • Remote station 6 can be in soft handoff with multiple cells. Remote station 6 in soft handoff consumes more capacity because multiple cells support remote station 6 simultaneously. Therefore, higher throughput on the reverse link is obtained by assigning a low priority to remote station 6 which is in soft handoff. Also, remote station 6 in soft handoff is typically located near the edge of the cell and requires more transmit power for the same energy-per-bit at the cell. Channel scheduler 12 can also consider the transmit energy-per-bit required by remote station 6 to transmit to the cell. The transmit power of remote station 6 is typically limited and the reverse link rate scheduling can attempt to conserve the battery power to prolong the operating life of remote station 6.
  • the optimal assignment of the maximum scheduled transmission rate is also dependent on the amount of data to be transmitted by remote station 6.
  • the data to be transmitted is stored in a queue located within remote station 6.
  • the size of the queue is indicative of the amount of data to be transmitted.
  • the queue size of all scheduled tasks is sent to channel scheduler 12. If the queue size of a scheduled task is small, channel scheduler 12 removes the task from the rate scheduling routine. Transmission of a small amount of data can be completed within a satisfactory time period over the reverse link at or below the maximum unscheduled transmission rate. Channel scheduler 12 only assigns the high speed transmission rate, when necessary, for transmission of large amounts of data.
  • the maximum scheduled transmission rate assigned to each remote station 6 can be approximately proportional to the queue size of the data to be transmitted.
  • the type of data to be transmitted is another important consideration in assigning priority among remote stations 6. Some data types are time sensitive and require quick attention. Other data types can tolerate longer delay in transmission. Obviously, higher priority is assigned to data that is time critical. As an example, inevitably, some of the transmitted data are received in error by the cell. The cell is able to determine a frame error by the use of the CRC bits appended to the code channel frames. Upon determination that a code channel frame has been received in error, the error indicator bit for that code channel frame is flagged and the cell informs remote station 6 of the frame error. Channel scheduler 12 then schedules the retransmission of the code channel frames received in error or remote station 6 can retransmit and inform the cell. At the cell, other signal processing may be dependent on the code channel frames received in error. Therefore, channel scheduler 12 or remote station 6 can place a higher priority on data being retransmitted than data being transmitted for the first time.
  • remote station 6 can be temporarily placed in the hold state or assigned a lower transmission rate. In the hold state, data transmission at the high speed transmission rate can be suspended until the reverse link condition improves. Remote station 6 can still transmit data at or below the maximum unscheduled transmission rate and the cell can continue to monitor the performance of the reverse link.
  • channel scheduler Upon receiving indications that the reverse link condition has improved, channel scheduler
  • a pricing structure can be established for different data transmission services. Higher priority is given to those services for which a premium price is charged. Through the pricing structure, the user on each remote station 6 can determine, individually, the priority and, therefore, the type of service the user can enjoy.
  • the priority of remote station 6 can also be made a function of the amount of delay already experienced by remote station 6.
  • the available reverse link capacity is assigned first to remote station 6 having the highest priority. Consequently, remote station 6 having a low priority typically experiences longer transmission delay.
  • the priority of remote station 6 can be upgraded. This prevents the data to be transmitted by the low priority remote station 6 from remaining in the queue state indefinitely. Without the priority upgrade, the low priority remote station 6 can suffer an intolerable amount of delay.
  • the priority upgrade can be incremented in a manner such that a high quality communication of the scheduled and unscheduled tasks is achieved, while the system goals are maintained.
  • the factors are given different weights, depending on the set of system goals being optimized. As an example, to optimize the throughput on the reverse link, greater weight is given to the ' & D /( N 0 +I 0 ) required by remote station 6 and whether remote station 6 is in soft handoff. This weighting scheme does not take into account data types and the priority of remote stations 6, thereby not addressing the system goal of fairness.
  • An exemplary equation which assigns priority based on the FER, the prediction of the required E b /( N 0 +I 0 ), and soft handoff can be expressed as :
  • a pricing structure can be maintained which allows the user on each remote station 6 to determine, individually, the priority of remote station 6. The willingness to pay a premium fee for the capacity indicates a higher level of importance. In this case, a system which attempts to maximize revenue and customer satisfaction allows the premium remote station 6 to transmit first, even though the transmission requires more capacity.
  • Other weighting schemes can also be generated using the factors listed above, plus other factors not discussed, to achieve any set of system goals, and are within the scope of the present invention.

Abstract

A method of and apparatus for scheduling data transmissions in a communication network comprising at least one cell (2a to 2g) and at least one scheduled user (6a to 6e) improves utilization of the reverse link and decreases the transmission delay in data communication. The apparatus comprises a controller (92) for collecting status information for said communication network and for scheduling data transmissions from said at least one cell (2a to 2g) to said at least one scheduled user (6a to 6e). A memory (94) is connected to said controller for storing said status information, and a timer (96) is connected to provide timing signals to said controller (92). The timing signals enable said controller to perform scheduling of data transmission. Each remote station is assigned a maximum unscheduled transmission rate for the duration of the communication with a cell. A maximum scheduled transmission rate can be assigned by a channel scheduler (12) for scheduled transmission of data traffic at high rates. The maximum scheduled transmission rate is assigned in accordance with a set of system goals, a list of system constraints, and collected information on the status of the communication network. Data is partitioned in data frames and transmitted over the reverse link at or below the maximum scheduled transmission rate which have been assigned to the scheduled user.

Description

METHOD OF AND APPARATUS FOR SCHEDULING DATA TRANSMISSIONS IN A COMMUNICATION NETWORK
BACKGROUND OF THE INVENTION
I. Field of the Invention
The present invention relates to a method of and apparatus for scheduling data transmissions in a communication network. More particularly, the present invention relates to a method of and apparatus for scheduling data transmissions on a reverse link in a communication network.
II. Description of the Related Art
A modern day communication system is required to support a variety of applications. One such communication system is a code division multiple access (CDMA) system which conforms to the "TIA/EIA/IS-95A Mobile Station-Base Station Compatibility Standard for Dual-Mode Wideband Spread Spectrum Cellular System", hereinafter referred to as the IS-95A standard. The CDMA system allows for voice and data communications between users over a terrestrial link. The use of CDMA techniques in a multiple access communication system is disclosed in U.S. Patent No. 4,901,307, entitled "SPREAD SPECTRUM MULTIPLE ACCESS COMMUNICATION SYSTEM USING SATELLITE OR TERRESTRIAL REPEATERS", and U.S. Patent No. 5,103,459, entitled "SYSTEM AND METHOD FOR GENERATING WAVEFORMS IN A CDMA CELLULAR TELEPHONE SYSTEM", both assigned to the assignee of the present invention and incorporated by reference herein. The IS-95A standard is designed to optimize voice communication and many important system design parameters are selected to achieve that goal. For example, since time delay between speakers cannot be tolerated, processing delays are sought to be minimized. Each user is assigned a transmission rate capable of carrying speech data for the duration of the call. Upon termination of the call, the assigned transmission rate can be reassigned to another user.
In the CDMA system, users communicate with one another through remote stations which, in turn, communicate with each other through one or more base stations. In this specification, base station refers to the hardware with which the remote stations communicate. Cell refers to the hardware or the geographic coverage area, depending on the context in which the term is used.
In the CDMA system, communications between users are conducted through one or more cells which are serviced by base stations. A first user on one remote station communicates to a second user on a second remote station, or a standard telephone, by transmitting voice data on the reverse link to a cell. The cell receives the voice data and can route the data to another cell or a public switched telephone network (PSTN). If the second user is on a remote station, the data is transmitted on the forward link of the same cell, or a second cell, to the second remote station. Otherwise, the data is routed through the PSTN to the second user on the standard phone system. In IS-95A systems, the forward link and the reverse link are allocated separate frequencies and are independent of one another.
The remote station communicates with at least one cell during a communication. CDMA remote stations are capable of communicating with multiple cells simultaneously during soft handoff. Soft handoff is the process of establishing a link with a new cell before breaking the link with the previous cell. Soft handoff minimizes the probability of dropped calls. The method and system for providing a communication with a remote station through more than one cell during the soft handoff process are disclosed in U.S. Patent No. 5,267,261, entitled "MOBILE ASSISTED SOFT HANDOFF IN A CDMA CELLULAR TELEPHONE SYSTEM," assigned to the assignee of the present invention and incorporated by reference herein. Soft handoff impacts various aspects of the CDMA system design because considerations must be given to the status and capacity of each of the multiple cells involved in the soft handoff when a new allocation of resource is made.
In accordance with the IS-95A standard, each remote station is assigned a transmission rate of 28.8Ksps on the reverse link for the duration of the communication with a cell. Using a rate 1/3 convolutional encoder, the data rate of each remote station approaches 9.6Kbps. Although not specified by the IS-95A standard, higher data rates can by supported by the use of other code rates. For example, a data rate of 14.4Kbps is achieved by using a rate 1/2 convolutional encoder. The CDMA system is a spread spectrum communication system. The benefits of spread spectrum communication are well known in the art and can be appreciated by reference to the above cited references. The CDMA system must work within the pre-existing non-contiguous frequency allocation in the cellular band. By design, a CDMA system which conforms to IS-95A standard is allotted a 1.2288MHz bandwidth to fully utilize the cellular band. The reverse link refers to transmission from the remote stations to a cell. On the reverse link, the 28.8Ksps transmission rate is spread over the entire 1.2288MHz system bandwidth. On the reverse link, each transmitting remote station acts as an interference to other remote stations in the network. Therefore, the reverse link capacity is limited by the total interference which a remote station experiences from other remote stations. The IS-95A CDMA system increases the reverse link capacity by transmitting fewer bits, thereby using less power and reducing interference, when the user is not speaking.
To minimize interference and maximize the reverse link capacity, the transmit power of each remote station is controlled by two power control loops. The first power control loop adjusts the transmit power of the remote station such that the signal quality, as measured by the energy-per-bit-to- noise-plus-interference ratio, Et,/(N0+I0), of the signal received at the cell is maintained at a constant level. This level is referred to as the Et,/(N0+I0) set point. The second power control loop adjusts the set point such that the desired level of performance, as measured by the frame-error-rate (FER), is maintained. The power control mechanism for the reverse link is disclosed in detail in U.S. Patent No. 5,056,109, entitled "METHOD AND APPARATUS FOR CONTROLLING TRANSMISSION POWER IN A CDMA CELLULAR MOBILE TELEPHONE SYSTEM", assigned to the assignee of the present invention and incorporated by reference herein
The user on each remote station transmits at a different bit rate depending on the level of speech activity in the conversation of that user. A variable rate speech vocoder provides speech data at full rate when the user is actively speaking and at low rate during period of silence, e.g. pauses. The variable rate vocoder is described in detail in U.S. Patent No. 5,414,796, entitled "VARIABLE RATE VOCODER," assigned to the assignee of the present invention and incorporated by reference herein.
For the CDMA system, the reverse link capacity for voice communication between the remote stations and the cell, as measured by the number of users supportable by the cell, can be determined by the transmission rate of the user on each remote station. This is because other parameters determinative of the reverse link capacity are fixed by the system design or are given. For example, the maximum transmit power available for each remote station is limited by FCC regulations and also by system design constraints. The Eb/(N0+I0) required to maintain the desired level of performance is dependent on the channel condition which cannot be controlled. Finally, the CDMA system bandwidth of 1.2288MHz is selected by design.
The amount of speech activity at any given moment is non- deterministic. Also, there is typically no correlation in the level of speech activities among users. Therefore, the total power received at the cell from all transmitting remote stations varies over time and can be approximated as a Gaussian distribution. During periods of active speech, the remote station transmits at higher power and causes more interference to other remote stations. More interference lowers the received Eb/(N0+I0) of other remote stations, which increases the probability of frame errors in the voice data received by the cell if the power control is not able to track the dynamics. Therefore, the number of users able to have access to the communication system is limited so that only a small portion of the transmitted frames is lost through excessive interference. Limiting the reverse link capacity to maintain the desired frame error rate (FER) has the effect of forcing the cell to operate at less than full capacity, on the average, thereby under-utilizing the reverse link capacity. In the worse case, up to half of the reverse link capacity is wasted to maintain a headroom of up to 3dB. The headroom is the difference between the maximum power the cell can receive and the average power the cell actually receives. The headroom is only utilized during the period when the speech activities of the users at the remote stations are high.
Data communication within the CDMA system has different characteristics than voice communication. For example, data communication is typically characterized by long period of inactivity, or low activity, punctuated by high bursts of data traffic. An important system requirement for data communication is the transmission delay required to transfer the burst of data. Transmission delay does not have the same impact in data communication as it does for voice communication, but it is an important metric for measuring of the quality of the data communication system.
A method for transmitting data traffic in code channel frames of fixed size, wherein the data source provides data at a variable rate, is described in detail in U.S. Patent No. 5,504,773, entitled "METHOD AND APPARATUS FOR THE FORMATTING OF DATA FOR TRANSMISSION", assigned to the assignee of the present invention and incorporated by reference herein. Data is partitioned into data frames and each data frame may be further partitioned into data portions. The data portions are then encoded into code channel frames which can be 20 msec wide. At the 28.8Ksps symbol rate, each 20 msec wide code channel frame contains 576 symbols. A rate 1/2 or rate 1/3 convolutional encoder is used to encode the data, depending on the application. Using a rate 1/3 encoder, the data rate is approximately 9.6Kbps.
At the 9.6Kbps data rate, there are 172 data bits, 12 cyclic redundancy check (CRC) bits and 8 code tail bits per code channel frame.
High speed data transmission on the reverse link can be achieved by concurrently transmitting the data traffic over multiple code channels. The use of multiple code channels for data transmission is disclosed in U.S.
Patent Application No. 08/656,649, entitled "METHOD AND APPARATUS FOR PROVIDING RATE SCHEDULED DATA IN A SPREAD SPECTRUM COMMUNICATION SYSTEM", filed May 31, 1996, and in U.S. Patent Application No. 08/654,443, entitled "HIGH DATA RATE CDMA WIRELESS COMMUNICATION SYSTEM", filed May 28, 1996, both assigned to the assignee of the present invention and incorporated by reference herein. The demand for the reverse link continuously changes over time, due to variations in the level of voice activities. The inefficient use of the reverse link can be improved by transmitting data traffic during the period of low voice activity. To avoid degradation in the quality of the voice communication, the data transmission should be dynamically adjusted to match the available reverse link capacity of the cell.
In dealing with large sporadic bursts of data traffic, a system should be designed with the capability to transmit at high data rates and the ability to allocate the reverse link capacity to the users whenever requested, based on the availability of the capacity. In a CDMA system, the design should address other existing system considerations. First, since voice communication cannot tolerate extensive delay, priority should be given to transmission of voice data over transmission of any data traffic. Second, since the amount of voice activity at any given moment is unpredictable, the reverse link should be continuously monitored and the data transmission should be dynamically adjusted so that the reverse link capacity is not exceeded. Third, since the remote station may be in soft handoff between multiple cells, the data transmission rate should be assigned based on the reverse link capacity of each of the base stations participating in the soft handoff. These and other considerations are addressed by the present invention. SUMMARY OF THE INVENTION
The present invention aims to improve utilization of the reverse link and decreases the transmission delay in data communication in a CDMA system by providing for a means of transmitting data traffic at a high speed transmission rate. During a communication with a cell, each remote station can transmit unscheduled transmissions at rates up to a maximum unscheduled transmission rate over the reverse link. In accordance with IS- 95A, the maximum unscheduled transmission rate is 28.8Ksps. The unscheduled transmissions can be used to send small amounts of data and control messages without the additional delay caused by scheduling. Additionally, each remote station can be assigned a maximum scheduled transmission rate which can be higher than the maximum unscheduled transmission rate. In the present invention, a channel scheduler determines the maximum scheduled transmission rate for high speed data transmission. The maximum scheduled transmission rate is assigned at each scheduling period according to the availability of the reverse link capacity.
The present invention also aims to improve utilization of the reverse link capacity in a CDMA system. When the remote station has a large amount of data to transmit to the cell, the channel scheduler collects information on how much data is to be transmitted, the available reverse link capacity for each cell in the network and other parameters to be discussed below. Based on the collected information and in accordance with a list of system goals and a list of system constraints, the channel scheduler assigns the maximum scheduled transmission rate. The maximum scheduled transmission rate is sent to the remote station. The remote station partitions the data into data frames and transmits the data frames over the reverse link at or below the maximum scheduled transmission rate.
The present invention also aims to minimize the transmission delay of data traffic over the reverse link. The maximum scheduled transmission rate is assigned by the channel scheduler based on the amount of data to be transmitted. Small amounts of data are transmitted immediately over the reverse link at or below the maximum unscheduled transmission rate. For larger amounts of data, the channel scheduler assigns a maximum scheduled transmission rate.
The present invention further aims to optimize utilization of the reverse link by allocating the available reverse link capacity to users based on a set of priorities. The users within the system are assigned a priority based on a set of factors. These factors include the energy-per-bit required by the user for the requisite level of performance, the list of cells supporting the user, the amount of data to be transmitted, the type of data to be transmitted, the type of data service being provided to the user, the amount of delay already experienced by the user, and other factors. The available capacity is allocated to the highest priority user first and the lowest priority user last.
In one aspect the invention provides a method for scheduling data transmissions on a reverse link in a communication network comprising at least one cell and at least one scheduled user, said method comprising: determining a reverse link capacity available for each of said at least one cell; assigning an assigned transmission rate to each of said at least one scheduled user; and sending said assigned transmission rate to said at least one scheduled user; wherein said assigned transmission rate is based on said reverse link capacity available for each of said at least one cell.
In another aspect the invention provides an apparatus for scheduling data transmission on a reverse link in a communication network comprising at least one cell and at least one scheduled user, said apparatus comprising: controller means for collecting a status information for said communication network and for scheduling data transmissions from said at least one cell to said at least one scheduled user; memory means connected to said controller means for storing said status information; and timing means connected to said controller means for providing timing signals to said controller means, said timing signals enable said controller means to perform scheduling of data transmission.
In a further aspect the invention provides a system in which communication is controlled by scheduling selected data for transfer between one or more bases and a plurality of independent remotes each having individual communication requirements, which transfer is scheduled depending on the individual requirements of the remotes and communication resources available in the one or more bases.
BRIEF DESCRIPTION OF THE DRAWINGS The features, objects, and advantages of the present invention will become more apparent from the detailed description set forth below of an embodiment of the invention when taken in conjunction with the drawings in which like reference characters identify correspondingly throughout and wherein: FIG. 1 is a diagram of a cellular network comprising a plurality of cells, a plurality of base stations and a plurality of remote stations.
FIG. 2 is a block diagram illustrating an exemplary implementation of the present invention in a CDMA communication system; FIG. 3 is a block diagram of the channel controller;
FIG.4 is a block diagram of an exemplary encoder within the remote station;
FIG. 5 is a block diagram of an exemplary modulator at the remote station; FIG. 6 is a block diagram of an alternative encoder and modulator structure at the remote station;
FIG. 7 is a flow diagram of the reverse link rate scheduling embodying the present invention;
FIG. 8 is a flow diagram of the data transmission rate assignment embodying the present invention;
FIG. 9 is a flow diagram of the data transmission rate re-assignment embodying the present invention;
FIG. 10 is a timing diagram showing the transmission rate assignment and the data transmission at the assigned transmission rate; and FIG. 11 is a diagram showing an exemplary utilization of the reverse link rate scheduling embodying the present invention.
DETAILED DESCRIPTION OF THE PREFERRED
EMBODIMENTS Referring to the figures, FIG. 1 represents an exemplary cellular communication network composed of multiple cells 2a - 2g. Each cell 2 is serviced by a corresponding base station 4. In the exemplary embodiment, the cellular network is a CDMA communication network, although the present invention is applicable to all wireless communication formats. Within the CDMA network, various remote stations 6 are dispersed throughout. Each of remote stations 6 communicate with one or more base stations 4, depending on whether the remote station is in soft handoff. For example, remote stations 6a and 6b communicate exclusively with base station 4c, remote stations 6d and 6e communicate exclusively with base station 4d, but remote station 6c which is located near a cell boundary is in soft handoff and communicates simultaneously with base stations 4c and 4d. The use of soft handoff in a CDMA system is described in detail in the aforementioned U.S. Patent No. 5,267,261.
A block diagram illustrating the basic architecture of a CDMA network embodying the present invention is shown in FIG. 2. Base station controller 10 interfaces with packet network interface 24, PSTN 30, and all base stations 4 in the CDMA network (only one base station 4 is shown in
FIG. 2 for simplicity). Base station controller 10 coordinates the communication between remote stations 6 in the CDMA network and other users connected to packet network interface 24 and PSTN 30. Base station controller 10 contains many selector elements 14, although only one is shown in FIG. 2 for simplicity. One selector element 14 is assigned to control the communication between one or more base stations 4 and remote station
6. On the reverse link, remote station 6 initiates a call by transmitting a request message to base station 4. Base station 4 receives the message and forwards the message to call control processor 16. Call control processor 16 sends a command to selector element 14 to direct base station 4 to assign a forward link traffic channel. Base station 4 uses one channel element 40 to control the call with remote station 6. After assigning the traffic channel, call control processor 40 is informed. Call control processor 40 then commands base station 4 to transmits a channel assignment message to remote station 6 on the forward link.
Remote station 6 initiates high speed data transmission on the reverse link by requesting permission from channel scheduler 12. Controller 68 within remote station 6 processes the request by routing the request command to encoder 72. Controller 68 can be implemented in a microcontroller, a microprocessor, a digital signal processing (DSP) chip, or an ASIC programmed to perform the function as described herein. In the exemplary embodiment, encoder 72 encodes the request command consistent with the Blank and Burst signaling data format described in the aforementioned U.S. Patent No. 5,504,773. Encoder 72 generates and appends a set of cyclic redundancy check (CRC) bits, appends a set of code tail bits, convolutionally encodes the data and appended bits, and reorders the encoded data symbols. The interleaved bits are provided to modulator (MOD) 74. Modulator 74 maps the interleaved bits into another signal space using Walsh code mapping. Specifically, the interleaved bits are grouped into groups of six bits. The six bits are then mapped to a corresponding 64 chips Walsh sequence. Modulator 74 then spreads the Walsh code chips with a long pseudo noise (PN) code and short PN codes. The modulated signal is provided to front end 62. Front end 62 filters, amplifies, and transmits the signal over the air, through antenna 60, on reverse link 52.
Remote station 6 modulates the reverse link data in accordance with a long PN sequence. In the exemplary embodiment, each reverse link channel is defined in accordance with the temporal offset of a common long
PN sequence generator. At two differing offsets the resulting modulation sequences are uncorrelated. The offset of remote station 6 is determined in accordance with a unique numerical identification of remote station 6, which in the exemplary embodiment of IS-95 remote stations 6 is the electronic serial number (ESN). Thus, each remote station 6 transmits on one uncorrelated reverse link channel determined in accordance with its unique electronic serial number.
At base station 4, the reverse link signal is received by antenna 44 and provided to RF unit 42. RF unit 42 filters, amplifies, downconverts, and quantizes the reverse link signal and provides the digitized baseband signal to channel element 40. Channel element 40 demodulates and decodes the baseband signal, the inverse of the signal processing functions done at remote station 6. Channel element 40 despreads the digitized baseband signal with the short PN codes and the long PN code. Channel element 40 then signal maps the despread data. Specifically, the despread data is grouped into blocks of 64 chips and assigned a Walsh code having a Walsh sequence closest to the block of despread data. The Walsh code comprises the demodulated data. Channel element 40 then reorders the demodulated data, convolutionally decodes the de-interleaved data, and performs the CRC check function. The decoded data, e.g. the request command, is provided to selector element 14. Selector element 14 routes the request command to channel scheduler 12.
Channel scheduler 12 connects to all selector elements 14 within base station controller 10. Channel scheduler 12 assigns the maximum scheduled transmission rate that can be used by each remote station 6 for high speed data transmission on the reverse link. The maximum scheduled transmission rates for remote stations 6 are provided to selector element 14. Selector element 14 routes the scheduling information to channel element 40 which encodes and modulates the scheduling information. The modulated signal is provided to RF unit 42 which upconverts and conditions the signal. The signal is transmitted by antenna 44 over forward link 50.
At remote station 6, the forward link signal is received by antenna 60 and routed to front end 62. Front end 62 filters, amplifies, downconverts, and quantizes the received signal and provides the digitized baseband signal to demodulator (DEMOD) 64. The digitized baseband signal is demodulated by demodulator 64 and decoded by decoder 66, the inverse of the signal processing performed by channel element 40. The decoded data, which contains the maximum scheduled transmission rate, is routed to controller
68. Controller 68 receives the scheduling information and configures the hardware to begin data transmission at or below the maximum scheduled transmission rate. High speed data transmission occurs in essentially the same manner as that described above for transmission of the request command, with the exception that data transmission can occur at rates up to the maximum scheduled transmission rate. At remote station 6, the data is partitioned into data frames. In this specification, a data frame refers to the amount of data which is transmitted from remote station 6 to base station 4 within one frame time period. The data frame can be further partitioned into smaller units called data portions. The data frames are sent from data source 70 to encoder 72. Encoder 72 formats the data frames, inserts the set of generated CRC bits and a set of code tail bits, convolutionally encodes the data, and reorders the encoded data. A method for encoding and interleaving the data is described in detail in the aforementioned U.S. Patent No. 5,504,773. The encoded data frames are provided to modulator 74 which performs signal mapping using Walsh code. Modulator 74 then spreads the mapped data with a long pseudo noise code and short PN codes and provides the spread data to front end 62. Front end 62 filters, amplifies, upconverts and transmits the signal over the air through antenna 44 on reverse link 52.
Base station 4 receives the reverse link signal and demodulates and decodes the reverse link signal in the manner described above. The decoded data is provided by channel element 40 to selector element 14. Selector element 14 provides the data to packet network interface 24 which routes the data to data sink 22. The hardware, as described above, supports transmission of both data and voice communication over the CDMA network.
The functions described above can also be accomplished by other implementations. The location of channel scheduler 12 and selector element 14 is dependent on whether a centralized or distributed scheduling processing is desired. For example, channel scheduler 12 and selector element 14 can be included within base stations 4. This distributed processing allows each base station 4 to perform its own scheduling, thereby possibly minimizing the processing delay. Conversely, channel scheduler 12 can be designed to control communication with all base stations 4 in the network. This centralized processing may result in the optimal utilization of system resources. These examples illustrate that channel scheduler 12 does not have to be incorporated in base station controller 10 as shown in the exemplary embodiment. Other implementations of the above described functions can be contemplated and are within the scope of the present invention.
The reverse link transmissions can be classified into two classes. The first class contains unscheduled tasks which, in the preferred embodiment, are not scheduled because of intolerance to additional processing delay. This class includes voice communications and certain types of data communication (e.g. acknowledgment messages for higher layers). The second class encompasses scheduled tasks which can tolerate additional processing and queuing delay. This class includes most data communications between remote stations 6 and base stations 4.
As shown in FIG. 1, remote stations 6 are dispersed throughout the CDMA network and can be in communication with one or more base stations 4 simultaneously. Therefore, channel scheduler 12 coordinates transmissions of the scheduled and unscheduled tasks over the entire CDMA network. The transmission of the scheduled tasks on the reverse link are scheduled by channel scheduler 12, based on the availability of the reverse link capacity, in order to avoid degradation in the transmission of the scheduled and unscheduled tasks. Channel scheduler 12 is tasked with the function of assigning the data transmission rate to each scheduled user on remote station 6 within the CDMA network such that a set of goals is optimized. These goals include (1) improved utilization of the reverse link capacity by transmitting as much scheduled and unscheduled tasks as can be supported within system capacity constraints, (2) improved quality in the communication and minimized transmission delay, (3) fair allocation of the reverse link capacity to all scheduled users based on a set of priorities, and (4) minimized transmit power of remote station 6 to extend battery life and reduce interference. The goals are optimized by balancing a list of factors which are discussed in detail below. A block diagram of channel scheduler 12 is shown in FIG. 3.
Controller 92 collects the pertinent information from all base stations 4 in the CDMA network and assigns the data transmission rates. Controller 92 can be implemented in a microcontroller, a microprocessor, a digital signal processing (DSP) chip, or an ASIC programmed to perform the function as described herein. Controller 92 connects to all selector elements 14 within base station controller 10. Controller 92 collects information regarding the demand and capacity for the reverse link. The collected information is stored in memory element 94 and retrieved by controller 92 as needed. Memory element 94 can be implemented using a storage element or one of any number of memory devices, such as RAM memory devices, latches, or other types of memory devices, that are known in the art. Controller 92 also connects to timing element 96. Timing element 96 can be implemented with a counter run by a system clock, an on board oscillator locked to an external signal, or a storage element for receiving system timing from an external source. Timing element 96 provides controller 92 with the timing signals necessary to perform the reverse link rate scheduling. The timing signals also allow controller 92 to send the maximum scheduled transmission rates to selector element 14 at the appropriate interval.
I. Reverse Link Rate Scheduling
The flow diagram of the reverse link rate scheduling methodology embodying the present invention is shown in FIG. 7. The first step in the scheduling process, step 200, involves the collection of all pertinent information necessary for the optimal assignment of the data transmission rates for each scheduled user at remote station 6. The pertinent information may include the number of scheduled and unscheduled tasks, the transmit power available to each remote station 6, the queue size indicating the amount of data to be transmitted by each remote station 6, the Et,/(N0+I0) set point and the measured Eb/(N0+I0) for each remote station 6 at base station 4, the transmission rate for the unscheduled task for each remote station 6 during the prior scheduling periods, the active member set of each remote station 6 listing the cells with which remote station 6 is in communication, the priority of remote stations 6, and the total power received at each cell for the prior scheduling period. Each of these parameters is discussed in detail below. Having collected the information from each cell, channel scheduler 12 assigns a maximum scheduled transmission rate for each scheduled user based on the collected information, the set of aforementioned goals, and the list of system constraints described below at step 202. Channel scheduler 12 sends the scheduling information which contains the maximum scheduled transmission rate to each remote station at step 204. The data is transmitted by remote station 6 at or below the maximum scheduled transmission rate which has been assigned to remote station 6 a predetermined number of frames later. Channel scheduler 12 then waits, at step 206, until the next scheduling period to restart the scheduling cycle.
The assignment of the maximum scheduled transmission rate can be accomplished by at least two embodiments. In the first embodiment, channel scheduler 12 assigns the maximum scheduled transmission rate to each scheduled user. And in the second embodiment, the scheduled user requests a maximum scheduled transmission rate.
In the first embodiments, the assignment of the maximum scheduled transmission rate for the scheduled users, at step 202 of the flow diagram in FIG. 7, is further illustrated by the flow diagram shown in FIG. 8. Channel scheduler 12 assigns the maximum scheduled transmission rate for the scheduled task of each remote station 6 such that the aforementioned goals are achieved. In assigning transmission rates, channel scheduler 12 conforms to the following system constraints : (1) remote station 6 transmit power - the power required to transmit at the maximum scheduled transmission rate must be available to remote station 6; (2) cell received power - the total power received by each cell must not exceed a predetermined threshold so that the interference to remote stations 6 is not excessive; (3) soft handoff - the maximum scheduled transmission rate is the same for all cells supporting remote station 6 in soft handoff. (4) remote station 6 queue size - a high transmission rate is only assigned to remote station 6 which has sufficient amount of data to transmit. Each of these constraints are discussed in detail below.
In the exemplary embodiment, the transmit power available for each remote station 6 is sent to channel scheduler 12 some amount of time prior to the start of each scheduling period, along with the queue size, and can be considered in the assignment of the maximum scheduled transmission rate. If this information is not available to channel scheduler 12, the rate assignment is performed without consideration of the transmit power of remote station 6.
Channel scheduler 12 enters the flow diagram of FIG. 8 after having collected the pertinent information necessary for the optimal assignment of data transmission rates to the scheduled users. Channel scheduler 12 starts at state 210. In the first step, channel scheduler 12 calculates the total capacity available for each cell in the CDMA network at step 212. The total capacity available for scheduled transmission for each cell is calculated as :
where QaVail *s ^e reverse link capacity available for scheduled transmission, Pr is the received power at the cell that is not from the same cell scheduled tasks, and Pmax is maximum allowable total received power at the cell. The power received at the cell that is not from the same cell scheduled tasks includes the background thermal noise power N0W, the power Padj from remote stations 6 in the adjacent cells, and the power
^unscheduled from remote station 6 within the same cell for unscheduled tasks.
The equation which channel scheduler 12 needs to satisfy when assigning a data transmission rate is :
where! 7, 1 is the predicted E]-,/(N0+I0) set point of the i-th remote station for the upcoming scheduling period, Rj, is the data transmission rate assigned to the i-th remote station, W is the system spreading bandwidth, and is the predicted received power at the cell that is not from the same cell scheduled tasks for the upcoming scheduling period. For an IS-95A system, W is 1.2288MHz. The derivation of equation (2) and the meaning of each of the terms in equation (2) are described in detail below. Each of the terms in the quantity on the right hand side of equation (2) can be calculated or is known. The quantity on the right hand side of equation (2) is calculated once for each cell in the network, at the start of each scheduling period. The capacity Qavail available for scheduled transmission can be defined or calculated by other methods than that shown in equation (1). Furthermore, QaVail can ^e influenced by controlling the transmissions of the unscheduled tasks. For example, channel scheduler 12 can increase QaVaii by limiting the transmission rates of one or more remote stations 6 to decrease Pr. Other methods to define and manipulate Qa ail can be contemplated and are within the scope of the present invention.
Note that the terms used in all equations throughout this specification are given in linear scale (not in dB), unless otherwise specified. Note also that symbols without extra markings (e.g. E^) represent the actual value for the upcoming scheduling period, symbols marked with an underscore (e.g. E^) represent the known or measured value for the prior scheduling period, and symbols marked with a hat (e.g. Ebi) represent the predicted value for the upcoming period.
On the left hand side of equation (2), the predicted set point χ, of the scheduled user for the upcoming scheduling period is assumed to be the same as the set point ^ for the prior scheduling period. Therefore, having a prediction of the capacity available for the cells and the set point of a particular remote station 6, channel scheduler 12 is able to determine the maximum transmission rate which can be supported by the cells for this particular remote station 6.
Channel scheduler 12 then creates a priority list of all scheduled users at step 214. The priority list is a function of numerous factors, each of which is discussed in detail below. The scheduled users are arranged according to their relative priority, with the scheduled user having the highest priority placed at the top of the list and the scheduled user having the lowest priority placed at the bottom of the list. Channel scheduler 12 then enters a loop and assigns the available reverse link capacity to the scheduled users in accordance with the priority list.
In the first step within the transmission rate assignment loop, channel scheduler 12 selects the scheduled user on the priority list having the highest priority at step 216. Channel scheduler 12 then identifies the cells supporting this scheduled user. These cells are listed in the active member set of the scheduled user. If the scheduled user is in soft handoff, each of the cells supporting the user simultaneously receives the data transmitted by the user. Thus, for each cell in the active member set, channel scheduler 12 calculates the maximum supportable transmission rate for the scheduled user at step 218. The maximum supportable transmission rate for each cell can be calculated by multiplying the quantity on the right hand side of equation (2) with W/ ^
Remote station 6 can also transmit a requested transmission rate to the cell. The requested transmission rate can be based on the queue size which is indicative of the amount of data to be transmitted, the total transmit power available to remote station 6, the predicted transmit energy- per-bit required for the upcoming scheduling period, and the backoff power of remote station 6. The requested transmission rate represents the maximum transmission rate which remote station 6 can support. This value is derived in detail below. Channel scheduler 12 can also recommend a preferred transmission rate based on the amount of data, as measured by the queue size, to be transmitted by the scheduled user at step 222. The preferred transmission rate can also be made a function of the transmit power available to remote station 6, if this information is available to channel scheduler 12. In the exemplary embodiment, the queue size and the transmit power available to remote station 6 are sent from remote station 6 to channel scheduler 12 at the start of each scheduling period. The preferred transmission rate is selected to be at or below the transmission rate required to transmit the data in the queue within the scheduling interval. To ensure that the reverse link capacity allocated to the scheduled task for this remote station 6 can be supported by each cell supporting remote station 6 in soft handoff, channel scheduler 12 selects the minimum transmission rate from the list of maximum supportable transmission rates, the requested transmission rate, and the preferred transmission rate at step 220. The selected minimum transmission rate is defined as the maximum scheduled transmission rate for this scheduled user. Having assigned a transmission rate to this scheduled user, channel scheduler 12 removes the scheduled user from the priority list at step 226. The capacity available for each cell is then updated, at step 228, to reflect the capacity Qj allocated to the scheduled user just removed from the priority list. The capacity is updated by subtracting the capacity just allocated, computed as Qj from the quantity on the right hand side of equation (2) for each cell in the active member set. The updated capacity is used in the subsequent transmission rate assignment. Channel scheduler 12 then determines whether all scheduled users on the priority list have been assigned a transmission rate at step 230. If the priority list is not empty, channel scheduler 12 returns to step 216 and assigns a data transmission rate to the scheduled user with the next highest priority. The assignment loop is repeated until the priority list contains no scheduled user. If the priority list is empty, the assignment process terminates at state 232.
In the alternative embodiment, the allocation of the reverse link capacity can also be accomplished by an allocation of capacity to the scheduled users instead of an assignment of a maximum scheduled transmission rate. In this embodiment, channel scheduler 12 allocates a reverse link capacity to the scheduled users. The allocated capacity, Qj, is routed to selector element 14 which computes the maximum scheduled transmission rate based on the allocated capacity and the set point of the scheduled user (e.g. R Qi'W/ j). In this embodiment, selector element 14 can assign new maximum scheduled transmission rates for the scheduled users at each frame in the scheduling period based on the changes in the set point of the scheduled users. This allows selector element 14 to maintain a quality communication for the scheduled and unscheduled tasks on the reverse link by maintaining the interference at an acceptable level. Other embodiments to allocate the reverse link capacity can be contemplated and are within the scope of the present invention.
The capacity available for each cell can also be allocated to the scheduled users without the use of a loop. For example, the available reverse link capacity can be allocated according to a weighting function. The weighting function can be based on the priority of the scheduled users and/or some other factors.
The priority list determines the allocation of the reverse link capacity to the scheduled users. A scheduled user having a higher priority is allocated more capacity than one having a lower priority. Although it is preferable to allocate the capacity in an order based on the priority of the scheduled user, this is not a necessary limitation. The available resource can be allocated in any order, and all are within the scope of the present invention. The reverse link rate scheduling of the present invention can be performed continuously, periodically, or in a staggered manner. If the scheduling is performed continuously or periodically, the scheduling interval is selected such that the reverse link capacity of the cells is fully utilized for the duration of the scheduling period. This objective can be accomplished by the following embodiments. Other embodiments which are variations or combinations of the following embodiments can be contemplated and are within the scope of the present invention.
In the first embodiment, the scheduling (or capacity allocation) is performed every frame. This embodiment allows channel scheduler 12 to dynamically adjust the maximum scheduled transmission rate of the scheduled user at each frame to fully utilize the capacity available for each cell in the network. More processing is required to assign the maximum scheduled transmission rate at each frame. Also, more overhead is required to transmit the necessary scheduling information to each scheduled user at each frame. In addition, remote stations 6 may be required to provide information to channel scheduler 12 concerning its current transmit power, it maximum transmit power, and its capabilities more frequently.
In the second embodiment, the scheduling is performed every K frames, where K is an integer greater than one. For each scheduling interval, channel scheduler 12 assigns the maximum scheduled transmission rate for each scheduled user. In the exemplary embodiment, the maximum scheduled transmission rate can be calculated by using a high value for Pmax in equation (2). Furthermore, the maximum scheduled transmission rate can be calculated by using a lower value for the set point than the set point j for the prior scheduling period. The users who are scheduled are notified. In the exemplary embodiment, the schedule of the maximum scheduled transmission rates is transmitted to the scheduled users once per scheduling period. Data transmissions at the high speed transmission rates occur a predetermined number of frames later, as discussed below. The maximum scheduled transmission rate for the scheduled tasks is allocated by channel scheduler 12 for the duration of the scheduling period. During a scheduling period, if the capacity of the cells does not support data transmission at the maximum scheduled transmission rates, channel scheduler 12 can direct data transmission at lower transmission rates.
During a scheduling period, each remote station 6 has permission to transmit at a rate up to its maximum scheduled transmission rate. If remote station 6 is not able to transmit at the maximum scheduled transmission rate, remote station 6 may notify the cell of data transmission at a lower transmission rate. Remote station 6 then concurrently, or soon thereafter, transmits data at the lower transmission rate. Likewise, if the reverse link capacity for the cells does not support data transmission at the maximum scheduled transmission rates, channel scheduler 12 directs data transmission at a lower transmission rate.
The second embodiment is preferable to the first embodiment for several reasons. On the reverse link, a scheduling delay exists from the time the data is made available to remote station 6 to the time of data transmission at the high speed transmission rate. In the exemplary embodiment, the scheduling delay can be up to seven frames in length. The scheduling delay impacts the responsiveness of channel scheduler 12 to changes in the reverse link capacity and demand. When the reverse link is lightly loaded, allowing remote station 6 to transmit at any rate, up to the maximum scheduled transmission rate, reduces the scheduling delay. When remote station 6 has no more data to transmit, remote station 6 can immediately reduce the transmission rate and, thus, reduce the reverse link interference to other remote stations 6. Additionally, the signal processing and the transmit power resources are not as limited at the cell as in remote station 6. Thus, the cell can demodulate at the maximum scheduled transmission rates without a major performance penalty.
The second embodiment also has the advantage of requiring less overhead to transmit the schedule of the maximum scheduled transmission rates to the scheduled users. In the first embodiment, the scheduling information is transmitted at each frame to the scheduled users. A portion of the forward link resource is thus allocated to this overhead. In the second embodiment, the scheduling information is transmitted once per scheduling period to the scheduled users. For example, if the scheduling interval is ten frames, the second embodiment requires slightly more than 1/10 of the overhead of the first embodiment while still maintaining efficient utilization of the reverse link. The transmission rate reassignment, to be discussed below, can be performed at each frame in the scheduling period to allow channel scheduler 12 to dynamically reassign the transmission rates at each frame. The additional overhead necessary to transmit the schedule of the temporary transmission rates is minimal, since the transmission rate of only a fraction of the scheduled users are reassigned at each frame. In fact, just enough scheduled users are reassigned so that all cells in the network operate at less than the total reverse link capacity available for the cells. Alternately, in the third embodiment, the reverse link rate scheduling can be staggered. In this embodiment, the scheduling can be triggered by certain events. For example, channel scheduler 12 can perform the reverse link rate scheduling whenever a request for high speed data transmission is received or whenever a scheduled high speed data transmission by remote station 6 is completed. Channel scheduler 12 has knowledge of the amount of data to be transmitted by each remote station 6 and the maximum scheduled transmission rate. Typically, remote station 6 transmits at the maximum scheduled transmission rate except in extenuating circumstances, e.g. lack of available transmit power. Thus, channel scheduler 12 is able to determine when the high speed data transmission is completed. Upon termination of a scheduled transmission by remote station 6, channel scheduler 12 can perform the scheduling and allocate the reverse link capacity to other remote stations 6. The schedule of the maximum scheduled transmissions rate is only transmitted to remote stations 6 which has been assigned or reassigned a transmission rate.
The reverse link rate scheduling can be performed by channel scheduler 12 for all cells in the CDMA network. This embodiment enables channel scheduler 12 to effectively schedule high speed data transmission for remote stations 6 which are in soft handoff and are in communication with multiple cells. Scheduling for the entire network is more complex because of the various interactions between the cells and remote stations 6. In the alternative embodiment, to simplify the scheduling, the scheduled tasks can be divided into two categories, specifically, scheduled tasks from remote stations 6 which are in soft handoff and scheduled tasks from remote stations 6 which are not in soft handoff. In this embodiment, the reverse link rate scheduling for remote stations 6 which are communication with only one cell can be performed at the cell level. Remote stations 6 which are in communication with multiple cells can be scheduled by channel scheduler 12. The present invention is applicable to all embodiments of the forward link rate scheduling, including centralized scheduling, distributed scheduling, and any combinations thereof.
II. Transmission Rate Reassignment
In the first embodiment described above, wherein the reverse link rate scheduling is performed every frame, the reverse link capacity can be reallocated during the scheduling period to match the reverse link demand with the available capacity. Although the capacity is allocated every frame, the scheduling delay may have resulted in sub-optimal capacity allocation. During the scheduling delay, the status of the system may have changed. Also, the initial predictions may not have been accurate and may require modification.
In the second embodiment, wherein the scheduling is performed every K frames, the transmission rate can be reassigned during the scheduling period to match the reverse link demand with the available reverse link capacity. In the exemplary embodiment, data transmission occurs at or below the maximum scheduled transmission rate for the duration of the scheduling period, without the use of the transmission rate reassignment routine. This simplifies the scheduling routine but can result in a lower Eb/(N0+I0) which can degrade the quality of the communication.
In the preferred embodiment, the maximum scheduled transmission rates can be reassigned at each frame to maintain a quality communication.
During the scheduling period, if the reverse link capacity for the cells does not support data transmissions at the maximum scheduled transmission rates, channel scheduler 12 directs data transmissions at lower transmission rates. For each frame in which the reverse link capacity for the cells is inadequate to service the demand by the scheduled and unscheduled tasks, channel scheduler 12 determines the amount of increase in the reverse link demand and the available reverse link capacity. Channel scheduler 12 then assigns lower transmission rates for some or all scheduled users such that the capacity required by the users does not exceed the total capacity available for the cells. In the exemplary embodiment, the lower transmission rates are referred to as the temporary transmission rates and are used for only one frame. For subsequent frames in the scheduling period, the maximum scheduled transmission rates are used unless they are modified, again, by channel scheduler 12.
Channel scheduler 12 can also attempt to minimize the transmission rate reassignment by increasing the total capacity available for the cells. Increasing the total capacity can be achieved by lowering the transmission rates of the unscheduled users (e.g. limiting the transmission rates of the voice users to lower rates).
In the exemplary embodiment, the transmission rate reassignment is performed every frame to ensure that the capacity required for the scheduled and unscheduled tasks for each cell is less than the total reverse link capacity available for the cells. The schedule of the temporary transmission rates is transmitted to the scheduled users who have been reassigned with temporary transmission rates. For each frame, the scheduled user verifies that the transmission rate has not been reassigned. At each frame within the scheduling period, each scheduled user transmits data at or below the maximum scheduled transmission rate or the temporary transmission rate.
The transmission rate reassignment is illustrated by the flow diagram shown in FIG. 9. Channel scheduler 12 starts at state 240. In the first step, at step 242, channel scheduler 12 creates a cell list of cells in the network for which the reverse link capacity required for the scheduled and unscheduled tasks exceeds the total capacity available for the cell. Channel scheduler 12 calculates the total reverse link capacity available for each cell in the CDMA network using equation (2) at step 244. Next, channel scheduler 12 creates the priority list of all scheduled users which are in communication with at least one cell in the cell list and which have been assigned a transmission rate for the current scheduling period at step 246. The scheduled users in the priority list are referred to as the affected scheduled users. Channel scheduler 12 then enters a loop and reassigns the transmission rate of some or all affected scheduled users in accordance with the priority list and the cell list.
In the first step within the transmission rate reassignment loop, channel scheduler 12 selects the affected scheduled user having the highest priority at step 248. Channel scheduler 12 then identifies the cells supporting the affected scheduled user for high speed data transmission. These cells are referred to as the selected cells. Next, channel scheduler 12 calculates the maximum supportable transmission rate for the affected scheduled user by each selected cell at step 250. To ensure that the reverse link capacity allocated to this scheduled user can be provided by each selected cell, channel scheduler 12 selects the minimum transmission rate from the list of maximum supportable transmission rates and the maximum scheduled transmission rate at step 252. The selected minimum transmission rate is defined as the temporary transmission rate. In the exemplary embodiment, the temporary transmission rate is lower than the maximum scheduled transmission rate and is only assigned to the scheduled user for the upcoming frame at step 254. The affected scheduled user is removed from the priority list at step 256. The total reverse link capacity available for each selected cell is then updated, at step 258, to reflect the capacity allocated to the affected scheduled user just removed from the priority list. Channel scheduler 12 then updates the cell list and removes the cells for which the total reverse link capacity is zero at step 260. Next, channel scheduler 12 determines whether the cell list is empty at step 262. If the cell list is not empty, channel scheduler 12 determines if the priority list is empty at step 264. If the priority list is not empty, channel scheduler 12 returns to step 248 and reassigns a data transmission rate to the affected scheduled user with the next highest priority. The transmission rate reassignment loop continues until the cell list or the priority list is empty. If the cell list or the priority list is empty, the transmission rate reassignment process terminates at state 266. Channel scheduler 12, selector element 14, or the cell can also temporarily assign lower transmission rates to remote stations 6 if the FER at the cell is high or if the measured total received power Pto al *s above a predetermined threshold. The temporary transmission rates can be sent to remote stations 6 immediately, without having to wait for the next scheduling period, and data transmissions at the temporary transmission rates can occur immediately or soon thereafter. This reduces the processing delay and allows channel scheduler 12 or the cell to take quick action to improve the quality of the communication on the reverse link.
The maximum scheduled transmission rate represents a permission given by channel scheduler 12 to remote station 6 to transmit up to the maximum scheduled transmission rate. Remote station 6 can transmit at lower transmission rates. If remote station 6 determines that its available transmit power does not support data transmission at the maximum scheduled transmission rate, remote station 6 can send a rate reduction message to all cells in communication with remote station 6. The rate reduction message indicates the lower transmission rate which remote station 6 intends to use. In the exemplary embodiment, remote station 6 transmits at the lower transmission rate at the same frame that the rate reduction message is transmitted, or at a predetermined number of frames thereafter. Allowing remote station 6 to decrease the transmission rate unilaterally, without having to be reassigned by channel scheduler 12, reduces the processing delay and improves the quality of the communications on the reverse link. It is preferable that remote station 6 transmits at the maximum scheduled transmission rate since the reverse link capacity has already been allocated. Data transmission at the lower transmission rate can result in an under-utilization of the reverse link capacity.
Alternately, if remote station 6 determines that its available transmit power supports data transmission at a higher transmission rate and the queue size is large, remote station 6 can request for a rate increase during the scheduling period. The request for higher transmission rate can be transmitted to all cells supporting remote station 6 in soft handoff. If any one of the cells determines that the reverse link capacity for that cell is full, the request for higher transmission rate is denied. Otherwise, the request is routed to channel scheduler 12 which can consider the request during the scheduling period. III. Remote Station Transmit Power Consideration
Each remote station 6 is constrained by the maximum transmit power available to it. The maximum transmit power is determined by FCC regulations, battery capacity, and the interference to other remote stations 6 in the CDMA network. Remote station 6 requires E^ energy-per-bit to transmit data to the cell for the requisite level of performance. For voice communication 1% FER is an acceptable level of performance but the requirement for data communication can be more stringent. The power constraint which should be satisfied by each remote station 6 is :
where
Ebj = required transmit energy-per-bit by the i-th remote station,
Ri = transmission rate of the i-th remote station, and
PmaX/ = maximum transmit power available to the i-th remote station.
On the reverse link, the energy-per-bit-to-noise-plus-interference ratio Eb/(N0+I0), as measured at the cell, for each remote station 6 is controlled such that the requisite level of performance is maintained while minimizing the transmit power of remote station 6. This power control is critical on the reverse link because the transmit power of each remote station 6 is an interference to other remote stations 6 in the CDMA network.
Minimizing the transmit power reduces the interference and increases the reverse link capacity.
As remote station 6 moves about the network, the effect of multipath and fading drastically alter the Et,/(N0+I0) of the signal received at the cell. In fact, the dynamic variation in received Eb/(N0+I0) can be more that 60dB during a communication. To combat this wide variation, each remote station 6 maintains a power control mechanism which dynamically adjusts the transmit power to combat changes in the channel condition. For the CDMA system which conforms to the IS-95A standard, each remote station 6 is allowed a range of 60dB for the reverse link power control and the transmit power can be increased or decreased by ldB per 1.25 msec.
The transmit power of remote station 6 is backed off from the maximum transmit power to maintain headroom. The headroom allows the power control mechanism of remote station 6 to adjust the transmit power to combat changes in the channel condition and to account for variations in the transmission rate of the unscheduled tasks. Therefore, equation (3) can be expressed as :
Efc,.R;. < α . Rm (4)
where α is the fraction of the transmit power that is reserved for backoff. For example, if half of the maximum transmit power is reserved for backoff then α = 0.5 (3dB of backoff power). The required energy-per-bit Εj,j can be predicted from the transmit power Pj and the transmission rate Rj for the prior scheduling period as follows :
where is the predicted energy-per-bit required for the upcoming scheduling period, δ(Rj, Rj) is the correction factor to be used if the prior transmission rate Rj and the scheduled transmission rate Rj have different required energy-per-bit. The frame error rate (FΕR) can also be taken into account to predict the required energy-per-bit. Specifically, the predicted energy-per-bit can be increased if the FΕR is high or decreased if the FΕR is low. Thus, equation (5) becomes :
where Pe is the FΕR and. /(Re) j is a function of Pe. \f(Pe) can be implemented as an equation or a look-up table. In general, |/(Rg)| is a positive value and increases as Pe decreases. Combining equation (4) and (6), the maximum transmission rate which can be assigned to remote station 6 based on the available transmit power, the backoff power, and the predicted energy-per-bit required by remote station 6 becomes :
Equation (7) can be calculated at remote station 6 and the maximum transmission rate Rmax can be used by remote station 6, along with the queue size, to determine the requested transmission rate. Alternately, remote station 6 can convey the maximum transmit power PmaX/i , the predicted required energy-per-bit , and the queue size to channel scheduler 12 for consideration in assigning a transmission rate to remote station 6.
IV. Reverse Link Capacity
The capacity of the reverse link in a CDMA system is predominantly determined by the interference each remote station 6 causes to other remote stations 6. This is because each remote station 6 spreads the data over the system bandwidth and transmits the signal over the same frequency band. The cell receives the power transmitted by all remote stations 6 and demodulates the signal of each remote station 6. The total power received by the cell from M remote stations 6, for the scheduled and unscheduled tasks, can be expressed as :
M "total = "r + 2-1 ' ι=l (8)
where
P total = total power received by the cell,
Pr = power received by the cell that is not from the same cell scheduled tasks, Pj = power received from scheduled task of the i-th remote station, and M = number of transmitting scheduled remote stations.
The Eb/(N0+I0) for a given remote station 6 is given by :
where Efcj = energy-per-bit for the i-th remote station,
N0 = background noise density of the system, and
I0 = interference to the signal received from the i-th remote station by other sources in the system.
Each remote station 6 requires different Eb/(N0+I0) for the requisite level of performance. In fact, a particular remote station 6 can require different Et,/(N0+I0) at different times during a communication with the cell. The major factor affecting the required E]~,/(N0+I0) is the channel condition. For example, the speed at which remote station 6 moves about the CDMA network affects the amount of fading and, therefore, the channel condition. At low speed, the power control mechanism is effective in counteracting the slow fades and the required Ej-,/(N0+I0) is low. At high speed, the power control is not effective in counteracting the fast fading and the effect of interleaving is increasingly beneficial. At an intermediate speed, the required Et,/(N0+I0) is the highest because neither the power control nor the interleaving is as effective. Other factors can also effect the channel condition and , thus, the required E]D/(N0+I0).
Combining equation (8) and (9) and approximating the summation term in the denominator of equation (9) with the summation term in equation (8) yield :
The total received power Ptotal *s highly related to the reverse link capacity. The term in the denominator of equation (10) relates to the loading of the system. As 1.0 in equation (10), Ptotal approaches infinity, an operating point which cannot be reached by the system. Higher loading on the reverse link results in higher level of interference. The higher level of interference forces remote station 6 to transmit at higher power to maintain the requisite level of performance. Since the transmit power of each remote station 6 has an upper bound, the upper bound of Ptotal is limited to guarantee the coverage for the unscheduled tasks. The operating point Pmax depends on the system design and is related to the achievable Ebj/(N0+I0) of remote station 6 located at the cell edge. Ebj/(N0+I0) is directly related to the FER performance. Operating at higher loading results in worse E],i/(N0+I0) for the unscheduled users at the edge of the coverage area and, correspondingly, higher FER.
In the exemplary embodiment, the cell contains two power control loops for each remote station 6 to maintain the requisite level of FER performance while minimizing interference to other remote stations 6. The first power control loop, referred to as the inner loop, adjusts the transmit power of remote station 6 such that the signal quality, measured by Eb/(N0+I0), as received at the cell is maintained at a set point. The cell measures the Et,j/(N0+I0) of the received signal and transmits a control signal to remote station 6 commanding remote station 6 to increase the transmit power, by ldB step increment, if the measured Et,/(N0+I0) is below the set point. Alternately, the cell commands remote station 6 to decrease the transmit power if the measured Eb/(N0+I0) is above the set point. The inner loop adjusts the transmit power of remote station 6 such that the transmit power is minimized while maintaining the measured Ef-,/(N0+I0) equal to the set point. The second power control loop, referred to as the outer loop, adjusts the set point such that the desired level of performance, as measured by the frame-error-rate (FER), is maintained. The cell increases the set point if the measured FER is higher than a predetermined level. Conversely, the cell decreases the set point if the FER is lower than the predetermined level. To maintain stability between the two loops, the time constant of the outer loop is made slower than that of the inner loop. In addition, remote station 6 may utilize an open loop power control system in which it adjusts its transmit power in accordance with changes in the power of the received forward link signals.
Channel scheduler 12 assigns the data transmission rate for the scheduled tasks for each remote station 6 while maintaining Ptotal below Pmax. The required Ebj/(N0+I0), or Xj, for remote station 6 can be predicted by using the set point j of remote station 6 for the prior scheduling period (Xj = j.). The set point is a good prediction of the required Et,j/(N0+I0) because the outer loop maintains the set point at the setting which produces the desired level of performance.
The set point is not a good estimate of the required Ebi/(N0+I0) in certain extreme circumstances. In the first situation, remote station 6 transmits at the maximum transmit power but the FER is still high. In this case, the power control loop will keep increasing the set point. In the second situation, remote station 6 is in soft handoff with multiple cells and each cell measures a different Eb/(N0+I0). To minimize interference to other remote stations 6 in the system, remote station 6 decreases the transmit power if any cell commands remote station 6 to decrease power. Therefore, for the cells with weaker reverse links, the measured Efc/(N0+I0) is lower than the set point. And in the third situation, the current transmission rate and the scheduled transmission rate have different required E]-,/(N0+I0). When the measured Efc/(N0+I0) is lower than the set point, the FER at the cell is likely to be high. In this situation, the inner power control loop attempts to increase the transmit power to maintain the measured ED/(N0+I0) at the set point. If this fails and excessive FER occurs, channel scheduler 12 recognizes that the channel condition is degraded and can place remote station 6 in the hold state until the channel condition improves.
The power Pr received by the cell that is not from the same cell scheduled tasks can be predicted by measurements from one or more prior scheduling period by subtracting the power received for the scheduled tasks from the total power received by the cell as follows :
(11)
where |_^J is the predicted received power at the cell that is not from the same cell scheduled tasks for the upcoming scheduling period and Etotal *s the total power received by the cell for the prior scheduling period. |^J can also be predicted from other system measurements. Substituting Pr in equations (10) with |^J from equation (11) and rearranging the terms, the capacity for the reverse link can be expressed as :
Equation (12) indicates that the available reverse link capacity, e.g. the data transmission rate which can be assigned for the upcoming scheduling period, can be determined from the information from prior scheduling periods. The term on the right hand side of equation (12) indicates the reverse link capacity available for the upcoming scheduling period and is based on information from the prior scheduling period.
In allocating data transmission rate for the scheduled tasks, the value of Pmax can be used to adjust the total reverse link capacity to be scheduled to remote stations 6. Pmax can be adjusted according to the statistics of Ptotal or the statistics of the FER. For example, if the averaged FER increases or the average of Ptotal *s too high, channel scheduler 12 can reduce Pmax for the upcoming scheduling period, thereby operating the reverse link at a lower loading to improve the FER.
V. Soft Handoff
At any given moment, it is possible that all remote stations 6 in a CDMA network are in soft handoff between cells. Each remote station 6 in soft handoff communicates with two or more cells simultaneously. The use of soft handoff in the CDMA system is discussed in detail in the aforementioned U.S. Patent No. 5,267,261.
In assigning a maximum scheduled transmission rate to remote station 6 in soft handoff, channel scheduler 12 ensures that each cell participating in the soft handoff satisfies the constraint of equation (2). At the start of each scheduling interval, selector elements 14 sends the active member set of each remote station 6 in the CDMA network to channel scheduler 12. The active member set contains the list of cells in communication with remote station 6. For each cell in the active member set, channel scheduler 12 calculates the maximum transmission rate which can be supported by the cell. The maximum supportable transmission rates from all cells on the active member set form a list of possible data transmission rates. Since equation (2) must be satisfied for all cells, the minimum data transmission rate from the list of maximum supportable transmission rates satisfies the constraint of equation (2) for all cells. Thus, the maximum transmission rate which can be assigned to a particular remote station 6 is the minimum of the list of maximum supportable transmission rates.
VI. Data Queue Size
The queue size of remote station 6 is taken into consideration in assigning the maximum scheduled transmission rate. The queue size is indicative of the amount of data to be transmitted by remote station 6 as of the time remote station 6 receives the data. At the start of each scheduling period, the queue size of all scheduled tasks are sent to channel scheduler 12. Channel scheduler 12 assigns a high speed transmission rate in accordance with the queue size. For example, channel scheduler 12 can assign a high speed transmission rate only if the queue size is above a predetermined threshold. Alternately or additionally, channel scheduler 12 can assign a high speed transmission rate if the rate of change in the queue size is above another predetermined threshold. Furthermore, channel scheduler 12 can assign a high speed transmission rate if the queue size of remote station 6 approaches the maximum queue size. In this regard, channel scheduler 12 can assist remote stations 6 which are nearing its storage capacity limit.
In the exemplary embodiment, channel scheduler 12 assigns the minimum transmission rate such that the data in the queue can be transmitted during the K frame scheduling period. If the queue size is small, channel scheduler 12 ignores the task since the small amount of data can be transmitted within the maximum unscheduled transmission rate which is assigned to each remote station 6 in communication with a cell. A scheduling delay exists from the time the data is made available to remote station 6 to the time of actual data transmission at the high speed transmission rate. The scheduling delay is due to the processing delays, which, in the exemplary embodiment, can be seven frames in duration. In the exemplary embodiment, the queue size is transmitted to channel scheduler 12 at the start of each scheduling period. Channel scheduler 12 adjusts the queue size to take into account any predictable changes to the queue size during the scheduling delay. Specifically, the data which is to be transmitted to the cell during the scheduling delay and new data which is known to arrive during the scheduling delay are considered in adjusting the queue size. Furthermore, data which is to be retransmitted is also taken into account in the queue size prediction.
The amount of data transmitted during the scheduling delay can be predicted by summing the maximum scheduled transmission rate which is assigned to remote station 6 for each frame in the scheduling delay. This is a moderately accurate adjustment to the queue size since, in most cases, remote station 6 transmits at the maximum scheduled transmission rate. If remote station 6 transmits at a lower transmission rate, e.g. maybe due to inadequate transmit power, the actual queue size is larger than the adjusted queue size. Transmission of the additional data in the queue can be scheduled at the subsequent scheduling period.
Referring to FIG. 10, at frame k, remote station 6 measures the queue size of the data to be transmitted. At frame k+1, remote station 6 sends the queue size to channel scheduler 12. Because of scheduling delay, channel scheduler 12 knows that data transmission at the high speed transmission rate does not occur until frame k+7. Channel scheduler 12 also knows that some of the data in the queue is transmitted during the scheduling delay, the time between frame k+1 and frame k+6. Data transmission during the scheduling delay is at or below the maximum scheduled transmission rate assigned to frames k+1 through k+6. Therefore, channel scheduler 12 adjusts the queue size as it appears at frame k+7, by subtracting the amount of data to be transmitted during frame k+1 through frame k+6. Data which channel scheduler 12 knows will arrive between frame k+1 and k+6 at remote station 6 is added to the calculated queue size.
VII. High Speed Data Transmission
The reverse link rate scheduling method and apparatus of the present invention can be applied to any communication system capable of variable rate data transmission. For example, the present invention is applicable to a CDMA system, a GLOBALSTAR system, a time division multiple access (TDMA) system, or a frequency division multiple access (FDMA) system. The applications of the present invention to a CDMA system or other variable rate communication systems, using the concept of a single variable rate channel, or multiple channels having a fixed rate, or a combination of variable and fixed rate channels, are within the scope of the present invention. In the first embodiment, high speed data transmission occurs over a single variable rate channel. During the initiation of a call with the cell, remote station 6 is assigned the maximum unscheduled transmission rate of 1 (or 9.6Kbps) on the variable rate channel. Therefore, remote station 6 can transmit unscheduled transmissions at any rate up to 1, including rate 1/8, 1/4, 1/2 and 1. Remote station 6 is not allowed to transmit at higher transmission rates unless permitted by channel scheduler 12. The variable rate channel as used in this manner is also referred to as a traffic channel in this specification. For high speed data transmission, remote station 6 can be assigned a maximum scheduled transmission rate greater than 1. Remote station 6 can then transmit at higher rates, up to the maximum scheduled transmission rate, for high speed data transmission.
In the second embodiment, high speed data transmission occurs over multiple channels, herein after referred to as traffic channel and secondary code channel. The traffic channel is assigned to each remote station 6 during the call set up with a cell and allows unscheduled transmission up to a maximum unscheduled transmission rate of 1. The secondary code channels can be fixed or variable rate channels. The concept and implementation of secondary code channels for use in high speed data transmission are described in detail in U.S. Patent Application No. 08/798,951, entitled "METHOD AND APPARATUS FOR FORWARD LINK
RATE SCHEDULING", filed February 11, 1997, assigned to the assignee of the present invention and incorporated by reference herein.
In the exemplary embodiment, channel scheduler 12 equates the maximum scheduled transmission rate to a set of secondary code channels.
Remote station 6 is directed to transmit data over the assigned secondary code channels. The identity of the assigned secondary code channels is transmitted to remote station 6 in one of three embodiments. In the first embodiment, the identity of each secondary code channel is transmitted to remote station 6 at each scheduling period. This requires more overhead but allows the most flexibility.
In the second embodiment, the secondary code channels are grouped into channel sets, with each channel set defined by a unique grouping of secondary code channels. The definition of the channel sets is transmitted to remote station 6 during the call set up stage of a communication with a cell or during the call set up stage of a soft handoff. Channel scheduler 12 assigns the maximum scheduled transmission rate and selects a channel set corresponding to the maximum scheduled transmission rate. The identity of the channel set is transmitted to remote station 6. This embodiment requires less overhead than the first embodiment since only the identity of the channel set, and not the identity of each secondary code channel, is transmitted to remote station 6.
The third embodiment is a subset of the second embodiment. Each channel set is defined by a Walsh code and the member of channel set N is composed of secondary code channels 1 through N. The assigned transmission rate is equated to a Walsh code and the Walsh code is transmitted to remote station 6. Higher transmission rate is equated with more secondary code channels and a higher Walsh code. Remote station 6 transmits data over all secondary code channels associated with the Walsh code. For example, Walsh code 5 is equated with secondary code channels 1 through 5. An assignment of Walsh code 5 indicates that remote station 6 can transmit data over secondary code channels 1 through 5. If remote station 6 decides to transmit at a lower transmission rate, e.g. using three secondary code channels, remote station 6 transmits Walsh code 3 to the cell indicating the intention to transmit over secondary code channels 1 through 3.
VIII. Encoding and Modulation of Secondary Code Channels For the second embodiment described above, wherein high speed data transmission occurs over secondary code channels, the encoding and modulation of secondary code channels for the reverse link can be accomplished by the embodiments described below. Other embodiments can also be used to transmit data over secondary code channels on the reverse link. The first embodiment is described in detail in the aforementioned U.S. Patent Application No. 08/654,443. The encoder and modulator is described below to facilitate understanding of the present invention.
The exemplary block diagram of encoder 72 of the first embodiment is shown in FIG. 4. Data source 70 contains the large amount of information which is to be transmitted to the cell. The data is provided to a bank of BPSK and QPSK channel encoders 104 and 106 through DEMUX 102. DEMUX 102 demultiplexes the data from data source 70 to the selected BPSK or QPSK channel encoders 104 and 106. BPSK and QPSK channel encoders 104 and 106 encode and reorder the data and provide the encoded data to modulator 74. The type of channel encoder to be selected, BPSK or QPSK, is dependent on the system design. Encoder 72 can be configured with a bank of BPSK channel encoders 104, a bank of QPSK channel encoders 106, or a combination of BPSK and QPSK channel encoders 104 and 106. Within BPSK channel encoder 104, the data from data source 70 is partitioned into data frames and provided to CRC generator 110. CRC generator 110 generates the CRC bits for the data frames, inserts the code tail bits, and provides the CRC encoded data to convolutional encoder 112. Convolutional encoder 112 convolutionally encodes the CRC encoded data. In the exemplary embodiment, convolutional encoder 112 has a constraint length K=9 and is rate 1/4, although other constraint lengths and rates can be used. A K=9, rate 1/4 encoder provides additional coding gain over the rate 1/2 and rate 1/3 encoders used in the reverse link transmissions of voice data. Block interleaver 114 receives the encoded bits and reorders the bits to provide time diversity. The time diversity spreads the burst errors received by the cell and improves the performance of the Viterbi decoding at the cell. Variable starting point repeater 116 receives the interleaved data and repeats each bit Nβ number of times to provide a constant output symbol rate of 307.2Ksps. In accordance with the IS-95A standard, each code channel frame is 20msec long and corresponds to 6,144 symbols at the 307.2Ksps symbol rate. If the value of Ng is not an integer, the final repetition is only performed for a portion of the encoded data. In the exemplary embodiment, variable starting point repeater 116 uses a different starting point to begin the repetition for each data frame. The resulting repeated symbols are provided to BPSK mapper 118 which generates a +1 or -1 value for each repeated symbol.
QPSK channel encoder 106 functions in the almost same manner as BPSK channel encoder 104. The data from data source 70 is partitioned into data frames, routed through DEMUX 102, and provided to CRC generator 130. CRC generator 130 block encodes the data frames and provides the CRC encoded data to convolutional encoder 132. Convolutional encoder 132 convolutionally encodes the CRC encoded data with a rate 1/4, K=9 encoder, although other rates and constraint lengths can also be used. Block interleaver 134 receives the encoded bits, reorders the bits, and provides the interleaved data to variable starting point repeater 136. Variable starting point repeater 136 repeats each bit NQ number of time to obtain a fixed output symbol rate of 614.4Ksps. The repeated symbols are provided to
QPSK mapper which groups the repeated symbols by two and generates one of four possible state for the in-phase (QPSKT) and quadrature (QPSKQ) outputs. For example, a grouping of (0,0) repeated symbols can correspond to QPSKT = -1 and QPSKQ = -1, a grouping of (0,1) repeated symbols can correspond to QPSKj = -1 and QPSKQ = +1, and so on. The symbol rate at the QPSKT and QPSKQ outputs is 307.2Ksps. In an alternative implementation of the first embodiment, data from data source 70 is provided directly to one CRC generator 110 which generates the CRC bits for the data frames being transmitted. The CRC encoded data is provided to one convolutional encoder 112 which convolutionally encodes the CRC encoded data. The encoded bits are provided to one block interleaver 114 which reorders the code bits to provide time diversity. The interleaved data is provided to a bank of variable starting point repeaters 116 and 136, one for each BPSK and QPSK channel encoder 104 and 106, through DEMUX 102. Combining the CRC block encoding, the convolutional encoding, and the block interleaving for all BPSK and QPSK channel encoders with a set of one CRC generator, one convolutional encoder, and one block interleaver minimizes the hardware requirement.
The exemplary block diagram of modulator 74 within remote station 6 for the first embodiment is shown in FIG. 5. The BPSK, QPSKj and QPSKQ outputs from encoder 72 are provided to modulator 74. Each BPSK output is provided to a unique BPSK Walsh modulator 146. Within BPSK Walsh modulator 146, the BPSK encoded data is modulated by a unique Walsh code by multiplier 150 and amplified by a unique gain by gain adjust 160. For example, BPSKj output is modulated by Walsh code Wi and amplified by gain Bj. Likewise, each QPSKj and QPSKQ output pair is provided to a unique QPSK Walsh modulator 148. Within QPSK Walsh modulator 148, the QPSK encoded data is modulated by a unique Walsh code by multipliers 152-156 and amplified by a unique gain by gain adjust 162-166. For example, QPSKJ and QPSKQJ output pair is modulated by Walsh code W^+1 and amplified by gain Qj. Gain adjust 158 receives the PILOT signal, which in the exemplary embodiment is comprised of the logic level associated with a positive logic voltage, and adjusts the amplitude according to gain P. The PILOT signal contains no data but provides a reference carrier signal which RF unit 42 within base station 4 can use to coherently demodulate the data on the remaining BPSK and QPSK channels.
The Walsh code modulated and gain adjusted QPSK signals are summed together by summer 168a. Likewise, the Walsh code modulated and gain adjusted QPSKQ signals are summed together by summer 168b to form the signal XQ. The Walsh code modulated and gain adjusted BPSK signals, the gain adjusted PILOT signal, and summer 168a output are summed together by summer 170 to form the signal X .
The subsequent signal processing functions to further spread the signals Xj and XQ, with the long PN code and the short PNj and PNQ codes, and distributes the PN modulated signals evenly over both in-phase (I) and quadrature (Q) components of the QPSK modulated signal. First, the long PN code is modulated with the short PNj code by multiplier 172a to produce the signal LPNj. The long PN code is also modulated with the short PNQ code by multiplier 172b to produce the signal LPNQ.
Multipliers 174 and summers 176 perform a complex multiply of the signals Xj and XQ and the LPNj and LPNQ codes. Using j to represent the imaginary part of a complex number and multiply the two complex terms above, the following equation can be obtained :
(X, +jXQ) *(LPN, +jLPQQ) = (X, . LPN, - XQ . LPNQ) + j(xι •LPNQ +XQ . LPNI) (13)
To obtain the above result, the signal X is first modulated with LPNj by multiplier 174a to produce the product term XJ LPNJ, and with LPNQ by multiplier 174d to produce the product term XJ»LPNQ. Next, the signal XQ is modulated with LPNj by multiplier 174b to produce the product term XQ'LPNJ, and with LPNQ by multiplier 174c to produce the product term XQ*LPNQ. The four intermediate product terms are combined by adders 176a and 176b such that the resultant signals Yr = XI»LPNI - XQ»LPNQ and YQ = XJ'LPNQ +XQ»LPNJ. The signals Yj and YQ are filtered (not shown in FIG. 5) and modulated with an in-phase sinusoidal COS(Wct) and a quadrature sinusoidal SIN(Wct) by mixers 178a and 178b, respectively. The I component from mixer 178a and the Q component from mixers 178b are combined by summer 180 and the resultant QPSK modulator output is provided to front end 62.
Modulator 74 evenly distributes the data from BPSK and QPSK channel encoders 104 and 106 over both I and Q components of the QPSK modulator output. In the first example, assume that only BPSK channel encoders 104 are present and that QPSK channel encoders 106 do not exist. In this case, X contains the BPSK data and XQ = 0. Substituting these quantities for equation (13) above, Yj = XJ LPNI and YQ = XJ'LPNQ. Thus, the BPSK data from BPSK channel encoder 104 is spread with different short PN codes and evenly distributed between the I and Q components.
In the next example, assume that only QPSK channel encoders 106 are present and that BPSK channel encoders 104 do not exist. In this case, Xj contains the QPSK data and XQ contains the QPSKQ data. The resulting signals become Yj = X^ PNΪ - XQ »LPNQ and YQ = XJ LPNQ + XQ-LPNT. Thus, the QPSKj data is spread with different short PN codes and distributed evenly between the I and Q components. Likewise, the QPSKQ data is spread with different short PN codes and distributed evenly between the I and Q components. The minus sign in the equation for Y results from the complex multiply operation.
As stated above, the number of BPSK or QPSK channel encoder is selected by system design. In exemplary embodiment, one BPSK Walsh modulator 146 is assigned to each BPSK channel encoder 104 and one QPSK Walsh modulator 148 is assigned to each QPSK channel encoder 106. Each pair of BPSK channel encoder 104 and BPSK Walsh modulator 146 is collectively referred to as a secondary code channel throughout the specification. Likewise, each pair of QPSK channel encoder 106 and QPSK Walsh modulator 148 is collectively referred to as a secondary code channel. In the first embodiment, the data transmission rate over the BPSK and QPSK channels can be made variable, by changing the repetition value Nj and NQ. The inclusion of a pilot tone allows the cell to use partial coherent demodulation to improve the FER performance. The pilot tone allows the reverse link to operate at a lower EDj/(N0+I0) for the same FER performance. Also, when the data transmission rate is high, the percentage of the transmit power utilized by the pilot tone is small. The disadvantage of the first embodiment is that the QPSK modulator output does not conform to the IS-95A standard for the modulated signal on the reverse link. Therefore, the modulated signal generated in accordance to the first embodiment is not backward compatible with the CDMA systems that conform to IS-95A standard.
The exemplary block diagram of encoder 72 and modulator 74 of the second embodiment is shown in FIG. 6. The secondary code channels are created by the use of Walsh code spreading to provide orthogonality between the secondary code channels. The orthogonality improves signal detection at the cell by providing a correlated signal on the secondary code channel being demodulated and spreading the signals of other secondary code channels. The Walsh code spread signal is then signal mapped, in accordance with the IS-95A standard, to improve the signal detection. Finally, the mapped signal is spread by short PN codes to provide quadrature spreading, again to improve signal detection at the cell.
Referring to FIG. 6, data from data source 70 is provided to CRC generator 140 which generates the CRC bits for the data frames being transmitted and inserts the code tail bits. The CRC encoded data is provided to convolutional encoder 142 which convolutionally encodes the CRC encoded data. The encoded bits are provided to block interleaver 144 which reorders the encoded bits to provide time diversity. The interleaved data is provided to modulator 74.
Within modulator 74, the encoded data is routed through DEMUX 146 and provided to a bank of Walsh code modulators 182. Walsh code modulators 182 spreads the encoded data with unique Walsh codes to provide orthogonality between the code channels. The Walsh code modulated data is provided to ortho-modulator 184. Ortho-modulator 184 maps the input signal into another signal space using Walsh code mapping. The input bit sequence is grouped into groupings of 6-bits. Each 6-bit grouping selects a unique 64-chip Walsh sequence. The mapped signal from ortho-modulator 184a is provided to data burst randomizer 186. Data burst randomizer 186 turns off the transmitter within front end 62 when remote station 6 is transmitting at less than full rate to reduce the transmit power.
Since Walsh code WQ is defined as the all zeros sequence (0, 0, ...0),
Walsh code modulator 182a does not perform any function. Therefore, the first Walsh code channel WQ, comprising Walsh code modulator 182a, ortho-modulator 184a, and data burst randomizer 186, conforms to the signal processing defined by the IS-95A standard for the reverse link. The secondary Walsh code channels Wj-Wjv , comprising Walsh code modulator
182 and ortho-modulator 184, are utilized as necessary without impacting the performance of the first Walsh code channel W0. The outputs from the first Walsh code channel and secondary Walsh code channels are combined by summer 188 and the resultant signal is modulated with the long PN code by multiplier 190. The long PN code modulated signal is further spread by the short PN and PNQ codes by multipliers 192a and 192b, respectively. The PNJ modulated signal is mixed with the in-phase sinusoidal COS(Wct) by mixer 196a. The PNj modulated signal is delayed for half a chip, through delay 194, and mixed with the quadrature sinusoidal SIN(Wct) by mixer 196b. The I component from mixer 196a and the and Q component from mixer 196b are combined by summer 198 and the resultant OQPSK modulator output is provided to front end 62. This embodiment has the advantage of providing a modulated signal which is backward compatible with the modulated signal for the reverse link in accordance with the IS-95A standard. Each secondary Walsh code channel Wj-W^ is referred to as a secondary code channel in this specification.
IX. CRC Bits
In accordance with IS-95A, the CRC bits are appended to each data frame to allow detection of frame error by the cell. The CRC bits are generated in accordance with the CRC polynomial specified by IS-95A. Specifically, for a data transmission rate of 9.6Kbps, the specified polynomial is g(x) = x + x + x + x + x + x + x + l. For each data frame, twelve CRC bits are appended. In the present invention, the number of CRC bits can be increase or decrease, depending on the required detection certainty. More CRC bits allows detection of frame error with greater certainty but requires more overhead. Conversely, less CRC bits decreases the certainty of frame error detection but requires less overhead.
As stated above, depending on the hardware implementation, high speed transmission rate can occur over one variable rate channel or multiple secondary code channels. For the implementation wherein high speed data transmission occurs over secondary code channels, the data frame can be further partitioned into data portions, with each data portion being encoded into a code channel frame and transmitted over one secondary code channel. The following discussion on CRC bits generation is applied to the embodiment using secondary code channels, although the concept can be extended to other hardware embodiments. For simplicity, the following discussion assumes that each secondary code channel transmits at the maximum unscheduled transmission rate. Furthermore, the secondary code channel and the traffic channel are each referred to as a code channel. In the embodiment wherein high speed data transmission occurs over multiple code channels, the CRC bits for the multiple code channels can be generated by at least two embodiments. In the first embodiment, each data portion is appended with its own set of CRC bits, similar to the IS-95A standard. This embodiment requires more overhead but allows detection of frame error on each code channel frame. Only the code channel frame received in error is retransmitted.
In the second embodiment, the data frame which is to be transmitted over the code channels assigned to remote station 6 within one frame is encoded by one CRC generator. The generated CRC bits can be transmitted in one of several modes. In the first mode, the data frame is partitioned into data portions as described above. The CRC bits are also partitioned and appended to each data portion. Thus, each code channel frame contains a data portion and some CRC bits. In the second mode, the CRC bits are transmitted over one code channel frame. All code channel frames, except the last code channel frame, contain only the data portion. The last code channel frame contains the CRC bits and some possibly data. The second mode provides time diversity of the CRC bits and improves frame error detection by the cell. At the cell, the code channel frames are reassembled to the data frame.
In the second embodiment, the cell is only able to determine whether all code channel frames are received correctly or whether one or more code channel frame error has occurred. The cell is not able to determine which ones of the code channel frames are received in error. Therefore, a data frame error dictates that all code channel frames for that data frame need to be retransmitted by the cell. The second embodiment has the advantage of using a smaller number of CRC bits for the data frame.
As an example, assume that high speed data transmission occurs over twelve code channels. In the first embodiment, each of the twelve data portions is appended with its own set of twelve CRC bits. A total of 144 CRC bits is required for the twelve code channel frames. These 144 CRC bits allow detection of frame error on each individual code channel frame. Therefore, if the code channel frame on a particular code channel is received in error, only the error frame needs to be retransmitted. For the second embodiment, the entire data frame is encoded with one set of CRC bits. Preferably, the number of CRC bits used is less than the total number of CRC bits used in the first embodiment. In the example shown above, for twelve code channel frames, the number of CRC bits used is at least 12 but less than 144. Since there are approximately twelve times more data bits, more CRC bits is required to allow detection of frame error with greater certainty. Assuming that 24 CRC bits allows detection of frame error with the requisite level of certainty, the 24 CRC bits can be partitioned into twelve CRC blocks, with each CRC block containing two CRC bits. One CRC block is appended to each of the twelve data portions. Alternately, the 24 CRC bits can be transmitted over one code channel frame. At the cell, the data portions and the 24 CRC bits are reassembled. The cell is only able to determine whether all twelve code channel frames are received correctly. If a frame error is indicated, the cell is not able to determine which ones of the code channel frames are received in error. Therefore, all twelve code channel frames must be retransmitted by remote station 6. For a saving of 120 CRC bits in overhead, the cell is still able to detect frame error, but without the precision of the first embodiment. The second embodiment requires a tradeoff between less overhead and redundant retransmission of code channel frames.
X. Timing of the Reverse Link Rate Scheduling
The accuracy of the prediction of the available reverse link capacity for the unscheduled tasks is improved by making the prediction at a moment as close as possible to the time at which the estimate will be used. During the period of delay, from the time of the prediction to the time of the actual use, the status of the network may have changed. For example, other remote stations 6 may have started or stopped transmitting, remote stations 6 may have been added or dropped from the network, or the channel conditions may have changed. By limiting the processing delay to a small number of frames, the prediction of the available reverse link capacity for the scheduled tasks is sufficiently accurate. In the exemplary embodiment, the processing delay is seven frames or less. Channel scheduler 12 can make predictions at a short time intervals, e.g. by maintaining a short scheduling interval, to improve the accuracy of the predictions and allow channel scheduler 12 to quickly respond to changes in the reverse link demand. In the preferred embodiment, the predictions are made every K frames, the maximum scheduled transmission rates are assigned every K frames or reassigned every frame, and the schedule of the maximum scheduled transmission rates is transmitted to remote stations 6 every K frames.
An exemplary illustration of the timing diagram of the reverse link rate scheduling is shown in FIG. 10. At frame k, remote station 6 has a large amount of data to transmit to the cell. Remote station 6 measures the queue size of the data and the total transmit power available to remote station 6 at block 300. At frame k+1, remote station 6 transmit the information to the cell at block 302. At frame k+2, base station 4 serving the cell receives the information and routes the information to selector element 14 at block 304. At frame k+3, the status of the entire CDMA network is measured by- selector elements 14 and sent to channel scheduler 12 at block 306. In the exemplary embodiment, the status of the CDMA network includes the reverse link capacity available for scheduled tasks at each cell, the amount of data to be transmitted by each scheduled user, the total transmit power available to each remote station 6, the active member set of each remote station 6, and the priority of remote stations 6. At frame k+4, channel scheduler 12 assigns the maximum scheduled transmission rates and sends the scheduling information to selector element 14 at block 308. The maximum scheduled transmission rates are to be utilized at frame k+7. Within frame k+4, selector element 14 sends the data frames which is to be transmitted at frame k+5 on the forward link to channel element 40 at block 310. Channel element 40 receives the data frames from selector element 14 within frame k+4 at block 312. At frame k+5, channel element 40 transmits the scheduling information containing the maximum scheduled transmission rate for frame k+7 to remote station 6 on the forward link at block 314. During frame k+6, remote station 6 processes the forward link signal, determines the maximum scheduled transmission rate, and reconfigures the hardware, if necessary, for data transmission at the high speed transmission rate at block 316. At frame k+7, the data is transmitted at or below the maximum scheduled transmission rate over the reverse link to base station 4 at block 318.
In the exemplary embodiment, the processing delay between the time remote station 6 determines it has a large amount of data to transmit to base station 4 to the time of data transmission at the high speed transmission rate is seven frames. At frame k, remote station 6 measures the queue size and the total transmit power available to it. At frame k+7, remote station 6 transmit the data at the high speed transmission rate to base station 4. For a CDMA system which conforms to the IS-95A standard, each frame of delay represents a 20 msec delay. In the exemplary embodiment, the seven frames of processing delay represents 140 msec of delay. This period of delay is short enough so that other communications on the reverse link is not significantly degraded. Furthermore, the initial prediction of the required reverse link capacity for the unscheduled tasks is not overly critical in the present invention because of the ability of channel scheduler 12 to continuously monitor the reverse link usage and dynamically reassigns the transmission rate of the scheduled tasks.
The above description of the exemplary embodiment represents one implementation of the present invention. Other variations in the timing of the reverse link rate scheduling routine from that described above can be contemplated and are within the scope of the present invention. For example, the processing delays represented by blocks 304, 306, 308, 310, and 312 can be shortened to one or two frames, instead of the three frames shown in FIG. 10, by optimizing the hardware to minimize processing delay. The scheduling information containing the maximum scheduled transmission rates can be transmitted to remote stations 6 in one of a number of embodiments. In the first embodiment, certain bits in the code channel frame on the forward link is reserved for the scheduling information. In the second embodiment, the scheduling information is transmitted by the use of separate signaling messages. The signaling message can be transmitted to remote station 6 whenever there is a new assignment of a data transmission rate. Other embodiments to transmit the scheduling information using variations or combination of the above described embodiments can be contemplated and are within the scope of the present invention.
An exemplary diagram of the reverse link rate scheduling and high speed data transmission is shown in FIG. 11. As discussed above, remote station 6 is assigned a maximum unscheduled transmission rate (rate 1) for the duration of the communication with the cell. As shown in FIG. 11, remote station 6 transmits at rate 1/8 when idle and at rate 1 when transmitting data. The backlog of the data to be transmitted to the cell is represented by the solid line and given in terms of the number of code channel frames. The number of code channel frames equals to the maximum unscheduled transmission rate times the number of frames necessary to send the data. For example, 20 code channel frames can be transmitted by rate 1 over 20 frames or by a rate 4 over five frames. The following discussion pertains to the earlier described embodiment wherein the reverse link rate scheduling is performed every K frames and the transmission rate can be reassigned every frame. Also, remote station 6 can reduce the transmission rate unilaterally. The following example also applies to the embodiment wherein the reverse link rate scheduling is performed every frame.
In the example shown in FIG. 11, remote station 6 is assigned a maximum unscheduled transmission rate (rate 1) but remote station 6 has no data to transmit to the cell at frames 1 and 2. Therefore, remote station 6 transmits at rate 1/8 over the reverse link. During frame 2, remote station 6 receives two code channel frames for transmission to the cell. Remote station 6 transmits one code channel frame at frames 3 and 4, at rate 1, to bring the backlog to zero at the end of frame 3. Note that remote station 6 can transmit data up to rate 1 over the reverse link without scheduling. The data received during frame 2 is transmitted immediately at frame 3. Immediate transmission at or below rate 1 allows the signaling from the remote station 6 to the cell to get through quickly. For example, the TCP acknowledgment requires approximately 40 bytes and, with header compression, can be fitted into one data frame. The TCP acknowledgment can be transmitted immediately over the reverse link within one frame.
During frames 5, 6 and 7, remote station 6 transmits at rate 1/8 while idle and waiting for data. During frame 7, remote station 6 receives a large amount of data to transmit to the cell. At frame 8, remote station 6 transmit to the cell the queue size and the total transmit power available to remote station 6. At frame 10, channel scheduler 12 receives the information from selector element 14 and collects other information pertaining to the status of the network (e.g. the reverse link capacity available for each cell in the network). At frame 11, channel scheduler 12 assigns the maximum scheduled transmission rates and conveys the schedule to the cell. In this example, channel scheduler 12 assigns a maximum scheduled transmission rate four times the rate of the maximum unscheduled transmission rate (rate 4). At frame 12, the cell transmits the scheduling information to remote station 6 over the forward link. During frames 8 through 13, remote station 6 continues to transmit data at rate 1 and brings the backlog down to 26 code channel frames. During frame 13, remote station 6 receives the scheduling information and configures its hardware to transmit data at the high speed transmission rate. The high speed data transmission occurs at the maximum scheduled transmission rate (rate 4) at frames 14 through 19.
During frame 19, remote station 6 realizes that the queue is nearly empty and that a transmission rate of 2 is needed to transmit the remaining data at frame 20. At frame 20, remote station 6 transmits the rate reduction message to the cell indicating the intention to transmit at the lower transmission rate. Also at frame 20, remote station 6 transmits the two remaining code channel frames at the lower transmission rate.
Realizing that the queue is empty, at frame 21, remote station 6 request termination of transmission at the maximum scheduled transmission rate (rate 4). At frame 21, having transmitted all the data, remote station 6 transmits at rate 1/8 at frame 21 while idle and waiting for more data.
The above example shows that there is seven frames of processing delay between the time the data is made available to remote station 6 (at frame 7 in FIG. 11) and the time of data transmission at the high speed transmission rate (at frame 14 in FIG. 11). The example also illustrates that the transmission rate can be reduced by remote station 6 at each frame such that the reverse link is fully utilized at each frame.
XI. Priority Assignment
In order to optimize utilization of the reverse link, the maximum scheduled transmission rates for the scheduled tasks are assigned to remote stations 6 in accordance with the priority of remote stations 6. The reverse link capacity is assigned first to remote station 6 having the highest priority and last to remote station 6 having the lowest priority. Numerous factors can be used to determine the priority of remote station 6. The following discussion details an exemplary list of some of the factors which can be considered in assigning priority. Other factors can also be considered and are within the scope of the present invention.
An important factor in determining priority among remote stations 6 is the Et,/(N0+I0) required by remote station 6. Remote station 6 which requires higher Eb/(N0+I0) for the requisite level of performance consumes more capacity than remote station 6 which requires a lower ED/(N0+I0). In fact, for a given reverse link capacity, the symbol rate which can be transmitted by remote station 6 is inversely proportional to the required Eb/(N0+I0). As an example, the reverse link capacity which supports data transmission at 38.4Kbps by the first remote station 6 only supports data transmission at 9.6Kbps by the second remote station 6 (1/4 the symbol rate) if the required ED/(N0+I0) of the second remote station 6 is approximately
6dB more than that of the first remote station 6. Therefore, it is preferable to allow remote station 6 which requires a lower Eb/(N0+I0) to transmit first because less capacity is consumed.
Remote station 6 can be in soft handoff with multiple cells. Remote station 6 in soft handoff consumes more capacity because multiple cells support remote station 6 simultaneously. Therefore, higher throughput on the reverse link is obtained by assigning a low priority to remote station 6 which is in soft handoff. Also, remote station 6 in soft handoff is typically located near the edge of the cell and requires more transmit power for the same energy-per-bit at the cell. Channel scheduler 12 can also consider the transmit energy-per-bit required by remote station 6 to transmit to the cell. The transmit power of remote station 6 is typically limited and the reverse link rate scheduling can attempt to conserve the battery power to prolong the operating life of remote station 6.
The optimal assignment of the maximum scheduled transmission rate is also dependent on the amount of data to be transmitted by remote station 6. The data to be transmitted is stored in a queue located within remote station 6. Thus, the size of the queue is indicative of the amount of data to be transmitted. At the start of each scheduling interval, the queue size of all scheduled tasks is sent to channel scheduler 12. If the queue size of a scheduled task is small, channel scheduler 12 removes the task from the rate scheduling routine. Transmission of a small amount of data can be completed within a satisfactory time period over the reverse link at or below the maximum unscheduled transmission rate. Channel scheduler 12 only assigns the high speed transmission rate, when necessary, for transmission of large amounts of data. Thus, the maximum scheduled transmission rate assigned to each remote station 6 can be approximately proportional to the queue size of the data to be transmitted. The type of data to be transmitted is another important consideration in assigning priority among remote stations 6. Some data types are time sensitive and require quick attention. Other data types can tolerate longer delay in transmission. Obviously, higher priority is assigned to data that is time critical. As an example, inevitably, some of the transmitted data are received in error by the cell. The cell is able to determine a frame error by the use of the CRC bits appended to the code channel frames. Upon determination that a code channel frame has been received in error, the error indicator bit for that code channel frame is flagged and the cell informs remote station 6 of the frame error. Channel scheduler 12 then schedules the retransmission of the code channel frames received in error or remote station 6 can retransmit and inform the cell. At the cell, other signal processing may be dependent on the code channel frames received in error. Therefore, channel scheduler 12 or remote station 6 can place a higher priority on data being retransmitted than data being transmitted for the first time.
Conversely, repeated frame error indications by the cell can indicate that the reverse link is impaired. Therefore, allocating the reverse link capacity for repeated retransmission of the code channel frames received in error is wasteful. In this case, remote station 6 can be temporarily placed in the hold state or assigned a lower transmission rate. In the hold state, data transmission at the high speed transmission rate can be suspended until the reverse link condition improves. Remote station 6 can still transmit data at or below the maximum unscheduled transmission rate and the cell can continue to monitor the performance of the reverse link. Upon receiving indications that the reverse link condition has improved, channel scheduler
12 removes remote station 6 from the hold state and directs remote station 6 to resume high speed data transmission to the cell.
In assigning priority among remote stations 6, it may be desirable to distinguish remote stations 6 according to the type of data service being provided to remote stations 6. For example, a pricing structure can be established for different data transmission services. Higher priority is given to those services for which a premium price is charged. Through the pricing structure, the user on each remote station 6 can determine, individually, the priority and, therefore, the type of service the user can enjoy.
The priority of remote station 6 can also be made a function of the amount of delay already experienced by remote station 6. The available reverse link capacity is assigned first to remote station 6 having the highest priority. Consequently, remote station 6 having a low priority typically experiences longer transmission delay. As the amount of delay experienced by the low priority remote station 6 increases, the priority of remote station 6 can be upgraded. This prevents the data to be transmitted by the low priority remote station 6 from remaining in the queue state indefinitely. Without the priority upgrade, the low priority remote station 6 can suffer an intolerable amount of delay. The priority upgrade can be incremented in a manner such that a high quality communication of the scheduled and unscheduled tasks is achieved, while the system goals are maintained.
The factors are given different weights, depending on the set of system goals being optimized. As an example, to optimize the throughput on the reverse link, greater weight is given to the '&D/( N0+I0) required by remote station 6 and whether remote station 6 is in soft handoff. This weighting scheme does not take into account data types and the priority of remote stations 6, thereby not addressing the system goal of fairness. An exemplary equation which assigns priority based on the FER, the prediction of the required Eb/( N0+I0), and soft handoff can be expressed as :
where is the priority of the i-th remote station 6, L is the number of cells supporting remote station 6 in soft handoff, Pe is the FER, and γj is the set point of remote station 6 which is a prediction of the required Et,/( N0+I0). In this example, a lower value for is equated to a higher priority. Other equations with different weighing factors can be contemplated and are within the scope of the present invention.
Alternately, a pricing structure can be maintained which allows the user on each remote station 6 to determine, individually, the priority of remote station 6. The willingness to pay a premium fee for the capacity indicates a higher level of importance. In this case, a system which attempts to maximize revenue and customer satisfaction allows the premium remote station 6 to transmit first, even though the transmission requires more capacity. Other weighting schemes can also be generated using the factors listed above, plus other factors not discussed, to achieve any set of system goals, and are within the scope of the present invention.
The previous description of the preferred embodiments is provided to enable any person skilled in the art to make or use the present invention. The various modifications to these embodiments will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other embodiments without the use of the inventive faculty. 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.
WE CLAIM:

Claims

1. A method for scheduling data transmissions on a reverse link in a communication network comprising at least one cell and at least one scheduled user, said method comprising the steps of : determining a reverse link capacity available for each of said at least one cell; assigning an assigned transmission rate to each of said at least one scheduled user; and sending said assigned transmission rate to said at least one scheduled user; wherein said assigned transmission rate is based on said reverse link capacity available for each of said at least one cell.
2. The method of claim 1 wherein said determining step, said assigning step, and said sending step are repeated every K frames, wherein K is an integer greater than or equal to one.
3. The method of claim 1 wherein said assigning step further comprises the step of : determining an active member set for each of said at least one scheduled user, said active member set containing at least one cell in communication with said scheduled user; wherein said assigned transmission rate is further based on said reverse link capacity available for each of said at least one cell in said active member set.
4. The method of claim 3 wherein said assigning step further comprises the step of : receiving a queue size from each of said least one scheduled user, said queue size being determinative of an amount of data to be transmitted by each of said at least one scheduled user; wherein said assigned transmission rate is further based on said queue size from each of said at least one scheduled user.
5. The method of claim 4 wherein said assigning step further comprises the step of : creating a priority list of scheduled users, said priority list containing each of said at least one scheduled user, wherein each of said least one scheduled user is assigned a priority; wherein said assigned transmission rate is further based on said priority of each of said at least one scheduled user.
6. The method of claim 5 wherein said assigning step further comprises the steps of : selecting a selected user from said priority list of scheduled users, said selected user having a highest priority among said at least one scheduled user in said priority list; calculating a maximum supportable transmission rate for said selected user by each of said at least one cell in said active member set of said selected user; selecting a minimum transmission rate from said maximum supportable transmission rates, said minimum transmission rate being defined as a maximum transmission rate; and wherein said assigned transmission rate is at or below said maximum transmission rate.
7. The method of claim 6 wherein said assigning step further comprises the step of : recommending a preferred transmission rate, said preferred transmission rate being based on said queue size of said selected user; wherein said assigned transmission rate is at or below said preferred transmission rate.
8. The method of claim 7 wherein said assigning step further comprises the steps of : updating said reverse link capacity available for each of said at least one cell in said active member set of said selected user to reflect a capacity allocated to said selected user; and removing said selected user from said priority list.
9. The method of claim 2 further comprising the step of : reassigning said assigned transmission rate of zero or more of said at least one scheduled user to a temporary transmission rate, wherein said temporary transmission rate is dependent on said reverse link capacity available for each of said at least one cell.
10. The method of claim 9 wherein said reassigning step further comprises the steps of : creating a temporary cell list of affected cells from said at least one cell in the communication network, said affected cells having inadequate transmit power to transmit data to said at least one scheduled user.
11. The method of claim 10 wherein said reassigning step further comprises the steps of : creating a temporary priority list of affected scheduled users, said affected scheduled users comprising of said at least one scheduled user in the communication network.
12. The method of claim 11 wherein said reassigning step further comprises the steps of : selecting an affected scheduled user from said temporary priority list of affected scheduled users, said selected affected scheduled user having a highest priority among said at least one scheduled user in said temporary priority list; calculating a maximum temporary supportable transmission rate for said selected affected scheduled user by one or more of said at least one cell in said active member set of said selected affected scheduled user; and selecting a minimum transmission rate from said maximum temporary supportable transmission rates, said minimum transmission rate being defined as a maximum temporary transmission rate; wherein said temporary transmission rate is at or below said maximum temporary transmission rate and said assigned transmission rate.
13. The method of claim 12 wherein said reassigning step further comprises the steps of : updating said forward link capacity available for one or more of said at least one cell in said active member set of said selected affected scheduled user to reflect a capacity allocated to said selected affected scheduled user; and removing said selected affected scheduled user from said priority list.
14. An apparatus for scheduling data transmission on a reverse link in a communication network comprising at least one cell and at least one scheduled user, said apparatus comprising : controller means for collecting a status information for said communication network and for scheduling data transmissions from said at least one cell to said at least one scheduled user; memory means connected to said controller means for storing said status information; and timing means connected to said controller means for providing timing signals to said controller means, said timing signals enable said controller means to perform scheduling of data transmission.
15. A system in which communication is controlled by scheduling selected data for transfer between one or more bases and a plurality of independent remotes each having individual communication requirements, which transfer is scheduled depending on the individual requirements of the remotes and communication resources available in the one or more bases.
EP98919748A 1997-04-08 1998-04-07 Method of scheduling data transmissions in a communication network Expired - Lifetime EP0974237B1 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
EP06118019A EP1713288B1 (en) 1997-04-08 1998-04-07 Method for scheduling data transmission in a wireless communication network

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
US08/835,632 US5914950A (en) 1997-04-08 1997-04-08 Method and apparatus for reverse link rate scheduling
US835632 1997-04-08
PCT/US1998/007302 WO1998045966A2 (en) 1997-04-08 1998-04-07 Method of and apparatus for scheduling data transmissions in a communication network

Related Child Applications (1)

Application Number Title Priority Date Filing Date
EP06118019A Division EP1713288B1 (en) 1997-04-08 1998-04-07 Method for scheduling data transmission in a wireless communication network

Publications (2)

Publication Number Publication Date
EP0974237A2 true EP0974237A2 (en) 2000-01-26
EP0974237B1 EP0974237B1 (en) 2006-08-02

Family

ID=25270033

Family Applications (2)

Application Number Title Priority Date Filing Date
EP06118019A Expired - Lifetime EP1713288B1 (en) 1997-04-08 1998-04-07 Method for scheduling data transmission in a wireless communication network
EP98919748A Expired - Lifetime EP0974237B1 (en) 1997-04-08 1998-04-07 Method of scheduling data transmissions in a communication network

Family Applications Before (1)

Application Number Title Priority Date Filing Date
EP06118019A Expired - Lifetime EP1713288B1 (en) 1997-04-08 1998-04-07 Method for scheduling data transmission in a wireless communication network

Country Status (13)

Country Link
US (1) US5914950A (en)
EP (2) EP1713288B1 (en)
JP (1) JP4201845B2 (en)
KR (1) KR100728999B1 (en)
CN (1) CN1141850C (en)
AR (1) AR012394A1 (en)
AT (1) ATE335366T1 (en)
AU (1) AU7246698A (en)
DE (1) DE69835423T2 (en)
HK (1) HK1025707A1 (en)
TW (1) TW391099B (en)
WO (1) WO1998045966A2 (en)
ZA (1) ZA982973B (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7941152B2 (en) 2001-12-04 2011-05-10 Qualcomm, Incorporated Method and apparatus for a reverse link supplemental channel scheduling

Families Citing this family (279)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6850540B1 (en) 1999-10-28 2005-02-01 Telefonaktiebolaget Lm Ericsson (Publ) Packet scheduling in a communications system
JP3063859B2 (en) * 1996-01-08 2000-07-12 インターナシヨナル・ビジネス・マシーンズ・コーポレーシヨン Method and file server for delivering multimedia files
US6678311B2 (en) 1996-05-28 2004-01-13 Qualcomm Incorporated High data CDMA wireless communication system using variable sized channel codes
US6173007B1 (en) * 1997-01-15 2001-01-09 Qualcomm Inc. High-data-rate supplemental channel for CDMA telecommunications system
US6075792A (en) 1997-06-16 2000-06-13 Interdigital Technology Corporation CDMA communication system which selectively allocates bandwidth upon demand
US6542481B2 (en) * 1998-06-01 2003-04-01 Tantivy Communications, Inc. Dynamic bandwidth allocation for multiple access communication using session queues
US6151332A (en) 1997-06-20 2000-11-21 Tantivy Communications, Inc. Protocol conversion and bandwidth reduction technique providing multiple nB+D ISDN basic rate interface links over a wireless code division multiple access communication system
US6081536A (en) * 1997-06-20 2000-06-27 Tantivy Communications, Inc. Dynamic bandwidth allocation to transmit a wireless protocol across a code division multiple access (CDMA) radio link
US6397251B1 (en) * 1997-09-02 2002-05-28 International Business Machines Corporation File server for multimedia file distribution
US6130879A (en) * 1997-09-22 2000-10-10 Integrated Telecom Express Access and setup process for end-to-end data and analog voice connections
US5990806A (en) * 1997-10-08 1999-11-23 Motorola Method and apparatus for efficient reverse channel utilization in a two-way messaging system
US9118387B2 (en) * 1997-11-03 2015-08-25 Qualcomm Incorporated Pilot reference transmission for a wireless communication system
US7184426B2 (en) * 2002-12-12 2007-02-27 Qualcomm, Incorporated Method and apparatus for burst pilot for a time division multiplex system
CN1244243C (en) * 1997-12-10 2006-03-01 三菱电机株式会社 Base station, mobile statino and communication controller for controlling commkunication between them
US7496072B2 (en) 1997-12-17 2009-02-24 Interdigital Technology Corporation System and method for controlling signal strength over a reverse link of a CDMA wireless communication system
US20040160910A1 (en) * 1997-12-17 2004-08-19 Tantivy Communications, Inc. Dynamic bandwidth allocation to transmit a wireless protocol across a code division multiple access (CDMA) radio link
US9525923B2 (en) 1997-12-17 2016-12-20 Intel Corporation Multi-detection of heartbeat to reduce error probability
US7394791B2 (en) 1997-12-17 2008-07-01 Interdigital Technology Corporation Multi-detection of heartbeat to reduce error probability
US6222832B1 (en) 1998-06-01 2001-04-24 Tantivy Communications, Inc. Fast Acquisition of traffic channels for a highly variable data rate reverse link of a CDMA wireless communication system
US7936728B2 (en) 1997-12-17 2011-05-03 Tantivy Communications, Inc. System and method for maintaining timing of synchronization messages over a reverse link of a CDMA wireless communication system
US6393008B1 (en) * 1997-12-23 2002-05-21 Nokia Movile Phones Ltd. Control structures for contention-based packet data services in wideband CDMA
US6125136A (en) * 1997-12-31 2000-09-26 Sony Corporation Method and apparatus for demodulating trellis coded direct sequence spread spectrum communication signals
US6289004B1 (en) * 1998-03-12 2001-09-11 Interdigital Technology Corporation Adaptive cancellation of fixed interferers
US7221664B2 (en) * 1998-06-01 2007-05-22 Interdigital Technology Corporation Transmittal of heartbeat signal at a lower level than heartbeat request
US7773566B2 (en) 1998-06-01 2010-08-10 Tantivy Communications, Inc. System and method for maintaining timing of synchronization messages over a reverse link of a CDMA wireless communication system
US8134980B2 (en) 1998-06-01 2012-03-13 Ipr Licensing, Inc. Transmittal of heartbeat signal at a lower level than heartbeat request
US6295450B1 (en) * 1998-06-23 2001-09-25 Motorola, Inc. Method and apparatus for transferring communication within a communication system
JP2000022628A (en) * 1998-07-01 2000-01-21 Matsushita Electric Ind Co Ltd Communication method and communication system
US6597705B1 (en) * 1998-09-10 2003-07-22 Qualcomm Incorporated Method and apparatus for distributed optimal reverse link scheduling of resources, such as a rate and power in a wireless communication system
JP3679933B2 (en) * 1998-09-21 2005-08-03 株式会社東芝 Communication terminal device and communication speed switching method thereof
US6697378B1 (en) 1998-10-16 2004-02-24 Cisco Technology, Inc. Method and apparatus for class based transmission control of data connections based on real-time external feedback estimates obtained using messaging from a wireless network
US6690652B1 (en) * 1998-10-26 2004-02-10 International Business Machines Corporation Adaptive power control in wideband CDMA cellular systems (WCDMA) and methods of operation
US6421335B1 (en) 1998-10-26 2002-07-16 Nokia Telecommunications, Oy CDMA communication system and method using priority-based SIMA quality of service class
US6804251B1 (en) * 1998-11-12 2004-10-12 Broadcom Corporation System and method for multiplexing data from multiple sources
EP1003302A3 (en) * 1998-11-20 2001-12-12 Nec Corporation Data packet multi-access communicating method and transmitting and receiving apparatus therefor
KR100315670B1 (en) * 1998-12-07 2001-11-29 윤종용 Apparatus and method for gating transmission of cdma communication system
FI107772B (en) 1998-12-16 2001-09-28 Nokia Networks Oy Method and system for limiting the quality of data transmission service
JP2002534842A (en) * 1998-12-23 2002-10-15 ノキア・ワイヤレス・ルーターズ・インコーポレーテッド Unified routing scheme for ad hoc internetworking
US6134226A (en) * 1998-12-31 2000-10-17 Motorola, Inc. Method and system for allocating a system resource to subscribers of a wireless communications system
US7406098B2 (en) 1999-01-13 2008-07-29 Qualcomm Incorporated Resource allocation in a communication system supporting application flows having quality of service requirements
US6393012B1 (en) * 1999-01-13 2002-05-21 Qualcomm Inc. System for allocating resources in a communication system
US6229795B1 (en) 1999-01-13 2001-05-08 Qualcomm Incorporated System for allocating resources in a communication system
US6721349B1 (en) 1999-01-28 2004-04-13 Qualcomm Incorporated Method and apparatus for reducing peak-to-average ratio in a CDMA communication system
AU3589100A (en) * 1999-02-08 2000-08-25 Qualcomm Incorporated Speech synthesizer based on variable rate speech coding
US6522628B1 (en) * 1999-03-01 2003-02-18 Cisco Technology, Inc. Method and system for managing transmission resources in a wireless communication network
EP1033846A1 (en) * 1999-03-01 2000-09-06 Alcatel Process for controlling uplink packet transmission in a wireless communication network
EP1033849A1 (en) * 1999-03-01 2000-09-06 Alcatel Process for controlling access to radio resource for uplink packet transmission in a wireless communication network
US7200110B1 (en) * 1999-03-24 2007-04-03 Alcatel Canada Inc. Method and apparatus for prioritized release of connections in a communications network
US6654808B1 (en) * 1999-04-02 2003-11-25 Lucent Technologies Inc. Proving quality of service in layer two tunneling protocol networks
US6567420B1 (en) 1999-04-15 2003-05-20 Qualcomm, Incorporated Method and apparatus for high rate channel access control
US6614776B1 (en) * 1999-04-28 2003-09-02 Tantivy Communications, Inc. Forward error correction scheme for high rate data exchange in a wireless system
US7009996B1 (en) * 1999-05-20 2006-03-07 Honeywell Inc. Method and system for transmitting periodic and aperiodic data over a critical avionics databus
US6907243B1 (en) 1999-06-09 2005-06-14 Cisco Technology, Inc. Method and system for dynamic soft handoff resource allocation in a wireless network
US6556549B1 (en) * 1999-07-02 2003-04-29 Qualcomm Incorporated Method and apparatus for signal combining in a high data rate communication system
DE69925260T2 (en) * 1999-07-08 2005-10-06 Siemens Ag Mobile data communication system with subscription-based quality of service
AU5037799A (en) 1999-07-14 2001-02-05 Nokia Corporation Prioritized sending of data
JP3419355B2 (en) * 1999-08-10 2003-06-23 日本電気株式会社 Scheduling control device and method
ATE210905T1 (en) * 1999-08-16 2001-12-15 Cit Alcatel METHOD FOR REPORTING TRANSMIT POWER IN A VARIABLE BIT RATE RADIO COMMUNICATIONS SYSTEM
US8064409B1 (en) 1999-08-25 2011-11-22 Qualcomm Incorporated Method and apparatus using a multi-carrier forward link in a wireless communication system
US6606357B1 (en) 1999-09-10 2003-08-12 Harris Corporation Carrier injecting waveform-based modulation scheme for reducing satellite transponder power requirements and earth terminal antenna size
US6717926B1 (en) * 1999-09-13 2004-04-06 Nokia Corporation Apparatus and associated method, by which to transmit beacon signals in a radio communication system
US6526034B1 (en) * 1999-09-21 2003-02-25 Tantivy Communications, Inc. Dual mode subscriber unit for short range, high rate and long range, lower rate data communications
KR100585832B1 (en) * 1999-09-30 2006-06-01 에스케이 텔레콤주식회사 Apparatus and method for expanding channels in CDMA system
US6885868B1 (en) * 1999-09-30 2005-04-26 Nortel Networks Limited Fair packet scheduler and scheduling method for packet data radio
US6621804B1 (en) 1999-10-07 2003-09-16 Qualcomm Incorporated Method and apparatus for predicting favored supplemental channel transmission slots using transmission power measurements of a fundamental channel
GB2355623B (en) * 1999-10-19 2003-07-16 Ericsson Telefon Ab L M Packet transmission in a UMTS network
DE19951797C2 (en) * 1999-10-27 2002-04-18 Siemens Ag Procedure for the dynamic allocation of resources in a digital radio communication system
US7333495B2 (en) * 1999-10-27 2008-02-19 Broadcom Corporation Method for scheduling upstream communications
US8463255B2 (en) * 1999-12-20 2013-06-11 Ipr Licensing, Inc. Method and apparatus for a spectrally compliant cellular communication system
DE60038399T2 (en) * 1999-12-24 2009-04-23 Ntt Docomo Inc. Message distribution method and message information distribution control information device
GB2358552B (en) * 2000-01-19 2003-12-03 Motorola Inc A packet scheduler and method therefor
EP1596621B1 (en) * 2000-01-19 2007-03-07 Lucent Technologies Inc. Radio resource allocation apparatus
GB2358551B (en) * 2000-01-19 2004-01-07 Motorola Ltd A packet scheduler and method therefor
WO2001058044A2 (en) 2000-02-07 2001-08-09 Tantivy Communications, Inc. Minimal maintenance link to support synchronization
US7933249B2 (en) 2000-02-08 2011-04-26 Ipr Licensing, Inc. Grade of service and fairness policy for bandwidth reservation system
GB0004088D0 (en) * 2000-02-21 2000-04-12 Nokia Networks Oy Packet data services in a telecommunications system
US7068624B1 (en) 2000-02-25 2006-06-27 Cisco Technology, Inc. Wireless router and method for processing traffic in a wireless communications network
EP1264445A1 (en) * 2000-02-25 2002-12-11 Telefonaktiebolaget LM Ericsson (publ) Packet scheduling in umts using several calculated transfer rates
US6865185B1 (en) 2000-02-25 2005-03-08 Cisco Technology, Inc. Method and system for queuing traffic in a wireless communications network
US7031266B1 (en) 2000-02-25 2006-04-18 Cisco Technology, Inc. Method and system for configuring wireless routers and networks
US6870816B1 (en) * 2000-03-01 2005-03-22 Motorola, Inc. Self-organizing network with decision engine and method
US6590890B1 (en) * 2000-03-03 2003-07-08 Lucent Technologies Inc. Method of packet scheduling, with improved delay performance, for wireless networks
US6493331B1 (en) 2000-03-30 2002-12-10 Qualcomm Incorporated Method and apparatus for controlling transmissions of a communications systems
SE518904C2 (en) * 2000-04-05 2002-12-03 Telia Ab Method and apparatus for telecommunication systems
US8903737B2 (en) * 2000-04-25 2014-12-02 Accenture Global Service Limited Method and system for a wireless universal mobile product interface
DE60029485T2 (en) 2000-05-17 2007-02-22 Qualcomm, Inc., San Diego METHOD AND DEVICE FOR MODIFYING THE TRANSMISSION RATE OF COMMUNICATION CHANNELS
KR100383572B1 (en) * 2000-06-28 2003-05-14 삼성전자주식회사 Reverse data transmission method and apparatus in mobile communication system
KR100387057B1 (en) * 2000-07-04 2003-06-12 삼성전자주식회사 Method and apparatus for determining reverse data rate in mobile communication system
JP3664054B2 (en) * 2000-07-25 2005-06-22 日本電気株式会社 Communications system
US6856954B1 (en) * 2000-07-28 2005-02-15 Mindspeed Technologies, Inc. Flexible variable rate vocoder for wireless communication systems
CA2351968A1 (en) * 2000-08-11 2002-02-11 Lucent Technologies Inc. Adaptive data scheduling using neighboring base station load information for tdma systems
US7142867B1 (en) * 2000-09-15 2006-11-28 Lucent Technologies Inc. Method of determining transmission rate from a mobile station to a base station in a wireless communication system
US6694147B1 (en) * 2000-09-15 2004-02-17 Flarion Technologies, Inc. Methods and apparatus for transmitting information between a basestation and multiple mobile stations
WO2002025867A2 (en) * 2000-09-25 2002-03-28 Telefonaktiebolaget Lm Ericsson (Publ) Dynamic control of packet data service throughput by radio access control node
US6745044B1 (en) * 2000-09-29 2004-06-01 Qualcomm Incorporated Method and apparatus for determining available transmit power in a wireless communication system
JP3788902B2 (en) * 2000-10-02 2006-06-21 株式会社エヌ・ティ・ティ・ドコモ Radio resource allocation method and communication apparatus
US6973098B1 (en) 2000-10-25 2005-12-06 Qualcomm, Incorporated Method and apparatus for determining a data rate in a high rate packet data wireless communications system
US7068683B1 (en) * 2000-10-25 2006-06-27 Qualcomm, Incorporated Method and apparatus for high rate packet data and low delay data transmissions
US8111689B2 (en) 2001-01-16 2012-02-07 Nokia Corporation System for uplink scheduling packet based data traffic in wireless system
AU2002214309A1 (en) * 2000-11-16 2002-05-27 Sony Corporation Information processing apparatus and communication apparatus
EP1209940A1 (en) * 2000-11-22 2002-05-29 Lucent Technologies Inc. Method and system for UMTS packet transmission scheduling on uplink channels
US7454222B2 (en) * 2000-11-22 2008-11-18 Dragonwave, Inc. Apparatus and method for controlling wireless communication signals
US7437654B2 (en) * 2000-11-29 2008-10-14 Lucent Technologies Inc. Sub-packet adaptation in a wireless communication system
US6847629B2 (en) * 2000-11-30 2005-01-25 Qualcomm Incorporated Method and apparatus for scheduling packet data transmissions in a wireless communication system
US8155096B1 (en) 2000-12-01 2012-04-10 Ipr Licensing Inc. Antenna control system and method
US6930981B2 (en) * 2000-12-06 2005-08-16 Lucent Technologies Inc. Method for data rate selection in a wireless communication system
US6944175B2 (en) * 2000-12-07 2005-09-13 Nortel Networks Limited Method and apparatus for scheduling forward link data transmissions in CDMA/HDR networks
US20020071405A1 (en) * 2000-12-08 2002-06-13 Kelley Paul H. Priority channel scanning method and apparatus
US8009667B1 (en) 2001-01-16 2011-08-30 Wi—LAN, Inc. Packing source data packets into transporting packets with fragmentation
US6954448B2 (en) 2001-02-01 2005-10-11 Ipr Licensing, Inc. Alternate channel for carrying selected message types
US7551663B1 (en) 2001-02-01 2009-06-23 Ipr Licensing, Inc. Use of correlation combination to achieve channel detection
WO2002063810A1 (en) * 2001-02-06 2002-08-15 Harris Corporation System and method for real time adaptive capacity scheduling
US7006483B2 (en) * 2001-02-23 2006-02-28 Ipr Licensing, Inc. Qualifying available reverse link coding rates from access channel power setting
US7006466B2 (en) * 2001-03-09 2006-02-28 Lucent Technologies Inc. Dynamic rate control methods and apparatus for scheduling data transmissions in a communication network
US6760576B2 (en) * 2001-03-27 2004-07-06 Qualcomm Incorporated Method and apparatus for enhanced rate determination in high data rate wireless communication systems
CA2376962A1 (en) * 2001-04-02 2002-10-02 Lucent Technologies Inc. Method and system for umts packet transmission scheduling on uplink channels
US6940824B2 (en) * 2001-04-05 2005-09-06 Ntt Docomo, Inc. Slot assignment algorithm
US6657980B2 (en) 2001-04-12 2003-12-02 Qualcomm Incorporated Method and apparatus for scheduling packet data transmissions in a wireless communication system
US6996415B2 (en) 2001-04-20 2006-02-07 Lg Electronics Inc. System and method for transmitting data on a reverse link channel
US7042856B2 (en) 2001-05-03 2006-05-09 Qualcomm, Incorporation Method and apparatus for controlling uplink transmissions of a wireless communication system
KR100493084B1 (en) * 2001-05-04 2005-06-03 삼성전자주식회사 The initial transmission apparatus and method for multimedia services in wireless communication system
US7158504B2 (en) * 2001-05-21 2007-01-02 Lucent Technologies, Inc. Multiple mode data communication system and method and forward and/or reverse link control channel structure
JP3668437B2 (en) * 2001-05-24 2005-07-06 松下電器産業株式会社 Base station apparatus, radio communication system, and packet communication method
WO2002100048A1 (en) * 2001-06-05 2002-12-12 Nortel Networks Limited Multiple threshold scheduler for scheduling transmission of data packets to mobile terminals based on a relative throughput spread
KR100665077B1 (en) 2001-06-13 2007-01-09 탄티비 커뮤니케이션즈 인코포레이티드 Transmittal of heartbeat signal at a lower level than heartbeat request
US7489655B2 (en) * 2001-07-06 2009-02-10 Qualcomm, Incorporated Method and apparatus for predictive scheduling in a bi-directional communication system
US6904286B1 (en) 2001-07-18 2005-06-07 Cisco Technology, Inc. Method and system of integrated rate control for a traffic flow across wireline and wireless networks
US7697447B2 (en) * 2001-08-10 2010-04-13 Motorola Inc. Control of jitter buffer size and depth
US6819935B2 (en) * 2001-08-31 2004-11-16 Nokia Corporation Apparatus, and associated method, for facilitating selection of power levels at which to communicate data in a radio communication system
US20030065809A1 (en) * 2001-10-03 2003-04-03 Adc Telecommunications, Inc. Scheduling downstream transmissions
US6747994B2 (en) * 2001-10-17 2004-06-08 Qualcomm, Incorporated Selecting optimal transmit formats for transmissions over allocated time durations
US6788687B2 (en) 2001-10-30 2004-09-07 Qualcomm Incorporated Method and apparatus for scheduling packet data transmissions in a wireless communication system
US7245600B2 (en) 2001-11-05 2007-07-17 Qualcomm, Inc. Method and apparatus for determining reverse link load level for reverse link data scheduling in a CDMA communication system
US7453801B2 (en) 2001-11-08 2008-11-18 Qualcomm Incorporated Admission control and resource allocation in a communication system supporting application flows having quality of service requirements
JP3967115B2 (en) * 2001-11-22 2007-08-29 株式会社エヌ・ティ・ティ・ドコモ Base station, radio resource control apparatus, terminal apparatus, communication system, and communication method
ATE365435T1 (en) * 2001-12-04 2007-07-15 Nokia Corp RADIO EQUIPMENT MANAGEMENT OF PACKET DATA ON A PORT NUMBER BASIS
US20030135632A1 (en) * 2001-12-13 2003-07-17 Sophie Vrzic Priority scheduler
US7508780B2 (en) * 2002-01-18 2009-03-24 Nortel Networks Limited Method and system for priority-based state transition for high speed data transmission and wireless access networks
US7986672B2 (en) * 2002-02-25 2011-07-26 Qualcomm Incorporated Method and apparatus for channel quality feedback in a wireless communication
US7463616B1 (en) * 2002-03-28 2008-12-09 Nortel Networks Limited Scheduling based on channel change indicia
US8009607B2 (en) * 2002-04-24 2011-08-30 Telefonaktiebolaget Lm Ericsson (Publ) Method and apparatus for uplink transmission timing in a mobile communications system
US7171479B2 (en) * 2002-04-26 2007-01-30 International Business Machines Corporation Efficient delivery of boot code images from a network server
US7684329B2 (en) * 2002-05-06 2010-03-23 Qualcomm Incorporated Method and apparatus for augmenting physical layer ARQ in a wireless data communication system
US7280510B2 (en) * 2002-05-21 2007-10-09 Nortel Networks Limited Controlling reverse channel activity in a wireless communications system
US8504054B2 (en) * 2002-09-10 2013-08-06 Qualcomm Incorporated System and method for multilevel scheduling
US7630321B2 (en) 2002-09-10 2009-12-08 Qualcomm Incorporated System and method for rate assignment
US20040062206A1 (en) * 2002-09-30 2004-04-01 Soong Anthony C.K. System and method for fast reverse link scheduling in a wireless communication network
JP4054650B2 (en) 2002-10-03 2008-02-27 株式会社エヌ・ティ・ティ・ドコモ Resource allocation method, and base station, mobile station, and radio packet communication system to which this resource allocation method is applied
US8064325B1 (en) * 2002-10-23 2011-11-22 The Board Of Trustees Of The Leland Stanford Junior University Concurrent frequency-sharing multi-user communication system with rate allocation approach
US8107885B2 (en) 2002-10-30 2012-01-31 Motorola Mobility, Inc. Method and apparatus for providing a distributed architecture digital wireless communication system
AU2002368322A1 (en) * 2002-11-05 2004-06-07 Nokia Corporation Method, device and system for determining a transmission power for arq related re-transmissions
ITTO20021009A1 (en) * 2002-11-20 2004-05-21 Telecom Italia Lab Spa PROCEDURE, SYSTEM AND IT PRODUCT FOR THE
US7602722B2 (en) * 2002-12-04 2009-10-13 Nortel Networks Limited Mobile assisted fast scheduling for the reverse link
TWI333754B (en) 2002-12-20 2010-11-21 Interdigital Tech Corp Scheduling data transmission by medium access control (mac) layer in a mobile network
AU2003292638A1 (en) * 2002-12-27 2004-07-29 Matsushita Electric Industrial Co., Ltd. Base station device and communication terminal device
US8165148B2 (en) * 2003-01-13 2012-04-24 Qualcomm Incorporated System and method for rate assignment
US8218573B2 (en) 2003-01-21 2012-07-10 Qualcomm Incorporated Power boosting in a wireless communication system
US20040156367A1 (en) * 2003-02-11 2004-08-12 Magis Networks, Inc. Hierarchically distributed scheduling apparatus and method
US8081598B2 (en) 2003-02-18 2011-12-20 Qualcomm Incorporated Outer-loop power control for wireless communication systems
US7286846B2 (en) * 2003-02-18 2007-10-23 Qualcomm, Incorporated Systems and methods for performing outer loop power control in wireless communication systems
US8150407B2 (en) * 2003-02-18 2012-04-03 Qualcomm Incorporated System and method for scheduling transmissions in a wireless communication system
US7155236B2 (en) 2003-02-18 2006-12-26 Qualcomm Incorporated Scheduled and autonomous transmission and acknowledgement
US8391249B2 (en) * 2003-02-18 2013-03-05 Qualcomm Incorporated Code division multiplexing commands on a code division multiplexed channel
RU2368106C2 (en) * 2003-02-18 2009-09-20 Квэлкомм Инкорпорейтед Planned and autonomous transmission and receipt confirmation
US8023950B2 (en) 2003-02-18 2011-09-20 Qualcomm Incorporated Systems and methods for using selectable frame durations in a wireless communication system
UA89162C2 (en) * 2003-02-18 2010-01-11 Квелкомм Инкорпорейтед Multiplexing commands with code division in a multiplexing channel with code division
US7660282B2 (en) * 2003-02-18 2010-02-09 Qualcomm Incorporated Congestion control in a wireless data network
US20040160922A1 (en) 2003-02-18 2004-08-19 Sanjiv Nanda Method and apparatus for controlling data rate of a reverse link in a communication system
US9544860B2 (en) 2003-02-24 2017-01-10 Qualcomm Incorporated Pilot signals for use in multi-sector cells
US8811348B2 (en) 2003-02-24 2014-08-19 Qualcomm Incorporated Methods and apparatus for generating, communicating, and/or using information relating to self-noise
US9661519B2 (en) 2003-02-24 2017-05-23 Qualcomm Incorporated Efficient reporting of information in a wireless communication system
US7218948B2 (en) 2003-02-24 2007-05-15 Qualcomm Incorporated Method of transmitting pilot tones in a multi-sector cell, including null pilot tones, for generating channel quality indicators
CN101616477A (en) * 2003-03-05 2009-12-30 三星电子株式会社 The method and the device of control reverse traffic rate in the mobile communication system
US8254358B2 (en) 2003-03-06 2012-08-28 Ericsson Ab Communicating a broadcast message to change data rates of mobile stations
US7142548B2 (en) * 2003-03-06 2006-11-28 Nortel Networks Limited Communicating in a reverse wireless link information relating to buffer status and data rate of a mobile station
US7551588B2 (en) * 2003-03-06 2009-06-23 Nortel Networks Limited Autonomous mode transmission from a mobile station
US7215930B2 (en) 2003-03-06 2007-05-08 Qualcomm, Incorporated Method and apparatus for providing uplink signal-to-noise ratio (SNR) estimation in a wireless communication
US8705588B2 (en) * 2003-03-06 2014-04-22 Qualcomm Incorporated Systems and methods for using code space in spread-spectrum communications
US7379863B2 (en) * 2003-04-09 2008-05-27 Telefonaktiebolaget Lm Ericsson (Publ) Method and device for reducing scheduling delay in a digital communication system
KR101049103B1 (en) * 2003-05-12 2011-07-14 엘지전자 주식회사 How to determine data rate in mobile communication system
US8477592B2 (en) 2003-05-14 2013-07-02 Qualcomm Incorporated Interference and noise estimation in an OFDM system
US7158796B2 (en) * 2003-06-16 2007-01-02 Qualcomm Incorporated Apparatus, system, and method for autonomously managing reverse link communication resources in a distributed communication system
WO2005004014A2 (en) * 2003-06-30 2005-01-13 Sap Aktiengesellschaft Configurable process scheduling
US8000284B2 (en) * 2003-07-15 2011-08-16 Qualcomm Incorporated Cooperative autonomous and scheduled resource allocation for a distributed communication system
US7933235B2 (en) * 2003-07-15 2011-04-26 Qualcomm Incorporated Multiflow reverse link MAC for a communications system
US6970437B2 (en) 2003-07-15 2005-11-29 Qualcomm Incorporated Reverse link differentiated services for a multiflow communications system using autonomous allocation
US7565152B2 (en) * 2003-07-31 2009-07-21 Alcatel-Lucent Usa Inc. Method of controlling overload over the reverse link
US7126928B2 (en) * 2003-08-05 2006-10-24 Qualcomm Incorporated Grant, acknowledgement, and rate control active sets
US8489949B2 (en) * 2003-08-05 2013-07-16 Qualcomm Incorporated Combining grant, acknowledgement, and rate control commands
US7590099B2 (en) * 2003-09-25 2009-09-15 Qualcomm Incorporated Managing traffic in communications system having dissimilar CDMA channels
GB0323246D0 (en) * 2003-10-03 2003-11-05 Fujitsu Ltd Virtually centralized uplink scheduling
US8483105B2 (en) 2003-10-15 2013-07-09 Qualcomm Incorporated High speed media access control
US8233462B2 (en) 2003-10-15 2012-07-31 Qualcomm Incorporated High speed media access control and direct link protocol
US8462817B2 (en) 2003-10-15 2013-06-11 Qualcomm Incorporated Method, apparatus, and system for multiplexing protocol data units
US9226308B2 (en) 2003-10-15 2015-12-29 Qualcomm Incorporated Method, apparatus, and system for medium access control
GB0326173D0 (en) * 2003-11-10 2003-12-17 Nokia Corp A method and a controlling a connection
JP4784867B2 (en) * 2003-11-10 2011-10-05 エスティー‐エリクソン、ソシエテ、アノニム Method and system for providing service to wireless device operating in power saving mode
US7466669B2 (en) * 2003-11-14 2008-12-16 Telefonaktiebolaget Lm Ericsson (Publ) Reverse link scheduler for CDMA networks
CN100576937C (en) * 2003-11-27 2009-12-30 Ut斯达康(中国)有限公司 Radio channel resource distributes and method of rate control in the code division multiple address communication system
US7215655B2 (en) * 2004-01-09 2007-05-08 Interdigital Technology Corporation Transport format combination selection in a wireless transmit/receive unit
US8903440B2 (en) * 2004-01-29 2014-12-02 Qualcomm Incorporated Distributed hierarchical scheduling in an ad hoc network
JP4012167B2 (en) * 2004-03-31 2007-11-21 株式会社東芝 Wireless communication system
US8259752B2 (en) 2004-05-07 2012-09-04 Interdigital Technology Corporation Medium access control layer architecture for supporting enhanced uplink
US7062228B2 (en) * 2004-05-10 2006-06-13 Harris Corporation Cellular communications system using baseband carrier injection and related methods
FI20045195A0 (en) * 2004-05-27 2004-05-27 Nokia Corp Procedure and arrangement for uplink scheduling
LT1779055T (en) * 2004-07-15 2017-04-10 Cubic Corporation Enhancement of aimpoint in simulated training systems
KR20060006725A (en) * 2004-07-16 2006-01-19 삼성전자주식회사 Method and apparatus for determining autonomous transmission parameters in mobile telecommunication system for enhanced uplink dedicated channel
US7924770B2 (en) * 2004-08-06 2011-04-12 Nokia Corporation Method of controlling communication between two nodes in a communication system
KR101055730B1 (en) * 2004-08-11 2011-08-11 엘지전자 주식회사 Uplink transmit power scheduling method
EP1631104B1 (en) * 2004-08-31 2007-08-08 Matsushita Electric Industrial Co., Ltd. Efficient rise over thermal (RoT) control during soft handover
JP4447416B2 (en) * 2004-09-22 2010-04-07 株式会社エヌ・ティ・ティ・ドコモ Multiband mobile communication system and transmitter
US8503938B2 (en) 2004-10-14 2013-08-06 Qualcomm Incorporated Methods and apparatus for determining, communicating and using information including loading factors which can be used for interference control purposes
MX2007004520A (en) 2004-10-14 2007-09-11 Qualcomm Flarion Tech Methods and apparatus for determining, communicating and using information which can be used for interference control purposes.
US20060092881A1 (en) * 2004-10-14 2006-05-04 Rajiv Laroia Methods and apparatus for determining, communicating and using information which can be used for interference control purposes
FR2880231A1 (en) * 2004-12-24 2006-06-30 France Telecom Cellular mobile telephone network e.g. CDMA network, resource allocating method for mobile telecommunication terminal, involves assigning optimal value of consumed resources for terminals based on function representing consumed resources
EP1848154B1 (en) * 2005-01-11 2011-09-07 NTT DoCoMo, Inc. Transmission rate control method, mobile station and radio network controller
US7848298B2 (en) * 2005-03-08 2010-12-07 Qualcomm Incorporated De-coupling forward and reverse link assignment for multi-carrier wireless communication systems
US7664466B2 (en) 2005-03-22 2010-02-16 Ntt Docomo, Inc. Transmission rate control method, transmission rate control system, and mobile station
WO2006101115A1 (en) * 2005-03-22 2006-09-28 Ntt Docomo, Inc. Transmission rate control method, radio base station, and radio line control station
US20060223447A1 (en) * 2005-03-31 2006-10-05 Ali Masoomzadeh-Fard Adaptive down bias to power changes for controlling random walk
DE602005011101D1 (en) * 2005-04-01 2009-01-02 Panasonic Corp Scheduling of terminals in a radio communication system
KR101084134B1 (en) * 2005-05-03 2011-11-17 엘지전자 주식회사 Method for Transmitting Control Information, in a Mobile Communication System
US20060262719A1 (en) * 2005-05-18 2006-11-23 Binshi Cao Method of blank-and-burst signaling
US7760697B1 (en) * 2005-05-24 2010-07-20 L-3 Communications Corporation Fast and long range node discovery in spread spectrum networks
US7697562B2 (en) * 2005-06-04 2010-04-13 Samsung Electronics Co., Ltd. Apparatus and method for transmitting data in a wireless local area network
US7782895B2 (en) * 2005-08-03 2010-08-24 Nokia Corporation Apparatus, and associated method, for allocating data for communication upon communication channels in a multiple input communication system
JP4684045B2 (en) * 2005-08-30 2011-05-18 株式会社エヌ・ティ・ティ・ドコモ Transmission control method, mobile station, radio base station, and radio network controller
US8600336B2 (en) 2005-09-12 2013-12-03 Qualcomm Incorporated Scheduling with reverse direction grant in wireless communication systems
US8694042B2 (en) 2005-10-14 2014-04-08 Qualcomm Incorporated Method and apparatus for determining a base station's transmission power budget
US9191840B2 (en) 2005-10-14 2015-11-17 Qualcomm Incorporated Methods and apparatus for determining, communicating and using information which can be used for interference control
KR100842609B1 (en) * 2005-11-11 2008-07-01 삼성전자주식회사 Apparatus and method for transmitting/receiving of complex multiplexing in wireless communication system
US20070149132A1 (en) 2005-12-22 2007-06-28 Junyl Li Methods and apparatus related to selecting control channel reporting formats
US9125092B2 (en) 2005-12-22 2015-09-01 Qualcomm Incorporated Methods and apparatus for reporting and/or using control information
US9572179B2 (en) * 2005-12-22 2017-02-14 Qualcomm Incorporated Methods and apparatus for communicating transmission backlog information
US9125093B2 (en) 2005-12-22 2015-09-01 Qualcomm Incorporated Methods and apparatus related to custom control channel reporting formats
US8437251B2 (en) 2005-12-22 2013-05-07 Qualcomm Incorporated Methods and apparatus for communicating transmission backlog information
US9148795B2 (en) 2005-12-22 2015-09-29 Qualcomm Incorporated Methods and apparatus for flexible reporting of control information
US9473265B2 (en) 2005-12-22 2016-10-18 Qualcomm Incorporated Methods and apparatus for communicating information utilizing a plurality of dictionaries
US9451491B2 (en) 2005-12-22 2016-09-20 Qualcomm Incorporated Methods and apparatus relating to generating and transmitting initial and additional control information report sets in a wireless system
US9338767B2 (en) 2005-12-22 2016-05-10 Qualcomm Incorporated Methods and apparatus of implementing and/or using a dedicated control channel
US20070249287A1 (en) * 2005-12-22 2007-10-25 Arnab Das Methods and apparatus for selecting between a plurality of dictionaries
US9119220B2 (en) 2005-12-22 2015-08-25 Qualcomm Incorporated Methods and apparatus for communicating backlog related information
US8514771B2 (en) 2005-12-22 2013-08-20 Qualcomm Incorporated Methods and apparatus for communicating and/or using transmission power information
US9137072B2 (en) 2005-12-22 2015-09-15 Qualcomm Incorporated Methods and apparatus for communicating control information
US8920343B2 (en) 2006-03-23 2014-12-30 Michael Edward Sabatino Apparatus for acquiring and processing of physiological auditory signals
US20070243882A1 (en) 2006-04-12 2007-10-18 Qualcomm Incorporated Method and apparatus for locating a wireless local area network associated with a wireless wide area network
US8700042B2 (en) * 2006-04-21 2014-04-15 Alcatel Lucent Method to control the effects of out-of-cell interference in a wireless cellular system using backhaul transmission of decoded data and formats
US7960518B2 (en) 2006-06-06 2011-06-14 Crucell Holland B.V. Human binding molecules having killing activity against enterococci and uses thereof
AU2007255384B2 (en) * 2006-06-06 2012-09-27 Crucell Holland B.V. Human binding molecules having killing activity against staphylococci and uses thereof
CN101132224B (en) * 2006-08-24 2011-08-10 中兴通讯股份有限公司 Scheduled and unscheduled transmission system in ascending reinforcement system and its signal channel resource configuration method
US9179366B2 (en) * 2006-08-31 2015-11-03 Intel Corporation Scheduling methods and apparatus based on adjusted channel capacity
US9420603B2 (en) * 2006-09-08 2016-08-16 Qualcomm Incorporated Recovery from resource mismatch in a wireless communication system
WO2008056425A1 (en) * 2006-11-10 2008-05-15 Fujitsu Limited Wireless communication system and wireless terminal device
US7852810B1 (en) 2007-01-03 2010-12-14 Sprint Spectrum L.P. Dynamic adjustment of forward-link frame-error-rate (FFER) target
US7813323B1 (en) 2007-06-13 2010-10-12 Sprint Spectrum L.P. Dynamic adjustment of reverse-link frame-error-rate (RFER) target based on reverse-link RF conditions
RU2490795C2 (en) * 2007-06-20 2013-08-20 Нокиа Сименс Нетворкс Ой Method of reporting power reserve
US8670394B2 (en) 2007-08-14 2014-03-11 Qualcomm Incorporated Uplink requests
JP5113500B2 (en) 2007-11-26 2013-01-09 株式会社エヌ・ティ・ティ・ドコモ Transmission rate control method and radio base station
US9084201B2 (en) * 2008-01-25 2015-07-14 Qualcomm Incorporated Power headroom management in wireless communication systems
US8055292B1 (en) * 2008-06-12 2011-11-08 Sprint Spectrum L.P. Method and system for power level adjustment of forward channels
US8107988B1 (en) 2008-07-25 2012-01-31 Sprint Spectrum L.P. Conducting power control based on reverse-link RF conditions
KR101255467B1 (en) * 2008-12-24 2013-04-16 후지쯔 가부시끼가이샤 Network device, communication device, communication control method, and communication control system
US8238861B2 (en) * 2009-01-26 2012-08-07 Qualcomm Incorporated Automatic gain control in a wireless communication network
JP5123434B2 (en) * 2009-06-12 2013-01-23 シャープ株式会社 Wireless communication system, base station, mobile station, base station control program, and mobile station control program
US8477686B1 (en) 2009-09-10 2013-07-02 Sprint Spectrum L.P. Automatic increase of target frame error rate for duration based on call drop timer
US8811200B2 (en) 2009-09-22 2014-08-19 Qualcomm Incorporated Physical layer metrics to support adaptive station-dependent channel state information feedback rate in multi-user communication systems
US8290532B1 (en) 2010-04-19 2012-10-16 Sprint Spectrum L.P. Selectively conducting reverse-link power control and call admission control
US8537700B1 (en) 2010-04-19 2013-09-17 Sprint Spectrum L.P. Identifying and selectively controlling reverse-noise contribution on a per-access-terminal basis
US9813994B2 (en) * 2011-02-16 2017-11-07 Qualcomm, Incorporated Managing transmit power for better frequency re-use in TV white space
US9585025B2 (en) * 2011-02-16 2017-02-28 Qualcomm Incorporated Managing transmit power for better frequency re-use in TV white space
US9301315B1 (en) * 2011-03-09 2016-03-29 Amdocs Software Systems Limited System, method, and computer program for transmitting network communications at a point in time automatically determined based on communication rates
US9504057B2 (en) * 2012-05-11 2016-11-22 Apple Inc. Methods and apparatus for in-device coexistence detection and mitigation
KR102053113B1 (en) 2012-12-28 2020-01-08 에릭슨 엘지 주식회사 Method and apparatus for dynamic scheduling and mobile telecommunication system for the same
US9590716B2 (en) * 2013-04-30 2017-03-07 Intellectual Discovery Co., Ltd. Transmission, reception and system using multiple antennas
CN104349391B (en) * 2013-07-30 2019-02-12 华为终端(东莞)有限公司 A kind of scheduling processing method and device of WiFi working terminal
US10110494B2 (en) 2016-09-02 2018-10-23 Facebook, Inc. Bandwidth allocation
PL3531637T3 (en) * 2018-02-21 2020-07-13 Deutsche Telekom Ag Techniques for efficient reordering of data packets in multipath scenarios
US10917856B2 (en) * 2018-09-07 2021-02-09 Parallel Wireless, Inc. Statistical projection for controlling BLER
DE102022124174A1 (en) 2022-09-21 2024-03-21 Bayerische Motoren Werke Aktiengesellschaft Computer program, device and method for controlling a data transmission rate of several participants in a communication network

Family Cites Families (16)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
DE3527329A1 (en) * 1985-07-31 1987-02-05 Philips Patentverwaltung DIGITAL RADIO TRANSMISSION SYSTEM WITH VARIABLE TIME SLOT DURATION OF TIME SLOTS IN TIME MULTIPLEX FRAME
US5224120A (en) * 1990-12-05 1993-06-29 Interdigital Technology Corporation Dynamic capacity allocation CDMA spread spectrum communications
IT1270938B (en) * 1993-05-14 1997-05-16 Cselt Centro Studi Lab Telecom PROCEDURE FOR THE CONTROL OF THE TRANSMISSION ON A SAME CHANNEL OF INFORMATION FLOWS AT VARIABLE SPEED IN COMMUNICATION SYSTEMS BETWEEN MOBILE VEHICLES, AND A SYSTEM USING SUCH PROCEDURE
ZA946674B (en) * 1993-09-08 1995-05-02 Qualcomm Inc Method and apparatus for determining the transmission data rate in a multi-user communication system
US6088590A (en) * 1993-11-01 2000-07-11 Omnipoint Corporation Method and system for mobile controlled handoff and link maintenance in spread spectrum communication
FI97929C (en) * 1994-02-25 1997-03-10 Nokia Telecommunications Oy Procedure for transmitting calls with different priorities in cellular radio networks
US5442625A (en) * 1994-05-13 1995-08-15 At&T Ipm Corp Code division multiple access system providing variable data rate access to a user
US5537410A (en) * 1994-09-15 1996-07-16 Oki Telecom Subsequent frame variable data rate indication method
FI96558C (en) * 1994-09-27 1996-07-10 Nokia Telecommunications Oy Method for data transmission in a TDMA mobile radio system and a mobile radio system for carrying out the method
US5592470A (en) * 1994-12-21 1997-01-07 At&T Broadband wireless system and network architecture providing broadband/narrowband service with optimal static and dynamic bandwidth/channel allocation
FI114178B (en) * 1995-01-09 2004-08-31 Nokia Corp Dynamic allocation of radio capacity in a TDMA system
US5523571A (en) 1995-03-31 1996-06-04 Siemens Medical Systems, Inc. Versatile reconfigurable gantry for use in scintillation camera systems
GB9509921D0 (en) * 1995-05-17 1995-07-12 Roke Manor Research Improvements in or relating to mobile radio systems
US5619492A (en) * 1995-06-16 1997-04-08 Unisys Corporation CDMA communication system in which bit rates are dynamically allocated
US5734646A (en) * 1995-10-05 1998-03-31 Lucent Technologies Inc. Code division multiple access system providing load and interference based demand assignment service to users
US6111863A (en) * 1995-12-29 2000-08-29 Lsi Logic Corporation Method and apparatus for the dynamic allocation of signal bandwidth between audio, video and data signals

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See references of WO9845966A2 *

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7941152B2 (en) 2001-12-04 2011-05-10 Qualcomm, Incorporated Method and apparatus for a reverse link supplemental channel scheduling

Also Published As

Publication number Publication date
EP1713288A3 (en) 2007-01-03
EP1713288B1 (en) 2012-12-05
EP1713288A2 (en) 2006-10-18
ATE335366T1 (en) 2006-08-15
DE69835423T2 (en) 2007-02-22
CN1141850C (en) 2004-03-10
US5914950A (en) 1999-06-22
WO1998045966A2 (en) 1998-10-15
JP2001519123A (en) 2001-10-16
EP0974237B1 (en) 2006-08-02
CN1263675A (en) 2000-08-16
WO1998045966A3 (en) 1999-01-07
JP4201845B2 (en) 2008-12-24
AU7246698A (en) 1998-10-30
KR20010006192A (en) 2001-01-26
DE69835423D1 (en) 2006-09-14
KR100728999B1 (en) 2007-06-14
HK1025707A1 (en) 2000-11-17
TW391099B (en) 2000-05-21
ZA982973B (en) 1998-10-13
AR012394A1 (en) 2000-10-18

Similar Documents

Publication Publication Date Title
US5914950A (en) Method and apparatus for reverse link rate scheduling
US5923650A (en) Method and apparatus for reverse link rate scheduling
EP1791374B1 (en) Communication system for forward link rate scheduling
US8396033B2 (en) Method and apparatus for forward link rate scheduling
US7519044B1 (en) Channel structure for communication systems
EP1825606B1 (en) Power link margin for high-speed downlink packet access
MXPA98008424A (en) Method and apparatus for forward link rate scheduling

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

17P Request for examination filed

Effective date: 19991011

AK Designated contracting states

Kind code of ref document: A2

Designated state(s): AT BE CH CY DE DK ES FI FR GB GR IE IT LI LU MC NL PT SE

AX Request for extension of the european patent

Free format text: AL PAYMENT 19991011;LT PAYMENT 19991011;LV PAYMENT 19991011;MK PAYMENT 19991011;RO PAYMENT 19991011;SI PAYMENT 19991011

RAP1 Party data changed (applicant data changed or rights of an application transferred)

Owner name: QUALCOMM INCORPORATED

17Q First examination report despatched

Effective date: 20040220

RTI1 Title (correction)

Free format text: METHOD OF SCHEDULING DATA TRANSMISSIONS IN A COMMUNICATION NETWORK

GRAP Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOSNIGR1

GRAS Grant fee paid

Free format text: ORIGINAL CODE: EPIDOSNIGR3

GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

AK Designated contracting states

Kind code of ref document: B1

Designated state(s): AT BE CH CY DE DK ES FI FR GB GR IE IT LI LU MC NL PT SE

AX Request for extension of the european patent

Extension state: AL LT LV MK RO SI

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: NL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20060802

Ref country code: LI

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20060802

Ref country code: IT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT;WARNING: LAPSES OF ITALIAN PATENTS WITH EFFECTIVE DATE BEFORE 2007 MAY HAVE OCCURRED AT ANY TIME BEFORE 2007. THE CORRECT EFFECTIVE DATE MAY BE DIFFERENT FROM THE ONE RECORDED.

Effective date: 20060802

Ref country code: CH

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20060802

Ref country code: BE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20060802

Ref country code: AT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20060802

REG Reference to a national code

Ref country code: GB

Ref legal event code: FG4D

REG Reference to a national code

Ref country code: CH

Ref legal event code: EP

REG Reference to a national code

Ref country code: IE

Ref legal event code: FG4D

REF Corresponds to:

Ref document number: 69835423

Country of ref document: DE

Date of ref document: 20060914

Kind code of ref document: P

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: DK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20061102

REG Reference to a national code

Ref country code: SE

Ref legal event code: TRGR

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: ES

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20061113

NLV1 Nl: lapsed or annulled due to failure to fulfill the requirements of art. 29p and 29m of the patents act
PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: PT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20070102

LTIE Lt: invalidation of european patent or patent extension

Effective date: 20060802

REG Reference to a national code

Ref country code: HK

Ref legal event code: GR

Ref document number: 1025707

Country of ref document: HK

REG Reference to a national code

Ref country code: CH

Ref legal event code: PL

ET Fr: translation filed
PLBE No opposition filed within time limit

Free format text: ORIGINAL CODE: 0009261

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT

26N No opposition filed

Effective date: 20070503

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: GR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20061103

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: IE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20070409

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: MC

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20070430

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: LU

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20070407

Ref country code: CY

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20060802

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: FI

Payment date: 20100407

Year of fee payment: 13

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: SE

Payment date: 20100407

Year of fee payment: 13

REG Reference to a national code

Ref country code: SE

Ref legal event code: EUG

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: FI

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20110407

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: SE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20110408

REG Reference to a national code

Ref country code: FR

Ref legal event code: PLFP

Year of fee payment: 19

REG Reference to a national code

Ref country code: FR

Ref legal event code: PLFP

Year of fee payment: 20

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: DE

Payment date: 20170428

Year of fee payment: 20

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: FR

Payment date: 20170707

Year of fee payment: 20

Ref country code: GB

Payment date: 20170707

Year of fee payment: 20

Ref country code: IT

Payment date: 20170712

Year of fee payment: 20

REG Reference to a national code

Ref country code: DE

Ref legal event code: R071

Ref document number: 69835423

Country of ref document: DE

REG Reference to a national code

Ref country code: GB

Ref legal event code: PE20

Expiry date: 20180406

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: GB

Free format text: LAPSE BECAUSE OF EXPIRATION OF PROTECTION

Effective date: 20180406