GB2373691A

GB2373691A - Transmitter which applies a different phase shift to each channel of a spread spectrum signal

Info

Publication number: GB2373691A
Application number: GB0127290A
Authority: GB
Inventors: Stephen William Wales
Original assignee: Roke Manor Research Ltd
Current assignee: Roke Manor Research Ltd
Priority date: 2000-11-09
Filing date: 2001-11-09
Publication date: 2002-09-25
Also published as: GB0127290D0; AU2002215101A1; WO2002039590A3; WO2002039590A2; GB0027392D0

Abstract

A CDMA spread spectrum system is disclosed. A transmitter receives N input signals d<SB>n</SB> <SP>(i)</SP> (10, Fig. 1) from a plurality of users, and multiplies each with a different orthogonal spreading code c<SB>m</SB><SP>(i)</SP> (12, Fig. 1) in spreading modulators 24 to produce N spread spectrum signal d<SB>n</SB><SP>(i)</SP>.c<SB>m</SB><SP>(i)</SP> (16, Fig. 1). Multipliers 40 then apply a different phase shift to each of the spread spectrum signals. These signals are then summed together in summer 26, the output of which is modulated with a carrier wave in modulator 28. In an alternative embodiment the phase shifts are applied to the input signals before the spreading codes are applied. A complementary receiver 30, 32, 44, 34 is also disclosed. By choosing appropriate phase shifts the transmission power requirements can be distributed evenly over the length of the spreading code, thus reducing the power demand on the transmitter and also reducing signal distortion. The spreading codes are preferably Walsh-Hadamard codes.

Description

METHODS AND APPARATUS FOR ENCODING AND DECODING

DATA The present invention relates to methods and apparatus for encoding and 5 decoding data. More particularly, it relates to the encoding and decoding of data using spreading codes such as Walsh-Hadamard codes or the like to enable multiple channels of data to be encoded into a single expanded bandwidth, and to be selectively decoded upon reception.

Code division multiplexing allows multiple signals to be transmitted in a 10 common bandwidth over a common transmission path, and to be selectively extracted and decoded, to enable a particular user to receive data intended for that user without receiving data intended for another user. In particular, spreading codes such as Walsh-Hadamard codes may be employed, as illustrated in Fig. 1. In Fig. 1, dn(i) 10 represents the time variance of a data signal to be transmitted on a particular 15. code, i. One or more from a set of Walsh-Hadamard codes, cm(i' 127 is allocated to the user i. The corresponding time-variance of the code is illustrated at cm(i) 12 in ? Fig. 1. The code cm(i) is composed of a number of chips 14, as is known in the art.

The number of chips in a code is also known as the spreading factor (SF) of that code. The data signal dab) 10 is then multiplied by the WalshHadamard code cm(i) 20 12, to produce a spread spectrum data signal dn i). cm(i) 16, illustrated in Fig. 1. This signal 16 is then modulated onto a carrier signal exp(j t) by multiplication, to produce a modulated spreadspectrum data signal I:dn(i).cm(i).g(t-mTc).exp(jc3t) 20, as illustrated in Fig. 1. In the preceding expression, g() represents a pulse shaping function, while t represents time and Tc represents the chip period. As may be seen 25 from the figure, the effect of the modulation is to reverse the phase of the carrier signal at every level transition 22 of the spread spectrum data signal.

