System and method for maintaining timing of synchronization messages over a reverse link of a CDMA wireless communication system

Information

  • Patent Grant
  • 7773566
  • Patent Number
    7,773,566
  • Date Filed
    Wednesday, July 21, 2004
    20 years ago
  • Date Issued
    Tuesday, August 10, 2010
    14 years ago
Abstract
A method for operating a subscriber unit that communicates with a code division multiple access (CDMA) wireless network is provided. At the subscriber unit, synchronization information is encoded with a CDMA code. The CDMA encoded synchronization information is transmitted from the subscriber unit in discrete repeating intervals. The discrete repeating intervals are separated by other discrete repeating intervals during which the subscriber unit does not transmit synchronization information.
Description
BACKGROUND OF THE INVENTION

The increasing use of wireless telephones and personal computers has led to a corresponding demand for advanced telecommunication services that were once thought to only be meant for use in specialized applications. In the 1980's, wireless voice communication became widely available through the cellular telephone network. Such services were at first typically considered to be the exclusive province of the businessman because of expected high subscriber costs. The same was also true for access to remotely distributed computer networks, whereby until very recently, only business people and large institutions could afford the necessary computers and wireline access equipment. As a result of the widespread availability of both technologies, the general population now increasingly wishes to not only have access to networks such as the Internet and private intranets, but also to access such networks in a wireless fashion as well. This is particularly of concern for the users of portable computers, laptop computers, hand-held personal digital assistants and the like who would prefer to access such networks without being tethered to a telephone line.


There still is no widely available satisfactory solution for providing low cost, broad geographical coverage, high speed access to the Internet, private intranets, and other networks using the existing wireless infrastructure. This situation is most likely an artifact of several unfortunate circumstances. For one, the typical manner of providing high speed data service in the business environment over the wireline network is not readily adaptable to the voice grade service available in most homes or offices. Such standard high speed data services also do not lend themselves well to efficient transmission over standard cellular wireless handsets. Furthermore, the existing cellular network was originally designed only to deliver voice services. As a result, the emphasis in present day digital wireless communication schemes lies with voice, although certain schemes such as CDMA do provide some measure of asymmetrical behavior for the accommodation of data transmission. For example, the data rate on an IS-95 forward traffic channel can be adjusted in increments from 1.2 kbps up to 9.6 kbps for so-called Rate Set 1 and in for increments from 1.8 kbps up to 14.4 kbps for Rate Set 2.


Existing systems therefore typically provide a radio channel which can accommodate maximum data rates only in the range of 14.4 kilobits per second (kbps) at best in the forward direction. Such a low data rate channel does not lend itself directly to transmitting data at rates of 28.8 or even 56.6 kbps that are now commonly available using inexpensive wireline modems, not to mention even higher rates such as the 128 kbps which are available with Integrated Services Digital Network (ISDN) type equipment. Data rates at these levels are rapidly becoming the minimum acceptable rates for activities such as browsing web pages. Other types of data networks using higher speed building blocks such as Digital Subscriber Line (xDSL) service are just now coming into use in the United States. However, their costs have only been recently reduced to the point where they are attractive to the residential customer.


Although such networks were known at the time that cellular systems were originally deployed, for the most part, there is no provision for providing higher speed ISDN- or xDSL-grade data services over cellular network topologies. Unfortunately, in wireless environments, access to channels by multiple subscribers is expensive and there is competition for them. Whether the multiple access is provided by the traditional Frequency Division Multiple Access (FDMA) using analog modulation on a group of radio carriers, or by newer digital modulation schemes the permit sharing of a radio carrier using Time Division Multiple Access (TDMA) or Code Division Multiple Access (CDMA), the nature of the radio spectrum is that it is a medium that is expected to be shared. This is quite dissimilar to the traditional environment for data transmission, in which the wireline medium is relatively inexpensive to obtain, and is therefore not typically intended to be shared.


Other considerations are the characteristics of the data itself. For example, consider that access to web pages in general is burst-oriented, with asymmetrical data rate transmission requirements. In particular, the user of a remote client computer first specifies the address of a web page to a browser program. The browser program then sends this web page address data, which is typically 100 bytes or less in length, over the network to a server computer. The server computer then responds with the content of the requested web page, which may include anywhere from 10 kilobytes to several megabytes of text, image, audio, or even video data. The user then may spend at least several seconds or even several minutes reading the content of the page before requesting that another page be downloaded. Therefore, the required forward channel data rates, that is, from the base station to the subscriber, are typically many times greater than the required reverse channel data rates.


In an office environment, the nature of most employees' computer work habits is typically to check a few web pages and then to do something else for extended period of time, such as to access locally stored data or to even stop using the computer altogether. Therefore, even though such users may expect to remain connected to the Internet or private intranet continuously during an entire day, the actual overall nature of the need to support a required data transfer activity to and from a particular subscriber unit is actually quite sporadic.


SUMMARY OF THE INVENTION

Problem Statement


What is needed is an efficient scheme for supporting wireless data communication such as from portable computers to computer networks such as the Internet and private intranets using widely available infrastructure. Unfortunately, even the most modern wireless standards in widespread use such as CDMA do not provide adequate structure for supporting the most common activities, such as web page browsing. Due to IS-95 being circuit-switched, there are only a maximum of 64 circuit-switched users that can be active at one time. In practicality, this limit is difficult to attain, and 20 or 30 simultaneous users are typically used, however certain implementations allow aggregation of up to 8 codes on a channel.


In addition, the existing CDMA system requires certain operations before a channel can be used. Both access and traffic channels are modulated by so-called long code pseudonoise (PN) sequences; therefore, in order for the receiver to work properly it must first be synchronized with the transmitter. The setting up and tearing down of channels therefore requires overhead to perform such synchronization. This overhead results in a noticeable delay to the user of the subscriber unit.


An attractive method of increasing data rate for a given user is the sharing of channels in both the forward and reverse link direction. This is an attractive option, especially with the ease of obtaining multiple access with CDMA; additional users can be supported by simply adding additional codes for the forward link, or code phases in the reverse link for an IS-95 system. Ideally, this subchannel overhead would be minimized so that when additional subchannels need to be allocated to a connection, they are available as rapidly as possible.


