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

1
Spread spectrum signals and systems
1.1 Basic definition
The term spread spectrum is today one of the most popular in the radio engineering and communication community. At the same time, it may appear difficult to formulate an unequivocal and precise definition distinctively separating the spread spectrum philosophy from a ‘non-spread spectrum’ one. Certainly, every expert in system design and every experienced researcher has an intuitive understanding of the core of the issue, but—unlike a newcomer—such a person does not need to think about definitions in order to respond successfully to his or her professional challenges. From the point of view of the target audience of the book it seems worthwhile to dedicate some space to elaborating an appropriate explanation of what is implied in the following text under the spread spectrum concept.
Let us start with a reminder of the basics of spectral analysis. Every signal s(t) of finite energy can be synthesized as a sum of an uncountable number of harmonics whose amplitudes and phases within the infinitesimal frequency range [f , f þ df ] are determined by a spectral density or spectrum s~(f ). It is the pair of inverse and direct Fourier transforms that expresses this fact mathematically:
sðtÞ ¼ |
Z1~sðf Þ expðj2 ftÞ df |
s~ðf Þ ¼ |
Z1sðtÞ expð j2 ftÞ dt |
ð1:1Þ |
|
1 |
|
1 |
|
Due to the one-to-one correspondence between the signal representation in the time domain s(t) and in the frequency domain s~(f ), we are able to switch arbitrarily between these two tools, selecting the more convenient one for any specific task. To characterize the size of the zones occupied by signal energy in the time and frequency domains we use the notions of signal duration T and bandwidth W, respectively. A signal whose energy
Spread Spectrum and CDMA: Principles and Applications Valery P. Ipatov
2005 John Wiley & Sons, Ltd

2 |
Spread Spectrum and CDMA |
|
|
is concentrated within strictly limited space in the time domain cannot have finite (i.e. non-zero in only limited frequency interval) spectrum and vice versa. Because of this, to define at least one of the parameters T, W, or both, some agreement is necessary about what is meant by duration or bandwidth. In this way effective, root mean square, etc. duration and bandwidth came into existence, showing the size of a zone spanned by a substantial part of signal energy in the time and frequency domains, respectively [1].
It is absolutely obvious that one way or another, the word ‘spread’ is indicative of wide spectrum, i.e. broad bandwidth W of a signal. But against what is the spectrum wide? Where is the reference for comparison? To demonstrate how a definition of spread spectrum may provoke debate, let us consult with several excellent and world-renowned books.
A rather frequent way to explain the concept consists in the statement that a system or a signal is of spread spectrum type if its bandwidth significantly exceeds the minimum bandwidth necessary to send the information [1–6]. What may seem mentally problematic in this definition is the very idea of minimum bandwidth of information or message. According to the fundamental Shannon’s bound, spectral efficiency (the ratio between the data rate R and the signal bandwidth W ) of a communication system operating over the Gaussian channel obeys the inequality:
W |
|
þ N0 W |
|
N0 |
|
|
W |
ð Þ |
||||||||
|
|
|
|
|
|
|
|
|
|
|
|
R |
|
|||
R |
< log |
|
1 |
Eb |
|
R |
|
or |
Eb |
> |
2 |
W |
1 |
1:2 |
||
|
2 |
|
|
|
|
|
|
R |
|
|||||||
|
|
|
|
|
|
|
|
|
|
|
|
|
|
where Eb is signal energy per bit of information and N0 is the one-side power spectral density of a Gaussian noise. Figure 1.1 represents bound (1.2) graphically, showing that any combinations of R/W and Eb/N0 falling below the curve are possible, at least in principle. But this means that the theoretical ‘minimum bandwidth necessary to send the information’ is zero and therefore any real system—which, of course, occupies some
102
Forbidden area
Allowed area
101
R/W
100
10–1 |
50 |
100 |
150 |
200 |
250 |
300 |
0 |
Eb/N0 dB
Figure 1.1 Shannon’s bound
Spread spectrum signals and systems |
3 |
|
|
non-zero bandwidth—should be treated as a spread spectrum one! Undeniably, any attempt to use near-zero data transmission bandwidth would be rather demanding for signal energy. For one thing, to operate with R ¼ 100W one would need to provide bit signal-to-noise ratio Eb/N0 around 280 dB, which is quite unrealistic. However, data transmission within bandwidth, for instance, up to ten times smaller than data rate is quite typical and is practised in many digital communication links (radio-relay lines, modem communications etc.). This shows the vagueness of the very idea of the ‘minimal bandwidth’ and the arguable character of taking it as a starting point for explaining the notion of spread spectrum.
As an attempt to eliminate ambiguity we can try to use rate of data in bits per second as a substitute for the above-mentioned minimal necessary bandwidth [7,8]. It is not very logical, however, that one of many possible and, in principle, equal in rights units of measurement of data rate is rendered some conceptually prominent role. Besides, defining spread spectrum in terms of bandwidth significantly exceeding data rate in bits per second is risky of comprising systems which are in no way of spread-spectrum type. Take, for example, the uplink between a single user and a base station in a GSM mobile telephone. With the rate of primary digitized speech data of 9.6 kbits/s, the user’s signal has bandwidth around 200 kHz, which may mislead someone to classify GSM as a spread spectrum system. However, no genuine features of spread spectrum are involved in the band broadening in the GSM uplink: the only reason why bandwidth exceeds the data rate is time-division multiple access (TDMA) forcing operation with much shorter transmitted symbols in comparison with the actual average time interval per information bit.
There is still one more reason to look for alternative definitions. Even ignoring the troubles discussed earlier, linking a definition to data rate or ‘message bandwidth’ can serve only data transmission systems, whereas spread spectrum is widely employed in many others, like radar, sonar, navigation or remote control for time and distance measuring, signal resolution etc. Actually, these systems were among the first to adopt the advantages of the technology under discussion. In those applications such categories as ‘information rate’ or ‘data bandwidth’ are hardly meaningful or, at least, have nothing to do with the aims of spreading spectrum. In the wake of the endeavour to define ideas of spread spectrum in some universal way, matching not only communication aspects but the needs of other application areas as well, the following definition of spread spectrum seems more relevant.
Let us turn to the Gabor uncertainty principle, according to which the product of signal duration and bandwidth (time–frequency product) satisfies inequality WT a, where constant a depends on the exact way in which duration and bandwidth are specified; however, it is always of the order of 1. A signal for which WT 1, and therefore duration and bandwidth are tightly linked to each other can be called plain (non-spread spectrum). The only way to widen the bandwidth of a plain signal is to reduce its duration, i.e. to shorten it. On the other hand, a deterministic signal for which WT 1 and bandwidth can be governed independently of duration is a spread spectrum one. Putting it in other words, we may say that any spread spectrum signal occupies a rectangle in the time–frequency plane whose square is much greater than 1. This definition automatically defines a spread spectrum system, too: a system employing spread spectrum signals is a spread spectrum system.

