
- •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
Classical reception problems and signal design |
41 |
|
|
SNR or observation time is provided. Therefore, in any task where high accuracy is wanted, the ML rule is optimal not only by the error-probability criterion but also by the estimate accuracy criterion. Certainly, in the real world, high measurement precision is a typical demand and this is why the ML estimates are extensively used.
For the case of non-energy parameter the Cramer–Rao bound acquires on especially simple form and provides a practical tool to calculate the ML estimate variance:
^ |
1 |
q 1 |
ð2:59Þ |
varf g ¼ varf"g |
00ð0Þq2 |
The presence of SNR q2 ¼ 2E/N0 in the denominator of the right-hand side of (2.59) is no surprise: naturally, for any reasonable estimation rule the greater is SNR, the smaller is the error and the higher is the measurement precision. At the same time, the dependence on the second derivative of a correlation coefficient deserves a more extensive comment. As is well known from mathematical analysis, the second derivative describes the curvature or sharpness of a function at the examined point and for a convex curve is negative. The sharpness of ( ) at zero point, in its turn, shows the sensitivity of a signal towards mismatch in : the sharper it is, the faster a signal copy mismatched in loses its resemblance to the initial copy. Recollect now that estimation is a particular case of signal distinguishing and is the more reliable the smaller the signal similarity is. This gives a complete explanation as to why 00(0) may affect the precision of measuring : when copies of s(t; ) have low resemblance even with close values of , they are more easily distinguished in comparison with the case of their stronger similarity.
The latter fact points at the general trend of signal design in problems of non-energy parameter estimation. To achieve the desired result not at the cost of just ‘brute force’, i.e. energy increase, one may try to find signals with a steep dependence of correlation coefficient ( ) on .
In the following sections we turn to concrete estimation problems, among which examples of measuring both energy and non-energy parameters are considered. The main idea remains as before: to find out where estimation problems may call for the use of spread spectrum.
2.9 Amplitude estimation
The problem of measuring signal intensity (level, power) may be encountered in numerous applications, from TV broadcasting to digital PAM or QAM data transmission and mobile radio. Let us set it as the problem of measuring unknown amplitude A remaining constant during the observation interval [0, T]. In this statement the following signal model can be assumed:
sðt; AÞ ¼ AsðtÞ
where s(t) is some deterministic reference signal whose amplitude is equal to one by convention. Then signal s(t; A) is the result of scaling the reference signal by an

42 |
Spread Spectrum and CDMA |
|
|
unknown factor A. Let E be the energy of the reference signal. Then the energy E(A) of the signal with amplitude A and its correlation z(A) with observation y(t) are:
ZT ZT ZT
EðAÞ ¼ s2ðt; AÞ dt ¼ A2 s2ðtÞ dt ¼ A2E zðAÞ ¼ yðtÞsðt; AÞ dt ¼ Az
0 0 0
where
ZT |
ð2:60Þ |
z ¼ yðtÞsðtÞ dt |
0
is the correlation of the observation with the reference signal.
Turning to the correlation version of minimum distance rule (2.8) and noticing that the roles of Ej and zj are now played by E(A) and z(A), respectively, the ML estimation procedure may be treated as maximization of the difference z(A) E(A)/2 in A. Using the equations above, this difference takes the form of a quadratic binomial Az A2E/2 in A with the known coefficients. Its maximum is easily found, producing the ML estimate of amplitude:
^ ¼ z A
E
Thus, calculating a correlation of the observed waveform with the reference signal and scaling the result by the constant 1/E is exactly the desired optimal amplitude estimate. After finding the expectation of z from equation (2.60):
ZT ZT ZT
z ¼ yðtÞsðtÞ dt ¼ sðt; AÞsðtÞ dt ¼ A s2ðtÞ dt ¼ AE
0 0 0
|
^ |
|
|
|
|
|
|
|
|
|
|
|
it is readily seen that on average A strictly coincides with the true value of the amplitude, |
||||||||||||
|
|
|
|
|
|
|
|
|
|
|
|
|
^ |
¼ z/E ¼ A, meaning that the ML |
estimate of amplitude is rigorously |
(not |
only |
||||||||
A |
||||||||||||
|
|
|
|
|
|
|
|
|
|
^ |
|
|
asymptotically) unbiased. No more difficult is the evaluation of variance of A: |
|
|
||||||||||
|
var |
A^ |
|
varfzg |
|
N0 |
|
1 |
|
|
2:61 |
|
|
|
E2 |
¼ 2E |
¼ q2 |
ð |
Þ |
||||||
|
|
f g ¼ |
|
|
where result (2.15) is used and q2 is SNR for the reference signal (i.e. for a signal having a unit amplitude). It may be shown that (2.61) strictly reproduces the Cramer–Rao bound, proving rigorous (not only asymptotic) efficiency of the ML estimate of signal amplitude. This rare case of an estimate’s rigorous optimality is associated with the energy nature of amplitude and will not be met later when non-energy parameters are considered.
Now, what sort of demand does amplitude measuring impose on signal design? As (2.61) demonstrates, nothing but sufficient energy exhaustively determining estimation precision. No complications of the signal modulation law are able to improve amplitude measurement accuracy if they do not govern the signal energy. Consequently, no momentum to the involvement of spread spectrum appears in connection with this classical reception problem.