To maintain synchronization, it is therefore advantageous to provide the sub-channels in such a way that the lowest possible speed connection is provided on a reverse link while at the same time maintaining efficient and fast ramp-up of additional code phase channels on demand. This in turn would maximize the number of available connections while minimizing the impact on the overall system capacity.


One aspect of the present invention is directed to a method for operating a subscriber unit that communicates with a code division multiple access (CDMA) wireless network. The method comprises encoding at the subscriber unit synchronization information with a CDMA code, and transmitting from the subscriber unit the CDMA encoded synchronization information in discrete repeating intervals. The discrete repeating intervals may be separated by other discrete repeating intervals during which the subscriber unit does not transmit synchronization information.


The method may further comprise monitoring a buffer at the subscriber unit, supplying user information to the buffer, and requesting permission to use a first CDMA code for supporting the transmission of a portion of the user information. Permission is also requested to use a second CDMA code for supporting the transmission of the user information not in the portion. The user information is transmitted from the subscriber unit using the first and second CDMA codes.


Each discrete repeating interval may comprise a time slot of a recurring frame. The discrete repeating intervals may be of equal duration. The method may further comprise the step of receiving a message defining a size of the discrete repeating intervals. The synchronization information may comprise a heartbeat message. The step of transmitting synchronization information in discrete repeating intervals may not occur during the step of transmitting user information.


Another aspect of the present invention is to provide a method for operating a subscriber unit to maintain synchronization when not actively transmitting data. The method comprises receiving from a base station a message defining discrete repeating intervals during which the subscriber unit transmits synchronization information encoded with a CDMA code at the subscriber unit. The encoded synchronization information is transmitted from the subscriber unit to the base station in the discrete repeating intervals.


Yet another aspect of the present invention is to provide a method for supporting variable rate data transfers on a communication link between a base station and a field unit in a wireless CDMA communication system. The method comprises transmitting user information from the field unit to the base station using a first allocation of bandwidth. Synchronization information is transmitted from the field unit to the base station using a second allocation of bandwidth during discrete repeating intervals of time when the field unit is not actively transmitting user information using the first allocation of bandwidth.


BRIEF DESCRIPTION OF THE INVENTION

The present invention is a service option overlay for an IS-95-like CDMA wireless communication system which accomplishes the above requirements. In particular, a number of subchannels for a forward link are defined within a single CDMA radio channel bandwidth, such as by assigning different orthogonal codes to each sub-channel. Multiple subchannels are defined on the reverse link by assigning different code phases of a given long pseudonoise (PN) code to each subchannel. The instantaneous bandwidth needs of each on-line subscriber unit are then met by dynamically allocating additional capacity on an as needed basis for each network layer connection.


More recently, the cdma-2000 system provides a variable spreading factor to increase data rate rather than using additional long codes. Only a single long code is used, and different data rate are obtained by changing the chips per data bit or the length of the orthogonal code. Further, additional orthogonal codes within the code phases are employed.


More particularly, the present invention efficiently provides a relatively large number of virtual physical connections between the subscriber units and the base stations on the reverse link for extended idle periods such as when computers connected to the subscriber units are powered on, but not presently actively sending or receiving data. These maintenance subchannels permit the base station and the subscriber units to remain in phase and time synchronism. The power levels over the subchannels is regulated to minimize interference. This in turn allows fast acquisition of additional capacity. The additional capacity can be obtained in several ways. Additional code phases, or long codes, may be employed. Further, additional orthogonal codes within the same code phase may be added, as described above. Finally, the spreading factor of the codes may be varied.


In an idle mode, the subscriber unit sends a synchronization or “heartbeat” message on the maintenance subchannel at a data rate which need only be fast enough to allow the subscriber unit to maintain synchronization with the base station. The duration of the heartbeat signal is determined by considering several factors, including the capture or locking range of the code phase locking circuits in the receiver at the base station, by the power control rate that is required, and/or by the rate at which the request indication needs to be sent, based on a maximum delay for which a channel may still be requested.


For example, the receiver typically has a PN code correlator running at the code chip rate. One example of such a code correlator uses a delay lock loop consisting of an early-late detector. A loop filter controls the bandwidth of the loop which in turn determines how long the code correlator must be allowed to operate before it can guarantee phase lock. This loop time constant determines the amount of “jitter” that can be tolerated; phase lock is typically considered to be maintainable when this is equal to a fraction of a chip time, such as about ⅛ of a chip time.


The heartbeat messages are preferably sent in time slots formed on the subchannels defined by the code phases according to a timing control loop. The use of time slotting allows a minimum number of dedicated base station receivers to maintain the idle reverse links. In particular, the reverse maintenance channel links are provided using multiple phases of the same long code as well as by assigning a time slot on such code to each subscriber unit. This reduces the overhead of maintaining a large number of connections at the base station.


Because of the time slotted nature of the reverse maintenance channel, the base station receiver can also be time shared among these various reverse links. To permit this, during each time slot allocated to a particular subscriber unit, the base station receiver first loads information concerning the last known state of its phase lock such as the last known state of early-late correlators. It then trains the early-late correlators for the required time to ensure that phase lock is still valid, and stores the state of the correlators at the end of the time slot.


When additional channel capacity is required to meet bandwidth demand, the additional code phases are assigned in a predetermined phase relationship with respect to the locked code in order to minimize overhead transmissions which would otherwise be needed from the base station traffic channel processor. As a result, many thousands of idle subscriber units may be supported on a single CDMA reverse link radio channel while at the same time minimizing start up delay when channels must be allocated.





BRIEF DESCRIPTION OF THE DRAWINGS

The foregoing and other objects, features and advantages of the invention will be apparent from the following more particular description of preferred embodiments of the invention, as illustrated in the accompanying drawings in which like reference characters refer to the same parts throughout the different views.



FIG. 1 is a block diagram of a wireless communication system making use of a bandwidth management scheme according to the invention.



FIG. 2 is a diagram showing how subchannels are assigned within a given radio forward link frequency (RF) channel.



FIG. 3 is a diagram showing how subchannels are assigned within a given reverse link RF channel.



FIG. 4 is a state diagram for a reverse link bandwidth management function in the subscriber unit; and



FIG. 5 is a state diagram of the reverse link bandwidth management function in the base station.





DETAILED DESCRIPTION OF A PREFERRED EMBODIMENT