4 |
Spread Spectrum and CDMA |
|
|
Note that in this definition the independence of duration and bandwidth is particularly emphasized, meaning that one can broaden the bandwidth (duration) without shortening the signal in time (frequency). This has a further implication for the critical role of angle (phase or frequency) modulation in all spread spectrum technology. Indeed, how can amplitude modulation help in widening the spectrum? The answer is: only by reducing the area over which signal energy is effectively spread in the time domain, i.e. by actually reducing the effective signal duration. It is only angle modulation that is capable of widening the signal spectrum with no influence on the time-distribution of signal energy.
As an illustration, Figure 1.2 gives the example of two rectangular pulses having the same duration T and carrier frequency f0: (a) a signal with no internal modulation and (b) a linearly frequency-modulated (LFM) signal with deviation Wd ¼ 20/T. The lower curves show the spectra of these signals. As is seen for signal (a), bandwidth W has the order W 1/T, meaning that the signal energy spans in the frequency domain an interval approximately equal to inverse pulse duration. Thereby, duration and bandwidth are strictly tied, the time–frequency product is fixed and widening the spectrum can be achieved only in exchange for pulse shortening. At the same time the bandwidth of pulse (b) is close to frequency deviation (W Wd ) and much greater than the inverse duration. As a result bandwidth can be easily controlled independently of signal duration by just varying the deviation. Accordingly, we classify the first signal as plain and the second as of spread spectrum type.
1.0 |
|
|
|
|
|
|
|
|
|
|
|
0.5 |
|
|
|
|
|
|
|
|
|
|
|
s(t) 0.0 |
|
|
|
|
|
|
|
|
|
|
|
|
–0.5 |
|
|
|
|
|
|
|
|
|
|
|
–1.0 |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
4 |
1000 |
|
|
|
|
|
|
|
|
|
|
|
800 |
|
|
|
|
|
|
|
|
|
|
|
600 |
|
|
|
|
|
|
|
|
|
|
|
~ |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
s( f ) |
|
|
|
|
|
|
|
|
|
|
|
|
400 |
|
|
|
|
|
|
|
|
|
|
200 |
|
|
|
|
|
|
|
|
|
|
|
0 |
10 |
20 |
30 |
40 |
0 |
10 |
20 |
30 |
40 |
||
0 |
|||||||||||
|
|
|
fT |
|
|
|
|
|
fT |
|
|
|
|
|
(a) |
|
|
|
|
|
(b) |
|
|
Figure 1.2 Unmodulated (a) and frequency modulated (b) rectangular pulses and their spectra