
- •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 |
23 |
|
|
reasoning for a doubling of the number of orthogonal bandpass signals against baseband ones follows directly from equations (2.24) and (2.25): building up ns orthogonal signals of the form (2.24), we can add to them ns more, obtained by just shifting the carrier frequency phase by angle /2. This possibility is practical only when all signals are deterministic or coherent, which means that their carrier phases are controllable and can actually be used for message identification. In reality, however, this may often not be the case because either a transmitter itself or a channel may destroy the coherence of signals in such a manner that their phases become random and as a consequence cannot be used for distinguishing messages. This case is addressed in Section 2.5.
2.4 Complex envelope of a bandpass signal
Before extending our discussion to the more complicated models of the M-ary transmission, it is reasonable to diverge from the main line in order to recollect some more facts about handling bandpass signals.
Let us begin with the observation that the real envelope S(t) in equation (2.24) is fictitious, i.e. is just a suitable artificial instrument, whereas only the signal s(t) itself is an observable physical reality. More than this, equation (2.24) does not give any unique definition of the envelope of s(t). In fact, it follows from (2.24) that one may take an arbitrary ‘phase modulation’ law (t), and then ‘envelope’ S(t) ¼ s(t)/ cos [2 f0t þ (t)] will produce a given signal s(t). Therefore, some special agreement is needed on how to interpret the notion of an envelope or amplitude modulation S(t).
A universally adopted basis for determining the envelope is the Hilbert transform. By its physical content, the Hilbert transform is just filtering which rotates the phases of all harmonic components independently of frequency through the same angle, /2, and does not change the amplitudes of the harmonics. In the frequency domain such a transform simply means multiplication of the signal spectrum by j /2 for positive frequencies and by j /2 for negative ones, and, therefore, the transfer function of a
Hilbert filter is |
~ |
hg(f ) ¼ j( /2)signf , where signx ¼ 1, x 0; signx ¼ 1, x < 0. |
Straightforward calculation of the inverse Fourier transform of this leads to a filter pulse response hg(t) ¼ 1/ t. Hence, in the time domain the Hilbert transform s?(t) of signal s(t) may be presented via the convolution integral:
|
?ð |
Þ ¼ |
1 |
t |
ð |
|
Þ |
||
|
Z0 |
|
|||||||
s |
t |
|
1 |
|
sð Þ |
d |
|
2:33 |
|
|
|
|
|
|
|
Using the definition of the Hilbert transform and the Parseval theorem, the reader may easily prove the following relations:
Z1
sðtÞ ¼ 1 s?ð Þ d
t
0
which is nothing but the inverse Hilbert transform, and:
ðu; vÞ ¼ ðu?; v?Þ |
ðu; v?Þ ¼ ðu?; vÞ |
ð2:34Þ |

24 |
Spread Spectrum and CDMA |
|
|
The first equation in (2.34) shows that the Hilbert transform preserves the inner product of signals u(t), v(t), while the second establishes the interrelation between the inner products of one of the signals and the Hilbert transform of the other.
Returning now to the issue of the signal envelope definition, we put:
q |
|
SðtÞ ¼ s2ðtÞ þ s?2 ðtÞ |
ð2:35Þ |
At first glance, this definition of the envelope looks somewhat artificial; however, a deeper insight uncovers its complete naturalness. Indeed, how would we calculate the unknown constant amplitude A of the unmodulated continuous wave (CW) i.e. the observed signal u(t) ¼ A cos (2 f0t þ )? One way is to take the signal itself and its copy
v(t) rotated through the angle /2 and then make use of Pythagorean theorem: p
A ¼ u2(t) þ v2(t). But it is seen at once that for the unmodulated signal u(t) its phase-shifted copy v(t) is nothing but the Hilbert transform: v(t) ¼ u?(t). Thus, we have a result absolutely consistent with (2.35). Now take a modulated signal s(t). Its envelope S(t) is just instant amplitude at time moment t. For a bandpass signal it changes slowly as compared to the CW cos 2 f0t, and we can treat s(t) within a sufficiently small time interval around the moment t as though it is the unmodulated harmonic with amplitude S(t). Then how do we find this amplitude S(t)? Exactly as it is done for the unmodulated signal, i.e. by /2 phase shifting (Hilbert transform) and application of Pythagorean theorem (2.35). Figure 2.8 illustrates this. Thus the problem of unambiguous understanding of a bandpass signal envelope is solved and definition (2.35) may be used universally.
Analysing bandpass signals becomes much easier with the introduction of one more very convenient tool—the complex envelope S_(t), which is a complex-valued function of time defined immediately by equation (2.24) or (2.25) once the definition of the real envelope is specified:
|
_ |
|
|
ð2:36Þ |
|
SðtÞ ¼ SI ðtÞ þ jSQðtÞ ¼ SðtÞ½cos ðtÞ þ j sin ðtÞ& ¼ SðtÞ exp½j ðtÞ& |
|||
|
p |
|
and the Euler formula is used. As is seen, the complex |
envelope |
integrates in |
||||
where |
j ¼ |
1 |
itself both amplitude and angle modulation of the signal. If several signals are considered, given the common frequency carrier, their distinction consists only in modulation laws, and hence complex envelopes give an exhaustive description of them.
Certainly, a complex envelope, along with a real one, is just a suitable mathematical fiction and the ‘true’ signal (2.24) is expressed in terms of the complex envelope as:
_ |
ð2:37Þ |
sðtÞ ¼ Re½SðtÞ expðj2 f0tÞ& |
S(t)
s (t)
s(t)
Figure 2.8 The definition of envelope

