Combined unique gold code transmissions

Description

BACKGROUND

A number of modulation techniques have been developed for facilitating communications in a network where multiple users are present. Such techniques include code division multiple access (CDMA), time division multiple access (TDMA), and frequency division multiple access (FDMA). CDMA is a spread-spectrum technology that uses pseudo-random number sequences to modulate incoming data, multiple transmitters transmitting on the same signal, and orthogonal codes (Walsh codes) to correlate different communication channels. TDMA uses time slots to coordinate multiple uplink transmitters that are transmitting in the same sub-slots. Users transmit in rapid succession, one after the other, each using his/her own time slot, allowing multiple stations to share the same transmission medium (e.g., radio frequency channel) while using only a portion of the total available bandwidth. FDMA allocates different users with different carrier frequencies of the radio spectrum.

In addition to modulation techniques, protocols exist for determining how network devices respond when two devices attempt to use a data channel simultaneously (called a collision). CSMA/CD (Carrier Sense Multiple Access/Collision Detection) is used by Ethernet networks to physically monitor the traffic on the line at participating stations. If no transmission is taking place at the time, the particular station can transmit. If two stations attempt to transmit simultaneously, this causes a collision, which is detected by all participating stations. After a random time interval, the stations that collided attempt to transmit again. If another collision occurs, the time intervals from which the random waiting time is selected are increased step by step. This is known as exponential back off.

SUMMARY

An exemplary embodiment uses a random phase multiple access communication interface. The interface can communicatively connect to systems and devices using spread spectrum modulation methods without the use of orthogonal codes.

An exemplary random phase multiple access communication interface communicatively connects systems and devices using spread spectrum modulation methods. The random selection of chip (or timing) offsets as a multiple access scheme allows for non-coordinated data transmission without needing to be assigned a unique “code.” All users transmit using the same PN (pseudo noise) code such that a PN array despreader at the access point can be used. If two signals are received at the access point at the same PN offset (or the sum of the PN offset with the transmission delay in number of chips yields the same value for 2 or more transmissions), then a “collision” has occurred and it may not be possible to demodulate these 2 or more signals. The randomization of timing offsets each time means that any “collisions” that occur only occur during that frame. A retransmission scheme and a new randomized offset is used to get through in a subsequent attempt.

An exemplary embodiment includes a transmitter at the tag (uplink) and a method of transmitting signals from the tag to an access point. Each tag includes its own transmitter which transmits information in the form of frames. A frame can be formed from information provided on a channel having a fixed data rate. The data can be spread using the same pseudo-noise (PN) code, and can have a randomly selected chip offset. The transmitter also applies frequency rotation and sample clock correction to match the reference oscillator of the access point. A plurality of tags is associated with a single access point to form the network. Each of the plurality of tags transmits information using the same PN code along with a randomly selected chip offset. The phase is randomly selected each frame over a large number of chips (i.e., 8192).

Another exemplary embodiment includes a transmitter at an access point (downlink) and a method for transmitting signals from the access point to the tags. The access point transmitter can be similar to that of the tags. However, the access point transmitter uses a unique PN code for each of the tags with which it communicates. The use of distinct PN codes for each tag provides security and allows each tag to ignore signals which are directed toward other tags. The frames transmitted by the access point also include a preamble of approximately 9 symbols to allow for rapid acquisition at the tags.

Another exemplary embodiment includes a demodulator at the tag and a method for demodulating signals received by the tag. An automatic frequency control (AFC) derotator multiplication is applied to signals received at the tag. The AFC derotator multiplication is a 1 bit complex operation with a 1 bit complex output such that gate count is improved. The tag uses a PN array despreader that takes advantage of the huge computational savings in the 1 bit data path.

Another exemplary embodiment includes a demodulator at the access point and a method for demodulating signals received at the access point. The access point demodulator has capacity to simultaneously demodulate several thousand or more links received from tags. To demodulate such a large number of links, the access point demodulator includes a PN array despreader.

Another exemplary embodiment includes synchronization of the tag with a master timing of the access point. The access point can periodically transmit a broadcast frame. During a ‘cold’ timing acquisition, the tag uses its PN despreader to analyze the broadcast frames and identify the master timing of the access point. Cold timing acquisition is expected to occur one time when the tag is first introduced into the system. After the initial cold acquisition, the tag can perform a ‘warm’ timing acquisition each time the tag wakes up to transmit or receive a signal. The warm timing acquisition utilizes less power than the cold timing acquisition.

In at least one exemplary embodiment, each tag separately generates a PN code. A gold code is an example of a PN code that is parameterizable such that each user has its own. As such, only data destined for a particular user is visible to it. Using unique PN codes, a tag does not process data that is not its own.

An exemplary method for communicating through a multiple access communication interface includes receiving a first signal from a first tag, where the first signal is spread using a predetermined pseudo-noise (PN) code, and further where the first signal includes first payload data. A second signal is received from a second tag. The second signal is spread using the predetermined PN code, and the second signal includes second payload data. The first payload data from the first signal is identified at least in part with a PN array despreader. The second payload data from the second signal is also identified at least in part with the PN array despreader.

An exemplary system for communicating through a multiple access communication interface includes a first tag, a second tag, and an access point. The first tag has a first transmitter configured to transmit first payload data in a first signal, wherein the first signal is spread using a predetermined pseudo-noise (PN) code. The second tag has a second transmitter configured to transmit second payload data in a second signal, wherein the second signal is spread using the predetermined PN code. The access point is in communication with the first tag and the second tag and includes a receiver and a despread array. The receiver is configured to receive the first signal and the second signal. The despread array is configured to despread the first signal and the second signal.

An exemplary access point for use in a multiple access communication system includes a processor, a receiver in communication with the processor, and a transmitter in communication with the processor. The receiver is configured to receive a first signal from a first tag, wherein the first signal includes first payload data, and further wherein the first signal is spread using a predetermined pseudo-noise (PN) code. The receiver is also configured to receive a second signal from a second tag, wherein the second signal includes second payload data, and further wherein the second signal is spread using the predetermined PN code. The transmitter is configured to transmit a third signal to the first tag, wherein the third signal is spread with a second PN code, and further wherein the second PN code is specific to the first tag.

An exemplary method for conserving bandwidth in a communication system is provided. The method includes spreading a data frame using a first pseudo-noise (PN) spreader. A broadcast frame is spread using a second PN spreader. A complex data stream having a first component and a second component is generated. The data frame is assigned to the first component and the broadcast frame is assigned to the second component. The complex data stream is transmitted to a tag.

An exemplary access point is also provided. The access point includes a process and a transmitter operatively coupled to the processor. The processor is configured to spread a data frame using a first pseudo-noise (PN) spreader. The processor is also configured to spread a broadcast frame using a second PN spreader. The processor is further configured to generate a complex data stream having a first component and a second component, where the data frame is assigned to the first component and the broadcast frame is assigned to the second component. The transmitter is configured to transmit the complex data stream to a tag.

An exemplary computer-readable medium is also provided. The computer-readable medium has computer-readable instructions stored thereon that, upon execution by a processor, cause an access point to spread a data frame using a first pseudo-noise (PN) spreader. The computer-readable instructions also cause the access point to spread a broadcast frame using a second PN spreader. The computer-readable instructions also cause the access point to generate a complex data stream having a first component and a second component, where the data frame is assigned to the first component and the broadcast frame is assigned to the second component. The computer-readable instructions further cause the access point to transmit the complex data stream to a tag.

These and other features, aspects and advantages will become apparent from the following description, appended claims, and the accompanying exemplary embodiments shown in the drawings, which are briefly described below.

BRIEF DESCRIPTION OF THE DRAWINGS

The details of one or more implementations of the subject matter described in this specification are set forth in the accompanying drawings and the description below. Other features, aspects, and advantages of the subject matter will become apparent from the description, the drawings, and the claims.

FIG. 1 is a diagram depicting an uplink transmitter according to an exemplary embodiment.

FIG. 2 is a diagram depicting a downlink transmitter according to an exemplary embodiment.

FIG. 3 is a diagram depicting slot structures and assignments in an exemplary embodiment.

FIG. 4 is a diagram depicting a PN (pseudo noise) despread array in an exemplary embodiment.

FIG. 5 is a flow diagram depicting operations performed in the tag processing of a broadcast channel from a cold start in an exemplary embodiment.

FIG. 6 is a flow diagram depicting operations performed in the tag processing of a dedicated channel from a warm start in an exemplary embodiment.

FIG. 7 is a diagram depicting a tag receive data path in an exemplary embodiment.

FIG. 8 is a diagram depicting time tracking in an exemplary embodiment.

FIG. 9 is a diagram depicting an AFC (automatic frequency control) rotation in an exemplary embodiment.

FIG. 10 is a diagram depicting a dedicated communication finger in an exemplary embodiment.

FIG. 11 is a flow diagram depicting operations performed during access point receive processing in an exemplary embodiment.

FIG. 12 is a diagram depicting an access point receive data path in an exemplary embodiment.

FIG. 13 is a diagram depicting asynchronous initial tag transmit operations in an exemplary embodiment.

FIG. 14 is a diagram depicting interactions between an access point and a tag in a slotted mode according to an exemplary embodiment.

FIG. 15 is a diagram depicting data transfer between an access point and a tag according to an exemplary embodiment.

FIG. 16 is a diagram illustrating contents of a complete slot in accordance with a first exemplary embodiment.

FIG. 17 is a diagram illustrating contents of a complete slot in accordance with a second exemplary embodiment.

FIG. 18 illustrates a fundamental downlink slot in accordance with an exemplary embodiment.

FIG. 19 is a diagram illustrating preamble frame processing in accordance with an exemplary embodiment.

FIG. 20 is a diagram illustrating a data sub-slot hierarchy in accordance with an exemplary embodiment.

FIG. 21A illustrates a fundamental downlink slot with a plurality of sub-slots in accordance with an exemplary embodiment.

FIG. 21B illustrates a fundamental downlink slot with a single slot in accordance with an exemplary embodiment.

FIG. 22 is a flow diagram illustrating operations performed to construct a frame in accordance with an exemplary embodiment.

FIG. 23 is a diagram illustrating a downlink transmission model in accordance with an exemplary embodiment.

Like reference numbers and designations in the various drawings indicate like elements.

DETAILED DESCRIPTION

Exemplary embodiments are described below with reference to the accompanying drawings. It should be understood that the following description is intended to describe exemplary embodiments, and not to limit the invention defined in the appended claims.

FIG. 1 illustrates an uplink transmitter 10 which includes structures such as a convolution encoder, an interleave module, a modulator, a pseudo-noise spreader, a filter, a bank of taps, an automatic frequency control (AFC) rotator, and other such structures. These structures perform operations depicted in blocks 12, 14, 16, 18, 20, and 22. The transmit path of uplink transmitter 10 is a coded and spread spectrum waveform. In an exemplary embodiment, the uplink transmitter 10 can be included in a tag that communicates with an access point along with other tags using demodulated communication channels. Additional, fewer, or different operations may be performed by the uplink transmitter 10 depending on the particular embodiment. The operations may also be performed in a different order than that shown and described. As used herein, a tag can refer to any communications device configured to receive signals from and/or send signals to an access point. The access point can refer to any communications device configured to simultaneously communicate with a plurality of tags. In an exemplary embodiment, the tags can be mobile, low power devices which run off a battery or other stored power, and the access point can be located in a central location and receive power from a power source such as a wall outlet or generator. Alternatively, the tags may plug into an outlet and/or the access point may run off of a battery or other stored power source.

In block 12, a data stream is received by a convolution encoder and interleave module. In one embodiment, the data stream is 128 Bits including the preamble. Alternatively, data streams of other sizes may be used. Once received, the data stream is encoded using the convolution encoder. In an exemplary embodiment, the data stream may be encoded at a rate of ½. Alternatively, other rates may be used. The data stream can also be interleaved using the interleave module. An encoded symbols stream is output to a block 14 in which a differential binary phase shift keying (D-BPSK) modulator is used to modulate the encoded symbols stream. In alternative embodiments, other modulation schemes may be used. At block 16, the modulated stream is applied to a PN spreader. In an exemplary embodiment, the PN spreader can use a common network gold code channel using a selected spreading factor. The spreading factor can be a member of the set {64, 128, 256, . . . , 8192}. Alternatively, any other code and/or spreading factor may be used. Each of the tags at a given spreading factor is spread by the same PN code with a randomly selected chip offset. The large range of possible randomly selected chip offsets increases the probability that a particular frame will not collide (or, in other words, have the same chip timing at the access point) with another frame from another transmitter. The probability of collision in the limit of approaching capacity may become non-negligible (˜10% or less) and can be solved via retransmission of the same frame at a differently drawn random offset. The PN spreader is described in more detail below with reference to FIG. 4. In an exemplary embodiment, an output of block 18 can have a rate of 1 bit at 1 mega-chip per second (Mcps). Alternatively, other rates may be used.

At block 18, the data stream is upsampled by a 4×oversample filter and time tracking logic is used to ensure that all of the frames land at the same sample rate consistent with the frequency reference of the AP. Block 18 receives a sample slip/repeat indicator as an input. In one embodiment, an output of block 18 may have a real frequency of approximately 4 megahertz (MHz). At block 20, an automatic frequency control (AFC) rotation is done including a frequency offset to match the access point's timing offset, ensuring that all of the frames from all of the users lands near the same frequency hypothesis. In one embodiment, an output of block 20 may have a complex frequency of approximately 4 MHz. At block 22, a delay is imposed from the start slot until the correct access slot occurs. In addition, a random chip delay is imposed on the signal. In an exemplary embodiment, the random chip delay can be from 0 to the spreading factor minus 1. Alternatively, a different random chip delay may be used. The slot access can be described by A(i,j) where i is related to the spreading factor as 2^(13-i) and j is the sub-slot number corresponding to non-overlapping slots. Depending upon the selected spreading factor, there are generally multiple transmit opportunities in a given slot. For the uplink, the access slot can be randomly selected along with a chip offset from 0 to spreading factor minus 1. As such, the probability of collision between uplink users is minimized, while allowing for re-selection for cases where there are collisions. After the signal has been delayed, the signal can be transmitted to an access point.

FIG. 2 illustrates a downlink transmitter 30 including structures such as a convolution encoder, an interleave module, a modulator, a pseudo-noise spreader, a filter, a bank of taps, and other such structures. Using transmitter 30, the access point (AP) transmits multiple channels each destined for a particular tag or user. These structures perform operations depicted in blocks 32 through 54. Blocks 32 to 40 and blocks 42 to 50 represent distinct data paths that can be replicated for additional data flows. In an exemplary embodiment, blocks 32-38 can perform operations similar to the operations described with reference to FIG. 1 on a first data stream. Similarly, blocks 42-48 can perform operations similar to the operations described with reference to FIG. 1 on an nth data stream, where n can be any value. The input to block 36 can be a gold code specific to the tag which is to receive the first data stream, and the input to block 46 can be a gold code specific to the tag which is receive the nth data stream. Alternatively, other codes such as a broadcast gold code, a non-gold code, or other may be used to spread the first data stream and/or the nth data stream. The output of block 38 and/or block 48 can be weighted in blocks 40 and 50 in case the data links corresponding to the first data stream and the nth data stream are of unequal power. Once weighted, the paths are summed in a block 52. A hard decision is also made in block 52 where all positive numbers are mapped to 0 and all negative numbers are mapped to 1. Alternatively, a different hard decision may be made. In one embodiment, an output of block 52 may have a rate of 1 bit at 10 Mcps. Alternatively, other rates may be used. The sum output from block 52 is upsampled using a 4×chip filter in block 54. In one embodiment, an output of block 54 can have a real frequency of 40 MHz. Alternatively, other frequencies may be used. Not shown is a transmission on an adjacent frequency that is a single set of broadcast frames at a maximum downlink spreading factor of 2048. Alternatively, a different maximum downlink spreading factor may be used.