Turning attention now to the drawings more particularly, FIG. 1 is a block diagram of a system 100 for providing high speed data and voice service over a wireless connection by seamlessly integrating a digital data protocol such as, for example, Integrated Services Digital Network (ISDN) with a digitally modulated wireless service such as Code Division Multiple Access (CDMA).


The system 100 consists of two different types of components, including subscriber units 101-1, 101-2, . . . , 101-u (collectively, the subscriber units 101) and one or more base stations 170. The subscriber units 101 and base stations 170 cooperate to provide the functions necessary in order to provide wireless data services to a portable computing device 110 such as a laptop computer, portable computer, personal digital assistant (PDA) or the like. The base station 170 also cooperates with the subscriber units 101 to permit the ultimate transmission of data to and from the subscriber unit and the Public Switched Telephone Network (PSTN) 180.


More particularly, data and/or voice services are also provided by the subscriber unit 101 to the portable computer 110 as well as one or more other devices such as telephones 112-1, 112-2 (collectively referred to herein as telephones 112). The telephones 112 themselves may in turn be connected to other modems and computers which are not shown in FIG. 1. In the usual parlance of ISDN, the portable computer 110 and telephones 112 are referred to as terminal equipment (TE). The subscriber unit 101 provides the functions referred to as a network termination type 1 (NT-1). The illustrated subscriber unit 101 is in particular meant to operate with a so-called basic rate interface (BRI) type ISDN connection that provides two bearer or “B” channels and a single data or “D” channel with the usual designation being 2B+D.


The subscriber unit 101 itself consists of an ISDN modem 120, a device referred to herein as the protocol converter 130 that performs the various functions according to the invention including spoofing 132 and bandwidth management 134, a CDMA transceiver 140, and subscriber unit antenna 150. The various components of the subscriber unit 101 may be realized in discrete devices or as an integrated unit. For example, an existing conventional ISDN modem 120 such as is readily available from any number of manufacturers may be used together with existing CDMA transceivers 140. In this case, the unique functions are provided entirely by the protocol converter 130 which may be sold as a separate device. Alternatively, the ISDN modem 120, protocol converter 130, and CDMA transceiver 140 may be integrated as a complete unit and sold as a single subscriber unit device 101. Other types of interface connections such as Ethernet or PCMCIA may be used to connect the computing device to the protocol converter 130. The device may also interface to an Ethernet interface rather than an ISDN “U” interface.


The ISDN modem 120 converts data and voice signals between the terminal equipment 110 and 112 to format required by the standard ISDN “U” interface. The U interface is a reference point in ISDN systems that designates a point of the connection between the network termination (NT) and the telephone company.


The protocol converter 130 performs spoofing 132 and basic bandwidth management 134 functions. In general, spoofing 132 consists of insuring that the subscriber unit 101 appears to the terminal equipment 110, 112 that is connected to the public switched telephone network 180 on the other side of the base station 170 at all times. The bandwidth management function 134 is responsible for allocating and deallocating CDMA radio channels 160 as required. Bandwidth management 134 also includes the dynamic management of the bandwidth allocated to a given session by dynamically assigning sub-portions of the CDMA radio channels 160 in a manner which is more fully described below.


The CDMA transceiver 140 accepts the data from the protocol converter 130 and reformats this data in appropriate form for transmission through a subscriber unit antenna 150 over CDMA radio link 160-1. The CDMA transceiver 140 may operate over only a single 1.25 MHz radio frequency channel or, alternatively, in a preferred embodiment, may be tunable over multiple allocatable radio frequency channels.


CDMA signal transmissions are then received and processed by the base station equipment 170. The base station equipment 170 typically consists of multichannel antennas 171, multiple CDMA transceivers 172, and a bandwidth management functionality 174. Bandwidth management 174 controls the allocation of CDMA radio channels 160 and subchannels, in a manner analogous to the subscriber unit 101. The base station 170 then couples the demodulated radio signals to the Public Switch Telephone Network (PSTN) 180 in a manner which is well known in the art. For example, the base station 170 may communicate with the PSTN 180 over any number of different efficient communication protocols such as primary rate ISDN, or other LAPD based protocols such as IS-634 or V5.2.


It should also be understood that data signals travel bidirectionally across the CDMA radio channels 160. In other words, data signals received from the PSTN-180 are coupled to the portable computer 110 in a forward link direction, and data signals originating at the portable computer 110 are coupled to the PSTN 180 in a so-called reverse link direction. The present invention involves in particular the manner of implementing the reverse link channels.


Continuing to refer to FIG. 1 briefly, spoofing 134 therefore involves having the CDMA transceiver 140 loop back these synchronous data bits over the ISDN communication path to spoof the terminal equipment 110, 112 into believing that a sufficiently wide wireless communication link 160 is continuously available. However, only when there is actually data present from the terminal equipment to the wireless transceiver 140 is wireless bandwidth allocated. Therefore, the network layer need not allocate the assigned wireless bandwidth for the entirety of the communications session. That is, when data is not being presented upon the terminal equipment to the network equipment, the bandwidth management function 134 deallocates initially assigned radio channel bandwidth 160 and makes it available for another transceiver and another subscriber unit 101.


In order to better understand how bandwidth management 134 and 174 accomplish the dynamic allocation of radio channels, turn attention now to FIG. 2. This figure illustrates one possible frequency plan for the wireless links 160 according to the invention. In particular, a typical transceiver 170 can be tuned on command to any 1.25 MHz channel within a much larger bandwidth, such as up to 30 MHz. In the case of location in an existing cellular radio frequency band, these bandwidths are typically made available in the range of from 800 to 900 MHz. For personal communication systems (PCS) type wireless systems, the bandwidth is typically allocated in the range from about 1.8 to 2.0 GigaHertz (GHz). In addition, there are typically two matching bands active simultaneously, separated by a guard band, such as 80 MHz; the two matching bands form forward and reverse full duplex link.


Each of the CDMA transceivers, such as transceiver 140 in the subscriber unit 101, and transceivers 172 in the base station 170, are capable of being tuned at any given point in time to a given 1.25 MHz radio frequency channel. It is generally understood that such 1.25 MHz radio frequency carrier provides, at best, a total equivalent of about 500 to 600 kbps maximum data rate transmission within acceptable bit error rate limitations.