Classical reception problems and signal design |
25 |
|
|
where Re stands for taking the real part of the complex entity, and the second cofactor in the square brackets is a complex notation of the CW of a carrier frequency f0 through the Euler formula. Turning again to Figure 2.8, we can see that with s(t) treated according to (2.37) as a real part of the complex signal S_(t) exp (j2 f0t), the imaginary part of the latter is the Hilbert transform of s(t):
s?ðtÞ ¼ Im½S_ðtÞ expðj2 f0tÞ&
This leads to one more complex substitute of the real signal, called the analytic signal:
_ |
ð2:38Þ |
sðtÞ ¼ SðtÞ expðj2 f0tÞ ¼ sðtÞ þ js?ðtÞ |
Formally, the analytic signal uses complex notation to advance factorization model (2.24) of a bandpass signal so that the first factor covers all modulation (not only amplitude modulation) and the second is responsible for only the unmodulated CW of a carrier frequency f0.
Using the basic rule of spectral analysis, it may be easily proved that the spectrum of the complex envelope of a bandpass signal (2.37) is located around zero frequency. Therefore—since, given the carrier frequency, the signal is entirely presented by its complex envelope—the latter is a baseband equivalent of a bandpass signal, simplifying the analytical and computational work by getting rid of the carrier frequency dependence.
In what follows we will need a generalized version of the inner product (2.5), which is applicable not only to real signals u(t), v(t) but also to their complex substitutes— analytic signals u(t), v(t) or complex envelopes U_ (t), V_ (t). This modified inner product is defined as:
ZT ZT
ðu; vÞ ¼ |
uðtÞv ðtÞdt ¼ |
_ _ |
_ _ |
ð2:39Þ |
UðtÞV ðtÞ dt ¼ ðU; VÞ |
00
where a complex conjugation is used to preserve the equality between the inner product of the vector by itself and the vector squared length (always real and non-negative!), while coincidence of the inner products of analytic signals and complex envelopes follows from definition (2.38). Specifically, for a signal s(t) of energy E, according to equations (2.36) and (2.35):
ðS_ ; S_ Þ ¼ S_ |
2¼ ZT jS_ðtÞj2dt ¼ ZT S2ðtÞ dt ¼ ZT s2ðtÞdt þ ZT s?2 ðtÞdt ¼ 2E |
ð2:40Þ |
||||
|
|
0 |
0 |
0 |
0 |
|
|
|
|
|
|
|
|
since the Hilbert transform does not affect the amplitude–frequency spectrum and therefore the energies of s(t) and s?(t) are always the same.
Let us now take two signals sk(t), sl(t) and calculate the squared distance between their complex envelopes S_k(t), S_l(t):
2 |
_ _ |
|
_ |
|
_ |
|
2 |
|
_ |
_ |
_ |
|
_ |
|
2 41 |
|
|
|
|
|
|
|
|
|
|
||||||||
d |
ðSk; SlÞ ¼ |
|
Sk |
Sl |
l |
|
¼ ðSk |
Sl; Sk |
SlÞ |
|
: |
|
||||
|
¼ |
k |
þ |
|
|
|
kl |
k |
|
l |
ð |
Þ |
||||
|
2E |
2E |
4Re |
h |
pi |
|
||||||||||
|
|
|
|
|
|
E E |
|
|
|
|

