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.
|
0. 15. A 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.
0. 17. A 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.
0. 1. Transmitter 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.
0. 2. Transmitter according to
0. 3. Transmitter according
0. 4. Transmitter according to
0. 5. Transmitter according to
0. 6. Transmitter according to
0. 7. Wireless 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.
0. 8. Wireless transmission system according to
0. 9. 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.
0. 10. Method according to
0. 11. Method according to
0. 12. Method according to
0. 13. Method according to
0. 14. Method according to
0. 16. The method according to claim 15, wherein the primary or secondary scrambling code does not effect a band rate of the transmission.
0. 18. The method of transmitting according to claim 17 wherein the plurality of different scrambling codes comprise a portion of the primary scrambling code and a portion of the secondary scrambling code.
|
This 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.
The 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.
CDMA (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.
In
From 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.
In 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.
The 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).
According 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.
The means for scrambling the spread symbols can use different scrambling codes for an uplink communication channel and a downlink communication channel.
The spreading codes can be obtained by means of a code tree.
According 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.
The means for scrambling can use different scrambling codes within the same link only for channels demanding a high bit rate.
According 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.
Different spreading codes can be allocated to adjacent cells of the transmission system.
According 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.
According 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.
In the step of scrambling different scrambling codes can be used for an uplink communication channel and a downlink communication channel, respectively.
The spreading codes can be obtained by means of a code tree.
As 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.
Different scrambling codes can be used within the same link only for channels demanding a high bit rate.
Particularly 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.
Further 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.
A transmission system according to the present invention will now be explained generally with reference to
With reference to
In
For the uplink 27, according to the present invention either the same scrambling codes Cscramble 1, . . . , Cscramble M as in the case of the downlink 26, or another group of scrambling codes Cscramble 1′, . . . , Cscramble M′ or, as generally the uplink channel 27 demands for the same high bit rate as the downlink channel 26, even just one scrambling code can be used.
As it has already been set forth above, the downlink channel 26 or the uplink channel 27 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.
Regarding 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
According 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.
Orthogonal 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.
As 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.
As according to the present invention, two or more scrambling codes are assigned to one link (one user), the following advantages are achieved:
By 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.
As 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.
An application of the present invention will now be explained with reference to
To 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.
In
If, however, the new user 32 uses 2 (SF=4) orthogonal codes from scrambling code 1 and 1 (SF=4) orthogonal code from scrambling code 2, a 2 Mbit/s service can be supported and the codes and the code tree can be more optimally utilised.
By utilizing the scheme as shown in
Stirling-Gallacher, Richard, Jürgensen, Jens-Uwe
Patent | Priority | Assignee | Title |
Patent | Priority | Assignee | Title |
5309474, | Jun 25 1990 | Qualcomm Incorporated | System and method for generating signal waveforms in a CDMA cellular telephone system |
5341397, | Apr 13 1992 | Telefonaktiebolaget L M Ericsson | CDMA frequency allocation |
5353352, | Apr 10 1992 | ERICSSON GE MOBILE COMMUNICATIONS, INC A CORPORATION OF NEW JERSEY | Multiple access coding for radio communications |
5546423, | Jun 09 1993 | Alcatel Telspace | Spread spectrum digital transmission system using low-frequency pseudorandom encoding of the wanted information and spectrum spreading and compression method used in a system of this kind |
5550809, | Apr 10 1992 | ERICSSON GE MOBILE COMMUNICATIONS, INC | Multiple access coding using bent sequences for mobile radio communications |
5677929, | Jul 16 1993 | INVT SPE LLC | Automobile on-board and/or portable telephone system |
5715236, | Jun 25 1990 | Qualcomm Incorporated | System and method for generating signal waveforms in a CDMA cellular telephone system |
5742678, | Aug 16 1994 | Ericsson, Inc. | Multiple access coding for radio communications |
5757767, | Apr 18 1995 | Qualcomm Incorporated | Method and apparatus for joint transmission of multiple data signals in spread spectrum communication systems |
5771288, | Apr 10 1992 | Ericsson, Inc | Multiple access coding for radio communications |
5777990, | Feb 28 1995 | Qualcomm Incorporated | Method and apparatus for providing variable rate data in a communications system using non-orthogonal overflow channels |
5905962, | Dec 23 1994 | Nokia Technologies Oy | Apparatus and method for data transmission to inhibit radio signal fading with sequential transmission of data groups based upon power levels |
6009091, | Mar 13 1998 | Google Technology Holdings LLC | Method and apparatus for mobile station location within a communication system |
6072778, | Aug 14 1996 | Google Technology Holdings LLC | Method of controlling a communication system |
6108369, | Jul 11 1997 | Telefonaktiebolaget LM Ericsson | Channelization code allocation for radio communication systems |
6163524, | Oct 19 1998 | Unwired Planet, LLC | Code allocation in CDMA |
6173007, | Jan 15 1997 | Qualcomm Incorporated | High-data-rate supplemental channel for CDMA telecommunications system |
6198719, | Feb 27 1998 | Nortel Networks Limited | Bi-orthogonal code division multiple access system |
6215762, | Jul 22 1997 | Ericsson Inc. | Communication system and method with orthogonal block encoding |
6233231, | Dec 03 1998 | Google Technology Holdings LLC | Data transmission within a spread-spectrum communication system |
6339646, | Nov 03 1998 | TELEFONAKTIEBOLAGET L M ERICSSON PUBL | Slotted mode code usage in a cellular communications system |
6570889, | May 15 1998 | Sony Corporation | Transmitter and transmitting method increasing the flexibility of code assignment |
6862314, | Oct 23 1998 | Sony International (Europe) GmbH | Receiver architecture for a multi scrambling code transmission CDMA technique |
7123579, | Aug 04 1999 | LG Electronics Inc | Method of transmitting non-orthogonal physical channels in the communications system |
20010019576, | |||
RE41025, | May 15 1998 | Sony Corporation | Transmitter and transmitting method increasing the flexibility of code assignment |
WO9605668, |
Executed on | Assignor | Assignee | Conveyance | Frame | Reel | Doc |
Nov 22 2004 | SONY INTERNATIONAL EUROPE GMBH | Sony Deutschland GmbH | MERGER SEE DOCUMENT FOR DETAILS | 031818 | /0333 | |
Jul 29 2013 | Sony Corporation | (assignment on the face of the patent) | / | |||
Mar 23 2016 | Sony Deutschland GmbH | Sony Corporation | ASSIGNMENT OF ASSIGNORS INTEREST SEE DOCUMENT FOR DETAILS | 040013 | /0946 |
Date | Maintenance Fee Events |
Date | Maintenance Schedule |
Sep 05 2020 | 4 years fee payment window open |
Mar 05 2021 | 6 months grace period start (w surcharge) |
Sep 05 2021 | patent expiry (for year 4) |
Sep 05 2023 | 2 years to revive unintentionally abandoned end. (for year 4) |
Sep 05 2024 | 8 years fee payment window open |
Mar 05 2025 | 6 months grace period start (w surcharge) |
Sep 05 2025 | patent expiry (for year 8) |
Sep 05 2027 | 2 years to revive unintentionally abandoned end. (for year 8) |
Sep 05 2028 | 12 years fee payment window open |
Mar 05 2029 | 6 months grace period start (w surcharge) |
Sep 05 2029 | patent expiry (for year 12) |
Sep 05 2031 | 2 years to revive unintentionally abandoned end. (for year 12) |