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

6
Spread spectrum signals for time measurement, synchronization and time-resolution
6.1 Demands on ACF: revisited
Let us return to the problems of estimating time delay and time-resolution studied in Sections 2.12 and 2.15, and recollect the demands imposed on a signal if high measuring accuracy and resolution capability are required. The principal condition to be met in both these problems is a response of the matched filter to a signal that is highly concentrated in time, or, equivalently, a ‘sharp’ signal ACF corresponding in the frequency domain to a wide spectrum. The attractiveness of spread spectrum as opposed to just shortening the signal is that with high processing gain WT 1 it is possible to put into a signal the energy dictated by the necessary SNR controlling only the duration of T rather than peak power, which typically has a strict upper limit. Then involvement of an appropriate angle modulation allows widening the signal bandwidth to the extent which provides time compression of the signal by the matched filter, so that the duration of the filter response (correlation spread c 1/W) appears to be many (about WT) times smaller than the duration T of the signal itself.
Let us specify what sort of ACF we may treat as sharp or ‘good’ concerning the reception problems in question. Actually, the ACF (see definitions (2.66) and (2.67)) of any physically realizable signal cannot equal strict zero at all beyond the range [ c, c], if the correlation spread c is smaller than the signal duration T. Thus, along
Spread Spectrum and CDMA: Principles and Applications Valery P. Ipatov
2005 John Wiley & Sons, Ltd

150 |
|
|
|
Spread Spectrum and CDMA |
|
. |
|
|
|
Central peak |
R(τ) |
|
Sidelobes |
|
|
|
|
||
|
|
|
|
|
–τc 0 τc |
τ |
Figure 6.1 Central peak and sidelobes of ACF
rd (τ)
t
Figure 6.2 ACF sidelobes and abnormal errors
with the so-called mainlobe or central peak within the interval [ c, c], the ACF has also sidelobes outside this range (see Figure 6.1). The effect of sidelobes is predominantly obstructive in both delay measuring and time-resolution. Indeed, to measure in an optimal (ML) manner the signal delay one should fix the time position of the maximum of the matched filter output envelope rd (t) (Section 2.12), and the ACF envelope is exactly the matched filter-detector response to a noiseless signal. In a real situation of noisy observation there is always some risk that somewhere beyond the ‘body’ of the ACF central peak a false maximum appears higher than a true (i.e. located within the body) one, as the dashed line in Figure 6.2 shows. In this case, an abnormal estimation error occurs, which is a deviation " of the estimate ^ from a genuine value exceeding c. It is obvious that confusion of the mainlobe with a false peak emerging in the vicinity of a high sidelobe is more probable than with the false peak located at the ‘empty place’. Actually, the closer the levels of mainlobe and sidelobe, the ‘easier’ it is for the Gaussian noise to raise the second over the first.
To illustrate a harmful effect of sidelobes on time-resolution consider the superposition of two replicas of a bandpass signal, which are time-shifted and scaled as shown in Figure 6.3a. After processing by a matched filter the mainlobe of the weaker replica proves to be fully hidden under the sidelobe of the stronger replica (Figure 6.3b). In these circumstances the observer cannot confidently extract necessary information from both signal copies, or even tell how many copies are received. A situation of this sort is a typical case of non-resolved signals, despite the mainlobe of the ACF being much shorter than the signal duration.
We may now summarize in the most general terms the requirements placed on spread spectrum signals by delay estimation and time-resolution problems: the ACF of the signal should have a sharp enough central peak and as low as possible level of sidelobes. In the remainder of this chapter we study ways and instruments of approaching this fundamental objective.

Time measurement, synchronization and time-resolution |
151 |
||||
|
s(t) |
|
|||
(a) |
|
|
s(t – τ) |
|
|
|
|
|
|||
|
|
|
|
|
|
|
|
|
|
|
|
t
r(τ) |
(b) |
t |
Figure 6.3 Non-resolution due to ACF sidelobes
6.2 Signals with continuous frequency modulation
Historically, among the first discovered signals possessing the matched filter timecompression feature was the linear frequency modulated (LFM) pulse. As the name tells us, the carrier frequency of this signal changes linearly throughout its duration. Consider a bandpass pulse whose instantaneous frequency f(t) grows with time according to the equation:
f ðtÞ ¼ f0 þ WTd t ; jtj T2
where Wd is the frequency deviation, i.e. the entire range of frequency variation, and f0 is, as usual, the central frequency. A complete phase F(t) of a signal is the integral of a momentary frequency, therefore for an LFM pulse the phase obeys a square law:
FðtÞ ¼ 2 Zt f ðtÞdt ¼ 2 f0t þ WTd t2; jtj T2
0
Assuming a rectangular real envelope, the complex envelope of the LFM signal takes the form:
_ |
|
|
8 exp j Td |
t2 |
; jtj |
2 |
|
S t |
|
> |
W |
|
T |
||
|
ð |
Þ ¼ |
> |
|
|
|
|
|
|
|
> |
|
|
|
|
|
|
|
< |
|
|
|
|
>
> T
>
: 0; jtj > 2