In contrast to this, the present invention subdivides the available approximately 500 to 600 kbps data rate into a relatively large number of subchannels. In the illustrated example, the bandwidth is divided into sixty-four (64) subchannels 300, each providing an 8 kbps data rate. A given subchannel 300 is physically implemented by encoding a transmission with one of a number of different assignable pseudorandom codes. For example, the 64 subchannels 300 may be defined within a single CDMA RF carrier by using a different orthogonal code for each defined subchannel 300 for example, for the forward link.


As mentioned above, subchannels 300 are allocated only as needed. For example, multiple subchannels 300 are granted during times when a particular ISDN subscriber unit 101 is requesting that large amounts of data be transferred. These subchannels 300 are quickly released during times when the subscriber unit 101 is relatively lightly loaded.


The present invention relates in particular to maintaining the reverse link so that synchronization of the subchannels does not need to be reestablished each time that channels are taken away and then granted back.



FIG. 3 is a diagram illustrating the arrangement of how the subchannels are assigned on the reverse link. It is desirable to use a single radio carrier signal on the reverse link to the extent possible to conserve power as well as to conserve the receiver resources which must be made available at the base station. Therefore, a single 1.2288 MHz band 350 is selected out of the available radio spectrum.


A relatively large number, N, such as 1000 individual subscriber units are then supported by using a single long pseudonoise (PN) code in a particular way. First, a number, p, of code phases are selected from the available 242-1 different long code phases. A given long code phase is unique to a particular subscriber unit and never changes. As will be explained, this is also true for supplemental code phases as well. The code p phases shifts are then used to provide p subchannels. Next, each of the p subchannels are further divided into s time slots. The time slotting is used only during the idle mode, and provides two advantages; it reduces the numbers of “maintenance” receivers in the base station, and it reduces the impact to reverse channel capacity by reducing transmit power and thus interference. Therefore, the maximum supportable number of supportable subscriber units, N, is p times s. During Idle mode, use of the same PN code with different phases and time slots provides many different subchannels with permits using a single rake receiver in the base station 104.


In the above mentioned channel allocation scheme, radio resources are expected to be allocated on an as-needed basis. However, consideration must also be given to the fact that normally, in order set up a new CDMA channel, a given reverse link channel must be given time to acquire code phase lock at the receiver. The present invention avoids the need to wait for each channel to acquire code phase lock each time that it is set up by several mechanisms which are describe more fully below. In general, the technique is to send a maintenance signal at a rate which is sufficient to maintain code phase lock for each subchannel even in the absence of data.


The objective here is to minimize the size of each time slot, which in turn maximizes the number of subscribers that can be maintained in an idle mode. The size, t, of each time slot is determined by the minimum time that it takes to guarantee phase lock between the transmitter at the subscriber unit and the receiver in the base station. In particular, a code correlator in the receiver must receive a maintenance or “heartbeat” signal consisting of at least a certain number of maintenance bits over a certain unit of time. In the limit, this heartbeat signal is sent by sending at least one bit from each subscriber unit on each reverse link at a predetermined time, e.g., its designated time slot on a predetermined one of the N subchannels.


The minimum time slot duration, t, therefore depends upon a number of factors including the signal to noise ratio and the expected maximum velocity of the subscriber unit within the cell. With respect to signal to noise ratio, this depends on

Eb/(No+Io)

where Eb is the energy per bit, No is the ambient noise floor, and lo is the mutual interference from other coded transmissions of the other sub-channels on the reverse link sharing the same spectrum. Typically, to close the link requires integration over 8 chip times at the receiver, and a multiple of 20 times that is typically needed to guarantee detection. Therefore, about 160 chip times are typically required to correctly receive the coded signal on the reverse link. For a 1.2288 MHz code, Tc, the chip time, is 813.33 ns, so that this minimum integration time is about 130 μs. This in turn sets the absolute minimum duration of a data bit, and therefore, the minimum duration of a slot time, t. The minimum slot time of 130 μs is means that at a maximum, 7692 time slots can be made available per second for each phase coded signal.


To be consistent with certain power control group timing requirements, the time slot duration can be relaxed somewhat. For example, in the IS-95 standard, a power control group timing requirement requires a power output sample from each subscriber unit every 1.25 ms.


Once code phase lock is acquired, the duration of the heartbeat signal is determined by considering the capture or locking range of the code phase locking circuits in the receiver at the base station. For example, the receiver typically has a PN code correlator running at the code chip rate. One example of such a code correlator uses a delay lock loop consisting of an early-late detector. A loop filter controls the bandwidth of this loop which in turn determines how long the code correlator must be allowed to operate before it can guarantee phase lock. This loop time constant determines the amount of “jitter” that can be tolerated in the code correlator, such as about ⅛ of a chip time, Tc.


In the preferred embodiment, the system 100 is intended to support so-called nomadic mobility. That is, high mobility operation within moving vehicles typical of cellular telephony is not expected to be necessary. Rather, the typical user of a portable computer who is active is moving at only brisk walking speeds of about 4.5 miles per hour (MPH). At 4.5 MPH, corresponding to a velocity of 6.6 feet per second, a user will move 101 feet in ⅛ of the 1/1.2288 MHz chip time (Tc). Therefore, it will take about 101 feet divided by 6.6 feet, or about 15 seconds for such a user to move distance which is sufficiently far for him to a point where the code phase synchronization loop cannot be guaranteed to remain locked. Therefore, as long as a complete synchronization signal is sent for a given reverse link channel every 15 seconds, the reverse link loop will therefore remain in lock.



FIG. 4 is a state diagram for a reverse link bandwidth management function in the subscriber unit. In an idle mode 400, a first state 401 is entered in which the subscriber unit receives a time slot assignment for its code phase reverse channel. This time slot is only used in the idle mode. The same long code phase is pre-assigned and is permanent to the subscriber unit.


In a next state 402, the heartbeat signal is sent in the assigned time slots. A state 403 is then entered in which the subscriber unit monitors its internal data buffers to determine whether additional code phase channels are required to support the establishment of a reverse link with sufficient bandwidth to support an active traffic channel. If this is not the case, then the subscriber returns to state 402 and remains in the idle mode 400.


Prior to entering the Active state 405 from Idle mode 400, the subscriber unit must make a request to the base station. If granted, (step 403-b), processing proceeds to step 451, and if not granted, processing proceeds to step 402. However, the subscriber unit knows that it is assigned code phase channels in a predetermined relationship to the code phase channel of its fundamental channel, i.e.,

