Добавил:
Upload Опубликованный материал нарушает ваши авторские права? Сообщите нам.
Вуз: Предмет: Файл:
Шумов задачи и учебник / [Valeri_P._Ipatov]_Spread_Spectrum_and_CDMA_Princ(Bookos.org).pdf
Скачиваний:
93
Добавлен:
15.04.2015
Размер:
3.46 Mб
Скачать

5

Discrete spread spectrum signals

5.1 Spread spectrum modulation

Let us revisit the general model (2.37) of a bandpass signal:

sðtÞ ¼ Re½S_ðtÞ expðj2 f0tÞ&; S_ðtÞ ¼ SðtÞ exp½ j ðtÞ&

It is quite comprehensible that the spreading of a signal spectrum is accomplished by appropriate controlling of a signal complex envelope S_(t), i.e. modulation of its instant amplitude S(t) and instant initial phase (t). As was observed in Chapter 1, ‘pure’ amplitude modulation cannot be an efficient tool for spectrum spreading, since it may remarkably widen the bandwidth only at the cost of concentrating the signal energy within short time intervals. As a matter of fact, this implies operating with short plain signals. On the contrary, angle (phase or frequency) modulation is capable of unlimited (at least in theory) widening of the spectrum with no effect on the distribution of the signal energy in time, i.e. signal duration, due to which its role in spread spectrum technology is fundamental. Amplitude modulation is just an auxiliary instrument, which sometimes appears to be useful in combination with angle modulation.

Depending on the character of the modulation involved all spread spectrum signals may be classified into continuous and discrete ones. For the first, the modulation law, i.e. complex envelope S_(t), is a continuous function of time, while the modulated parameters (amplitude, frequency, initial phase) of the second are piecewise constant and change by hops only at discrete time moments. The example of a continuous spread spectrum signal will be discussed briefly in Section 6.2; however, the main attention will be focused on discrete signals, owing to their predominant role in the majority of modern and forward-looking commercial systems.

Spread Spectrum and CDMA: Principles and Applications Valery P. Ipatov

2005 John Wiley & Sons, Ltd

136

Spread Spectrum and CDMA

5.2 General model and categorization of discrete signals

Discrete signals considered in this book may be covered by the following description, generalizing the one already presented in Section 2.7.3: a discrete signal is a sequence of elementary pulses of a fixed form, recurring at some fixed time interval. The elementary pulse is called a chip. The complex envelope S_0(t) defines its shape and internal angle modulation, if any. The time interval D between consecutive chips typically, but not compulsorily, equals or exceeds chip duration Dc. Modulation of the whole signal consists in manipulating the amplitudes, phases and, possibly, frequencies of individual chips. Accordingly, formal representation of the complex envelope of a discrete signal is given by the equation:

_

1

_

 

SðtÞ ¼

X

aiS0ðt iDÞ expðj2 Fi

ð5:1Þ

 

i¼ 1

 

 

where, in addition to the designations explained, ai and Fi are, respectively, complex amplitude and frequency (in terms of shift against the fixed central frequency) of the ith chip. It is obvious that the sequence fjaij, i ¼ . . . , 1, 0, 1, . . .g determines real amplitudes of chips, i.e. their amplitude modulation. Similarly, sequences f i ¼ arg ai, i ¼ . . . , 1, 0, 1, . . .g and fFi, i ¼ . . . , 1, 0, 1, . . .g define the laws of modulation of chip phases and frequencies. Figure 5.1 may be helpful in understanding some of the definitions above.

Suppose that in the model (5.1) real amplitudes jaij may take on non-zero values only for 0 i N 1 and jaij ¼ 0 for i < 0 and i N. Putting it differently, the signal is a burst of a finite number N of manipulated chips. Such a signal we will call pulse or aperiodic. The duration of an aperiodic signal is T ¼ (N 1)D þ Dc. Another important case is a signal for which the modulation law repeats itself with a period of N chips: ai ¼ aiþN , Fi ¼ FiþN , i ¼ . . . , 1, 0, 1, . . .. For natural reasons, this sort of discrete signal is called periodic. Its real-time period is T ¼ ND and any periodic signal is just a repetition with period ND of an aperiodic one, the latter being a one-period segment of the periodic signal. In both cases we will call parameter N the length of a code sequence (see Section 2.7.3).

Within the described general model we distinguish between several categories of discrete signals in accordance with a specific chip modulation mode.

ith chip

|ai |

t

c

Figure 5.1 Example of a discrete signal

Discrete spread spectrum signals

137

 

 

1.If only the complex amplitudes of chips are manipulated, all frequencies remaining the same (Fi ¼ 0, i ¼ 0, 1, . . . , N 1), the signal is called an amplitude-phase shift keying (APSK) one. The conventional name of the sequence of chip complex amplitudes fai, i ¼ 0, . . . , N 1g is a code sequence or simply code.