Walsh-Hadamard codes have the property of being orthogonal, that is, if the coded (spread spectrum) data signal dn(i'.cm(i) 16 is further multiplied by the Walsh-

Hadamard code cm(i', de-spreading takes place and the original data signal anti) 10 is 30 obtained. However, another coded (spread spectrum) data signal dn0).cm , intended for a different user j, and using a different code cm0) will return a zero value when multiplied by the Walsh- Hadamard code cm(i>.

Accordingly, when the modulated signal dn(i).cm(i).exp(jcot) 20 is received at the user, it is first demodulated by multiplication by exp(jcet) to reconstruct the spread spectrum data signal dn(i).cm(i) 16, which is then de-spread by multiplication by car) to reproduce the data signal dn(i) 10.

5 Fig. 2 shows an example of a multi-user code-division multiplex system, in which numerous users will receive their own specific data. Data dn(i), dn 10 for each user i, j is encoded in a corresponding spreading modulator 24, and the resultant signals dn(i).cm(i), dn .cm0) 16 may be summed together at a summer 26 before modulation by a modulator 28 before transmission as transmit signal tx. A 10 user i will then receive the sum of the data signals rx, demodulate the summed data signals in demodulator 30 and then multiply the summed data signals by the corresponding WalshHadamard code cm(i) in a de-spreader 32 corresponding to the spreading modulator 24, then to a summer which sums the returned values for all chips in the code, thereby to reconstruct the original data signal dn(i) 10 at the output 15 for that user, but will return a zero value for all other data signals dn0).

Often it is necessary to transmit multiple channels, where each channel has its own data source, and the spreading process is performed for different channels using a different Walsh-Hadamard code. In some circumstances the data for each channel may not be independent so that the data symbols from each source are 20 similar for long periods. This may occur for example in a multi-cast scenario, where each channel is essentially sending the same data. It may also occur when for example data sources produce long sequences of the same data symbol. With multiple sources of this type the same data symbols will occur at the same time on different channels. With spreading performed using Walsh- Hadamard codes the 25 result causes a high peak transmit power. At any such peak value of such transmission, a very large power demand is placed on the transmitter, possibly causing compression of the signal to be transmitted, leading to errors in reproduction. Alternatively, or in addition, degradation of the received signal may occur in the receiver due to the very high magnitude of the received signal.

30 The table shown in Figure 3 gives the sum of different numbers of Walsh Hadamard codes of length 16, that is, the spreading factor SF has a value of 16.

