Multi-detection of heartbeat to reduce error probability

Information

  • Patent Grant
  • 9525923
  • Patent Number
    9,525,923
  • Date Filed
    Tuesday, July 8, 2014
    10 years ago
  • Date Issued
    Tuesday, December 20, 2016
    8 years ago
Abstract
A communications system improves performance of detecting a signal having an indication of a request to change communications states by making at least two positive identifications of the request in a given time frame. The system may further improve performance by applying a difference in power levels for a non-request state (i.e., steady state or ‘control hold’ state) versus a request state (i.e., ‘request to change’ state). In one particular application, a base station determines a request to change communications states with a reasonably high probability of detection and a reasonably low probability of false detection. The system has a reduced number of erroneous communications states, such as erroneous traffic channel allocations. The detection technique is compatible with 1xEV-DV systems and I-CDMA systems, but general enough to support systems employing various other communications protocols used in wired and wireless communications systems.
Description
COPYRIGHT NOTICE

A portion of the disclosure of this patent document contains material which is subject to copyright protection. The copyright owner has no objection to the facsimile reproduction by anyone of the patent document or the patent disclosure, as it appears in the Patent and Trademark Office patent file or records, but otherwise reserves all copyright rights whatsoever.


TECHNICAL FIELD

The subject matter described herein relates generally to the field of computing, and more particularly, to multi-detection of heartbeat to reduce error probability.


BACKGROUND

The subject matter discussed in the background section should not be assumed to be prior art merely as a result of its mention in the background section. Similarly, a problem mentioned in the background section or associated with the subject matter of the background section should not be assumed to have been previously recognized in the prior art. The subject matter in the background section merely represents different approaches, which in and of themselves may also correspond to embodiments of the claimed subject matter.


Increasing use of wireless telephones and personal computers has led to a corresponding increase in demand for advanced telecommunication services that were once thought practical only for specialized applications. In the 1980s, wireless voice communications became widely available through cellular telephone networks. Such services were thought at first to be for the exclusive province of businessmen 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 affordable new technologies, the general population now increasingly desires to have not only wireline access to networks such as the Internet and private intranets, but also wireless access as well. Wireless technology is particularly useful to users of portable computers, laptop computers, hand-held personal digital assistants and the like who prefer access to such networks without being tethered to a telephone line.


There still is no widely available satisfactory solution for providing low cost, high speed access to the Internet, private intranets, and other networks using the existing wireless infrastructure. This is most likely an artifact of several unfortunate circumstances. First, the typical manner of providing high speed data service in the business environment over a wireline network is not readily adaptable to the voice grade service available in most homes or offices. For example, such standard high speed data services do not necessarily lend themselves to efficient transmission over standard cellular wireless handsets because wireless networks were originally designed only to provide voice services. As a result, present day digital wireless communications systems are optimized for voice transmissions, although certain schemes such as CDMA do provide some measure of asymmetrical behavior for the accommodation of data transmissions. For example, the data rate specified by the Telecommunication Industry Association (TIA) for IS-95 on the forward traffic channel is adjustable in increments from 1.2 kbps up to 9.6 kbps for so-called Rate Set 1, and increments from 1.8 kbps up to 14.4 kbps for Rate Set 2. On the reverse link traffic channel, however, the data rate is fixed at 4.8 kbps.


At best, existing wireless systems therefore typically provide a radio channel that can accommodate maximum data rate transfers of 14.4 kilobits per second (kbps) over a forward link 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 that 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.


Although wireline networks were known at the time when cellular systems were initially developed, for the most part, there was no provision made for such wireless systems to provide higher speed ISDN- or ADSL-grade data services over cellular network topologies.


In most wireless systems, there are many more potential users than radio channel resources. Some type of demand-based multiple access system is therefore required.


Whether the multiple access is provided by the traditional Frequency Division Multiple Access (FDMA) using analog modulation on a group of radio frequency carrier signals, or by schemes that permit sharing of a radio carrier frequency using Time Division Multiple Access (TDMA), or Code Division Multiple Access (CDMA), the nature of the radio spectrum is such that it is expected to be shared. This is quite dissimilar to the traditional environment supporting data transmissions in which the wireline medium is relatively inexpensive and is not typically intended to be shared.


Other factors to consider in the design of a wireless system are the characteristics of the data itself. For example, consider that access to web pages generally is burst-oriented, with asymmetrical data rate transmission requirements in a reverse and forward direction. In a common application, a user of a remote client computer first specifies the address of a web page to a browser program. The browser program then sends the web page address data, which is usually 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 thereafter may spend several seconds or even several minutes reading the content of the page before downloading another web page.


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 an extended period of time, such as accessing locally stored data or even terminating use of the computer altogether. Therefore, even though such users may remain connected to the Internet or private intranet continuously during an entire day, actual use of the high speed data link is usually quite sporadic.


If wireless data transfer services supporting Internet connectivity are to coexist with wireless voice communication, it is becoming increasingly important to optimize the use of available resources in wireless CDMA systems. Frequency re-use and dynamic traffic channel allocation address some aspects of increasing the efficiency of high performance wireless CDMA communication systems, but there is still a need for more efficient utilization of available resources.


SUMMARY OF THE INVENTION

One way of making more efficient utilization of available resources is to ensure the resources are allocated in an error-free manner. For example, a base station should not allocate traffic channels to a field unit when a request for traffic channels has not been made. Similarly, the base station should allocate traffic channels to a field unit when a request has been made. Such a request is made by the field unit when the field unit is employed by a user to send traffic data to a remote network node.


In one application, a transmission of a marker in a time slot over one channel indicates a request by the corresponding field unit to go active. That is, transmission of a marker in an assigned time slot indicates that the field unit is requesting that reverse link traffic channels be assigned to the user for transmitting a data payload from the field unit to the base station. This presumes that the field unit is presently in the standby mode. Alternatively, a field unit transmits a marker over a second channel of the pair of reverse link channels to indicate that the field unit is not requesting to be placed in the active mode. For example, the field unit does not want to transmit data on a reverse link channel. Rather, the field unit requests to remain inactive but synchronized with the base station so that the field unit can immediately go active again at any moment.


In either case, the present invention improves performance for detecting a signal having a marker, or indication, of a request to change communications states, for example, by making a measurement of the indications to determine that a request to change communications states has been made. In one particular embodiment, the measurement includes at least two positive identifications of the request in a given time span. The system may further improve performance by applying a difference in power levels for a non-request state (i.e., steady state or ‘control hold’ state) versus a request state (i.e., ‘request to change’ communications state). The result may include a reduced number of erroneous communications states, such as erroneously assigned or allocated traffic channels.


In one particular application, a subscriber unit provides a heartbeat channel using a first code in a CDMA system in a heartbeat with request channel using a second code in the reverse link to a base station. The subscriber unit provides the signal(s) with a repetition and, optionally, different power levels in a manner that a base station employing the principles of the present invention determines a request to change communications states with a reasonably high probability of detection and a reasonably low probability of false detection.


The teachings of the present invention are compatible with 1xEV-DV systems and I-CDMA systems, but general enough to support systems employing various other communications protocols used in wired and wireless communications systems. Code Division Multiple Access (CDMA) systems, such as IS-2000, and Orthogonal Frequency Division Multiplexing (OFDM) systems, such as IEEE 802.11a wireless local area network (LAN), may employ an embodiment of the present invention.





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. The drawings are not necessarily to scale, emphasis instead being placed upon illustrating the principles of the invention.



FIG. 1 is a schematic diagram of a communications system in which in an embodiment of the present invention may be deployed;



FIG. 2A is a schematic diagram of a subsystem employed by a base station in the communications system of FIG. 1 used to determine whether a reverse link signal includes an indication for a request to change communications states;



FIG. 2B is a flow diagram of a process executed by a state machine in the subsystem of FIG. 2A;



FIG. 3A is a signal diagram of a 1xEV-DV signal with a first marker indicating ‘control hold’ and a second marker indicating a ‘request to go active’;



FIG. 3B is a signal diagram of a code division multiple access (CDMA) set of code channels having a marker in an assigned time slot that indicates that the field unit is requesting a change in communications states;



FIG. 3C is a signal diagram of an alternative embodiment of a reverse link signal having the indications; and



FIG. 4 is a plot of signal-to-noise ratio versus probability of detection that may be used in determining energy levels of the indications in the signals of FIGS. 3A-3C.





DETAILED DESCRIPTION OF THE INVENTION

A description of preferred embodiments of the invention follows.


The cost of missed or erroneous detection of Heartbeat (HB) and Heartbeat with Request to Go Active (HB/RQST) signals is costly. If a false detection occurs for HB, power control commands and timing commands used between a base station and field terminal may be generated based on a received code phase that is not correct. Thus, the power control can be erroneous and not based on the actual received power from the terminal. For the request message, resources will be assigned to a user when the resources are not needed, which results in wasted capacity.


Traditionally, if a very low probability of false detection is important, a requirement of a very high Eb/No (i.e., energy-per-bit per noise density) threshold at the Base Transceiver Station (BTS) is imposed. As an alternative, if the speed of detection is less important, as in the case of the HB signal, multiple successive detections may be useful. This allows the probability of false detection to be greatly reduced.


For instance, if the P(fd)=0.01 and if three detections in a row is specified to be made before a “Valid Detection” is determined, the overall P(fd)=(0.01)^3 or 0.000001. This is less costly for detection as the probability is much higher to start with. For instance, if the single detection probability is 0.9, requiring three detections lowers the detection probability to 0.9^3 or 0.72, only a slight reduction. This technique is known in radar systems, but has not been used in this application for detecting HB and HB/RQST signals and other communications systems and applications. It should be understood that the HB and HB/RQST signals are examples of signals to which the teachings of the present invention may be applied and not intended to be limiting in any way.


The signals to be detected and counted (i) may be successive—either in time or by user allocated slot in a TDMA system, for example—or (ii) may have breaks between the signals but have a given number of pulses, bits, or other indicators in a given time interval. For a CDMA reverse link, requiring multiple serial detections or non-serial detections may be used to qualify as a system level detection. Further, the system may set a different power control target versus a detection target, which means that for a lower transmission power, integration time is increased to increase energy for detection. For a system that uses time slots, the system may include intelligence to monitor successive or non-successive time slots for the given user. In addition, the system works on gated and non-gated signals.


The interference level of the heartbeats is derived as a classical RADAR detection problem. To this end, the benefits are made possible based on the heartbeat pulses being “detected” rather than being demodulated as in the case with the Dedicated Control Channel (DCCH) and Slotted Control Hold Mode (DCHM) in CDMA technology.



FIG. 1 is a diagram of an example communications system 100, similar to the system described above, employing an embodiment of the present invention. A base transceiver station (BTS) 25 with antenna tower 23 maintains wireless communications links with each of a plurality of field units 42a, 42b, 42c (collectively, field units 42) as shown. Such wireless links are established based upon assignment of resources on a forward link 70 and a reverse link 65 between the base station 25 and field units 42. Each link 65 or 70 is typically made up of several logical reverse link channels 55 and several logical forward link channels 60, respectively.


As shown, the communications system 100 supports wireless communications between an interface 50 and a network 20. Typically, the network 20 is a Public Switched Telephone Network (PSTN) or computer network, such as the Internet, internet, or intranet. The interface 50 is preferably coupled to a digital processing device, such as a portable computer 12, sometimes referred to as an access unit, to provide wireless access to the network 20. Consequently, the portable computer 12 has access to the network 20 based on communications over a combination of both hard-wired and wireless data links.


In a preferred embodiment, the forward link channels 60 and reverse link channels 55 are defined in the communications system 100 as Code Division Multiple Access (CDMA) channels. That is, each CDMA channel is preferably defined by encoding and transmitting data over the channel with an augmented pseudo random noise (PN) code sequence. The PN coded data is then modulated onto a radio frequency carrier. This enables a receiver to decipher one CDMA channel from another knowing only the particular augmented PN code assigned for a given channel. In accordance with an embodiment, each channel preferably occupies a 1.25 MHZ band consistent with the IS-95 CDMA standard or 1xEV-DV standard and is capable of transmitting at 38.4 kbps.


A forward link 70 includes at least four, logical, forward link channels 60. As shown, this includes a Pilot Channel 60PL, Link Quality Management (LQM) channel 60L, paging channel 60PG and multiple traffic channels 60T.