Classical reception problems and signal design |
43 |
|
|
2.10 Phase estimation
We now address the situation where the parameter carrying useful information is the initial phase of the signal. This case is typical of coherent radar and navigation receivers, carrier reference recovery loops of PSK/QAM data transmission links, demodulators of 2G and 3G mobile radio receiver, chrominance channels of TV and many more applications.
We modify the bandpass signal model (2.24), separating the constant (during observation interval) initial phase ’, which is unknown and to be measured:
sðt; ’Þ ¼ SðtÞ cosð2 f0t þ ðtÞ þ ’Þ
Since ’ is a non-energy parameter, E(’) ¼ E and ML estimation of phase consists in maximizing z(’) ¼ R0T y(t)s(t; ’) dt over all ’ 2 [ , ]. To make use of equation (2.59), note that by definition (’) is the cosine of the angle between two signal copies phaseshifted by ’; that is, between two vectors separated by the angle ’. Therefore(’) ¼ cos ’, 00(0) ¼ 1 and variance of the ML estimate ’^ is:
1 varf’^g q2 ; q 1
Again, in common with amplitude measuring, precision of phase estimation is governed only by SNR. Thus, this classical problem is also indifferent to the signal modulation law, whenever signal energy is maintained constant, and does not stimulate spreading a signal spectrum.
2.11 Autocorrelation function and matched filter response
Spread spectrum theory rests to a very large extent on the notion of a signal autocorrelation function (ACF), which is defined as the inner product of two copies of the same signal time-shifted to each other by seconds:
Rð Þ ¼ ðs0; s Þ ¼ |
Z1 sðtÞsðt Þ dt |
ð2:62Þ |
|
1 |
|
Signal time delay is a non-energy parameter (E( ) ¼ E) and scaling (2.62) by E 1 produces normalized ACF, which is simply a correlation coefficient of the time-shifted signal copies:
ð Þ ¼ |
ðksk2 Þ |
¼ ð |
E |
Þ |
¼ E |
1 |
sðtÞsðt Þ dt |
ð2:63Þ |
||
Z |
||||||||||
|
s0; s |
|
|
s0; s |
|
1 |
|
|
|
|
|
|
|
|
|
|
|
|
1 |
|
|
Clearly, the latter shows how rapidly the likeness of the signal time-spaced copies dies away with the delay mismatch . According to the general properties of a correlation coefficient ( ) indicated in Section 2.8, ACF is an even function of , attaining its maximum at zero point:
Rð Þ Rð0Þ ¼ E; Rð Þ ¼ Rð Þ , ð Þ ð0Þ ¼ 1; ð Þ ¼ ð Þ |
ð2:64Þ |