In the example set of Walsh-Hadarnard codes used to generate the sequences of Fig. 3, the rows represent sequential time periods, indicated by the arrow t, each row corresponding to one chip length within the spreading code which is preferably a Walsh Hadamard code, see for example cm(i'in Fig. 1. The first row, for example, 5 shows the sum of the values of all 8, 12 or 16 corresponding Walsh-Hadamard codes during the first chip. The second row shows the sum of their values during the second chip, and so on for the other rows. The illustrated example is a worst-

case scenario illustrating the signal strength (voltage) transmitted if a same data signal is transmitted to each of the 8, 12 or 16 users.

10 The present invention aims to reduce such peaks of power and the attendant drawbacks, while remaining within the Walsh-Hadamard coding scheme or other selected orthogonal spreading factors.

According to an aspect of the present invention, a phase shift is applied to the spread spectrum (coded) data signal dn(i.cm i).

15 In accordance with the present invention, there is provided a method for encoding data, comprising the steps of: (i) generating a respective data signal for each of a plurality of users; (ii) coding (24) each of the data signals with a respective orthogonal spreading code to produce respective encoded data signals; and (iii) summing the encoded data signals to produce a total encoded data signal, the 20 method further comprising the step of applying a phase shift to one of the data signal, the encoded data signal and the total encoded data signal.

The step of applying a phase shift may comprise multiplication of the corresponding term by a term of the form exp(jO, between steps (i) and (ii) or between steps (ii) and (iii).

25 Such methods according to the present invention may comprise the steps of: (i) receiving an encoded signal comprising a summation of coded data signals for each of a plurality of users; and (ii) extracting and decoding a respective one of the data signals by application of a respective orthogonal spreading code to produce a respective data signal. The method may further comprise the step of applying a 30 phase shift to one of the data signal and the encoded signal. In such a method, the step of applying a phase shift may comprise multiplication of the corresponding term by a term of the form exp(jO, before or after step (ii) .

The orthogonal spreading code may comprise a plurality of chips, and the method may further comprise summing the resultant respective data signal, to produce an output data signal.

The present invention also provides data encoding apparatus comprising: (i) 5 a data encoder for encoding a respective data signal with a respective orthogonal spreading code to produce respective encoded data signal; and (ii) a complex summer for summing the encoded data signals to produce a total encoded data signal, characterized in that the apparatus further comprises a phase shift element for applying a phase shift to one of the data signal, the encoded data signal and the 10 total encoded data signal.

The phase shift element may comprise a multiplier arranged to multiply the corresponding term by a term of the form exp(jO, any such multiplier preferably being located in the signal path before or after the data encoder.

The present invention also provides data decoding apparatus comprising a 15 data decoder for decoding a respective data signal from a combined data signal by application of a respective orthogonal spreading code to produce a respective decoded data signal. The apparatus further comprises a phase shift element arranged to apply a phase shift to one of the data signal and the respective decoded signal. 20 The phase shift element may be arranged in the signal path before or after the data decoder, to multiply the corresponding term by a term of the form exp(jO.

The orthogonal spreading code may comprise a plurality of chips, and the apparatus may further comprise a summer arranged to sum the resultant respective data signal, to produce an output data signal.

25 Each orthogonal spreading code may consist of one of a set of Walsh Hadamard codes.

The above, and further, objects, characteristics and advantages of the present invention will become more apparent with reference to the following description of

30 certain embodiments thereof, given by way of examples only, with reference to the accompanying drawings in which:

Fig. 1 shows examples of signals used in an encoding method of the prior art; Fig. 2 shows an example of data encoding and decoding apparatus according to the prior art;

5 Fig. 3 shows transmit signal strength, voltage, values for multicast spreading code encoded signals according to the prior art;

Fig. 4 shows an embodiment of data encoding and decoding apparatus according to the present invention; and Fig. 5 shows transmit signal strength, voltage, values for multicast spreading code encoded signals according to the present invention.

According to an aspect of the present invention, a phase shift (I is applied to the spread spectrum (coded) data signal dn(i).cm(i) 16. This may conveniently be regarded as a phase shift in the associated WalshHadamard or other code.

For example, the known modulated, spread spectrum (coded) data signal to 15 may be represented by the simplified expression: tx=Re[Em dn(i).cm i). g(t-mTc).exp0mt)], or by the full expression: Re[ d ti, Hi, cm, g (t - mTc - nSFTc) exp( jot)], n m where SF is the spreading factor.

20 The application of a phase shift (I according to the present invention gives rise to a transmitted modulated, spread spectrum (coded) data signal tx' which may be represented by the simplified expression: tx'=Re[Im dn(i).cm(i).g(t-mTc).exp0i̳).exp0mt)]., or by the complete expression: 25 Ret>,dn >,c g(t-mTc -nsFTc)exp(ifi)exp(iox)].

n m The effect may conveniently be regarded as a phase shift in the associated Walsh-Hadamard code. The phase shifted Walsh-Hadamard codes retain their orthogonal characteristics, that is, that in the receiver, by multiplying the received signal by the corresponding phase-shifted Walsh-Hadamard code, the original data

signal may be retrieved. On reception, the phase shift of the WalshHadamard code is reversed, that is, to retrieve a data signal encoded with a Walsh-Hadamard code of cm(i).exp(jtj), the received signal is multiplied by cm(i).exp(j j).

Fig. 4 illustrates one possible embodiment of the present invention.

5 Features common with those illustrated in Fig. 2 have common reference numerals.

According to this embodiment of the invention, data signal dn(i) 10 to be transmitted is multiplied by the corresponding Walsh-Hadamard code cm(i) at spreading modulator 24, as in the prior art, but is then further multiplied at complex multiplier

40 by a phase shift term, expels). This operation may be correspondingly 10 replicated for the other data signals dn(i' to be transmitted. The phase shifted spread spectrum (coded) data signals dn(i).cm(i).exp(j i) etc. 42 are then summed at a complex summer 26 before being modulated at modulator 28 by multiplication by the carrier signal exp(jcot) to produce signal to' for transmission. The signal tx' may accordingly be expressed as dn(i).cm(i).exp(j j).exp(jc3t).

15 When the phase shift Hi is applied, every chip in a certain code is multiplied by a same value exp(j j). However, each code uses a value of which is preferably different from that used by all other codes in use. It is essential, however, that the phase shift Hi applied must be known by the receiver to allow the appropriate decoding at the receiver.

20 The transmitted signal tx' then propagates along a suitable propagation path, e.g. over the air, until it atTives as a received signal rx' at a receiver of user i. The received signal rx' is first demodulated at demodulator 30 by multiplication by exp(jcot), then is decoded at de-spreader 32 by further multiplication by the Walsh Hadamard code cm(i). According to an aspect of this embodiment of the invention, 25 the resultant signal is then subjected to a phase shift opposite to that applied to the transmission signal, by multiplication by exp(j i) by complex multiplication at complex multiplier 44. The resultant signal is fed to a complex summer 34, where the resultant signals of each chip of the spreading (Walsh-Hadamard) code are summed, to produce an output data signal i' corresponding to the transmitted 30 data signal dn(i).

One advantage of the encoding and decoding method and apparatus of the present invention will now be described. Fig. 3, already described above, illustrates the time-variant sum of different numbers of Walsh-Hadamard codes of length 16.

Each row represents the time occupied by a particular chip. For example, if all 16 5 codes are used, a very high magnitude occurs at the first code. This may translate into a very high signal voltage at the receiver, which may cause distortion in the received signal, or may mean that a more costly receiver is necessary, to cope with the high voltage signals. Transmission of such high voltage signals may also lead to distortion of the transmitted signals in the transmitter. As shown in Fig. 3, 10 selection of a subset of, say 8 or 12 of the 16 codes leads to a more dispersed power output but there is still a high voltage signal peak at the beginning.

Fig. 5 shows an example of signal strength values for sums of Walsh-

Hadamard codes corresponding to those shown in Fig. 3, but having a phase offset applied, according to the present invention. Again, the various rows represent the 15 sum of the values of 8, 12 or all 16 corresponding Walsh-Hadamard codes during the respective chip. As can be clearly seen from the table of Fig. 5, the signal strength (voltage) to be transmitted is much more evenly distributed over the length of the spreading code (Walsh-Hadamard code). This significantly reduces the impact of any signal strength peaks caused by same data being transmitted to 20 multiple or all users.

In certain preferred embodiments of the present invention, the phase shift applied to the spreading code may be selected as follows.

The phase shift ; may be selected to be pj.2nJSF, where SF is the spreading factor, that is, the number of chips included within the spreading code, and pi is a 25 member of a selected permutation of the integer set [1,SF].

Taking an example, the integer set [1,4] consists of the integers 1, 2, 3 and 4.

[2,3,1,4] is a permutation of the integer set [1,4].

This leads to the following expression for the value c'm i) of the phase shifted version of the spreading code i, as compared to the prior art, unphase-shifted

30 spreading code cur): ctm(i) = cm(i) exp(j.pj.2 /SF).

In certain particularly preferred embodiments, a constraint is placed on the acceptable values of p, limiting them to values qj, such that qj = 4pj. The values of p, and qj may only take integer values. The values of pi are preferably integer fractions of SF. This leads to the following expression for the value ctm(i) of the 5 phase shifted encoded data symbol of spreading code i, as compared to the prior art,

un-phase-shifted spreading code i, chili': Ctm = Cm i) exp(i.qj.7 /2) When the phase shift is applied, every chip in a certain code is multiplied by a same value. In the above examples, this value is fixed by selection of the value of 10 pi or qj. However, each code uses a value of , fixed by pi or qj in the above examples, which is preferably different from that used by all other codes in use.

While the present invention has been described with reference to a limited number of particular embodiments, those skilled in the art will appreciate that numerous modifications and amendments may be made within the scope of the 15 present invention. For example, while the embodiments have been discussed with respect to Walsh-Hadamard spreading codes of particular chip lengths, other types of orthogonal code and other chip lengths may be used without departing from the invention. Furthermore, while the transmit apparatus shown in Fig. 4 has the phase shift exp(i j) 40 applied after spreading (Walsh-Hadamard) coding 24, the phase 20 shift 40 may alternatively be applied prior to spreading (Walsh-Hadamard) coding.

While the receive apparatus shown in Fig. 4 has the phase shift exp(jO 44 applied after spreading (Walsh-Hadamard) decoding 32, the phase shift may alternatively be applied prior to spreading (Walsh-Hadamard) decoding, or even prior to demultiplexing 30.

Claims

CLAIMS:

1. A method for encoding data comprising the steps of: (i) generating a respective data signal (10) for each of a plurality of 5 users; (ii) coding (24) each of the data signals with a respective orthogonal spreading code (12) to produce respective encoded data signals (16); and (iii) summing (26) the encoded data signals to produce a total encoded data signal, 10 characterized in that the method further comprises the step of applying (40) a phase shift to one of the data signal, the encoded data signal and the total encoded - data signal.

2. A method according to claim 1 wherein the step of applying a phase 15 shift comprises multiplication of the corresponding term by a term of the form exp(jO, between steps (i) and (ii) or between steps (ii) and (iii).

3. A method for decoding data encoded according to claim 1 or claim 2, comprising the steps of: 20 (i) receiving (30) an encoded signal comprising a summation of coded data signals for each of a plurality of users; and (ii) extracting (32) and decoding a respective one of the data signals by application of a respective orthogonal spreading code (cm(i)) to produce a respective data signal, 25 characterized in that the method further comprises the step of applying (44) a phase shift to one of the data signal and the encoded signal.

4. A method according to claim 3 wherein the step of applying a phase shift comprises multiplication of the corresponding term by a term of the form exp( 30 jó), before or after step (ii).

5. A method according to claim 3 or claim 4 wherein the orthogonal spreading code comprises a plurality of chips, and the method further comprising summing (34) the resultant respective data signal, to produce an output data signal (fit). 5

6. A method according to any preceding claim wherein each orthogonal spreading code consists of one of a set of Walsh-Hadamard codes.

7. Data encoding apparatus comprising: (i) a data encoder (24) for encoding a respective data signal (10) with a 10 respective orthogonal spreading code (12) to produce respective encoded data signal (16); and (ii) a complex summer (26) for summing the encoded data signals (42) to produce a total encoded data signal, characterized in that the apparatus further comprises a phase shift element 15 (40) for applying a phase shift to one of the data signal, the encoded data signal and the total encoded data signal.

8. Apparatus according to claim 7 wherein the phase shift element comprises a multiplier arranged to multiply the corresponding term by a term of the 20 form exp(jO, said multiplier being located in the signal path before or after the data encoder.

9. Data decoding apparatus comprising a data decoder (32) for decoding a respective data signal from a combined data signal (rx') by application 25 of a respective orthogonal spreading code (calm) to produce a respective decoded data signal, characterized in that the apparatus further comprises a phase shift element (44) arranged to apply a phase shift to one of the data signal and the respective decoded signal.

10. Apparatus according to claim 9 wherein the phase shift element is arranged in the signal path before or after the data decoder, to multiply the corresponding term by a term of the form exp(jO.

5

11. Apparatus according to claim 9 or claim 10 wherein the orthogonal spreading code comprises a plurality of chips, and the apparatus further comprises a summer (34) arranged to sum the resultant respective data signal, to produce an output data signal ( i').

10

12. Apparatus according to any of claims 7-11 wherein each orthogonal spreading code consists of one of a set of Walsh-Hadamard codes.