FIG. 3 illustrates slot structures and assignments. In at least one embodiment, data stream 70 includes slot 72, slot 74, and slot 76. Slot 72 is an AP-to-tags communication, slot 74 is a tags-to-AP communication, and slot 76 is an AP-to-tags communication. In an exemplary embodiment, each of the slots can have a duration of 2.1 seconds. Alternatively, any other duration may be used and/or different slots may have different durations. The data stream 70 can be implemented in a half-duplex communication scheme such that at any given time, either the AP is transmitting and the tags are receiving, or the tags are transmitting and the AP is receiving. In alternative embodiments, other communication schemes may be used. As shown in FIG. 3, data channel 80 depicts processing gain options for data in slot 72. If a data link closes at a particular gain, the tag only needs to be ready to receive (in AP to tags mode) during the duration of the slot with the corresponding gain. In transmit mode, the slot selection governs the transmission from the tag to the access point such that the tag can minimize its on time in the power consuming transmit mode. For example, a gain of 18 dB only needs a 1.6 ms slot (A_7,0). Data channel 82 depicts processing gain options for data in slot 74. As can be seen, the power used by a tag can be selected such that each data link arrives at the AP at the same power.

There is a symmetry between processing a large number of simultaneous waveforms on the AP side, and the processing of the relative few waveforms on the tag side. Automatic frequency control (AFC), time-tracking drift, and frame timing are known on the AP side due to the fact that the AP is the master of these parameters. However, AFC, time-tracking drift, and frame timing may be determined at acquisition on the tag side. The PN array despreader performs the brute force operation associated with both, which is an efficient implementation for exploring acquisition hypothesis/demodulating. Another aspect of this is that this large power-consuming circuit (when active), though running continuously on the AP (which shouldn't matter because it can be plugged into the wall), is only running during a “cold” acquisition on the tag which should happen rarely. Cold acquisition and warm acquisition are described in more detail with reference to FIGS. 5 and 6, respectively.

FIG. 4 illustrates a PN (pseudo noise) despread array, which facilitates both the acquisition of a single waveform on the tag, and brute-force demodulation of multiple waveforms on the AP. In an exemplary embodiment, the PN despread array can perform a 1 bit dot product of many chip-spaced timing hypotheses simultaneously.

A PN despread core element can be a simple counter that is incremented or not incremented each clock depending on whether the input is a 0 or a 1. Since it is a complex data path, there are two counters: one for I (in-phase) and one for Q (quadrature-phase). Multiplication by a complex exponential is generally a set of 4 rather large scalar multipliers (4×1000 gates is typical) coupled to a complex exponential table. In contrast, a one bit complex multiplier is basically a simple truth table, such as the example table shown below, where the negative denotes the inverse (0→1 and 1→0). This truth table can be implemented using just a few gates.

Phase
0
1
2
3

I′
I
−Q
−I
Q

Q′
Q
I
−Q
−I

FIG. 4 depicts a PN despread array 100. There can be many instantiations (e.g., 256 or more in one embodiment) of pairs of counters for the complex despread operation. The PN despread array 100 can be fed at chip rate with adjacent instantiations of PN despread elements 102, 104, and 106 working on timing hypotheses that are a chip apart. The 1 bit complex data is sent from a block 114 to elements 102, 104, and 106 where it is combined with a PN signal from PN generator 110. PN signal generator 110 can be hardware that outputs the same sequence of 0s and 1s with which the AP is spreading the data. In the case of element 102, the derotated data is combined (more specifically, 1 bit complex multiplied) with the PN signal at a combiner 122a. Real and imaginary parts of this combination are separately input into counters 118a and 120a. The counters 118a and 120a shift the bit stream out upon receipt of a reset signal 112. More specifically, the data in the counters is valid just prior to the reset signal. The reset signal forces zeros into both counters. The multiplexer 108 allows for output of the currently valid counters for that finger that has uniquely finished its despreading operation at that particular clock. Other elements in the PN despread array 100 operate similarly. Element 104 receives derotated data from block 114 and combines it with a PN signal after a delay is imposed by delay block 116a in element 102. The combination is entered into counters 118b and 120b, which gets shifted out of the counters upon a signal from the reset signal 112 with an imposed delay from a delay block 124a. Likewise, element 106 receives derotated data from block 114 and combines it with a PN signal after a delay is imposed by delay block 116b in element 104. The combination is entered into counters 118c and 120c, which gets shifted out of the counters upon a signal from the reset signal 112 with an imposed delay from a delay block 124b.

After a number of clocks corresponding to the spreading factor, the PN despread element 102 has valid data which is selected for output by a multiplexer 108. Every clock thereafter, the adjacent despread element 104 or 106 is available until all data has been output which can occur during the number of clocks corresponding to the spreading factor plus a number of PN despread instantiations. The PN code that governs the operation of this mechanism can be a gold code parameterized by a value. In alternative embodiments, other PN codes may be used.

FIG. 5 illustrates operations performed in the tag modem processing of a broadcast channel to demodulate the access point's transmit waveform. Additional, fewer, or different operations may be performed depending on the particular embodiment. The operations may also be performed in a different sequence than that shown and described.

Upon the initial power-up of the tag, no parameters are known regarding the waveform except for the broadcast channel PN sequence (e.g., the particular gold code or other code parameter). Additionally, the tag may not know with sufficient precision what the relative frequency offset is between the AP and the tag due to oscillator variance between the AP and the tag. FIG. 5 depicts a scanning mode where the range of uncertainty of parts-per-million (ppm) drift between the AP and the tag are explored. In an operation 150, an iteration is made over two slots to enable the tag to tune to a broadcast channel. For example, processing can begin asynchronous to slot timing. During exploration of one half of the hypotheses, the broadcast channel can be active, and during exploration of the other half of the hypothesis the broadcast channel can be inactive. In a first iteration, all hypotheses can be explored using a first slot timing with an asynchronous starting point. If no energy is found in the first iteration, a second iteration is performed. In the second iteration, the asynchronous starting point can have a one slot offset from the asynchronous starting point used in the first iteration. As such, hypotheses that were explored while the broadcast channel was inactive can be explored while the broadcast channel is active. Once the energy is found, the tag can tune to the broadcast channel. In an exemplary embodiment, operation 150 can represent a starting point for ‘cold acquisition.’ In an operation 152, a coarse automatic frequency control (AFC) is initialized. In one embodiment, this initial value is set to a most negative value such as −10 ppm offset. Using a known gold code generated PN sequence for the broadcast channel, in an operation 154, non-coherent metrics for all C×4 spaced hypotheses for a given coarse AFC hypothesis are calculated. For example, if the spreading factor has a length of 2048, the non-coherent metric for 8192 hypotheses can be calculated.

In operations 156 and 158, the coarse AFC hypothesis is incremented until the end of the ppm range. For each coarse AFC hypothesis, the hardware depicted in FIG. 7 is used to undo the frequency offset represented by the current hypothesis. The PN despread array is used to generate the despread output of 8 successive symbols. Alternatively, other numbers of symbols may be used. A non-coherent sum of these 8 symbols is then calculated. A set of N (8 in the one embodiment) top metrics along with their associated parameters are maintained in a data structure. As the flowchart of FIG. 5 indicates, the entire range of oscillator ppm uncertainty along all the timing hypotheses at chip×4 resolution are explored with the expectation that the winning (i.e., valid) one will be represented in the data structure. Along with the most valid hypothesis there generally tends to be lesser multi-path reflections, adjacent AFC coarse frequency hypotheses where appreciable energy accumulation is still present, as well as entirely invalid hypotheses that have generated anomalously large metrics due to noise variance.

The non-coherent metrics for all chip×4 timing hypotheses for each coarse AFC can be communicated to a data structure. In an operation 160, the data structure keeps track of the greatest non-coherent metrics (e.g., coarse AFC value, chip×4 timing hypothesis, non-coherent metric value). The “finalists” are assigned to the N dedicated fingers in an operation 162. Each finger may be uniquely parameterized by a chip×4 timing value and a coarse AFC hypothesis which is independent of the current coarse AFC hypothesis governing the PN despread array. Since frame timing is initially unknown, each despread symbol that is output by the dedicated finger is hypothesized to be the last in the frame. Thus, the buffered 256 symbols undergo differential demodulation and an additional set of iterations based on multiplying by a constant complex value to perform fine AFC correction, as shown in operations 164 and 166. An output of operation 164 can be a complex cross product from each dedicated finger. In operation 166, a symbol-by-symbol multiplication by a constant complex rotation (as determined by the fine AFC hypothesis) can be iteratively applied to a postulated frame of information to determine which (if any) of the selection of complex rotation constant values uncovers a frame which passes a cyclic redundancy check (CRC). This can be a brute-force operation where a cyclic redundancy check (CRC) may be performed for each hypothesis. For any valid CRC, a payload from the signal can be sent to MAC, and network parameters can be considered to be known.

In an operation 168, other slot timing hypothesis are tried. In an exemplary embodiment, the coarse AFC hypotheses associated with the most successful CRCs can be nominal starting coarse AFC hypotheses. Once the entire range of coarse AFC hypothesis are explored, the tag notes a variable called Nominal_Coarse_AFC which is the relevant state information used in future transactions which greatly narrows the range of coarse AFC hypothesis searches because the part-to-part variation of oscillator ppm deviation is much larger than the oscillator drift over the coarse of a minute or so.

FIG. 6 illustrates operations performed in the tag processing of a dedicated channel from a warm start which is to say where relevant state information is known. For example, frame timing can be known and a much tighter range of coarse AFC hypothesis may be explored. The modem begins its processing sufficiently early so that valid finger assignments are made prior to the end of the 9 symbol preamble. Alternatively, any other number of symbols may be used.

In an operation 200, there is no need to iterate over a two slot timing hypothesis because the frame timing is known. Instead of using a broadcast channel, a dedicated channel is used. In an operation 202, a coarse AFC hypothesis is scanned. In an exemplary embodiment, the coarse AFC can be scanned over a small range to account for small frequency drift since the last time accessed. Using a known gold code generated PN sequence unique to the tag, in an operation 204, a non-coherent metric for all chip×4 spaced hypotheses is calculated. In operations 206 and 208, the coarse AFC hypothesis is incremented until the end of the small ppm range. In an operation 210, a data structure keeps track of the greatest non-coherent metrics (e.g., coarse AFC value, chip×4 timing hypothesis, non-coherent metric value, etc.) In an operation 212, dedicated fingers are assigned based on the data structure. In an operation 214, symbol cross products are created using current DBPSK and previous DBPSK. An output of operation 214 can be a complex cross product from each dedicated finger. In an operation 216, frames are interleaved and decoded. For any valid CRC, the payload can be sent to a medium access control (MAC) layer. In an operation 218, other slot timing hypothesis are tried. In an exemplary embodiment, coarse AFC hypotheses associated with the most successful CRCs can be nominal starting coarse AFC hypotheses.

FIG. 7 illustrates a tag receive data path depicting the tag's demodulation processing in accordance with an exemplary embodiment. As shown, the one-bit complex samples are buffered in a sample buffer 220 such that enough data is present to make reliable detection of valid energy. Exemplary values are provided in the sample buffer block 220. For example, one embodiment buffers 9 symbols. In alternative embodiments, other values may be used. The samples may be input from the I channel and Q channel into this ping-pong buffer scheme at the synchronous sample rate of chip×2 or 2 MHz. Alternatively, other rates may be used. At the fast asynchronous clock, these samples are used to explore the various coarse AFC hypothesis. Based on the current coarse AFC hypothesis, time-tracking is performed at chip×4 resolution. Since the same timing reference is used to drive both the carrier frequency and the sample clocks on both the AP and the tag, a coarse AFC hypothesis with a known carrier frequency can uniquely map to a known rate of time tracking.

The sample buffer 220 receives communication signals over the I channel and the Q channel. These signals are sent to time tracking logic 222 and dedicated fingers 234. The time tracking logic 222 also receives a coarse AFC hypothesis and the logic 222 may reset to zero at chip×4 parity. The time tracking logic 222 can have two blocks, one with counters initialized to zero for even chip×4 parity, and one with counters initialized to midrange (i.e., 2^25) for odd chip×4 parity. The output of time tracking logic 222 is provided to a block 224 in which virtual chip×4 phases are applied. Block 224 also can receive parity from an acquisition state machine. Automatic frequency control (AFC) rotation logic 226 is applied to an output of block 224.

FIG. 8 illustrates an exemplary embodiment of the two blocks of time tracking logic 222 described with reference to FIG. 7. Stream 250 is a communication stream with an even chip×4 parity. Stream 252 is a communication stream with an odd chip×4 parity. FIG. 8 depicts the time-tracking operation where each different shading represents a different chip×4 spaced sequence. Samples are either inserted or repeated at a rate directly depending on which current AFC hypothesis is being explored, multiplied by a known ratio between the sample rate and the carrier frequency. This can be used as a locked clock assumption to collapse a 2-dimensional space down to a single dimension. The value N depicted has a fractional component which is book-kept to allow for sufficient time-tracking precision. A particular parity of the 4 possible chip×4 phases is selected at a given time. The resultant chip rate sequence is then derotated in a 1-bit data path as shown in FIG. 9.

FIG. 9 depicts the functionality of the AFC (automatic frequency control) rotation logic 226 of FIG. 7 which operates on one of the 4 virtual chip×4 phases 224 at a given time. FIG. 9 depicts a one-bit derotation mechanism. This derotation mechanism is designed to undo the AFC rotation due to the relative carrier drift between the receiver and transmitter for the postulated coarse AFC hypothesis. Since it's a one-bit transform (represented by the truth table illustrated above), the 90 degree resolution of the process is +/−45 degrees relative to the continuum of values of the phase due to the AFC drift from the relative oscillator offset.

The AFC rotation logic 226 can also receive coarse AFC hypotheses as an input. The PN despreading array 228 (FIG. 7) performs its despread operation for chip spaced hypothesis. The PN despreading array 228 may receive current coarse AFC hypotheses, timing parity, timing phase, spreading factor, and/or gold code selection as inputs. As the values are output for a given symbol, the sum is non-coherently accumulated for better metric reliability with the running sum stored in the non-coherent accumulation buffer 230. The size of the buffer is based on the number of despread elements. In an exemplary embodiment, the PN dispreading array 228 may have 256 despread elements such that a pass through the sample buffer completes the non-coherent metric for 256 hypotheses. Alternatively, other numbers of despread elements may be used, and the metric may be completed for other numbers of hypotheses. A signal-to-noise ratio (SNR) metric may be used in transmission power control of the tag and for power control feedback to the AP. The hypotheses with the largest metrics are stored in a top N path data structure 232 which is used to control the assignment of the dedicated fingers 234. The top N paths can be N records including timing hypotheses, timing parity, coarse AFC hypotheses, etc.

FIG. 10 illustrates a dedicated communication finger. Each dedicated finger has access to each of the 4 phases of chip×4 samples with a chip×4 selector 260 set as part of the parameters of the finger assignment. Each finger has its own dedicated PN generator 262 and AFC generator 264 which is used to despread. The dedicated finger accumulates into the symbol accumulator 266 based on the coarse AFC hypothesis, its chip×4 timing phase, the dependent variable of time-tracking rate, and then outputs a complex variable every spreading factor number of clocks. The dedicated fingers 234 illustrated with reference to FIG. 7 can also receive inputs from the sample buffer 220, and a PN code selection.

Referring again to FIG. 7, the output from the dedicated fingers 234 goes through a bit-width squeezer 236 that reduces the bit-widths for efficient storage in the frame buffer 238 without sacrificing performance. The output from the bit-width squeezer 236 is provided to the frame buffer 238, which may be a circular buffer mechanism which allows for the general case of processing a 256 symbol frame as if the current symbol is the last symbol of the frame. When frame timing is known, this memory structure can support the specific processing of a frame with the known last symbol.

Frame buffer 238 outputs the hypothesized frames to the rest of the receive chain. A cross product multiplication block 240 performs the multiplication of the current symbol with the complex conjugate of the previous symbol which is the conventional metric for D-BPSK demodulation. A residual frequency drift may cause the D-BPSK constellation to be rotated by a fixed phase. The role of the fine AFC multiply block 242 is to take a brute-force approach and try different possible phase rotations such that at least one fine AFC hypothesis yields a valid CRC as it passes through a de-interleaver and viterbi decoder 244. The fine AFC multiply block 242 can also receive fine AFC hypotheses as inputs. The output from the de-interleaver and Viterbi decoder 244 is provided to a CRC checker 246. If the CRC is valid, the payload is sent up to the MAC layer.

FIG. 11 depicts exemplary operations performed during access point receive processing. Additional, fewer, or different operations may be performed depending on the embodiment. Further, the operations can be performed in a different order than that which is described here. The AP performs a brute-force operation checking all possible chip×2 timing hypothesis, spreading factors, and access slots within spreading factors. This allows for uncoordinated access by the tag. Fortunately, since the AP is the master of frame-timing and AFC carrier reference (all tags can compensate both their carrier drift and sample clock to meet the AP's timing), the processing burden on the AP is drastically reduced since the AP need not explore the dimensionality of coarse AFC hypothesis or unknown frame timing.

The flowchart of FIG. 11 shows an example of the ordering of iterating upon all possible chip×2 timing offset, spreading factors from the set [8192,4096, . . . , 64], and access slot numbers for spreading factors less than the maximum. The AP then performs the similar fine AFC search that the tag performs to allow for a small amount of frequency drift between the timing sources of the tag and the AP to occur since the last transaction. All valid CRCs are passed up to the MAC layer. The flowchart of FIG. 11 illustrates the searching of a multi-dimensional space. In an outermost loop, all possible spreading factors are searched. In an exemplary embodiment, there may be 8 spreading factors [64, 128, 256, 512, 1024, 2048, 4096, 8192]. Alternatively, other spreading factors and/or numbers of spreading factors may be used. In a second loop, all possible sub-slots for a given spreading factor are searched. For example, there may be 128 possible sub-slots for a 64 chip spreading factor and a single degenerate sub-slot for a 8192 chip spreading factor. In a third loop, all possible chip×2 timing phases within a given sub-slot are searched. As described in more detail below, the various loops are illustrated by the arrows in FIG. 11.

In an operation 270, one coarse AFC value is used. In an exemplary embodiment, the one coarse AFC value can be 0 since compensation is performed by the tags. In an operation 272, a largest spreading factor (e.g., 8192) is used as a starting point. In alternative embodiments, the largest spreading factor may be larger or smaller than 8192. In an operation 274, access slots are processed within a spreading factor. This process may be degenerate in the case in which there are 8192 spreading factors. In an operation 276, despreading is performed for all chip×2 spaced hypotheses at the current spreading factor. For example, 16,384 despread operations may be performed if the spreading factor has a length of 8192. Despread is performed for all elements unless the spreading factor is less than the frame buffer number (e.g., 256). In an operation 278, the spreading factor is reduced in half and processing continues. In an operation 280, a determination is made regarding whether the spread factor has been reduced to 64. In alternative embodiments, other predetermined values may be used. If the spread factor has not been reduced to 64 (or other predetermined value), processing continues at operation 276. If the spread factor has been reduced to 64, the system waits for a next sample buffer to fill in operation 282. Once the next sample buffer is filled in operation 282, control returns to operation 272. In an operation 284, a frame buffer of despread elements is obtained. In an exemplary embodiment, the frame buffer may be complete after 256 symbols are output from a single pass by the PN despread array. In one embodiment, for a 256 stage PN despread array, a pass through may produce 256 timing hypotheses each having 256 symbols. In alternative embodiments, the PN despread array may have more or fewer stages. A cross product of the current despread DBPSK symbol with the previous symbol is calculated in an operation 286. In one embodiment, the cross product may involve 256 symbols for up to 256 frames. Alternatively, other numbers of symbols and/or frames may be used. In an operation 288, the current frame is decoded and phase multiplied based on the AFC hypothesis. In an operation 290, CRCs are checked and for any valid CRC, the payload is sent out of the physical layer (PHY) and up to the medium access control (MAC). As an example, the CRCs may be checked for 256 times the number of fine AFC hypothesis for each pass of a 256 despread array. Upon completion of the process for a given slot, the process is performed for a subsequent slot as illustrated by the arrow from block 282 to block 272.

FIG. 12 depicts an access point (AP) receive data path. Unlike the tag, an entire frame at the largest spreading factor may be stored in a ping-pong buffer scheme in a sample buffer 300. This buffer scheme can be a substantial amount of memory (e.g., 16.8 Mbits) and in at least one embodiment, it may be stored in a dedicated off-chip memory device. The sample buffer block 300 includes exemplary values. In alternative embodiments, other values may be used. Unlike the tag, the time tracking logic and the AFC rotation logic may not be used since the AP is the master time reference. The sample buffer 300 passes frames to a PN despreading array 302, which can perform brute force testing as described previously herein. The PN despreading array 302 may include 256 despread elements. Alternatively, any other number of despread elements may be used. The PN despreading array 302 may also receive current timing parity (which may be chip×2 resolution only), hypothesis phase, and/or spreading factor as inputs. An output from the PN despreading array 302 is provided to a bit width squeezer 304. The bit width squeezer 304 reduces the size of the frames, which are then sent to a frame buffer 306. The frame buffer block 306 includes exemplary values. In alternative embodiments, other values may be used. Depending on the embodiment, the frame buffer 306 may also be stored in a dedicated off-chip memory device. The rest of the system is similar to the tag's receive processing where fine AFC hypothesis are iterated upon (operations 310 and 312) with all payloads with valid CRCs being passed up to the AP's MAC (operations 314 and 316). A non-coherent accumulation 308 is used to determine an SNR metric such as signal strength for use in transmission power-control feedback to the tag.

FIG. 13 illustrates asynchronous initial tag transmit operations, including two types of interactions which result in data transfers from the tag to the AP. For purposes of illustration and discussion, slots 320 represent tag slots and slots 322 represent access point slots. “Cold Start” is where the tag is coming into the system without any relevant state information and “warm start” is where the tag is aware of the system information such as slot timing and a reduced range of coarse AFC hypothesis to explore.

In the “Cold Start” scenario, the tag begins seeking access at a slot-asynchronous point in time. FIG. 13 depicts a time where the tag begins attempting to acquire the broadcast channel when the AP isn't even transmitting it (slot 1). Eventually, the tag's processing explores the valid coarse AFC hypothesis during a period of time that the AP is transmitting the broadcast frame. FIG. 13 depicts this occurring during slot 2. At this point, the non-coherent energy metric causes a dedicated finger to explore the correct chip×4 timing and coarse AFC hypothesis. The finger with the correct hypothesis continually treats each new symbol as the last symbol of the frame and pushes these hypothesized frames through the receive chain where the CRC check indicates failure. At the end of slot 4, the valid frame timing is achieved as the CRC check indicates success. At this point, the tag has the same relevant state information that a tag entering at a “warm-start” would have and continues to complete the same processing that a “warm-start” tag would undergo.

A tag enters the interaction depicted in slot 6 (“Warm Start”) either by a transition through a “Cold Start” procedure or directly upon tag wake-up if relevant state information is appropriately maintained. At this point, the tag makes a measurement of the received strength of the broadcast frame and uses this information to determine the transmit power and spreading factor that the tag subsequently transmits at in slot 7. The tag transmits it's message based on: 1) using the measured received broadcast channel signal strength and selecting the minimum spreading factor that can be used to close the link, which minimizes the tag's on time and is best for minimizing power consumption; 2) using the measured received broadcast channel signal strength and the formerly selected spreading factor, the tag transmits at the optimality condition of reception at the AP which is that all user's are received by the AP at very similar values of energy per bit to spectral noise density ratio (Eb/No); 3) for all but the maximum spreading factor, randomly selecting the slot access parameter j; and 4) randomly selecting the chip offset value from 0 to spreading factor −1 such that “collisions” at the AP are minimized and random selection at each transmission allows “collisions” to be resolved in subsequent transmission opportunities.

During slots 8 and 9, the AP processes all the signals received during slot 7 and sends a positive acknowledgement back during slot 10. The AP either aggregates several ACKs into a single channel characterized by a gold code, or sends a dedicated message to the tag using its dedicated gold code channel. Note that the former method requires some registration procedure (not shown) to assign the channel. In either case, the tag updates its chip×4 timing using the preamble of the message.

FIG. 14 illustrates a simple interaction between an access point and a tag in a slotted mode. In an exemplary embodiment, the simple interaction involves no data for the tag and a relatively static channel. For purposes of illustration and discussion, timeline 330 represents tag processing during the slots and timeline 332 represents access point processing during slots. The nature of the system is that the tag spends a maximum possible time in a low-power state—a state where system timing is maintained via a low-power, low-frequency crystal oscillator which is typically 32 kHz. To support this, a maximum tolerable latency upon AP initiated interaction is identified (i.e., this is the rate cycling in and out of the low power state for the tag to check if any AP action is pending). FIG. 14 shows the relatively simple interaction of a tag coming out of it's low power state to check if the AP is wanting to initiate a transaction. This occurs at a slot phase and rate agreed upon between the AP and the tag during registration.

The tag would typically enter a “warm start” where the frame timing and coarse AFC hypothesis are known to within a tight range. The tag makes a measurement of the received broadcast channel power. FIG. 14 shows the scenario where that power has not changed considerably since the last interaction with the AP. This means that the last transmit power/spreading factor that the AP transmitted at is sufficient to close the link. In slot 3, the tag attempts to acquire on the preamble and then demodulate the frame using its dedicated gold code. A typical scenario is the AP not having sent information and the tag immediately goes back to sleep.

FIG. 15 depicts a more complicated interaction which involves data transfer and dynamically changing propagation between an access point and a tag according to an exemplary embodiment. For purposes of illustration and discussion, timeline 340 represents tag processing during the slots and timeline 342 represents access point (AP) processing during the slots. Here, the AP has information to send and the propagation of the channel has changed considerably since the last AP transaction. The current broadcast channel power measurement has changed such that the tag knows that the subsequent transmission would not be appropriate if it transmits at the same transmit power/spreading factor as last time. Thus, the tag will send a re-registration message using the protocol explained in FIG. 13 to alert the AP to use a new transmit power/spreading factor appropriate to the current channel conditions. The new information governs the transmission and reception of the frame occurring in slot N+5. The tag generates an acknowledgement (ACK) message governed by the protocol of FIG. 13 to indicate a successful transmission. If the ACK is successfully received, the transaction is considered complete. Otherwise, the tag attempts a retransmission.

In one embodiment, the air interface utilized by the systems described herein can be a half duplex time division multiplexed frame format. The access point can transmit for a portion of the time in the downlink direction to the tag, and the tag can transmit for a portion of the time in the uplink direction to the access point. The time allocation between the uplink slot and the downlink slot may be equal (i.e., 50% of the time is allocated to the uplink slot and 50% of the time is allocated to the downlink slot). The frame structure can be centered about a slot structure whose format numerics can be based on a maximum supported uplink spreading factor. In an exemplary embodiment, the maximum spreading factor at the uplink can be that which allows the tag to successfully transmit to the access point when the tag is under the most challenging transmit conditions based on weather, location, etc.

In general, use of a large spreading factor can allow a given transmitter such as a tag to transmit with less power while still being able to be received by a given receiver such as an access point. However, use of a large spreading factor can also increase the time that it takes to transmit a signal. In an exemplary embodiment, the tag may broadcast at a lower power than that used by the access point. As such, the spreading factor of the uplink signal can be selected as large enough such that the signal transmitted by the tag can be received by the access point even when the tag is physically located in a challenging location and/or under challenging transmission conditions. The access point may transmit with more power than the tag. As a result, if the uplink (i.e., tag to access point) transmissions and downlink (i.e., access point to tag) transmissions are given equal amounts of time on the band in which to transmit, the access point can use a smaller spreading factor than the tag. Since the access point signals are not as widely spread, the access point can transmit in a plurality of fundamental downlink slots in the same amount of time as the tag transmits in a single slot. In one embodiment, the access point can transmit at a constant power at or near the maximum RF transmit power available. If the link between the access point and a given tag is robust, a reduced spreading factor can be used for that tag. Robustness of the link can be determined based on a comparison of the link to a predetermined quality threshold. Because the lower spreading factor takes less total time to transmit, the tag can open its receive widow for a relatively short period of time, thereby minimizing power consumption of the tag.

FIG. 16 is a diagram illustrating contents of a complete slot 400 in accordance with a first exemplary embodiment. In the embodiment of FIG. 16, the access point can transmit with more power and use a smaller spreading factor as compared to the tag. For example, the access point may use a spreading factor of 2048 and the tag may use a spreading factor of 8192. Alternatively, other values may be used. Complete slot 400 includes a downlink slot 402, a downlink to uplink gap 404, an uplink slot 406, and an uplink to downlink gap 408. In an exemplary embodiment, downlink to uplink gap 404 may be 15 symbols at the maximum uplink spreading factor (which may be 8192 in one embodiment). Alternatively, any other length downlink to uplink gap may be used. Downlink to uplink gap 404 can be used to ensure a downlink to uplink ratio of 50%. Downlink to uplink gap 404 can also be used to provide tag receiver to transmitter turnaround processing time. In another exemplary embodiment, uplink to downlink gap 408 may be 1 symbol at the maximum uplink spreading factor. Alternatively, any other length uplink to downlink gap may be used. Uplink to downlink gap 408 can be used to support random phase multiple access (RPMA) for a given spreading factor. As such, a smaller uplink to downlink gap can be used with smaller spreading factors.

Because the access point may use a smaller spreading factor than the tag, the downlink slot can include a plurality of fundamental downlink slots. Downlink slot 402 includes a fundamental downlink slot 410, a fundamental downlink slot 412, a fundamental downlink slot 414, and a fundamental downlink slot 416. Each of the fundamental downlink slots includes a broadcast preamble 418, a data slot or subslot(s) 420, and a broadcast slot 422. In an exemplary embodiment, broadcast preamble 418 can be 16 symbols. Alternatively, any other length may be used.

FIG. 17 is a diagram illustrating contents of a complete slot 430 in accordance with a second exemplary embodiment. In the embodiment of FIG. 17, the access point can transmit with the same power as used by the tag. As such, the same spreading factor may also be used by the access point and the tag. For example, the access point and the tag may both use a maximum spreading factor of 8192. Alternatively, other values may be used. Complete slot 430 includes a downlink slot 432, a downlink to uplink gap 434, an uplink slot 436, and an uplink to downlink gap 438. In an exemplary embodiment, downlink to uplink gap 434 may be 15 symbols×8192 chips. Alternatively, any other length downlink to uplink gap may be used. In another exemplary embodiment, uplink to downlink gap 438 may be 1 symbol×8192 chips. Alternatively, any other length uplink to downlink gap may be used. Because the access point uses the same spreading factor as the tag, downlink slot 432 includes a single fundamental downlink slot 440. Fundamental downlink slot 440 includes a broadcast preamble 442, a data slot or subslot(s) 444, and a broadcast slot 446.

FIG. 18 illustrates a fundamental downlink slot 450 in accordance with an exemplary embodiment. Fundamental downlink slot 450 includes a broadcast preamble 452, a broadcast channel slot 454, and a data channel slot 456. Broadcast preamble 452 can be 16 symbols long, or any other length depending on the embodiment. In an exemplary embodiment, broadcast channel slot 454 can include a single broadcast channel frame. In one embodiment, the broadcast channel frame can be identical in creation to a data channel frame with the exception that the broadcast channel gold code generator may reset every symbol whereas the data channel gold code generator may run until the end of the data channel frame before resetting.

In an exemplary embodiment, broadcast preamble 452 can be boosted relative to other transmissions made using broadcast channel slot 454 or data slot 456. As an example, broadcast preamble 452 can be transmitted at a maximum power (P_max), and other transmissions can be made at one half of the maximum power (½P_max). In one embodiment, broadcast preamble 452 can be boosted by 3 decibels (dB) relative to other transmissions via broadcast channel slot 454 and/or data slot 456. Alternatively, broadcast preamble 452 may be boosted by any other amount. The boosted preamble allows receivers at the tags to robustly estimate chip timing and AFC/time tracking with reference to the access point. The payload of broadcast preamble 452 can be programmable. In one embodiment, no channel coding, interleaving, or cyclic redundancy check (CRC) may be applied to the payload of broadcast preamble 452.

FIG. 19 is a diagram illustrating preamble frame processing in accordance with an exemplary embodiment. A 16-bit register 460 can provide symbols to a modulator 462 for modulation. Alternatively, any other length register may be used. Modulator 462 can output modulated symbols at a symbol rate. Modulator 462 can be a differential binary phase shift keying (DBPSK) modulator, or any other type of modulator known to those of skill in the art. As a result, each symbol of broadcast preamble 452 can be modulated, spread with the maximum downlink spreading factor, and boosted for transmission. In an exemplary embodiment, broadcast preamble 452 may be boosted by ensuring that no other data is transmitted during transmission of broadcast preamble 452. For example, broadcast preamble 452 may be broadcast at P_maxthrough broadcast channel slot 454 and data channel slot 456 may be turned off while broadcast preamble 452 is being broadcast. In one embodiment, broadcast preamble 452 can be transmitted on one of an I channel or a Q channel. Broadcast preamble 452 can be multiplied by a scale factor of 1 such that broadcast preamble 452 is transmitted at full power. When broadcast preamble 452 is not being broadcast, an attenuating scale factor can be used such that data is transmitted at less than full power. In one embodiment, the attenuating scale factor can be 1√2, resulting in a 3 dB attenuation. In an alternative embodiment, the scale factor may not altered. In such an embodiment, broadcast preamble 452 can be transmitted on both the I channel and the Q channel such that broadcast preamble 452 is transmitted at full power.

Referring again to FIG. 18, data channel slot 456 may contain a single data channel frame. Alternatively, data channel slot 456 may contain a plurality of data channel frames in a single fundamental downlink slot such as fundamental downlink slot 450. As a result, data channel slot 456 of fundamental downlink slot 450 can include a plurality of sub-slots corresponding to the plurality of data channel frames (i.e., one sub-slot for each frame). In an exemplary embodiment, the spreading factor of data channel slot 456 can be the same as the spreading factor of broadcast channel slot 454. In another exemplary embodiment, the spreading factor of data channel sub-slots can be less than the spreading factor of broadcast channel slot 454.

In one embodiment, multiple data channel sub-slots can be created by using smaller spreading factors than those used with either a full size (i.e., single) data channel slot or with the broadcast channel slot. FIG. 20 is a diagram illustrating a data sub-slot hierarchy in accordance with an exemplary embodiment. As illustrated in FIG. 20, if a spreading factor of 8192 and a 39 dB gain are used, the data channel includes a single data channel slot A_0,0. If a spreading factor of 4096 and a 36 dB gain are used, the data channel slot includes two sub-slots A_1,0and A_1,1. Similarly, if a spreading factor of 16 and a 12 dB gain are used, the data channel slot includes 512 sub-slots A_9,0. . . A_9,511, and so on.

FIG. 21A illustrates a fundamental downlink slot 470 with a plurality of sub-slots in accordance with an exemplary embodiment. As illustrated in FIG. 21A, sub-slots of different sizes can be combined to form the data channel slot. The plurality of sub-slots includes a sub-slot A_4,0, a sub-slot A_4,1, a sub-slot A_5,4, and a sub-slot A_6,10. In alternative embodiments, other combinations of sub-slots may be used. A broadcast channel slot 472 of fundamental downlink slot 470 can have a spreading factor of 2048. Alternatively, other values may be used. A tag or other receiving device can turn on its receiver to listen to one or more of these sub-slots as appropriate. FIG. 21B illustrates a fundamental downlink slot 480 with a single slot A_0,0in accordance with an exemplary embodiment. A broadcast channel slot 482 of fundamental downlink slot 480 can have a spreading factor of 8192. Alternatively, other values may be used.

FIG. 22 is a flow diagram illustrating operations performed to construct a frame in accordance with an exemplary embodiment. In alternative embodiments, additional, fewer, or different operations may be performed. Further, the use of flow diagrams herein is not meant to be limiting with respect to the order of operations performed. The frame can be for use in a data channel slot and/or a broadcast channel slot. In an operation 500, a frame base is generated. In an exemplary embodiment, the frame base can be an 88-bit payload. Alternatively, other numbers of bits may be used. In an operation 502, a cyclic redundancy check (CRC) is appended to the frame base. In an exemplary embodiment, the CRC can be 32 bits, resulting in a frame of 120 bits. Alternatively, other values may be used. In an operation 504, tail bits are added to the frame. In an exemplary embodiment, 8 tail bits can be added, resulting in a raw frame of 128 bits. Alternatively, a different number of tail bits may be used. In one embodiment, each of the tail bits can have a value of zero. Alternatively, any or all of the tail bits may have a non-zero value. In an operation 506, the raw frame is convolution encoded. The convolution encoding can be performed at a rate of ½, or any other value depending on the embodiment. In one embodiment, an output of the convolution encoder used to perform the convolution encoding can be 256 bits.

In an operation 508, the bits of the frame are symbol interleaved. In one embodiment, the bits can be interleaved with a strict bit reversed interleaver which utilizes bit reversed addressing. As an example, in a frame buffer containing 256 symbols, the interleaver input addressing can be linear, from 0 thru 255. Each address can be 8 bits. The interleaver can take data at a particular address, and put it in a new position in an output frame buffer. The output address can be a bit reversed ordering of the input address. For example, the symbol at address 15 (00001111b) can be placed in address 240 (1111000b). In an illustrative embodiment, each interleaver input address can be bit reversed to form an output address. In an operation 510, the bits of the frame are modulated. The modulation can be DBPSK modulation. Alternatively, any other type of modulation may be used. The bits can also be spread with a spreading factor based at least in part on the slot size.

In one embodiment, a complex data stream can be created to minimize bandwidth usage. The data channel can exist on a real component of the complex data stream and the broadcast channel can exist on an imaginary component of the complex data stream, or vice versa. FIG. 23 is a diagram illustrating a downlink transmission model in accordance with an exemplary embodiment. A data frame can be constructed by a data frame processor 520, a broadcast frame can be constructed by a broadcast frame processor 522, and a broadcast preamble frame can be constructed by a broadcast preamble frame processor 524. The data frame, broadcast frame, and/or broadcast preamble frame can be constructed in accordance with the operations described with reference to FIG. 22. Alternatively, different operations may be performed to construct the frames.

The data frame is provided to a PN spreader 526 for spreading. PN spreader 526 can receive a frame boundary input to reset PN spreader 526, a user key input to initialize a state of PN spreader 526, and an enable data input to enable PN spreader 526. For example, the frame boundary input can be an indication that a frame is beginning or ending such that the PN/gold code used by PN spreader 526 is reset for each data frame. The user key input can be tied to a tag identification of a tag which is located in a network of the access point. The user key input (or tag identification) can directly affect the PN/gold code generated, and can allow the tag to decode messages that are targeted for the tag in the downlink. In one embodiment, each frame generated by the access point can be based on a particular user key (or tag identification). The enable data input can window the data channel frame. The enable data input can stay high for the duration of the frame, and may span multiple frames during a downlink slot. In one embodiment, PN spreader 526 can run as long as the enable data input is high. An output of PN spreader 526 can be used as the real component of the complex data stream. Alternatively, the output of PN spreader 526 may be used as the imaginary component of the complex data stream.

The broadcast frame and the broadcast preamble frame are provided to a selector 528 for provision of one of the broadcast frame or the broadcast preamble frame to a PN spreader 530. Selector 528 can receive a preamble enable input to control whether PN spreader 530 receives data from broadcast frame processor 522 or preamble frame processor 524. Pseudo-noise spreader 530 can receive a symbol boundary input to reset PN spreader 530, a broadcast key input to initialize a state of PN spreader 530, and an enable broadcast input to enable PN spreader 530. For example, the symbol boundary input can be an indication that a symbol is beginning or ending such that the gold/PN code used by PN spreader 530 is reset for each symbol. Resetting the gold/PN code after each symbol can make it easier for the tag to acquire the signal broadcast from the access point. Also, by resetting the gold/PN code on every symbol of the broadcast frame, the code space that the tag has to search is reduced. The broadcast key input can be common for a given network, and can directly affect the gold/PN code sequence that is generated. As an example, different access point networks may have different broadcast channel keys which are used as network identifications. The enable broadcast input can stay high for the duration of the symbol, and PN spreader 530 can run as long as the enable broadcast input remains high. An output of PN spreader 530 can be used as the imaginary component of the complex data stream. Alternatively, the output of PN spreader 530 may be used as the real component of the complex data stream.

An output of PN spreader 526 and an output of PN spreader 530 can be provided to an up-sampler 532. In one embodiment, up-sampler 532 can up-sample the received signals to 26 MHz. Alternatively, 40 MHz or any other amount of up-sampling may be performed. Up-sampler 532 has a preamble enable input and a data enable input. The preamble enable input can be activated when selector 528 provides the broadcast preamble frame to PN spreader 530 and the data enable input can be activated when selector 528 provides the broadcast frame to PN spreader 530. In an exemplary embodiment, activation of the preamble enable input can cause the broadcast preamble to be boosted on the broadcast channel (which can be the imaginary component of the complex data stream). In one embodiment, polyphase filter taps can incorporate a 1/√(2) gain on the broadcast preamble (or a 1/√(2) attenuation on transmissions other than the broadcast preamble). Activation of the preamble enable input can also turn off the data channel such that the real component of the complex data stream does not broadcast simultaneously with the broadcast preamble. Activation of the data enable input can cause the broadcast frame to be transmitted on the imaginary component of the complex data stream simultaneously with the data frame on the real component of the complex data stream. As such, when the data enable input is activated, up-sampler 532 can receive the data frame and the broadcast frame. Alternatively, the broadcast preamble may be transmitted on the real component of the complex data stream. In another alternative embodiment, the broadcast preamble may be boosted by simultaneously transmitting the broadcast preamble on both components of the complex data stream.

If the broadcast preamble is being transmitted, up-sampler 532 can provide the up-sampled broadcast preamble to a converter 534. Converter 534 can convert the broadcast preamble from digital to analog for transmission on one or both components of the complex data stream. If the broadcast frame and data frame are being transmitted, up-sampler 532 can provide the up-sampled data frame to converter 534 on the real component (i.e., I channel) of the complex data stream and the up-sampled broadcast frame to converter 534 on the imaginary component (i.e., Q channel) of the complex data stream, or vice versa. Converter 534 can convert the data frame and the broadcast frame from digital to analog for transmission. Converter 534 can also provide the data frame and the broadcast frame to an RF up-converter 536 for combination into the single complex data stream for bandwidth savings during transmission. Radio frequency up-converter 536 can be part of the RF chip. In one embodiment, the I data stream (real component) and the Q data stream (imaginary component) can be independently differentially binary phase shift keyed. As a result, bandwidth can be conserved as the broadcast channel does not have to occupy a side channel.

In one embodiment, to preserve downlink bandwidth, the broadcast channel may be partially or fully utilized as an acknowledgment (ACK) channel. In such an embodiment, each bit of the broadcast frame payload (i.e., up to 88 in one embodiment) can represent an ACK bit or a non-acknowledgement (NACK) bit. After network registration, the tag can have knowledge of which bit of the broadcast frame payload corresponds to an ACK channel for the tag. As a result, the broadcast channel can be used as a multi-tag ACK channel, and the access point can transmit multiple acknowledgements in a single fundamental downlink slot.

In an alternative embodiment, the access point may send out acknowledgements serially to a plurality of tags, and the tags may not know in which sub-slot its ACK is located. In such an embodiment, the ACKs may be transmitted on the data channel. As the tag may not know the sub-slot of its ACK, the tag can utilize non-deterministic frame processing to identify the ACK. In one embodiment, the tag can keep its reception window open for a plurality of sub-slots until the ACK is received. As an example, the access point may decode transmissions from a first tag and a second tag in the same sub-slot with the same spreading factor. If the downlink is TDMA, the access point can serially send out a first ACK to the first tag and a second ACK to the second tag using the data channel. The first tag and the second tag can each keep their respective receive windows open until the respective ACK is received or until the end of the downlink slot of the complete frame.

In one embodiment, the access point may transmit acknowledgements and/or other information to tags serially, with only one acknowledgement or other information transmitted during a given transmission slot of the access point. In such an embodiment, a tag may have to wait more than one slot to receive the acknowledgement or other information. As an example with acknowledgements, three tags may transmit to an access point during a first transmission slot. The access point may transmit a first acknowledgement to the first tag during a second transmission slot, a second acknowledgement to the second tag during a third transmission slot, and a third acknowledgement to the third tag during a fourth transmission slot. As such, the third tag has to wait several transmission slots prior to receiving the third acknowledgement. If the third tag is not still waiting during the fourth transmission slot, the third tag may not receive the third acknowledgment, and may have to retransmit the original message to the access point. In one embodiment, the tags may not know which transmission slot, if any, will include their acknowledgement or other information. As such, tags can be configured to wait a predetermined number of transmission slots based on a probability that multiple tags will transmit to the access point during a given slot. As an example, in a given system, it may be highly improbable that four tags will transmit to the access point during a single transmission slot. As such, the tags may be configured to wait no more than three transmission slots of the access point for an acknowledgement or other information before retransmitting the original message to the access point. In alternative embodiments, the tags may be configured to wait any other number of slots for an acknowledgement or other information.

In an exemplary embodiment, individual tags can be communicated to in the downlink direction in a time division multiple access (TDMA) scheme. As such, each tag may receive one frame worth of data channel data in a given complete slot duration. The data channel data can be decoded by the tag with a unique gold code key specific to the tag. For increased bandwidth or for specific quality of service (QoS) scenarios, the tag may receive multiple sub-slot allocations in a complete slot duration. The tag can use back-to-back decoding to decode the data from the multiple sub-slots. Details of the bandwidth management can be handled by the medium access control (MAC) layer.

The uplink frame structure can be an aggregation of multiple tag data channel transmissions. Depending on link conditions, tags may transmit with a plurality of different spreading factors. In one embodiment, the spreading factor may be as low as 16 and as high as 8192. Alternatively, other spreading factor limits may be used. The uplink slot can be partitioned into sub-slots in the same way as the downlink slot as described with reference to FIGS. 20 and 21. A difference in the uplink can be the way in which multiple access is achieved. In the downlink, multiple access can be achieved as described above through time division multiple access. In the uplink, multiple tag transmissions may be able to occupy the same sub-slot. In such an embodiment, the ability of the access point to discriminate among a plurality of tags can be realized through a technique called random phase multiple access (RPMA).

Random phase multiple access can be based on a common gold code sequence mapped to a given spreading factor. For example, all tags transmitting with a spreading factor of 256 can use the same gold code regardless of sub-slot location within the uplink slot. Because of the correlation properties of the gold code, the receiver at the access point can discriminate among a plurality of different tags as long as each tag uses a different chip offset. When two or more tags compete for a transmission sub-slot, frame collisions can occur if the randomly chosen sub-slot and the randomly chosen chip offset are the same. Such an occurrence can be identified by the lack of an acknowledgement response from the access point at the tag. If the tag does not receive the acknowledgement response, the tag can randomly select a new sub-slot and a new gold code chip offset. The tag can retransmit using the new sub-slot and new chip offset, thereby minimizing the likelihood of a subsequent conflict.

In one embodiment, the systems described herein may also be used where multiple access points are present and/or where multiple micro-repeaters are broadcasting on the same channel. In such a system, a random timing offset may be introduced to the downlink spreading system. Each device that transmits on the same channel with the same pseudo-noise (PN) code can use a different random timing offset into the PN code. As such, receiving devices such as tags can distinguish the multiple transmitters by despreading using the appropriate offset into the PN code.

There are various ways that the random timing offset can be calculated. In one implementation, a pseudo-random number generator is used. The number generator can be seeded using a time value, a known variable/system parameter, or a combination thereof. For example, the pseudo-random number generator can be seeded with the node identifier or the node identifier combined with an access point identifier and a system time value. Other variables/system parameters that can be used include, but are not limited to, a MAC identifier of a node, a connection identifier, an asymmetric security key, a connection frame number, a system frame number, a counter, a random number from another pseudo-random number generator, etc. In another implementation, the timing offset can be determined using a hash function of one or more variables/system parameters. For example, the connection identifier combined with a connection frame number can be hashed. A modulo operation of the resulting hash value can be used as the timing offset.

To help avoid collisions with other tags, a particular tag can change the timing offset used to transmit a data stream. For example, a timing offset can be calculated for each data unit of the data stream that is transmitted. In one implementation, a seeded pseudo-random number generator can be used to provide the timing offsets. For example, the next number from the pseudo-random number generator can be retrieved for each data unit. In this implementation, the timing offset for each data unit is based upon a new random number generated from the pseudo-random number generator. In another implementation, a hash value can be calculated based upon a changing variable/system parameter. For example, hashing a value that is calculated based upon a frame number and/or system time will change due to the changing values of the variable/system parameter. The sub-slot used by a tag to transmit a data unit can also be determined in a similar fashion.

In various implementations, the changing timing offset can be used to provide a level of security and/or determine an estimated distance of the tag from an access point. For example, an access point can know how a particular tag is going to calculate the timing offset for a particular data unit. When the access point receives the data unit, the access point can determine the sub-slot and the timing offset that the tag used to transmit the data unit. From this time, the access point can calculate a propagation delay, which can than be used to estimate a range of the tag from the access point. If two or more access points receive the same data unit, these access points can each calculate an estimated distance. Using the estimated distances from multiple access points allows a position of the tag to be estimated, e.g., via triangulation. The position can help identify the location of the tag.

Calculating the estimated distance of a tag over multiple data units allows the access point to determine if a particular tag is moving. In other words, if the estimated distance changes over time, the access point can determine that the tag is moving. In one implementation, the access point can determine if the tag is a stationary tag or a moving tag. The access point can then determine if the tag's behavior, e.g., moving or stationary, is consistent with the tag's expected behavior. For example, a data store can be queried to determine the tag's expected behavior and/or location. If there is a deviation from the expected behavior and/or location, an alert can be generated.

In another implementation, an access point can know the sequence of timing offsets and/or sub-slots that are used by a tag to transmit a sequence of data units. For each received data unit, the access point can calculate the actual timing offset used to transmit a data unit. For example, a tag can use a pseudo-random number generator with a known seed to produce a sequence of timing offsets of 3, 1, 12, 21, 18, etc. Using the same pseudo-random number generator and known seed, the access point will expect to receive data units from the tag with timing offsets of 3, 1, 12, 21, 18, etc. As the access point receives data units, the access point can determine the timing offset used by the tag and verify that the expected timing offset was used by the tag. The access point can allow for some tolerance between the determined timing offset and the expected timing offset. For example, the access point may deem a determined timing offset to be valid if the determined timing offset is within a particular number of chips, e.g., 1, 2, 3, etc., from the expected timing offset. If the access point determines that the determined timing offset of a data unit is not the expected timing offset or within the tolerance of the expected timing offset, the access point can drop the data unit. In addition or alternatively, the access point can log the event. If the timing offset is deemed valid, the access point can forward the data unit to the MAC for further processing. In addition to the timing offset, the sub-slot used to transmit a data unit can be determined and verified against an expected phase and sub-slot.

In another implementation, a tag can transmit in only certain sub-slots. For example, after an initial sub-slot the tag can transmit in a known pattern of sub-slots. In one implementation, the tag can generate a random number as described above. Using the random number, the tag can determine the next sub-slot that will be used to transmit data. For example, the tag can use a modulo operation of the random number to determine the next sub-slot. The access point that receives the data from the tag can also know the next sub-slot calculated by the tag based upon how the tag calculated the random number, and determine when data should be received from the tag. The access point can verify that data from the tag is being received in the expected sub-slot. If data is received outside of the expected sub-slot the access point can drop the data and/or log the event.

It is important to understand that any of the embodiments described herein may be implemented as computer-readable instructions stored on a computer-readable medium. Upon execution by a processor, the computer-readable instructions can cause a computing device to perform operations to implement any of the embodiments described herein.

The foregoing description of exemplary embodiments has been presented for purposes of illustration and description. It is not intended to be exhaustive or to limit the present invention to the precise form disclosed, and modifications and variations are possible in light of the above teachings or may be acquired from practice of the present invention. The embodiments were chosen and described in order to explain the principles of the present invention and its practical application to enable one skilled in the art to utilize the present invention in various embodiments and with various modifications as are suited to the particular use contemplated. In addition, one or more flow diagrams were used herein. The use of flow diagrams is not intended to be limiting with respect to the order in which operations are performed.

Claims

1. A method comprising: generating, using one or more processors at an access point, a first data stream;generating, using the one or more processors at the access point, a second data stream;spreading the first data stream using a first gold code unique to a first tag;spreading the second data stream using a second gold code unique to a second tag;combining into a combined data stream the spread first data stream and the spread second data stream; andtransmitting the combined data stream to the first tag and the second tag.
2. The method of claim 1, further comprising: weighting the first data stream based upon a transmission power of the first data stream being different than a transmission power of the second data stream; andweighting the second data stream based upon the transmission power of the first data stream being different than the transmission power of the second data stream.
3. The method of claim 1, wherein the first gold code and the second gold code have different lengths.
4. The method of claim 1, further comprising: generating, at the access point, a broadcast data stream; andspreading the broadcast data stream using a broadcast gold code known to the first tag and the second tag.
5. The method of claim 4, wherein combing into the combined data stream further comprises combining the spread broadcast data stream.
6. The method of claim 4, wherein a length of the broadcast gold code is larger than a length of the first gold code and larger than a length of the second gold code.
7. The method of claim 5, wherein the combined data stream consists of a real component and an imaginary component, wherein the combined data stream is transmitted on one of the real component or the imaginary component, and wherein the method further comprises transmitting the spread broadcast data stream on the other component.
8. The method of claim 1, further comprising transmitting a broadcast preamble prior to the transmission of the combined data stream.
9. The method of claim 8, further comprising: determining a transmit power of the combined data stream;boosting a transmit power of the broadcast preamble to be higher that the transmit power of the combined data stream.
10. The method of claim 1, further comprising: determining a first random chip delay;determining a second random chip delay;waiting the first random chip delay before combining the first data stream; andwaiting the second random chip delay before combining the second data stream.
11. A non-transitory computer-readable medium, at an access point, having instructions stored thereon, the instructions comprising: instructions to generate, using one or more processors at the access point, a first data stream;instructions to generate, using the one or more processors at the access point, a second data stream;instructions to spread the first data stream using a first gold code unique to a first tag;instructions to spread the second data stream using a second gold code unique to a second tag;instructions to combine into a combined data stream the spread first data stream and the spread second data stream; andinstructions to transmit the combined data stream to the first tag and the second tag.
12. The non-transitory computer-readable medium of claim 11, further comprising: instructions to weigh the first data stream based upon a transmission power of the first data stream being different than a transmission power of the second data stream; andinstructions to weigh the second data stream based upon the transmission power of the first data stream being different than the transmission power of the second data stream.
13. The non-transitory computer-readable medium of claim 11, wherein the first gold code and the second gold code have different lengths.
14. The non-transitory computer-readable medium of claim 11, further comprising: instructions to generate a broadcast data stream; andinstructions to spread the broadcast data stream using a broadcast gold code known to the first tag and the second tag.
15. The non-transitory computer-readable medium of claim 14, wherein the instructions to combine into the combined data stream further comprise instructions to combine the spread broadcast data stream.
16. An access point comprising: one or more electronic processors configured to: generate a first data stream;generate a second data stream;spread the first data stream using a first gold code unique to a first tag;spread the second data stream using a second gold code unique to a second tag; andcombine into a combined data stream the spread first data stream and the spread second data stream; anda transmitter configured to transmit the combined data stream to the first tag and the second tag.
17. The access point of claim 16, wherein the one or more electronic processors are further configured to: weigh the first data stream based upon a transmission power of the first data stream being different than a transmission power of the second data stream; andweigh the second data stream based upon the transmission power of the first data stream being different than the transmission power of the second data stream.
18. The access point of claim 16, wherein the first gold code and the second gold code have different lengths.
19. The access point of claim 16, wherein the one or more electronic processors are further configured to: generate a broadcast data stream; andspread the broadcast data stream using a broadcast gold code known to the first tag and the second tag.
20. The access point of claim 19, wherein the one or more electronic processors to combine into the combined data stream are further configured to combine the spread broadcast data stream.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation of U.S. patent application Ser. No. 13/745,567, filed on Jan. 18, 2013, which is a continuation of U.S. patent application Ser. No. 13/572,909, filed Aug. 13, 2012 (now U.S. Pat. No. 8,363,699), which is a continuation-in-part of U.S. patent application Ser. No. 12/647,756, filed Dec. 28, 2009 (now U.S. Pat. No. 8,259,780), which is a continuation of U.S. patent application Ser. No. 12/408,538, filed Mar. 20, 2009 (now U.S. Pat. No. 7,639,726), the entire disclosures of which are incorporated herein by reference.

US Referenced Citations (383)

Number	Name	Date	Kind
4774715	Messenger	Sep 1988	A
5161153	Westmore	Nov 1992	A
5235612	Stilwell et al.	Aug 1993	A
5297162	Lee et al.	Mar 1994	A
5353300	Lee et al.	Oct 1994	A
5359624	Lee et al.	Oct 1994	A
5392287	Tiedemann et al.	Feb 1995	A
5404375	Kroeger et al.	Apr 1995	A
5442627	Viterbi et al.	Aug 1995	A
5537397	Abramson	Jul 1996	A
5596330	Yokev et al.	Jan 1997	A
5604732	Kim et al.	Feb 1997	A
5617541	Albanese et al.	Apr 1997	A
5649296	MacLellan et al.	Jul 1997	A
5691974	Zehavi et al.	Nov 1997	A
5745485	Abramson	Apr 1998	A
5757767	Zehavi	May 1998	A
5822359	Bruckert et al.	Oct 1998	A
5835489	Moriya et al.	Nov 1998	A
5894473	Dent	Apr 1999	A
5940771	Gollnick et al.	Aug 1999	A
5944842	Propp et al.	Aug 1999	A
5960028	Okamoto et al.	Sep 1999	A
5978413	Bender	Nov 1999	A
5983113	Asanuma	Nov 1999	A
5991279	Haugli et al.	Nov 1999	A
6011974	Cedervall et al.	Jan 2000	A
6016312	Storm et al.	Jan 2000	A
6052582	Blasing et al.	Apr 2000	A
6069915	Hulbert	May 2000	A
6091759	Rotstein et al.	Jul 2000	A
6108364	Weaver, Jr. et al.	Aug 2000	A
6108565	Scherzer	Aug 2000	A
6111911	Sanderford, Jr. et al.	Aug 2000	A
6115411	Van Driest	Sep 2000	A
6148020	Emi	Nov 2000	A
6157631	Rohani	Dec 2000	A
6160798	Reed et al.	Dec 2000	A
6189123	Anders Nystrom et al.	Feb 2001	B1
6212398	Roberts et al.	Apr 2001	B1
6226282	Chung	May 2001	B1
6236860	Hagting et al.	May 2001	B1
6256337	Hendrickson et al.	Jul 2001	B1
6259927	Butovitsch et al.	Jul 2001	B1
6278725	Rouphael et al.	Aug 2001	B1
6320430	Blossfeld	Nov 2001	B1
6363106	Popovic et al.	Mar 2002	B1
6377557	Ohlson et al.	Apr 2002	B1
6437743	Mintz et al.	Aug 2002	B1
6459402	Tsunehara et al.	Oct 2002	B1
6480522	Hoole et al.	Nov 2002	B1
6493376	Harms et al.	Dec 2002	B1
6493541	Gunnarsson et al.	Dec 2002	B1
6507574	Kitade et al.	Jan 2003	B1
6522639	Kitade et al.	Feb 2003	B1
6567938	Wan	May 2003	B2
6587672	Chuah et al.	Jul 2003	B1
6587697	Terry et al.	Jul 2003	B2
6590886	Easton et al.	Jul 2003	B1
6597675	Esmailzadeh et al.	Jul 2003	B1
6615382	Kang et al.	Sep 2003	B1
6625197	Lundby et al.	Sep 2003	B1
6628667	Murai et al.	Sep 2003	B1
6628675	Neufeld	Sep 2003	B1
6643275	Gustafsson et al.	Nov 2003	B1
6647077	Shan et al.	Nov 2003	B1
6674765	Chuah et al.	Jan 2004	B1
6690739	Mui	Feb 2004	B1
6697415	Mahany	Feb 2004	B1
6701132	Fukuzawa et al.	Mar 2004	B1
6704547	Kuwahara et al.	Mar 2004	B2
6711219	Thomas et al.	Mar 2004	B2
6724810	Chapman	Apr 2004	B1
6744766	Alapuranen	Jun 2004	B2
6748224	Chen et al.	Jun 2004	B1
6751451	Rainish et al.	Jun 2004	B2
6760772	Zou et al.	Jul 2004	B2
6765953	Harms et al.	Jul 2004	B1
6771631	Lappetelainen	Aug 2004	B1
6771984	Hiramatsu et al.	Aug 2004	B1
6778558	Balachandran et al.	Aug 2004	B2
6795488	Iwakiri	Sep 2004	B1
6810078	Bradley	Oct 2004	B2
6813478	Glazko et al.	Nov 2004	B2
6836666	Gopalakrishnan et al.	Dec 2004	B2
6850499	Wheatley et al.	Feb 2005	B2
6851086	Szymanski	Feb 2005	B2
6882682	Tanaka	Apr 2005	B1
6888813	Kishi	May 2005	B1
6889055	Neufeld	May 2005	B1
6895036	Medlock	May 2005	B2
6900753	Tsunehara et al.	May 2005	B2
6956840	Proctor, Jr.	Oct 2005	B1
6970518	Kuffner et al.	Nov 2005	B2
6996086	Wolfe et al.	Feb 2006	B2
6996415	Lee et al.	Feb 2006	B2
6999501	Sawyer	Feb 2006	B1
7006428	Proctor et al.	Feb 2006	B2
7020180	Challa et al.	Mar 2006	B2
7027485	Yue	Apr 2006	B2
7039410	Jovanovic	May 2006	B2
7046717	Kanterakis et al.	May 2006	B2
7047029	Godwin et al.	May 2006	B1
7050485	Yue	May 2006	B2
7051268	Sindhushayana et al.	May 2006	B1
7062287	Nakamura et al.	Jun 2006	B2
7076008	Jeong	Jul 2006	B2
7085246	LaRosa et al.	Aug 2006	B1
7110349	Branlund et al.	Sep 2006	B2
7113496	Koo et al.	Sep 2006	B2
7126937	Crosbie et al.	Oct 2006	B2
7133380	Winters et al.	Nov 2006	B1
7136363	Kangas	Nov 2006	B2
7149238	Agee et al.	Dec 2006	B2
7155658	Huffman et al.	Dec 2006	B2
7164890	Eriksson et al.	Jan 2007	B2
7171230	Anderson	Jan 2007	B2
7177648	Attar et al.	Feb 2007	B2
7190681	Wu	Mar 2007	B1
7190684	Cao et al.	Mar 2007	B2
7197692	Sutivong et al.	Mar 2007	B2
7206797	Gressel et al.	Apr 2007	B2
7209517	Sindhushayana et al.	Apr 2007	B2
7218641	Kuffner et al.	May 2007	B2
7218901	Mobley et al.	May 2007	B1
7221699	Lindskog	May 2007	B1
7239867	Kotzin et al.	Jul 2007	B2
7280581	Khan	Oct 2007	B2
7280587	Motoyoshi et al.	Oct 2007	B2
7292874	Cave et al.	Nov 2007	B2
7302009	Walton et al.	Nov 2007	B2
7302276	Bernhardsson et al.	Nov 2007	B2
7308285	Nelson et al.	Dec 2007	B2
7319684	Tamaki et al.	Jan 2008	B2
7321601	Rogerson et al.	Jan 2008	B2
7359727	Tsien et al.	Apr 2008	B2
7379435	Kinder	May 2008	B1
7386026	Gold	Jun 2008	B1
7397824	Okubo	Jul 2008	B2
7415262	Liu et al.	Aug 2008	B2
7430178	Kim	Sep 2008	B2
7433384	Smee et al.	Oct 2008	B2
7447694	Mitchell	Nov 2008	B2
7453961	Li et al.	Nov 2008	B1
7477694	Sanderford et al.	Jan 2009	B2
7496804	Juncker	Feb 2009	B2
7515563	Ponnekanti	Apr 2009	B2
7515580	Wheatley et al.	Apr 2009	B2
7526013	Myers	Apr 2009	B1
7535822	Geile et al.	May 2009	B2
7535874	Ozluturk et al.	May 2009	B2
7558226	Anderson et al.	Jul 2009	B2
7586891	Masciulli	Sep 2009	B1
7586975	Ryu et al.	Sep 2009	B2
7587211	Zeng et al.	Sep 2009	B2
7593383	Myers	Sep 2009	B1
7593449	Shattil	Sep 2009	B2
7593452	Myers	Sep 2009	B1
7594154	Vedantham et al.	Sep 2009	B2
7607351	Allison et al.	Oct 2009	B2
7613462	Willenegger et al.	Nov 2009	B2
7616604	Abdelhamid et al.	Nov 2009	B2
7626996	Currivan et al.	Dec 2009	B2
7627347	Codreanu et al.	Dec 2009	B2
7633995	Giallorenzi et al.	Dec 2009	B1
7653357	Matsuo et al.	Jan 2010	B2
7673192	Currivan et al.	Mar 2010	B2
7675892	Min	Mar 2010	B2
7676735	Luby et al.	Mar 2010	B2
7680092	VanLaningham et al.	Mar 2010	B2
7693213	Sindhushayana et al.	Apr 2010	B2
7702290	Myers	Apr 2010	B1
7730380	Kim	Jun 2010	B2
7733945	Myers et al.	Jun 2010	B2
7734264	Rao et al.	Jun 2010	B2
7734946	Kobayashi	Jun 2010	B2
7738578	Ktenas et al.	Jun 2010	B2
7742428	Schlesener et al.	Jun 2010	B1
7751843	Butala	Jul 2010	B2
7782926	Myers	Aug 2010	B2
7782985	Wang	Aug 2010	B2
7787513	Siwiak et al.	Aug 2010	B2
7792196	Sheiman et al.	Sep 2010	B2
7940735	Kozisek et al.	May 2011	B2
8036178	Myers et al.	Oct 2011	B2
8290023	Myers et al.	Oct 2012	B2
8320430	Myers et al.	Nov 2012	B2
8363699	Sinsuan et al.	Jan 2013	B2
8401054	Myers et al.	Mar 2013	B2
8477830	Myers et al.	Jul 2013	B2
8565289	Myers et al.	Oct 2013	B2
20010004373	Hirata	Jun 2001	A1
20010041536	Hasegawa	Nov 2001	A1
20010046220	Koo et al.	Nov 2001	A1
20020015438	Ishizu et al.	Feb 2002	A1
20020021683	Holtzman et al.	Feb 2002	A1
20020101835	Gerakoulis	Aug 2002	A1
20020115473	Hwang et al.	Aug 2002	A1
20020129315	Onvural et al.	Sep 2002	A1
20020159409	Wolfe et al.	Oct 2002	A1
20020170013	Bolourchi et al.	Nov 2002	A1
20020183064	Gopalakrishnan et al.	Dec 2002	A1
20030008664	Stein et al.	Jan 2003	A1
20030026219	Moon et al.	Feb 2003	A1
20030031196	Nishimura	Feb 2003	A1
20030053435	Sindhushayana et al.	Mar 2003	A1
20030054813	Riley et al.	Mar 2003	A1
20030058821	Lee et al.	Mar 2003	A1
20030076812	Benedittis	Apr 2003	A1
20030123382	Wang et al.	Jul 2003	A1
20030181217	Haas et al.	Sep 2003	A1
20030210735	Ahn et al.	Nov 2003	A1
20030214928	Chuah	Nov 2003	A1
20040085920	Sezgin et al.	May 2004	A1
20040086027	Shattil	May 2004	A1
20040091034	Shiu et al.	May 2004	A1
20040100925	Niwano	May 2004	A1
20040123211	Kozintsev et al.	Jun 2004	A1
20040131125	Sanderford et al.	Jul 2004	A1
20040136349	Walton et al.	Jul 2004	A1
20040202137	Gerakoulis	Oct 2004	A1
20040213184	Hu et al.	Oct 2004	A1
20040229640	Wang et al.	Nov 2004	A1
20040252668	Ozukturk et al.	Dec 2004	A1
20040252684	Evan et al.	Dec 2004	A1
20040264554	Harms et al.	Dec 2004	A1
20050007948	Wan et al.	Jan 2005	A1
20050018753	Ohmi	Jan 2005	A1
20050025111	Soma	Feb 2005	A1
20050052991	Kadous	Mar 2005	A1
20050058151	Yeh	Mar 2005	A1
20050058153	Santhoff et al.	Mar 2005	A1
20050070295	Horanieh	Mar 2005	A1
20050090277	Islam et al.	Apr 2005	A1
20050102600	Anandakumar	May 2005	A1
20050105597	Hwang et al.	May 2005	A1
20050105598	Kaewell	May 2005	A1
20050108617	Lappin, Jr.	May 2005	A1
20050123025	Sorrells et al.	Jun 2005	A1
20050124374	Riley et al.	Jun 2005	A1
20050135253	Cai et al.	Jun 2005	A1
20050143073	Lee et al.	Jun 2005	A1
20050152480	Chang et al.	Jul 2005	A1
20050157692	Gerakoulis	Jul 2005	A1
20050160347	Kim et al.	Jul 2005	A1
20050169205	Grilli et al.	Aug 2005	A1
20050195769	Kaewell et al.	Sep 2005	A1
20050207383	Carsello et al.	Sep 2005	A1
20050208961	Willenegger	Sep 2005	A1
20050232189	Loushine	Oct 2005	A1
20050249164	Kwak et al.	Nov 2005	A1
20050254467	Li et al.	Nov 2005	A1
20050254557	Ozluturk et al.	Nov 2005	A1
20050259650	Bronner et al.	Nov 2005	A1
20050276249	Damnjanovic et al.	Dec 2005	A1
20050282574	Li et al.	Dec 2005	A1
20060013151	Lee et al.	Jan 2006	A1
20060018258	Teague et al.	Jan 2006	A1
20060018336	Sutivong et al.	Jan 2006	A1
20060033658	Camp, Jr.	Feb 2006	A1
20060035660	Anderson	Feb 2006	A1
20060039343	Anderson et al.	Feb 2006	A1
20060045195	Ok et al.	Mar 2006	A1
20060046789	Huh et al.	Mar 2006	A1
20060056375	Koyama et al.	Mar 2006	A1
20060072538	Raith	Apr 2006	A1
20060072614	Ogiso et al.	Apr 2006	A1
20060104374	Frederiksen et al.	May 2006	A1
20060109806	Kwak et al.	May 2006	A1
20060128414	Shida et al.	Jun 2006	A1
20060168496	Steele et al.	Jul 2006	A1
20060215559	Mese et al.	Sep 2006	A1
20060242323	Sanderford et al.	Oct 2006	A1
20060245472	Pan et al.	Nov 2006	A1
20060276134	Marinier et al.	Dec 2006	A1
20060285604	Walton et al.	Dec 2006	A1
20060286961	Levitan	Dec 2006	A1
20060286995	Onggosanusi et al.	Dec 2006	A1
20070014338	Ozluturk et al.	Jan 2007	A1
20070030862	Michels	Feb 2007	A1
20070042784	Anderson	Feb 2007	A1
20070060057	Matsuo et al.	Mar 2007	A1
20070064740	Waxman	Mar 2007	A1
20070066320	Padovani et al.	Mar 2007	A1
20070076664	An et al.	Apr 2007	A1
20070076682	Kim et al.	Apr 2007	A1
20070082620	Zhang et al.	Apr 2007	A1
20070092018	Fonseka et al.	Apr 2007	A1
20070117515	Sinibaldi et al.	May 2007	A1
20070130495	Yoon et al.	Jun 2007	A1
20070133605	Herrmann	Jun 2007	A1
20070140386	Howard	Jun 2007	A1
20070147337	Bosch et al.	Jun 2007	A1
20070177655	Ktenas et al.	Aug 2007	A1
20070177665	Zhou et al.	Aug 2007	A1
20070183370	Wallace et al.	Aug 2007	A1
20070189047	Lee et al.	Aug 2007	A1
20070195866	Seibert et al.	Aug 2007	A1
20070211786	Shattil	Sep 2007	A1
20070214399	Lim et al.	Sep 2007	A1
20070217531	Kwon et al.	Sep 2007	A1
20070234171	Maiuzzo et al.	Oct 2007	A1
20070258508	Werb et al.	Nov 2007	A1
20070274267	Tiedemann, Jr. et al.	Nov 2007	A1
20070276987	Luo et al.	Nov 2007	A1
20070277082	Matsumoto	Nov 2007	A1
20080002565	Spencer	Jan 2008	A1
20080004377	Axelsson et al.	Jan 2008	A1
20080022184	Jeong et al.	Jan 2008	A1
20080032625	Cheung et al.	Feb 2008	A1
20080036589	Werb et al.	Feb 2008	A1
20080037431	Werb et al.	Feb 2008	A1
20080037454	Werb et al.	Feb 2008	A1
20080037569	Werb et al.	Feb 2008	A1
20080040509	Werb et al.	Feb 2008	A1
20080043777	Yun et al.	Feb 2008	A1
20080049603	Geile et al.	Feb 2008	A1
20080052609	Peng et al.	Feb 2008	A1
20080062951	Kanterakis et al.	Mar 2008	A1
20080075035	Eichenberger	Mar 2008	A1
20080075216	Li et al.	Mar 2008	A1
20080089447	Usuda et al.	Apr 2008	A1
20080117955	Stafford	May 2008	A1
20080130482	Dabak	Jun 2008	A1
20080130534	Tomioka	Jun 2008	A1
20080130731	Shui et al.	Jun 2008	A1
20080153483	Abu-Amara	Jun 2008	A1
20080153532	Camp	Jun 2008	A1
20080161033	Borran et al.	Jul 2008	A1
20080176509	Yen et al.	Jul 2008	A1
20080182511	Adkins et al.	Jul 2008	A1
20080188265	Carter et al.	Aug 2008	A1
20080192661	Hamamoto et al.	Aug 2008	A1
20080192738	Florencio et al.	Aug 2008	A1
20080207251	Anderson	Aug 2008	A1
20080212654	Nilsson et al.	Sep 2008	A1
20080232330	Lee et al.	Sep 2008	A1
20080267126	Vujcic et al.	Oct 2008	A1
20080267287	Hannuksela	Oct 2008	A1
20080282137	You et al.	Nov 2008	A1
20090031035	Dharmaraju et al.	Jan 2009	A1
20090077444	Qi et al.	Mar 2009	A1
20090089638	Heise et al.	Apr 2009	A1
20090092055	Balasubramanian et al.	Apr 2009	A1
20090113267	Harrison et al.	Apr 2009	A1
20090122782	Horn et al.	May 2009	A1
20090135754	Yavuz et al.	May 2009	A1
20090137241	Yavuz et al.	May 2009	A1
20090147873	Li et al.	Jun 2009	A1
20090149140	Borran et al.	Jun 2009	A1
20090163238	Rao et al.	Jun 2009	A1
20090170548	Soliman	Jul 2009	A1
20090238201	Myers	Sep 2009	A1
20090238210	Myers et al.	Sep 2009	A1
20090238248	Myers et al.	Sep 2009	A1
20090239550	Myers	Sep 2009	A1
20090249155	Mayrench et al.	Oct 2009	A1
20090249158	Noh et al.	Oct 2009	A1
20090274164	Myers	Nov 2009	A1
20090276686	Liu et al.	Nov 2009	A1
20090280812	Cheng et al.	Nov 2009	A1
20090292403	Howell et al.	Nov 2009	A1
20090305693	Shimomura et al.	Dec 2009	A1
20090327835	Oteri et al.	Dec 2009	A1
20100014487	Attar et al.	Jan 2010	A1
20100017689	Choi et al.	Jan 2010	A1
20100034216	Pickering et al.	Feb 2010	A1
20100086087	Pekonen et al.	Apr 2010	A1
20100111070	Hsu	May 2010	A1
20100113077	Lee et al.	May 2010	A1
20100162035	Rancurel et al.	Jun 2010	A1
20100167777	Raghothaman et al.	Jul 2010	A1
20100167778	Raghothaman et al.	Jul 2010	A1
20100215080	Hamaguchi et al.	Aug 2010	A1
20100240379	Kishiyama et al.	Sep 2010	A1
20100329311	Hannan et al.	Dec 2010	A1
20110134965	Myers et al.	Jun 2011	A1
20110176635	Hochwald et al.	Jul 2011	A1
20110215736	Horbst et al.	Sep 2011	A1
20110216692	Lundsgaard et al.	Sep 2011	A1
20120011413	Liu et al.	Jan 2012	A1
20120032855	Reede et al.	Feb 2012	A1
20120087338	Brandt et al.	Apr 2012	A1

Foreign Referenced Citations (68)

Number	Date	Country
1448010	Oct 2003	CN
1481626	Mar 2004	CN
1652524	Aug 2005	CN
1747360	Mar 2006	CN
1799277	Jul 2006	CN
2847709	Dec 2006	CN
101260976	Sep 2008	CN
1 646 163	Apr 2006	EP
1 793 522	Jun 2007	EP
2 197 124	Jun 2010	EP
2771054	May 1999	FR
2 278 699	Dec 1994	GB
2 379 358	Mar 2003	GB
2 462 063	Jan 2010	GB
07-066834	Mar 1995	JP
07-504552	May 1995	JP
10-190664	Jul 1998	JP
10-303801	Nov 1998	JP
2001-298446	Oct 2001	JP
2002-199438	Jul 2002	JP
2003-051763	Feb 2003	JP
2003-116162	Apr 2003	JP
2004-023350	Jan 2004	JP
2004-096703	Mar 2004	JP
2004-158901	Jun 2004	JP
2004-221940	Aug 2004	JP
3621888	Nov 2004	JP
2004-363998	Dec 2004	JP
2006-020320	Jan 2006	JP
2006-098410	Apr 2006	JP
3795045	Apr 2006	JP
2006-174155	Jun 2006	JP
2007-158662	Jun 2007	JP
2007-159139	Jun 2007	JP
4076202	Feb 2008	JP
2008-054014	Mar 2008	JP
2009-276890	Nov 2009	JP
10199772739	Nov 1997	KR
10199839215	Aug 1998	KR
20020001071	Jan 2002	KR
10200250542	Jun 2002	KR
10200331124	Apr 2003	KR
200500224333	Mar 2005	KR
100691367	Feb 2007	KR
20080088774	Oct 2008	KR
WO-9318601	Sep 1993	WO
WO-9610871	Apr 1996	WO
WO-9702663	Jan 1997	WO
WO-9903224	Jan 1999	WO
WO-0038361	Jun 2000	WO
WO-0057576	Sep 2000	WO
WO-0108322	Feb 2001	WO
WO-0167786	Sep 2001	WO
WO-0173968	Oct 2001	WO
WO-0176083	Oct 2001	WO
WO-0198618	Dec 2001	WO
WO-0209320	Jan 2002	WO
WO-0211304	Feb 2002	WO
WO-0232049	Apr 2002	WO
WO-0235735	May 2002	WO
WO-2005015801	Feb 2005	WO
WO-2005102214	Nov 2005	WO
WO-2006031073	Mar 2006	WO
WO-2006126960	Nov 2006	WO
WO-2007035058	Mar 2007	WO
WO-2007083550	Jul 2007	WO
WO-2008081531	Jul 2008	WO
WO-2010006909	Jan 2010	WO

Non-Patent Literature Citations (206)

Entry
Notice of Preliminary Rejection on Korean Application 10-2010-7023166, mailed Jul. 21, 2015, English translation included.
Office Action on Russian Application 2012151004, mailed Jun. 29, 2015, English translation only.
Office Action on Chinese Application 201180028720.3, mailed Jul. 16, 2015, English translation provided.
Andrew Richardson, WCDMA Design Handbook, pp. 268 & 277(Cambridge University Press 2005), retrieved from URLs: http://bit.ly/buMIW0; http://bit.ly/9QcaED.
Aronsohn, “Digital RF-Communication between Mobile Platforms in the Presence of Interference” Chalmers University of Technology, Jun. 2004.Retrieved on Aug. 17, 2010 from the internet at: htttp://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.63.9851&rep=rep1&type=pdf; (67 pgs.).
AU Office Action on AU Appln. No. 2009225884, dated Mar. 21, 2013 (6 pgs.).
Bayer et al., “Improving the Performance of the Distributed Scheduler in IEEE 802. 16 Mesh Networks.”In IEEE vehicular technology conference (VTC 2007-Spring) [online], 2007, p. 1-5, [retrieved on Dec. 3, 2008]. Retrieved from the Internet: <URL: http://www.staff.city.ac.uk/˜veselin/publications/Bayer—VTC07.pdf>. Citation available at <URL: http://portal.acm.org/citation.cfm?id=1413939.1413942&coll=GUIDE&dl=GUIDE>(see item 25).
Buzzi et al., “Joint Receiver and Transmitter Optimization for Energy-Efficient CDMA Communications,” to Appear in IEEE JSAC—Special Issue on Multiuser Detection for Advanced Communication Systems and Networks, Presented at 2007 European Wireless Conference and at 2007 IEEE International Symposium on Information Theory, [Retrieved on Feb. 25, 2009], Retrieved from the Internet <URL: http://arxiv.org/PS—cache/arxiv/pdf/0712/0712.1339v1.pdf>, 2007.
CA 2,228,714 (English language version of JP-10-303801).
Cao et al., “Modelling and Performance Analysis of the Distributed Scheduler in IEEE 802. 16 Mesh Mode.” In: MobiHoc'05 [online], May 25-27, 2005, p. 78-89, [retrieved on Dec. 3, 2008]. Retrieved from the Internet: <URL: http://lion.cs.uiuc.edu/group—seminar—slides/p78-cao.pdf.>.
Chen, Chuan Chong, et al.; “Multiple Delay Capture Probability and Performance of DS-SS Slotted Aloha Packet Radio System”; Communications ICC 2005. 2005 IEEE International Conference on Seoul, Korea; May 16, 2005, pp. 895-900, vol. 2. (6 pgs.).
Chinese First Office Action, CN Application No. 200980117844.1, Filed: Mar. 11, 2009, with English Translation, 36 pgs, (OA Issued Jan. 31, 2013).
Clancy, T. Charles; “Dynamic Spread Spectrum Access in Cognitive Radio Networks”; Retrieved from the internet on Oct. 15, 2010 from: http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.135.724&rep=rep1&type=pdf (116 pgs.).
CN First Office Action on CN Appln. No. 200980118495.5, dated Feb. 27, 2013 (18 pgs.).
DaFalla, et al.; “Performance Study of Power Control Radio Resource Management Over WLANs”; Journal of Computer Science (2008); vol. 4, No. 3, pp. 239-244.
Decision of Rejection on Japanese Application 2012-500965, dispatched Nov. 26, 2014 (English translation provided).
Decision to Grant Patent issued for Russian application 2011142331/07, mailed Mar. 6, 2014.
Decision to Grant Patent on Russian Application 2011145028/07 English Translation included.
English translation of Notice of Reasons for Rejection for Japanese Application 2012-500965, mailed Mar. 19, 2014.
EP Communication on EP Appln. No. 09 837 081.0, dated Apr. 4, 2013, (9 pages).
Examination Report on Australian Application 2010235002,I issued May 21, 2014.
Examination Report issued on Australian Application 2010235002, mailed Apr. 15, 2015.
Examination Report on Australian Application 2010226584, issued Jun. 24, 2014.
Examination Report on Australian application 2011248576, issued Aug. 25, 2014.
Examination Report on EP Application 09721805.1, dated Jul. 11, 2013.
Examination Report on New Zealand Application No. 596030, dated Sep. 26, 2012.
Examination Report; In re: European Patent Application Serial No. 09721805.1-2411; Dated: Jul. 17, 2012; Applicant: On-Ramp Wireless, Inc.; (5 pgs.).
Examination Report; In re: European Patent Application Serial No. 09723436.3-2411; Dated: Jul. 11, 2012; Applicant: On-Ramp Wireless, Inc.; (6 pgs.).
Extended European Search Report on EP Application 10754112.0, mailed Apr. 14, 2014.
Extended Search Report on EP Application 10762075.9, mailed Sep. 19, 2014.
Extended Search Report on European Application 11777953.8, dated Oct. 2, 2013.
Final Office Action for U.S. Appl. No. 12/345,374 dated Nov. 10, 2009.
Final Office Action on U.S. Appl. 12/770,630, mailed Feb. 19, 2014.
Final Office Action on U.S. Appl. No. 13/355,864, mailed Aug. 29, 2012 (8 pgs.).
Final Office Action on U.S. Appl. No. 13/366,848, mailed Sep. 10, 2012 (13 pgs.).
Final Office Action on U.S. Appl. No. 13/458,451, mailed Nov. 26, 2012.
Final Office Action on U.S. Appl. No. 13/916,263, mailed Jan. 31, 2014.
Final Office Action on U.S. Appl. No. 13/935,364, mailed Jan. 15, 2014.
Final Office Action on U.S. Appl. No. 13/936,984, mailed Jan. 15, 2014.
Final Office Action on U.S. Appl. No. 13/937,990, mailed Jan. 28, 2014.
Final Office Action on U.S. Appl. No. 13/938,903, mailed Feb. 6, 2014.
Final Office Action on U.S. Appl. No. 13/938,963, mailed Jan. 15, 2014.
Final Office Action on U.S. Appl. No. 13/471,000, mailed Jan. 8, 2013.
Final Office Action on U.S. Appl. No. 12/770,630, dated Apr. 30, 2013, (46 pages).
Final Office Action on U.S. Appl. No. 13/437,509, dated May 8, 2013, (77 pages).
Final Office Action on U.S. Appl. No. 13/437,509, mailed Apr. 5, 2013 (78 pages).
Final Office Action received for U.S. Appl. No. 12/189,609 dated Sep. 4, 2009.
Final Office Action received on U.S. Appl. No. 12/189,609 dated Jul. 22, 2009.
Final Office Action; In re: U.S. Appl. No. 12/751,724; Dated: Jul. 13, 2011; Applicant: Theodore J. Myers; (12 pgs.).
Final Office Action; In re: U.S. Appl. No. 13/035,459; Dated: Nov. 23, 2011; Applicant: Theodore J. Myers, et al. (13 pgs.).
Final Office Action; In re: U.S. Appl. No. 13/232,426; Dated: Apr. 27, 2012; Filed: Sep. 14, 2011; Applicant: Robert W. Boesel, et al.; (10 pgs.).
First Examination Report on New Zealand Patent Application 603474, mailed Jul. 15, 2013 (2 pages).
First Examination Report; In re New Zealand Patent Application No. 588465; Issued: Mar. 2, 2012; Applicant: On-Ramp Wireless, Inc.; (2 pgs.).
First Office Action on Chinese Application 201080021870.7, issued Jan. 6, 2014.
First Office Action on Chinese Application 201080022633.2, issued Nov. 18, 2013.
First Office Action on Chinese Application 201180028720.3, mailed Dec. 3, 2014.
Fourth Office Action on Chinese Application 200980117844.1, issued Sep. 24, 2014, English translation provided.
Fujiwara et al., “Capacity Improvement with a Multi-hop Access Scheme in Broadband CDMA Cellular Systems”, Institute of Electronics, Information, and Communication Engineers, (2002), pp. 2073-2079, vol. J85B, No. 12.
Fumo et al., “Satellites & solid state electronics test concrete pressure water pipelines,”(2000), Retrieved from the internet at: http://www.pipepressure.com/pdfs/SPIE%20NDE%20Conf%202000%20- %20Acoustic%20Tesing.pdf, 10 pages.
Glisic Savo, et al.; “Spread Spectrum CDMA Systems for Wireless Communications”; Artech House (1997); pp. 354-365, section 8.4.3 (12 pgs.).
Haardt et al., “The TD-CDMA Based UTRA TDD Mode,” IEEE Journal on Selected Areas in Communications, vol. 18, No. 8, Aug. 2000, p. 1375-1385.
Hamalainen, J., “Cellular Network Planning and Optimization Part VI: WCDMA Basics”, Helsinki University of Technology Communications and Networking Department, Jan. 24, 2008. [Retrieved on Jan. 27, 2009], Retrieved from the Internet <URL: http://www.comlab.hut.fi/studies/3275/Cellular—network—planning—and—optimization—part6.pdf.
Hasu. “Radio Resource Management in Wireless Communication: Beamforming, Transmission Power Control, and Rate Allocation.” Helsinki University of Technology, Jun. 2007. Retrieved on Aug. 5, 2010 from the Internet at http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.96.3380&rep=rep1&type=pdf; (110 pgs.).
Hermanns, “Secure and Robust Tactical Communications Based on Code-Hopping CDMA (CH-CDMA)” Apr. 2008, Retrieved from the internet at: http://ftp.rta.nato.int/public/PubFullText/RTO/MP/RTO-MP-IST-083/MP-IST-083-16.pdf, (14 pgs.).
Hund et al. “Overview of MAC layer Enhancements for IEEE 802.15.4a.” Retrieved on Jul. 26, 2010 from the Internet at http://www.johanneshund.de/files/Hund2009.pdf. Publication year of 2009 inferred from the URL; (7 pgs.).
International Preliminary Report on Patentability received for PCT/US2009/036743 dated Sep. 30, 2010.
International Preliminary Report on Patentability received for PCT/US2009/036766 dated Sep. 30, 2010.
International Search Report and Written Opinion for PCT/US/2009/036766 mailed Oct. 28, 2009.
International Search Report and Written Opinion for PCT/US2009/036743 dated Oct. 28, 2009.
International Search Report and Written Opinion received for PCT/US2010/027823 dated Oct. 26, 2010.
International Search Report and Written Opinion received for PCT/US2010/035419 dated Dec. 23, 2010.
International Search Report and Written Opinion; In re: PCT International Patent Application No. PCT/US2011/030357; Dated: Oct. 31, 2011; Applicant: On-Ramp Wireless, Inc.; (8 pgs.).
International Search Report and Written Opinion; In re: PCT International Patent Application No. PCT/US2011/034128; Mailed: Nov. 25, 2011; Applicant: On-Ramp Wireless, Inc., (8 pgs.).
International Search Report for PCT/US2010/027647, dated Oct. 29, 2010.
Jeong et al.,“CDMA/TDD System for Wireless Multimedia Services with Traffic Unbalance Between Uplink and Downlink,” IEEE Journal on Selected Areas in Communications, vol. 17, No. 5, May 1999, pp. 939-946.
JP Office Action on J Appln. No. 2011-500868, dated Apr. 17, 2013 (3 pgs).
JP Office Action on JP Appln. No. 2011-500871, dated Apr. 17, 2013 (3 pgs).
Lee et al., “CDMA Systems Engineering Handbook”, Published 1998, Publisher Artech House, ISBN 0890069905, pp. 333-423.
Li, “Physical Layer Design for a Spread Spectrum Wireless LAN,” retrieved from Internet: http://scholar.lib.vt.edu/these/public/etd-3014171099642831/etd.pdf, Sep. 12,1996, 114 pages.
Luby et al. “Efficient Erasure Correcting Codes.” In: IEEE Transactions on Information Theory, vol. 47, No. 2, Feb. 2001, pp. 569-584. Retrieved on Jul. 26, 2010 from the Internet at http://www.ldpccodes.com/papers/eraseIT.pdf.
Manchiraju, “Evaluation of pseudorandom sequences used in third generation spread spectrum systems,” 2003, Retrieved from the internet at: http://etd.ohiolink.edu/etd/send-pdf.cgi/Manchiraju%20Dinakar.pdf?acc—num=ohiou1081801327, 100 pages.
Meerkerk, “Experimental propagation analysis in a CDMA 1X macro cell,” 2005. Retreieved from the internet at: http://lib-ir.lib.sfu.ca/retrieve/2426/etd2025.pdf, 71 pages.
Mischa Schwartz, Mobile Wireless Communications, pp. 327 (Cambridge University Press 2005), retrieved from URL: http://bit.ly/9BYDhy.
Monks et al., “Transmission power control for multiple access wireless packet networks,” Proceedings 25th Annual IEEE Conference on Local Computer Networks, Nov. 2000, 10 pages.
Non-Final Office Action on U.S. Appl. No. 13/935,364, mailed Sep. 3, 2013, 36 pages.
Non-Final Office Action on U.S. Appl. No. 12/770,630, mailed Nov. 8, 2012.
Non-Final Office Action on U.S. Appl. No. 12/770,630, mailed Nov. 6, 2013.
Non-Final Office Action on U.S. Appl. No. 12/770,630, mailed May 12, 2014.
Non-Final Office Action on U.S. Appl. No. 13/437,509, mailed Dec. 17, 2012.
Non-Final Office Action on U.S. Appl. No. 13/458,451, mailed Aug. 3, 2012, (22 pages).
Non-Final Office Action on U.S. Appl. No. 13/471,000, mailed Aug. 30, 2012.
Non-Final Office Action on U.S. Appl. No. 13/745,567, mailed Jun. 26, 2014.
Non-Final Office Action on U.S. Appl. No. 13/916,263, mailed Aug. 20, 2013.
Non-Final Office Action on U.S. Appl. No. 13/936,984, mailed Sep. 12, 2013.
Non-Final Office Action on U.S. Appl. No. 13/937,990, mailed Oct. 10, 2013.
Non-Final Office Action on U.S. Appl. No. 13/938,903, mailed Oct. 25, 2013.
Non-Final Office Action on U.S. Appl. No. 13/938,963, mailed Sep. 4, 2013 36 pages.
Non-Final Office Action on U.S. Appl. No. 12/647,756, mailed Dec. 12, 2011.
Non-Final Office Action received for U.S. Appl. No. 12/408,538 dated Aug. 17, 2009.
Non-Final Office Action received for U.S. Appl. No. 12/189,609 dated Jun. 18, 2009.
Non-final Office Action received for U.S. Appl. No. 12/189,619 dated Apr. 2, 2009.
Non-final Office Action received for U.S. Appl. No. 12/276,971 dated Apr. 13, 2010.
Non-final Office Action received for U.S. Appl. No. 12/472,642 dated Dec. 3, 2009.
Non-final Office Action received for U.S. Appl. No. 12/483,722 dated Jan. 11, 2010.
Non-final Office Action received on U.S. Appl. No. 12/345,374 dated Feb. 17, 2010.
Non-final Office Action received on U.S. Appl. No. 12/345,374 dated Sep. 4, 2009.
Non-Final Office Action U.S. Appl. No. 12/751,724; dated Apr. 8, 2011; (17 pgs).
Non-Final Office Action U.S. Appl. No. 12/816,783; Dated Apr. 6, 2011, (10 pgs.).
Non-Final Office Action, dated Jun. 3, 2011; U.S. Appl. No. 13/032,393, filed, Feb. 22, 2011, (13 pgs.).
Non-Final Office Action, Dated: Apr. 8, 2011, U.S. Appl. No. 12/751,724, (7 pgs.).
Non-Final Office Action, in Re: U.S. Appl. No. 13/035,459, Dated: Jul. 26, 2011, Applicant: Theodore Myers (11 pgs).
Non-Final Office Action; In re: U.S. Appl. No. 13/232,426; Dated: Mar. 16, 2012; Filed: Sep. 14, 2011; Applicant: Robert W. Boesel, et al.; (13 pgs.).
Non-Final Office Action; In re: U.S. Appl. No. 13/035,459; Dated: Oct. 17, 2011; Applicant: Theodore Myers, (12 pgs.).
Non-Final Office Action; In re: U.S. Appl. No. 13/035,459; Dated: Jul. 26, 2011; Applicant: Theodore J. Myers, (11 pgs.).
Non-Final Office Action; In re: U.S. Appl. No. 13/232,426; Dated: Jan. 26, 2012; Applicant: Robert W. Boesel, et al.; (7 pgs.).
Non-Final Office Action; In re: U.S. Appl. No. 13/354,846; Dated: Mar. 19, 2012; Applicant: Theodore J. Myers; (10 pgs.).
Non-Final Office Action; In re: U.S. Appl. No. 13/355,864; Dated: Apr. 3, 2012; Applicant: Theodore J. Myers, et al.; (8 pgs.).
Non-Final Office Action; In re: U.S. Appl. No. 13/366,848; Dated: Apr. 30, 2012; Filed: Feb. 6, 2012; Applicant: Theodore J. Myers, et al.; (10 pgs.).
Notice of Allowance for U.S. Appl. No. 12/276,971 dated Jul. 30, 2010.
Notice of Allowance in re: U.S. Appl. No. 13/027,654, mailed: Jun. 13, 2011 (10 pgs.).
Notice of Allowance on U.S. Appl. No. 12/770,630, mailed Oct. 7, 2014.
Notice of Allowance on U.S. Appl. No. 13/354,846, mailed Jul. 27, 2012.
Notice of Allowance on U.S. Appl. No. 13/355,864, mailed Jun. 26, 2013.
Notice of Allowance on U.S. Appl. No. 13/437,509, mailed Jun. 20, 2013.
Notice of Allowance on U.S. Appl. No. 13/745,567, mailed Nov. 28, 2014.
Notice of Allowance on U.S. Appl. No. 13/916,263, mailed May 9, 2014.
Notice of Allowance on U.S. Appl. No. 13/935,364, mailed Apr. 25, 2014.
Notice of Allowance on U.S. Appl. No. 13/936,984, mailed Apr. 28, 2014.
Notice of Allowance on U.S. Appl. No. 13/937,990, mailed May 8, 2014.
Notice of Allowance on U.S. Appl. No. 13/938,903, mailed May 13, 2014.
Notice of Allowance on U.S. Appl. No. 13/938,963, mailed Apr. 30, 2014.
Notice of Allowance received for U.S. Appl. No. 12/189,609 on dated Mar. 23, 2010.
Notice of Allowance received for U.S. Appl. No. 12/189,619 dated Jun. 26, 2009.
Notice of Allowance received for U.S. Appl. No. 12/345,374 on dated Mar. 31, 2010.
Notice of Allowance received on U.S. Appl. No. 12/408,538 dated Sep. 30, 2009.
Notice of Allowance received on U.S. Appl. No. 12/189,533 dated Jun. 3, 2009.
Notice of Allowance received on U.S. Appl. No. 12/472,642 dated Jan. 26, 2010.
Notice of Allowance received on U.S. Appl. No. 12/483,722 dated Feb. 18, 2010.
Notice of Allowance; In re: U.S. Appl. No. 12/816,783; Dated: Jun. 14, 2012; Applicant: Robert W. Boesel, et al.; (9 pgs.).
Notice of Allowance; in re: U.S. Appl. No. 12/816,783; mailed: Jun. 29, 2011; Applicant: Theodore J. Myers; (6 pgs.).
Notice of Allowance; in re: U.S. Appl. No. 13/027,654; mailed: Jun. 13, 2011; Applicant: Theodore J. Myers; (10 pgs.).
Notice of Allowance; In re: U.S. Appl. No. 13/032,393; Dated Jul. 27, 2011; Applicant: Theodore J. Myers; (10 pgs.).
Notice of Allowance; In re: U.S. Appl. No. 13/032,393; Dated: Jul. 27, 2011; Applicant: Theodore J. Myers; (10 pgs.).
Notice of Allowance; In re: U.S. Appl. No. 13/232,426; Dated: Jun. 14, 2012; Applicant: Robert W. Boesel, et al.; (9 pgs.).
Notice of Allowance; In re: U.S. Appl. no. 12/755,229; Dated: Dec. 16, 2011; Applicant: Kenneth C. Sinsuan; (8 pgs.); (091721-0123).
Notice of Allowance; In re: U.S. Appl. No. 13/116,767; Dated: Oct. 28, 2011; Applicant: Theodore Myers, et al. (10 pgs.).
Notice of Allowance; In re: U.S. Appl. No. 12/647,756; dated May 1, 2012; Applicant Kennety C. Sinsuan et al., (8 pgs).
Notice of Allowance; in re: U.S. Appl. No. 12/816,783; mailed: May 20, 2011; Applicant: Theodore J. Myers; (5 pgs.).
Notice of Reasons for Rejection issued on Japaenese Application 2012-504686, mailed Nov. 11, 2013.
Notice of Reasons for Rejection issued on Japanese Application 2012-504686, mailed Oct. 8, 2014.
Notice of Reasons for Rejection on Japanese Application 2012-500965, mailed Nov. 6, 2013, English translation provided.
Notice of Reasons for Rejection on Japanese Application 2012-504686, mailed Apr. 19, 2014 (English translation provided).
Notice of Reasons for Rejection on JP Application 2011-544562, dispatched Dec. 26, 2013.
Notification of Reason for Rejection on Japanese Application 2012-054470, mailed Dec. 4, 2013.
Notification of Reasons for Rejection for Japanese Application 2012-054470, dispatched Jun. 26, 2013.
Office Action issued on Mexican Application MX/a/2011/009768, mailed Dec. 28, 2012.
Office Action issued on Mexican Application MX/a/2011/013002, mailed Jun. 22, 2012.
Office Action on Chinese Application 200980157540.8, issued Aug. 20, 2013.
Office Action on Chinese Application 2009801575408, issued Apr. 21, 2014, English Translation included.
Office Action on Chinese Application 2009801575408, issued Oct. 17, 2014 (English translation provided).
Office Action on Chinese Application 201080022633.2, issued Jun. 10, 2014.
Office Action on Mexican Application MX/a/2012/012543, dated Dec. 2, 2013.
Office Action on Mexican Application No. MX/a/2012/012543, dated May 22, 2013.
Office Action on ROC-Taiwanese Application No. 099116862, issued May 27, 2013, (7 pgs.).
Office Action on Russian Application 2011145028/07, mailed Jan. 9, 2014.
Official Action issued on Japanese application 2012-054471, mailed Jun. 19, 2013.
Official Action on Japanese Application 2011-500868, mailed Jul. 31, 2013 English translation not available.
Official Action on Japanese Application 2012-054469, issued Jun. 19, 2013.
PCT International Search Report on application PCT/US2011/034128, mailed Nov. 25, 2011, 4 pages.
PCT Notification Concerning Transmittal of International Preliminary Report on Patentability (Chapter I of the PCT) dated Sep. 29, 2011, Application No. PCT/US2010/027823, (7 pgs).
Pottie, “Wireless Multiple Access Adaptive Communications Techniques,” retrieved from Internet http://www.ee.ucla.edu/˜pottie/papers/encycl.pdf. 53 pages, 1999.
Prasad, “An Overview of CDMA Evolution Toward Wideband CDMA,” retrieved from Internet http://www.tfe.umu.se/courses/systemteknik/elesystem/Prasad.pdf, 1998, vol. 1, No. 1, pp. 2-29.
Qiao et al. “IEEE 802.11h: Technology and Application.” Published in IT Professional, vol. 8, No. 2, Mar./Apr. 2006. Retrieved on Aug. 5, 2010 from the Internet at http://www.mwnl.snu.ac.kr/˜schoi/publication/Journals/06-ITPro.pdf. Citation available as reference [1] of http://kom.aau.dk/˜ff/documents/pimrc2008.pdf; (5 pgs.).
Qiao, et al., “IEEE 802.11h: Technology and Application,” IT Professional, vol. 8, No. 2, pp. 1-5 (2006).
Rejection on Japanese Application 2011-544562, dispatched Sep. 4, 2013. (English translation provided).
Russian Office Action (Enquiry) with English Translation, Appln. No. 2010139424/07, 7 pgs., (OA issued Feb. 4, 2013).
Sasamori et al. Transmission Efficiency of Spread ALOHA System Using Unified Spread Spectrum Code, Institute of Electronics, Information, and Communication Engineers, (1994), pp. 726-732, BII, vol. JJ77-BII, No. 11.
Second Action on Mexican Application MX/a/2012/012543, received Dec. 2, 2013.
Second Office Action on Chinese Application 200980117844.1, mailed Sep. 12, 2013.
Second Office Action on Chinese Application 201080021870.7, issued Sep. 17, 2014, English Translation Provided.
Subramanian et al. “Disruption-tolerant link-level mechanisms for extreme wireless network environments.” In: Proceedings of the 2nd International Conference on Communication System Software and Middleware (COMSWARE 2007), Jan. 7-12, 2007. Retrieved on Jul. 26, 2010 from the Internet at http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.143.4028&rep=rep1&type=pdf; (8 pgs.).
Sunay et al., “Mobile Location Tracking in DS CDMA Networks Using Forward Link Time Difference of Arrival and Its Application to Zone-Based Billing.” In: Global Telecommunications Conference, 1999. GLOBECOM '99 [online], vol. 1a, p. 143-147, [retrieved on Nov. 20, 2008]. Retrieved from the Internet: <URL: http://portal.ku.edu.tr˜osunay/papers/GCOM99-geolocation.pdf>. Citation on the Internet: <URL: http://ieeexplore.ieee.org/xpl/freeabs—all.jsp?arnumber=831624>.
Supplemental Non-final Office Action received for U.S. Appl. No. 12/408,538 dated Sep. 1, 2009.
Supplementary European Search Report; in re: European Patent Application No. 09721805.1; Applicant: On-Ramp Wireless, Inc.; Mailed: Jun. 20, 2011 (6 pgs.).
Supplementary European Search Report; in re: European Patent Application No. 09723436.3; Applicant: On-Ramp Wireless, Inc.; Mailed: Jun. 29, 2011 (8 pgs.).
Third Office Action on Chinese Application 200980117844.1, mailed Mar. 24, 2014, English translation provided.
US Notice of Allowance for U.S. Appl. No. 12/420,308, dated Dec. 16, 2009.
US Notice of Allowance on U.S. Appl. No. 13/366,848, mailed Nov. 13, 2012.
US Notice of Allowance on U.S. Appl. No. 13/458,451, mailed Feb. 5, 2013.
US Notice of Allowance on U.S. Appl. No. 13/572,909, mailed Oct. 5, 2012.
US Notice of Allowance on U.S. Appl. No. 13/471,000, mailed Apr. 11, 2013, 7 pages.
Wadekar et al. “Adaptive transmission power control and coding for wireless sensor networks.” Published in IET Conference on Wireless, Mobile and Sensor Networks 2007 (CCWMSN07), vol. 2007, issue CP533, Dec. 12-14, 2007. pp. 1063-1066. Retrieved on Aug. 5, 2010 from the Internet at http://scitation.aip.org/getabs/servlet/GetabsServlet?prog=normal&id=IEECPS0020070CP533001063000001&idtype=cvips&gifs=yes&ref=no.
Wang et al., “Error Statistics of Closed-Loop Power Control in Multirate DS-CDMA Cellular Systems,”IEEE Xplore, [Retreived on Feb. 23, 2009], Retrieved from the Internet <URL: http://ieeexplore.ieee.org/Xplore/login.jsp?url=/iel5/7793/21424/00993355.pdf?arnumber=993355>, 2002.
Weisstein, Eric W. “Cyclic Redundancy Check.” From MathWorld—A Wolfram Web Resource. http://mathworld.wolfram.com/CyclicRedundancyCheck.html, accessed May 5, 2011, (1 pg.).
Wha Sook Jeon, Dong Geun Jeong, Comparison of Time Slot Allocation Strategies for CDMA/TDD Systems, IEEE Journal on Selected Areas in Communications, vol. 18, No. 7, Jul. 2000, p. 1271-1278.
Woo, G., et al., “Beyond the Bits: Cooperative Packet Recovery Using Physical Layer Information” Proceedings of the 13th annual ACM international conference on Mobile computing and networking, Sep. 14, 2007, Retrieved from the internet at: http://portal.acm.org/citation.cfm?id=1287853.1287871, (12 pgs.).
Xu, Liang, “Dynamic Fair Scheduling with QoS Constraints in Multimedia Wideband CDMA Cellular Networks,” IEEE Transactions on Wireless Communications, vol. 3, No. 1; [Retrieved on Feb. 25, 2009], Retrieved from the Internet <URL: http://ieeexplore.ieee.org/Xplore/login.jsp?url=/iel5/7693/28152/01259400.pdf?arnumber=1259400, Jan. 2004.
Yang et al, “Software-Defined-Radio-Assisted Adaptive Broadband Frequency Hopping Multicarrier DS-CDM,” IEEE Communications Magazine, [Retrieved on Feb. 25, 2009], Retrieved from the Internet <URL: http://ieeexplore.ieee.org/Xplore/login.jsp?url=ielx5/35/21325/00989783.pdf?arnumber=989783>, Mar. 2002.
Yi et al. “CORA: Collaborative Opportunistic Recovery Algorithm for loss controlled, delay bounded ad.hoc multicast.” In: Computer Communications, vol. 31, issue 15, Sep. 25, 2008, (27 pgs.)Retrieved on Jul. 26, 2010 from the Internet at http://www.sciencedirect.com/science?—ob=ArticleURL&—udi=B6TYP-4SXYG00-3&—user=10&—coverDate=09%2F25%2F2008&—rdoc=1&—fmt=high&—orig=search&—sort=d&—docanchor=&view=c&—searchStrld=1412544378&—rerunOrigin=scholar.google&—acct=C000050221&—version=1.&—urlVersion=0.
Yuan, S., et al., “Digital Watermarking-Based Authentication Techniques for Real-Time Multimedia Communication” Dec. 9, 2005, Retrieved from the internet at: http://deposit.ddb.de/cgi-bin/dokserv?idn=980187419&dok—var=d1&dok—ext=pdf&filename=980187419.pdf, (109 pgs.).
Zhang, “Design and Implementation of an Optical Code Division Multiple Acess System Combined with Dense Wavelength Division Multiplexing,” retrieved from Internet: http://.inue.unistuttgart.de/publications/pub—2003/zhang—dissertation.pdf, Dec. 5, 2003, 133 pages.
Zhao et al., “Joint Rate and Power Adaption for Radio Resource Management in Uplink Wideband Code Division Multiple Access Systems,” Institution of Engineering and Techonology (IET) Communications, vol. 2, No. 4, pp. 562-572, [Retrieved on Feb. 25, 2009], Retrieved from the Internet <URL: http://ieeexplore.ieee.org/Xplore/login.jsp?url=?iel5/4105970/4493358.pdf?arnumber=4493358>, Jan. 2007.
Zhao, Y., “Mobile Phone Location Determination and Its Impact on Intelligent Transportation Systems.” In: IEEE Transactions on Intelligent Transportation Systems [online], vol. 1, No. 1, Mar. 2000, p. 55-64, [retrieved on Nov. 20, 2008]. Retrieved from the Internet: <URL: http://www.ss.fpp.edu/˜fdimc/laboratorijsk—vaje/Inteligentni—transportni—sistemi/Literature—za—sirjenje—obzorja/ITS—mobile—phone—location—determination.pdf>.
Third Office Action issued on Chinese Application 201080021870.7, issued Jun. 2, 2015.
Office Action issued on Canadian Application 2718433, mailed Sep. 30, 2015.
Preliminary Rejection (English Translation) issued on Korean Application 10-2011-7024701, mailed Oct. 10, 2015.

Related Publications (1)

	Number	Date	Country
	20150208247 A1	Jul 2015	US

Continuations (3)

	Number	Date	Country
Parent	13745567	Jan 2013	US
Child	14672594		US
Parent	13572909	Aug 2012	US
Child	13745567		US
Parent	12408538	Mar 2009	US
Child	12647756		US

Continuation in Parts (1)

	Number	Date	Country
Parent	12647756	Dec 2009	US
Child	13572909		US

Combined unique gold code transmissions

Information

Patent Number

Date Filed

Date Issued

Inventors

Original Assignees

Examiners

Agents

CPC

Field of Search

US

CPC

International Classifications

Abstract