2.If only the phases of chips in an APSK signal are manipulated, amplitudes being unchanged (jaij ¼ 1, i ¼ 0, 1, . . . , N 1), the signal is a PSK one. PSK signals are typical of so-called direct sequence spread spectrum systems (see Section 7.1).

3.Within PSK signals further categorization is possible depending on the modulation

alphabet. When only binary complex amplitudes are involved (ai ¼ 1, or equivalently, jaij ¼ 1, i 2 f0, g, i ¼ 0, 1, . . . , N 1), the signal is a BPSK one; with a quaternary alphabet ai ¼ 1, j, or equivalently, jaij ¼ 1, i 2 f0, , /2g, i ¼ 0, 1, . . . , N 1, the signal is QPSK etc.

4.If only the frequencies of chips are controlled, complex amplitudes remaining constant, the signal is of FSK type. A code sequence of such a signal is just a sequence of frequencies fFi, i ¼ 0, 1, . . . , N 1g. These signals are, in particular, employed in frequency hopping systems (see Section 7.1).

5.3 Correlation functions of APSK signals

Correlation functions showing the likeness of time-shifted copies of signals are of critical importance in problems of time measurement and resolution (see Sections 2.11–2.16). The art of designing spread spectrum systems, as will be seen from the further discussion, is in many aspects the ability to find signals with adequate correlation properties. In this section we are deriving a general expression for the correlation functions of APSK signals. From the definitions above, the complex envelope of an APSK signal has the form:

_

1

_

 

SðtÞ ¼

X

aiS0ðt iDÞ

ð5:2Þ

 

i¼ 1

 

 

Turn to the definition of normalized ACF (2.67), taking into account that for a periodic signal the integrand will also be periodic, and hence, its time-averaging (integration) may be accomplished over one period, normalization being made to the one-period energy. Therefore, with an assumption Dc D mostly typical of applications,1 we are able to make use of the universal equation:

 

T

S_ðtÞS_

ðt Þ dt

ð5:3Þ

ð Þ ¼ E Z0

1

 

 

 

 

1 The final results we will come to are valid regardless of whether or not this inequality is true. The assumption only helps to eliminate some secondary details in the derivation below.

138

Spread Spectrum and CDMA

 

 

for both aperiodic and periodic signals, where E ¼ kak2E0 is complete energy for the first and per-period energy for the second. Here E0 stands for chip energy and kak is a geometric length (Euclidean norm) of the code vector a ¼ (a0, a1, . . . , aN 1); in other

words, kak2¼ PN 1 jaij2 is the energy of the N-element sequence fa0, a1, . . . , aN 1g.

i¼0

Substituting (5.2) into (5.3) gives:

ð Þ ¼ E i

 

k

 

T

1

1

aiak Z

S_0ðt iDÞS_0ðt kD Þ dt

1

 

 

 

 

 

 

 

X

X

 

 

 

 

 

¼ 1 ¼ 1

0

 

¼ E k

 

 

T

S_0ðt iDÞS_0ðt kD Þ dt

i 0 aiak Z

1

 

1

N 1

 

 

 

 

 

X X

 

 

 

 

 

¼ 1 ¼

0

 

where the last equality follows from vanishing the integral, whenever i is beyond the set f0, 1, . . . , N 1g.

Introducing the ACF of a single chip:

cð Þ ¼ E0

 

1

S_0ðtÞS_0ðt Þdt

Z

 

1

 

 

 

 

 

 

 

 

1

 

 

leads to:

 

 

 

 

 

 

aiak! c½ ði kÞD&

ð Þ ¼

 

a

 

2

i 0

1

1

 

N 1

X

k k

 

X

 

k¼ 1

 

 

 

 

¼

 

 

Now change the summation index k to m ¼ i k, arriving at:

1

X

ð Þ ¼ ðmÞ cð mDÞ

m¼ 1

where:

N 1

1 X

ðmÞ ¼ kak2 i¼0 aiai m

ð5:4Þ

ð5:5Þ

ð5:6Þ

is the ACF of the code sequence fa0, a1, . . . , aN 1g characterizing its resemblance to its replica shifted by m positions.

Equation (5.5) has quite an eloquent implication. Comparing it with the model (5.2) allows the observation that the ACF of an APSK signal is the APSK signal itself! The chip of the latter is the ACF c( ) of the original chip, while the code sequence is the ACF (5.6) of the code sequence fa0, a1, . . . , aN 1g of the original signal. Therefore, given the chip, the ACF of the APSK signal is entirely determined by the ACF (m) of the code sequence (or code ACF), and designing APSK signals with good autocorrelation properties means searching for sequences with good ACF. Note that, like any ACF, (m) at m ¼ 0 equals 1 and is even: (m) ¼ ( m).