
- •Contents
- •Preface
- •1 Spread spectrum signals and systems
- •1.1 Basic definition
- •1.2 Historical sketch
- •2 Classical reception problems and signal design
- •2.1 Gaussian channel, general reception problem and optimal decision rules
- •2.2 Binary data transmission (deterministic signals)
- •2.3 M-ary data transmission: deterministic signals
- •2.4 Complex envelope of a bandpass signal
- •2.5 M-ary data transmission: noncoherent signals
- •2.6 Trade-off between orthogonal-coding gain and bandwidth
- •2.7 Examples of orthogonal signal sets
- •2.7.1 Time-shift coding
- •2.7.2 Frequency-shift coding
- •2.7.3 Spread spectrum orthogonal coding
- •2.8 Signal parameter estimation
- •2.8.1 Problem statement and estimation rule
- •2.8.2 Estimation accuracy
- •2.9 Amplitude estimation
- •2.10 Phase estimation
- •2.11 Autocorrelation function and matched filter response
- •2.12 Estimation of the bandpass signal time delay
- •2.12.1 Estimation algorithm
- •2.12.2 Estimation accuracy
- •2.13 Estimation of carrier frequency
- •2.14 Simultaneous estimation of time delay and frequency
- •2.15 Signal resolution
- •2.16 Summary
- •Problems
- •Matlab-based problems
- •3 Merits of spread spectrum
- •3.1 Jamming immunity
- •3.1.1 Narrowband jammer
- •3.1.2 Barrage jammer
- •3.2 Low probability of detection
- •3.3 Signal structure secrecy
- •3.4 Electromagnetic compatibility
- •3.5 Propagation effects in wireless systems
- •3.5.1 Free-space propagation
- •3.5.2 Shadowing
- •3.5.3 Multipath fading
- •3.5.4 Performance analysis
- •3.6 Diversity
- •3.6.1 Combining modes
- •3.6.2 Arranging diversity branches
- •3.7 Multipath diversity and RAKE receiver
- •Problems
- •Matlab-based problems
- •4 Multiuser environment: code division multiple access
- •4.1 Multiuser systems and the multiple access problem
- •4.2 Frequency division multiple access
- •4.3 Time division multiple access
- •4.4 Synchronous code division multiple access
- •4.5 Asynchronous CDMA
- •4.6 Asynchronous CDMA in the cellular networks
- •4.6.1 The resource reuse problem and cellular systems
- •4.6.2 Number of users per cell in asynchronous CDMA
- •Problems
- •Matlab-based problems
- •5 Discrete spread spectrum signals
- •5.1 Spread spectrum modulation
- •5.2 General model and categorization of discrete signals
- •5.3 Correlation functions of APSK signals
- •5.4 Calculating correlation functions of code sequences
- •5.5 Correlation functions of FSK signals
- •5.6 Processing gain of discrete signals
- •Problems
- •Matlab-based problems
- •6 Spread spectrum signals for time measurement, synchronization and time-resolution
- •6.1 Demands on ACF: revisited
- •6.2 Signals with continuous frequency modulation
- •6.3 Criterion of good aperiodic ACF of APSK signals
- •6.4 Optimization of aperiodic PSK signals
- •6.5 Perfect periodic ACF: minimax binary sequences
- •6.6 Initial knowledge on finite fields and linear sequences
- •6.6.1 Definition of a finite field
- •6.6.2 Linear sequences over finite fields
- •6.6.3 m-sequences
- •6.7 Periodic ACF of m-sequences
- •6.8 More about finite fields
- •6.9 Legendre sequences
- •6.10 Binary codes with good aperiodic ACF: revisited
- •6.11 Sequences with perfect periodic ACF
- •6.11.1 Binary non-antipodal sequences
- •6.11.2 Polyphase codes
- •6.11.3 Ternary sequences
- •6.12 Suppression of sidelobes along the delay axis
- •6.12.1 Sidelobe suppression filter
- •6.12.2 SNR loss calculation
- •6.13 FSK signals with optimal aperiodic ACF
- •Problems
- •Matlab-based problems
- •7 Spread spectrum signature ensembles for CDMA applications
- •7.1 Data transmission via spread spectrum
- •7.1.1 Direct sequence spreading: BPSK data modulation and binary signatures
- •7.1.2 DS spreading: general case
- •7.1.3 Frequency hopping spreading
- •7.2 Designing signature ensembles for synchronous DS CDMA
- •7.2.1 Problem formulation
- •7.2.2 Optimizing signature sets in minimum distance
- •7.2.3 Welch-bound sequences
- •7.3 Approaches to designing signature ensembles for asynchronous DS CDMA
- •7.4 Time-offset signatures for asynchronous CDMA
- •7.5 Examples of minimax signature ensembles
- •7.5.1 Frequency-offset binary m-sequences
- •7.5.2 Gold sets
- •7.5.3 Kasami sets and their extensions
- •7.5.4 Kamaletdinov ensembles
- •Problems
- •Matlab-based problems
- •8 DS spread spectrum signal acquisition and tracking
- •8.1 Acquisition and tracking procedures
- •8.2 Serial search
- •8.2.1 Algorithm model
- •8.2.2 Probability of correct acquisition and average number of steps
- •8.2.3 Minimizing average acquisition time
- •8.3 Acquisition acceleration techniques
- •8.3.1 Problem statement
- •8.3.2 Sequential cell examining
- •8.3.3 Serial-parallel search
- •8.3.4 Rapid acquisition sequences
- •8.4 Code tracking
- •8.4.1 Delay estimation by tracking
- •8.4.2 Early–late DLL discriminators
- •8.4.3 DLL noise performance
- •Problems
- •Matlab-based problems
- •9 Channel coding in spread spectrum systems
- •9.1 Preliminary notes and terminology
- •9.2 Error-detecting block codes
- •9.2.1 Binary block codes and detection capability
- •9.2.2 Linear codes and their polynomial representation
- •9.2.3 Syndrome calculation and error detection
- •9.2.4 Choice of generator polynomials for CRC
- •9.3 Convolutional codes
- •9.3.1 Convolutional encoder
- •9.3.2 Trellis diagram, free distance and asymptotic coding gain
- •9.3.3 The Viterbi decoding algorithm
- •9.3.4 Applications
- •9.4 Turbo codes
- •9.4.1 Turbo encoders
- •9.4.2 Iterative decoding
- •9.4.3 Performance
- •9.4.4 Applications
- •9.5 Channel interleaving
- •Problems
- •Matlab-based problems
- •10 Some advancements in spread spectrum systems development
- •10.1 Multiuser reception and suppressing MAI
- •10.1.1 Optimal (ML) multiuser rule for synchronous CDMA
- •10.1.2 Decorrelating algorithm
- •10.1.3 Minimum mean-square error detection
- •10.1.4 Blind MMSE detector
- •10.1.5 Interference cancellation
- •10.1.6 Asynchronous multiuser detectors
- •10.2 Multicarrier modulation and OFDM
- •10.2.1 Multicarrier DS CDMA
- •10.2.2 Conventional MC transmission and OFDM
- •10.2.3 Multicarrier CDMA
- •10.2.4 Applications
- •10.3 Transmit diversity and space–time coding in CDMA systems
- •10.3.1 Transmit diversity and the space–time coding problem
- •10.3.2 Efficiency of transmit diversity
- •10.3.3 Time-switched space–time code
- •10.3.4 Alamouti space–time code
- •10.3.5 Transmit diversity in spread spectrum applications
- •Problems
- •Matlab-based problems
- •11 Examples of operational wireless spread spectrum systems
- •11.1 Preliminary remarks
- •11.2 Global positioning system
- •11.2.1 General system principles and architecture
- •11.2.2 GPS ranging signals
- •11.2.3 Signal processing
- •11.2.4 Accuracy
- •11.2.5 GLONASS and GNSS
- •11.2.6 Applications
- •11.3 Air interfaces cdmaOne (IS-95) and cdma2000
- •11.3.1 Introductory remarks
- •11.3.2 Spreading codes of IS-95
- •11.3.3 Forward link channels of IS-95
- •11.3.3.1 Pilot channel
- •11.3.3.2 Synchronization channel
- •11.3.3.3 Paging channels
- •11.3.3.4 Traffic channels
- •11.3.3.5 Forward link modulation
- •11.3.3.6 MS processing of forward link signal
- •11.3.4 Reverse link of IS-95
- •11.3.4.1 Reverse link traffic channel
- •11.3.4.2 Access channel
- •11.3.4.3 Reverse link modulation
- •11.3.5 Evolution of air interface cdmaOne to cdma2000
- •11.4 Air interface UMTS
- •11.4.1 Preliminaries
- •11.4.2 Types of UMTS channels
- •11.4.3 Dedicated physical uplink channels
- •11.4.4 Common physical uplink channels
- •11.4.5 Uplink channelization codes
- •11.4.6 Uplink scrambling
- •11.4.7 Mapping downlink transport channels to physical channels
- •11.4.8 Downlink physical channels format
- •11.4.9 Downlink channelization codes
- •11.4.10 Downlink scrambling codes
- •11.4.11 Synchronization channel
- •11.4.11.1 General structure
- •11.4.11.2 Primary synchronization code
- •11.4.11.3 Secondary synchronization code
- •References
- •Index

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 FitÞ |
ð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).