Method and apparatus for providing variable rate data in a communications system using non-orthogonal overflow channels
Claim Score by NHIP
Abstract
A variable rate transmission system where a packet of variable rate data is transmitted on a traffic channel if the capacity of the traffic channel is greater than or equal to the data rate of the packet. When the rate of the packet of variable rate data exceeds the capacity of the traffic channel, the packet is transmitted on a traffic channel and at least one overflow channel. Also described is a receiving system for receiving and reassembling the data transmitted on the traffic channel and at least one additional overflow channel.

Term
Term ended
Projected expiry passed 28 August 2015, 11.1 years ago.
- Priority
- Filed
- Published
- Projected expiry
- Today
10 claims: 3 independent, 7 dependent
- 1Broadest claimClaim Score 70, broad(NHIP)A system for receiving variable rate packets of data symbols comprising;a traffic demodulator having an input and having an output;an overflow demodulator having an input and having an output;and a combiner having a first input coupled to said traffic demodulator output and having a second input coupled to said overflow demodulator output and having an output for producing estimates of ones of said variable rate packets received by said system which include in excess of a predefined number of data symbols.
- 2In a system in which users communicate information over traffic channels, an apparatus for transmitting variable rate packets of data symbols over at least one of said traffic channels, said apparatus comprising:channel packetizer means for receiving said variable rate packets and for dividing each of said variable rate packets which include more than a threshold number of said data symbols into a traffic packet and at least one overflow packet;transmission means for transmitting ones of said variable rate packets which include less than said threshold number of data symbols over a first of said traffic channels, and for transmitting each said traffic packet on said first of said traffic channels and each said at least one overflow packet on at least one overflow channel, said transmission means including modulator means for modulating each said traffic packet using a first modulation sequence associated with said first traffic channel;and wherein said first modulation sequence is orthogonal to other modulation sequences associated with other of said traffic channels.
- 4In a system in which users communicate information over traffic channels, an apparatus for transmitting variable rate packets of data symbols over at least one of said traffic channels, said apparatus comprising:a channel packetizer configured to receive said variable rate packets and to divide each of said variable rate packets which include more than a threshold number of said data symbols into a traffic packet and at least one overflow packet;a transmitter configured to ones of said variable rate packets which include less than said threshold number of data symbols over a first of said traffic channels, and for transmitting each said traffic packet on said first of said traffic channels and each said at least one overflow packet on at least one overflow channel, said transmitter further comprising a modulator configured to modulate each said traffic packet using a first modulation sequence associated with said first traffic channel;and wherein said first modulation sequence is orthogonal to other modulation sequences associated with other of said traffic channels.
Independent claims3
57 paragraphs in 5 sections, as filed
CROSS-REFERENCE TO RELATED APPLICATIONS
0001This application is a continuation of U.S. patent application Ser. No. 09/851,655 filed May 9, 2001 which is a continuation of U.S. patent application Ser. No. 08/937,052, filed Sep. 24, 1997, issued, which is a continuation of U.S. Pat. No. 5,777,990, issued Jul. 7, 1998, which is a continuation of U.S. patent application Ser. No. 08/395,960, filed Feb. 25, 1995, abandoned (assigned to the same assignee as the present invention), which are incorporated herein by reference.
BACKGROUND OF THE INVENTION
0002I. Field of the Invention
0003The present invention relates to communications. More particularly, the present invention relates to a novel and improved communication system, wherein a user transmits variable-rate data on an allocated traffic channel, but when the user's variable transmission exceeds the capacity of the allocated traffic channel, the user is provided temporary use of an overflow channel to use with the allocated traffic channel in order to transmit the high-rate data.
0004II. Description of the Related Art
0005The use of code division multiple access (CDMA) modulation techniques is one of several techniques for facilitating communications in which a large number of system users are present. Other multiple access communication system techniques, such as time division multiple access (TDMA), frequency division multiple access (FDMA) and AM modulation schemes such as amplitude companded single sideband (ACSSB) are known in the art. However, the spread spectrum modulation technique of CDMA has significant advantages over these modulation techniques for multiple access communication systems. The use of CDMA techniques in a multiple access communication system are disclosed in U.S. Pat. No. 4,901,307, entitled, “SPREAD SPECTRUM MULTIPLE ACCESS COMMUNICATION SYSTEM USING SATELLITE OR TERRESTRIAL REPEATERS,” assigned to the assignee of the present invention, of which the disclosure thereof is incorporated by reference. The use of CDMA techniques in a multiple access communication system is further disclosed in U.S. Pat. No. 5,103,459, entitled, “SYSTEM AND METHOD FOR GENERATING SIGNAL WAVEFORMS IN A CDMA CELLULAR TELEPHONE SYSTEM,” assigned to the assignee of the present invention, of which the disclosure thereof is incorporated by reference.
0006The method and apparatus for the generation of a pseudorandom noise (PN) signal that is well suited for CDMA applications is disclosed in U.S. Pat. No. 5,228,054 issued Jul. 13, 1993, entitled, “POWER-OF-TWO LENGTH PSEUDO-NOISE SEQUENCE GENERATOR WITH FAST OFFSET ADJUSTMENT,” assigned to the assignee of the present invention, of which the disclosure thereof is incorporated by reference.
0007CDMA by its inherent nature of being a wideband signal offers a form of frequency diversity by spreading the signal energy over a wide bandwidth. Therefore, frequency selective fading affects only a small part of the CDMA signal bandwidth. Space or path diversity is obtained by providing multiple signal paths through simultaneous links from a mobile user through two or more cell-sites. Furthermore, path diversity may be obtained by exploiting the multipath environment through spread spectrum processing by allowing a signal arriving with different propagation delays to be received and processed separately. Examples of path diversity are illustrated in copending U.S. Pat. No. 5,101,501, entitled, “SOFT HANDOFF IN A CDMA CELLULAR TELEPHONE SYSTEM,” and copending U.S. Pat. No. 5,109,390, entitled, “DIVERSITY RECEIVER IN A CDMA CELLULAR TELEPHONE SYSTEM,” both assigned to the assignee of the present invention and incorporated by reference herein.
0008An additional technique that may be used to increase the efficiency of the allocation of the communication resource is to allow the users of the resource to provide data at varying rates thereby using only the minimum amount of the communication resource to meet their service needs. An example of a variable rate data source is a variable rate vocoder, which is detailed in U.S. Pat. No. 5,414,796, issued May 9, 1995, entitled, “VARIABLE RATE VOCODER,” assigned to the assignee of the present invention and incorporated herein by reference. Since speech inherently contains periods of silence, i.e. pauses, the amount of data required to represent these periods can be reduced. Variable rate vocoding most effectively exploits this fact by reducing the data rate for these periods of silence.
0009In a variable rate vocoder of the type described in aforementioned U.S. Pat. No. 5,414,796, approximately 40% of the speech packets are coded at full rate. In the vocoder described in the patent application, the encoding rate is selected in accordance with the packet energy. When the packet energy exceeds a full rate threshold the speech is coded at full rate. In U.S. patent application Ser. No. 08/288,413, entitled, “IMPROVED METHOD AND APPARATUS FOR SELECTING AN ENCODING RATE IN A VARIABLE RATE VOCODER,” assigned to the assignee of the present invention and incorporated herein by reference, a method for determining based on characteristics of the speech packet if some of the packets to be coded at full rate can be coded at a lower rate without sacrificing perceived quality.
0010A variable rate speech encoder provides speech data at full rate when the talker is actively speaking, thus using the full capacity of the transmission packets. When a variable rate speech coder is providing speech data at a less that maximum rate, there is excess capacity in the transmission packets. A method for transmitting additional data in transmission packets of a fixed, predetermined size, wherein the source of the data for the data packets is providing the data at a variable rate is described in detail in copending U.S. Pat. No. 5,504,773, issued Apr. 2, 1996, entitled “METHOD AND APPARATUS FOR THE FORMATTING OF DATA FOR TRANSMISSION,” assigned to the assignee of the present invention, of which the disclosure thereof is incorporated by reference herein. In the above-mentioned patent application a method and apparatus is disclosed for combining data of differing types from different sources in a data packet for transmission.
SUMMARY OF THE INVENTION
0011A communications resource is typically divided into communications channels. Typically, each of these channels has the same capacity. A communications system could re-allocate the channels to the users for each transmission. This would theoretically allow for a maximally efficient allocation of the communication resource because each user would be using only the amount of the resource absolutely necessary. However, this technique would result in unacceptable complexity in the resulting receiver and transmitter design.
0012In the present invention, an efficient method of transmitting and receiving variable rate data is disclosed. In the present invention, each user is provided with a voice or data channel, also referred to as a traffic channel, specifically allocated for that user. In addition, each user is provided with selective access to a pool of overflow channels that are for use by all users of the communications resource. If a user needs to transmit at a rate higher than the capacity of the allocated traffic channel then the user transmits the information using both the allocated traffic channel and an overflow channel.
0013In the exemplary embodiment, the communication system is a code division multiple access (CDMA) communication system as is described in detail in the aforementioned U.S. Pat. Nos. 4,901,307 and 5,103,459. In the exemplary embodiment each of the traffic channels are orthogonal to one another. Each traffic channel is spread by a unique Walsh sequence that is orthogonal to the other Walsh sequences. The spread signals are then spread by pseudorandom noise (PN) sequences and then transmitted.
0014In the exemplary embodiment, the overflow channels are not provided with unique orthogonal Walsh spreading sequences, because this would decrease system capacity. Instead, the system spreads the overflow channel portion of the information by a Walsh sequence that is not unique from those used in spreading the traffic channels. This portion is then spread by a PN sequence. The PN sequence is unique from the PN sequence used to spread the traffic channel of the same Walsh sequence. In the exemplary embodiment the traffic channel and the overflow channel use, although not necessarily, the same Walsh spreading sequence.
0015In the exemplary embodiment, the receiver continuously monitors both the traffic channel and the overflow channel. If the receiver determines that information is being transmitted on both the traffic channel and an overflow channel then the receiver decodes both portions of the message, combines the portions and provides the decoded message to the user. In an alternative embodiment, the receiver need not continuously monitor the overflow channel, but rather only monitors the overflow channel when instructed by information on the traffic channel that directs the receiver to monitor the overflow channel.
BRIEF DESCRIPTION OF THE DRAWINGS
0016The features, objects, and advantages of the present invention will become more apparent from the detailed description set forth below when taken in conjunction with the drawings in which like reference characters identify correspondingly throughout:
0017<figref idref="DRAWINGS">FIG. 1</figref> is a diagram illustrating an exemplary implementation of the present invention in a satellite communication system;
0018<figref idref="DRAWINGS">FIGS. 2</figref><i>a</i>-<b>2</b><i>d </i>are an illustration of exemplary transmission packet structures of the exemplary embodiment;
0019<figref idref="DRAWINGS">FIGS. 3</figref><i>a</i>-<b>3</b><i>e </i>are an illustration of the symbol repetition in a transmission packet and the transmission energy level of the packet;
0020<figref idref="DRAWINGS">FIG. 4</figref> is a block diagram of the transmission system of the present invention; and
0021<figref idref="DRAWINGS">FIG. 5</figref> is a block diagram of a receiver system of the present invention.
DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS
0022A multiple access communication resource is divided into parcels referred to as channels. This division is called multiplexing. Three specific types of multiplexing are frequency division multiplexing (FDM), time division multiplexing (TDM), and code division multiplexing (CDM). The basic unit of information transmitted and received in a communication system is referred to as a packet.
0023Referring now to the figures, <figref idref="DRAWINGS">FIG. 1</figref> illustrates the exemplary implementation of the present invention. In <figref idref="DRAWINGS">FIG. 1</figref>, the present invention is implemented in a satellite communications network. It should be understood that the present invention may be utilized in a terrestrial-based system, such as one where base stations are used to communicate with remote stations. The network is used to communicate information to a remote user station or terminal <b>2</b> from gateway <b>8</b> via satellites <b>4</b> and <b>6</b>, which may be either geosynchronous or low earth orbit (LEO) types. User terminal <b>2</b> may be a mobile station, such as a portable telephone or other portable or mobile communications device, or user terminal <b>2</b> may be a fixed communications device, such as a wireless local loop terminal or a central communications center, such as a cellular base station. Although only two satellites, a single user terminal, and a single gateway are shown in <figref idref="DRAWINGS">FIG. 1</figref> for ease in illustration, a typical system may contain a plurality of all.
0024In the exemplary embodiment, satellites <b>4</b> and <b>6</b> are transponders or non-regenerative repeaters that simply amplify and re-transmit the signal received from gateway <b>8</b>. The present invention is equally applicable to cases where satellites <b>4</b> and <b>6</b> are regenerative repeaters that demodulate and reconstitute the signal prior to re-transmission. In the exemplary embodiment, the signal transmitted from gateway <b>8</b> to satellites <b>4</b> and <b>6</b> is a spread spectrum signal. In addition, the signals transmitted from satellites <b>4</b> and <b>6</b> to user terminal <b>2</b> are spread spectrum communications signals. The generation of spread spectrum communications signals is described in detail in the aforementioned U.S. Pat. Nos. 4,901,307 and 5,103,459.
0025Gateway <b>8</b> serves as an interface from a communication network to the satellites <b>4</b> and <b>6</b>, or directly to terrestrial base stations (a configuration not shown). Gateway <b>8</b> is typically a central communications center that receives data via a network (not shown), which may include public switching telephone networks (PSTN) and networks specifically designed for the communications of the present invention. Gateway <b>8</b> may be connected to the network (not shown) by wireline communications or by means of an air interface. Gateway <b>8</b> provides the data received from the network via satellites <b>6</b> and <b>8</b> to user terminal <b>2</b>. Similarly, gateway <b>8</b> provides data received from user terminal <b>2</b> via satellites <b>4</b> and <b>6</b> to the network.
0026In the exemplary embodiment, the communications network transmits variable rate data from gateway <b>8</b> to user terminal <b>2</b>. A variable rate communication system communicates data where the rate of the data communicated varies with time. In the exemplary embodiment, the communications resource is divided into channels. In the exemplary embodiment, each channel has the same capacity.
0027In the exemplary embodiment gateway <b>8</b> communicates to user terminal <b>2</b> at one of four different information data rates. These data rates, ordered from lowest rate to highest rate, are referred to, as eighth rate, quarter rate, half rate and full rate. In the exemplary embodiment, a single traffic channel has adequate capacity to carry the packet of all rates except full rate, which requires a traffic and an overflow channel. In the exemplary embodiment, a traffic channel can carry packets of 96 bits or less. Half rate, quarter rate and eighth rate packets consist of 96, 48 and 24 bits, respectively. A full rate packet consists of 192 bits and so requires a traffic channel plus an overflow channel of equal capacity.
0028The present invention is easily extendible to cases where there are more or less than four rates, where the channels can carry data at a lesser subset of the possible rates, or where the highest rate requires more than two channels. The communications system of the present invention can communicate both fixed rate data and variable rate data. In the communication of fixed rate data a channel or set of channels is to be allocated for the duration of the service being provided.
0029In the exemplary embodiment, the channels are designated into two groups. A first group of channels is the traffic channel group. Users are allocated traffic channels or sets of traffic channels specifically for their use for the duration of service. In the exemplary embodiment, all traffic channels are orthogonal to one another. In the exemplary embodiment this orthogonality is attained by allocating a unique Walsh sequence to each user, as is described in detail in the aforementioned U.S. Pat. Nos. 4,901,307 and 5,103,459. The information packets are spread, i.e., combined, with an orthogonal function sequence, typically, a Walsh sequence, then the Walsh spread packet is mixed, i.e., spread spectrum processed with a pseudorandom noise (PN) sequence. Further details on the spread spectrum modulation of the information packets are provided in the aforementioned U.S. Pat. Nos. 4,901,307 and 5,103,459.
0030Overflow channels are not provided with unique orthogonal or Walsh sequences and, as such, are not assured of being orthogonal to all traffic channels. However, the PN sequence which is mixed with the spread packet is unique, so all other packets will appear as noise to the decoder of the overflow channel and the overflow channel information can be distinguished from all traffic channel information.
0031Table 1 below illustrates the numerology used in the exemplary embodiment of the present invention. <tables id="TABLE-US-00001" num="1"><table frame="none" colsep="0" rowsep="0"><tgroup align="left" colsep="0" rowsep="0" cols="1"><colspec colname="1" colwidth="217PT" align="center" /><thead><row><entry namest="1" nameend="1" align="center">TABLE 1</entry></row></thead><tbody valign="top"><row><entry /></row><row><entry namest="1" nameend="1" align="center" rowsep="1" /></row><row><entry>EXEMPLARY NUMEROLOGY OF</entry></row><row><entry>THE PRESENT INVENTION</entry></row></tbody></tgroup><tgroup align="left" colsep="0" rowsep="0" cols="2"><colspec colname="1" colwidth="182PT" align="left" /><colspec colname="2" colwidth="35PT" align="left" /><tbody valign="top"><row><entry>Parameter</entry><entry>Units</entry></row><row><entry namest="1" nameend="2" align="center" rowsep="1" /></row></tbody></tgroup><tgroup align="left" colsep="0" rowsep="0" cols="6"><colspec colname="1" colwidth="42PT" align="left" /><colspec colname="2" colwidth="35PT" align="char" char="." /><colspec colname="3" colwidth="35PT" align="char" char="." /><colspec colname="4" colwidth="35PT" align="char" char="." /><colspec colname="5" colwidth="35PT" align="char" char="." /><colspec colname="6" colwidth="35PT" align="left" /><tbody valign="top"><row><entry>Data Rate</entry><entry>8600</entry><entry>4000</entry><entry>1700</entry><entry>800</entry><entry>bps</entry></row><row><entry>PN Chip</entry><entry>1.2288</entry><entry>1.2288</entry><entry>1.2288</entry><entry>1.2288</entry><entry>Mcps</entry></row><row><entry>Rate</entry></row><row><entry>Code Rate</entry><entry>1/2</entry><entry>1/2</entry><entry>1/2</entry><entry>1/2</entry><entry>bits/code</entry></row><row><entry /><entry /><entry /><entry /><entry /><entry>symbol</entry></row><row><entry>Code</entry><entry>1</entry><entry>1</entry><entry>2</entry><entry>4</entry><entry>mod sym/</entry></row><row><entry>Repetition</entry><entry /><entry /><entry /><entry /><entry>code sym</entry></row><row><entry>No. of</entry><entry>2</entry><entry>1</entry><entry>1</entry><entry>1</entry></row><row><entry>Channels</entry></row><row><entry>Modulation</entry><entry>BPSK</entry><entry>BPSK</entry><entry>BPSK</entry><entry>BPSK</entry></row><row><entry namest="1" nameend="6" align="center" rowsep="1" /></row></tbody></tgroup></table></tables><br /> The present invention is equally applicable to other numerologies.
0032<figref idref="DRAWINGS">FIG. 4</figref> illustrates the transmission system of the present invention. Input data for transmission is provided to variable rate data source <b>50</b>. Variable rate data source <b>50</b> provides the variable rate data to encoder <b>52</b>. In the exemplary embodiment, variable rate data source <b>50</b> provides data at four different rates referred to as full rate, half rate, quarter rate and eighth rate. In the exemplary embodiment, full rate is 8.6 kbps and provides packets of 172 bits, half rate is 4 kbps and provides packets of 80 bits, quarter rate is 1.7 kbps and provides packets of 34 bits, and eighth rate is 800 bps and provides packets of 16 bits.
0033The exemplary embodiment of variable rate data source <b>50</b> is a variable rate vocoder as described in the aforementioned U.S. Pat. No. 5,414,796. In the exemplary variable rate vocoder, the energy of a packet of speech data is measured and compared to a set of threshold values, which determine the encoding rate. The aforementioned U.S. patent application Ser. No. 08/288,413 teaches of methods that minimize the number of packets encoded at full rate with minimum impact on perceptual quality.
0034Variable rate data source <b>50</b> encodes the input data and provides it at one of the predetermined rates. In the exemplary embodiment, a traffic channel is capable of carrying packets encoded at or below half rate. When a packet of data is encoded by variable rate data source <b>50</b> at full rate, then the packet must be transmitted using both a traffic channel and an overflow channel.
0035The data packet provided by variable rate data source <b>50</b> is provided to encoder <b>52</b>. In the exemplary embodiment, encoder <b>52</b> generates a set of redundant bits in accordance with error correction and detection methods that are well known in the art. In the exemplary embodiment, the redundant bits are cyclic redundancy check (CRC) bits, the generation of which is well known in the art, and is detailed in the aforementioned U.S. Pat. No. 5,504,773.
0036<figref idref="DRAWINGS">FIGS. 2</figref><i>a</i>-<i>d </i>illustrate the packet structures of the exemplary embodiment. <figref idref="DRAWINGS">FIG. 2</figref><i>a </i>illustrates the packet structure of a full rate packet consisting of 172 information bits followed by 12 redundant bits and then by 8 tail bits. <figref idref="DRAWINGS">FIG. 2</figref><i>b </i>illustrates the packet structure of a half rate packet consisting of 80 information bits followed by 8 redundant bits and then by 8 tail bits. <figref idref="DRAWINGS">FIG. 2</figref><i>c </i>illustrates the packet structure of a quarter rate packet consisting of 34 information bits followed by 6 redundant bits and then by 8 tail bits. <figref idref="DRAWINGS">FIG. 2</figref><i>d </i>illustrates the packet structure of an eighth rate packet consisting of 16 information bits followed by 8 tail bits.
0037Referring back to <figref idref="DRAWINGS">FIG. 4</figref>, encoder <b>52</b> then encodes the formatted packet for error detection and correction as is well known in the art. In the exemplary embodiment, encoder <b>52</b> encodes the formatted packet in accordance with a rate 1/2 convolutional code. Encoder <b>52</b> provides the encoded packet to interleaver <b>54</b>.
0038Interleaver <b>54</b> interleaves the binary symbols of the encoded packet in accordance with a predetermined interleaver format. In the exemplary embodiment, interleaver <b>54</b> is a block interleaver. In addition, interleaver <b>54</b> provides redundancy in the packets such that each interleaved packet consists of the same number of binary symbols as described below.
0039Referring to <figref idref="DRAWINGS">FIGS. 3</figref><i>a</i>-<b>3</b><i>e </i>in conjunction with <figref idref="DRAWINGS">FIG. 4</figref>, interleaver <b>54</b> interleaves the binary symbols of the packet, then groups the reordered binary symbols into power control groups. <figref idref="DRAWINGS">FIGS. 3</figref><i>a </i>and <b>3</b><i>b </i>illustrate a full rate packet organized into a packet format. Because a full rate packet of a transmission packet requires two channels, the first portion of the packet illustrated in <figref idref="DRAWINGS">FIG. 3</figref><i>a </i>is organized into a traffic packet and transmitted on the traffic channel. The second portion of the full rate packet as illustrated in <figref idref="DRAWINGS">FIG. 3</figref><i>b </i>is organized into an overflow packet and transmitted on an overflow channel. For the full rate packet interleaver <b>54</b> does not provide symbol repetition. Since the symbol data fills the traffic channel and the overflow channel packet. In the exemplary embodiment, each power control group consists of 12 binary symbols. <figref idref="DRAWINGS">FIG. 3</figref><i>c </i>illustrates a half rate packet organized into a packet format. Note that because transmission of the half rate packet utilizes the full capacity of the traffic channel packet, there is no symbol repetition provided in the packet. <figref idref="DRAWINGS">FIG. 3</figref><i>d </i>illustrates a quarter rate packet organized into a packet format, in which each symbol is provided twice. <figref idref="DRAWINGS">FIG. 3</figref><i>e </i>illustrates an eighth rate packet organized into packet format, in which each symbol is provided four times.
0040Referring again to <figref idref="DRAWINGS">FIG. 4</figref>, the interleaved packet is provided by interleaver <b>54</b> to de-multiplexer <b>56</b>, which operates in accordance with a rate signal provided by variable rate data source <b>50</b>. If the packet is such that it can be carried on the traffic channel without need of an overflow channel, then the interleaved packet is provided through de-multiplexer (DE-MUX) <b>56</b> without any change to modulator <b>57</b>. If, on the other hand, the packet requires use of an overflow channel for transmission, then de-multiplexer <b>56</b> splits the packet into two portions. The de-multiplexed packet is provided by de-multiplexer <b>56</b> to modulator <b>57</b>. Buffering may be added to ensure two portions are simultaneously provided to modulator <b>57</b>.
0041In the exemplary embodiment, if the packet is of a rate less than full rate, then the entire packet is provided to combining element <b>58</b>, which in the exemplary embodiment is a digital multiplier modulo <b>2</b> adder or exclusive or gate. The interleaved packet is spread by an orthogonal function W<sub>i</sub>, as is described in detail in the aforementioned U.S. Pat. No. 5,103,459. In the exemplary embodiment, orthogonal function W<sub>i </sub>is a Walsh function the selection of which is detailed in the aforementioned U.S. Pat. No. 5,103,459. In the exemplary embodiment, each Walsh sequence, W<sub>i</sub>, is uniquely provided for use by User (i).
0042The orthogonal function spread packet from element <b>58</b> is provided to quadrature spreading elements <b>62</b> and <b>64</b> which are employed as digital multipliers modulo <b>2</b> adder or exclusive or gates. The orthogonal function spread packet is spread in quadrature spreading elements <b>62</b> and <b>64</b> by pseudorandom noise (PN) functions PN<sub>I </sub>and PN<sub>Q</sub>, respectively. PN<sub>I </sub>and PN<sub>Q </sub>are generated by traffic PN generator <b>63</b>. In the exemplary embodiment, the pseudorandom noise signals are generated by a maximal shift register where the PN sequence is determined by the temporal offset of the register. The design and implementation of such registers is described in detail in the aforementioned copending U.S. Pat. No. 5,228,054. The quadrature spread packets are provided from quadrature spreading elements <b>62</b> and <b>64</b> to transmitter <b>72</b>.
0043Transmitter <b>72</b> converts the signal to analog form, frequency up-converts and amplifies the signal for transmission transmitter <b>72</b> amplifies the signal in accordance with the rate of the packet. The relationship between the necessary transmission energy and the amount of repetition is illustrated in <figref idref="DRAWINGS">FIGS. 3</figref><i>a</i>-<b>3</b><i>e</i>. When a redundancy is present in a packet, the packet can be transmitted at a lower energy with redundant portions combined at the receiver. In a full rate packet, both the packet on the traffic channel (traffic packet) <figref idref="DRAWINGS">FIG. 3</figref><i>a </i>and the packet transmitted on the overflow channel (overflow packet) <figref idref="DRAWINGS">FIG. 3</figref><i>b </i>are transmitted at a maximum bit energy E. In <figref idref="DRAWINGS">FIG. 3</figref><i>c</i>, there is no repetition in the half rate packet so the packet is also provided at energy level E. In <figref idref="DRAWINGS">FIG. 3</figref><i>d</i>, there is a repetition rate of two so the packet is provided at half the packet energy of the half rate packet or E/2. In <figref idref="DRAWINGS">FIG. 3</figref><i>e</i>, there is a repetition rate of four so the packet is provided at a quarter of the packet energy of the half rate packet or E/4. Transmitter <b>72</b> amplifies and up-converts the signal and provides it to antenna <b>74</b> for broadcast to a receiver.
0044In the case where a packet requires use of an overflow channel for transmission that is the packet is a full rate packet, then de-multiplexer <b>56</b> splits the interleaved packet into two halves and provides a first half to combining element <b>58</b> and a second half of the packet to combining element <b>60</b>, which is also embodied as a digital multiplier, modulo <b>2</b> adder or an exclusive-or gate. The modulation of the first half of the packet proceeds as described previously for packets of less than full rate. The modulation of the second half of the packet is the same except that the spreading functions are different.
0045Now turning to the specifics of the modulation process of modulator <b>57</b>, it should be noted that a spread spectrum communication system is primarily limited in capacity by the number of unique orthogonal functions or in the exemplary embodiment Walsh functions available. If one allocates a subset of these functions for the purpose of modulating the overflow channels, then the capacity of the system is reduced.
0046In the present invention, all of the traffic channels are orthogonal to one another because each is modulated by a unique Walsh function (W<sub>i</sub>) or Walsh code sequence. However, the Walsh functions provided for modulation of the overflow channel (W<sub>j</sub>) will overlap those allocated for modulation of the traffic channel and so are not orthogonal to the traffic channels. In the exemplary embodiment, W<sub>i </sub>is the same Walsh function as W<sub>j</sub>. That is, the same Walsh code function spreads the traffic channel portion of the packet as it spreads the overflow portion of the packet. The two signals are distinguished from one another by subsequent PN code sequence spreading.
0047The spread packet from combining element <b>60</b> is provided to quadrature spreading elements <b>66</b> and <b>68</b>, which may be embodied as digital multipliers, modulo <b>2</b> adders, or exclusive-or gates. Quadrature spreading elements <b>66</b> and <b>68</b> spread the packet from spreading element <b>60</b> in accordance with pseudorandom noise functions PN<sub>I′</sub> and PN<sub>Q′</sub>. Pseudorandom noise functions PN<sub>I′</sub> and PN<sub>Q′</sub> are generated by overflow PN generator <b>67</b>. In the exemplary embodiment, pseudorandom noise functions PN<sub>I′</sub> and PN<sub>Q′</sub> are generated in the same manner as pseudorandom noise functions PN<sub>I </sub>and PN<sub>Q</sub>, but are unique due to different temporal offsets in the code sequences.
0048In a first exemplary embodiment, pseudorandom noise functions PN<sub>I </sub>and PN<sub>Q </sub>and pseudorandom noise functions PN<sub>I′</sub> and PN<sub>Q′</sub> are short codes. A short code is a code in which the number of sequences generated is relatively few. In the exemplary embodiment, the PN generator provides a bit stream that is periodic with a period of 2<sup>15 </sup>PN chips. The benefit of this implementation is that it allows a faster acquisition at the receiver. In an alternative embodiment, pseudorandom noise functions PN<sub>I </sub>and PN<sub>Q </sub>are short codes, but pseudorandom noise functions PN<sub>I′</sub> and PN<sub>Q′</sub> are long codes. This has the potential of advantage of greater separation in code space, while allowing the mobile to acquire using the demodulation of the first subpacket modulated by the short code.
0049The modulated overflow packet from quadrature spreading elements <b>66</b> and <b>68</b>, as well as the modulated traffic packet from quadrature spreading elements <b>62</b> and <b>64</b> are provide to transmitter <b>72</b>. Transmitter up-converts and amplifies the signal and provides the signal to antenna <b>74</b> for broadcast. The subpackets are transmitted with energy E as illustrated in <figref idref="DRAWINGS">FIGS. 3</figref><i>a </i>and <b>3</b><i>b </i>(vertical axis).
0050<figref idref="DRAWINGS">FIG. 5</figref> illustrates the receiver system of the present invention. The transmitted signal is received at antenna <b>100</b> and provided to receiver <b>102</b>. Receiver <b>102</b> down converts and amplifies the signal and provides the signal in its two components I and Q to overflow channel despreading element (OVERFLOW DESPREADER) <b>104</b> and to traffic channel despreading element (TRAFFIC DESPREADER) <b>120</b>. In the exemplary embodiment, the I component and the Q component of the received signal carry the same data, which allows for a higher quality reception. In an alternative embodiment, the I and Q components could carry different data which would allow for higher data rate. In the exemplary embodiments, despreaders <b>104</b> and <b>120</b> are configured as QPSK despreading circuits as are well known in the art.
0051The received signal is provided to traffic channel despreading element (TRAFFIC DESPREADER) <b>120</b>, which despreads the signal in accordance with the traffic channel pseudorandom noise codes PN<sub>I </sub>and PN<sub>Q</sub>. Traffic PN generator <b>119</b> generates the PN<sub>I </sub>and PN<sub>Q </sub>sequences. In the exemplary embodiment, the PN sequences are generated by a shift register with appropriate feedback. The despreading process involves digitally multiplying the signal by the traffic channel pseudorandom noise codes PN<sub>I </sub>and PN<sub>Q</sub>. This process is described in detail in the aforementioned U.S. Pat. Nos. 4,901,307 and 5,103,459. Similarly, the received signal is provided to overflow channel despreading element (OVERFLOW DESPREADER) <b>104</b>, which despreads the signal in accordance with the overflow channel pseudorandom noise codes PN<sub>I′</sub> and PN<sub>Q′</sub>. Overflow PN generator <b>103</b> generates the PN<sub>I′</sub> and PN<sub>Q′</sub> sequences. In the exemplary embodiment, the PN sequences are generated by a shift register with appropriate feedback. In the exemplary embodiment, the two generators are identical except that they are offset from one another temporally, which means that the traffic PN sequences and the overflow PN sequences will be unique from one another.
0052The despread signal is then provided to demodulation elements <b>105</b> and <b>121</b>. Demodulation element <b>121</b> receives the traffic channel despread I and Q values and demodulates the signal. The demodulation process is illustrated by the digital multiplication of the signal by the Walsh function W<sub>i </sub>in multipliers <b>122</b> and <b>124</b> then the accumulation of the multiplied signal in accumulators <b>126</b> and <b>128</b>. Similarly, the demodulation of the overflow channel is illustrated by the digital multiplication by the Walsh function W<sub>j </sub>in multipliers <b>106</b> and <b>110</b>, then the accumulation of the multiplied signal in accumulators <b>108</b> and <b>112</b>.
0053The demodulated signal is provided by traffic demodulator <b>121</b> to combiner element <b>130</b> and by overflow demodulator <b>105</b> to combiner element <b>114</b>. The combiner elements combine received and despread data estimates from despreaders <b>105</b> and <b>121</b> with data estimates from other receiver/despreader/demodulators demodulated fingers (not shown) that are simultaneously being tracked by the receiver system. These other estimates take advantage of the delayed signals resulting from multipath signals to provide an improved signal estimate. The design and implementation of combiner elements are described in detail in the aforementioned U.S. Pat. Nos. 5,101,501 and 5,109,390.
0054The combiners combine the signals based upon the values of the data and the relative strengths of the signals and provide combined estimates to de-interleaving element (DE-INT) <b>116</b>. De-interleaving element <b>116</b> re-orders the combined estimates of the data in accordance with a predetermined ordering format and provides the reordered data to decoder (DECODE) <b>118</b>. Decoder <b>118</b> decodes the data in accordance with a predetermined decoding format. In the exemplary embodiment, decoder <b>118</b> is a Viterbi decoder of constraint length <b>7</b>. The decoded packet is then provided to the receiver system user.
0055In an improved embodiment of the communication system of the present invention, an alternative modulation and demodulation process is provided for when system usage is low. When system usage is low, each user is provided use of one of the unique Walsh sequences for communication of its overflow data. That is, W<sub>i </sub>and W<sub>j </sub>are different so the traffic and overflow signals are orthogonal to one another. In the exemplary embodiment, W<sub>i </sub>and W<sub>j </sub>are separated by a fixed offset from one another so that the receiver knows which Walsh sequence to use to demodulate the overflow signal. In the exemplary embodiment of a communication system of 128 unique Walsh sequences, when usage is low, each user is allocated a traffic channel designated by Walsh sequence W<sub>i </sub>and uses an overflow channel designated by Walsh sequence W<sub>j</sub>=W<sub>i</sub>+64.
0056When system usage rises so that the system can no longer accommodate this many unique overflow channels, that is 65 or more users, then the system transmitter will send signaling information to the receiver indicating that the overflow communications will be conducted as described previously, using the same Walsh sequence for both traffic and overflow communications. The users may be switched to the high usage mode individually as necessary or as a group.
0057The previous description of the preferred embodiments is provided to enable any person skilled in the art to make or use the present invention. The various modifications to these embodiments will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other embodiments without the use of the inventive faculty. Thus, the present invention is not intended to be limited to the embodiments shown herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.
Contents5
6 sheets
Sheet 1 Sheet 2 Sheet 3 Sheet 4 Sheet 5 Sheet 6
Every citation, both ways
| Document | Relation | Office | Cited during |
|---|---|---|---|
| US9655158B2 | Cited by | United States of America | Search report |
| US2008299963A1 | Cited by | United States of America | Pre-grant |
| US2010009623A1 | Cited by | United States of America | Pre-grant |
| US2010027547A1 | Cited by | United States of America | Pre-grant |
| US10136180B2 | Cited by | United States of America | Applicant |
| US2007067329A1 | Cited by | United States of America | Pre-grant |
| US2004120302A1 | Cited by | United States of America | Pre-grant |
| US8341679B2 | Cited by | United States of America | Search report |
| WO2008150225A1 | Cited by | World Intellectual Property Organization (WIPO) | International search |
| US2016050708A1 | Cited by | United States of America | Pre-grant |
| US9363554B2 | Cited by | United States of America | Applicant |
| US9338813B2 | Cited by | United States of America | Search report |
| US2014364137A1 | Cited by | United States of America | Pre-grant |
| US8984565B2 | Cited by | United States of America | Applicant |
| US8849752B2 | Cited by | United States of America | Search report |
| US2011299442A1 | Cited by | United States of America | Pre-grant |
| US3310631A | Cites | United States of America | Pre-grant |
| US3715508A | Cites | United States of America | Pre-grant |
| US4052565A | Cites | United States of America | Pre-grant |
| US4291409A | Cites | United States of America | Pre-grant |
| US4301530A | Cites | United States of America | Pre-grant |
| US4460992A | Cites | United States of America | Pre-grant |
| US4472815A | Cites | United States of America | Pre-grant |
| US4635221A | Cites | United States of America | Pre-grant |
| US4688035A | Cites | United States of America | Pre-grant |
| US4730340A | Cites | United States of America | Pre-grant |
| US4775987A | Cites | United States of America | Pre-grant |
| US4813040A | Cites | United States of America | Pre-grant |
| US4872200A | Cites | United States of America | Pre-grant |
| US4901307A | Cites | United States of America | Pre-grant |
| US4933952A | Cites | United States of America | Pre-grant |
| US4939745A | Cites | United States of America | Pre-grant |
| US5003533A | Cites | United States of America | Pre-grant |
| US5022046A | Cites | United States of America | Pre-grant |
| US5068849A | Cites | United States of America | Pre-grant |
| US5101501A | Cites | United States of America | Pre-grant |
| US5115429A | Cites | United States of America | Pre-grant |
| US5136586A | Cites | United States of America | Pre-grant |
| US5212684A | Cites | United States of America | Pre-grant |
| US5228054A | Cites | United States of America | Pre-grant |
| US5231649A | Cites | United States of America | Pre-grant |
| US5258983A | Cites | United States of America | Pre-grant |
| US5349580A | Cites | United States of America | Pre-grant |
| US5373502A | Cites | United States of America | Pre-grant |
| US5381412A | Cites | United States of America | Pre-grant |
| US5414796A | Cites | United States of America | Pre-grant |
| US5442625A | Cites | United States of America | Pre-grant |
| US5471497A | Cites | United States of America | Pre-grant |
| US5504773A | Cites | United States of America | Pre-grant |
| US5583851A | Cites | United States of America | Pre-grant |
| US5742734A | Cites | United States of America | Pre-grant |
| US5777990A | Cites | United States of America | Pre-grant |
| US5956088A | Cites | United States of America | Pre-grant |
| US6292476B1 | Cites | United States of America | Pre-grant |
31 members in 17 offices
Priority claims14
| Document | Office | Kind | Date |
|---|---|---|---|
| 39596095 | United States of America | A | |
| 83824097 | United States of America | A | |
| 93705297 | United States of America | A | |
| 85165501 | United States of America | A | |
| 49249906 | United States of America | A | |
| 08395960 | – | – | – |
| 08838240 | – | – | – |
| 08937052 | – | – | – |
| 09851655 | – | – | – |
| US19950395960 | – | – | – |
| US19970838240 | – | – | – |
| US19970937052 | – | – | – |
| US20010851655 | – | – | – |
| US20060492499 | – | – | – |
Members31
| Document | Office | Kind | |
|---|---|---|---|
| IL117275D0 | Israel | D0 | |
| ZA961025B | South Africa | B | |
| TW284943B | Taiwan Province of China | B | |
| CA2213998A1 | Canada | A1 | |
| WO9627250A1 | World Intellectual Property Organization (WIPO) | A1 | |
| AU5028296A | Australia | A | |
| AR000931A1 | Argentina | A1 | |
| EP0812500A1 | European Patent Office (EPO) | A1 | |
| US5777990A | United States of America | A | |
| KR19980702532A | Republic of Korea | A | |
| JPH11501178A | Japan | A | |
| HK1006247A1 | Hong Kong, China | A1 | |
| RU2150789C1 | Russian Federation | C1 | |
| IL117275A | Israel | A | |
| JP3091229B2 | Japan | B2 | |
| US6292476B1 | United States of America | B1 | |
| US2001024432A1 | United States of America | A1 | |
| KR100387158B1 | Republic of Korea | B1 | |
| EP0812500B1 | European Patent Office (EPO) | B1 | |
| AT279823T | Austria | T | |
| ATE279823T1 | Austria | T1 | |
| DE69633611D1 | Germany | D1 | |
| MY118739A | Malaysia | A | |
| ES2233966T3 | Spain | T3 | |
| DE69633611T2 | Germany | T2 | |
| US2006262756A1 | United States of America | A1 | |
| AR051034A2 | Argentina | A2 | |
| AR051109A2 | Argentina | A2 | |
| US7167460B2 | United States of America | B2 | |
| CA2213998C | Canada | C | |
| US7751371B2 | United States of America | B2 |
74 transactions on the USPTO file
Allowed after 2 non-final rejections and 2 RCEs.
- Non-final rejections
- 2
- Final rejections
- 0
- RCEs
- 2
- Appeals
- 0
Over time
Point at a mark for the transactionTransactions
| Event | Code | |
|---|---|---|
| Expire PatentEXP. | EXP. | |
| Maintenance Fee Reminder MailedREM. | REM. | |
| Recordation of Patent Grant MailedPGM/ | PGM/ | |
| Patent Issue Date Used in PTA CalculationAllowedPTAC | PTAC | |
| Email NotificationEML_NTR | EML_NTR | |
| Issue Notification MailedAllowedWPIR | WPIR | |
| Dispatch to FDCD1935 | D1935 | |
| Application Is Considered Ready for IssuePILS | PILS | |
| Issue Fee Payment VerifiedN084 | N084 | |
| Issue Fee Payment ReceivedIFEE | IFEE | |
| Electronic ReviewELC_RVW | ELC_RVW | |
| Email NotificationEML_NTF | EML_NTF | |
| Mail Notice of AllowanceAllowedMN/=. | MN/=. | |
| Notice of Allowance Data Verification CompletedAllowedN/=. | N/=. | |
| Disposal for a RCE / CPA / R129AbandonedABN9 | ABN9 | |
| Information Disclosure Statement consideredIDSC | IDSC | |
| Electronic Information Disclosure StatementEIDS. | EIDS. | |
| Request for Continued Examination (RCE)RCEX | RCEX | |
| Information Disclosure Statement (IDS) FiledWIDS | WIDS | |
| Workflow - Request for RCE - BeginBRCE | BRCE | |
| Electronic ReviewELC_RVW | ELC_RVW | |
| Email NotificationEML_NTF | EML_NTF | |
| Mail Notice of AllowanceAllowedMN/=. | MN/=. | |
| Notice of Allowance Data Verification CompletedAllowedN/=. | N/=. | |
| Date Forwarded to ExaminerFWDX | FWDX | |
| Date Forwarded to ExaminerFWDX | FWDX | |
| Disposal for a RCE / CPA / R129AbandonedABN9 | ABN9 | |
| Case Docketed to Examiner in GAUDOCK | DOCK | |
| Information Disclosure Statement consideredIDSC | IDSC | |
| Electronic Information Disclosure StatementEIDS. | EIDS. | |
| Request for Continued Examination (RCE)RCEX | RCEX | |
| Information Disclosure Statement (IDS) FiledWIDS | WIDS | |
| Workflow - Request for RCE - BeginBRCE | BRCE | |
| Electronic ReviewELC_RVW | ELC_RVW | |
| Email NotificationEML_NTF | EML_NTF | |
| Mail Notice of AllowanceAllowedMN/=. | MN/=. | |
| Notice of Allowance Data Verification CompletedAllowedN/=. | N/=. | |
| Date Forwarded to ExaminerFWDX | FWDX | |
| Response after Non-Final ActionA... | A... | |
| Request for Extension of Time - GrantedXT/G | XT/G | |
| Information Disclosure Statement consideredIDSC | IDSC | |
| Information Disclosure Statement consideredIDSC | IDSC | |
| Electronic Information Disclosure StatementEIDS. | EIDS. | |
| Information Disclosure Statement (IDS) FiledWIDS | WIDS | |
| Information Disclosure Statement (IDS) FiledWIDS | WIDS | |
| Information Disclosure Statement consideredIDSC | IDSC | |
| Information Disclosure Statement consideredIDSC | IDSC | |
| Electronic Information Disclosure StatementEIDS. | EIDS. | |
| Information Disclosure Statement (IDS) FiledWIDS | WIDS | |
| Information Disclosure Statement (IDS) FiledWIDS | WIDS | |
| Electronic ReviewELC_RVW | ELC_RVW | |
| Email NotificationEML_NTF | EML_NTF | |
| Mail Non-Final RejectionNon-final rejectionMCTNF | MCTNF | |
| Non-Final RejectionNon-final rejectionCTNF | CTNF | |
| Paralegal or electronic terminal disclaimer approvedP574 | P574 | |
| terminal disclaimer fee paidTDP | TDP | |
| Date Forwarded to ExaminerFWDX | FWDX | |
| Case Docketed to Examiner in GAUDOCK | DOCK | |
| Response after Non-Final ActionA... | A... | |
| Request for Extension of Time - GrantedXT/G | XT/G | |
| Electronic ReviewELC_RVW | ELC_RVW | |
| Email NotificationEML_NTF | EML_NTF | |
| Mail Non-Final RejectionNon-final rejectionMCTNF | MCTNF | |
| Non-Final RejectionNon-final rejectionCTNF | CTNF | |
| Case Docketed to Examiner in GAUDOCK | DOCK | |
| Case Docketed to Examiner in GAUDOCK | DOCK | |
| Case Docketed to Examiner in GAUDOCK | DOCK | |
| IFW TSS Processing by Tech Center CompleteTSSCOMP | TSSCOMP | |
| Application Dispatched from OIPEOIPE | OIPE | |
| Application Is Now CompleteCOMP | COMP | |
| Request for RefundIRFND | IRFND | |
| Cleared by OIPE CSRL194 | L194 | |
| IFW Scan & PACR Auto Security ReviewSCAN | SCAN | |
| Initial Exam Team nnIEXX | IEXX |
7 legal events, as the office reported them to INPADOC
Over the term
Point at a mark for the eventEvents
| Event | Code | |
|---|---|---|
| Lapsed due to failure to pay maintenance feeLapsedFP | FP | |
| Lapse for failure to pay maintenance feesLapsedPATENT EXPIRED FOR FAILURE TO PAY MAINTENANCE FEES (ORIGINAL EVENT CODE: EXP.)LAPS | LAPS | |
| Information on status: patent discontinuationPATENT EXPIRED DUE TO NONPAYMENT OF MAINTENANCE FEES UNDER 37 CFR 1.362STCH | STCH | |
| Fee payment procedureMAINTENANCE FEE REMINDER MAILED (ORIGINAL EVENT CODE: REM.)FEPP | FEPP | |
| Fee paymentFPAY | FPAY | |
| AssignmentAS | AS | |
| AssignmentAS | AS |
Numbers
- Publication
- 20060262756
- Publication, DOCDB
- 2006262756
- Publication, EPODOC
- US2006262756
- Application
- 11492499
- Application, DOCDB
- 49249906
- Application, EPODOC
- US20060492499
Titles
- English
- Method and apparatus for providing variable rate data in a communications system using non-orthogonal overflow channels
Patent term adjustment
- A delay
- +221 daysthe office missed an examination deadline
- B delay
- +65 dayspendency past three years
- Applicant delay
- −105 days
- Net adjustment
- 181 days
Classification
- CPC, 6
- H04L1/0071
- H04B7/18543
- H04B7/216
- H04J13/0022
- H04J13/0048
- H04J13/18
- IPC, 5
- H04B7 216
- H04J11 00
- H04J13 00
- H04J13 18
- H04L1 00
- USPC, 2
- 370335000
- 370342000