44 |
Spread Spectrum and CDMA |
|
|
Using equations (2.39) and (2.34) it is not difficult to verify that for any bandpass signal (2.37) ACF:
ð Þ ¼ |
|
2 |
ð 0 Þ |
ð Þ ¼ |
½ ð Þ |
ð 0 Þ& |
ð Þ |
|
|
|
_ |
|
|
|
|
|
|
R |
Re |
Rð Þ |
exp j2 f t |
|
; |
Re |
exp j2 f t |
2:65 |
|
|
|||||||
where |
|
|
|
|
|
|
|
|
|
R_ ð Þ ¼ ðS_ 0; S_ Þ ¼ |
Z1 S_ðtÞS_ ðt Þ dt |
ð2:66Þ |
|||||
|
|
|
|
1 |
|
|
|
is the ACF of the complex envelope S_(t), or, in other normalized version of ACF (2.66):
ð Þ ¼ ð |
_ |
0S_ |
_ |
2 Þ |
¼ |
ð |
_ |
|
_ |
Þ |
¼ |
1 |
|||
|
|
|
2E |
2E Z |
|||||||||||
|
|
S ; |
S |
|
|
|
S0 |
; S |
|
|
1 |
|
|||
|
|
|
|
|
|
|
|
|
|
|
|
1 |
|||
|
|
|
|
|
|
|
|
|
|
|
|
|
|
words, the modulation law. The
_ _ |
ð2:67Þ |
SðtÞS ðt Þdt |
being the correlation coefficient of two time-shifted copies of the complex envelope S_(t), serves (after taking the modulus) as a measure of the rapidness with which the timeshifted modulation law loses similarity with the initial one when the mismatch grows. As may be seen from (2.65), ACF ( ) of a bandpass signal s(t) is a bandpass signal itself whose modulation law is ACF ( ) of the complex envelope of s(t). In particular, the real envelope 0( ) of ACF of s(t) is the modulus of ( ): 0( ) ¼ j ( )j, which is illustrated by Figure 2.16.
Any ACF can be obtained physically as an output of the correlator, i.e. the device running the straightforward operations set up by definitions (2.62) or (2.66). In this case calculations for a range of are fulfilled point by point, i.e. repeatedly in time or in hardware. An alternative solution is the matched filter, i.e. a linear system with the pulse response reproducing a mirror image of the signal: h(t) ¼ s(T t), where T is, as usual, signal duration and an immaterial proportionality factor is set to be one. This filter emerges every now and again as an integral element of an optimal receiver in the
1
ρ (τ)
ρ 0(τ)
τ
Figure 2.16 Bandpass signal ACF

Classical reception problems and signal design |
45 |
|
|
AWGN channel, but its optimality often goes far beyond this specific channel model. In particular, it maximizes output SNR among all linear systems, signal given. In our current context the matched filter is important due to its ability to calculate and reproduce ACF as a real-time output waveform. To examine this, apply the signal s(t) to the input of the filter matched to s(t). The filter response r(t) may then be calculated as the convolution integral:
rðtÞ ¼ |
Z1 sð Þhðt Þ d ¼ |
Z1 sð ÞsðT t þ Þ d |
|
|
1 |
1 |
|
¼ |
Z1 sð Þs½ ðt TÞ& dt ¼ Rðt TÞ |
ð2:68Þ |
|
|
1 |
|
|
and duplicates the ACF in real time with predictable delay equal to the signal duration. To elucidate what was said, consider Figure 2.17. The rectangular baseband pulse s(t) of duration T (Figure 2.17a) has a triangular ACF R( ) of duration 2T with a maximum at the zero point (b, dashed line). In accordance with equation (2.68) the matched filter response reproduces a copy of this ACF delayed by the signal duration T so that maximal voltage at the filter output occurs at the moment when the input signal ends (b, solid line). If the pulse were bandpass with a rectangular envelope s(t), its ACF would be a triangular bandpass pulse (c, dashed bold line) and its T-delayed copy would appear at the bandpass matched filter output (c, solid bold line). The maximum of the filter response to the signal the filter is matched to always occurs at the moment of signal ending (at least no earlier), since this filter processes the whole signal. It is very instructive to note that for a bandpass signal moments of maximal envelope and maximal value of carrier cosine at the matched filter output always coincide, since ACF always assumes its maximum at the zero point (see also
Figure 2.16).
|
|
|
s (t ) |
|
(a) |
|
|
|
|
|
–T/2 |
0 |
T /2 |
t |
|
|
|||
(b) |
ρ(τ) |
|
|
r (t) |
–T |
. |
0 |
T |
τ, t |
ρ0(τ) |
||||
(c) |
ρ(τ) |
|
|
r (t ) |
|
|
|
||
|
|
0 |
|
τ, t |
Figure 2.17 Illustration to the definition of ACF and its forming by the matched filter