Patent Grant
8687606
Network systems that provide reliable delivery of information typically use some form of acknowledgments (ACKs) or negative acknowledgments (NAKs) to notify a sender that data transmitted from a source is properly received at a target device. For instance, the TCP/IP (Transfer Control Protocol/Internet Protocol) supports bi-directional data message traffic where feedback messages in a reverse direction of a data block transmission indicate whether or not the block of data is properly received at a target device.
Most packet-switched systems in which digital information is transmitted over a wireless, bi-directional link attempt to improve efficiency and maximize capacity by allocating bandwidth on an as-needed basis. That is, a reverse direction traffic channel for carrying acknowledgment messages as previously discussed is allocated for use only when such messages become available for transmission to a source in response to the reception of data at a target device. In these systems, bandwidth must be allocated and deallocated dynamically so that wireless resources for transmitting ACK messages are not dedicated when no ACK messages are being transmitted. This process of allocating and de-allocating traffic channels for the transmission of these sporadically generated ACK messages is cumbersome because there is substantial overhead processing required to allocate and deallocate channels to multiple subscriber units competing for their use. In this instance, wireless resources are wasted to the extent that channels cannot be utilized in a reverse link until a confirmation is received from a subscriber unit that a channel is properly assigned. Thus, there can be a substantial delay between the time a subscriber wishes to transmit and the time it is able to do so.
Rather than assigning channels on an as-needed basis, a wholly dedicated wireless channel in a reverse direction can be allocated for use by a particular subscriber unit to support the transmission of sporadically generated messages. However, the continuous allocation of an entire channel for such messages is often a waste of resources, especially when multiple users are competing for their use and the channel is capable of carrying much more traffic than merely occasional messages.
The present invention is generally directed towards a method and system for enhancing the utilization of resources in a wireless communication system. In an illustrative embodiment, a shared channel is allocated to carry selected messages from each of multiple subscriber units to a base station. These selected messages as generated by a subscriber unit, which can otherwise be transmitted over an assigned reverse link traffic channel, are instead encoded and transmitted to the base station over a shared reverse link channel. Preferably, the shared reverse link channel is time-slotted and each subscriber unit transmits information to the base station in an assigned time slot so that the base station receiving the selected messages can identify from which subscriber unit a message is sent.
The shared channel is optionally structured so that bits in a time slot have a specified meaning. More specifically, certain bits in a time slot of the shared channel as transmitted by a subscriber unit are used to communicate a particular message to the base station. For instance, a single bit itself can be used to transmit a message, where the setting of the bit in the time slot indicates a message-type. In an application where the single bit is an ACK/NAK bit (Acknowledgment/No Acknowledgment bit), a logic one can indicate that a message is an “acknowledgment” message while a logic zero can indicate that a message is a “no acknowledgment” message. Thus, a base station transmitting information over a forward link channel to a subscriber unit can be provided feedback via reverse link messages transmitted in a shared channel to indicate whether the forward link messages are appropriately received at the subscriber unit.
In an application where messages are not transmitted in every frame, i.e., an acknowledgment message is not sent to the base station every periodically repeating time slot from a subscriber unit, a complementary data valid bit can be used to indicate that the setting of other bits, such as the ACK/NAK bit as previously described, are meaningless. In this way, two bits can be used to communicate a message to the base station. More specifically, a complementary data valid bit can be set as a logic one to indicate that the ACK/NAK bit is valid while the ACK/NAK bit itself can be used to identify the type of acknowledgment message as previously discussed. Alternatively, the complementary data valid bit can be set as a logic zero to indicate that the setting of the ACK/NAK bit is meaningless and that no message is being sent. It is therefore possible for an assigned subscriber unit not to transmit a message to the base station for every successive and periodically repeating time slot of the shared channel.
According to this method, a message that would otherwise be transmitted along with other data payload messages on a reverse link traffic channel to the base station can be converted into a substitute message that is encoded as one or two bits of information in a time slot of the shared reverse link channel. A selected message type can therefore be transmitted to a target device using fewer bits than would otherwise be necessary if the same message was transmitted over a communication link along with a set of random data packets that must be decoded to determine their content. Another advantage of the methods according to the principles of the present invention is that a processing unit receiving a reverse link message in a time slot can identify a corresponding message-type in less time since it is not necessary to process multiple layers of a data packet to determine its contents. Rather, the bit settings within a time slot of a monitored shared channel can be decoded to determine a message-type, where the time-slots themselves indicate from which of multiple field units the message pertains.
Another aspect of the present invention involves supporting multiple types of network messages in a given time-slot of the shared reverse link channel. For example, the time slotted channel can include multiple acknowledgment messages, each of which is generated at different network layers. The time-slotted channel also can be structured to support multiple message-types other than acknowledgment messages.
Yet another aspect of the present invention involves providing additional bit information to define other attributes of a message. For example, certain bits of a message can be used to identify a layer 2 frame number indicating which of multiple FEC frames of a data payload transmitted over a forward link channel is being acknowledged by a receiving subscriber unit in a time-slot of the reverse link channel. Preferably, the layer 2 frame number is encoded in a time slot as a 3-bit sequence indicating the frame number of the FEC frame received or not received at a corresponding subscriber unit. According to this method of acknowledging properly or improperly received frames at a subscriber unit, the base station can be notified which if any frames must be re-transmitted.
Layer 3 ACK/NAK messages as transmitted over the reverse link can include multiple bits to identify a particular superframe that is being acknowledged as a result of data transmissions over a forward link channel. A superframe is a block of data such as a TCP/IP (Transfer Control Protocol/Internet Protocol) data packet that is typically reduced in size before transmission over multiple frames of the forward link channel. The process of transmitting a data block to a target subscriber unit first involves receiving a block of data such as an IP (Internet Protocol) network packet at the base station. Prior to transmission over the wireless link, the network packet is preferably subdivided into multiple segments. These segments are then transmitted to a subscriber unit over multiple frames of the forward link channel. Segments received at a subscriber unit are then reassembled to reconstruct the original IP packet or superframe. This recaptured data block or superframe is then forwarded to, for example, a target PC device coupled to the subscriber unit. Meanwhile, an acknowledgment message is generated at the subscriber unit indicating whether the entire superframe is received at the subscriber unit. Preferably, this layer 3 acknowledgment message transmitted in time slot of the shared reverse link channel includes a bit sequence indicating which particular superframe is being acknowledged. More specifically, a time slot can include indicator bits identifying whether a layer 3 message is an ACK or NAK. A time slot can further include encoded bits indicating the particular number of the superframe to which the acknowledgment message pertains.
The principles of the present invention can also be used to support layer 4 acknowledgment messages. Layer 4 acknowledgment messages are generated by a PC device coupled to the subscriber unit. These acknowledgment messages are transmitted in a reverse direction to the base station to indicate a reception of a data block such as a TCP/IP network packet or superframe transmitted to the subscriber unit over the forward link. Rather than transmit a layer 4 acknowledgment network packet over a reverse link traffic channel in its original form as done with forward link data transmissions, the subscriber unit creates a substitute message that is transmitted in a corresponding time slot over the shared reverse link channel. This involves identifying a layer 4 acknowledgment message at the subscriber unit and encoding it in a bit sequence of a time slot so that the base station upon receipt can reconstruct meaningful aspects of the message as originally generated by the PC device.
In this way, a network message generated by a PC device is intercepted at a subscriber unit and is encoded as a substitute message that is transmitted in a time slot to the base station. The base station then decodes the message received in the time slot and reconstructs the original or substantially similar network message. After the substitute message as received in a time slot is reconstructed into an original or substantially similar network packet at the base station, the network message is forwarded to the appropriate target device on, for example, a wired network in communication with the base station.
One application of the inventive shared channel is a reverse link of a CDMA (Code Division Multiple Access) communication system. In such a system, data blocks of network packets corresponding to a particular connection between a client and server are presented to a base station transmitter where they are repackaged into manageably sized sub-packets for transmission to a particular subscriber unit over a wireless link. As previously discussed, a shared time-slotted reverse link channel is used to carry selected message-types that would otherwise be transmitted along with a data payload over an assigned reverse link traffic channel. For example, ACK and NAK messages pertaining to one of multiple TCP/IP network sessions of corresponding subscriber units could otherwise be transmitted over multiple dedicated reverse link channels on an as-needed basis. However, according to the principles of the present invention, the messages are instead transmitted over the shared channel.
In a preferred embodiment, time-slots are implicitly assigned for use by subscriber units based on the allocation of forward link channels. For example, a subscriber unit is optionally allocated use of a time slot in the shared reverse link depending on which traffic channels are allocated in the forward link to transmit a data payload to the subscriber unit. More specifically, if the base station transmits forward link messages such as a data payload on traffic channel #1, time slot #1 of the shared reverse link channel is implicitly assigned for use by that particular subscriber unit to transmit feedback information in a reverse link path. Use of a particular time slot by a newly assigned subscriber unit is preferably delayed so that the subscriber unit can receive and process data received on the newly assigned forward link channel and respond appropriately in the reverse link time slot.
In an alternate embodiment, one or multiple time slots are explicitly assigned for use by a subscriber unit via a corresponding message sent on a forward link channel from the base station to a corresponding subscriber unit.
Notably, a subscriber unit can receive data information from the base station on multiple forward link traffic channels while providing corresponding feedback messages on multiple implicitly assigned time slots of the shared reverse link channel.
If no forward link channels are assigned for use by a particular field unit and no time slots are available for allocation in the shared reverse link channel, information can be transmitted from the field unit to the base station via the assignment of reverse link traffic channels.
As previously discussed, the shared channel can be structured to encode network messages generated at multiple layers. Alternately, the shared channel can be an unstructured channel partitioned into time slots that carry generic payload data. For example, a network message or raw data can be encoded in a time slot of the shared channel where a receiver device must decode a data payload to determine a message type. Thus, the shared channel can carry any type of message and not just acknowledgment or feedback messages. For instance, a data payload transmitted in a time slot of the shared channel can be a maintenance message to support a corresponding link between the field unit and base station. Otherwise, such data can be transmitted over a traffic channel.
Another aspect of the present invention involves allocating additional bandwidth such as a reverse link traffic channel for transmitting a data message to the base station when throughput capacity afforded by an assigned time slot is exceeded. That is, if a field unit must transmit more information to the base station than is possible via an assigned time slot, at least part of a reverse link traffic channel is additionally assigned for use by the field to transmit information to the base station.
Preferably, a shared reverse link time-slotted feedback channel repeats on a periodic basis so that feedback is provided on a discrete but continuous basis to the base station when a time slot is assigned to a subscriber unit. Thus, minimal resources can be used to transmit feedback or other types of messages in a reverse link direction of the wireless communication system. This aspect of the present invention is particularly advantageous in applications where a large data block such as web page information is transmitted from the base station to a subscriber unit and it is necessary to support at least a minimal communication in the reverse direction back to the base station.
Multiple subscriber units compete for the use of wireless channel resources in most wireless communication systems. As previously discussed, there is often high demand for data throughput on the forward link channel to carry data payloads such as web page information to remotely located subscriber units. To support high throughput of data, multiple traffic channels are allocated on an as-needed basis to support such data transfers on the forward link to the subscriber unit. In this application, sporadically generated ACK and NAK messages are transmitted in a reverse link from the subscriber unit to the base station. According to this aspect of the present invention as discussed, reverse link messages are encoded as substitute messages that are transmitted over a time-slotted reverse link channel. This reduces the overhead associated with the allocation of a whole a reverse link traffic channel to a corresponding subscriber unit every time a sporadic ACK or NAK message must be transmitted to the base station.
Alternatively, a portion of a time-slotted reverse-link traffic channel can be assigned on a continuous basis to a subscriber unit for transmitting occasional messages to the base station.
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.
A description of preferred embodiments of the invention follows.
Certain aspects of the present invention are based on the recognition that some messages transmitted over a wireless link are redundant to the extent that specific protocols are repeatedly used to communicate data information between a base station and each of multiple subscriber units. For example, one aspect of most network protocols involves transmitting acknowledgment messages in a return communication path to indicate the status of transmitted and received data between network devices such as a server and a client. This type of feedback in a reverse communication path ensures that messages are properly received at a target device, increasing overall link quality between a transmitter and receiver device.
Consider packet-switched systems such as those based on TCP/IP (Transfer Control Protocol/Internet Protocol). During a typical network communication session, acknowledgment and similar types of link maintenance messages are repeatedly generated as encoded data packets that are transmitted as network messages along with corresponding data information messages that are used at an application layer of a network session. Considerable processing power at a target device is often necessary to quickly distinguish link maintenance messages from actual data payload messages. It is preferred that processing time of a message at an intermediate routing device is minimized so that the message can be transmitted to a corresponding target in as little time possible.
According to one aspect of the present invention, messages transmitted over a wireless link from a subscriber unit 14 are analyzed to determine their content prior to transmission. Selected messages of a particular type are intercepted and encoded for transmission over a structured channel to a target device in lieu of being transmitted as a random data packet that must be analyzed at multiple layers to determine its content. In a specific application, the structured channel can be adapted to transmit common message types such as acknowledgment messages indicating whether data information is properly received and decoded at a target device such as a server.
According to the following description, communication system 10 is described as a wireless communication link such as a CDMA radio channel utilizing shared channel resources. However, it should be noted that the techniques described herein can be applied in other applications supporting shared access. For example, the principles of the present invention can be applied to other types of media such as telephone connections, computer network connections, cable connections, or other physical media to which allocation of resources such as data channels are granted on an as-needed basis.
As shown, communication system 10 includes a number of Personal Computer (PC) devices 12-1, 12-2, . . . 12-h, . . . 12-m, corresponding subscriber units or terminals 14-1, 14-2, . . . 14-h, . . . 14-m, and associated directional antenna devices 16-1, 16-2, . . . 16-h, . . . 16-m. Centrally located equipment includes a base station antenna 18, and a corresponding base station 20 that includes high speed processing capability.
Base station 20 provides connections to and from a network gateway 22, network 24 such as the Internet, and network file server 30. Communication system 10 is preferably a demand access, point to multi-point wireless communication system such that the PC devices 12 can transmit data to and receive data from network server 30 through bi-directional wireless connections implemented over forward links 40 and reverse links 50. That is, in the point to multi-point multiple access wireless communication system 10 as shown, a given base station 20 typically supports communication with a number of different subscriber units 14 in a manner which is similar to a cellular telephone communication network. Accordingly, system 10 can provide a framework for a CDMA wireless communication system where digital information is relayed on-demand between multiple mobile cellular users and a hardwired network 24 such as the Internet.
PC devices 12 are typically laptop computers, handheld units, Internet-enabled cellular telephones, Personal Digital Assistant (PDA)-type computers, digital processors or other end user devices, although almost any type of processing device can be used in place of PC devices 12. One or multiple PC devices 12 are each connected to a respective subscriber unit 14 through a suitable wired connection such as an Ethernet-type connection via cable 13.
Each subscriber unit 14 permits its associated PC device 12 access to the network file server 30. In the reverse link 50 direction, that is, for data traffic transmitted from the PC 12 towards the server 30, the PC device 12 transmits an Internet Protocol (IP) level network packet to the subscriber unit 14. The subscriber unit 14 then encapsulates the wired framing, i.e., Ethernet framing, with appropriate wireless connection framing so that data packets can be transmitted over the wireless link of communication system 10. Based on a selected wireless protocol, the appropriately formatted wireless data packet then travels over one of the radio channels that comprise the reverse link 50 through subscriber unit antenna 16 to base station antenna 18. At the central base station location, the base station 20 then extracts the radio link framed data packets and reformats the packets into an IP format. The packets are then routed through gateway 22 and any number or type of networks 24 to an ultimate destination such as a network file server 30. In one application, information generated by PC device 12 is based on a TCP/IP protocol. Consequently, a PC device 12 has access to digital information such as web pages available on the Internet. It should be noted that other types of digital information can be transmitted over channels of communication system 10 based on the principles of the present invention.
Data can also be transmitted from the network file server 30 to the PCs 12 on a forward link 40. In this instance, network data such as an Internet Protocol (IP) packets originating at the file server 30 travel on the network 24 through the gateway 22 to eventually arrive at the base station 20. As previously discussed for reverse link data transmissions, appropriate wireless protocol framing is then added to raw data such as IP packets for communication of the packets over a wireless forward link 40. The newly framed packets then travel through the antenna 18 and 16 to the intended receiver subscriber unit 14. An appropriate target receiver subscriber unit 14 decodes the wireless packet protocol layer, and forwards the packet or data packets to the intended PC device 12 that performs IP layer processing.
A given PC device 12 and file server 30 can therefore be viewed as the end points of a duplex connection at the IP level. Once a connection is established between the base station processor 20 and corresponding subscriber unit 14, a user at the PC device 12 can then transmit data to and receive data from the file server 30 on an as-needed basis.
Reverse link 50 optionally includes different types of logical and/or physical radio channels such as a JACK (Joint Acknowledgment) channel 54, an access channel 51, multiple traffic channels 52-1, . . . 52-m, and a maintenance channel 53. The reverse link access channel 51 is used by the subscriber units 14 to request use of traffic channels by the base station 20. For example, traffic channels carrying data packets can be assigned to a user on an as-needed basis. The assigned traffic channels 52 in the reverse link 50 then carry payload data from the subscriber unit 14 to the base station 20. Notably, a given link between the base station 20 and subscriber unit 14 can have more than one traffic channel 52 assigned to it.
Maintenance channel 53 carries maintenance information such as synchronization and power control messages to further support transmission of digital information over both the reverse link 50 and forward link 40.
JACK channel 54 is a shared and structured reverse link channel for transmitting messages from a subscriber unit 14 to the base station 20. Preferably, the JACK channel 54 is partitioned into time slots of equal duration and is structured to have a specified bit mapping. According to how the bits in a time slot are set by an assigned subscriber unit 14, the subscriber unit 14 communicates messages to the base station. This aspect of the present invention is described in more detail later in the specification.
The forward link 40 can also include a paging channel 41, which is used by the base station 20 to inform a subscriber unit 14 of general information such as that one or multiple forward link traffic channels 52 have been allocated to it for the transmission of data. Additionally, the channel is used to inform the subscriber unit 14 of allocated traffic channels 52 in the reverse link 50 direction. Traffic channels 42-1 . . . 42-n on the forward link 40 are then used to carry payload information from the base station 20 to a corresponding target subscriber unit 14.
Additionally, maintenance channels 43 carry synchronization and power control information on the forward link 40 from the base station processor 20 to the subscriber units 14.
The traffic channels 42 on the forward link 40 can be shared among multiple subscriber units 14 based on a Time Division Multiplexing scheme. Specifically, a forward link traffic channel 42 is optionally partitioned into a predetermined number of periodically repeating time-stamped slots for transmission of data packets from the base station 20 to multiple subscriber units 14. It should be understood that a given subscriber unit 14 can, at any instant in time, have multiple time slots or no time slots assigned to it. In certain applications, an entire time-slotted forward or reverse link traffic channel is assigned for use to a particular subscriber unit 16.
One aspect of the present invention involves transmitting data block 205 over a wireless link so that it can be reconstructed as recaptured data block 255 at subscriber unit 14. As shown, data block 205 is presented to base station manager 210 for transmission over wireless communication system 10. In one application, data block 205 comprises digital data transmitted by server 30 through network 24 and gateway 22 to base station processor 20. This data block 205 is routed to base station processor 20 for transmission to a target receiver subscriber unit 14 of communication system 10.
As previously mentioned, data block 205 can be a block of TCP/IP data packets encapsulating, for example, web page information bound for a target receiver subscriber unit 14. It should be noted that portions of data block 205 can be transmitted over the data channels to a target receiver even though only a portion of the data block 205 is received at base station processor 20. More specifically, parts of a data block can be transmitted over the wireless channels as such data is received at base station 20.
In some instances it is undesirable to transmit an entire data block in a serial manner over a single dedicated traffic channel. Such a technique can be ineffective for transmitting data if the throughput rate of the traffic channel link is low and the block of data to be transmitted is very large. It is preferable to transmit relatively large blocks of data in as little time possible while still making efficient use of wireless communication system 10. Thus, multiple traffic channels 42 are often allocated for use by a particular subscriber unit 14 for high-speed data transfers from the base station 20 to a target subscriber unit 14.
Data block 205 is preferably reduced into manageable chunks so that it can be transmitted piecewise over multiple channels to a target receiver subscriber unit 14. If only a single limited-bandwidth wireless channel were utilized for such a data transfer as mentioned, large data blocks 205 might otherwise be slowed by a bottleneck of a single channel unable to support a high throughput.
Data block 205 is presented to framer 215 that optimally reduces the size of data block 205 by dividing it into sub-packets or sub-blocks of data based on operating parameters of communication system 10. A number of bytes in each frame is not of particular importance to the present invention since the optimal division of a data block 205 depends on many parameters of communication system 10.
In any event, framed data is fed to forward error correction (FEC) encoder 220. The FEC encoder 220 adds bit information to the framed data to permit error detection at a target subscriber unit 14. Based on redundancy, the forward error correction encoding ensures that data is accurately received at a target receiver subscriber unit 14. Any number of FEC encoder types can be used such as BCH codes, Block codes, turbo codes, turbo product codes and the like.
An FEC encoded frame is then forwarded from FEC encoder 220 to a cover sequence circuit 228 that applies a cover sequence, C.sub.i, corresponding to a traffic channel over which the data is to be transmitted. The cover sequence circuit comprises code generator 225 and mixer 222.
A cover sequence C.sub.i can be any suitable sequence. One class of such sequences are long pseudo-random noise (PN) codes. In this instance, a cover sequence is applied by modulo-2 multiplication of the cover sequence C.sub.i with FEC encoded frame data. A cover sequence can also be other near-orthogonal sequences that scramble encoded data. Preferably, a cover sequence will scramble the data sufficiently and cause an FEC decoder to fail in the decoding process if an incorrect cover sequence is applied at a receiver other than a target subscriber unit 14. This ensures separation of traffic channels such as those supported in a code division multiple access (CDMA) communication system.
The signal output from cover sequence circuit 228 is then fed to modulator 230. A modulation type is impressed upon this signal at modulator 230 as selected by base station manager 210. Modulation types can be any suitable type such as BPSK (binary phase shift keying), QPSK (quadrature phase shift keying), 8-psk, up to n-psk. A type of modulation to be used in the transmission of a data packet 205 depends on operating parameters of the wireless communication system 10.
Modulated signals generated by modulator 230 are then fed to summer circuit 232. In addition to the modulated traffic channels as previously discussed, a pilot channel 236 and paging channel 235 are fed to summer circuit 232. Similar hardware and software as that previously discussed for the traffic channel can be used to generate signals for the pilot channel 236, paging channel 235 and other forward link channels.
RF up/down converter 245 is then used to transmit the information over wireless channels via antenna 18. Accordingly, data information is transmitted over forward link 40 channels to one or multiple subscriber units 14 of wireless communication system 10. More specifically, multiple traffic channels are 42 generated at base station 20 to carry sub-blocks of data block 205 to a target receiver subscriber unit 14.
It should be noted that components of base station 20 can be duplicated in a subscriber unit 14 to support the generation of multiple traffic or paging channels. More specifically, multiple traffic channels can be generated at base station 20 to carry sub-blocks of data block 205 to a target receiver subscriber unit 14.
Subscriber unit 14 of
Each subscriber unit 14 preferably includes a cover sequence circuit 275, a demodulator 280, an FEC decoder 270, a re-framer 265 and a subscriber unit manager 260. This combination of components is used to monitor, receive and decode data information as it is received on a particular traffic channel.
As shown, cover sequence circuit 275 is used to identify data transmissions having a particular cover sequence of a CDMA channel. The signal generated from cover sequence circuit 275 is then fed to demodulator 280 where it is demodulated according to a type of modulation used in transmission of the data information. FEC decoder 270 is then used to verify that data information is properly received without errors based on a forward error correction code. Finally, re-framer 265 processes the received data for recapturing sub-blocks or raw data of original data block 205. Received sub-blocks are recombined at access unit manager 260 to produce recaptured data block 255. Preferably, recaptured data 255 block is identical or near-identical to original data block 205. In applications supporting the transfer of IP data packets, the raw data of recaptured data block 255 is forwarded to a corresponding PC device 12. As mentioned, the format of this information can be based on, for example the TCP/IP network protocol.
In a similar but reverse manner as previously described, messages generated at a subscriber unit are transmitted at the base station, where they are demodulated, decoded and otherwise processed.
Because the link between a server 30 and PC 12 includes a wireless forward link channel 40, there is a need in certain applications to support communications from the PC device 12 to server 30 over a reverse link channel 50. A portion or all of such communications are preferably supported by JACK channel 54. It should be noted that JACK channel 54 is optionally a minimal link supporting sporadic communications other than feedback messages or acknowledgment messages from a subscriber unit 14 to base station 20. It also should be noted that one or multiple time-slotted channel such as JACK channel 54 can be established in a forward link 40 for data payload communication from a subscriber unit 14 to base station 20. More specifically, the principles of the present inventions are not limited to applications such as a reverse link channel of a CDMA communication system.
Although not shown in
As previously discussed, wireless communication system 10 can support short duration, high-speed data bursts on forward link channels from one or multiple base stations 20 to subscriber units 14. In one application, the data information transmitted over the forward link 40 includes digitally encoded data blocks 205 such as web page information to PC device 12. In this instance, the JACK channel 54 is used to carry acknowledgment messages to indicate receipt of the web page information.
A network session can be established by sending a SYN message from PC device 12 to server 30. This is typically how a session is established between a client such as PC device 12 requesting web page information and a server 30 providing the web page information. In response to receipt of a SYN message at server 30, an ACK message is thereafter generated and transmitted from server 30 to corresponding PC device 12 to indicate that the SYN messages was received by server 30. In furtherance of the TCP/IP protocol, the PC device 12 after receiving the ACK would then send a return ACK message to server 30 indicating that the ACK was received. Consequently, a network session is established to transmit data such as web page information from server 30 to corresponding PC device 12.
As previously discussed, web page information is then transmitted from server 30 over assigned forward link traffic channels 42. A portion of JACK channel 54 is allocated for use by the corresponding subscriber unit 14 to transmit, for example, sporadically generated ACK messages in the reverse link 50 direction to server 30. As is known, these subsequent and sporadically generated ACK messages transmitted by the subscriber unit 14 are used to acknowledge receipt of data information at subscriber unit 14 or PC device 12 for a particular established network session.
JACK channel 54 is preferably structured as multiple periodically repeating time-slots 310, each of which is used to transmit 64 bits of information encoded via symbols from a subscriber unit 14 to the base station 20. Each subscriber unit 14 preferably synchronizes itself with base station 20 based on a forward link channel so that a subscriber unit 14 can properly transmit data in an assigned time slot 310. Precise synchronization with base station 20 ensures that the subscriber units 14 do not interfere with each other while transmitting in adjacent time slots 310 on the reverse direction JACK channel 54.
Combined, the total duration of one cycle of time slots 0 . . . F is 26.6 mS for encoding 1024 bits of data information. One cycle of periodically repeating time slots 310 is also known as an epoch 315 of time duration, T. Of course, a duration of a time slot 310 and number of bits encoded in a time slot 310 can be adjusted to suit a particular application.
In an illustrative application where system 10 supports wireless CDMA communications, JACK channel 54 is modulated via BPSK (Binary Phase Shift Keying) and framed with a ½ rate FEC (Formal Error Correction) code. As mentioned, appropriate equipment at base station 20 is used to receive messages encoded in each of the multiple time slots 310. Of course, JACK channel 54 can be modulated and FEC coded at different rates. For example, different FEC codes can be used for transmission of information in different time slots 310. Likewise, communication system 10 is optionally implemented so that subscriber units 14 each can transmit messages in a time slot 310 based on a different or assigned modulation rate.
The shared JACK channel 54 is optionally structured so that bits in a time slot 310 have a specified meaning. More specifically, certain bits such as bit 4 and bit 5 in a time slot 310 of the shared JACK channel 54 as set by a subscriber unit 14 can be used to communicate a particular message to base station 20. For instance, a single bit such as ACK/NAK bit 341 (bit 4) that is transmitted in a time slot 310 can be used to transmit a message to the base station 20 regarding a particular network session, where the setting of the bit itself indicates a message-type.
In an application where the single bit is an ACK/NAK bit 341 (Acknowledgment/No Acknowledgment bit), a logic one can indicate that a message is an “acknowledgment” message while a logic zero can indicate that a message is a “no acknowledgment” message. Thus, a base station 20 transmitting information over a forward link 40 channel to a subscriber unit 14 can be provided feedback in a reverse link 50 via messages transmitted on the JACK channel 54.
In certain applications, the messages transmitted in a time slot 310 of the JACK channel 54 can be considered substitute messages in some respects because an ‘ACK’ message, e.g., self-contained network packet as originally transmitted by a PC device 12, is optionally intercepted and converted by a subscriber unit 14 into a newly encoded message that is transmitted in a time slot 310 of the JACK channel 54.
In an application where a specific message is not transmitted in every time slot 310 from the subscriber unit 14 to the base station 20, i.e., an acknowledgment message is not sent every periodically repeating time slot 310, a complementary data valid bit 342 (bit 5) can be transmitted in a time slot 310 to indicate that the setting of a corresponding ACK/NAK bit 341 is meaningless. For example, a complementary data valid bit 342 such as bit 5 can be set as a logic one or zero to indicate that the ACK/NAK bit 341 is valid or otherwise invalid, respectively. In this way, two bits such as bits 4 and 5 of a time slot 310 can be used to communicate a particular message to the base station 20. When the complementary data valid bit 342 is a logic zero, the setting of the ACK/NAK bit 341 is meaningless. Thus, no message is being sent at least for that particular time slot 310. Accordingly, it is possible for an assigned subscriber unit 14 not to transmit a message to the base station 20 every successive periodically repeating time slot 310 of the shared reverse link JACK channel 54.
Based on this method, a message that would otherwise be transmitted along with other data payload messages on a reverse link traffic channel 52 can be converted and transmitted as a substitute message using one or two bits in a time slot 310 of the shared reverse link JACK channel 54. This aspect of the present invention is particularly advantageous in applications where limited resources are available for transmitting data information in a reverse link channel because a message can be transmitted using fewer bits. More specifically, a self-contained switched network packet that would otherwise include many more bits to encode an acknowledgment message is substantially reduced in size and transmitted as a substitute message in a time slot 310 of the JACK channel 54.
In one application, the L4 (layer 4) indicator bit pair 340 as previously described is used to encode layer 4 ACK messages for a particular network session between PC device 12 and server 30. Notably, certain fields of a time slot 310 in addition to the L4 indicator bit pair 340 as described above can be allocated for encoding additional details of a corresponding layer 4 acknowledgment message. For example, 16 bits of a time slot 310 can be allocated to encode an L4 stream identification tag 344 identifying an established session for transmitting data between a PC device 12 and server 30. Another 16 bits of a time slot 310 can be allocated to encode an L4 stream value tag 34 identifying a network packet number being identified for the established session between subscriber unit 14 and server 30. Based on data in these fields of a time slot 310, a self-contained layer 4 ACK-type message generated by PC device 12 can be properly encoded and transmitted in a time slot 310 of JACK channel 54 to server 30 via a wireless link through base station 20. According to one aspect of the present invention, a self-contained switched network message as originally transmitted by PC device 12 is reconstructed at base station 20 based on the L4 acknowledgment data information in a time slot 310 of JACK channel 54. The ACK network message reconstructed at the base station 20 is then further transmitted over network 24 to target server 30.
Referring again to
When a session is established between PC device 12 and server 30, base station 20 and subscriber units 14 each track the new session based on the 16-bit L4 stream identifier tag 344. In one application, each new session is assigned a stream identifier tag 344 based on a one-up counter. For example, based on the detection of a new session established transmission between PC device 12 and server 30, a session is assigned a next available tag number at base station 20. A message is then transmitted to the subscriber unit to which session the newly assigned L4 stream identifier tag 344 pertains. In this way, both the base station 20 and subscriber unit 14 simultaneously track each session based on the 16-bit L4 stream identifier tag 344. Each newly detected and established session would be assigned a new L4 stream ID Tag 344 such as 0001 hex, 0002 hex, 0003 hex and so on as they are established.
Based on this method, a subscriber unit 14 intercepting an L4 ACK message generated by a corresponding PC device 12 identifies the session number to the base station 20 associated with the L4 ACK message based upon the source/destination IP address and source/destination port numbers. For instance, the 16-bit L4 stream ID tag 344 corresponding to the session is transmitted in a time-slot 310 in lieu of 96 bits of source/destination IP address and source/destination port numbers to identify the session to which the ACK message pertains. This aspect of the present invention is advantageous because 16 bits rather than 96 bits are used to identify a particular network session.
Referring again to
The L3 indicator bit pair 330 is similar to the L4 indicator bit pair 340 except the L3 indicator bit pair 330 is dedicated for layer 3 message processing. In a preferred embodiment, layer 3 message processing is used to verify that a data block 205 or superframe is properly received at a corresponding subscriber unit 14. In addition to the L3 indicator bit pair 330, Layer 3 ACK/NAK messages as transmitted in a time slot 310 over JACK channel 54 can include additional bits identifying the L3 superframe that is being acknowledged.
A superframe can be a data block 205 such as a TCP/IP network message that is reduced into segments or sub-blocks prior to transmission over forward link traffic channels to corresponding PC device 12 through subscriber unit 14. Each segment of a superframe or data block 205 is preferably sized so that it can be transmitted in a frame of the forward link 40 channel. When received at a corresponding subscriber unit 14, the segments are reassembled to form recaptured data block 255. The recaptured data block 255 or original network message is then forwarded to, for example, a target PC device 12 coupled to the subscriber unit 14. Meanwhile, an acknowledgment message is generated at the subscriber unit 14 for transmission to the base station 20 in the appropriate time slot 310 of the JACK channel 54 to acknowledge receipt of the received superframe. The superframe ID number 335 in a time slot 310 indicates the superframe or data block 205 being acknowledged by subscriber unit 14. Each superframe is sequentially numbered so that it can identified accordingly. Preferably, a 5-bit field is allocated for the superframe ID number 335 in a time slot 310.
The L2 indicator bit pair 320 is similar to the L4 indicator bit pair 340 except the L2 bit pair is instead dedicated to layer 2 message processing. Layer 2 processing assures that specific frames or segments of data information are properly received at a corresponding subscriber unit 14. As previously discussed, a frame is a block, sub-block or segment of a superframe of data transmitted over the forward link 40 to the subscriber unit 14. If a frame is not properly received due to data corruption caused by channel interference, the base station 20 must be notified so that the frame can be re-transmitted to the subscriber unit 14. According to the principles of the present invention, feedback messages in the appropriate time slot 310 of the JACK channel 54 prompt base station 20 to re-transmit an old frame of data or transmit a new frame of data.
The L2 frame ID tag 325 preferably identifies the frame number that is being acknowledged. For example, base station 20 initially transmits a specified frame number such as frame #0 to subscriber unit 14. The subscriber unit 14 will then need time to demodulate the received frame data and decode the symbols based of the FEC code. In the meantime, additional sequentially numbered frames of data information such as frames 1, 2, 3 . . . are transmitted by base station 20 and received at a corresponding subscriber unit 14. The acknowledgment message transmitted in the reverse link JACK channel 54 indicates to the base station 20 whether a corresponding frame such as frame #0 should be resent. Notably, frame numbers for L2 frame ID tag 325 roll over to frame #0 again after frame #7 is sent to a particular subscriber unit 14.
Preferably, the L2 frame ID tag 325 includes multiple bits so that multiple frames can be identified in the process of transmitting/receiving frame data. For example, one frame ID tag can identify a frame being transmitted to a subscriber unit 14 while another frame ID tag can identify a received frame being processed at a subscriber unit 14.
Each time-slotted message 310 optionally includes a CRC (Cyclical Redundancy Check) packet 360 that is used for error-checking purposes. Based on a received CRC packet 360, the base station 20 can determine whether the 64 bits of data received in a particular time slot 310 has been corrupted during transmission. Reserved bits 350 in a time slot 310 are provided for the future growth.
If no forward link channels are assigned for use by a particular field unit and no time slots are available for allocation in the shared reverse link channel, information can be transmitted from the field unit to the base station via the assignment of reverse link traffic channels.
As previously discussed, the shared channel can be structured to encode network messages generated at different layers. Alternately, the shared channel can be an unstructured channel partitioned into time slots that carry generic payload data. For example, a network message or raw data can be encoded in a time slot of a shared channel where a receiver device must decode a data payload to determine a message type. Thus, the shared channel can carry any type of message and not just acknowledgment or feedback messages. For instance, a data payload transmitted in a time slot of the shared channel can be a maintenance message to support a corresponding link between the field unit and base station. Otherwise, such data can be transmitted over a traffic channel.
Another aspect of the present invention involves allocating additional bandwidth such as a reverse link traffic channel for transmitting a data message to the base station when throughput capacity afforded by an assigned time slot is exceeded. That is, if a field unit must transmit more information to the base station than is possible via an assigned time slot, at least part of a reverse link traffic channel is additionally assigned for use by the field to transmit information to the base station.
Based on this new assignment of traffic channels 42, the base station 20 transmits data information to the corresponding subscriber unit 14 in step 420. The subscriber unit then demodulates and decodes the received payload message in step 425 and, in a following step 430, transmits an ACK message over the appropriate JACK channel 54 time slot 310 to indicate whether the data is properly received. In step 435, base station 20 demodulates and decodes the ACK message received from the subscriber unit 14 in a corresponding time slot 310.
In one embodiment, table 500 at the base station 20 includes entries in each cell 510 indicating an ID Tag of a subscriber unit 14 that is allowed to transmit information during a given time slot 310. The table 500 maintained at the subscriber unit 14 includes a flag in each cell 510 indicating which time slots 310 have been assigned for its use. Thus, subscriber unit 14 can determine in which time slot 310 to transmit a corresponding message and base station 20 can identify from which subscriber unit 14 a message pertains.
In a preferred embodiment, time-slots 310 are implicitly assigned for use by subscriber unit 310 based on the allocation of forward link traffic channels 42. For example, a subscriber unit 310 is allocated use of a time slot 310 in the reverse link JACK channel 54 depending on which traffic channels 42 are used in the forward link 40 to transmit a data payload to the subscriber unit 14. More specifically, if the base station 20 transmits forward link messages on traffic channel #1, time slot #1 of the shared reverse link channel in a delayed Epoch is implicitly assigned for use by that particular subscriber unit 14 to transmit feedback information in a reverse link path of the JACK channel 54. Transmission of a message in a particular time slot 310 by a newly assigned subscriber unit 14, as mentioned, is delayed so that the subscriber unit 14 can receive and process data received on the newly assigned forward link channel 40 and respond appropriately in the reverse link time slot 310 of JACK channel 54. When utilized, this aspect of the present invention alleviates the need to transmit explicit messages from the base station 20 to subscriber units 14 indicating which time slot 310 is to be used for data messages.
Notably, a subscriber unit 14 can receive data information from the base station 20 on multiple forward link traffic channels 42 while providing corresponding feedback messages on multiple implicitly assigned time slots of the shared JACK channel 54.
In an alternate embodiment, one or multiple time slots 310 are explicitly assigned for use by a subscriber unit 14 via a corresponding message sent on a forward link channel 40 from the base station 20 to a subscriber unit 14 indicating which of multiple time slots will be assigned for use in the reverse link JACK channel 54 to carry feedback messages.
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.
This application is a continuation of U.S. patent application Ser. No. 12/400,872, filed Mar. 10, 2009, which is a continuation of U.S. patent application Ser. No. 11/235,725, filed Sep. 26, 2005, now U.S. Pat. No. 7,502,351, issued Mar. 10, 2009, and is a continuation of U.S. patent application Ser. No. 09/775,304, filed Feb. 1, 2001, now U.S. Pat. No. 6,954,448, issued Oct. 11, 2005, which are incorporated by reference as if fully set forth.
| Number | Name | Date | Kind |
|---|---|---|---|
| 3560978 | Himmel et al. | Feb 1971 | A |
| 3725938 | Black et al. | Apr 1973 | A |
| 3742498 | Dunn | Jun 1973 | A |
| 3846799 | Gueguen | Nov 1974 | A |
| 3950753 | Chisholm | Apr 1976 | A |
| 4021813 | Black et al. | May 1977 | A |
| 4099184 | Rapshys | Jul 1978 | A |
| 4107469 | Jenkins | Aug 1978 | A |
| 4170766 | Pridham et al. | Oct 1979 | A |
| 4260994 | Parker | Apr 1981 | A |
| 4290071 | Fenwick | Sep 1981 | A |
| 4387378 | Henderson | Jun 1983 | A |
| 4488155 | Wu | Dec 1984 | A |
| 4577316 | Schiff | Mar 1986 | A |
| 4599733 | Gutleber | Jul 1986 | A |
| 4625308 | Kim et al. | Nov 1986 | A |
| 4631546 | Dumas et al. | Dec 1986 | A |
| 4642806 | Hewitt et al. | Feb 1987 | A |
| 4675863 | Paneth et al. | Jun 1987 | A |
| 4700197 | Milne | Oct 1987 | A |
| 4817089 | Paneth et al. | Mar 1989 | A |
| 4841526 | Wilson et al. | Jun 1989 | A |
| 4862453 | West et al. | Aug 1989 | A |
| 4866709 | West et al. | Sep 1989 | A |
| 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 et al. | Mar 1994 | A |
| 5303240 | Borras et al. | Apr 1994 | A |
| 5325394 | Bruckert | Jun 1994 | A |
| 5325419 | Connolly et al. | Jun 1994 | A |
| 5337316 | Weiss et al. | Aug 1994 | A |
| 5339316 | Diepstraten | Aug 1994 | A |
| 5353332 | Raith et al. | Oct 1994 | A |
| 5355374 | Hester et al. | Oct 1994 | A |
| 5373502 | Turban | Dec 1994 | A |
| 5375124 | D'Ambrogio et al. | Dec 1994 | A |
| 5377192 | Gooding et al. | Dec 1994 | A |
| 5388102 | Griffith et al. | Feb 1995 | A |
| 5394473 | Davidson | Feb 1995 | A |
| 5410568 | Schilling | Apr 1995 | A |
| 5412429 | Glover | May 1995 | A |
| 5414728 | Zehavi | May 1995 | A |
| 5422887 | Diepstraten et al. | Jun 1995 | A |
| 5430452 | DuBois | Jul 1995 | A |
| 5437055 | Wheatley, III | Jul 1995 | A |
| 5442625 | Gitlin et al. | Aug 1995 | A |
| 5446727 | Bruckert et al. | Aug 1995 | A |
| 5463629 | Ko | Oct 1995 | A |
| 5471463 | Hulbert | Nov 1995 | A |
| 5479176 | Zavrel, Jr. | Dec 1995 | A |
| 5481533 | Honig et al. | Jan 1996 | A |
| 5487180 | Ohtake | Jan 1996 | A |
| 5490136 | Sereno et al. | Feb 1996 | A |
| 5493569 | Buchholz et al. | Feb 1996 | A |
| 5502447 | Kumpfbeck et al. | Mar 1996 | A |
| 5511068 | Sato | Apr 1996 | A |
| 5537397 | Abramson | Jul 1996 | A |
| 5537414 | Takiyasu et al. | Jul 1996 | A |
| 5550828 | Gries et al. | Aug 1996 | A |
| 5559789 | Nakano et al. | Sep 1996 | A |
| 5577022 | Padovani et al. | Nov 1996 | A |
| 5581575 | Zehavi et al. | Dec 1996 | A |
| 5585850 | Schwaller | Dec 1996 | A |
| 5586119 | Scribano et al. | Dec 1996 | A |
| 5590409 | Sawahashi et al. | Dec 1996 | A |
| 5592178 | Chang et al. | Jan 1997 | A |
| 5592468 | Sato | Jan 1997 | A |
| 5592470 | Rudrapatna et al. | Jan 1997 | A |
| 5592471 | Briskman | Jan 1997 | A |
| 5598416 | Yamada et al. | Jan 1997 | A |
| 5598417 | Crisler et al. | Jan 1997 | A |
| 5604730 | Tiedmann, Jr. | Feb 1997 | A |
| 5606580 | Mourot et al. | Feb 1997 | A |
| 5617102 | Prater | Apr 1997 | A |
| 5617423 | Li et al. | Apr 1997 | A |
| 5619492 | Press et al. | Apr 1997 | A |
| 5619524 | Ling et al. | Apr 1997 | A |
| 5621752 | Antonio et al. | Apr 1997 | A |
| 5634199 | Gerlach et al. | May 1997 | A |
| 5642348 | Barzegar et al. | Jun 1997 | A |
| 5642377 | Chung et al. | Jun 1997 | A |
| 5652764 | Kanzaki et al. | Jul 1997 | A |
| 5655001 | Cline et al. | Aug 1997 | A |
| 5657326 | Burns et al. | Aug 1997 | A |
| 5657358 | Panech et al. | Aug 1997 | A |
| 5663958 | Ward | Sep 1997 | A |
| 5663990 | Bolgiano et al. | Sep 1997 | A |
| 5673259 | Quick, Jr. | Sep 1997 | A |
| 5680142 | Smith et al. | Oct 1997 | A |
| 5684794 | Lopez et al. | Nov 1997 | A |
| 5687194 | Paneth et al. | Nov 1997 | A |
| 5689502 | Scott | Nov 1997 | A |
| 5697059 | Carney | Dec 1997 | A |
| 5699364 | Sato et al. | Dec 1997 | A |
| 5708656 | Noneman et al. | Jan 1998 | A |
| 5712869 | Lee et al. | Jan 1998 | A |
| 5715236 | Gilhousen et al. | Feb 1998 | A |
| 5726981 | Ylitervo et al. | Mar 1998 | A |
| 5734646 | I et al. | Mar 1998 | A |
| 5739784 | Jan et al. | Apr 1998 | A |
| 5742592 | Scholefield et al. | Apr 1998 | A |
| 5745484 | Scott | Apr 1998 | A |
| 5758288 | Dunn et al. | May 1998 | A |
| 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 |
| 5802046 | Scott | Sep 1998 | A |
| 5802465 | Hamalainen et al. | Sep 1998 | A |
| 5805994 | Perrault et al. | Sep 1998 | A |
| 5812131 | Bertram | Sep 1998 | A |
| 5825807 | Kumar | Oct 1998 | A |
| 5828659 | Teder et al. | Oct 1998 | A |
| 5828662 | Jalali et al. | Oct 1998 | A |
| 5838720 | Morelli | Nov 1998 | A |
| 5841768 | Ozluturk et al. | Nov 1998 | A |
| 5844894 | Dent | Dec 1998 | A |
| 5845211 | Roach | Dec 1998 | A |
| 5854786 | Henderson et al. | Dec 1998 | A |
| 5856971 | Gitlin et al. | Jan 1999 | A |
| 5859840 | Tiedemann, Jr. et al. | Jan 1999 | A |
| 5859879 | Bolgiano et al. | Jan 1999 | A |
| 5862476 | Hasegawa | Jan 1999 | A |
| 5867527 | Ziv et al. | Feb 1999 | A |
| 5872786 | Shobatake | Feb 1999 | A |
| 5873043 | Comer | Feb 1999 | A |
| 5881060 | Morrow et al. | Mar 1999 | A |
| 5881368 | Grob et al. | Mar 1999 | A |
| 5884196 | Lekven et al. | Mar 1999 | A |
| 5892774 | Zehavi et al. | Apr 1999 | A |
| 5892793 | Gibson | Apr 1999 | A |
| 5893035 | Chen | Apr 1999 | A |
| 5894473 | Dent | Apr 1999 | A |
| 5896376 | Alperovich et al. | Apr 1999 | A |
| 5898929 | Haartsen | Apr 1999 | A |
| 5903834 | Wallstedt et al. | May 1999 | A |
| 5905473 | Taenzer | May 1999 | A |
| 5910944 | Callicotte et al. | Jun 1999 | A |
| 5910945 | Garrison et al. | Jun 1999 | A |
| 5914950 | Tiedemann, Jr. et al. | Jun 1999 | A |
| 5915216 | Lysejko | Jun 1999 | A |
| 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 |
| 5950131 | Vilmur | Sep 1999 | A |
| 5956332 | Rasanen et al. | Sep 1999 | A |
| 5959980 | Scott | Sep 1999 | A |
| 5960361 | Chen | Sep 1999 | A |
| 5963559 | Ohki | Oct 1999 | A |
| 5966374 | Rasanen | Oct 1999 | A |
| 5974036 | Acharya et al. | Oct 1999 | A |
| 5982760 | Chen | Nov 1999 | A |
| 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 |
| 6005852 | Kokko et al. | Dec 1999 | A |
| 6005855 | Zehavi et al. | Dec 1999 | A |
| 6009106 | Rustad et al. | Dec 1999 | A |
| 6011800 | Nadgauda et al. | Jan 2000 | A |
| 6016312 | Storm et al. | Jan 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 |
| 6049535 | Ozluturk | Apr 2000 | A |
| 6049538 | Scott | Apr 2000 | A |
| 6052385 | Kanerva et al. | Apr 2000 | A |
| 6058338 | Agashe et al. | May 2000 | A |
| 6064678 | Sindhushayana et al. | May 2000 | A |
| 6069880 | Owen et al. | May 2000 | A |
| 6069883 | Ejzak et al. | May 2000 | A |
| 6070071 | Chavez et al. | May 2000 | A |
| 6075974 | Saints et al. | Jun 2000 | A |
| 6078572 | Tanno et al. | Jun 2000 | A |
| 6081536 | Gorsuch et al. | Jun 2000 | A |
| 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 |
| 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 |
| 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 |
| 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 |
| 6215798 | Carneheim et al. | Apr 2001 | B1 |
| 6219342 | Rege | Apr 2001 | B1 |
| 6222828 | Ohlson et al. | Apr 2001 | B1 |
| 6222832 | Proctor, Jr. | 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 | Tiedemann et al. | Jun 2001 | B1 |
| 6246715 | Park et al. | Jun 2001 | B1 |
| RE37301 | Lo | Jul 2001 | E |
| 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 |
| 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 | Kitadef 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 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 |
| 6643318 | Parsa et al. | Nov 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 |
| 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 |
| 6757319 | Parsa et al. | Jun 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 |
| 6853841 | St. Pierre | Feb 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 |
| 6954448 | Farley 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 |
| 7079507 | Toskala et al. | Jul 2006 | B2 |
| 7079523 | Nelson, Jr. et al. | Jul 2006 | B2 |
| 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 |
| 20010030990 | Rouphael et al. | Oct 2001 | A1 |
| 20010033558 | Matsuki | Oct 2001 | A1 |
| 20010036200 | Nelson et al. | Nov 2001 | A1 |
| 20010038674 | Trans | Nov 2001 | A1 |
| 20010039191 | Maierhofer | Nov 2001 | A1 |
| 20020009061 | Willenegger | Jan 2002 | A1 |
| 20020012332 | Tiedemann et al. | Jan 2002 | A1 |
| 20020045441 | Ralston et al. | Apr 2002 | A1 |
| 20020080024 | Nelson et al. | Jun 2002 | A1 |
| 20020097700 | Alastalo | Jul 2002 | A1 |
| 20020141478 | Ozluturk et al. | Oct 2002 | A1 |
| 20030060224 | Nelson et al. | Mar 2003 | A1 |
| 20030095517 | Proctor, Jr. | May 2003 | A1 |
| 20030123401 | Dean | Jul 2003 | A1 |
| 20040005078 | Tillotson | Jan 2004 | A1 |
| 20040009785 | Nelson et al. | Jan 2004 | A1 |
| 20040047328 | Proctor et al. | Mar 2004 | A1 |
| 20040073803 | Keramane | Apr 2004 | A1 |
| 20040081115 | Parsa et al. | Apr 2004 | A1 |
| 20040160910 | Gorsuch et al. | Aug 2004 | A1 |
| 20040180696 | Foore et al. | Sep 2004 | A1 |
| 20040252668 | Ozluturk et al. | Dec 2004 | A1 |
| 20050202823 | Shaheen et al. | Sep 2005 | A1 |
| 20050208961 | Willenegger | Sep 2005 | A1 |
| 20080225766 | Roy et al. | Sep 2008 | A1 |
| Number | Date | Country |
|---|---|---|
| 1296678 | May 2001 | CN |
| 2812575 | Sep 1979 | DE |
| 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 |
| 0 773 636 | May 1997 | EP |
| 0 808 074 | Nov 1997 | EP |
| 0 907 262 | Apr 1999 | EP |
| 0 910 176 | Apr 1999 | EP |
| 1 018 809 | Dec 2000 | EP |
| 1 102 512 | May 2001 | EP |
| 2 326 524 | Dec 1998 | GB |
| 59-050603 | Mar 1984 | JP |
| 63108827 | May 1988 | 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-264098 | Oct 1995 | JP |
| 08-065273 | Mar 1996 | JP |
| 08-242482 | Sep 1996 | JP |
| 09-023203 | Jan 1997 | JP |
| 09-46270 | Feb 1997 | JP |
| 09-055693 | Feb 1997 | JP |
| 2000-013867 | Jan 2000 | JP |
| 566045 | Dec 2003 | TW |
| 200536325 | Nov 2005 | TW |
| 9315573 | Aug 1993 | WO |
| 9508900 | Mar 1995 | WO |
| 9608934 | Mar 1996 | WO |
| 9619050 | Jun 1996 | WO |
| 9637081 | Nov 1996 | WO |
| 9627994 | Dec 1996 | WO |
| 9746041 | Apr 1997 | WO |
| 9723073 | Jun 1997 | WO |
| 9726726 | Jul 1997 | WO |
| 9732412 | Sep 1997 | WO |
| WO-9949596 | Sep 1999 | WO |
| WO-9963682 | Dec 1999 | WO |
| WO-0057663 | Sep 2000 | WO |
| WO-0062449 | Oct 2000 | WO |
| Entry |
|---|
| Non-Final Office Action for U.S. Appl. No. 09/775,304 mailed Sep. 8, 2004, 7 pgs. |
| Notice of Allowance and Fees for U.S. Appl. No. 09/775,304 mailed May 27, 2005, 5 pgs. |
| Non-Final Office Action for U.S. Appl. No. 11/235,725 mailed May 5, 2008, 7 pgs. |
| Notice of Allowance and Fees for U.S. Appl. No. 11/235,725 mailed Oct. 27, 2008, 5 pgs. |
| Non-Final Office Action for U.S. Appl. No. 12/400,872 mailed Aug. 30, 2011, whole document. |
| Non-Final Office Action for U.S. Appl. No. 12/400,872 mailed Nov. 4, 2011, whole document. |
| Notice of Allowance and Fees for U.S. Appl. No. 12/400,872 mailed Jun. 15, 2012, whole document. |
| Notice of Allowance and Fees for U.S. Appl. No. 12/400,872 mailed Aug. 31, 2012, 5 pgs. |
| 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 Communications, 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).** |
| 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 System, 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 Transaction 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 (TSG) RAN WG4 UE Radio transmission and Reception (FDD),” TS 25.101 V3.1.0 (Dec. 1999). |
| Third Generation Partnership Project, “Technical Specification Group Radio Access Networks; UE Radio Transmission and Reception (FDD) (Release 1999),” 3GPP TS 25.101 V3.5.0 (Dec. 2000). |
| Third Generation Partnership Project, “3rd Generation Partnership Project (3GPP); Technical Specification Group (TSG) RAN WG4; Requirements for Support of Radio Resource Management (FDD),” 3G TS 25.133 V3.0.0 (Dec. 1999). |
| 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.4.0 (Dec. 2000). |
| Third Generation Partnership Project, “Technical Specification Group Radio Access Network; Physical layer—General description (3G TS 25.201 version 3.0.0),” 3G TS 25.201 V3.0.0 (Oct. 1999). |
| 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 channels and mapping of transport channels onto physical channels (FDD) (3G TS 25.211 version 3.1.0),” 3G TS 25.211 V3.1.1 (Sep. 1999). |
| 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.5.0 (Dec. 2000). |
| Third Generation Partnership Project, “Technical Specification Group Group Radio Access Network; Multiplexing and channel coding (FDD) (3G TS 25.212 version 3.1.0),” 3G TS 25.212 V3.1.1 (Dec. 1999). |
| 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; Physical Layer Procedures (FDD) (Release 1999).” 3GPP TS 25.214 v3.1.0 (Dec. 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 channels and mapping of transport channels onto physical channels (TDD) (3G TS 25.221 version 3.1.0),” 3G TS 25.221 V3.1.0 (Dec. 1999). |
| 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.5.0 (Dec. 2000). |
| Third Generation Partnership Project, “Technical Specification Group Radio Access Network; Spreading and modulation (TDD) (Release 1999),” 3GPP TS 25.223 V3.1.0 (Dec. 1999). |
| Third Generation Partnership Project, “Technical Specification Group Radio Access Network; Spreading and modulation (TDD) (Release 1999),” 3GPP TS 25.223 V3.4.0 (Sep. 2000). |
| Third Generation Partnership Project, “Technical Specification Group Radio Access Network; Physical layer procedures (TDD) (Release 1999),” 3GPP TS 25.224 V3.1.0 (Dec. 1999). |
| Third Generation Partnership Project, “Technical Specification Group Radio Access Network; Physical layer procedures (TDD) (Release 1999),” 3GPP TS 25.224 V3.5.0 (Dec. 2000). |
| Third Generation Partnership Project, “Technical Specification Group Radio Access Network; Radio Resource Management Strategies (3G TR 25.922 version 3.0.0),” 3G TR 25.922 V3.0.0 (Dec. 1999). |
| Third Generation Partnership Project, “Technical Specification Group Radio Access Network; Radio Resource Management Strategies (Release 1999),” 3G TR 25.922 V3.4.0 (Dec. 2000). |
| Third Generation Partnership Project, “Technical Specification Group Radio Access Network; Services provided by the physical layer (Release 1999),” 3GPP TS 25.302 V3.7.0 (Dec. 2000). |
| Third Generation Partnership Project, “Technical Specification Group Radio Access Network; Services provided by the physical layer (Release 1999),” 3GPP TS 25.302 V3.2.0 (Dec. 1999). |
| Third Generation Partnership Project, “Technical Specification Group Radio Access Network; UE Procedures in Idle Mode and Procedures for Cell Reselection in Connected Mode (3G TS 25.304 version 3.1.0),” 3G TS 25.304 V3.1.0 (Dec. 1999). |
| 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.5.0 (Dec. 2000). |
| 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.2.0 (Dec. 1999). |
| Third Generation Partnership Project, “Technical Specification Group Radio Access Network; MAC protocol specification (Release 1999),” 3G TS 25.321 V3.6.0 (Dec. 2000). |
| Third Generation Partnership Project, “Technical Specification Group Radio Access Network; RRC Protocol Specification (3G TS 25.331 version 3.1.0 Release 1999),” 3G TS 25.331 V3.1.0 (Jan. 2000). |
| Third Generation Partnership Project, “Technical Specification Group Radio Access Network; RRC Protocol Specification (Release 1999),” 3GPP TS 25.331 V3.5.0 (Dec. 2000). |
| Third Generation Partnership Project, “Technical Specification Group Radio Access Network, Synchronisation in UTRAN Stage 2 (Release 1999),” 3GPP TS 25.402 V3.4.0 (Dec. 2000). |
| Third Generation Partnership Project, “Technical Specification Group Radio Access Network, Synchronisation in UTRAN Stage 2 (Release 1999),” 3GPP TS 25.402 V3.0.0 (Dec. 2000). |
| 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. |
| Number | Date | Country | |
|---|---|---|---|
| 20120307809 A1 | Dec 2012 | US |
| Number | Date | Country | |
|---|---|---|---|
| Parent | 12400872 | Mar 2009 | US |
| Child | 13572313 | US | |
| Parent | 11235725 | Sep 2005 | US |
| Child | 12400872 | US | |
| Parent | 09775304 | Feb 2001 | US |
| Child | 11235725 | US |
