Transmitter and transmitting method increasing the flexibility of code assignment
Claim Score by NHIP
Abstract
According to the present invention a transmitter and a transmitting method for communicating data symbols over a communication channel, for example, according to the CDMA system is presented. The transmitter (24, 25) comprises means (9) for spreading each data symbol with a respective spreading code, wherein the spreading codes are mutually orthogonal. Means (10) for scrambling are provided to scramble each spread symbol with a respective scrambling code, the scrambling codes respectively having the same length as the spreading codes. Furthermore, means (11) for the transmission of the spread and scrambled symbols are provided. According to the present invention the means (10) for scrambling are provided with a plurality of different scrambling codes, which can be used simultaneously within the same link.
Term
Term ended
Expired 17 March 2019, 7.5 years ago.
- Priority
- Filed
- Granted
- Expired
- Today
18 claims: 5 independent, 13 dependent
- 1Transmitter for communicating data symbols over a communication channel, the transmitter comprising:means for spreading each data symbol with a respective spreading code, wherein the spreading codes are mutually orthogonal, means for scrambling each spread symbol with a respective scrambling code, the scrambling codes respectively having the same length as the spreading codes, and means for transmitting said spread and scrambled symbols, wherein the means for scrambling are provided with a plurality of different scrambling codes which can be used simultaneously within the same link.
- 7Wireless transmission system, comprising:means for spreading each data symbol with a respective spreading code, wherein the spreading codes are mutually orthogonal, means for scrambling each spread symbol with a respective scrambling code, the scrambling codes respectively having the same length as the spreading codes, and means for transmitting said spread and scrambled symbols, wherein the means for scrambling are provided with a plurality of different scrambling codes which can be used simultaneously within the same link, and wherein a subset of scrambling codes is respectively allocated to a cell of the transmission system.
- 9Broadest claimClaim Score 78, broad(NHIP)Method for the transmission of data symbols over a communication channel, comprising the following steps:spreading each data symbol with a respective spreading code, wherein the spreading codes are mutually orthogonal, scrambling each spread symbol with a respective scrambling code, the scrambling codes respectively having the same length as the spreading codes, and transmitting said spread and scrambled symbols, wherein the scrambling step provides a plurality of different scrambling codes which can be used simultaneously within the same link.
- 15A method for transmitting data symbols over an uplink or a downlink, each link having first and second communication channels, comprising:spreading each data symbol for the first communication channel, using a spreader unit, with an associated spreading code, thereby producing a corresponding spread data symbol for each data symbol for the first communication channel in an uplink or a downlink;spreading each data symbol for the second communication channel, using a spreader unit, with an orthogonal spreading code, orthogonal to the associated spreading code for the first communication channel, thereby producing a corresponding spread data symbol for each data symbol for the second communication channel in the uplink or the downlink;scrambling, using a scrambling unit, each spread data symbol of the first communication channel with a primary scrambling code, thereby producing a corresponding scrambled symbol for each spread data symbol of the first communication channel;scrambling, using a scrambling unit, each spread data symbol of the second communication channel with a secondary scrambling code, thereby producing a corresponding scrambled symbol for each spread data symbol of the second communication channel;and transmitting, using a transmitter, said corresponding scrambled symbols, wherein the primary and secondary scrambling codes for the downlink are different from each other and the primary and secondary scrambling codes for the uplink are the same as each other, wherein a resulting data rate is spread over two or more of the scrambled codes.
- 17A method for transmitting one or more data symbols over an uplink or a downlink at data rates, each link having a first communication channel and a second communication channel, comprising:providing the one or more data symbols to the first communication channel and the second communication channel in an uplink or a downlink;spreading each data symbol for the first channel, using a spreader unit, with a first spreading code, producing a first spread data symbol;spreading each data symbol for the second channel, using a spreader unit, with a second spreading code, producing a second spread data symbol, wherein the first spreading code and the second spreading code are mutually orthogonal, scrambling, using a scrambling unit, the first spread data symbol with a primary scrambling code;scrambling, using a scrambling unit, the second spread data symbol with a secondary scrambling code;and providing, using a scrambling unit, a plurality of different scrambling codes for the communication channels in the uplink or the downlink, the scrambling codes being configured simultaneously within the same link, the scrambling codes for the communication channels in the downlink are different from each other when the data symbols in the downlink are of a data rate higher than a voice data rate, and the scrambling codes for the communication channels in the downlink are the same as each other when the data symbols in the downlink are of a data rate equal to or lower than the voice data rate, wherein a resulting data rate is spread over two or more of the plurality of different scrambled codes.
Independent claims5
47 paragraphs, as filed
0001This is a continuation of reissue continuation application Ser. No. 12/537,563, filed Aug. 7, 2009; which is a reissue continuation of reissue application Ser. No. 11/139,004, filed May 26, 2005 (now, U.S. Pat. No. Re. 41,025), which is a reissue of U.S. Pat. No. 6,570,889, issued May 27, 2003.
0002The present invention relates to a transmitter, a wireless transmission system as well as to a method for the transmission of data symbols over a communication channel which particularly finds its application in the field of so-called CDMA systems.
0003CDMA (Code Division Multiple Access) transmitting systems are known from the state of the art. According to one CDMA technique, after the modulation (symbol mapping), the symbols are spread by a so-called spreading sequence or spreading code. After spreading the resulting data stream is scrambled by a scrambling sequence of a scrambling code. The thus resulting data stream, which has been spread and scrambled, is then power-amplified and sent over a communication channel. The reverse procedure happens at the receiving side.
0004In <figref idref="DRAWINGS">FIG. 3</figref> an example for a transmission system comprising scrambling and spreading is shown. In the example of <figref idref="DRAWINGS">FIG. 3</figref> only the downlink communication channel <b>26</b> from a base station <b>24</b> to a mobile station <b>25</b> is shown. The downlink <b>26</b> can comprise different channels D<sub>1</sub>, . . . , D<sub>N</sub>. Each channel comprises channelisation (spreading) <b>28</b>, <b>30</b> and scrambling <b>29</b>, <b>31</b>. According to the state of the art in one link, as for example the downlink <b>26</b> as shown in <figref idref="DRAWINGS">FIG. 3</figref>, only one scrambling sequence (scrambling code) and several different spreading codes (often referred to as channelization codes) are used depending upon the data rate and services required. The drawback of this approach is that only certain types of channelisation codes can be used together and the highest data rate is constrained by the length of the shortest channelisation code. This is especially true when codes of different rates are used.
0005From WO96/05668 A1 and EP-A-565 506 techniques for multiple access coding for radio communication is known. According to these documents information symbols are spread using orthogonal or bi-orthogonal codewords. This spread information symbols are assigned a unique scramble mask that is taken from a set of scramble masks having selected correlation properties. The set of scramble masks is selected such that the correlation between the modulo-2 sum of two scramble masks with any codeword is a constant magnitude independent of the codeword and the individual mask being compared. According to one embodiment of WO 96/05668 A1, when any two masks are summed using modulo-2 sum arithmetic, the Walsh transformation of that sum results in a maximally flat Walsh spectrum. For cellular radio telephone systems using subtractive CDMA demodulation techniques, a two-tier ciphering system ensures security at the cellular system level by using a pseudorandomly generated code key to select one of the scramble masks common to all of the mobile stations in a particular cell. As according to these techniques one common scramble mask is used for all mobile stations in a particular cell, the above-cited drawback arises that only certain types of channelisation codes can be used together limiting the number of available channelisation (spreading) codes.
0006In view of the above-cited drawbacks it is of the object of the present invention to enhance the flexibility of code assignment for a CDMA system, particularly within a cell sector and/or to increase the maximum data rate.
0007The central idea of the present invention thereby is a new code allocation scheme for a CDMA system utilising two or more scrambling codes within one link (uplink or downlink).
0008According to the present invention therefore a transmitter for communicating data symbols over a communication channel is provided, the transmitter comprising means for spreading each data symbol with a respective spreading code, wherein the spreading codes are mutually orthogonal. Furthermore means for scrambling each spread symbol with a respective scrambling code are provided, the scrambling codes respectively having the same length as the spreading codes. Means are provided for the transmission of the spread and scrambled symbols. According to the present invention the means for scrambling are provided with a plurality of different scrambling codes which can be used simultaneously within the same link.
0009The means for scrambling the spread symbols can use different scrambling codes for an uplink communication channel and a downlink communication channel.
0010The spreading codes can be obtained by means of a code tree.
0011According to an aspect of the present invention, only in a downlink communication channel different scrambling codes are used, wherein in an uplink channel only one scrambling code is used.
0012The means for scrambling can use different scrambling codes within the same link only for channels demanding a high bit rate.
0013According to the present invention, furthermore a wireless transmission system comprising a transmitter of the above-cited type is provided, wherein a subset of scrambling codes is respectively allocated to a cell of the transmission system.
0014Different spreading codes can be allocated to adjacent cells of the transmission system.
0015According to the present invention, furthermore a method for the transmission of data symbols over a communication channel is provided. Data symbols are spread with a respective spreading code, wherein the respective spreading codes are mutually orthogonal. Each spread symbol is scrambled with a respective scrambling code, the scrambling codes not changing the band rate of the transmission (in contrast to the spreading codes). The spread and scrambled symbols are transmitted.
0016According to the present invention, when scrambling a plurality of different scrambling codes can be used, which are to be used simultaneously within the same link.
0017In the step of scrambling different scrambling codes can be used for an uplink communication channel and a downlink communication channel, respectively.
0018The spreading codes can be obtained by means of a code tree.
0019As an aspect of the present invention, only in a downlink communication channel different scrambling codes are used. In the uplink communication channel only one scrambling code is used, as the bit rate usually is less than in the downlink communication channel.
0020Different scrambling codes can be used within the same link only for channels demanding a high bit rate.
0021Particularly different scrambling codes within the same link can be used for example for video channels and/or data channels, but for example not for voice channels.
0022Further aspects, advantages and features of the present invention will now be explained by means of embodiments of the present invention and with reference to the enclosed figures of the drawings.
0023<figref idref="DRAWINGS">FIG. 1</figref> shows a general view of a wireless transmission system according to the present invention,
0024<figref idref="DRAWINGS">FIG. 2</figref> shows the spreading and scrambling according to the present invention respectively for a downlink communication channel and a uplink communication channel between a base station and a mobile station of the wireless transmission station as shown in <figref idref="DRAWINGS">FIG. 1</figref>,
0025<figref idref="DRAWINGS">FIG. 3</figref> shows the channelisation (spreading) and scrambling in a downlink communication channel between a base station and a mobile station according to the prior art,
0026<figref idref="DRAWINGS">FIG. 4</figref> shows the plurality of cells in the transmission system according to the present invention,
0027<figref idref="DRAWINGS">FIG. 5</figref> shows an application of the present invention to provide for flexible code allocation in CDMA systems, and
0028<figref idref="DRAWINGS">FIG. 6</figref> shows an application of the present invention to provide for higher data rate services.
0029A transmission system according to the present invention will now be explained generally with reference to <figref idref="DRAWINGS">FIG. 1</figref>. As shown in <figref idref="DRAWINGS">FIG. 1</figref>, different data can be transmitted in a wireless manner. The data to be transmitted can comprise voice data from a telephone <b>1</b>, <b>23</b>, video data, for example, from a video camera <b>5</b> to be transmitted to a monitor <b>20</b> and other information data, as for example, data from a computer <b>6</b> to be transmitted to another computer <b>19</b>. The analog voice data from a telephone <b>1</b> are AD-converted <b>2</b>, voice coded <b>3</b> and then supplied to a channel encoder <b>4</b> included in the transmitter. The data, for example, from a video camera <b>5</b> or from the computer <b>6</b> are also supplied to the channel encoder <b>4</b>. The different data, for example, the voice data and the video data can be transmitted simultaneously. The data from the channel encoder <b>4</b> are given to a interleaver <b>7</b> and then supplied to a modulator <b>8</b> providing for a symbol mapping. The modulated data from the modulator <b>8</b> are then spread <b>9</b> and scrambled <b>10</b>, which will be explained later on in detail. The spread and scrambled data are amplified <b>11</b>, and then transmitted over a wireless transmission path <b>12</b>. It will be seen that the interleaver <b>7</b>, modulator <b>8</b>, spreader <b>9</b>, scrambler <b>10</b>, and amplifier <b>11</b> also are included in the transmitter. On the receiving side the wireless transmitted data are down converted <b>12</b>, A/D converted <b>14</b>, descrambled <b>15</b> and despread <b>16</b>. The descrambling and the despreading will also be explained later on in detail. The descrambled and despread data are de interleaved <b>17</b> and then supplied to a channel decoder <b>18</b>. The channel decoder <b>18</b> outputs data to a computer <b>19</b>, to a monitor <b>20</b> and/or a voice decoder <b>21</b>. In case of the voice data, the voice-decoded-data <b>21</b> are D/A converted <b>22</b> and the supplied to a handset <b>23</b>.
0030With reference to <figref idref="DRAWINGS">FIG. 2</figref>, particularly the scrambling procedure according to the present invention will now be explained in detail.
0031In <figref idref="DRAWINGS">FIG. 2</figref>, the communication between a base station <b>24</b> and a mobile station <b>25</b> is shown. Particularly the downlink channel <b>26</b> from the base station <b>24</b> to the mobile station <b>25</b> includes the transmitter shown in <figref idref="DRAWINGS">FIG. 1</figref>, and the uplink channel <b>27</b> from the mobile station <b>25</b> to the base station <b>24</b> likewise includes the transmitter. The downlink channel <b>26</b> and the uplink channel <b>27</b> comprise different subchannels D<sub>1 </sub>. . . D<sub>N</sub>, D<sub>1′ </sub>. . . D<sub>N′</sub>. A first subset of the subchannels of the downlink channel <b>26</b> can for example be used for voice data and other subchannels can be used for the simultaneous transmission of video data. The data from the base station <b>24</b> are channelised (spread) with different spreading codes C<sub>channel 1</sub>, . . . , C<sub>channel N</sub>, which are mutually orthogonal or bi-orthogonal <b>28</b>, <b>30</b>. The spread data are then scrambled <b>29</b>, <b>31</b> with scrambling codes C<sub>scramble 1</sub>, . . . , C<sub>scramble M</sub>. According to the present invention therefore scrambling codes which are different, but need not be mutually orthogonal or bi-orthogonal, are used within the same link, for example, the downlink <b>26</b>. (The orthogonality requirements are satisfied by the spreading codes.)
0032For the uplink <b>27</b>, according to the present invention either the same scrambling codes C<sub>scramble 1</sub>, . . . , C<sub>scramble M </sub>as in the case of the downlink <b>26</b>, or another group of scrambling codes C<sub>scramble 1′</sub>, . . . , C<sub>scramble M′ </sub>or, as generally the uplink channel <b>27</b> demands for the same high bit rate as the downlink channel <b>26</b>, even just one scrambling code can be used.
0033As it has already been set forth above, the downlink channel <b>26</b> or the uplink channel <b>27</b> can comprise subchannels for video and/or voice transmission. As one aspect of the present invention, different scrambling codes can be allocated for the scrambling of the channels demanding for a high bit rate, as it is the case, for example, for the transmission of video data. For transmission of, for example, voice data, only one scrambling code can be used.
0034Regarding the details of the spreading and scrambling process, particularly the modulo-2 sum operation for the scrambling at the transmission side and the multiplying operation for the descrambling at the reception side, the above-cited documents WO 96/05668 A1 and EP-A-565 506 are incorporated by reference. Particularly <figref idref="DRAWINGS">FIGS. 1 and 2</figref> in the corresponding description (page 14 to page 19) of WO 96/05668 A1 are incorporated by reference.
0035According to the present invention the spreading codes are generated by a code tree. This technique is known from Adachi, “Tree-structured generation of orthogonal spreading codes with different lengths for forward link of DS-CDMA mobile radio”, Electronic Letters, January 1997, Vol. 33, No. 1, page 27, 28, which is incorporated herewith by reference.
0036Orthogonal spreading codes with different lengths can be generated by a tree-structure for orthogonal multiplexing of forward-link code-channels of different data rates in direct sequence code division multiple access DS-CDMA mobile radio. Thereby codes of the same layer of the tree constitute a set of Walsh functions and are orthogonal. Furthermore, any two codes of different layers of the tree structure are also orthogonal except for the case that one of the two codes is a mother code of the other.
0037As it has already been set forth in the introductory portion, when only one scrambling code (or long code) is used per link, there are restrictions of the combinations of codes which can be used for the orthogonal codes (see Adachi et al.) These restrictions may prevent a user from being allocated to a certain channel. These restrictions are especially important for high data rate users. Furthermore the highest data rate is restricted to the shortest orthogonal code.
0038As according to the present invention, two or more scrambling codes are assigned to one link (one user), the following advantages are achieved: <ul id="ul0001" list-style="none"><li id="ul0001-0001" num="0000"><ul id="ul0002" list-style="none"><li id="ul0002-0001" num="0039">increased flexibility in assignment of orthogonal codes since the data rate can be split over at least two scrambling codes and a different (longer) orthogonal code can be chosen from the code tree (see Adachi et al), and</li><li id="ul0002-0002" num="0040">the highest data rate is increased since the data rate can be split over at least two scrambling codes. Therefore a higher data rate service on one link (uplink or downlink) can be provided by using a plurality of scrambling codes within one link. In this way the same channelisation codes (spreading codes) can be reused and a higher data rate can be supported because the highest data rate is restricted by the set of channelisation codes (spreading codes) with the shortest link.</li></ul></li></ul>
0041By only using two scrambling codes (M=2) per link (user), the total number of available channelisation codes (spreading codes) can be doubled and the maximum data rate can also be doubled.
0042<figref idref="DRAWINGS">FIG. 4</figref> shows a symbolized cell distribution of a wireless transmission system. One cell C<sub>1 </sub>is surrounded by six other hexagonal cells C<sub>2</sub>, . . . , C<sub>7</sub>. According to the present invention, a total number of, for example, 512 different scrambling codes can be used. To avoid interference between adjacent cells, the total number of 512 scrambling codes can for example be divided by 7 and each cell C<sub>1</sub>, . . . , C<sub>7 </sub>can be allocated a subset of said scrambling codes. Different users within one cell can use different scrambling codes allocated to the respective cell.
0043As it has already been set forth above, according to the present invention one scrambling code is used in conjunction with a set of channelisation codes (spreading codes) depending upon the required data rate and services required. Adjacent base stations can use different scrambling codes and every base station uses a set of scrambling codes to maintain different links in each cell.
0044An application of the present invention will now be explained with reference to <figref idref="DRAWINGS">FIG. 5</figref>. According to the state of the art, if a new user requests, for example, a 2 Mbit/s service, the base station <b>24</b> is forced to allocate a new scrambling code (and code tree) to support this service. The codes in the code tree are therefore not optimally utilised.
0045To increase the flexibility of code assignment and increase the usage of the codes and the code tree, it is proposed to use as an option more than one scrambling code per link.
0046In <figref idref="DRAWINGS">FIG. 5</figref> a base station <b>24</b> is shown using two scrambling sequences (codes) <b>1</b> and <b>2</b>. Shown by each scrambling code is a set of possible services being supported by each of the scrambling codes. In this load situation, if a new user <b>32</b> requests a 2 Mbit/s service, the base station <b>24</b> has to devote a new scrambling code to support this service.
0047If, however, the new user <b>32</b> uses 2 (SF=4) orthogonal codes from scrambling code <b>1</b> and 1 (SF=4) orthogonal code from scrambling code <b>2</b>, a 2 Mbit/s service can be supported and the codes and the code tree can be more optimally utilised.
0048<figref idref="DRAWINGS">FIG. 6</figref> shows another application of the present invention. According to <figref idref="DRAWINGS">FIG. 6</figref> the idea according to the present invention is used to provide an increased data rate, for example, for a WCDMA system. <figref idref="DRAWINGS">FIG. 6</figref> shows the suggested scheme for an increased data rate. To increase the data rate normally in WCDMA one or both of the following approaches are required: <ul id="ul0003" list-style="none"><li id="ul0003-0001" num="0000"><ul id="ul0004" list-style="none"><li id="ul0004-0001" num="0049">reduction of processing gain, and</li><li id="ul0004-0002" num="0050">increase of chip rate (enhanced bandwidth)</li></ul></li></ul>
0051By utilizing the scheme as shown in <figref idref="DRAWINGS">FIG. 6</figref> the data rate can be increased by combining more than one scrambling code. The example shows the data rate at 4 Mbit/s, but obviously higher rates can be achieved by using more than one scrambling code.
Every citation, both ways
| Document | Relation | Office | Cited during |
|---|---|---|---|
| US2001019576A1 | Cites | United States of America | Applicant |
| US5309474A | Cites | United States of America | Applicant |
| US5341397A | Cites | United States of America | Applicant |
| US5353352A | Cites | United States of America | Applicant |
| US5546423A | Cites | United States of America | Applicant |
| US5550809A | Cites | United States of America | Search report |
| US5677929A | Cites | United States of America | Applicant |
| US5715236A | Cites | United States of America | Applicant |
| US5742678A | Cites | United States of America | Applicant |
| US5757767A | Cites | United States of America | Applicant |
| US5771288A | Cites | United States of America | Applicant |
| US5777990A | Cites | United States of America | Search report |
| US5905962A | Cites | United States of America | Applicant |
| US6009091A | Cites | United States of America | Search report |
| US6072778A | Cites | United States of America | Search report |
| US6108369A | Cites | United States of America | Search report |
| US6163524A | Cites | United States of America | Search report |
| US6173007B1 | Cites | United States of America | Applicant |
| US6198719B1 | Cites | United States of America | Search report |
| US6215762B1 | Cites | United States of America | Search report |
| US6233231B1 | Cites | United States of America | Search report |
| US6339646B1 | Cites | United States of America | Search report |
| US6570889B1 | Cites | United States of America | Search report |
| US6862314B1 | Cites | United States of America | Search report |
| US7123579B1 | Cites | United States of America | Search report |
| WO9605668A1 | Cites | World Intellectual Property Organization (WIPO) | Applicant |
| USRE41025E | Cites | United States of America | Search report |
| US20010019576A1 | Cites | United States of America | Applicant |
| WO9605668 | Cites | World Intellectual Property Organization (WIPO) | Applicant |
| WO9605668A | Cites | World Intellectual Property Organization (WIPO) | Applicant |
| Technical Report (TR) 101 146, V3.0.0 (Dec. 1997), Universal Mobile Telecommunications System (UMTS); UMTS Terrestrial Radio Access (UTRA); Concept Evaluation (UMTS 30.06 version 3.0.0). | Non-patent | – | Applicant |
| Technical Report (TR) 101 146, V3.0.0 (Dec. 1997), Universal Mobile Telecommunications System (UMTS); UMTS Terrestrial Radio Access (UTRA); Concept Evaluation (UMTS 30.06 version 3.0.0). | Non-patent | – | Applicant |
10 members in 4 offices
Priority claims20
| Document | Office | Kind | Date |
|---|---|---|---|
| 98108906 | European Patent Office (EPO) | A | |
| 98108906 | European Patent Office (EPO) | A | |
| 98108906 | European Patent Office (EPO) | – | |
| 27060199 | United States of America | A | |
| 27060199 | United States of America | A | |
| 13900405 | United States of America | A | |
| 13900405 | United States of America | A | |
| 53756309 | United States of America | A | |
| 53756309 | United States of America | A | |
| 201313953036 | United States of America | A | |
| 09270601 | – | – | – |
| 09270601 | – | – | – |
| 11139004 | – | – | – |
| 12537563 | – | – | – |
| 98108906 | – | – | – |
| EP19980108906 | – | – | – |
| US19990270601 | – | – | – |
| US20050139004 | – | – | – |
| US20090537563 | – | – | – |
| US201313953036 | – | – | – |
Members10
| Document | Office | Kind | |
|---|---|---|---|
| EP0957604A1 | European Patent Office (EPO) | A1 | |
| JP2000031939A | Japan | A | |
| US6570889B1 | United States of America | B1 | |
| EP0957604B1 | European Patent Office (EPO) | B1 | |
| DE69832589D1 | Germany | D1 | |
| DE69832589T2 | Germany | T2 | |
| USRE41025E | United States of America | E | |
| USRE46327E | United States of America | E | |
| USRE46477E | United States of America | E | |
| USRE46541EThis record | United States of America | E |
77 transactions on the USPTO file
Allowed after 3 non-final rejections, 2 final rejections and 1 RCE.
- Non-final rejections
- 3
- Final rejections
- 2
- RCEs
- 1
- Appeals
- 0
Over time
Point at a mark for the transactionTransactions
| Event | Code | |
|---|---|---|
| Recordation of Patent Grant MailedPGM/ | PGM/ | |
| Email NotificationEML_NTR | EML_NTR | |
| Application ready for PDX access by participating foreign officesCCRDY | CCRDY | |
| 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 | |
| Response to Reasons for AllowanceREAS | REAS | |
| Electronic ReviewELC_RVW | ELC_RVW | |
| Email NotificationEML_NTF | EML_NTF | |
| Mail Notice of AllowanceAllowedMN/=. | MN/=. | |
| Notice of Allowance Data Verification CompletedAllowedN/=. | N/=. | |
| Reasons for AllowanceEX.R | EX.R | |
| Response after Final ActionA.NE | A.NE | |
| Date Forwarded to ExaminerFWDX | FWDX | |
| Oath or Declaration Filed (Including Supplemental)C602 | C602 | |
| Response after Final ActionA.NE | A.NE | |
| Email NotificationEML_NTR | EML_NTR | |
| Mail Advisory Action (PTOL - 303)MCTAV | MCTAV | |
| Advisory Action (PTOL-303)CTAV | CTAV | |
| Date Forwarded to ExaminerFWDX | FWDX | |
| Response after Final ActionA.NE | A.NE | |
| Electronic ReviewELC_RVW | ELC_RVW | |
| Email NotificationEML_NTF | EML_NTF | |
| Mail Final Rejection (PTOL - 326)Final rejectionMCTFR | MCTFR | |
| Final RejectionFinal rejectionCTFR | CTFR | |
| Date Forwarded to ExaminerFWDX | FWDX | |
| Response after Non-Final ActionA... | A... | |
| Electronic ReviewELC_RVW | ELC_RVW | |
| Email NotificationEML_NTF | EML_NTF | |
| Mail Non-Final RejectionNon-final rejectionMCTNF | MCTNF | |
| Non-Final RejectionNon-final rejectionCTNF | CTNF | |
| Date Forwarded to ExaminerFWDX | FWDX | |
| Response after Non-Final ActionA... | A... | |
| Request for Extension of Time - GrantedXT/G | XT/G | |
| Case Docketed to Examiner in GAUDOCK | DOCK | |
| Case Docketed to Examiner in GAUDOCK | DOCK | |
| Electronic ReviewELC_RVW | ELC_RVW | |
| Email NotificationEML_NTF | EML_NTF | |
| Mail Non-Final RejectionNon-final rejectionMCTNF | MCTNF | |
| Non-Final RejectionNon-final rejectionCTNF | CTNF | |
| Mail Miscellaneous Communication to ApplicantMM327 | MM327 | |
| Miscellaneous Communication to Applicant - No Action CountM327 | M327 | |
| Mail Miscellaneous Communication to ApplicantMM327 | MM327 | |
| Miscellaneous Communication to Applicant - No Action CountM327 | M327 | |
| Disposal for a RCE / CPA / R129AbandonedABN9 | ABN9 | |
| Date Forwarded to ExaminerFWDX | FWDX | |
| Request for Continued Examination (RCE)RCEX | RCEX | |
| Request for Extension of Time - GrantedXT/G | XT/G | |
| Workflow - Request for RCE - BeginBRCE | BRCE | |
| Electronic ReviewELC_RVW | ELC_RVW | |
| Email NotificationEML_NTF | EML_NTF | |
| Mail Final Rejection (PTOL - 326)Final rejectionMCTFR | MCTFR | |
| Final RejectionFinal rejectionCTFR | CTFR | |
| Date Forwarded to ExaminerFWDX | FWDX | |
| Response after Non-Final ActionA... | A... | |
| Mail Non-Final RejectionNon-final rejectionMCTNF | MCTNF | |
| Non-Final RejectionNon-final rejectionCTNF | CTNF | |
| Case Docketed to Examiner in GAUDOCK | DOCK | |
| Transfer Inquiry to GAUTI1050 | TI1050 | |
| Transfer Inquiry to GAUTI1050 | TI1050 | |
| Notice of Reissue Published in Official GazetteNRE. | NRE. | |
| Application Is Now CompleteCOMP | COMP | |
| Filing ReceiptFLRCPT.O | FLRCPT.O | |
| FITF set to NO - revise initial settingFTFI | FTFI | |
| Application Is Now CompleteCOMP | COMP | |
| Application Dispatched from OIPEOIPE | OIPE | |
| Cleared by OIPE CSRL194 | L194 | |
| Electronic Information Disclosure StatementEIDS. | EIDS. | |
| Information Disclosure Statement consideredIDSC | IDSC | |
| Information Disclosure Statement (IDS) FiledM844 | M844 | |
| Preliminary AmendmentA.PE | A.PE | |
| Information Disclosure Statement (IDS) FiledWIDS | WIDS | |
| IFW Scan & PACR Auto Security ReviewSCAN | SCAN | |
| Entity status set to undiscounted (initial default setting or status change)BIG. | BIG. | |
| Initial Exam Team nnIEXX | IEXX |
2 recorded assignments at the USPTO, latest first
- Now
Now: Held by
SONY CORP - 2016-10-14
Assignment of assignors interest.
Ownership change- From
- SONY DEUTSCHLAND GMBH
- To
- SONY CORPSONY CORPORATION
Recorded 2016-10-14, Signed 2016-03-23
- 2013-12-19
Merger.
- From
- SONY INTERNATIONAL GMBHSONY INTERNATIONAL (EUROPE) GMBH
- To
- SONY DEUTSCHLAND GMBH
Recorded 2013-12-19, Signed 2004-11-22
2 legal events, as the office reported them to INPADOC
Over the term
Point at a mark for the eventEvents
| Event | Code | |
|---|---|---|
| AssignmentAS | AS | |
| AssignmentAS | AS |
Numbers
- Publication
- RE046541
- Publication, DOCDB
- RE46541
- Publication, EPODOC
- USRE46541E
- Application
- 13953036
- Application, DOCDB
- 201313953036
- Application, EPODOC
- US201313953036
Titles
- English
- Transmitter and transmitting method increasing the flexibility of code assignment
Classification
- CPC, 4
- H04J13/004
- H04B1/707
- H04B7/2628
- H04L25/03866
- IPC, 6
- H04J13 00
- H04L25 03
- H04B1 707
- H04B7 26
- H04B7 24
- H04J11 00
- USPC, 1
- 001001000