Pn+1=custom character{Po}

where Pn+1 is the code phase for the new channel (n+1), and Po is the code phase assigned to the fundamental channel for the particular subscriber. Such a code phase relationship custom character may be, for example, to select uniformly from the available 242 codes, every 242/210′th or every 232′th code phase in a system which is supporting 1024 (210) reverse links, for a single subscriber.


As described above the reverse link available capacity and related power control allow additional capacity by adding orthogonal codes rather than additional code phases and by varying the spreading factor, in addition to employing new codes.


A number, C, of these new code phases are therefore instantaneously calculated based simply upon the number of additional code phase channels, and without the need to require code phase synchronization for each new channel.


After step 452 is processed, a request is made for code phase channels. If granted (step 452-b), processing proceeds to step 453, and if not granted, processing proceeds to step 451 in order to process the additional channel requests. In a next state 453, the subscriber unit begins transmitting its data on its assigned code phase channels. In state 454, it continues to monitor its internal data buffers and its associated forward access channel to determine when to return to the idle mode 400, or state 451, to determine if new code phase channels must be assigned, or to state 455, where they are deallocated.



FIG. 5 is a state diagram of idle mode processing in the reverse link management function in the base station 104. In a first state 501, for each idle subscriber unit 101, a state 502 is entered in which a stored state of the correlators for the present time slot (p,s) from a previous synchronization session is read. In a next state 503, an early-late correlator is retrained for the time slot duration, t. In a next state 504, the correlator state is stored; in state 505, the loop is continued for each subscriber.


Equivalents


While this invention has been particularly shown and described with references to preferred embodiments thereof, it will be understood by those skilled in the art that various changes in form and details may be made therein without departing from the spirit and scope of the invention as defined by the appended claims.


For example, instead of ISDN, other wireline and network protocols may be encapsulated, such as xDSL, Ethernet, and X.25, and therefore may advantageously use the dynamic wireless subchannel assignment scheme described herein.


Those skilled in the art will recognize or be able to ascertain using no more than routine experimentation, many equivalents to the specific embodiments of the invention described specifically herein. Such equivalents are intended to be encompassed in the scope of the claims.


While this invention has been particularly shown and described with references to preferred embodiments thereof, it will be understood by those skilled in the art that various changes in form and details may be made therein without departing from the scope of the invention encompassed by the appended claims.

Claims
  • 1. A method for use in a subscriber unit in a code division multiple access (CDMA) wireless network, the method comprising: receiving a message defining a timeslot assignment for a code phase reverse channel of the subscriber unit, wherein the timeslot assignment defines timeslots to be used only during an idle mode;encoding synchronization information with a CDMA code;monitoring a buffer to determine whether additional code phase channels are required to support the reverse channel;on a condition that the additional code phase channels are not required, the subscriber unit remains in the idle mode; andtransmitting, during the idle mode, the CDMA encoded synchronization information on an assigned code phase channel, wherein the transmission of the CDMA encoded synchronization information is based on the received timeslot assignment.
  • 2. The method of claim 1 further comprising: monitoring the buffer;supplying user information to the buffer;requesting permission to use a first CDMA code for supporting transmission of a portion of the user information;requesting permission to use a second CDMA code for supporting transmission of the user information not in the portion; andtransmitting the user information using the first CDMA code and the second CDMA code.
  • 3. The method of claim 1 wherein the message defining the timeslot assignment defines a repeating timeslot interval.
  • 4. The method of claim 1 wherein the CDMA encoded synchronization information comprises a heartbeat message.
  • 5. The method of claim 1 wherein the transmitting of the CDMA encoded synchronization information occurs when the subscriber unit is in an idle mode and does not occur when the subscriber unit is transmitting user information.
RELATED APPLICATIONS

This application is a continuation of application Ser. No. 09/997,732, filed Nov. 29, 2001 which is a continuation-in-part of application Ser. No. 09/778,474, filed Feb. 7, 2001, and a continuation of application Ser. No. 09/730,376, filed Dec. 5, 2000, now U.S. Pat. No. 6,707,804, which is a continuation of application Ser. No. 09/088,413, filed Jun. 1, 1998, now U.S. Pat. No. 6,222,832. The entire teachings of the above applications are incorporated herein by reference.

