
- •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
98 |
Spread Spectrum and CDMA |
|
|
i.e. 50 times higher. This drastic energy loss due to the fading gets greater when higher transmission reliability is necessary and becomes close to 25 dB (300 times) for Pe ¼ 10 4.
The physical explanation of a quite detrimental fading effect is rather straightforward. Sporadic sharp drops in signal intensity due to the multipath interference are rather likely in the Rayleigh channel. Elementary integration of PDF (3.12) shows, for instance, that the probability of Ar falling below the level 0.4 (SNR decreases by 8 dB) is about 0.15. Then, as is seen from Figure 3.16 (dashed line), in those sessions where such drops happen, the error probability can not be lower than 0.1 if reference SNR is 10 dB. Since the share of such sessions is 0.15, their contribution to the total (average) error probability will be no less than 0:1 0:15 ¼ 0:015, i.e. 15 times bigger than the value corresponding to the reference SNR. This effect cannot in any way be compensated by possible favourable sessions with high SNR, since their contribution to the total error probability is never negative.
The consequence of multipath propagation may potentially be even more dramatic when the fading is frequency selective. This term, as opposed to the attribute ‘flat’, defines the situation where the channel transfer function is not uniform within the signal bandwidth. This happens if the delay spread covers several transmitted bits so that at the channel output the previous bits overlap with the current one. To counter this ISI, special filters (equalizers) are used, which rectify the channel transfer function nonuniformity. On the other hand, frequency selectivity when used properly is a good resource for countering fading by arranging the multipath diversity discussed in Section 3.7.
3.6 Diversity
The general idea of combating destructive multipath effects consists in diversity, which means arranging several independent transmission channels or branches. Thanks to this, despite every individual branch remaining liable to Rayleigh (or other) fading, the probability that the interference patterns in all of them are simultaneously poor is defined by the multiplication rule and thus diminishes radically. Take the figures of the example at the end of the previous section and suppose that two identical independent branches are somehow organized. Then the probability of the same fall of signal power in both of them at once is 0:152 ¼ 2:25 10 2, i.e. perceptibly smaller compared to the probability of poor conditions in an individual branch. With a larger number of branches this diversity gain becomes more and more substantial. Branches operate in parallel, as though they secured each other, mitigating fading impairment.
In other words, we know that the poor performance resulting from multipath fading is entirely due to the deep drops of SNR occurring from time to time. Hence, the final objective of diversity techniques is to process jointly signals of the branches in a manner that makes ‘better’ (higher SNR) branches more influential on the overall performance in comparison to the worse ones. Such joint processing is called combining.
3.6.1 Combining modes
Various strategies for combining the results of processing signals arriving via different branches may be used at the receiver. Suppose that there are nd diversity branches

Merits of spread spectrum |
99 |
|
|
altogether and let Ai, i and i be current signal amplitude, signal phase and noise standard deviation in the ith branch, where i ¼ 1, 2, . . . , nd . What, then, is the best linear processing producing the maximum possible resultant SNR? Any linear form of the
branch responses ui, i ¼ 1, 2, . . . , nd is their weighted |
sum |
|
nd |
w |
i |
u |
i |
where weights w |
i |
2 |
|
i¼1 |
|
|
|
||||
|
|
is just the ratio between the |
|||||||
are in general complex. Then the resultant power SNR qr |
P |
|
|
|
|
|
|
|
magnitude of the deterministic component of this sum and the variance of its noise component. The latter is simply the sum of branch noise variances weighted by jwij2, since branches are independent. Therefore:
2 |
|
ind1 wi Ai expðj iÞ 2 |
|
|
|
||||
qr |
¼ |
¼ |
nd |
2 |
2 |
|
ð |
3:14 |
Þ |
|
P |
|
|
|
|||||
|
|
|
P |
jwij |
i |
|
|
|
|
|
|
|
|
|
|
|
|
|
i¼1
The sum in the numerator of (3.14) may nd -dimensional vectors whose components are can have modulus greater than the product of as Schwarz’s inequality [1,2]. Consequently:
be treated as an inner product of two wi i and (Ai/ i) exp (j i). No inner product the lengths of vectors, which is well known
2 |
|
i¼1 jwij2 |
i2 i¼1 |
i2i |
|
|
nd Ai2 |
|
nd 2 |
|
|
|||||
qr |
|
nd |
|
|
|
nd |
|
2 |
|
|
|
2 |
|
qi |
|
3:15 |
|
P nd |
|
|
|
P |
A |
|
|
|
|
|
|
||||
|
|
j |
|
j |
|
|
|
|
¼ |
X |
|
¼ |
X |
ð |
Þ |
|
|
P |
|
wi |
|
2 2 |
|
|
|
|
i |
|
|||||
|
|
|
|
i |
|
|
|
|
i¼1 |
|
|
i¼1 |
|
|
||
|
|
|
|
|
|
|
|
|
|
|
|
|
i¼1
where qi ¼ Ai/ i is voltage SNR of the ith diversity branch. When optimal weights:
Ai
wi ¼ 2i expð j iÞ
are taken, inequality (3.15) becomes an equality, i.e. maximal possible resultant SNR is achieved. Such weights, as is readily seen, realize joined matched filtering of the responses of the diversity branches. Technically it is possible only when accurate values of all signal amplitudes and phases are known. Then signals can be summed coherently with an appropriate amplitude weighting. This combining technique is often referred to in the literature as the maximal ratio technique [5,18].
To assess the efficiency of combining, denote maximal SNR over all the diversity
branches |
by |
q |
|
2 |
2 |
||
max |
and introduce the diversity gain as Gd ¼ qr |
/qmax. Since |
|||||
P |
nd 2 |
2 |
|
i¼1 qi nd qmax no combining scheme can provide gain greater than nd , and the latter is achievable only in the maximal ratio scheme under the additional stipulation that all the diversity branches have the same SNR.
In practice, some other combining schemes find application, too, because maximal ratio processing is rather demanding as to the extra arrangements necessary (to measure SNR and phase in a diversity branch some special pilot signal may appear necessary etc.). Alternative combining modes are equal-weight combining and selection of a maximum SNR branch. The first approaches the maximal ratio mode in effectiveness if all the diversity branches have nearly equal SNR. The gain of the second is close to that of the optimal scheme if one of the diversity branches dominates over the rest in value of SNR.

