High-data-rate supplemental channel for CDMA telecommunications system
Summary by NHIP
Orthogonal CDMA Supplemental Channel
The apparatus generates orthogonal medium-rate and high-rate channel sets using distinct carrier frequencies. It employs long Walsh codes for medium channels and short Walsh codes for the high-rate supplemental channel transmitted on a second carrier.
Claim Score by NHIP
Abstract
A novel and improved method for implementing a high-transmission-rate over-the-air interface is described. A transmit system provides an in-phase channel set and a quadrature-phase channel set. The in-phase channel set is used to provide a complete set of orthogonal medium rate control and traffic channels. The quadrature-phase channel set is used to provide a high-rate supplemental channel and an extended set of medium rate channels that are orthogonal to each other and the original medium rate channels. The high-rate supplemental channel is generated over a set of medium rate channels using a short channel code. The medium rate channel is generated using a set of long channel codes.

Term
Term ended
Expired 15 January 2017, 9.7 years ago.
- Priority
- Filed
- Granted
- Expired
- Today
4 claims: 4 independent, 0 dependent
- 1An apparatus, comprising:first means for generating a complex data source having a multichannel term and a high-rate term;second means for generating the complex spreading code having an in-phase term and quadrature-phase term;third means for complex multiplying a complex data source and said complex spreading code yielding a real term and an imaginary term, wherein the complex data source comprises the multichannel term and the high rate term;fourth means for modulating said real term with an in-phase carrier;and fifth means for modulating said imaginary term with a quadrature-phase carrier.
- 2An apparatus, comprising:means for generating a set of medium rate in-phase channels;and means for generating a set of high speed quadrature channels that is orthogonal to the in-phase channels;and means for combining the in-phase channel set and the quadrature channel set to form an in-phase term and a quadrature phase term.
- 3An apparatus, comprising:means for generating a set of channels using a set of long Walsh codes;means for generating a high-rate channel using a short Walsh code;means for transmitting the set of channels via a first carrier;and means for transmitting the high-rate channel via a second carrier that is orthogonal to the first carrier.
- 4Broadest claimClaim Score 84, broad(NHIP)An apparatus, comprising:first means for generating a set of medium rate channels;and second means for generating a high-speed channel that is orthogonal to the set of medium rate channels, wherein said second means comprises a means for transmitting data via a set of evenly distributed long code channels.
Independent claims4
70 paragraphs in 4 sections, as filed
00002The present Application for Patent is a Continuation and claims priority to U.S. Pat. No. 6,501,787, entitled “HIGH-DATA-RATE SUPPLEMENTAL CHANNEL FOR CDMA TELECOMMUNICATIONS SYSTEM” issued on Dec. 31, 2002, which is a Continuation of U.S. Pat. No. 6,173,007, “HIGH-DATA-RATE SUPPLEMENTAL CHANNEL FOR CDMA TELECOMMUNICATIONS SYSTEM” issued Jan. 9, 2001, both assigned to the assignee hereof.
BACKGROUND OF THE INVENTION
00003I. Field of the Invention
00004The present invention relates to wireless telecommunications. More particularly, the present invention relates to a novel and improved method for implementing a high-transmission-rate over-the-air interface.
00005II. Description of the Related Art
00006The IS-95 standard from the Telecommunications Industry Association (TIA), and its derivatives such as IS-95A and ANSI J-STD-008 (referred to herein collectively as IS-95), define an over-the-air interface suitable for implementing a bandwidth-efficient digital cellular telephone system. To this end, IS-95 provides a method for establishing multiple radio frequency (RF) traffic channels, each having a data transmission rate of up to 14.4 kilobits per second. The traffic channels can be used for conducting voice telephony or for conducting digital data communications including small file transfer, electronic mail, and facsimile.
00007While 14.4 kilobits per second is adequate for these types of lower data rate applications, the increasing popularity of more data intensive applications such as World Wide Web and video conferencing has created a demand for much higher transmission rates. To satisfy this new demand, the present invention is directed toward providing an over-the-air interface capable of higher transmission rates.
00008<figref idref="DRAWINGS">FIG. 1</figref> illustrates a highly simplified digital cellular telephone system configured in a manner consistent with the use of IS-95. During operation, telephone calls and other communications are conducted by exchanging data between subscriber units <b>10</b> and base stations <b>12</b> using RF signals. The communications are further conducted from base stations <b>12</b> through base station controllers (BSC) <b>14</b> and mobile switching center (MSC) <b>16</b> to either public switch telephone network (PSTN) <b>18</b>, or to another subscriber unit <b>10</b>. BSC's <b>14</b> and MSC <b>16</b> typically provide mobility control, call processing, and call routing functionality.
00009In an IS-95 compliant system, the RF signals exchanged between subscriber units <b>10</b> and base stations <b>12</b> are processed in accordance with code division multiple access (CDMA) signal processing techniques. The use of CDMA signal processing techniques allows adjacent base stations <b>12</b> to use the same RF bandwidth which, when combined with the use of transmit power control, makes IS-95 more bandwidth efficient than other cellular telephone systems.
00010CDMA processing is considered a “spread spectrum” technology because the CDMA signal is spread over a wider amount of RF bandwidth than is generally used for non-spread spectrum systems. The spreading bandwidth for an IS-95 system is 1.2288 MHz. A CDMA-based digital wireless telecommunications system configured substantially in accordance with the use of IS-95 is described in U.S. Pat. No. 5,103,450 entitled “SYSTEM AND METHOD FOR GENERATING SIGNAL WAVEFORMS IN A CDMA CELLULAR TELEPHONE SYSTEM,” assigned to the assignee of the present invention and incorporated herein by reference.
00011It is anticipated that the demand for higher transmission rates will be greater for the forward link than for the reverse link because a typical user is expected to receive more data than he or she generates. The forward link signal is the RF signal transmitted from a base station <b>12</b> to one or more subscriber units <b>10</b>. The reverse link signal is the RF signal transmitted from subscriber unit <b>10</b> to a base station <b>12</b>.
00012<figref idref="DRAWINGS">FIG. 2</figref> illustrates the signal processing associated with an IS-95 forward link traffic channel, which is a portion of the IS-95 forward link signal. The forward link traffic channel is used for the transmission of user data from a base station <b>12</b> to a particular subscriber unit <b>10</b>. During normal operation, the base station <b>12</b> generates multiple forward link traffic channels, each of which is used for communication with a particular subscriber unit <b>10</b>. Additionally, the base station <b>12</b> generates various control channels including a pilot channel, a sync channel, and a paging channel. The forward link signal is the sum of the traffic channels and control channels.
00013As shown in <figref idref="DRAWINGS">FIG. 2</figref>, user data is input at node <b>30</b> and processed in 20 millisecond (ms) blocks called frames. The amount of data in each frame may be one of four values with each lower value being approximately half of the next higher value. Also, two possible sets of frame sizes can be utilized, which are referred to as rate set one and rate set two.
00014For rate set two the amount of data contained in the largest, or “full-rate,” frame corresponds to a transmission rate of 13.35 kilobits per second. For rate set one the amount of data contained in the full rate frame corresponds to a transmission rate of 8.6 kilobits per second. The smaller sized frames are referred to as half-rate, quarter-rate, and eighth-rate frames. The various frame rates are used to adjust for the changes in voice activity experienced during a normal conversation.
00015CRC generator <b>36</b> adds CRC data with the amount of CRC data generated dependent on the frame size and rate set. Tail byte generator <b>40</b> adds eight tail bits of known logic state to each frame to assist during the decoding process. For full-rate frames, the number of tail bits and CRC bits brings the transmission rate up to 9.6 and 14.4 kilobits per second for rate set one and rate set two.
00016The data from tail byte generator <b>40</b> is convolutionally encoded by encoder <b>42</b> to generate code symbols <b>44</b>. Rate ½, constraint length (K) 9, encoding is performed.
00017Puncture <b>48</b> removes 2 of every 6 code symbols for rate set two frames, which effectively reduces the encoding performed to rate ⅔. Thus, at the output of puncture <b>48</b> code symbols are generated at 19.2 kilosymbols per second (ksps) for both rate set one and rate set two full-rate frames.
00018Block interleaver <b>50</b> performs block interleaving on each frame, and the interleaved code symbols are modulated with a Walsh channel code from Walsh code generator <b>54</b> generating sixty-four Walsh symbols for each code symbol. A particular Walsh channel code W<sub>i </sub>is selected from a set of sixty-four Walsh channel codes and typically used for the duration of an interface between a particular subscriber unit <b>10</b> and a base station <b>12</b>.
00019The Walsh symbols are then duplicated, and one copy is modulated with an in-phase PN spreading code (PN<sub>I</sub>) from spreading code generator <b>52</b>, and the other copy is modulated with a quadrature-phase PN spreading code (PN<sub>Q</sub>) from spreading code generator <b>53</b>. The in-phase data is then low-pass filtered by LPF <b>58</b> and modulated with an in-phase sinusoidal carrier signal. Similarly, the quadrature-phase data is low-pass filtered by LPF <b>60</b> and modulated with a quadrature-phase sinusoidal carrier. The two modulated carrier signals are then summed to form signal s(t) and transmitted as the forward link signal.
SUMMARY OF THE INVENTION
00020The present invention is a novel and improved method for implementing a high-transmission-rate over-the-air interface. A transmit system provides an in-phase channel set and a quadrature-phase channel set. The in-phase channel set is used to provide a complete set of orthogonal medium rate control and traffic channels. The quadrature-phase channel set is used to provide a high-rate supplemental channel and an extended set of medium rate channels that are orthogonal to each other and the original medium rate channels. The high-rate supplemental channel is generated over a set of medium rate channels using a short channel code. The medium rate channel are generated using a set of long channel codes.
BRIEF DESCRIPTION OF THE DRAWINGS
00021The 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 and wherein:
00022<figref idref="DRAWINGS">FIG. 1</figref> is a block diagram of a cellular telephone system;
00023<figref idref="DRAWINGS">FIG. 2</figref> is a block diagram of the forward link signal processing associated with the IS-95 standard;
00024<figref idref="DRAWINGS">FIG. 3</figref> is a block diagram of a transmit system configured in accordance with one embodiment of the invention;
00025<figref idref="DRAWINGS">FIGS. 4A-4C</figref> are lists of the set of 64-symbol Walsh codes and associated indexes used in a preferred embodiment of the invention.
00026<figref idref="DRAWINGS">FIG. 5</figref> is a block diagram of the channel coding performed in accordance with one embodiment of the invention;
00027<figref idref="DRAWINGS">FIG. 6</figref> is a block diagram of a receive system configured in accordance with one embodiment of the invention; and
00028<figref idref="DRAWINGS">FIG. 7</figref> is a block diagram of a decoding system configured in accordance with one embodiment of the invention.
DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS
00029<figref idref="DRAWINGS">FIG. 3</figref> is a block diagram of a transmit system configured in a manner consistent with use of the invention. Typically, the transmit system will be used to generated the forward link signal in a cellular telephone system and therefore would be incorporated into a base station <b>12</b>. In the exemplary configuration shown, the transmit system generates a forward link signal that includes a complete set of IS-95, or medium rate, channels as well as a high-speed supplemental channel. Additionally, in the embodiment described, an extended set of IS-95 channels is provided. Alternative embodiments of the invention could provide more than one high-speed supplemental channel, or not provide the use of an additional set of IS-95 channels, or both. Also, while providing IS-95 channels is preferred, other embodiments of the invention may incorporate other channel types and processing protocols.
00030In the exemplary embodiment, the transmit system provides an in-phase channel set <b>90</b> and a quadrature-phase channel set <b>92</b>. The in-phase channel set <b>90</b> is used to provide the complete set of orthogonal IS-95 control and traffic channels. Orthogonal channels do not interfere with one another when transmitted via the same path. The quadrature-phase channel set <b>92</b> is used to provide a high-rate supplemental channel and an extended set of IS-95 channels that are orthogonal to each other and the original IS-95 channels. In the preferred embodiment of the invention, all the signals and data shown in <figref idref="DRAWINGS">FIG. 3</figref> are formed by positive and negative integer values represented by binary digital data or voltages, which correspond to a logic low and a logic high, respectively.
00031For the in-phase channel set <b>90</b>, IS-95 control channel system <b>100</b> performs various functions associated with one of the standard IS-95 control channels including encoding and interleaving, the processing of which is described in IS-95 incorporated herein by reference. In this case, since the Walsh<sub>1 </sub>channel code is used, the processing will be in accordance with the use of a paging channel. The resulting code symbols from IS-95 control channel system <b>100</b> are modulated with a Walsh code from Walsh<sub>1 </sub>generator <b>102</b> by multiplier <b>104</b>. The Walsh generators <b>102</b> are used to generate the orthogonal in-phase channels.
00032Walsh generator <b>102</b> repeatedly generates a Walsh code of index <b>1</b> (Walsh<sub>1</sub>) from a set of Walsh codes of indexes 0 to 63 (Walsh<sub>0-63</sub>). <figref idref="DRAWINGS">FIGS. 4A-4C</figref> are lists of the set of 64-symbol Walsh codes and associated indexes used in a preferred embodiment of the invention. A Walsh chip corresponds to a Walsh symbol and a Walsh chip value of 0 corresponds to a positive (+) integer while a Walsh chip value of 1 corresponds to a negative (−) integer. Under IS-95 Walsh<sub>1 </sub>code corresponds to the paging channel. The Walsh symbols generated by modulation with the Walsh<sub>1 </sub>code are gain adjusted by channel gain <b>108</b>(<b>2</b>).
00033The pilot channel is generated by gain adjusting a positive 1 value using channel gain <b>108</b>(<b>1</b>). No encoding is performed for the pilot channel in accordance with IS-95, as the Walsh<sub>0 </sub>code used for the pilot channel is all plus 1 values, and therefore equivalent to no modulation at all.
00034Additional control channels are generated in similar fashion using additional IS-95 control channel systems, additional Walsh generators, and additional channel gains (all not shown). Such control channels include a synchronization channel, which is modulated with the Walsh<sub>32 </sub>code. The processing associated with each type of IS-95 control channel is described in IS-95.
00035The processing associated with one of the IS-95 traffic channels in the in-phase channel set is illustrated with IS-95 traffic channel system <b>110</b>, which performs various functions associated with an IS-95 traffic channel including convolutional encoding and interleaving as described above to generate a sequence of symbols at 19.2 kilosymbols per second. The code symbols from IS-95 traffic channel system <b>110</b> are modulated with the 64-symbol Walsh<sub>63 </sub>code from Walsh<sub>63 </sub>generator <b>112</b> by multiplier <b>114</b> to generate a sequence of symbols at 1.2288 Megasymbols per second. The Walsh symbols from multiplier <b>114</b> are gain adjusted by gain adjust <b>108</b>(<b>64</b>).
00036The outputs of all gain adjusts including gain adjusts <b>108</b>(<b>1</b>)-(<b>64</b>) are summed by summer <b>120</b> generating in-phase data D<sub>I</sub>. Each gain adjust <b>108</b> increases or decreases the gain of the particular channel with which it is associated. The gain adjust can be performed in response to a variety of factors including power control commands from the subscriber unit <b>10</b> processing the associated channel, or to differences in the type of data being transmitted over the channel. By keeping the transmit power of each channel at the minimum necessary for proper communication, interference is reduced and the total transmit capacity increased. In one embodiment of the invention, gain adjusts <b>108</b> are configured by a control system (not shown) which could take the form of a microprocessor.
00037Within quadrature-phase channel set <b>92</b>, an extended set of 64-2<sup>N </sup>IS-95 traffic channels are provided using IS-95 channel systems <b>124</b>. N is a integer value based on the number of Walsh channels allocated for the supplemental channel and is described in greater detail below. Each code symbols from the IS-95 channel systems <b>124</b>(<b>2</b>)-(64-2<sup>N</sup>) is modulated with a Walsh code from Walsh generators <b>126</b> by multipliers <b>128</b>, except for IS-95 traffic channel system <b>124</b>(<b>1</b>), which is placed on Walsh<sub>0 </sub>channel, and therefore does not require modulation.
00038To provide the high-rate supplemental channel, supplemental channel system <b>132</b> generates code symbols at a rate R<sub>S</sub>, which is 2<sup>N </sup>times that of a full-rate IS-95 traffic channel. Each code symbol is modulated with a supplemental Walsh code (Walsh<sub>S</sub>) from supplemental Walsh code generator <b>134</b> using multiplier <b>140</b>. The output of multiplier <b>140</b> is gain adjusted by gain adjust <b>130</b>. The outputs of the set of gain adjusts <b>130</b> are summed by summer <b>150</b> yielding quadrature-phase data D<sub>Q</sub>. It should be understood that the extended set of IS-95 traffic channel could be completely or partially replaced with one or more additional supplemental channels.
00039The processing performed by supplemental channel system <b>132</b> is described in greater detail below. The Walsh<sub>S </sub>code generated by supplemental Walsh code generator <b>134</b> depends on the number of Walsh codes allocated for the high-rate supplemental channel in quadrature-phase channel set <b>92</b>. In the preferred embodiment of the invention, the number of Walsh channels allocated for the high-rate supplemental channel can be any value 2<sup>N </sup>where N={2, 3, 4, 5, 6}. The Walsh<sub>S </sub>codes are 64/2<sup>N </sup>symbols long, rather than the 64 symbols used with the IS-95 Walsh codes. In order for the high-rate supplemental channel to be orthogonal to the other quadrature-phase channels with 64-symbol Walsh codes, 2<sup>N </sup>of the possible 64 quadrature-phase channels with 64-symbol Walsh codes cannot be used for the other quadrature-phase channels. Table I provides a list of the possible Walsh<sub>S </sub>codes for each value of N and the corresponding sets of allocated 64-symbol Walsh codes.
00002<tables id="TABLE-US-00001" num="00001"><table frame="none" colsep="0" rowsep="0" pgwide="1"><tgroup align="left" colsep="0" rowsep="0" cols="3"><colspec colname="offset" colwidth="126pt" align="left" /><colspec colname="1" colwidth="91pt" align="left" /><colspec colname="2" colwidth="42pt" align="left" /><thead><row><entry /><entry namest="offset" nameend="2" rowsep="1">TABLE I</entry></row></thead><tbody valign="top"><row><entry /><entry namest="offset" nameend="2" align="center" rowsep="1" /></row><row><entry /><entry>Allocated</entry><entry /></row></tbody></tgroup><tgroup align="left" colsep="0" rowsep="0" cols="4"><colspec colname="1" colwidth="21pt" align="left" /><colspec colname="2" colwidth="105pt" align="left" /><colspec colname="3" colwidth="91pt" align="left" /><colspec colname="4" colwidth="42pt" align="left" /><tbody valign="top"><row><entry>N</entry><entry>Walsh<sub>i</sub></entry><entry>Walsh Codes</entry><entry>64−Symbol</entry></row><row><entry namest="1" nameend="4" align="center" rowsep="1" /></row><row><entry>2</entry><entry>+,+,+,+,+,+,+,+,+,+,+,+,+,+,+,+</entry><entry>0, 16, 32, 48</entry><entry /></row><row><entry /><entry>+,−,+,−,+,−,+,−,+,−,+,−,+,−,+,−</entry><entry>1, 17, 33, 49</entry></row><row><entry /><entry>+,+,−,−,+,+,−,−,+,+,−,−,+,+,−,−</entry><entry>2, 18, 34, 50</entry></row><row><entry /><entry>+,−,−,+,+,−,−,+,+,−,−,+,+,−,−,+</entry><entry>3, 19, 35, 51</entry></row><row><entry /><entry>+,+,+,+,−,−,−,−,+,+,+,+,−,−,−,−</entry><entry>4, 20, 36, 52</entry></row><row><entry /><entry>+,−,+,−,−,+,−,+,+,−,+,−,−,+,−,+</entry><entry>5, 21, 37, 53</entry></row><row><entry /><entry>+,+,−,−,−,−,+,+,+,+,−,−,−,−,+,+</entry><entry>6, 22, 38, 54</entry></row><row><entry /><entry>+,−,−,+,−,+,+,−,+,−,−,+,−,+,+,−</entry><entry>7, 23, 39, 55</entry></row><row><entry /><entry>+,+,+,+,+,+,+,+,−,−,−,−,−,−,−,−</entry><entry>8, 24, 40, 56</entry></row><row><entry /><entry>+,−,+,−,+,−,+,−,−,+,−,+,−,+,−,+</entry><entry>9, 25, 41, 57</entry></row><row><entry /><entry>+,+,−,−,+,+,−,−,−,−,+,+,−,−,+,+</entry><entry>10, 26, 42, 58</entry></row><row><entry /><entry>+,−,−,+,+,−,−,+,−,+,+,−,−,+,+,−</entry><entry>11, 27, 43, 59</entry></row><row><entry /><entry>+,+,+,+,−,−,−,−,−,−,−,−,+,+,+,+</entry><entry>12, 28, 44, 60</entry></row><row><entry /><entry>+,−,+,−,−,+,−,+,−,+,−,+,+,−,+,−</entry><entry>13, 29, 45, 61</entry></row><row><entry /><entry>+,+,−,−,−,−,+,+,−,−,+,+,+,+,−,−</entry><entry>14, 30, 46, 62</entry></row><row><entry /><entry>+,−,−,+,−,+,+,−,−,+,+,−,+,−,−,+</entry><entry>15, 31, 47, 63</entry></row><row><entry>3</entry><entry>+,+,+,+,+,+,+,+</entry><entry>0, 8, 16, 24, 32, 40, 48, 56</entry></row><row><entry /><entry>+,−,+,−,+,−,+,−</entry><entry>1, 9, 17, 25, 33, 41, 49, 57</entry></row><row><entry /><entry>+,+,−,−,+,+,−,−</entry><entry>2, 10, 18, 26, 34, 42, 50, 58</entry></row><row><entry /><entry>+,−,−,+,+,−,−,+</entry><entry>3, 11, 19, 27, 35, 43, 51, 59</entry></row><row><entry /><entry>+,+,+,+,−,−,−,−</entry><entry>4, 12, 20, 28, 36, 44, 52, 60</entry></row><row><entry /><entry>+,−,+,−,−,+,−,+</entry><entry>5, 13, 21, 29, 37, 45, 53, 61</entry></row><row><entry /><entry>+,+,−,−,−,−,+,+</entry><entry>6, 14, 22, 30, 38, 46, 54, 62</entry></row><row><entry /><entry>+,−,−,+,−,+,+,−</entry><entry>7, 15, 23, 31, 39, 47, 55, 63</entry></row><row><entry>4</entry><entry>+,+,+,+</entry><entry>0, 4, 8, ≡, 60</entry></row><row><entry /><entry>+,−,+,−,</entry><entry>1, 5, 9, ≡, 61</entry></row><row><entry /><entry>+,+,−,−</entry><entry>2, 6, 10, ≡, 62</entry></row><row><entry /><entry>+,−,−,+</entry><entry>3, 7, 11, ≡, 63</entry></row><row><entry>5</entry><entry>+,+</entry><entry>0, 2, 4, ≡, 62</entry></row><row><entry /><entry>+,−</entry><entry>1, 3, 5, ≡, 63</entry></row><row><entry>6</entry><entry>+</entry><entry>0, 1, 2, ≡, 63</entry></row><row><entry namest="1" nameend="4" align="center" rowsep="1" /></row></tbody></tgroup></table></tables>
00040The + and − indicate a positive or negative integer value, where the preferred integer is 1. As is apparent, the number of Walsh symbols in each Walshs code varies as N varies, and in all instances is less than the number of symbols in the IS-95 Walsh channel codes. Thus, the supplemental channel is formed using a short Walsh channel code and the IS-95 channels are formed using longer Walsh channel codes. Regardless of the length of the Walsh<sub>S </sub>code, in the described embodiment of the invention the symbols are applied at a rate of 1.2288 Megachips per second (Mcps). Thus, shorter length Walsh<sub>S </sub>codes are repeated more often.
00041Data channels D<sub>I </sub>and D<sub>Q </sub>are complex multiplied, as the first real and imaginary terms respectively, with spreading codes PN<sub>I </sub>and PN<sub>Q</sub>, as the second real and imaginary terms respectively, yielding in-phase (or real) term X<sub>I </sub>and quadrature-phase (or imaginary) term X<sub>Q</sub>. Spreading codes PN<sub>I </sub>and PN<sub>Q </sub>are generated by spreading code generators <b>152</b> and <b>154</b>. Spreading codes PN<sub>I </sub>and PN<sub>Q </sub>are applied at 1.2288 Mcps. Equation (1) illustrates the complex multiplication performed. <br />(<i>X</i><sub>I</sub><i>+jX</i><sub>Q</sub>)=(<i>D</i><sub>I</sub><i>+jD</i><sub>Q</sub>)(<i>PN</i><sub>I</sub><i>+jPN</i><sub>Q</sub>) (1)
00043In-phase term X<sub>I </sub>is then low-pass filtered to a 1.2288 MHz bandwidth (not shown) and upconverted by multiplication with in-phase carrier COS(ω<sub>c</sub>t). Similarly, quadrature-phase term X<sub>Q </sub>is low-pass filtered to a 1.2288 MHz bandwidth (not shown) and upconverted by multiplication with quadrature-phase carrier SIN(ω<sub>c</sub>t). The upconverted X<sub>I </sub>and X<sub>Q </sub>terms are summed yielding forward link signal s(t).
00044The complex multiplication allows quadrature-phase channel set <b>92</b> to remain orthogonal to the in-phase channel set <b>90</b>, and therefore to be provided without adding additional interference to the other channels transmitted over the same path with perfect receiver phase recovery. Thus, a complete set of sixty-four Walsh<sub>i </sub>channels is added in an orthogonal manner to the original IS-95 channel set, and this channel set can be used for the supplemental channel. Additionally, by implementing the supplemental channel in the orthogonal quadrature-phase channel set <b>92</b>, a subscriber unit <b>10</b> configured to process the normal IS-95 forward link signal will still be able to processes the IS-95 channels within in-phase channel set <b>90</b> thus providing the high-transmission-rate channel while maintaining backwards compatibility with previously existing systems.
00045While the embodiment of the invention shown in <figref idref="DRAWINGS">FIG. 3</figref> uses a single set of in-phase and quadrature-phase carriers to generate the in-phase and quadrature-phase channel set, separate sets of sinusoids could be used to independently generate the in-phase and quadrature-phase channel sets, with the second set of carriers offset from the first set by 90°. For example, the D<sub>Q </sub>data could be applied to the second set of carrier sinusoids where the D<sub>Q </sub>in-phase PNI) spread data is applied to COS(ω<sub>c</sub>t-90°) and the D<sub>Q </sub>quadrature-phase (PNQ) spread data is applied to SIN(ω<sub>c</sub>t-90°). The resulting signals are then summed to produce the quadrature-phase channel set <b>92</b>, which in turn are summed with the in-phase channel set <b>90</b>.
00046The use of the Walsh<sub>s </sub>channels as set forth in Table I, also allows simplified implementation of the supplemental channel within quadrature-phase channel set <b>92</b>. In particular, the use of the Walsh<sub>S </sub>codes listed in Table I allows the supplemental channel to use whole subsets of 64 symbol Walsh<sub>i </sub>codes without the need to generate each and everyone of those Walsh codes.
00047For example, when N=5 the Walsh<sub>s </sub>codes specified by Table I allocate a set of 32 64-symbol Walsh<sub>i </sub>codes for the supplemental channel. That is, all the even-indexed 64-symbol Walsh codes or all of the odd-indexed 64-symbol Walsh codes are allocated for the supplemental channel. This leaves the odd-indexed or even-index channels, respectively, for implementing the extended IS-95 traffic channel set. In <figref idref="DRAWINGS">FIG. 3</figref>, the supplemental channel uses the odd 64-symbol Walsh code channels when Walsh<sub>s</sub>={+,−} and the even channels are available for the extended IS-95 traffic channel set.
00048In another example, when N=4, the associated Walsh<sub>s </sub>codes allocate a set of sixteen 64-symbol Walsh<sub>i </sub>codes. This leaves a set of forty-eight remaining Walsh<sub>i </sub>codes for implementing the extended IS-95 traffic channels or for implementing additional supplemental channels. In general, the use of the Walsh<sub>s </sub>code that corresponds to a particular value N allocates 2<sup>N </sup>64-symbol Walsh<sub>i </sub>codes for the supplemental channel using only a single, and shorter, Walsh<sub>s </sub>code.
00049The allocation of whole subsets of Walsh<sub>i </sub>codes using a single Walsh<sub>s </sub>code is facilitated by even distribution the 64-symbol Walsh<sub>i </sub>codes within the subset. For example, when N=5 the Walsh<sub>i </sub>codes are separated by 2, and when N=4 the Walsh<sub>i </sub>codes are separated by 4. Only by providing a complete set of quadrature-phase channels <b>92</b> for implementing the supplemental channel can the allocation of large set of evenly spaced Walsh<sub>i </sub>channels be performed, and therefore implemented using a single Walsh<sub>s </sub>code.
00050Also, allocating a subset of 64-symbol Walsh<sub>i </sub>codes using a single shorter Walsh<sub>s </sub>code reduces the complexity associated with providing a high-rate supplemental channel. For example, performing actual modulation using the set of 64-symbol Walsh<sub>i </sub>codes, and summing of the resulting modulated data would require a substantial increase in signal processing resources when compared with the use of the single Walsh<sub>s </sub>generator used in the implementation of the invention described herein.
00051Sets of evenly spaces Walsh<sub>i </sub>channels could not be allocated as easily if the supplemental channel were placed in the in-phase channel set <b>90</b> of the previously existing IS-95 forward link, or in the in-phase and quadrature-phase channels with QPSK modulation. This is because certain sixty-four symbol Walsh<sub>i </sub>channels are already allocated for control functions such as the paging, pilot, and sync channels on the in-phase channel. Thus, using a new quadrature-phase Walsh code space allows for simplified implementation of the supplemental channel.
00052Also, the use of the a single Walsh<sub>s </sub>code improves the performance of the high-rate supplemental channel because the variance in the amplitude of the supplemental channel is minimized. In the embodiment described herein, the amplitude is simply based on the positive or negative integer associated with the Walsh<sub>s </sub>code. This is in contrast to performing the modulation with a set of 2<sup>N </sup>64-symbol Walsh<sub>i </sub>codes, which would result in the set of amplitudes 0, +2, −2, +4, −4, . . . , 2<sup>N</sup>, and −2<sup>N</sup>.
00053Among other improvements, reducing the variance in the amplitude reduces the peak-to-average power ratio, which increases the range at which the forward link signal can be received for a given maximum transmit power of the base station <b>12</b>, or other forward link transmit system.
00054<figref idref="DRAWINGS">FIG. 5</figref> is a block diagram of the supplemental channel system <b>132</b> of <figref idref="DRAWINGS">FIG. 1</figref> when configured in accordance with one embodiment of the invention. User data is received by CRC checksum generator <b>200</b> which adds checksum information to the data received. In the preferred embodiment of the invention, the data is processed in 20 ms frames as is performed for IS-95, and 16 bits of checksum data is added. Tail bits <b>202</b> adds eight tail bits to each frame. The output of tail bits <b>202</b> is received at a data rate D by convolutional encoder <b>204</b> which performs convolutional encoding at rate R<sub>c </sub>on each frame. R<sub>c </sub>differs for different embodiments of the invention as described in greater detail below.
00055Block interleaver <b>206</b> interleaves the code symbols from convolutional encoder <b>204</b> and repeater <b>208</b> repeats the code symbol sequence from interleaver <b>206</b> by a repeat amount M. The repeat amount M varies in different embodiments of the invention, and will typically depend on the coding rate R<sub>c </sub>and the supplemental channel rate R<sub>s </sub>(see FIG. <b>3</b>). The repeat amount is discussed further below. Mapper <b>210</b> receives the code symbols from repeater <b>208</b> and converts the logic zeros and logic ones into positive and negative integer values which are output at the supplemental channel rate R<sub>s</sub>.
00056Table II provides a list of data input rates D, encoding rates R<sub>c</sub>, repeat amounts M, and supplemental channel rates R<sub>s </sub>that can be used in different embodiments of the invention. In some embodiments multiple rates are used.
00002<tables id="TABLE-US-00002" num="00002"><table frame="none" colsep="0" rowsep="0" pgwide="1"><tgroup align="left" colsep="0" rowsep="0" cols="8"><colspec colname="1" colwidth="49pt" align="center" /><colspec colname="2" colwidth="14pt" align="center" /><colspec colname="3" colwidth="56pt" align="center" /><colspec colname="4" colwidth="49pt" align="center" /><colspec colname="5" colwidth="35pt" align="center" /><colspec colname="6" colwidth="49pt" align="center" /><colspec colname="7" colwidth="49pt" align="center" /><colspec colname="8" colwidth="63pt" align="center" /><thead><row><entry namest="1" nameend="8" rowsep="1">TABLE II</entry></row><row><entry namest="1" nameend="8" align="center" rowsep="1" /></row><row><entry>Convolutional</entry><entry /><entry>Walsh Channels</entry><entry>Convolutional</entry><entry /><entry>Walsh</entry><entry /><entry /></row><row><entry>Encoder</entry><entry /><entry>for Supp.</entry><entry>Code</entry><entry>Repetition</entry><entry>Symbols/Code</entry><entry>Convolutional</entry><entry>Number of Channel</entry></row><row><entry>Input Rate</entry><entry /><entry>Channel</entry><entry>Rate</entry><entry>Amount</entry><entry>Symbols</entry><entry>Encoder</entry><entry>Bits per</entry></row><row><entry>(D) kbps</entry><entry>(N)</entry><entry>(2<sup>N</sup>)</entry><entry>(R<sub>C</sub>)</entry><entry>(M)</entry><entry>(W/S)</entry><entry>Input Bits</entry><entry>Frame</entry></row><row><entry namest="1" nameend="8" align="center" rowsep="1" /></row></thead><tbody valign="top"><row><entry /></row></tbody></tgroup><tgroup align="left" colsep="0" rowsep="0" cols="8"><colspec colname="1" colwidth="49pt" align="char" char="." /><colspec colname="2" colwidth="14pt" align="char" char="." /><colspec colname="3" colwidth="56pt" align="char" char="." /><colspec colname="4" colwidth="49pt" align="center" /><colspec colname="5" colwidth="35pt" align="char" char="." /><colspec colname="6" colwidth="49pt" align="center" /><colspec colname="7" colwidth="49pt" align="char" char="." /><colspec colname="8" colwidth="63pt" align="char" char="." /><tbody valign="top"><row><entry>38.4</entry><entry>2</entry><entry>4</entry><entry>_1/2</entry><entry>1</entry><entry>16/1 </entry><entry>768</entry><entry>1,536</entry></row><row><entry>38.4</entry><entry>3</entry><entry>8</entry><entry>_1/4</entry><entry>1</entry><entry>8/1</entry><entry>768</entry><entry>3,072</entry></row><row><entry>38.4</entry><entry>4</entry><entry>16</entry><entry>_1/4</entry><entry>2</entry><entry>4/1</entry><entry>768</entry><entry>6,144</entry></row><row><entry>38.4</entry><entry>5</entry><entry>32</entry><entry>_1/4</entry><entry>4</entry><entry>2/1</entry><entry>768</entry><entry>12,288</entry></row><row><entry>38.4</entry><entry>6</entry><entry>64</entry><entry>_1/4</entry><entry>8</entry><entry>1/1</entry><entry>768</entry><entry>24,576</entry></row><row><entry>76.8</entry><entry>3</entry><entry>8</entry><entry>_1/2</entry><entry>1</entry><entry>8/1</entry><entry>1,536</entry><entry>3,072</entry></row><row><entry>76.8</entry><entry>4</entry><entry>16</entry><entry>_1/4</entry><entry>1</entry><entry>4/1</entry><entry>1,536</entry><entry>6,144</entry></row><row><entry>76.8</entry><entry>5</entry><entry>32</entry><entry>_1/4</entry><entry>2</entry><entry>2/1</entry><entry>1,536</entry><entry>12,288</entry></row><row><entry>76.8</entry><entry>6</entry><entry>64</entry><entry>_1/4</entry><entry>4</entry><entry>1/1</entry><entry>1,536</entry><entry>24,576</entry></row><row><entry>153.6</entry><entry>4</entry><entry>16</entry><entry>_1/2</entry><entry>1</entry><entry>4/1</entry><entry>3,072</entry><entry>6,144</entry></row><row><entry>153.6</entry><entry>5</entry><entry>32</entry><entry>1/4</entry><entry>1</entry><entry>2/1</entry><entry>3,072</entry><entry>12,288</entry></row><row><entry>153.6</entry><entry>6</entry><entry>64</entry><entry>_1/4</entry><entry>2</entry><entry>1/1</entry><entry>3,072</entry><entry>24,576</entry></row><row><entry namest="1" nameend="8" align="center" rowsep="1" /></row></tbody></tgroup></table></tables>
00057Three encoder input rates D for the supplemental channel are shown: 38.4, 76.8, and 153.6 kilobits per second. For each of these encoder input rates D, a set of encoder rates R<sub>c</sub>, N values, and repeat amounts M are provided which achieve the desired encoder input rate D. Additionally, the ratio of Walsh<sub>s </sub>symbols to code symbols is provided, which corresponds to the length of the Walsh<sub>s </sub>code. Also, the number of encoder input bits per 20 frame is provided, as is the number of code symbols transmitted per 20 ms frame. The actual data transmission rate will be equal to the encoder input rate D, less the overhead necessary for the CRC bits and tail bits and any other control information provided. The use of Reed-Soloman encoding in addition to, or instead of, CRC checksum encoding is also contemplated.
00058In general, it is desirable to use the largest value of N possible for the supplemental channel in order to spread the supplemental channel over the greatest number of Walsh<sub>i </sub>channels. Spreading the supplemental channel out over a larger set of Walsh<sub>i </sub>channels minimizes the effect of inter-channel interference between the two corresponding Walsh<sub>i </sub>channels on the in-phase channel set <b>90</b> and the quadrature-phase channel set <b>92</b>. This inter-channel interference is created by imperfect phase alignment experienced during receive processing. By spreading out the supplemental channel over a larger set of Walsh<sub>i </sub>channels, the amount of inter-channel interference experience for any particular Walsh<sub>i </sub>channel in the in-phase channel set <b>90</b> is minimized, because the portion of the supplemental channel in that Walsh<sub>i </sub>channel is small. Also, spreading the supplemental channel over a larger set of Walsh<sub>i </sub>channels with a larger total channel symbol rate allows for a higher symbol diversity, which improves performance in fading channel conditions.
00059When the number of Walsh channels needed for the desired encoder input rate D using rate ½ encoding is less than the number of available Walsh channels by at least a factor of two, performance is improved by spreading the signal over more Walsh channels. The higher channel symbol rate for the larger number of Walsh channels is obtained by using a rate ¼, rather than a rate ½, code, or by sequence repetition, or both. The rate ¼ code provides additional coding gain over that of a rate ½ code in benign and fading channel conditions and the sequence repetition provides improved performance in fading channel conditions due to the increased diversity.
00060In a preferred embodiment of the invention, a supplemental channel having an encoder input rate of 76.8 kilobits per second is provided using N=5, an encoder rate R<sub>c </sub>of ¼, and a repetition amount of M=2. Such an implementation provides data transfer rates on the order of an ISDN channel including sufficient bandwidth for signaling. Also, using N=5 maintains 32 additional Walsh<sub>i </sub>channels for providing extended IS-95 channels.
00061The actual sustainable transmission rate of the supplemental channel will vary depending on a variety of environmental conditions including the amount of multipath experienced by the forward link transmission. The supplemental transmission rate depends of the amount of multipath because forward link signals that arrive via different paths are no longer orthogonal and therefore interfere with one another. This interference increases with increased transmission rates because of the additional transmit power necessary. Thus, the more multipath interference experienced, the less the sustainable transmission rate of the supplemental channel. Therefore, a lower transmission rate for the supplemental channel is preferred for high multipath environments.
00062In one embodiment of the invention, a control system that measures the various environmental factors and which selects the optimal supplemental channel processing characteristics is contemplated. Also, the use of signal cancellation is contemplated for removing noise due to multipath transmissions. A method and apparatus for performing such noise cancellation is described in U.S. Pat. No. 5,978,413 entitled “METHOD AND SYSTEM FOR PROCESSING A PLURALITY OF MULTIPLE ACCESS TRANSMISSIONS,” assigned to the assignee of the present invention and incorporated herein by reference.
00063<figref idref="DRAWINGS">FIG. 6</figref> is a block diagram of a receive processing system for processing the high-rate supplemental channel in accordance with one embodiment of the invention. Typically, the receive processing system will be implemented in a subscriber unit <b>10</b> of a cellular telephone system.
00064During operation, RF signals received by antenna system <b>300</b> are downconverted with in-phase carrier <b>302</b> and quadrature-phase carrier <b>304</b> generating digitized in-phase receive samples R<sub>I </sub>and quadrature-phase receive samples R<sub>Q</sub>. These receive samples are provided to the finger processor module shown and to other finger processors (not shown) in accordance with the use of a rake receiver. Each finger processor processes one instance of the supplemental forward link signal received, with each instance generated by multipath phenomena.
00065The in-phase and quadrature-phase receive samples R<sub>I </sub>and R<sub>Q </sub>are multiplied with the complex conjugate of the PN spreading codes generated by in-phase spreading code generator <b>306</b> and quadrature-phase spreading code generator <b>308</b> yielding receive terms Y<sub>I </sub>and Y<sub>Q</sub>. The receive terms Y<sub>I </sub>and Y<sub>Q </sub>are modulated with the Walsh<sub>s </sub>code generated by Walsh generator <b>310</b>, and the resulting modulated data is summed over the number of Walsh symbols in the Walsh<sub>s </sub>code by summers <b>312</b>. Additionally, the receive terms Y<sub>I </sub>and Y<sub>Q </sub>are summed and filtered (averaged) by pilot filters <b>316</b>.
00066The outputs of summers <b>312</b> are then multiplied with the complex conjugate of the filter pilot data, and the resulting quadrature-phase term is used at the supplemental channel soft-decision data <b>320</b>. Supplemental soft-decision data <b>320</b> can then be combined with soft-decision data from other finger processors (not shown) and the combined soft-decision data decoded.
00067<figref idref="DRAWINGS">FIG. 7</figref> is a block diagram of decoder system used to decode the supplemental soft-decision data <b>320</b> in accordance with one embodiment of the invention. The soft-decision data is received by accumulator <b>400</b> which accumulates samples of the soft-decision data by the repeat amount M. The accumulated data is then deinterleaved by block deinterleaver <b>402</b> and decoded by trellis decoder <b>404</b>. Various types of decoders are well known including Viterbi decoders.
00068The user data in the hard-decision data from trellis decoder <b>404</b> is then checked with the CRC checksum data by CRC check system <b>406</b>, and the resulting user data is output along with check results indicating whether the user data was consistent with the check sum data. The receive processing system or user can then determine whether to use the user data based on the CRC checksum results.
00069Thus, a high data rate transmission system particularly suited for use in conjunction with the IS-95 forward link has been described. The invention can be incorporated into both terrestrial as well as satellite based wireless communication systems, as well as wire based communication systems over which sinusoidal signals are transmitted such as coaxial cable systems. Also, while the invention is described in the context of a 1.2288 MHz bandwidth signal, the use of other bandwidths is consistent with the operation of the invention including 2.5 MHz and 5.0 MHz systems. Similarly, while the invention is described using transmission rates on the order of 10 kbps and 70 kbps, the use of other channel rates may be employed. In a preferred embodiment of the invention, the various systems described herein are implemented using semiconductor integrated circuits coupled via conduct, inductive, and capacitive connections, the use of which is well known in the art.
00070The previous description 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.
Contents4
11 sheets
Sheet 1 Sheet 2 Sheet 3 Sheet 4 Sheet 5 Sheet 6 Sheet 7 Sheet 8 Sheet 9 Sheet 10 Sheet 11
Every citation, both ways
| Document | Relation | Office | Cited during |
|---|---|---|---|
| US7729433B2 | Cited by | United States of America | Search report |
| US2008305824A1 | Cited by | United States of America | Pre-grant |
| US2007211619A1 | Cited by | United States of America | Pre-grant |
| US7110472B2 | Cited by | United States of America | Search report |
| US7161920B2 | Cited by | United States of America | Search report |
| US2002118659A1 | Cited by | United States of America | Pre-grant |
| US2004090939A1 | Cited by | United States of America | Pre-grant |
| EP0412583A2 | Cites | European Patent Office (EPO) | Applicant |
| EP0418865A2 | Cites | European Patent Office (EPO) | Applicant |
| EP0444592A2 | Cites | European Patent Office (EPO) | Applicant |
| GB2022365A | Cites | United Kingdom | Applicant |
| GB2182528A | Cites | United Kingdom | Applicant |
| US3310631A | Cites | United States of America | Applicant |
| US3715508A | Cites | United States of America | Applicant |
| US4052565A | Cites | United States of America | Applicant |
| US4135059A | Cites | United States of America | Applicant |
| US4220821A | Cites | United States of America | Applicant |
| US4256925A | Cites | United States of America | Applicant |
| US4291406A | Cites | United States of America | Applicant |
| US4291409A | Cites | United States of America | Applicant |
| US4298979A | Cites | United States of America | Applicant |
| US4301530A | Cites | United States of America | Applicant |
| US4319353A | Cites | United States of America | Applicant |
| US4322845A | Cites | United States of America | Applicant |
| US4339818A | Cites | United States of America | Applicant |
| US4369434A | Cites | United States of America | Applicant |
| US4373151A | Cites | United States of America | Applicant |
| US4383315A | Cites | United States of America | Applicant |
| US4424417A | Cites | United States of America | Applicant |
| US4445213A | Cites | United States of America | Applicant |
| US4455649A | Cites | United States of America | Applicant |
| US4460992A | Cites | United States of America | Applicant |
| US4472815A | Cites | United States of America | Applicant |
| US4477900A | Cites | United States of America | Applicant |
| US4491947A | Cites | United States of America | Applicant |
| US4494232A | Cites | United States of America | Applicant |
| US4547880A | Cites | United States of America | Applicant |
| US4562572A | Cites | United States of America | Applicant |
| US4587652A | Cites | United States of America | Applicant |
| US4594476A | Cites | United States of America | Applicant |
| US4635221A | Cites | United States of America | Applicant |
| US4688035A | Cites | United States of America | Applicant |
| US4726014A | Cites | United States of America | Applicant |
| US4730340A | Cites | United States of America | Applicant |
| US4774987A | Cites | United States of America | Applicant |
| US4839892A | Cites | United States of America | Applicant |
| US4870642A | Cites | United States of America | Applicant |
| US4872200A | Cites | United States of America | Applicant |
| US4876698A | Cites | United States of America | Applicant |
| US4899337A | Cites | United States of America | Applicant |
| US4901307A | Cites | United States of America | Applicant |
| US4930118A | Cites | United States of America | Applicant |
| US4933952A | Cites | United States of America | Applicant |
| US4939745A | Cites | United States of America | Applicant |
| US4965796A | Cites | United States of America | Applicant |
| US4970648A | Cites | United States of America | Applicant |
| US5003533A | Cites | United States of America | Applicant |
| US5003534A | Cites | United States of America | Applicant |
| US5068849A | Cites | United States of America | Applicant |
| US5101501A | Cites | United States of America | Applicant |
| US5103459A | Cites | United States of America | Applicant |
| US5107377A | Cites | United States of America | Applicant |
| US5115429A | Cites | United States of America | Applicant |
| US5121383A | Cites | United States of America | Applicant |
| US5168575A | Cites | United States of America | Applicant |
| US5172375A | Cites | United States of America | Applicant |
| US5179549A | Cites | United States of America | Applicant |
| US5204876A | Cites | United States of America | Search report |
| US5212684A | Cites | United States of America | Applicant |
| US5212687A | Cites | United States of America | Applicant |
| US5216503A | Cites | United States of America | Applicant |
| US5231649A | Cites | United States of America | Applicant |
| US5276730A | Cites | United States of America | Applicant |
| US5280537A | Cites | United States of America | Applicant |
| US5293640A | Cites | United States of America | Applicant |
| US5305308A | Cites | United States of America | Applicant |
| US5349580A | Cites | United States of America | Applicant |
| US5351240A | Cites | United States of America | Applicant |
| US5381412A | Cites | United States of America | Applicant |
| US5400328A | Cites | United States of America | Applicant |
| US5416797A | Cites | United States of America | Applicant |
| US5420861A | Cites | United States of America | Applicant |
| US5440542A | Cites | United States of America | Applicant |
| US5442625A | Cites | United States of America | Applicant |
| US5511073A | Cites | United States of America | Applicant |
| US5515396A | Cites | United States of America | Search report |
| US5521938A | Cites | United States of America | Applicant |
| US5583851A | Cites | United States of America | Applicant |
| US5586113A | Cites | United States of America | Search report |
| US5689511A | Cites | United States of America | Applicant |
| US5703902A | Cites | United States of America | Applicant |
| US5712869A | Cites | United States of America | Applicant |
| US5719899A | Cites | United States of America | Applicant |
| US5737326A | Cites | United States of America | Applicant |
| US5751761A | Cites | United States of America | Applicant |
| US5757767A | Cites | United States of America | Applicant |
| US5777990A | Cites | United States of America | Applicant |
| US5802445A | Cites | United States of America | Applicant |
| US5805567A | Cites | United States of America | Applicant |
| US5926500A | Cites | United States of America | Search report |
62 members in 22 offices
Priority claims10
| Document | Office | Kind | Date |
|---|---|---|---|
| 78428197 | United States of America | A | |
| 78428197 | United States of America | A | |
| 62577500 | United States of America | A | |
| 62577500 | United States of America | A | |
| 26819102 | United States of America | A | |
| 08784281 | – | – | – |
| 09625775 | – | – | – |
| US19970784281 | – | – | – |
| US20000625775 | – | – | – |
| US20020268191 | – | – | – |
Members62
| Document | Office | Kind | |
|---|---|---|---|
| ZA9879B | South Africa | B | |
| CA2277071A1 | Canada | A1 | |
| WO9832263A2 | World Intellectual Property Organization (WIPO) | A2 | |
| AU5712898A | Australia | A | |
| WO9832263A3 | World Intellectual Property Organization (WIPO) | A3 | |
| US5949814A | United States of America | A | |
| TR1999001657T2 | Türkiye | T2 | |
| TR199901657T2 | Türkiye | T2 | |
| EP0956672A2 | European Patent Office (EPO) | A2 | |
| CN1244983A | China | A | |
| EA199900654A1 | Eurasian Patent Organization (EAPO) | A1 | |
| PL334633A1 | Poland | A1 | |
| TW387179B | Taiwan Province of China | B | |
| BR9714288A | Brazil | A | |
| IL130747A0 | Israel | A0 | |
| IL130747D0 | Israel | D0 | |
| HK1023667A1 | Hong Kong, China | A1 | |
| KR20000070197A | Republic of Korea | A | |
| US6173007B1 | United States of America | B1 | |
| ID27486A | Indonesia | A | |
| JP2001508626A | Japan | A | |
| EA001746B1 | Eurasian Patent Organization (EAPO) | B1 | |
| US6298051B1 | United States of America | B1 | |
| US2002009063A1 | United States of America | A1 | |
| US6501787B1 | United States of America | B1 | |
| US6574210B2 | United States of America | B2 | |
| US2003108088A1 | United States of America | A1 | |
| IL130747A | Israel | A | |
| CN1135762C | China | C | |
| IL156736A0 | Israel | A0 | |
| IL156736D0 | Israel | D0 | |
| US6842477B2This record | United States of America | B2 | |
| KR100567180B1 | Republic of Korea | B1 | |
| EP1802004A2 | European Patent Office (EPO) | A2 | |
| EP0956672B1 | European Patent Office (EPO) | B1 | |
| AT368974T | Austria | T | |
| ATE368974T1 | Austria | T1 | |
| DE69737974D1 | Germany | D1 | |
| EP1802004A3 | European Patent Office (EPO) | A3 | |
| ES2290972T3 | Spain | T3 | |
| DE69737974T2 | Germany | T2 | |
| HK1108980A1 | Hong Kong, China | A1 | |
| EP2106033A2 | European Patent Office (EPO) | A2 | |
| HK1135245A | Hong Kong, China | A | |
| HK1135245A1 | Hong Kong, China | A1 | |
| JP4541453B2 | Japan | B2 | |
| JP2010200343A | Japan | A | |
| EP2288062A1 | European Patent Office (EPO) | A1 | |
| HK1154716A | Hong Kong, China | A | |
| HK1154716A1 | Hong Kong, China | A1 | |
| EP2106033A3 | European Patent Office (EPO) | A3 | |
| EP1802004B1 | European Patent Office (EPO) | B1 | |
| ES2391654T3 | Spain | T3 | |
| JP5144707B2 | Japan | B2 | |
| EP2106033B1 | European Patent Office (EPO) | B1 | |
| EP2288062B1 | European Patent Office (EPO) | B1 | |
| PT2106033E | Portugal | E | |
| PT2288062E | Portugal | E | |
| DK2288062T3 | Denmark | T3 | |
| DK2106033T3 | Denmark | T3 | |
| ES2431796T3 | Spain | T3 | |
| ES2433592T3 | Spain | T3 |
31 transactions on the USPTO file
Allowed after 1 non-final rejection.
- Non-final rejections
- 1
- Final rejections
- 0
- RCEs
- 0
- Appeals
- 0
Over time
Point at a mark for the transactionTransactions
| Event | Code | |
|---|---|---|
| Recordation of Patent Grant MailedPGM/ | PGM/ | |
| Patent Issue Date Used in PTA CalculationAllowedPTAC | PTAC | |
| Issue Notification MailedAllowedWPIR | WPIR | |
| Receipt into PubsR1021 | R1021 | |
| Dispatch to FDCD1935 | D1935 | |
| Dispatch to FDCD1935 | D1935 | |
| Application Is Considered Ready for IssuePILS | PILS | |
| Receipt into PubsR1021 | R1021 | |
| Mail Miscellaneous Communication to ApplicantMM327 | MM327 | |
| Miscellaneous Communication to Applicant - No Action CountM327 | M327 | |
| Issue Fee Payment VerifiedN084 | N084 | |
| Amendment after Notice of Allowance (Rule 312)AllowedA.NA | A.NA | |
| Issue Fee Payment ReceivedIFEE | IFEE | |
| Receipt into PubsR1021 | R1021 | |
| Workflow - File Sent to ContractorSENT | SENT | |
| Receipt into PubsR1021 | R1021 | |
| Dispatch to PublicationsD1220 | D1220 | |
| Mail Notice of AllowanceAllowedMN/=. | MN/=. | |
| Notice of Allowance Data Verification CompletedAllowedN/=. | N/=. | |
| Date Forwarded to ExaminerFWDX | FWDX | |
| Response after Non-Final ActionA... | A... | |
| Workflow incoming amendment IFWWAMD | WAMD | |
| Mail Non-Final RejectionNon-final rejectionMCTNF | MCTNF | |
| Non-Final RejectionNon-final rejectionCTNF | CTNF | |
| Case Docketed to Examiner in GAUDOCK | DOCK | |
| Application Dispatched from OIPEOIPE | OIPE | |
| Application Is Now CompleteCOMP | COMP | |
| IFW Scan & PACR Auto Security Review | – | |
| Information Disclosure Statement (IDS) Filed | – | |
| Information Disclosure Statement (IDS) Filed | – | |
| Initial Exam Team nnIEXX | IEXX |
4 legal events, as the office reported them to INPADOC
Over the term
Point at a mark for the eventEvents
| Event | Code | |
|---|---|---|
| Fee paymentFPAY | FPAY | |
| Fee paymentFPAY | FPAY | |
| Fee paymentFPAY | FPAY | |
| Information on status: patent grantGrantedPATENTED CASESTCF | STCF |
Numbers
- Publication
- 06842477
- Publication, DOCDB
- 6842477
- Publication, EPODOC
- US6842477
- Application
- 10268191
- Application, DOCDB
- 26819102
- Application, EPODOC
- US20020268191
Titles
- English
- High-data-rate supplemental channel for CDMA telecommunications system
Patent term adjustment
- A delay
- +65 daysthe office missed an examination deadline
- Applicant delay
- −75 days
- Net adjustment
- 0 days
Classification
- CPC, 10
- H04B1/707
- H04L12/00
- H04B7/264
- H04J13/0003
- H04J13/0048
- H04L1/0041
- H04L1/0059
- H04L1/0067
- H04L1/08
- H04L2001/0093
- IPC, 5
- H04B1 707
- H04B7 26
- H04J11 00
- H04L
- H04L1 00
- USPC, 2
- 375146000
- 370209000