The reverse link 65 includes at least five logical channels 55. As shown, this includes a heartbeat standby channel 55HS, heartbeat request active channel 55HRA, access channel 55A and multiple traffic channels 55T. Generally, the reverse link channels 55 are similar to the forward link channels 60 except that each reverse link traffic channel 60T can support variable data rates from 2.4 kbps to a maximum of 160 kbps.


Data transmitted between the base station 25 and field unit 42a typically include encoded digital information, such as web page data. Based on the allocation of multiple traffic channels in the reverse link 65 or forward link 70, higher data transfer rates can be achieved in a particular link between the base station 25 and field unit 42a. However, since the field units 42 compete for bandwidth allocation, a field unit 42a may have to wait until resources are free to be assigned traffic channels to transmit a data payload.


Before discussing an example detector system (FIG. 2) that can be used to distinguish a heartbeat from a heartbeat-with-request signal, a brief discussion of example signals will be discussed in reference to FIGS. 3A-3C.


In FIG. 3A, a 1xEV-DV signal 160 that may be transmitted by the field unit is shown having three distinct states: a ‘control hold’ state 165, a ‘request to go active’ state 170, and a data traffic state 175. In the ‘control hold’ state 165, the signal 160 does not include a ‘request to go active’ indication. In other words, the signal 160 remains in an ‘idle’ or ‘control hold’ state, which indicates that the field unit 42a is not requesting traffic channels. The ‘request to go active’ state 170 is an indication that the field unit is requesting to transmit data on a traffic channel over a reverse link to the BTS 25. In the traffic state 175, traffic data is transmitted by the field unit to the BTS. Following transmission of the traffic data over the reverse link, the signal 160 reverts back to the ‘control hold’ state 165 following a transmission of a ‘data transmission complete’ state (not shown).


Although shown as a single signal 160, it should be understood that the signal may be multiple signals, optionally coded with orthogonal or non-orthogonal codes into mutually exclusive channels. For example, the ‘control hold’ state 165 may be transmitted on a different channel from the ‘request to go active’ state 170. Similarly, the traffic data transmitted in a transmit state 175 may be on a separate channel from the other two states 165, 170. An example of multiple channel is discussed in reference to FIGS. 3B and 3C.



FIG. 3B is an example of an Internet code division multiple access (I-CDMA) signaling diagram that has assigned time slots for users 1, 2, 3, . . . , N repeating in epoch i 177a, epoch i+1 177b, and so forth. The channels are composed of the heartbeat channel 55H, request channel 55R, and traffic channels 55T. Each of these channels has an associated code C1, C2, C3, C4, . . . , CN, which allow signals to be transmitted on mutually exclusive code channels. Both the transmitting and receiving systems process the information in the channels by using the codes to separate the information respectively included therein in a typical CDMA manner.


In the example shown, users 1, 2, 4, 5, 6, . . . , N are requesting to remain in an idle state, indicated by the presence of a signal 180 in the heartbeat channel 55H. User 3, however, is requesting to transmit data over a reverse link based on a signal 185 in the request channel 55R in the first epoch 177a, a signal 185b in the request channel 55R in the second epoch 177b, and possibly additional epochs. In the third epoch 177c, the BTS 25 has detected the request to transmit data based on the two consecutive indications 185a and 185b. Following receipt of an acknowledgment, user 3 begins to transmit traffic data 190 in an associated traffic channel using code C5. In an alternative embodiment, the BTS 25 may require three consecutive indications 185a through 185c before determining that a request is being made and acknowledging same.



FIG. 3C is a more detailed signal diagram of the 1xEV-DV signal of FIG. 3A that is used to indicate a ‘request to go active’ to the base station 25 from the field unit 42a. In this embodiment, the 1xEV-DV signal is composed of multiple signals on different logical channels: a heartbeat channel 55H and a request channel 55R. The heartbeat channel 55H provides continuous timing and other information (e.g., power level, synchronization, etc.) from the field unit 42a to the base station 25. The field unit 42a uses the request channel 55R to make a request (e.g., digital “1”) of the base station 25 to request a traffic channel on the reverse link 65 for transmitting data.


Sampling times 195a, 195b, . . . , 195f (collectively 195) denoted by arrows indicate times or intervals at which the BTS 25 samples the time slots of the request signal 55R and, optionally, the heartbeat channel 55H to determine whether a request for a traffic channel is being made. It should be understood that the sampling may occur over the entire time slot or a subset thereof. Also, the heartbeat channel 55H and request channel 55R use mutually exclusive codes, in this particular embodiment, so the sampling is performed on their mutually exclusive code channels 55H, 55R in all or a subset of time slots. In one particular embodiment, the base station 25 samples mutually exclusive code channels 55H, 55R in time slots designated for request indications, such as in time slots at sampling times 195b, 195d, and 195f. During these time slots, the heartbeat channel 55H is “inactive”, but the request channel 55R is “active”.


As discussed above, the signals in the “active” request time slots may be modulated messages or simply coded pilot signals with no “bits”. Thus, detection may be based solely on the respective energy levels of the heartbeat and heartbeat-with-request signals in respective time slots over a given time interval or spanning several time intervals.


In one particular embodiment, the ‘control hold’ state 165 indication has a first energy level, and the ‘request to go active’ state 170 has a second energy level. The base station 25 may take advantage of the difference in power levels in addition to the repetition of the pulses used to indicate a request to go active. For example, in this particular embodiment, distinguishing the two states may be a matter of measuring energy levels of the signals(s) and (i) comparing the energy levels against at least one threshold or (ii) determining that a request is present, optionally in a mutually exclusive code channel in time slots when the heartbeat signal is at a logical zero. The different energy levels of the indications may be provided by the duty cycle of the signals, frequency of the signals, power of the signals, signaling structure, and so forth.


To understand how the energy levels of the signals can be used to improve system performance, on can refer to FIG. 4, which provides a chart for selecting signaling requirements based on the following parameters or factors: (i) probability of detection, P(d)(x-axis), (ii) signal-to-noise ratio in decibels (y-axis), and (iii) probability of false detection, P(fd) (curves in the chart). This chart shows a required signal-to-noise ratio at the input terminals of a linear-rectifier detector as a function of probability of detection for a single pulse, with the false-alarm probability P(fd) as a parameter, calculated for a non fluctuating signal. It should be understood that alternative parameters or factors may be used to establish or define the transmitted power levels of the indications.


At the circled point 200, the signal-to-noise ratio is 3 dB, P(d)=20%, and P(fd)=1%. To increase the probability of detection for the same probability of false detection, one simply needs to slide the circled point 200 upward along the same probability of false detection curve, which suggests that an increase in the signal-to-noise ratio is used to improve system performance and, thus, improving the likelihood that the request signal will be detected quickly.


Before providing an example model and discussion regarding example Heartbeat standby 55HS and Heartbeat Request Active 55HRA energy levels for the example communications system 100 (FIG. 1), a brief discussion of a processor and detector that may be used in the system is now provided.



FIG. 2A is a schematic diagram of a request detection processor 110 used to determine whether the field unit 42a has requested to send data to the BTS 25. The receiver Rx 35 receives signals 55, which includes the maintenance channel 55M, traffic channels 55T, access channel 55A, heartbeat standby channel 55HS, and heartbeat request active channel 55HRA. The signal 55 is processed such that a heartbeat channel processor 112 receives the heartbeat standby channel 55HS and a request channel processor 114 receives the Heartbeat Request Active channel 55HRA.


The heartbeat channel processor 112 and request channel processor 114 include the same processing elements, in this particular embodiment, so a discussion of just the heartbeat channel processor 112 will be provided for brevity.


The heartbeat channel processor 112 receives the heartbeat standby channel 55HS. A correlator 115 uses a despreader 120 to despread the heartbeat standby channel 55HS. An integrator 125 is used to coherently combine the heartbeat signal. By coherently combining the signal, an integration of I, Q and its phase causes the phase of the signal to be removed and output the power of the signal.


Following the correlator 115, a rectifier 130 (i.e., absolute value of the signal squared) rectifies the power of the signal, which is then integrated by a second integrator 135 to calculate the energy of the received heartbeat signal. The second integrator 135 provides non-coherent combination of the signal, which is calculated over short time intervals. The non-coherent integration provides just magnitudes if the terminal is moving too fast, thus causing a cross-over of the 180-degree phase point, which can cause ambiguities in determining the energy of the signal in the absence of the non-coherent combination.


The output from the heartbeat channel processor 112 is a heartbeat energy level, and the output from the request channel processor 114 is a request energy level. Each of these energy levels, in this particular embodiment, is fed to a hypothesis detector 140, which determines whether a heartbeat signal, request signal, or neither signal is in the signal 55 received by the base station 25.


The output from the hypothesis detector 140 is provided to a state machine 145. The state machine is used to determine whether the field unit is making a ‘request to go active’ according to a given criteria, where, in one particular embodiment, is a measurement of the output from the hypothesis detector 140. Example measurements include counting the number of consecutive request signals, measuring a ratio of heartbeat standby channel signals and heartbeat request active channel signals, counting heartbeat request active signals in a given time span, and so forth. Further, the hypothesis detector 140 and the difference in energy levels of the indications improves system performance, but are not required for the present invention. In other words, the heartbeat standby channel 55HS and heartbeat request active channel 55HRA may be processed directly by the state machine 145 to determine whether the field unit 42a is requesting to go active. More detail is provided following a description of an embodiment of the state machine 145.


In this particular embodiment, the state machine 145 outputs a Boolean true or false signal. An example of a process executed by the state machine is depicted in FIG. 2B.



FIG. 2B is an example flow diagram of the state machine 145. The example state machine 145 starts in step 205 when the detection processor 110 “boots up.” In step 210, the state machine 145 initializes counters that are used to determine if a detection has occurred. In step 215, the state machine 145 receives the output from the hypothesis detector 140. After boot up, the state machine 145 may act as an ‘interrupt service routine’, beginning in step 215, upon receipt of any output from the hypothesis detector 140. The counters are cleared (i.e., set to zero) upon a determination of a detection or a non-detection to reset the measurement process without are-boot of the detection processor 110, as discussed below.


Following receipt of the output from the hypothesis detector 140 in step 215, the state machine 145 determines whether the output of the hypothesis detector 145 is a request (i.e., ‘request to go active’). If yes, then the state machine 145 continues in step 240 in which a detection counter is incremented. In step 245, the detection counter is compared against a threshold. If the detection counter exceeds the threshold, then, in step 250, the state machine 145 reports a detection of a ‘request to go active’ from the field unit 42a. If the detection counter does not exceed the threshold, then the state machine 145 returns to step 215 and waits to receive another output from the hypothesis detector 140.


Continuing to refer to FIG. 2B, if, in step 220, the output of the hypothesis detector 140 is determined not to be a ‘request’, then the state machine 145 continues in step 225. In step 225, the state machine 145 increments a non-detection counter. In step 230, a determination is made as to whether the non-detection counter exceeds a threshold. If yes, then the state machine 145 continues in step 235, in which the state machine 145 reports a non-detection of a ‘request to go active’ by the field unit 42a. If the non-detection counter does not exceed the threshold, then the state machine 145 continues in step 215.


Following steps 235 and 250, the state machine 145 clears the counters in step 255, allowing the state machine 145 to detect future ‘requests to go active’ by the field unit 42a. In step 260, the state machine 145 ends.


The detection counter is used by the state machine 145 to determine how many indications of a ‘request to go active’ have been received by the detection processor 110 according to a given criteria. The criteria can be of any form, including a given number of consecutive detections, a given number of detections in a given time span, or a ratio of detections to non-detections. Alternative non-counting based measurements may be employed to determine whether a request is being made to go active, such as measuring the phase of the request signals.


It should be understood that alternative embodiments of using counters or other criteria may be used by the state machine 145. For example, the state machine 145 may use other process flows, non-counter variables, or other standard or non-standard techniques for determining a detection. Further, rather than receiving the output from the hypothesis detector 140, the input to the state machine 145 may be raw data from the heartbeat channel processor 112 or request channel processor 114. Further, in an alternative embodiment, the state machine 145 may be included in combination with the hypothesis detector 140.