100 |
Spread Spectrum and CDMA |
|
|
Certainly, these strategies can be combined with each other, e.g. several branches with the best SNR values are selected and then their outputs are summed with equal weights.
Consider now traditional ways of organizing independent diversity branches.
3.6.2 Arranging diversity branches
The traditional ways to set up independent diversity branches may be categorized as follows:
. Space diversity
. Frequency diversity
. Time diversity
. Polarization diversity
. Multipath diversity.
Space diversity implies creating several independent propagation paths at the expense of involving multiple antennas, which explains the other popular name for this technique: antenna diversity. Duplicating antennas may be used at the receiving side as well as at the transmitting side. Being spaced from each other by a distance of 7–10 wavelengths or more, they provide practical independence of parallel interference patterns at the receiver input. When used at the receiver (Figure 3.17) (receive diversity) antenna diversity is most effective, since additional antennas utilize signal energy which otherwise would not be captured at all. In this case diversity signals are separated automatically since different antennas receive them. Being matched-filtered individually, they may be further combined as described above.
Transmitting antenna diversity (transmit diversity) is not that straightforward. First, as is seen from Figure 3.18, a limited total transmitter energy resource should be divided between several transmitting antennas. Second, the receiver antenna receives the mixture of signals emitted by all transmitting antennas. Therefore, some measures should be taken to provide an opportunity for separation and individual processing of those signals by the receiver before combining. These factors make this sort of diversity a sophisticated optimization problem, solving which is the subject of a special branch of communication theory called space–time coding (see Section 10.3).
Reflector
|
|
|
|
|
|
|
|
|
|
Transmitter |
|
|
|
Receiver |
|
|
|
|
|
Figure 3.17 Receive antenna diversity

Merits of spread spectrum |
101 |
|
|
Reflector
Transmitter |
Receiver |
Figure 3.18 Transmit antenna diversity
Certainly, when the technological constraints allow it, the combination of transmit and receive antenna diversity may be used to gain maximal benefits.
The idea of frequency diversity is based on the concept of the channel coherence bandwidth. This notion determines the frequency range within which fading is considered as flat, i.e. distortion of signal frequency components is strongly dependent. On the other hand, the harmonics with frequency space beyond the coherence bandwidth may be treated as independently distorted by the channel. As was already underlined in the previous section, the frequency range of the flat fading depends inversely on the delay spread, so the wider the range of dispersing signals in time, the shorter the coherence bandwidth. Evidently, transmitting the same signal simultaneously at nd carriers whose frequencies are offset by coherence bandwidth or more creates nd diversity branches. We may say that frequency diversity puts frequency selectivity of fading to good use. Figure 3.19 gives an elementary clarification of the idea. The waves of two wavelengths w1 and w2 propagating along the same couple of paths have identical geometrical propagation differences . However, the phase differences between the signals of the two paths are individual for each wavelength and equal to 2 / w1 and 2 / w2, respectively. When one of these phase differences leads to attenuation of the resultant signal the other may appear less destructive. With many parallel propagation paths present statistical interpretation comes into force, and frequency difference exceeding the channel coherence bandwidth provides the independence of diversity branches in this scheme. An appropriate choice of frequencies in this diversity scheme provides separation of branches at the receiver with the help of bandpass filtering.
Reflector
φ1 = 2πδ/λw1
φ2 = 2πδ/λw2
λw1
λw2
Transmitter |
|
Receiver |
|
|
|
Figure 3.19 Frequency diversity