US Referenced Citations (378)
Number Name Date Kind
3560978 Himmel et al. Feb 1971 A
3725938 Black et al. Apr 1973 A
3742498 Dunn Jun 1973 A
3846799 Guegen Nov 1974 A
3950753 Chisholm Apr 1976 A
4021813 Black et al. May 1977 A
4099184 Rapshys Jul 1978 A
4107469 Jenkins Aug 1978 A
4170766 Pridham et al. Oct 1979 A
4260994 Parker Apr 1981 A
4290071 Fenwick Sep 1981 A
4387378 Henderson Jun 1983 A
4488155 Wu Dec 1984 A
4577316 Schiff Mar 1986 A
4599733 Gutleber Jul 1986 A
4625308 Kim et al. Nov 1986 A
4631546 Dumas et al. Dec 1986 A
4642806 Hewitt et al. Feb 1987 A
4675863 Paneth et al. Jun 1987 A
4700197 Milne Oct 1987 A
4817089 Paneth et al. Mar 1989 A
4841526 Wilson et al. Jun 1989 A
4862453 West et al. Aug 1989 A
4866709 West et al. Sep 1989 A
4912705 Paneth et al. Mar 1990 A
4949395 Rydbeck Aug 1990 A
4954950 Freeman et al. Sep 1990 A
5022024 Paneth et al. Jun 1991 A
5027125 Tang Jun 1991 A
5027348 Curry Jun 1991 A
5027400 Baji et al. Jun 1991 A
5038149 Aubry et al. Aug 1991 A
5056109 Gilhousen et al. Oct 1991 A
5068916 Harrison et al. Nov 1991 A
5101416 Fenton et al. Mar 1992 A
5103459 Gilhousen et al. Apr 1992 A
5114375 Wellhausen et al. May 1992 A
5115309 Hang May 1992 A
5117236 Chang et al. May 1992 A
5124981 Golding Jun 1992 A
5130983 Heffner, III Jul 1992 A
5226044 Gupta et al. Jul 1993 A
5235343 Audren et al. Aug 1993 A
5257283 Gilhousen et al. Oct 1993 A
5267262 Wheatley, III Nov 1993 A
5268900 Hluchyj et al. Dec 1993 A
5280472 Gilhousen et al. Jan 1994 A
5282222 Fattouche et al. Jan 1994 A
5293172 Lamberty et al. Mar 1994 A
5294939 Sanford et al. Mar 1994 A
5303240 Borras et al. Apr 1994 A
5325394 Bruckert Jun 1994 A
5325419 Connolly et al. Jun 1994 A
5337316 Weiss et al. Aug 1994 A
5339316 Diepstraten Aug 1994 A
5353332 Raith et al. Oct 1994 A
5355374 Hester et al. Oct 1994 A
5373502 Turban Dec 1994 A
5375124 D'Ambrogio et al. Dec 1994 A
5388102 Griffith et al. Feb 1995 A
5394473 Davidson Feb 1995 A
5412429 Glover May 1995 A
5414728 Zehavi May 1995 A
5422887 Diepstraten et al. Jun 1995 A
5430452 DuBois Jul 1995 A
5437055 Wheatley, III Jul 1995 A
5442625 Gitlin et al. Aug 1995 A
5446727 Bruckert et al. Aug 1995 A
5463629 Ko Oct 1995 A
5471463 Hulbert Nov 1995 A
5479176 Zavrel, Jr. Dec 1995 A
5481533 Honig et al. Jan 1996 A
5487180 Ohtake Jan 1996 A
5490136 Sereno et al. Feb 1996 A
5493569 Buchholz et al. Feb 1996 A
5502447 Kumpfbeck et al. Mar 1996 A
5511068 Sato Apr 1996 A
5537397 Abramson Jul 1996 A
5537414 Takiyasu et al. Jul 1996 A
5550828 Gries et al. Aug 1996 A
5559789 Nakano et al. Sep 1996 A
5577022 Padovani et al. Nov 1996 A
5581575 Zehavi et al. Dec 1996 A
5585850 Schwaller Dec 1996 A
5586119 Scribano et al. Dec 1996 A
5590409 Sawahashi et al. Dec 1996 A
5592178 Chang et al. Jan 1997 A
5592468 Sato Jan 1997 A
5592470 Rudrapatna et al. Jan 1997 A
5592471 Briskman Jan 1997 A
5598416 Yamada et al. Jan 1997 A
5604730 Tiedemann, Jr. Feb 1997 A
5606580 Mourot et al. Feb 1997 A
5617102 Prater Apr 1997 A
5617423 Li et al. Apr 1997 A
5619492 Press et al. Apr 1997 A
5619524 Ling et al. Apr 1997 A
5621752 Antonio et al. Apr 1997 A
5634199 Gerlach et al. May 1997 A
5642348 Barzegar et al. Jun 1997 A
5642377 Chung et al. Jun 1997 A
5652764 Kanzaki et al. Jul 1997 A
5655001 Cline et al. Aug 1997 A
5657326 Burns et al. Aug 1997 A
5657358 Panech et al. Aug 1997 A
5663958 Ward Sep 1997 A
5663990 Bolgiano et al. Sep 1997 A
5673259 Quick, Jr. Sep 1997 A
5680142 Smith et al. Oct 1997 A
5684794 Lopez et al. Nov 1997 A
5687194 Paneth et al. Nov 1997 A
5689502 Scott Nov 1997 A
5697059 Carney Dec 1997 A
5699364 Sato et al. Dec 1997 A
5708656 Noneman et al. Jan 1998 A
5712869 Lee et al. Jan 1998 A
5715236 Gilhousen et al. Feb 1998 A
5726981 Ylitervo et al. Mar 1998 A
5734646 I et al. Mar 1998 A
5739784 Jan et al. Apr 1998 A
5742592 Scholefield et al. Apr 1998 A
5745484 Scott Apr 1998 A
5758288 Dunn et al. May 1998 A
5767807 Pritchett Jun 1998 A
5781542 Tanaka et al. Jul 1998 A
5781543 Ault et al. Jul 1998 A
5784406 DeJaco et al. Jul 1998 A
5790549 Dent Aug 1998 A
5790551 Chan Aug 1998 A
5793744 Kanerva et al. Aug 1998 A
5802046 Scott Sep 1998 A
5802465 Hamalainen et al. Sep 1998 A
5805994 Perreault et al. Sep 1998 A
5812131 Bertram Sep 1998 A
5825807 Kumar Oct 1998 A
5828659 Teder et al. Oct 1998 A
5828662 Jalali et al. Oct 1998 A
5838720 Morelli Nov 1998 A
5841768 Ozluturk et al. Nov 1998 A
5844894 Dent Dec 1998 A
5845211 Roach Dec 1998 A
5854786 Henderson et al. Dec 1998 A
5856971 Gitlin et al. Jan 1999 A
5859840 Tiedemann, Jr. et al. Jan 1999 A
5859879 Bolgiano et al. Jan 1999 A
5867527 Ziv et al. Feb 1999 A
5872786 Shobatake Feb 1999 A
5873043 Comer Feb 1999 A
5881060 Morrow et al. Mar 1999 A
5881368 Grob et al. Mar 1999 A
5884196 Lekven et al. Mar 1999 A
5892774 Zehavi et al. Apr 1999 A
5893035 Chen Apr 1999 A
5894473 Dent Apr 1999 A
5896376 Alperovich et al. Apr 1999 A
5898929 Haartsen Apr 1999 A
5905473 Taenzer May 1999 A
5910944 Callicotte et al. Jun 1999 A
5910945 Garrison et al. Jun 1999 A
5914950 Tiedemann, Jr. et al. Jun 1999 A
5915216 Lysejko Jun 1999 A
5923650 Chen et al. Jul 1999 A
5926500 Odenwalder Jul 1999 A
5930230 Odenwalder et al. Jul 1999 A
5933781 Willenegger et al. Aug 1999 A
5943362 Saito Aug 1999 A
5950131 Vilmur Sep 1999 A
5956332 Rasanen et al. Sep 1999 A
5959980 Scott Sep 1999 A
5960361 Chen Sep 1999 A
5963559 Ohki Oct 1999 A
5966374 Rasanen Oct 1999 A
5974036 Acharya et al. Oct 1999 A
5982760 Chen Nov 1999 A
5991279 Haugli et al. Nov 1999 A
5991284 Willenegger et al. Nov 1999 A
5991618 Hall Nov 1999 A
6001800 Mehta et al. Dec 1999 A
6002690 Takayama et al. Dec 1999 A
6005852 Kokko et al. Dec 1999 A
6005855 Zehavi et al. Dec 1999 A
6009106 Rustad et al. Dec 1999 A
6011800 Nadgauda et al. Jan 2000 A
6016312 Storn et al. Jan 2000 A
6028868 Yeung et al. Feb 2000 A
6031827 Rikkinen et al. Feb 2000 A
6034638 Thiel et al. Mar 2000 A
6037905 Koscica et al. Mar 2000 A
6038450 Brink et al. Mar 2000 A
6049535 Ozukturk Apr 2000 A
6049538 Scott Apr 2000 A
6052385 Kanerva et al. Apr 2000 A
6058338 Agashe et al. May 2000 A
6064678 Sindhushayana et al. May 2000 A
6069880 Owen et al. May 2000 A
6069883 Ejzak et al. May 2000 A
6070071 Chavez et al. May 2000 A
6075974 Saints et al. Jun 2000 A
6078572 Tanno et al. Jun 2000 A
6081536 Gorsuch et al. Jun 2000 A
6088335 I et al. Jul 2000 A
6094421 Scott Jul 2000 A
6094576 Häkkinen et al. Jul 2000 A
6097733 Basu et al. Aug 2000 A
6097972 Saints et al. Aug 2000 A
6100843 Proctor, Jr. et al. Aug 2000 A
6101176 Honkasalo et al. Aug 2000 A
6101179 Soliman Aug 2000 A
6104708 Bergamo Aug 2000 A
6111863 Rostoker et al. Aug 2000 A
6112092 Benveniste Aug 2000 A
6115370 Struhsaker et al. Sep 2000 A
6118767 Shen et al. Sep 2000 A
6134233 Kay Oct 2000 A
6151332 Gorsuch et al. Nov 2000 A
6157616 Whitehead Dec 2000 A
6157619 Ozluturk et al. Dec 2000 A
6161013 Anderson et al. Dec 2000 A
6163707 Miller Dec 2000 A
6169731 Stewart et al. Jan 2001 B1
6185184 Mattaway et al. Feb 2001 B1
6185266 Kuchi et al. Feb 2001 B1
6188678 Prescott Feb 2001 B1
6188903 Gardner et al. Feb 2001 B1
6195362 Darcie et al. Feb 2001 B1
6198723 Parruck et al. Mar 2001 B1
6201966 Rinne et al. Mar 2001 B1
6208871 Hall et al. Mar 2001 B1
6212175 Harsch Apr 2001 B1
6212220 Proctor, Jr. Apr 2001 B1
6214342 Rege Apr 2001 B1
6215798 Carneheim et al. Apr 2001 B1
6219342 Rege Apr 2001 B1
6222828 Ohlson et al. Apr 2001 B1
6222832 Proctor Apr 2001 B1
6222873 Bang et al. Apr 2001 B1
6226527 Dalsgaard et al. May 2001 B1
6233439 Jalali May 2001 B1
6236647 Amalfitano May 2001 B1
6236674 Morelli et al. May 2001 B1
6243372 Petch et al. Jun 2001 B1
6246673 Tiedmann, Jr. et al. Jun 2001 B1
6246715 Park et al. Jun 2001 B1
6256509 Tanaka et al. Jul 2001 B1
6259683 Sekine et al. Jul 2001 B1
6262980 Leung et al. Jul 2001 B1
6263013 Hendrickson Jul 2001 B1
6269075 Tran Jul 2001 B1
6269088 Masui et al. Jul 2001 B1
6272168 Lomp et al. Aug 2001 B1
6272354 Saaroi Aug 2001 B1
6275478 Tiedemann, Jr. Aug 2001 B1
6278701 Ayyagari et al. Aug 2001 B1
6285665 Chuah Sep 2001 B1
6292474 Ali et al. Sep 2001 B1
6301291 Rouphael et al. Oct 2001 B1
6304215 Proctor, Jr. et al. Oct 2001 B1
6307840 Wheatley, III et al. Oct 2001 B1
6310859 Morita et al. Oct 2001 B1
6314300 Nakashima et al. Nov 2001 B1
6317092 De Schweinitz et al. Nov 2001 B1
6320851 Kim et al. Nov 2001 B1
6332008 Giallorenzi et al. Dec 2001 B1
6337668 Ito et al. Jan 2002 B1
6353412 Soliman Mar 2002 B1
6353645 Solve et al. Mar 2002 B1
6356555 Rakib Mar 2002 B1
6366570 Bhagalia Apr 2002 B1
6366786 Norman et al. Apr 2002 B1
6370117 Koraitim et al. Apr 2002 B1
6373830 Ozluturk Apr 2002 B1
6373834 Lundh et al. Apr 2002 B1
6377548 Chuah Apr 2002 B1
6377809 Rezaiifar et al. Apr 2002 B1
6388997 Scott May 2002 B1
6388999 Gorsuch et al. May 2002 B1
6389000 Jou May 2002 B1
6396804 Odenwalder May 2002 B2
6396823 Park et al. May 2002 B1
6418148 Kumar et al. Jul 2002 B1
6424645 Kawabata et al. Jul 2002 B1
6426960 Antonio Jul 2002 B2
6452911 Seo Sep 2002 B1
6452913 Proctor, Jr. Sep 2002 B1
6453176 Lopes et al. Sep 2002 B1
6456608 Lomp Sep 2002 B1
6466800 Sydon et al. Oct 2002 B1
6469991 Chuah Oct 2002 B1
6473623 Benveniste Oct 2002 B1
6483816 Tsunehara et al. Nov 2002 B2
6490461 Muller Dec 2002 B1
6498785 Derryberry et al. Dec 2002 B1
6498790 Shaheen et al. Dec 2002 B1
6498939 Thomas Dec 2002 B1
6501787 Odenwalder et al. Dec 2002 B1
6504830 Ostberg et al. Jan 2003 B1
6512751 Struhsaker et al. Jan 2003 B1
6519452 Agostino et al. Feb 2003 B1
6519651 Dillon Feb 2003 B1
6522639 Kitade et al. Feb 2003 B1
6526039 Dahlman et al. Feb 2003 B1
6526064 Bousquet Feb 2003 B1
6526281 Gorsuch et al. Feb 2003 B1
6532226 Lehtinent et al. Mar 2003 B1
6532365 Anderson et al. Mar 2003 B1
6542481 Foore et al. Apr 2003 B2
6545986 Stellakis Apr 2003 B1
6545994 Nelson et al. Apr 2003 B2
6546252 Jetzek et al. Apr 2003 B1
6567391 Moon May 2003 B1
6567416 Chuah May 2003 B1
6567670 Petersson May 2003 B1
6570865 Masui et al. May 2003 B2
6571296 Dillon May 2003 B1
6574211 Padovani et al. Jun 2003 B2
6587446 Sarkar et al. Jul 2003 B2
6597913 Natarajan Jul 2003 B2
6611231 Crilly et al. Aug 2003 B2
6621808 Sadri Sep 2003 B1
6633554 Dalal Oct 2003 B1
6647000 Persson et al. Nov 2003 B1
6687509 Schmutz et al. Feb 2004 B2
6690652 Sadri Feb 2004 B1
6690938 Chin Feb 2004 B1
6697642 Thomas Feb 2004 B1
6707804 Proctor Mar 2004 B2
6717916 Ahn et al. Apr 2004 B1
6718180 Lundh et al. Apr 2004 B1
6724740 Choi et al. Apr 2004 B1
6724743 Pigeonnat Apr 2004 B1
6731954 Katz May 2004 B1
6735188 Becker et al. May 2004 B1
6760596 Fiorini et al. Jul 2004 B1
6768727 Sourour et al. Jul 2004 B1
6775558 Ranta et al. Aug 2004 B1
6782277 Chen et al. Aug 2004 B1
6785247 Lee Aug 2004 B1
6788661 Ylitalo et al. Sep 2004 B1
6795416 Han et al. Sep 2004 B1
6804219 Koo et al. Oct 2004 B2
6807221 Kim et al. Oct 2004 B1
6826169 Fukumasa et al. Nov 2004 B1
6831910 Moon et al. Dec 2004 B1
6868075 Narvinger et al. Mar 2005 B1
6931252 Aroudaki Aug 2005 B1
6934319 Subramanian Aug 2005 B2
6940845 Benveniste Sep 2005 B2
6954444 Ji et al. Oct 2005 B2
6956840 Proctor, Jr. Oct 2005 B1
6963540 Choi et al. Nov 2005 B2
6977910 Hosur et al. Dec 2005 B1
6999471 Frazer et al. Feb 2006 B1
7027420 Hamalainen Apr 2006 B2
7079523 Nelson, Jr. et al. Jul 2006 B2
7136377 Tweedly et al. Nov 2006 B1
7218623 Proctor May 2007 B1
7221664 Proctor May 2007 B2
20010030990 Rouphael et al. Oct 2001 A1
20010033558 Matsuki Oct 2001 A1
20010036200 Nelson et al. Nov 2001 A1
20010038674 Trans Nov 2001 A1
20010039191 Maierhofer Nov 2001 A1
20020009061 Willenegger Jan 2002 A1
20020012332 Tiedemann et al. Jan 2002 A1
20020045441 Ralston et al. Apr 2002 A1
20020080024 Nelson et al. Jun 2002 A1
20020097700 Alastalo et al. Jul 2002 A1
20020141478 Ozluturk et al. Oct 2002 A1
20030060224 Nelson et al. Mar 2003 A1
20030095517 Proctor, Jr. May 2003 A1
20030123401 Dean Jul 2003 A1
20040005078 Tillotson Jan 2004 A1
20040009785 Nelson et al. Jan 2004 A1
20040047328 Proctor et al. Mar 2004 A1
20040073803 Keramane Apr 2004 A1
20040160910 Gorsuch et al. Aug 2004 A1
20040180696 Foore et al. Sep 2004 A1
20050208961 Willenegger Sep 2005 A1
Foreign Referenced Citations (51)
Number Date Country
2812575 Sep 1979 DE
0 443 061 Aug 1991 EP
443061 Aug 1991 EP
0 526 106 Feb 1993 EP
526106 Feb 1993 EP
0526106 Feb 1993 EP
635949 Jan 1995 EP
0 682 423 Nov 1995 EP
0 682 426 Nov 1995 EP
0682423 Nov 1995 EP
682423 Nov 1995 EP
682426 Nov 1995 EP
0 720 309 Dec 1995 EP
720309 Dec 1995 EP
0 719 062 Jun 1996 EP
719062 Jun 1996 EP
0719062 Jun 1996 EP
0 720 309 Jul 1996 EP
0720309 Jul 1996 EP
0 475 698 Mar 1997 EP
0 773 636 May 1997 EP
0 910 176 Apr 1999 EP
1 018 809 Dec 2000 EP
2761557 Jan 1998 FR
2 326 524 Dec 1998 GB
2326524 Dec 1998 GB
59-050603 Mar 1984 JP
02-177643 Jul 1990 JP
03-049324 Mar 1991 JP
07-067164 Mar 1995 JP
07-095151 Apr 1995 JP
07-264098 Oct 1995 JP
08-065273 Mar 1996 JP
09-055693 Feb 1997 JP
566045 Dec 2003 TW
200536325 Nov 2005 TW
9508900 Mar 1995 WO
9608934 Mar 1996 WO
9619050 Jun 1996 WO
9637081 Nov 1996 WO
9627994 Dec 1996 WO
9746041 Apr 1997 WO
9723073 Jun 1997 WO
9726726 Jul 1997 WO
9732412 Sep 1997 WO
9746044 Dec 1997 WO
9914869 Mar 1999 WO
9931811 Jun 1999 WO
9952306 Oct 1999 WO
9963682 Dec 1999 WO
0072464 Nov 2000 WO
Related Publications (1)
Number Date Country
20050013284 A1 Jan 2005 US
Continuations (3)
Number Date Country
Parent 09997732 Nov 2001 US
Child 10895591 US
Parent 09730376 Dec 2000 US
Child 09778474 US
Parent 09088413 Jun 1998 US
Child 09730376 US
Continuation in Parts (1)
Number Date Country
Parent 09778474 Feb 2001 US
Child 09997732 US