Transmitter and transmitting method increasing the flexibility of code assignment

- SONY CORPORATION

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.

Skip to: Description  ·  Claims  ·  References Cited  · Patent History  ·  Patent History
Description

This is a reissue of application Ser. No. 09/270,601, filed Mar. 17, 1999, which issued as U.S. Pat. No. 6,570,889. This application is a continuation of application Ser. No. 12/537,531, filed Aug. 7, 2009, which is a continuation of application Ser. No. 11/139,004, filed May 26, 2005 (now U.S. Pat. No. Re. 41,025), which is a reissue of application Ser. No. 09/270,601. More than one reissue applications have been filed, namely, application Ser. No. 12/537,563, application Ser. No. 12/537,591, application Ser. No. 13/953,036, application Ser. No. 13/953,084 and the present application.

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 FIG. 3 an example for a transmission system comprising scrambling and spreading is shown. In the example of FIG. 3 only the downlink communication channel 26 from a base station 24 to a mobile station 25 is shown. The downlink 26 can comprise different channels D1, . . . , DN. Each channel comprises channelisation (spreading) 28, 30 and scrambling 29, 31. According to the state of the art in one link, as for example the downlink 26 as shown in FIG. 3, 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.

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.

FIG. 1 shows a general view of a wireless transmission system according to the present invention,

FIG. 2 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 FIG. 1,

FIG. 3 shows the channelisation (spreading) and scrambling in a downlink communication channel between a base station and a mobile station according to the prior art,

FIG. 4 shows the plurality of cells in the transmission system according to the present invention,

FIG. 5 shows an application of the present invention to provide for flexible code allocation in CDMA systems, and

FIG. 6 shows an application of the present invention to provide for higher data rate services.

A transmission system according to the present invention will now be explained generally with reference to FIG. 1. As shown in FIG. 1, different data can be transmitted in a wireless manner. The data to be transmitted can comprise voice data from a telephone 1, 23, video data, for example, from a video camera 5 to be transmitted to a monitor 20 and other information data, as for example, data from a computer 6 to be transmitted to another computer 19. The analog voice data from a telephone 1 are A/D-converted 2, voice coded 3 and then supplied to a channel encoder 4 included in the transmitter. The data, for example, from a video camera 5 or from the computer 6 are also supplied to the channel encoder 4. The different data, for example, the voice data and the video data can be transmitted simultaneously. The data from the channel encoder 4 are given to a interleaver 7 and then supplied to a modulator 8 providing for a symbol mapping. The modulated data from the modulator 8 are then spread 9 and scrambled 10, which will be explained later on in detail. The spread and scrambled data are amplified 11, and then transmitted over a wireless transmission path 12. It will be seen that the interleaver 7, modulator 8, spreader 9, scrambler 10, and amplifier 11 also are included in the transmitter. On the receiving side the wireless transmitted data are down converted 12, A/D converted 14, descrambled 15 and despread 16. The descrambling and the despreading will also be explained later on in detail. The descrambled and despread data are de interleaved 17 and then supplied to a channel decoder 18. The channel decoder 18 outputs data to a computer 19, to a monitor 20 and/or a voice decoder 21. In case of the voice data, the voice-decoded-data 21 are D/A converted 22 and the supplied to a handset 23.

With reference to FIG. 2, particularly the scrambling procedure according to the present invention will now be explained in detail.

In FIG. 2, the communication between a base station 24 and a mobile station 25 is shown. Particularly the downlink channel 26 from the base station 24 to the mobile station 25 includes the transmitter shown in FIG. 1, and the uplink channel 27 from the mobile station 25 to the base station 24 likewise includes the transmitter. The downlink channel 26 and the uplink channel 27 comprise different subchannels D1 . . . DN, D1′, . . . DN′. A first subset of the subchannels of the downlink channel 26 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 24 are channelised (spread) with different spreading codes Cchannel 1, . . . , Cchannel N, which are mutually orthogonal or bi-orthogonal 28, 30. The spread data are then scrambled 29, 31 with scrambling codes Cscramble 1, . . . , Cscramble M. 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 26. (The orthogonality requirements are satisfied by the spreading codes.)

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 FIGS. 1 and 2 in the corresponding description (page 14 to page 19) of WO 96/05668 A1 are incorporated by reference.

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:

    • 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
    • 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.

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.

FIG. 4 shows a symbolized cell distribution of a wireless transmission system. One cell C1 is surrounded by six other hexagonal cells C2, . . . , C7. 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 C1, . . . , C7 can be allocated a subset of said scrambling Codes. Different users within one cell can use different scrambling codes allocated to the respective cell.

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 FIG. 5. According to the state of the art, if a new user requests, for example, a 2 Mbit/s service, the base station 24 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.

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 FIG. 5 a base station 24 is shown using two scrambling sequences (codes) 1 and 2. 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 32 requests a 2 Mbit/s service, the base station 24 has to devote a new scrambling code to support this service.

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.

FIG. 6 shows another application of the present invention. According to FIG. 6 the idea according to the present invention is used to provide an increased data rate, for example, for a WCDMA system. FIG. 6 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:

    • reduction of processing gain, and
    • increase of chip rate (enhanced bandwidth)

By utilizing the scheme as shown in FIG. 6 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.