Referring again to FIG. 2A, in addition to using the state machine 145 to ascertain with high probability whether the field unit 42a is making a ‘request to go active’, the hypothesis detector 140 is also employed.


To determine which signal(s) is/are present, the hypothesis detector 140 includes logical functions. For example, in this particular embodiment, the hypothesis detector 140 compares a first energy level threshold against the first energy level (i.e., heartbeat energy level) and compares a second energy level threshold against the second energy level (i.e., request energy level).


Example energy level thresholds against which to compare the heartbeat energy level and the request energy level are 9 dB and 11 dB, respectively. The energy level thresholds may be dynamically selected, predetermined, or applied in another manner, such as based on a transmitted power level, which may be reported by the field unit to the base station over the heartbeat standby channel 55HS, for instance. In the case of the energy level calculation and comparison, the first and second energy levels may be dependent on occupancy of time slots in the signaling channel(s) used by the signal 55, so the energy level thresholds can be based on an expected or specified number of “I” bits used to indicate a ‘request to go active’ or to indicate a request to remain in idle mode. Use of the energy level thresholds is discussed in related U.S. patent application entitled “Transmittal of Heartbeat Signal at a Lower Than Heartbeat Request,” by Proctor, J., filed concurrently herewith, the entire teachings of which are incorporated herein by reference.


As discussed above, the output of the hypothesis detector 140 is measured by the state machine 145 determine whether to change the state of the communications system, which is the state of reverse link traffic channels between the field unit 42a and the base station 25. For example, if the hypothesis detector 140 determines that a ‘request to go active’ (i.e., send a data transmission on the reverse link) is being made by the field unit 42a, then the state machine 145 outputs a signal to a processor (not shown) in the BTS 25 that is responsible for providing the portable computer 12 with a traffic channel 55T. In one particular embodiment, the BTS 25 allocates the traffic channel 55T if the number of consecutive request signals is determined to be two or more consecutively. Alternative criteria have been discussed above.


As described in reference to FIG. 3C, the heartbeat channel processor 112, request channel processor 114, and hypothesis detector 140 may be configured or designed in a manner that monitors an occupancy of time slots used to indicate the request to change communications states. In one embodiment, the detecting includes monitoring occupancy of mutually exclusive code channels, such as shown in FIGS. 3B and 3C.


A feedback loop (not shown) may be employed to cause the heartbeat channel processor 112 and request channel processor 114 to be “adaptive”. For example, based on the received energy level of the heartbeat channel 55H, the integration time of the integrators 125, 135 may be adjusted, and the energy level thresholds used by the hypothesis detector 140 for comparison of the energy levels of the heartbeat and request signals may also be adjusted by the feedback loop. Other feedback may cause (i) the number of consecutive pulses required for a detection to be increased or decreased or (ii) the number of transmitted request signals to be increased or decreased. Such a feedback loop may use a command or message to transfer information between the BTS 25 and field unit 42a that includes information regarding the pulse repetitions or power levels of the heartbeat and heartbeat-with-request signals transmitted by the field unit 42a.


As discussed above, the first communications state may be a standby state and the second communications state may be a payload state. In other systems or even the same system, the communications states may refer to other communications states, such as a request to change base stations, power control signaling, and so forth. The use of different signal repetitions or energy levels in signaling as described herein is applicable to wireless, wired, or optical communications systems. In either case, the communications states may be used in voice or data communications systems.


As also discussed above, the second energy level may be based on a target probability of detection, false detection, or combination of both as discussed in reference to FIG. 4. In other words, the field unit may transmit the request signal at a given power level or a given number of pulses per given time period to achieve a corresponding signal-to-noise ratio for a given target probability of detection, false detection, or both as discussed in reference to FIG. 4.


An analysis may be used to set the transmission power or number of transmitted indications, or the feedback mechanism discussed above may be employed in the communications system for causing the field unit to change its behavior so as to have the received energy levels of the indications achieve a predetermined signal-to-noise ratio, thus providing the desired probability of detection and false detection parameters.


Simulation


A simulation for a reverse link was conducted where the reverse link is assumed to have power control and a heartbeat channel of any of the example types shown in FIGS. 3A-3C or another type of communications link signaling.


First, there are two assumptions that have been made for this simulation. First, power control is used on a combination of detected paths or in a single path. Power control is performed even when a positive detection is not achieved. Second, the probability of detection was set to achieve detection at a high enough rate to ensure that power control is performed on the correct signal. To clarify, detection is required to track the received signal.


Table 1 shows the rate of detection required for a single path channel from a vehicle moving away from the base station at 60 mph. This table requires that there is at least one detection per slew of a chip due to movement.













TABLE 1









Slew Distance for 1 chip
814
ft



Handset Velocity
60
mph



Handset Velocity
88
ft/s



Chip Slew Rate
9.2
chips/s



Heartbeat Rate
50
HB/s










Heartbeats/Td
462










In Table 1, the time period Td is defined as the period over which a single heartbeat pulse must be detected to ensure the signal is tracked as the time of arrival of the signal is skewed due to movement of the vehicle. Table 1 shows that one out of every 462 pulses must be received with a very high probability or there is a risk of losing the tracking of the signal.


Based on this calculation, the threshold of detection was set from a table of detection/false detection probabilities (e.g., FIG. 4). While Table 1 is defined for Additive White Gaussian Noise (AWGN), it is expected that the probabilities of detection are not greatly affected over a relatively short amount of time. This is due to the statistical independence of the fading from heartbeat pulse to heartbeat pulse.


While the individual pulse probabilities of detection varied significantly, the overall results were not seen to vary significantly by more than a factor of roughly 50% in the latency of detection. Specifically, the average detection latency for the request message in AWGN was 11 ms as compared to roughly 15 ms for 30 km/hr. Again, this result is due to requiring a detection process rather than a more difficult demodulation process.


Based on this analysis, a probability of detection of 20% and false detection of 1% was selected. This requires an average Eb/No of 3 dB. This is shown and discussed in reference to FIG. 4.


Table 2 shows a calculation of the probability of detection and false detection during the time Td defined above.












TABLE 2









Target E/Io (entire energy/interference density)
3 dB



Probability of detection
0.2



Probability of false detection
0.01



Probability of detection for 3 Sequential HB
8.00E−03



Number of trials in Td
462



Probability of no detection in Td
2.44E−02



Probability of false detection for 3 sequential
1.00E−06



Required no false detection trials
462



Probability of false detection for Td
4.62E−04










To reduce the probability of false detection, three sequential detections were required to validate a single detection. Since the probability of false detections is multiplicative in this case, the probability of a single false detection is cubed.


Table 3 below calculates the average Echo (energy-per-chip per the interference density, which is the SNR integrated over the entire chip) required to achieve the statistics of Table 2.












TABLE 3









Target E/Io
   3 dB



Processing Gain
256



Burst Ec/Io
−21.08 dB 



Average Ec/Io
−40.9 dB










Since the heartbeat channel is time division multiplexed (TDM) in structure, the interference to all other users due to heartbeat users increases as follows:


Effective average Echo (all HB users)=10*log 10(N)−40.9, where N is the number of users.


Thus, for 96 users of a given base station, the average total interference will equal the burst Echo or −21.08 dB.


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 wireless transmit receive unit (WTRU) comprising: a receiver configured to receive at least one signal having a first indication of a first communications state, and a second indication for a request to change to a second communications state;wherein the first indication has a first energy level and further wherein the second indication has a second energy level;at least one monitor configured to monitor at least one first time slot for detecting the first indication, and at least one second time slot for detecting the second indication;a counter coupled to the at least one monitor configured to count at least one of the detected first or second indications; anda processor coupled to the counter configured to determine whether a request to change communications states has been performed based on the counting and based further on a difference in energy levels of the first and second indications.
  • 2. The WTRU of claim 1 wherein the processor is further configured to compare a number of counted detected second indications against a threshold of at least two detected second indications.
  • 3. The WTRU of claim 1 wherein the counter is further configured to reset if non-consecutively detected first indications or non-consecutively detected second indications are received in the at least one signal.
  • 4. The WTRU of claim 3 wherein the counter is further configured to reset if the threshold of at least two detected second indications is not achieved in a given time span.
  • 5. The WTRU of claim 1 wherein the at least one monitor is configured to measure the at least one signal in the at least one first and second time slots, and to compare results thereof to first and second thresholds for detecting the first and second indications.
  • 6. The WTRU of claim 1 wherein the first and second time slots are not shared in time and do not overlap and when a when a heartbeat signal of the WTRU is at a logical zero.
  • 7. A method for use in a wireless transmit receive unit (WTRU), the method comprising: receiving at least one signal having a first indication of a first communications state, and a second indication for a request to change to a second communications state;wherein the first indication has a first energy level and further wherein the second indication has a second energy level;monitoring at least one first time slot for detecting the first indication, and at least one second time slot for detecting the second indication;counting, via a counter, at least one of the detected first or second indications and storing a count; anddetermining, via a processor coupled to the counter, whether a request to change communications states has been performed based on the counting and based further on a difference in energy levels of the first and second indications.
  • 8. The method of claim 7 further comprising: comparing a number of counted detected second indications against a threshold of at least two detected second indications.
  • 9. The method of claim 7 further comprising: resetting the count if non-consecutively detected first indications or non-consecutively detected second indications are received in the at least one signal.
  • 10. The method of claim 9 further comprising: resetting the count if the threshold of at least two detected second indications is not achieved in a given time span.
  • 11. The method of claim 7 further comprising: measuring the at least one signal in the at least one first and second time slots; andcomparing results thereof to first and second thresholds for detecting the first and second indications.
  • 12. The method of claim 7 wherein the first and second time slots are not shared in time and do not overlap and when a when a heartbeat signal of the WTRU is at a logical zero.
  • 13. The method of claim 7, further comprising: determining at a base station whether the WTRU is making a request to go active.
  • 14. The method of claim 13, wherein determining the WTRU is making the request to go active is based upon a measurement comprising one or more of counting a number of consecutive request signals, measuring a ratio of heartbeat standby channel signals and heartbeat request active channel signals, counting heartbeat request active signals in a given time span, and comparing a difference in the energy levels against a threshold.
  • 15. The method of claim 14, wherein the threshold is based on an expected or specified number of “I” bits used to indicate a request to go active or an expected or specified number of “I” bits used to indicate a request to remain in idle mode.
  • 16. The method of claim 13, wherein determining the WTRU is making the request to go active is based on the counter exceeding a threshold, wherein a state machine at the base station reports a detection of a request to go active from the WTRU when the counter exceeds the threshold and wherein the state machine waits to receive further data when the counter does not exceed the threshold.
  • 17. The method of claim 13, wherein determining the WTRU is making the request to go active is based on how many indications of a request to go active have been received according to specified criteria comprising any one of: a number of consecutive detections of a request to go active, a number of detections of a request to go active in a specified time span, and a ratio of detections of a request to go active to non-detections of a request to go active.
  • 18. The method of claim 7, wherein the difference in energy levels of the first and second indications is based on a transmitted power level as reported by the WTRU to a base station over a heartbeat standby channel.
  • 19. The method of claim 18, wherein an energy level calculation and comparison is performed to determine the difference in energy levels of the first and second indications, wherein the first and second energy levels is dependent on occupancy of time slots in signaling channels used by the at least one signal.
CLAIM OF PRIORITY

This application is a continuation of U.S. application Ser. No. 12/165,422 filed Jun. 30, 2008, which is a continuation of U.S. application Ser. No. 10/171,378 filed Jun. 12, 2002, now U.S. Pat. No. 7,394,791 which issued on Jul. 1, 2008, which claims the benefit of U.S. Provisional Application No. 60/378,903 filed May 7, 2002 and U.S. Provisional Application No. 60/378,697 filed May 7, 2002, and U.S. Provisional Application No. 60/297,925 filed Jun. 13, 2001 and U.S. Provisional Application No. 60/297,987 filed Jun. 13, 2001; U.S. application Ser. No. 10/171,378 is a continuation-in-part of U.S. application Ser. No. 09/775,305 filed Feb. 1, 2001, now U.S. Pat. No. 7,079,523 which issued on Jul. 18, 2006, which claims the benefit of U.S. Provisional Application No. 60/180,598 filed Feb. 7, 2000; U.S. application Ser. No. 10/171,378 is a continuation-in-part of U.S. application Ser. No. 09/997,621 filed Nov. 29, 2001, now U.S. Pat. No. 6,678,260 which issued on Jan. 13, 2004, which is a continuation of U.S. application Ser. No. 09/730,376 filed Dec. 5, 2000, now U.S. Pat. No. 6,707,804 which issued on Mar. 16, 2004, which is a continuation of U.S. application Ser. No. 09/088,413 filed Jun. 1, 1998, now U.S. Pat. No. 6,222,832 which issued on Apr. 24, 2001, the entire contents of which are incorporated herein by reference.