152 |
Spread Spectrum and CDMA |
|
|
.
~ ρ (τ) s(f)
|
|
|
|
|
|
|
τ |
|
f0 |
f |
1 |
|
2 |
||
|
|
|
|
|
|
||
|
Wd |
|
Wd |
3π |
|
||
|
(a) |
|
(b) |
|
|
Figure 6.4 Approximation of the spectrum and ACF of an LFM pulse
Substituting this equation into the definition of ACF (2.66), the latter can be calculated formally without any special difficulties. Less formal and more physically transparent logic, however, allows faster achievement of the result. It is well known [1] that when the modulation index ¼ Wd T is sufficiently large ( 1), the spectrum of a fre- quency-modulated signal contains components of all momentary frequencies, the shape of the spectrum approaching the signal real envelope. Thus, in our case, the spectrum spans the range [f0 Wd /2, f0 þ Wd /2] and has a form close to rectangular (Figure 6.4a). Now, ACF (2.66) may be found from the inverse Fourier transform, as was done in Section 2.12.2. Since the energy spectrum is again rectangular, its inverse Fourier transform is the function of view sinx x, so that the normalized ACF of the LFM signal:
|
Þ |
sinð Wd Þ |
6:1 |
Þ |
ð |
Wd |
ð |
which is shown in Figure 6.4b. To compare this result with the exact one, the reader may turn to Problem 6.41.
As is seen, the complete (i.e. measured between zeros closest to the origin) duration of the ACF mainlobe equals 2 c ¼ 2/Wd . As a matter of convention, the duration of the mainlobe on some non-zero level may be set equal to c ¼ 1/Wd , so that a matched filter time-compresses the LFM signal T/ c Wd T WT times.
A substantial deficiency of the LFM signal is a high level of ACF sidelobes. The one nearest to the origin has intensity 2/3 ( 13:5 dB) versus the mainlobe independently of the processing gain WT, i.e. its level cannot be reduced by increasing deviation Wd . To lower the sidelobes, smoothing of the signal envelope is an effective method (Problem 6.41) as well as weighting by a special window or mismatched processing in the receiver. In all of these methods, gain in the sidelobes is obtained in exchange for widening of the mainlobe or/and loss in output SNR.
Example 6.2.1. Take a rectangular LFM pulse with deviation Wd ¼ 20/T . Using the program of Problem 2.55 produces waveforms of the signal itself and the matched filter response given in Figure 6.5. Compare the time-compression ratio and level of the first sidelobe to what is expected theoretically.

Time measurement, synchronization and time-resolution |
153 |
|
|
MF input
MF output
1.0
0.5
0.0
–0.5
–1.0
0.2 |
0.4 |
0.6 |
0.8 |
1.0 |
1.2 |
1.4 |
1.6 |
1.8 |
2.0 |
1.0
0.5
0.0
–0.5
–1.0
0 |
0.2 |
0.4 |
0.6 |
0.8 |
1.0 |
1.2 |
1.4 |
1.6 |
1.8 |
2.0 |
|
|
|
|
|
t/T |
|
|
|
|
|
Figure 6.5 Time compression of a rectangular LFM pulse (Wd ¼ 20)
The other shortcoming of the LFM signal is its ridge-like ambiguity function 0( , F). From the study of Sections 2.14 and 2.15 we may deduce that for measuring simultaneously time-delay and frequency, as well as for time–frequency resolution, the best sort of ambiguity function is a needle-like one, having one central peak at the origin and falling sharply in all directions of the time–frequency plane. As is seen from Figure 6.6, where plots of the ambiguity function (a) and the ambiguity diagram (b) for an LFM
R0(τ, F)
|
|
|
|
10 |
|
|
|
|
1.0 |
|
|
|
8 |
|
|
|
|
|
|
|
6 |
|
|
|
||
0.8 |
|
|
|
|
|
|
||
|
|
|
4 |
|
|
|
||
0.6 |
|
|
|
|
|
|
||
|
|
|
2 |
|
|
|
||
|
|
|
|
|
|
|
||
0.4 |
|
|
FT |
0 |
|
|
|
|
|
|
|
|
|
|
|||
0.2 |
|
|
|
–2 |
|
|
|
|
0 |
|
|
|
–4 |
|
|
|
|
10 |
|
|
|
|
|
|
||
|
|
|
–6 |
|
|
|
||
|
|
|
|
|
|
|
||
0 |
|
1 |
|
–8 |
|
|
|
|
FT |
|
|
|
|
|
|||
|
0 |
–10 |
|
|
|
|||
–10 |
–1 |
|
|
|
||||
τ/T |
0.0 |
0.5 |
1.0 |
|||||
|
|
|
–1.0 –0.5 |
|||||
|
|
|
|
|
τ/T |
|
|
|
|
(a) |
|
|
|
(b) |
|
|
Figure 6.6 Ambiguity function (a) and its horizontal section (b) for an LFM signal (WT ¼ 10)