Claims

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.

2. Transmitter according to claim 1, characterized in that the means for scrambling can use different scrambling codes for an uplink communication channel and a downlink communication channel, respectively.

3. Transmitter according claim 1, characterized in that the spreading codes are obtained by means of a code tree.

4. Transmitter according to claim 1, characterized in that only in a downlink communication channel different scrambling codes are used, wherein in an uplink channel only one scrambling code is used.

5. Transmitter according to claim 1, characterized in that the means for scrambling use different scrambling codes within the same link only for channels demanding a high bit rate.

6. Transmitter according to claim 5, characterized in that the means for scrambling use different scrambling codes within the same link only video channels.

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.

8. Wireless transmission system according to claim 7, characterized in that different spreading codes are allocated to adjacent cells of the transmission system.

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.

10. Method according to claim 9, characterized in that in the step of scrambling different scrambling codes can be used for an uplink communication channel and a downlink communication channel, respectively.

11. Method according to claim 9, characterized in that the spreading codes are obtained by means of a code tree.

12. Method according to claim 9, characterized in that only in a downlink communication channel different scrambling codes are used, wherein in an uplink channel only one scrambling code is used.

13. Method according to claim 9, characterized in that different scrambling codes within the same link are used only for channels demanding a high bit rate.

14. Method according to claim 13, characterized in that different scrambling codes within the same link are used only for video channels.

15. A method for transmitting one or more data symbols over first and second communication channels in an uplink or a downlink, comprising:

spreading for the first and second communication channels each of the one or more data symbols using a spreader unit, with one or more associated spreading codes to produce a corresponding spread data symbol for each data symbol for the first and second communication channels, respectively,
wherein the one or more associated spreading codes are mutually orthogonal;
scrambling, using a scrambling unit, each spread data symbol of the first communication channel with a respective scrambling code to produce corresponding mutually orthogonal scrambled symbols for the first communication channel;
scrambling, using a scrambling unit, each spread data symbol of the second communication channel with a respective scrambling code to produce corresponding mutually orthogonal scrambled symbols for the second communication channel;
assigning a plurality of mutually orthogonal scrambled codes to one user,
wherein different scrambling codes are used for the first and second communication channels in a link for transmitting data symbols at a data bit rate higher than voice data bit rate, and the same scrambling code is used for the first and second communication channels in a link for transmitting data symbols at a voice data bit rate;
wherein a resulting data rate is spread over two or more of the plurality of mutually orthogonal scrambled codes in the single communication channel; and
transmitting, using a transmitter, each corresponding scrambled symbol.

16. The method according to claim 15, wherein the one or more associated scrambling code does not effect a band rate of the transmission.

17. The method according to claim 15, wherein at least one of the one or more associated scrambling codes has the same length of an associated spreading code.

18. The method according to claim 15, wherein the different scrambling codes are a subset of available scrambling codes.

19. The method according to claim 15, wherein the associated spreading code is based on a data rate.

20. The method according to claim 15, wherein the associated spreading code is based on a service requirement.

Referenced Cited
U.S. Patent Documents
5103459 April 7, 1992 Gilhousen et al.
5309474 May 3, 1994 Gilhousen et al.
5341397 August 23, 1994 Gudmundson
5353352 October 4, 1994 Dent et al.
5546423 August 13, 1996 Sehier et al.
5550809 August 27, 1996 Bottomley
5677929 October 14, 1997 Asano et al.
5715236 February 3, 1998 Gilhousen et al.
5737326 April 7, 1998 I et al.
5742678 April 21, 1998 Dent et al.
5757767 May 26, 1998 Zehavi
5771268 June 23, 1998 Dent et al.
5777990 July 7, 1998 Zehavi
5781542 July 14, 1998 Tanaka et al.
5781583 July 14, 1998 Bruckert et al.
5905962 May 18, 1999 Richardson
6009091 December 28, 1999 Stewart
6072778 June 6, 2000 Labedz
6108369 August 22, 2000 Ovesjo
6163524 December 19, 2000 Magnusson
6173007 January 9, 2001 Odenwalder et al.
6198719 March 6, 2001 Faruque
6215762 April 10, 2001 Dent
6215777 April 10, 2001 Chen et al.
6233231 May 15, 2001 Felix
6339646 January 15, 2002 Dahlman
6862314 March 1, 2005 Jurgensen
7123579 October 17, 2006 Lyu
RE41025 December 1, 2009 Stirling-Gallacher
20010019576 September 6, 2001 Nystrom et al.
Foreign Patent Documents
WO 96 05668 February 1990 WO
WO 96 05668 February 1996 WO
Other references
  • 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).
Patent History
Patent number: RE46477
Type: Grant
Filed: Jul 29, 2013
Date of Patent: Jul 11, 2017
Assignee: SONY CORPORATION (Tokyo)
Inventors: Richard Stirling-Gallacher (Stuttgart), Jens-Uwe Jürgensen (Munich)
Primary Examiner: David England
Application Number: 13/952,971
Classifications
Current U.S. Class: Quadrature Carriers (370/206)
International Classification: H04J 13/00 (20110101); H04B 7/26 (20060101); H04L 25/03 (20060101); H04B 1/707 (20110101);