US Referenced Citations (472)
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
4448155 Hillebrand et al. May 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 Jun 1987 A
4700197 Milne Oct 1987 A
4817089 Paneth Mar 1989 A
4841526 Wilson et al. Jun 1989 A
4862453 West et al. Aug 1989 A
4866709 West et al. Sep 1989 A
4887266 Neve et al. Dec 1989 A
4901307 Gilhousen et al. Feb 1990 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, Jr. 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
5166929 Lo Nov 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 Mar 1994 A
5303240 Borras et al. Apr 1994 A
5309474 Gilhousen et al. May 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
5369637 Richardson et al. Nov 1994 A
5373502 Turban Dec 1994 A
5375124 D'Ambrogio et al. Dec 1994 A
5377192 Goodings 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
5439569 Carpio Aug 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 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
5546382 Fujino Aug 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
5586113 Adachi et al. Dec 1996 A
5586119 Scribano et al. Dec 1996 A
5590156 Carney 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
5598417 Crisler et al. Jan 1997 A
5604730 Tiedemann, Jr. Feb 1997 A
5606580 Mourot et al. Feb 1997 A
5608722 Miller Mar 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 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
5715526 Weaver, Jr. 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
5748624 Kondo May 1998 A
5757767 Zehavi May 1998 A
5758288 Dunn et al. May 1998 A
5764648 Yamane et al. Jun 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
5796776 Lomp et al. Aug 1998 A
5799010 Lomp et al. Aug 1998 A
5802046 Scott Sep 1998 A
5802465 Hamalainen et al. Sep 1998 A
5805583 Rakib Sep 1998 A
5805994 Perreault et al. Sep 1998 A
5809415 Rossmann Sep 1998 A
5812131 Bertram Sep 1998 A
5812543 Sugita 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 et al. Dec 1998 A
5845211 Roach, Jr. Dec 1998 A
5854786 Henderson et al. Dec 1998 A
5854823 Badger 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
5862476 Hasegawa Jan 1999 A
5862488 Kotzin et al. Jan 1999 A
5867527 Ziv et al. Feb 1999 A
5870427 Tiedemann, Jr. 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
5892793 Gibson Apr 1999 A
5893035 Chen Apr 1999 A
5894473 Dent Apr 1999 A
5896374 Okumura et al. Apr 1999 A
5896376 Alperovich et al. Apr 1999 A
5898929 Haartsen Apr 1999 A
5903834 Wallstedt et al. May 1999 A
5905473 Taenzer May 1999 A
5905719 Arnold et al. May 1999 A
5910944 Callicotte et al. Jun 1999 A
5910945 Garrison et al. Jun 1999 A
5914656 Ojala Jun 1999 A
5914950 Tiedemann, Jr. et al. Jun 1999 A
5915216 Lysejko Jun 1999 A
5918170 Oksanen et al. 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
5946356 Felix et al. Aug 1999 A
5949814 Odenwalder et al. Sep 1999 A
5950131 Vilmur Sep 1999 A
5956332 Rasanen et al. Sep 1999 A
5959980 Scott Sep 1999 A
5960361 Chen Sep 1999 A
5963549 Perkins et al. Oct 1999 A
5963559 Ohki Oct 1999 A
5966374 Rasanen Oct 1999 A
5974036 Acharya et al. Oct 1999 A
5974310 Bilgic Oct 1999 A
5982760 Chen Nov 1999 A
5990806 Mock et al. 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
6005848 Grube 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
6011788 Hurst et al. Jan 2000 A
6011800 Nadgauda et al. Jan 2000 A
6016312 Storm et al. Jan 2000 A
6023462 Nieczyporowicz et al. Feb 2000 A
6023474 Gardner et al. Feb 2000 A
6028853 Haartsen Feb 2000 A
6028868 Yeung et al. Feb 2000 A
6031827 Rikkinen et al. Feb 2000 A
6031832 Turina Feb 2000 A
6034638 Thiel et al. Mar 2000 A
6037905 Koscica et al. Mar 2000 A
6038450 Brink et al. Mar 2000 A
6038455 Gardner et al. Mar 2000 A
6049535 Ozukturk et al. Apr 2000 A
6049538 Scott Apr 2000 A
6052385 Kanerva et al. Apr 2000 A
6058104 Snelling et al. May 2000 A
6058338 Agashe et al. May 2000 A
6061339 Nieczyporowicz 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
6088324 Sato Jul 2000 A
6088335 I et al. Jul 2000 A
6094421 Scott Jul 2000 A
6094576 Häkkinen et al. Jul 2000 A
6097707 Hodzic et al. Aug 2000 A
6097722 Graham et al. Aug 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
6122330 Motohashi Sep 2000 A
6125148 Frodigh 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
6169759 Kanterakis 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
6198728 Hulyalkar 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. et al. Apr 2001 B1
6214342 Alberici et al. Apr 2001 B1
6214778 Todd Apr 2001 B1
6215778 Lomp et al. 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
6226279 Hansson et al. May 2001 B1
6226527 Dalsgaard et al. May 2001 B1
6233439 Jalali May 2001 B1
6236646 Beming et al. May 2001 B1
6236647 Amalfitano May 2001 B1
6236674 Morelli et al. May 2001 B1
6243372 Petch et al. Jun 2001 B1
6246673 Tiedmann et al. Jun 2001 B1
6246715 Park et al. Jun 2001 B1
6249681 Virtanen Jun 2001 B1
RE37301 Lo Jul 2001 E
6256334 Adachi Jul 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
6301286 Kanterakis et al. Oct 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
6335922 Tiedemann, Jr. et al. Jan 2002 B1
6337668 Ito et al. Jan 2002 B1
6339612 Stewart et al. Jan 2002 B1
6353412 Soliman Mar 2002 B1
6353645 Solve et al. Mar 2002 B1
6356538 Li Mar 2002 B1
6356555 Rakib et al. 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
6414947 Legg et al. Jul 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 Östberg et al. Jan 2003 B1
6512751 Struhsaker et al. Jan 2003 B1
6512931 Kim 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
6535545 Ben-Bassat et al. Mar 2003 B1
6542481 Foore et al. Apr 2003 B2
6545986 Stellakis Apr 2003 B1
6545994 Nelson, Jr. et al. Apr 2003 B2
6546252 Jetzek et al. Apr 2003 B1
6563808 Cox et al. May 2003 B1
6567389 Honkasalo et al. May 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
6611514 Moulsley Aug 2003 B1
6621807 Jung et al. Sep 2003 B1
6621808 Sadri Sep 2003 B1
6621809 Lee et al. Sep 2003 B1
6628945 Koorapaty et al. Sep 2003 B1
6633554 Dalal Oct 2003 B1
6647000 Persson et al. Nov 2003 B1
6674739 Lee et al. Jan 2004 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, Jr. Mar 2004 B2
6707806 Kato Mar 2004 B1
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 Nagatani et al. Nov 2004 B1
6831910 Moon et al. Dec 2004 B1
6842482 Hiramatsu Jan 2005 B1
6845089 Gu et al. Jan 2005 B1
6868075 Narvinger et al. Mar 2005 B1
6925057 Cheng et al. Aug 2005 B2
6925068 Stanwood et al. Aug 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
6999425 Cheng et al. Feb 2006 B2
6999471 Frazer et al. Feb 2006 B1
7027420 Hamalainen Apr 2006 B2
7039029 Lee et al. May 2006 B2
7046717 Kanterakis et al. May 2006 B2
7054293 Tiedemann, Jr. et al. May 2006 B2
7079507 Toskala et al. Jul 2006 B2
7079523 Nelson, Jr. Jul 2006 B2
7092372 Jensen et al. Aug 2006 B1
7099629 Bender Aug 2006 B1
7136377 Tweedly et al. Nov 2006 B1
7158504 Kadaba et al. Jan 2007 B2
7218623 Proctor, Jr. May 2007 B1
7221664 Proctor, Jr. May 2007 B2
7224683 Marque-Pucheu et al. May 2007 B1
7236467 Kono Jun 2007 B2
7266107 Choi et al. Sep 2007 B2
7340256 Speight Mar 2008 B2
7480280 Proctor, Jr. Jan 2009 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
20020009096 Odenwalder Jan 2002 A1
20020012332 Tiedemann, Jr. Jan 2002 A1
20020045441 Ralston et al. Apr 2002 A1
20020080024 Nelson et al. Jun 2002 A1
20020097700 Alastalo Jul 2002 A1
20020141478 Ozluturk et al. Oct 2002 A1
20030060224 Nelson, Jr. et al. Mar 2003 A1
20030095517 Proctor, Jr. May 2003 A1
20030123401 Dean Jul 2003 A1
20040005078 Tillotson Jan 2004 A1
20040009785 Nelson, Jr. 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
20050202823 Shaheen et al. Sep 2005 A1
20050208961 Willenegger Sep 2005 A1
20080225766 Roy et al. Sep 2008 A1
Foreign Referenced Citations (95)
Number Date Country
19907085 Apr 2000 DE
2812575 Sep 1979 EP
0 443 061 Aug 1991 EP
0 526 106 Feb 1993 EP
0 682 423 Nov 1995 EP
0 682 426 Nov 1995 EP
0 719 062 Jun 1996 EP
0 720 309 Jul 1996 EP
0 475 698 Mar 1997 EP
0 760 564 Mar 1997 EP
0760564 Mar 1997 EP
0 773 636 May 1997 EP
0 808 074 Nov 1997 EP
0818901 Jan 1998 EP
0 907 262 Apr 1999 EP
0 910 176 Apr 1999 EP
0 959 851 Nov 1999 EP
1 018 809 Dec 2000 EP
1 102 512 May 2001 EP
1102512 May 2001 EP
2243973 Nov 1991 GB
2 326 524 Dec 1998 GB
59-050603 Mar 1984 JP
1221042 Sep 1989 JP
02-177643 Jul 1990 JP
03-049324 Mar 1991 JP
04-284033 Oct 1992 JP
05-030006 Feb 1993 JP
07-067164 Mar 1995 JP
07-095151 Apr 1995 JP
07-131398 May 1995 JP
07131398 May 1995 JP
07-264098 Oct 1995 JP
08-065273 Mar 1996 JP
865273 Mar 1996 JP
08-242482 Sep 1996 JP
09-023203 Jan 1997 JP
09-046270 Feb 1997 JP
09-055693 Feb 1997 JP
9214459 Aug 1997 JP
11150530 Jun 1999 JP
11331131 Nov 1999 JP
2000-013867 Jan 2000 JP
2000092019 Mar 2000 JP
2000-188597 Jul 2000 JP
2000188597 Jul 2000 JP
2000236343 Aug 2000 JP
2000236573 Aug 2000 JP
2001024706 Jan 2001 JP
2005504460 Feb 2005 JP
2007251966 Sep 2007 JP
5112811 Jan 2013 JP
566045 Dec 2003 TW
200536325 Nov 2005 TW
9315573 Aug 1993 WO
WO9315573 Aug 1993 WO
WO-9321719 Oct 1993 WO
WO-9505053 Feb 1995 WO
9508900 Mar 1995 WO
WO-9530289 Nov 1995 WO
9608934 Mar 1996 WO
9619050 Jun 1996 WO
WO9619050 Jun 1996 WO
WO-9626582 Aug 1996 WO
9637081 Nov 1996 WO
WO-9637079 Nov 1996 WO
9627994 Dec 1996 WO
9746041 Apr 1997 WO
9723073 Jun 1997 WO
9726726 Jul 1997 WO
9732412 Sep 1997 WO
WO-9734387 Sep 1997 WO
WO-9736405 Oct 1997 WO
WO9737456 Oct 1997 WO
9746044 Dec 1997 WO
WO-9749201 Dec 1997 WO
9809455 Mar 1998 WO
WO-9859523 Dec 1998 WO
WO-9908398 Feb 1999 WO
9914869 Mar 1999 WO
9925125 May 1999 WO
9931811 Jun 1999 WO
9949596 Sep 1999 WO
WO-9949596 Sep 1999 WO
9952306 Oct 1999 WO
9963382 Dec 1999 WO
9963682 Dec 1999 WO
WO-9963682 Dec 1999 WO
WO-9963713 Dec 1999 WO
0057663 Sep 2000 WO
0062449 Oct 2000 WO
WO-0062435 Oct 2000 WO
WO-0062456 Oct 2000 WO
0072464 Nov 2000 WO
WO-02061993 Aug 2002 WO
Non-Patent Literature Citations (340)
Entry
Notice of Allowance for U.S. Appl. No. 12/788,716, mailed Sep. 10, 2014, 15 pages.
Non-Final Office Action for U.S. Appl. No. 12/768,445 mailed Aug. 24, 2010, 7 pages.
Notice of Allowance for U.S. Appl. No. 12/768,445 mailed Jan. 27, 2012, 5 pages.
Notice of Allowance for U.S. Appl. No. 12/768,445 mailed Aug. 8, 2011, 5 pages.
Notice of Allowance for U.S. Appl. No. 12/768,445 mailed May 9, 2011, 5 pages.
Notice of Allowance for U.S. Appl. No. 12/768,445 mailed Jan. 27, 2011, 4 pages.
Non-Final Office Action for U.S. Appl. No. 09/997,732 mailed Dec. 16, 2008, 11 pages.
Non-Final Office Action for U.S. Appl. No. 09/997,732 mailed Jul. 25, 2007, 18 pages.
Non-Final Office Action for U.S. Appl. No. 09/997,732 mailed Sep. 7, 2006, 13 pages.
Non-Final Office Action for U.S. Appl. No. 09/997,732 mailed Sep. 21, 2005, 8 pages.
Final Office Action for U.S. Appl. No. 09/997,732 mailed Jun. 29, 2009, 12 pages.
Final Office Action for U.S. Appl. No. 09/997,732 mailed Jun. 23, 2008, 10 pages.
Final Office Action for U.S. Appl. No. 09/997,732 mailed Mar. 8, 2006, 8 pages.
Notice of Allowance for U.S. Appl. No. 09/997,732 mailed Mar. 9, 2011, 5 pages.
Supplemental Notice of Allowability for U.S. Appl. No. 09/997,732 mailed Jan. 26, 2011, 2 pages.
Notice of Allowance for U.S. Appl. No. 09/997,732 mailed Nov. 3, 2010, 4 pages.
Supplemental Notice of Allowability for U.S. Appl. No. 09/997,732 mailed Dec. 21, 2010, 2 pages.
Notice of Allowance for U.S. Appl. No. 09/997,732 mailed May 13, 2010, 4 pages.
Notice of Allowance for U.S. Appl. No. 09/997,732 mailed Dec. 16, 2009, 8 pages.
Non-Final Office Action for U.S. Appl. No. 09/997,733 mailed Mar. 5, 2008, 8 pages.
Non-Final Office Action for U.S. Appl. No. 09/997,733 mailed Apr. 20, 2007, 6 pages.
Non-Final Office Action for U.S. Appl. No. 09/997,733 mailed Aug. 23, 2006, 7 pages.
Non-Final Office Action for U.S. Appl. No. 09/997,733 mailed Aug. 10, 2005, 11 pages.
Supplemental Notice of Allowability for U.S. Appl. No. 09/997,733 mailed Nov. 13, 2008, 7 pages.
Supplemental Notice of Allowability for U.S. Appl. No. 09/997,733 mailed Mar. 14, 2006, 4 pages.
Notice of Allowance for U.S. Appl. No. 09/997,733 mailed Sep. 25, 2008, 9 pages.
Notice of Allowance for U.S. Appl. No. 09/997,733 mailed Nov. 19, 2007, 11 pages.
Notice of Allowance for U.S. Appl. No. 09/997,733 mailed Jan. 25, 2006, 4 pages.
Non-Final Office Action for U.S. Appl. No. 10/755,874 mailed Dec. 7, 2004, 6 pages.
Notice of Allowance for U.S. Appl. No. 10/755,874 mailed Apr. 12, 2005, 6 pages.
Notice of Allowance for U.S. Appl. No. 10/761,130 mailed Mar. 28, 2005, 6 pages.
Final Office Action for U.S. Appl. No. 11/183,520 mailed Apr. 30, 2009, 5 pages.
Non-Final Office Action for U.S. Appl. No. 11/183,520 mailed Aug. 6, 2009, 7 pages.
Non-Final Office Action for U.S. Appl. No. 11/183,520 mailed Sep. 26, 2008, 4 pages.
Notice of Allowance for U.S. Appl. No. 11/183,520 mailed Jan. 27, 2010, 4 pages.
Non-Final Office Action for U.S. Appl. No. 11/183,677 mailed Nov. 28, 2005, 5 pages.
Supplemental Notice of Allowability for U.S. Appl. No. 11/183,677 mailed Sep. 10, 2008, 3 pages.
Supplemental Notice of Allowability for U.S. Appl. No. 11/183,677 mailed Jul. 17, 2008, 3 pages.
Notice of Allowance for U.S. Appl. No. 11/183,677 mailed May 12, 2008, 7 pages.
Notice of Allowance for U.S. Appl. No. 11/183,677 mailed Jan. 28, 2008, 6 pages.
Notice of Allowance for U.S. Appl. No. 11/183,677 mailed Oct. 30, 2007, 4 pages.
Notice of Allowance for U.S. Appl. No. 11/183,677 mailed Sep. 6, 2007, 4 pages.
Notice of Allowance for U.S. Appl. No. 11/183,677 mailed Feb. 28, 2007, 4 pages.
Notice of Allowance for U.S. Appl. No. 11/183,677 mailed Aug. 30, 2006, 4 pages.
Supplemental Notice of Allowability for U.S. Appl. No. 11/183,677 mailed Apr. 26, 2006, 2 pages.
Supplemental Notice of Allowability for U.S. Appl. No. 11/183,677 mailed Apr. 19, 2006, 2 pages.
Notice of Allowance for U.S. Appl. No. 11/183,677 mailed Feb. 16, 2006, 6 pages.
Non-Final Office Action for U.S. Appl. No. 10/895,591 mailed Dec. 17, 2008, 9 pages.
Non-Final Office Action for U.S. Appl. No. 10/895,591 mailed Nov. 1, 2007, 10 pages.
Final Office Action for U.S. Appl. No. 10/895,591 mailed May 18, 2009, 10 pages.
Final Office Action for U.S. Appl. No. 10/895,591 mailed Jun. 25, 2008, 9 pages.
Supplemental Notice of Allowability for U.S. Appl. No. 10/895,591 mailed May 17, 2010, 2 pages.
Notice of Allowance for U.S. Appl. No. 10/895,591 mailed Feb. 5, 2010, 4 pages.
Notice of Allowance for U.S. Appl. No. 10/895,591 mailed Sep. 24, 2009, 4 pages.
Final Notice of Reasons for Rejection for Japanese Application No. 2012-186900 mailed Feb. 24, 2015, 19 pages.
Notice of Allowance for Canadian Application No. 2,834,031, mailed Mar. 26, 2015, 1 page.
Non-Final Office Action for U.S. Appl. No. 13/892,663 mailed Apr. 9, 2015, 11 pages.
Examination Report for European Patent Application No. 10180797.2, mailed Apr. 7, 2015, 6 pages.
Notice of Allowance for Canadian Patent Application No. 2,670,758 mailed Feb. 10, 2015, 1 page.
Official Action & Search Report for Norwegian Patent Application No. 20033238, mailed Sep. 19, 2013, 8 pages.
Office Action for Japanese Patent Application No. 2013-002916, mailed Nov. 12, 2013, 4 pages.
Notice of Allowance for U.S. Appl. No. 13/423,859, mailed Feb. 18, 2014, 11 pages.
Examination Report for European Patent Application No. 10180797.2, mailed Jan. 20, 2014, 7 pages.
Final Office Action for Japanese Application No. 2011-177740, mailed Nov. 12, 2013, 4 pages.
Office Action for Japanese Application No. 2011-177740, mailed Oct. 30, 2012, 12 pages.
Final Office Action for Japanese Application No. 2012-141289, mailed Nov. 12, 2013, 4 pages.
Office Action for Japanese Application No. 2012-141289, mailed Oct. 30, 2012, 11 pages.
Reasons for Rejection for Japanese Application No. 2012-186900, mailed Jun. 11, 2013, 7 pages.
Office Action for Japanese Application No. 2012-186900, mailed Jan. 29, 2013, 3 pages.
Examiner's Report for Canadian Application No. 2,834,031, mailed Jan. 10, 2014, 3 pages.
Final Office Action for U.S. Appl. No. 12/788,716, mailed May 15, 2012, 16 pages.
Office Action for U.S. Appl. No. 12/788,716, mailed Apr. 22, 2011, 14 pages.
Office Action for U.S. Appl. No. 12/788,716, mailed Oct. 20, 2011, 15 pages.
Office Action for U.S. Appl. No. 12/788,716, mailed Apr. 16, 2013, 20 pages.
Office Action for U.S. Appl. No. 12/788,716, mailed Nov. 5, 2013, 4 pages.
Non-Final Office Action issued for U.S. Appl. No. 13/423,859, mailed Jul. 31, 2013, 14 pages.
Exam Report for European Patent Application No. 11162402.9, mailed Sep. 23, 2013, 5 pages.
Decision of Refusal for Japanese Application No. 2012-186900 mailed Dec. 10, 2013, 8 pages.
Office Action for European Patent Application No. 10180797.2, mailed Mar. 19, 2013, 8 pages.
Extended European Search Report for European Patent Application No. 10180797.2, mailed Oct. 28, 2010, 10 pages.
Final Office Action for U.S. Appl. No. 12/788,716, mailed Mar. 28, 2014, 4 pages.
Office Action for U.S. Appl. No. 13/554,602 mailed Mar. 12, 2014, 6 pages.
Non-Final Office Action for U.S. Appl. No. 10/171,378 mailed Sep. 28, 2006, 7 pages.
Non-Final Office Action for U.S. Appl. No. 10/171,378 mailed Jun. 27, 2007, 11 pages.
Notice of Allowance for U.S. Appl. No. 10/171,378 mailed Feb. 19, 2008, 6 pages.
Examination Report for Canadian Patent Application No. 2,670,758 mailed May 27, 2013, 3 pages.
Office Action for Canadian Patent Application No. 2,670,758 mailed Jul. 31, 2012, 2 pages.
Office Action for Chinese Patent Application No. 200610091261.4 mailed Nov. 7, 2012, 31 pages.
Office Action for Chinese Patent Application No. 200610091261.4 mailed Aug. 29, 2008, 41 pages.
Extended European Search Report for European Patent Application No. 11156846.5 mailed Mar. 30, 2011, 7 pages.
Office Action for European Patent Application No. 11156846.5 mailed Jan. 5, 2012, 6 pages.
Extended European Search Report for European Patent Application No. 11162402.9, mailed Jun. 1, 2011, 17 pages.
Office Action for European Patent Application No. 11162402.9, mailed Sep. 3, 2012, 4 pages.
Extended European Search Report for European Patent Application No. 11162409.4 mailed Jun. 1, 2011, 10 pages.
Office Action for European Patent Application No. 11162409.4 mailed Sep. 26, 2012, 6 pages.
Final Office Action for Japanese Patent Application No. 2007-270641 mailed Oct. 22, 2010, 8 pages.
Final Office Action for Japanese Patent Application No. 2007-270641 mailed Mar. 30, 2012, 6 pages.
Office Action for Japanese Patent Application No. 2012-000481 mailed Aug. 21, 2012, 6 pages.
Office Action for Japanese Patent Application No. 2012-165134 mailed Jan. 22, 2013, 3 pages.
Search and Examination Report for Singapore Patent Application No. 201004134-1 mailed Oct. 24, 2012, 10 pages.
Non-Final Office Action for U.S. Appl. No. 12/165,422 mailed Jul. 22, 2013, 5 pages.
Non-Final Office Action for U.S. Appl. No. 12/165,422 mailed Nov. 6, 2013, 5 pages.
Notice of Allowance for U.S. Appl. No. 12/165,422 mailed Apr. 4, 2014, 5 pages.
Office Action for European Patent Application No. 11162409.4 mailed Mar. 5, 2012, 5 pages.
Office Action for European Patent Application No. 11162402.9, mailed Mar. 5, 2012, 6 pages.
Official Action for Norwegian Patent Application No. 20083653 mailed Mar. 22, 2014, 4 pages.
Official Action and Search Report for Norwegian Patent Application No. 20083653 mailed Jun. 19, 2013, 10 pages.
Examiner's Report for Canadian Application No. 2,834,031, mailed Jul. 17, 2014, 2 pages.
Examiner's Report for Canadian Patent Application No. 2,700,343 mailed Jun. 16, 2014, 3 pages.
Examiner's Report for Canadian Patent Application No. 2,700,343 mailed Feb. 8, 2013, 2 pages.
Examination Report for Canadian Patent Application No. 2,670,758 mailed May 21, 2014, 3 pages.
Notice of Allowance for U.S. Appl. No. 13/554,602 mailed Jul. 3, 2014, 7 pages.
Notice of Allowance for U.S. Appl. No. 10/764,196 mailed May 21, 2009, 10 pages.
Notice of Allowance for U.S. Appl. No. 10/764,196 mailed Oct. 16, 2008, 6 pages.
Notice of Allowance for U.S. Appl. No. 10/764,196 mailed May 19, 2008, 4 pages.
Notice of Allowance for U.S. Appl. No. 10/764,196 mailed Apr. 25, 2007, 4 pages.
Restriction Requirement for U.S. Appl. No. 10/764,196 mailed Feb. 24, 2009, 7 pages.
Restriction Requirement for U.S. Appl. No. 10/764,196 mailed Nov. 30, 2007, 7 pages.
Non-Final Office Action for U.S. Appl. No. 10/764,196 mailed Jul. 19, 2006, 5 pages.
Non-Final Office Action for U.S. Appl. No. 10/764,196 mailed Oct. 7, 2005, 4 pages.
Non-Final Office Action for U.S. Appl. No. 10/763,788 mailed Oct. 5, 2007, 5 pages.
Non-Final Office Action for U.S. Appl. No. 10/763,788 mailed Dec. 20, 2006, 5 pages.
Notice of Allowance for U.S. Appl. No. 10/776,424 mailed Oct. 29, 2008, 6 pages.
Non-Final Office Action for U.S. Appl. No. 10/776,424 mailed Aug. 5, 2008, 5 pages.
Non-Final Office Action for U.S. Appl. No. 10/776,424 mailed Jan. 29, 2008, 6 pages.
Non-Final Office Action for U.S. Appl. No. 10/776,424 mailed Aug. 22, 2007, 5 pages.
Non-Final Office Action for U.S. Appl. No. 10/776,424 mailed Nov. 30, 2006, 4 pages.
Supplemental Notice of Allowability for U.S. Appl. No. 10/776,558 mailed Dec. 22, 2008, 2 pages.
Notice of Allowance for U.S. Appl. No. 10/776,558 mailed Apr. 2, 2009, 6 pages.
Notice of Allowance for U.S. Appl. No. 10/776,558 mailed Oct. 29, 2008, 6 pages.
Notice of Allowance for U.S. Appl. No. 10/776,558 mailed Apr. 7, 2008, 4 pages.
Notice of Allowance for U.S. Appl. No. 10/776,558 mailed Feb. 2, 2007, 7 pages.
Non-Final Office Action for U.S. Appl. No. 10/776,558 mailed Aug. 14, 2008, 6 pages.
Non-Final Office Action for U.S. Appl. No. 10/776,558 mailed Jun. 28, 2007, 6 pages.
Non-Final Office Action for U.S. Appl. No. 10/776,558 mailed Jun. 20, 2006, 5 pages.
Notice of Allowance for U.S. Appl. No. 12/498,099 mailed May 27, 2011, 9 pages.
Notice of Allowance for U.S. Appl. No. 12/498,099 mailed Oct. 17, 2011, 8 pages.
Notice of Allowance for U.S. Appl. No. 12/498,099 mailed Jan. 25, 2012, 8 pages.
Notice of Allowance for U.S. Appl. No. 12/498,099 mailed May 3, 2012, 8 pages.
Non-Final Office Action for U.S. Appl. No. 12/498,099 mailed Sep. 15, 2010, 10 pages.
Non-Final Office Action for U.S. Appl. No. 12/498,099 mailed Jan. 7, 2010, 6 pages.
Notice of Allowance for U.S. Appl. No. 13/571,164 mailed Mar. 20, 2013, 9 pages.
Non-Final Office Action for U.S. Appl. No. 13/571,164 mailed Oct. 11, 2012, 9 pages.
Attachment 2, High Speed Data RLP Lucent Technologies, Version 0.1, Jan. 16, 1997.
Azad et al., Multirate Spread Spectrum Direct Sequence CDMA Techniques, 1994, The Institute of Electrical Engineers.
Bell Labs Technical Journal, Lucent Technologies, vol. 2, No. 3, Summer 1997.
Budka et al., Cellular Digital Packet Data Networks, Bell Labs Technical Journal, Summer 1997, pp. 164-181.
Cellular Digital Packet Data, System Specification, Release 1.1, Jan. 19, 1995.
Chelouah, A., et al., “Angular Diversity Based on Beam Switching of Circular Arrays for Hiperlan Terminals,” Electronics Letters, vol. 36, No. 5, pp. 387-388, (Mar. 2, 2000).
Chih-Lin I et al., IS-95 Enhancements for Multimedia Services, Bell Labs Technical Journal, pp. 60-87, Autumn 1996.
Chih-Lin I et al., Load and Interference Based Demand Assignment (LIDA) for Integrated Services in CDMA Wireless Systems, Nov. 18, 1996, pp. 235-241.
Chih-Lin I et al., Multi-Code CDMA Wireless Personal Communications Networks, Jun. 18, 1005.
Chih-Lin I et al., Performance of Multi-Code CDMA Wireless Personal Communications Networks, Jul. 25, 1995.
Chih-Lin I et al., Variable Spreading Gain CDMA with Adaptive Control for True Packet Switching Wireless Network, 1995, pp. 725-730.
Chung, Packet Synchronization and Identification for Incremental Redundancy Transmission in FH-CDMA Systems, 1992, IEEE, pp. 292-295.
Data Service Options for Wideband Spread Spectrum Systems. TIA/EIA Interim Standard. TIA/EIA/IS-707-A. Apr. 1999.
Data Service Options for Wideband Spread Spectrum Systems: Introduction, PN-3676. 1 (to be published as TIA/EIA/IS-707.1), Mar. 20, 1997 (Content Revision 1).
Data Services Option Standard for Wideband Spread Spectrum Digital Cellular System. TIA/EIA/IS-99. TIA/EIA Interim Standard. Jul. 1995.
Data Services Options Standard for Wideband Spread Spectrum Systems: Packet Data Services. PN-3676.5 (to be published as TIA/EIA/IS-707.5) Ballot Version, May 30, 1997.
Data Standard, Packet Data Section, PN-3676.5 (to be published as TIA/EIA/IS-DATA.5), Dec. 8, 1996, Version 02 (Content Revision 03).
Draft Text for “*95C” Physical Layer (Revision 4), Part 1, Document #531-981-20814-95C, Part 1 on 3GPP2 website (ftp://ftp.3gpp2.org/tsgc/working/1998/1298—Maui/WG3-TG1/531-98120814-95c,%20part%201.pdf).
Draft Text for “95C” Physical Layer (Revision 4), Part 2, Document #531-981-20814-95C, part 2 on 3GGP2 website (ftp://ftp.3gpp2.org/tsgc/working/1998/1298—Maui/WG3-TG1/531-98120814-95c,%20part%202.pdf,1998).
Durnan, G.J., et al. “Optimization of Microwave Parabolic Antenna Systems Using Switched Parasitic Feed Structures,” URSI National Science Meeting, Boulder, CO, p. 323, (Jan. 4-8, 2000).
Durnan, G.J., et al., “Switched Parasitic Feeds for Parabolic Antenna Angle Diversity,” Microwave and Optical Tech. Letters, vol. 23, No. 4, pp. 200-2003(Nov. 20, 1999).
Ejzak et al., Lucent Technologies Air Interface Proposal for CDMA High Speed Data Service, Revision 0.1, May 5, 1997.
Ejzak et al., Lucent Technologies Air Interface Proposal for CDMA High Speed Data Service, Apr. 14, 1997.
Ejzak, et al. Proposal for High Speed Packet Data Service, Version 0.1. Lucent Technologies, Jan. 16, 1997.
Elhakeem, Congestion Control in Signalling Free Hybrid ATM/CDMA Satellite Network, IEEE, 1995, pp. 783-787
Giger, A.J., Low-Angle Microwave Propagation: Physics and Modeling, Norwood, MA, Artech House, (1991).
Hall et al., Design and Analysis of Turbo Codes on Rayleigh Fading Channels, IEEE Journal on Selected Areas in Communication, vol. 16, No. 2, Feb. 1998, pp. 160-174.
Harrington, R.F., “Reactively Controlled Antenna Arrays,” IEEE APS International Symposium Digest, Amherst, MA , pp. 62-65, (Oct. 1976).
Harrington, R.F., “Reactively Controlled Directive Arrays,” IEEE Trans. Antennas and Propagation, vol. AP-26, No. 3, pp. 390-395, (May 1978).
Heine, Gunnar, “The Air-Interface of GSM”, in GSM Networks: Protocols, Terminology, and Implementation, (MA: Artech House, Inc.), pp. 89-100 (1999).
High Data Rate (HDR) Solution, Qualcomm, Dec. 1998.
High Data Rate (HDR), cdmaOne optimized for high speed, high capacity data, Wireless Infrastructure, Qualcomm, Sep. 1998.
Hindelang et al., Using Powerful “Turbo” Codes for 14.4 Kbit/s Data Service in GSM or PCS Systems, IEEE Global Communications Conference, Phoenix, Arizona, USA, Nov. 3-8, 1997, vol. II, pp. 649-653.
Honkasalo, Harri. High Speed Data Air Interface. 1996.
Introduction to cdma2000 Spread Spectrum Systems, Release C. TIA/EIA Interim Standard. TIA/EIA/IS-2000.1-C. May 2002.
James , J.R. et al., “Electrically Short Monopole Antennas with Dielectric or Ferrite Coatings,” Proc. IEEE, vol. 125, pp. 793-803, (Sep. 1978).
James, J.R., et al., “Reduction of Antenna Dimensions with Dielectric Loading,” Electronics Letters, vol. 10, No. 13, pp. 263-265, (May 1974).
Kaiser et al., Multi-Carrier CDMA with Iterative Decoding and Soft-Interference Cancellation, Proceedings of Globecom 1997, vol. 1, pp. 523-529.
King, R.W.P., “The Many Faces of the Insulated Antenna,” Proc. IEEE, vol. 64, No. 2, pp. 228-238, (Feb. 1976).
Kingsley, S.P., et al., “Beam Steering and Monopulse Processing of Probe-Fed Dielectric Resonator Antennas,” IEEE Proc.-Radar, Sonar, Navigation, vol. 146, No. 3, pp. 121-125, (Jun. 1999).
Knight, P., “Low-Frequency Behavior of the Beverage Aerial,” Electronics Letter, vol. 13, No. 1, pp. 21-22, (Jan. 1977).
Knisely, Douglas, N. Telecommunications Industry Association Subcommittee TR-45.5—Wideband Spread Spectrum Digital Technologies Standards. Banff, Alberta. Feb. 24, 1997 (TR45.5/97.02.24)21.
Knisely, Douglas, N. Telecommunications Industry Association Subcommittee TR-45.5—Wideband Spread Spectrum Digital Technologies Standards, Working Group III—Physical Layer. Banff, Alberta. Feb. 24, 1997 (TR45.5/97.02.24)22.
Knisely, Lucent Technologies Air Interface Proposal for CDMA High Speed Data Service, Jan. 16, 1997.
Krzymien et al., Rapid Acquisition Algorithms for Synchronization of Bursty Transmissions in CDMA Microcellular and Personal Wireless Systems, IEEE Journal on Selected Areas in Communications, vol. 14, No. 3, Apr. 1996, pp. 570-579.
Kumar et al, An Access Scheme for High Speed Packet Data Service on IS-95 based CDMA, Feb. 11, 1997.
Lau et al., A Channel-State-Dependent Bandwidth Allocation scheme for Integrated Isochronous and Bursty Media Data in a Cellular Mobile Information System, IEEE, 2000, pp. 524-528.
Lee et al., “A Novel Hybrid CDMA/TDMA Protocol with a Reservation Request Slot for Wireless ATM Networks,” IEICE Transactions on Communications, vol. E82-B, No. 7, pp. 1073-1076 (Jul. 25, 1999).X.
Liu et al., Channel Access and Interference Issues in Multi-Code DS-CDMA Wireless Packet (ATM) Networks, Wireless Networks 2, pp. 173-196, 1996.
Long, S.A., et al., “The Resonant Cylindrical Dielectric Cavity Antenna,” IEEE Trans. Antennas and Propagation, vol. AP-31, No. 3, pp. 406-412, (May 1983).
Lu, J., et al., “Multi-beam Switched Parasitic Antenna Embedded in Dielectric for Wireless Communications Systems,” Electronics Letters, vol. 37, No. 14, pp. 871-872, (Jul. 5, 2001).
Lucent Technologies Presentation First Slide Titled, Summary of Multi-Channel Signaling Protocol, Apr. 6, 1997.
Lucent Technologies Presentation First Slide Titled, Why Support Symmetric HSD (Phase 1C), Feb. 21, 1997.
Luzwick, J., et al., “A Reactively Loaded Aperture Antenna Array,” IEEE Trans. Antennas and Propagation, vol. AP-26, No. 4, pp. 543-547, (Jul. 1978).
McCallister, M.W. et al., “Resonant Hemispherical Dielectric Antenna,” Electronics Letters, vol. 20, No. 16, pp. 657-659, (Aug. 1984).
McCallister, M.W., et al., “Rectangular Dielectric Resonator Antenna,” Electronics Letter, vol. 19, No. 6, pp. 218-219, (Mar. 1983).
Melanchuk et al. CDPD and Emerging Digital Cellular Systems, Digest of Papers of COMPCN, Computer Society Conference 1996, Santa Clara, CA, No. CONF. 41, Feb. 25, 1996, pp. 2-8, XP000628458.
Milne, R.M.T., “A Small Adaptive Array Antenna for Mobile Communications,” IEEE APS International Symposium Digest, pp. 797-800, (1985).
Mobile Station-Base Station Compatibility Standard for Dual-Mode Wideband Spread Spectrum Cellular Systems, TIA Interim Standard, TIA/EIA/IS-95-A (Addendum to TIA/EIA/IS-95), May 1995.
Mobile Station-Base Station Compatibility Standard for Wideband Spread Spectrum Cellular Systems, TIA/EIA Standard, TIA/EIA-95-B (Upgrade and Revision of TIA/EIA-95-A), Mar. 1999.
Motorola, Version 1.0. Motorola High Speed Data Air Interface Proposal Comparisions and Recommendations. Jan. 27, 1997.
MSC-BS Interface (A-Interface) for Public 800 MHz. TIA/EIA/IS-634-A. TIA/EIA Interim Standard (Revision of TIA/EIA/IS-634) Jul. 1998.
MSC-BS Interface for Public 800 MHz.TIA/EIA/IS-634. TIA/EIA Interim Standard, Dec. 1995.
Network Wireless Systems Offer Business Unit (NWS OBU), Feature Definition Document for Code Division Multiple Access (CDMA) Packet Mode Data Services, FDD-1444, Nov. 26, 1996.
Ott, David TR45.5, CDMA WBSS Technical Standards Meeting Summary. Feb. 24-28, 1997 Banff, Alberta.
Ovesjö Frederik, European Telecommunication Standard, SMG2 UMTS physical Layer Expert Group, “UTRA Physical Layer Descriptions FDD parts” (v0.4, Jun. 25, 1998), pp. 1-41, XP-002141421.
Packet Data Service Option Standard for Wideband Spread Spectrum Systems, TIA/EIA Interim Standard, TIA/EIA/IS-657, Jul. 1996.
Physical Layer Standard for cdma2000 Spread Spectrum Systems, Release C. TIA/EIA Interim Standard. TIA/EIA/IS-2000.2C. May 2002.
Preston, S., et al., “Direction Finding Using a Switched Parasitic Antenna Array,” IEEE APS International Symposium Digest, Montreal, Canada, pp. 1024-1027, (1997).
Preston, S.L., et al., A Multibeam Antenna Using Switched Parasitic and Switched Active Elements for Space-Division Multiple Access Applications, IEICE Trans. Electron., vol. E82-C, No. 7, pp. 1202-1210, (Jul. 1999).
Preston, S.L., et al., “Base-Station Tracking in Mobile Communications using a Switched Parasitic Antenna Array,” IEEE Trans. Antennas and Propagation, vol. 46, No. 6, pp. 841-844, (Jun. 1998).
Preston, S.L., et al., “Electronic Beam Steering Using Switched Parasitic Patch Elements,” Electronics Letters, vol. 33, No. 1, pp. 7-8, (Jan. 2, 1997).
Preston, S.L., et al., “Size Reduction of Switched Parasitic Directional Antennas Using Genetic Algorithm Optimization Techniques,” Asia Pacific Microwave Conference Proceedings, Yokohama, Japan, pp. 1401-1404, (1998).
Preston, S.L., et al., “Systematic Approach to the Design of Directional Antennas Using Switched Parasitic and Switched Active Elements,” Asia Pacific Microwave Conference Proceedings, Yokohama, Japan, pp. 531-534, (1998).
Puleston, PPP Protocol Spoofing Control Protocol, Global Village Communication (UK) Ltd., Feb. 1996.
Reed et al., Iterative Multiuser Detection for CDMA with FEC: Near-Single-User Performance, IEEE Transactions on Communications, vol. 46, No. 12, Dec. 1998, pp. 1693-1699.
Ruze, J., “Lateral-Feed Displacement in a Paraboloid,” IEEE Trans. Antennas and Propagation, vol. 13, pp. 660-665, (1965).
Scott, N.L., et al., “Diversity Gain from a Single-Port Adaptive Antenna Using Switched Parasitic Elements Illustrated with a Wire and Monopole Prototype,” IEEE Trans. Antennas and Propagation, vol. 47, No. 6, pp. 1066-1070, (Jun. 1999).
Shacham, et al., “A Selective-Repeat-ARQ Protocol for Parallel Channels and its Resequencing Analysis,” IEEE Transactions on Communications, XP000297814, 40 (4): 773-782 (Apr. 1997).
Sibille, A., et al., “Circular Switched Monopole Arrays for beam Steering Wireless Communications,” Electronics Letters, vol. 33, No. 7, pp. 551-552, (Mar. 1997).
Simpson, W. (Editor). “RFC 1661—The Point-to-Point Protocol (PPP).” Network Working Group, Jul. 1994, pp. 1-35. http://www.faqs.org/rfcs/rfc1661.html.
Simpson, W. (Editor). “RFC 1662—PPP in HDLC-Like Framing.” Network Working Group, Jul. 1994, pp. 1-17. http://www.faqs.org/rfcs/rfc1662.html.
Skinner et al., Performance of Reverse-Link Packet Transmission in Mobile Cellular CDMA Networks, IEEE, 2001, pp. 1019-1023.
Stage 1 Service Description for Data Services—High Speed Data Services (Version 0.10) CDG RF 38. Dec. 3, 1996.
Support for 14.4 kbps Data Rate and PCS Interaction for Wideband Spread Spectrum Cellular Systems. TSB74, Dec. 1995. TIA/EIA Telecommunications Systems Bulletin.
Telecommunications Industry Association Meeting Summary. Task Group I, Working Group III, Subcommittee TR45.5. Feb. 24-27, 1997. Banff, Alberta.
Telecommunications Industry Association Meeting Summary. Task Group I, Working Group III, Subcommittee TR45.5. Jan. 6-8, 1997. Newport Beach, California.
Third Generation Partnership Project 2, “cdma2000 High Rate Packet Data Air Interference Specification,” 3GPP2 C.S0024 Version 2.0 (Oct. 27, 2000).
Third Generation Partnership Project 2, “Physical Layer Standard for cdma2000 Spread Spectrum Systems,” 3GPP2 C.0002-0 Version 1.0 (Jul. 1999).
Third Generation Partnership Project, “Technical Specification Group Radio Access Network; Physical Layer Procedures (FDD) (Release 1999).” 3GPP TS 25.214 v3.5.0 (Dec. 2000).
Third Generation Partnership Project, “Technical Specification Group Radio Access Network; Physical Layer Procedures (TDD) (Release 1999),” 3GPP TS 25.224 V3.6.0 (Mar. 2001).
Third Generation Partnership Project, “Technical Specification Group Radio Access Network; Physical Layer Procedures (TDD) (Release 1999),” 3GPP TS 25.224 V3.10.0 (Mar. 2002).
Third Generation Partnership Project, “Technical Specification Group Radio Access Networks; UE Radio Transmission and Reception (FDD) (Release 1999),” 3GPP TS 25.101 V3.6.0 (Mar. 2001).
Third Generation Partnership Project, “Technical Specification Group Radio Access Networks; UE Radio Transmission and Reception (FDD) (Release 1999),” 3GPP TS 25.101 V3.10.0 (Mar. 2002).
Third Generation Partnership Project, “Technical Specification Group Radio Access Network; Physical layer—General description (Release 1999),” 3G TS 25.201 V3.1.0 (Jun. 2000).
Third Generation Partnership Project, “Technical Specification Group Radio Access Network; Physical layer—General description (Release 1999),” 3GPP TS 25.201 V3.3.0 (Mar. 2002).
Third Generation Partnership Project, “Technical Specification Group Radio Access Network; Physical channels and mapping of transport channels onto physical channels (FDD) (Release 1999),” 3GPP TS 25.211 V3.6.0 (Mar. 2001).
Third Generation Partnership Project, “Technical Specification Group Radio Access Network, Synchronisation in UTRAN Stage 2 (Release 1999),” 3GPP TS 25.402 V3.9.0 (Mar. 2002).
Third Generation Partnership Project, “Technical Specification Group Radio Access Network; Physical channels and mapping of transport channels onto physical channels (TDD) (Release 1999),” 3G TS 25.221 V3.10.0 (Mar. 2002).
Third Generation Partnership Project, “Technical Specification Group Radio Access Network; Services provided by the physical layer (Release 1999),” 3GPP TS 25.302 V3.12.0 (Mar. 2002).
Third Generation Partnership Project, “Technical Specification Group Radio Access Network; MAC protocol specification (3G TS 25.321 version 3.2.0),” 3G TS 25.321 V3.11.0 (Mar. 2002).
Third Generation Partnership Project, “Technical Specification Group Radio Access Network; Radio Resource Management Strategies (Release 1999),” 3G TR 25.922 V3.7.0 (Mar. 2002).
Third Generation Partnership Project, “Technical Specification Group Radio Access Network; Spreading and modulation (TDD) (Release 1999),” 3GPP TS 25.223 V3.8.0 (Mar. 2002).
Third Generation Partnership Project, “Technical Specification Group Radio Access Network; Physical Layer Procedures (FDD) (Release 1999).” 3GPP TS 25.214 v3.10.0 (Mar. 2002).
Third Generation Partnership Project, “Technical Specification Group Radio Access Network; Multiplexing and channel coding (FDD) (Release 1999),” 3GPP TS 25.212 V3.5.0 (Dec. 2000).
Third Generation Partnership Project, “Technical Specification Group Radio Access Network; RRC Protocol Specification (Release 1999),” 3GPP TS 25.331 V3.10.0 (Mar. 2002).
Third Generation Partnership Project, “Technical Specification Group Radio Access Network; Requirements for support of radio resource management (FDD) (Release 1999),” 3GPP TS 25.133 V3.9.0 (Mar. 2002).
Third Generation Partnership Project, “Technical Specification Group Radio Access Networks; Requirements for Support of Radio Resource Management (FDD) (Release 1999),” 3GPP TS 25.133 V3.5.0 (Mar. 2001).
Third Generation Partnership Project, “Technical Specification Group Radio Access Network; Synchronisation in UTRAN Stage 2 (Release 1999),” 3GPP TS 25.402 V3.5.0 (Mar. 2001).
Third Generation Partnership Project, “Technical Specification Group Radio Access Network; UE Procedures in Idle Mode and Procedures for Cell Reselection in Connected Mode (Release 1999),” 3GPP TS 25.304 V3.6.0 (Mar. 2001).
Third Generation Partnership Project, “Technical Specification Group Radio Access Network; UE Procedures in Idle Mode and Procedures for Cell Reselection in Connected Mode (Release 1999),” 3GPP TS 25.304 V3.10.0 (Mar. 2002).
Third Generation Partnership Project, “Technical Specification Group Radio Access Network; RRC Protocol Specification (Release 1999),” 3GPP TS 25.331 V3.6.0 (Mar. 2001).
Third Generation Partnership Project, “Technical Specification Group Radio Access Network; Spreading and modulation (TDD) (Release 1999),” 3GPP TS 25.223 V3.5.0 (Mar. 2001).
Third Generation Partnership Project, “Technical Specification Group Radio Access Network; Physical channels and mapping of transport channels onto physical channels (FDD) (Release 1999),” 3GPP TS 25.211 V3.10.0 (Mar. 2002).
Third Generation Partnership Project, “Technical Specification Group Radio Access Network; Multiplexing and channel coding (FDD) (Release 1999),” 3GPP TS 25.212 V3.9.0 (Mar. 2002).
Third Generation Partnership Project, “Technical Specification Group Radio Access Network; Radio resource management strategies (Release 1999),” 3GPP TR 25.922 V3.5.0 (Mar. 2002).
Third Generation Partnership Project, “Technical Specification Group Radio Access Network; MAC protocol specification (Release 1999),” 3GPP TS 25.321 V3.7.0 (Mar. 2001).
Third Generation Partnership Project, “Technical Specification Group Radio Access Network; Services provided by the physical layer (Release 1999),” 3GPP TS 25.302 V3.8.0 (Mar. 2001).
TIA/EIA Interim Standard, Mobile Station-Base Station Compatibility Standard for Dual-Mode Wideband Spread Spectrum Cellular System, TIA/EIA/IS-95 (Jul. 1993).
Tsui et al., “Sensitivity of EW Receivers,” Microwave Journal, vol. 25, pp. 115-117, 120 (Nov. 1982).
Upper Layer (Layer 3) Signaling Standard for cdma2000 Spread Spectrum Systems, Release C. TIA/EIA Interim Standard. TIA/EIA/IS-2000.5-C. May 2002.
Vaughn, R., “Switched Parasitic Elements for Antenna Diversity,” IEEE Trans. Antennas and Propagation, vol. 47, No. 2, pp. 399-405, (Feb. 1999).
Viterbi, The Path to Next Generation Services with CDMA, Qualcomm Incorporated, 1998 CDMA Americas Congress, Los Angeles, California, Nov. 19, 1998.
Wang et al., The Performance of Turbo-Codes in Asynchronous DS-CDMA, IEEE Global Communications Conference, Phoenix, Arizona, USA, Nov. 3-8, 1007, Gol. III, pp. 1548-1551.
www.cdg.org/news/press/1997.asp. CDA Press Release Archive, 1997.
Yang, Samuel C., “Principles of Code Division Multiple Access,” in CDMA RF System Engineering, (MA: Artech House, Inc.), 1998, Chapter 4, pp. 75-103.
Non-Final Office Action for U.S. Appl. No. 08/992,759 mailed Sep. 16, 1999, 4 pages.
Non-Final Office Action for U.S. Appl. No. 08/992,759 mailed Mar. 19, 1999, 5 pages.
Final Office Action for U.S. Appl. No. 08/992,759 mailed Mar. 3, 2000, 7 pages.
Notice of Allowance for U.S. Appl. No. 08/992,759 mailed Jul. 5, 2000, 5 pages.
Final Office Action for U.S. Appl. No. 10/767,016 mailed Dec. 3, 2008, 8 pages.
Non-Final Office Action for U.S. Appl. No. 10/767,016 mailed Feb. 25, 2009, 8 pages.
Non-Final Office Action for U.S. Appl. No. 10/767,016 mailed Jan. 14, 2008, 9 pages.
Notice of Allowance for U.S. Appl. No. 10/767,016 mailed Apr. 16, 2012, 8 pages.
Notice of Allowance for U.S. Appl. No. 10/767,016 mailed Dec. 28, 2011, 8 pages.
Notice of Allowance for U.S. Appl. No. 10/767,016 mailed Sep. 20, 2011, 7 pages.
Notice of Allowance for U.S. Appl. No. 10/767,016 mailed May 27, 2011, 7 pages.
Notice of Allowance for U.S. Appl. No. 10/767,016 mailed Dec. 29, 2010, 6 pages.
Notice of Allowance for U.S. Appl. No. 10/767,016 mailed Aug. 6, 2010, 6 pages.
Notice of Allowance for U.S. Appl. No. 10/767,016 mailed Mar. 22, 2010, 6 pages.
Notice of Allowance for U.S. Appl. No. 10/767,016 mailed Nov. 30, 2009, 6 pages.
Notice of Allowance for U.S. Appl. No. 10/767,016 mailed Sep. 15, 2009, 6 pages.
Notice of Allowance for U.S. Appl. No. 10/767,016 mailed Sep. 25, 2007, 7 pages.
Final Office Action for U.S. Appl. No. 10/767,326 mailed Jul. 9, 2008, 8 pages.
Non-Final Office Action for U.S. Appl. No. 10/767,326 mailed Jan. 23, 2009, 8 pages.
Non-Final Office Action for U.S. Appl. No. 10/767,326 mailed Jan. 9, 2008, 8 pages.
Notice of Allowance for U.S. Appl. No. 10/767,326 mailed Dec. 16, 2010, 7 pages.
Notice of Allowance for U.S. Appl. No. 10/767,326 mailed Jul. 26, 2010, 6 pages.
Supplemental Notice of Allowance for U.S. Appl. No. 10/767,326 mailed May 20, 2010, 3 pages.
Notice of Allowance for U.S. Appl. No. 10/767,326 mailed Apr. 28, 2010, 6 pages.
Notice of Allowance for U.S. Appl. No. 10/767,326 mailed Dec. 23, 2009, 9 pages.
Notice of Allowance for U.S. Appl. No. 10/767,326 mailed Sep. 18, 2009, 6 pages.
Notice of Allowance for U.S. Appl. No. 10/767,326 mailed May 14, 2009, 8 pages.
Notice of Allowance for U.S. Appl. No. 10/767,326 mailed Oct. 30, 2007, 4 pages.
Notice of Allowance for U.S. Appl. No. 10/767,326 mailed Jul. 19, 2007, 6 pages.
Notice of Allowance for U.S. Appl. No. 10/767,326 mailed Mar. 6, 2007, 4 pages.
Notice of Allowance for U.S. Appl. No. 10/767,326 mailed Aug. 30, 2006, 6 pages.
Corrected Notice of Allowance for U.S. Appl. No. 10/767,326 mailed Apr. 28, 2006, 2 pages.
Notice of Allowance for U.S. Appl. No. 10/767,326 mailed Apr. 20, 2006, 3 pages.
Supplemental Notice of Allowance for U.S. Appl. No. 10/767,326 mailed Apr. 5, 2006, 2 pages.
Supplemental Notice of Allowance for U.S. Appl. No. 10/767,326 mailed Jan. 30, 2006, 4 pages.
Non-Final Office Action for Reexamination U.S. Appl. No. 90/008,990 mailed Feb. 25, 2009, 14 pages.
Final Office Action for Reexamination U.S. Appl. No. 90/008,990 mailed Jun. 12, 2009, 16 pages.
Advisory Action for Reexamination U.S. Appl. No. 90/008,990 mailed Aug. 31, 2009, 4 pages.
Notice of Intent to Issue a Reexamination Certificate for Reexamination U.S. Appl. No. 90/008,990 mailed Feb. 3, 2010, 4 pages.
Notice of Intent to Issue a Reexamination Certificate for Reexamination U.S. Appl. No. 90/008,990 mailed Oct. 4, 2011, 3 pages.
Newton's Telecom Dictionary, 691 (2004), 3 pages.
Office Action for Canadian Patent Application No. 2,581,871 mailed Jan. 28, 2011, 3 pages.
Office Action for Canadian Patent Application No. 2,581,871 mailed Oct. 19, 2011, 4 pages.
Office Action for Canadian Patent Application No. 2,581,871 mailed Apr. 18, 2013, 4 pages.
International Search Report for PCT/US1999/011625 mailed Nov. 15, 1999, 2 pages.
Office Action for Japanese Patent Application No. 2007-096292 mailed May 29, 2012, 6 pages.
Decision to Grant for Japanese Patent Application No. 2007-096292 mailed Oct. 16, 2012, 9 pages.
Office Action for Japanese Patent Application No. 2009-187993 mailed Apr. 27, 2012, 4 pages.
Office Action for Japanese Patent Application No. 2009-187993 mailed Jan. 15, 2013, 4 pages.
Office Action for Japanese Patent Application No. 2010-116275 mailed Jan. 20, 2012, 4 pages.
Office Action for Japanese Patent Application No. 2010-116275 mailed May 29, 2012, 4 pages.
International Search Report for PCT/US2002/001512 mailed Jun. 13, 2002, 1 page.
International Preliminary Examination Report for PCT/US2002/001512 mailed Jan. 21, 2003, 3 pages.
European Search Report for European Patent Application No. 08161008.1 mailed Sep. 17, 2008, 7 pages.
Office Action for European Patent Application No. 08161008.1 mailed Feb. 5, 2013, 3 pages.
Office Action for European Patent Application No. 08161008.1 mailed Jul. 12, 2011, 4 pages.
Office Action for European Patent Application No. 08161008.1 mailed Jan. 27, 2010, 5 pages.
Office Action for European Patent Application No. 10181171.9 mailed Nov. 3, 2011, 5 pages.
International Search Report for PCT/US1998/012875 mailed Dec. 17, 1998, 3 pages.
Melanchuk, T. et al. “CDPD and Emerging Digital Cellular Systems.” Digest of Papers of COMPCON (Computer Society Conference) 1996, Technologies for the Information Superhighway, Santa Clara, Feb. 25-28, 1996, pp. 2-8.
Official Action for Norwegian Patent Application No. 20083653 mailed Oct. 8, 2014, 2 pages.
Examination Report for European Patent Application No. 11162402.9, mailed Oct. 22, 2014, 5 pages.
Notice of Allowance for European Patent Application No. 10180797.2, mailed Mar. 22, 2016, 7 pages.
“Office Action for Canadian Patent Application No. 2,882,928, mailed Mar. 24, 2016, 3 pages.”
Examination Report for European Patent Application No. 10181171.9 mailed Apr. 29, 2015, 3 pages.
Notification of Grant for Norwegian Patent Application No. 20083653 mailed May 15, 2015, 4 pages.
Examination Report for European Patent Application No. 11156846.5 mailed May 7, 2015, 8 pages.
Notice of Intention to Grant for European Patent Application No. 11162402.9, mailed Sep. 2, 2015, 6 pages.
Notice of Reasons for Rejection for Japanese Application No. 2012-186900, mailed Oct. 6, 2015, 2 pages.
Notice of Allowance for Japanese Patent Application No. 2012-186900, mailed Feb. 16, 2016. No English translation available, 2 pages.
Intention to Grant for European Patent Application No. 08161008.1, mailed Oct. 23, 2015, 30 pages.
Related Publications (1)
Number Date Country
20140321441 A1 Oct 2014 US
Provisional Applications (3)
Number Date Country
60378903 May 2002 US
60297987 Jun 2001 US
60180598 Feb 2000 US
Continuations (2)
Number Date Country
Parent 12165422 Jun 2008 US
Child 14325756 US
Parent 10171378 Jun 2002 US
Child 12165422 US
Continuation in Parts (1)
Number Date Country
Parent 09997621 Nov 2001 US
Child 10171378 US