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

270 |
Spread Spectrum and CDMA |
|
|
modulation component B_ (t) and unknown initial phase . After multiplying the input signal with the references and extracting the low-frequency component the two resulting bandpass signals of difference carrier frequency f0 f1 will have complex envelopes AB_ (t)S_(t)S_ (t " /2) exp [j( #)]. Suppose that bandpass filters after the multipliers have pulse response with complex envelope H_ (t). Then real envelopes at the filter outputs calculated in terms of the convolution integral (see Section 2.12.1) are:
2 |
1 |
B_ S_ S_ |
|
" |
2 H_ t d |
|||||
|
|
Z |
ð Þ ð Þ |
|
|
|
ð Þ |
|
||
A |
|
|
|
|
|
|
|
|
||
|
|
|
|
|
|
|
|
|
|
|
|
|
1 |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
If the filter pulse response is rectangular of duration T equal to data symbol duration, and data modulation is PSK, then samples of output real envelopes at the moment t ¼ T are:
2 |
|
B_ t S_ t S_ |
|
t " |
2 dt |
|
2 |
S_ |
t S_ |
|
t " 2 |
dt |
|
AE " |
2 |
|
||||||||
|
A |
T |
ð Þ ð Þ |
|
|
|
|
|
¼ |
|
A |
T |
ð Þ |
|
|
|
¼ |
|
ð |
|
Þ |
|||
|
Z |
|
|
Z |
|
|
|
|
||||||||||||||||
|
|
0 |
|
|
|
|
|
|
|
|
|
0 |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
being proportional to the modulus of the corresponding value of ACF ( ) of the spreading complex envelope. The difference of squared moduli again gives a discriminator curve of form similar to the one of Figure 8.6 (see Problems 8.7 and 8.15).
Implementation of the scheme of Figure 8.8 may run into trouble in the form of parameter imbalance of the early and late branches. In order to get round it various solutions are known [9,18,77], including the tau-dither loop (another name is ‘timeshared’), where only a single branch is involved, switching by turns between the early and late references.
8.4.3 DLL noise performance
DLL is just a particular case of a phase-lock loop and exposes the difficulties as to the analysis of its behaviour, which are generic to nonlinear feedback systems [89,90]. Still, one of the most important characteristics of DLL performance–noise error of a steadystate delay tracking–is easily calculated whenever the linear approximation is applicable.
In practice, rather small noise error is usually wanted, meaning good filtering capability of the loop against noise. The fluctuations at the loop output may be considered small if the error, i.e. the difference between the true current signal delay and its estimation ^ delivered by DLL, is held within the linear zone of the discriminator curve with probability close to one. If this condition is met, one can believe that the discriminator curve is linear in the infinite range of error " ¼ ^ . This allows linearizing the system model as follows.
Let us limit ourselves to a baseband (or equivalently, coherent) discriminator of
DLL and calculate the noise power spectrum |
~ |
|
Nd (f ) at its output. Since the |
||
correlator of this discriminator correlates observation with |
a reference signal |
|
sr2(t) ¼ s(t /2) s(t þ /2), output noise variance |
according to |
(2.15) is found as |
¼ N0Er/2, where Er is reference energy over integration time T. With E being, as

Signal acquisition and tracking |
271 |
|
|
earlier, standard signal energy, Er ¼ 2E[1 ( )] and 2 ¼ N0E[1 ( )]. Integration over interval T may be thought of as low-pass filtering with bandwidth Wf ¼ 1/T, meaning that the found noise power is spread over this bandwidth and therefore one-side noise power spectrum at the discriminator output is:
~ |
2 |
|
|
|
|
|
Nd ðf Þ ¼ |
Wf |
¼ N0ET½1 ð Þ& |
|
ð8:23Þ |
||
With a rectangular chip shape and |
negligible |
level of sidelobes ( ) is |
an isosceles |
|||
triangle of unit height and base 2D, so that |
~ |
|
D. |
|||
Nd (f ) ¼ N0ET, whenever |
||||||
Replacing the true discriminator |
curve |
by |
an imaginary linear |
one |
means just |
an infinite continuation of a linear segment surrounding zero point with the same slope Sd . The last may be found from (8.22) allowing for evenness of ACF:
|
|
|
|
|
|
|
|
|
Sd ¼ |
ð"Þ |
|
¼ AE 0 |
|
|
0 |
||
|
d" |
" 0 |
2 |
|||||
|
de |
|
|
|
||||
|
|
|
|
¼ |
|
|
|
|
|
|
|
|
|
|
|
|
|
Leaning again upon a triangular shape of ACF gives:
(
2AE=D ¼ 2AEW;
Sd ¼
AE=D ¼ AEW;
2
< 2D
ð8:24Þ
¼ 2D
where estimation of discrete signal bandwidth W ¼ 1/D is substituted.
Imagine now that instead of a true noise n(t), which is added to the received signal,
~ |
~ |
2 |
is added directly to |
a dummy noise n (t) with power spectrum density N (f ) ¼ Nd (f )/Sd |
a measured parameter . At the output of a linear discriminator replacing the real one, this fictitious noise will be indistinguishable from the true noise at the real discriminator
2 ~ ¼ ~
output, since its power spectrum Sd N (f ) Nd (f ) is absolutely the same. We then arrive at the system model of Figure 8.9, whose input is not a signal corrupted by noise, but instead parameter itself in a mixture with a fictitious additive noise n (t). This mixture is processed by a linear closed loop, where estimation ^ is subtracted from the input
quantity, outputting the error ". The filter with transfer function |
~ |
h(f ) then smoothes |
error " scaled by a discriminator slope Sd to produce the output estimation ^. Filtering here aggregates operations fulfilled by a loop filter and VCO to convert a real discriminator error signal e(t) into a corresponding shift of a reference signal. This model is
|
|
|
|
|
|
Sd |
|
||
τ + nτ(t) |
+ |
|
|
ε |
|
|
|
|
|
|
|
× |
|
|
Filter |
||||
|
|
+ |
|
|
|
~ |
|||
|
|
|
|
||||||
|
|
|
|
|
|
|
|
|
h( f ) |
|
|
– |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
||
|
|
τ |
|
|
|
|
|
|
|
Figure 8.9 Linearized model of DLL

272 |
Spread Spectrum and CDMA |
|
|
entirely linear, and variance varf^g of random fluctuations at its output may be found, based on the superposition principle, independently of signal component, as:
varf^g ¼ Z1 N~ ðf Þ h~lðf Þ |
|
2 df |
ð8:25Þ |
|
0 |
|
|
|
|
|
|
|
|
|
~
where hl(f ) is the transfer function of a closed loop. To find the last quantity it is enough to apply the delta function to the loop input. Then the output spectrum, being exactly
~ |
~ |
~ |
~ |
|
|
|
|
hl(f ), obeys the equation hl(f ) ¼ [1 hl(f )]Sd h(f ) leading to a rule, which is well known |
|||||||
in the theory of linear feedback systems [2,7]: |
|
|
|
||||
|
|
|
|
~ |
|
|
|
|
h~ |
f |
Þ ¼ |
Sd hðf Þ |
ð |
8:26 |
Þ |
|
~ |
||||||
|
lð |
|
|
||||
|
|
|
|
1 þ Sd hðf Þ |
|
|
|
A dummy spectrum of delay fluctuations N (f ) is spread over the bandwidth Wf ¼ 1/T, which is typically much wider as compared to the bandwidth of the closed loop; otherwise the latter could not smooth noise fluctuations effectively. This allows the following version of (8.25):
|
|
|
|
|
|
|
|
|
|
|
~ |
|
|
|
|
|
|
var |
f |
^ |
N~ |
f |
Þ |
B |
N ¼ |
Nd ðf |
ÞBN |
|
|
ð |
8:27 |
Þ |
|||
|
g ¼ |
|
ð |
|
|
Sd2 |
|
|
|
||||||||
where the loop noise bandwidth BN is determined as: |
|
|
|
|
|
|
|||||||||||
1 |
h~lðf Þ df ¼ |
1 |
1 |
~ |
|
|
2 |
|
|
||||||||
BN ¼ |
|
|
SdSdðh~Þf |
df |
|
|
|||||||||||
Z |
|
|
2 |
|
|
Z |
þ |
ð |
Þ |
|
|
|
|||||
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
0 |
|
|
|
|
|
|
|
0 |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Returning now to (8.23) and (8.24) and noting that ( ) ¼ 1 /D, 0 < < D we may write (8.27) in the form:
var ^ |
8 |
1= 4W2q2 |
; |
|
Þ |
|
|
|
< 2 |
|
8:28 |
||
f g ¼ |
> |
ð =DÞ=ð4W |
2ql2 |
|
; |
0 < < D |
D |
ð Þ |
|||||
ð |
|
l Þ |
|
|
|
|
D |
|
|||||
|
> |
|
|
|
|
|
|
|
|
|
|
|
|
|
< |
|
2 |
2 |
|
|
|
|
¼ 2D |
|
|
||
|
> |
1=ðW |
ql Þ; |
|
|
|
|
|
|
||||
|
> |
|
|
|
|
|
|
|
|
|
|
|
|
where |
: |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
ql2 ¼ |
A2E |
|
¼ |
|
A2P |
|
|
ð8:29Þ |
||||
|
N0BN T |
N0BN |
|
|
|
is called SNR in the loop. The reason for such a name is obvious: the numerator of (8.29) contains an actual signal power, since P ¼ E/T is a power of a standard (having amplitude A ¼ 1) signal. At the same time, the denominator presents a noise power within the noise bandwidth of the loop.