26 |
Spread Spectrum and CDMA |
|
|
where use is made of the linearity of inner product (2.39) and equation (2.40); while kl,
as in (2.16), is again the correlation coefficient but adapted to complex-valued signals, e.g. complex envelopes:
ðS_ k; S_ lÞ
kl ¼ _ _ ¼Sk Sl
|
T |
S_kðtÞS_l ðtÞ dt |
ð2:42Þ |
2pEkEl Z |
|||
1 |
|
|
|
|
0 |
|
|
Equation (2.41) may be treated as the cosine theorem for complex vectors and Re[ kl] is
an adequate measure of resemblance between the complex envelopes of signals sk(t) and sl(t). Using the equality between inner products of analytical signals and complex envelopes (2.39) and equations (2.38) and (2.34), the integral in (2.42) can be reduced as follows:
ZT ZT
S_kðtÞS_l ðtÞdt ¼ ðskðtÞ þ jsk?ðtÞÞðslðtÞ jsl?ðtÞÞ dt ¼ 2ðsk; slÞ þ 2jðsk?; slÞ
0 0
so that Re( kl) ¼ kl, i.e. coincides with the ordinary correlation coefficient of signals
sk(t), sl(t) defined by (2.14). This being allowed for in (2.41) ties together the distances between the complex envelopes and the signals themselves:
d |
2 |
_ _ |
2 |
ðsk; slÞ |
ð2:43Þ |
|
ðSk; SlÞ ¼ 2d |
|
The last result is one of many examples of the productiveness of the notion of complex envelope: manipulations with complex envelopes are very often much more compact and feasible than those with bandpass signals themselves, being free from the bulky trigonometric functions of carrier frequency terms.
2.5 M-ary data transmission: noncoherent signals
Let us now proceed to a problem of M-ary data transmission, but this time, unlike Sections 2.2 and 2.3, assuming that the signals are not fully deterministic. As has already been pointed out, in real life situations are very likely when either the transmitter or a channel can not preserve the coherence of bandpass signals and the latter acquire random phases at the receiving side. In this case initial phases cannot take part in message distinguishing, and the distinctness of signals should go beyond only phase shifts. Scenarios of this sort are termed noncoherent reception.
Suppose that the kth bandpass signal sk(t) has the modulation law described by a deterministic complex envelope S_k(t) and a random time-constant initial phase k. Then it can be presented according to model (2.37) in the form:
skðt; kÞ ¼ Re½S_kðt; kÞ expðj2 f0tÞ&
where a ‘complete’ complex envelope allowing for a random initial phase: S_k
consists of the deterministic part and a part (t; k) ¼ S_k(t) exp (j k).

Classical reception problems and signal design |
27 |
|
|
To calculate the distance between the signals sk(t; k), sl(t; l) we can make use of equation (2.43) and evaluate the distance between the complex envelopes S_k(t; k), S_l(t; l) instead of the signals themselves. Doing this, consistent with the generalization of the cosine theorem (2.41) and under the assumption that all signals have identical energies E, we get:
d2ðS_ k ; S_ l Þ ¼ 4E½1 Re klð Þ&
where the additional subscript underlines the correspondence of the vector S_ k to the complete complex envelope S_k(t; k), independence of signal energy E of initial phase k is taken into account, and:
klð Þ ¼ |
ð |
|
2E |
|
T |
S_kðt; kÞS_l ðt; lÞ dt |
_ |
Þ ¼ 2E Z0 |
|||||
|
|
_ |
1 |
|
|
|
|
|
Sk ; Sl |
|
|
is the correlation coefficient of the complete complex envelopes S_k(t; k), S_l(t; l). Phases k, l being independent of time, the latter quantity can be rewritten as kl( )
¼ kl exp [j( k l)], where the correlation coefficient kl covering only the deterministic
(random-phase-free) complex envelopes S_k(t), S_l(t) of the signals is introduced:
kl ¼ |
ð |
|
2E |
Þ |
|
T |
S_kðtÞS_l ðtÞ dt ¼ j klj expðj klÞ |
ð2:44Þ |
_ |
¼ 2E Z0 |
|||||||
|
|
_ |
|
1 |
|
|
|
|
|
|
Sk; Sl |
|
|
|
|
where kl ¼ arg ( kl):
Now, the squared distance above takes the form:
2 |
_ _ |
j klj cosð kl þ k lÞ& |
ð2:45Þ |
d |
ðSk ; Sl Þ ¼ 4E½1 |
The trouble about this distance is its dependence on unknown signal phases k, l. Due to this, there are a lot of distances for the fixed deterministic modulation laws S_k(t), S_l(t) governed by a random phase difference k l. With a perceptible level of the correlation modulus j klj the hazard is always present that due to unfavourable combination of phases (that is, when kl þ k l is small enough) the distance (2.45) may prove very small. To fully ensure against it, the correlation modulus should be as low as possible and the best signal set should obey the condition:
|
|
_ _ |
|
|
|
|
|
|
|
|
|
kl ¼ |
ðSk; SlÞ |
¼ |
0; k l; |
k; l |
¼ |
1; 2; . . . ; M |
ð |
2:46 |
Þ |
|
2E |
6¼ |
|
|
|
As is seen, we again, as in Section 2.3, come to orthogonal signals. This time, however, the orthogonality condition is much more binding, forcing complex envelopes, or in other words modulation laws, of signals to be orthogonal, not just the signals themselves. Because of this, bandpass signals retain orthogonality under any combinations of their phases, since kl ¼ 0 entails kl( ) ¼ 0. On the other hand, condition (2.46)
excludes the opportunity to provide orthogonality by means of a quadrature phase shift