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

Merits of spread spectrum |
95 |
|
|
W(Ar)
0.9
0.8
0.7
0.6
0.5
0.4
0.3
0.2
0.1
0
0 |
0.5 |
1.0 |
1.5 |
2.0 |
2.5 |
3.0 |
3.5 |
Ar
Figure 3.14 Rayleigh PDF
Rayleigh fading is characteristic of numerous systems, including, along with communications, radar, navigation etc. The deep falls in signal intensity inherent in it are not as a rule neutralized by sporadic rises of Ar when multipath signals arrive nearly in phase. As a result, the overall effect of Rayleigh fading on the system performance appears to be pretty destructive, as the analysis below corroborates.
3.5.4 Performance analysis
Consider as an example binary data transmission over the Rayleigh channel with a slow and flat fading. The first of the attributes means that the interference pattern remains stable during many symbols and the current reference phase may be retrieved from the received signal by averaging over an appropriate time interval. In other words, signal randomness does not exclude the BPSK from the available options. The second term stresses that the delay spread of multipath signals ds is small enough compared to the duration Tb of the individual BPSK bit: ds Tb. As a result, successive BPSK symbols do not overlap with each other, i.e. ISI (see Section 2.15) does not emerge. To understand why the word ‘flat’ is relevant, return to (3.11) and note that an adequate model of a multipath channel is a delay line with taps having delays i and complex weights Ai exp (j i). The transfer function of such a system strongly depends on tap delays, and when ds Tb is rather uniform (flat) within the signal bandwidth so that all signal frequency components are distorted identically and signal shape remains unchanged. The only sort of corruption which the signal undergoes due to multipath propagation in such a case is Rayleigh amplitude fluctuations described by (3.12).
Figure 3.15 enlarges on these definitions. Plots simulated in Matlab show a slow flat fading (a) as opposed to the fast flat one (b) for the case of the bell-shaped symbol pulses. The second of the fading types is characterized by a rapid change of the interference pattern in time so that distortions of successive symbols are practically independent.

96 |
Spread Spectrum and CDMA |
|
|
(a) |
signal |
|
Received |
||
|
6
4
2
0
–2
–4
–6
0 |
2 |
4 |
6 |
8 |
10 |
12 |
14 |
16 |
18 |
20 |
|
|
|
|
|
t |
|
|
|
|
|
(b) |
signal |
|
Received |
||
|
6
4
2
0
–2
–4
–6
0 |
2 |
4 |
6 |
8 |
10 |
12 |
14 |
16 |
18 |
20 |
|
|
|
|
|
t |
|
|
|
|
|
Figure 3.15 Slow (a) and fast (b) fading
Let the energy of the received signal corresponding to Ar ¼ 1 be E. Then the energy of a signal with another value of amplitude is E(Ar) ¼ A2r E and the average energy
again equals E due to the normalization adopted above: E(Ar) ¼ A2r E ¼ E. Equation (2.19) may be used to calculate a conditional error probability Pe(Ar), when the received amplitude is assumed fixed and equal to Ar:
|
|
|
|
|
s! |
|
|
s! |
|
|
|
||
P |
eð |
A |
rÞ ¼ |
Q |
|
2EðArÞ |
¼ |
Q A |
|
2E |
¼ |
Q A q |
bÞ |
|
N0 |
|
N0 |
||||||||||
|
|
|
|
r |
|
ð r |
p
where SNR qb ¼ 2E/N0 corresponds to the signal of energy E(A) ¼ E, i.e. of amplitude Ar ¼ 1. Actual amplitude Ar is random and fluctuates from one receiving session to another according to the Rayleigh PDF (3.12). It is natural, then, to characterize the performance of data transmission by the value of Pe(Ar) averaged over all Ar. Reserving now the term ‘error probability’, with designation Pe, for this expectation we have:
Pe ¼ |
|
¼ Z1 PeðArÞWðArÞdAr ¼ 2 Z1 QðArqbÞAr exp Ar2 |
|
|||||||
PeðArÞ |
dAr |
|||||||||
|
|
|
|
0 |
|
|
0 |
|
|
|
2 |
1 |
1 |
Ar exp |
x2 |
exp Ar2 |
|
dxdAr |
|
||
¼ p2 Z |
Z |
2 |
|
|
||||||
|
|
|
|
|
|
|
|
|
|
|
0Arqb

Merits of spread spectrum |
97 |
|
|
where definition of the complementary error function Q( ) is used. Reversing the order of the integrals gives:
Pe |
1 |
1 |
2 x=qb |
2Ar exp |
Ar2 |
|
dAr |
3 exp |
x2 |
dx |
|
|
|
2 |
|||||||||
|
¼ p2 Z |
Z |
|
|
|
|
|
||||
|
|
|
6 |
|
|
|
|
|
7 |
|
|
|
|
4 |
|
|
|
|
|
5 |
|
|
00
1 |
1 |
|
|
|
|
x2 |
exp |
x2 |
dx |
|
|
|||
¼ p2 Z |
1 exp qb2 |
2 |
|
|
||||||||||
|
0 |
|
|
|
|
|
|
|
|
|
|
|
|
|
1 |
1 exp |
x2 |
|
dx |
|
1 |
1 exp |
|
ðqb2 |
þ 2Þx2 |
dx |
|||
|
2 |
|
|
|
|
|
2qb2 |
|||||||
¼ p2 Z |
|
|
|
p2 Z |
|
|
|
|||||||
|
0 |
|
|
|
|
|
|
|
0 |
|
|
|
|
|
where the first term equals Q(0) ¼ 1/2 and the second is brought to the same form if
|
q |
|
multiplied by |
qb2 þ 2 |
/qb. Finally: |
01
Pe ¼ |
1 |
|
|
qb |
ð3:13Þ |
|
2 B1 |
qb2 þ 2C |
|||||
|
|
|
@ |
|
q A |
|
To assess quantitatively the extent of the harmful influence of the fading, look at Figure 3.16, which presents error probabilities of the BPSK transmission over the AWGN and Rayleigh channels. As is seen, Pe ¼ 10 3 in the AWGN channel may be guaranteed with the bit SNR around 10 dB, while the Rayleigh channel requires bit SNR of at least 27 dB,
|
0 |
|
|
|
|
|
|
|
|
|
|
|
|
AWGN |
|
|
–1 |
|
|
|
|
Rayleigh |
|
|
|
|
|
|
|
|
|
|
–2 |
|
|
|
|
|
|
e |
|
|
|
|
|
|
|
P |
–3 |
|
|
|
|
|
|
lg |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
–4 |
|
|
|
|
|
|
|
–5 |
|
|
|
|
|
|
|
–60 |
5 |
10 |
15 |
20 |
25 |
30 |
Bit SNR (dB)
Figure 3.16 Bit error probability for AWGN and Rayleigh channels