
- •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
Operational wireless spread spectrum systems |
357 |
|
|
above the one of IS-95 are arranged, transmitting antenna-specific pilot signals from two BS antennas involved in diversity. This enables the MS to separate pilots of different antennas and have strictly synchronized references for the diversity signals to demodulate, decode and properly combine diversity branches.
More complex organization of cdma2000 requires stronger systematization of logical forward channels. Instead of only four in IS-95, the hierarchy of logical channels in cdma2000 contains 10 only on the first layer, adding common control channel, common power control channel, broadcast control channel, quick paging channels etc. As for the traffic channels, they include, among others, the fundamental ones (primarily used) and supplemental channels involved in multicode transmission when very high rates not achievable with only fundamental channels are on request. The supplemental channels may use either convolutional or turbo codes (see Section 9.4).
The reverse link of cdma2000 does not use the MC-DS-CDMA technique, being implemented as conventional DS CDMA with three times broader bandwidth (3.75 MHz). This corresponds to three times higher chip rate (3.6864 Mcps) of the long spreading code. With such high DS spreading rate, a number of solutions of IS-95 were revised and replaced by more relevant ones. First of all, a convolutional encoding rate 1/4 is used instead of 1/3, meaning that the raw data rate, say 9.6 kbps, after encoding becomes 38.4 kbps. Using QPSK data modulation and spreading such a codestream by a long code gives a spreading factor 2 (3:6864/38:4) 103 ¼ 192, which is not a critical loss as compared to 256 in IS-95. At the same time, the reduction of rate of a convolutional code of constraint length 9 to 1/4 returns some extra (non-asymptotic) coding gain. On this ground the designers decided to reject the orthogonal 64-ary modulation and bring the reverse traffic channel structure closer to that of the forward link.
Another distinction is the long list of logical channels, including the reverse pilot channel, which now becomes obligatory, since in the absence of orthogonal modulation the BS should have a local coherent reference to demodulate the QPSK data of MS. There are other new logical channels, some of them running simultaneously. Being channelized by the Walsh signals, they are then linearly summed, meaning that the transmitter power amplifier should be linear so involving O-QPSK is needless. Thus, an ordinary QPSK data modulator is used, where the QPSK-mapped codestream is first multiplied by the QPSK spreading code and then the real and imaginary parts of the product modulate the cosine and sine CW carrier components, as explained in Section 7.1. Note that, similarly to the forward link, reverse supplemental channels may support a reverse fundamental (traffic) channel (one per MS), providing multicode transmission at the high rates unattainable with only fundamental channels. The supplemental channels may again use either convolutional or turbo codes.
11.4 Air interface UMTS
11.4.1 Preliminaries
The UMTS (acronym of Universal Mobile Telecommunication System) is a 3G wideband CDMA standard whose development was pioneered by the European telecommunication community. Currently UMTS, along with cdma2000, enters the so-called IMT-2000 family, i.e. the list of standards declared by the International Telecommunication
358 |
Spread Spectrum and CDMA |
|
|
Union (ITU) to be basic for 3G systems. There are two versions of UMTS: frequency division duplex (FDD) and time division duplex (TDD). As is immediately seen from the names, these systems differ from each other in the method of separation between downlink and uplink. In FDD-UMTS downlink and uplink occupy non-overlapping frequency bands, while in TDD-UMTS they employ different time slots. For brevity we limit the discussion below to only FDD-UMTS, keeping in mind that many solutions adopted in it are common to both systems.
International regulatory documents allocate for FDD-UMTS in Europe frequency bands 1920–1980 MHz (uplink) and 2110–2170 MHz (downlink) with a limitation of 5 MHz on the link bandwidth. DS spreading is a fundamental technique securing separation of physical channels, in particular multiple access (DS CDMA). The standard sets a universal and constant chip rate 3.84 Mcps in full agreement with the bandwidth limitation. Like cdma2000, UMTS is a system in which the data transmission rate may vary in a very wide range. As a consequence of this, along with chip rate invariance, the spreading factor changes with transmission rate.
In what follows we concentrate again on the physical layer of the system, i.e. solutions concerning spreading, channelization and modulation. Note that BSs of UMTS do not rely upon GPS support and operate with their own autonomous non-synchronized clocks. Although this architecture saves on BS equipment costs, it does, however, make cell search and handover procedures more complicated and is responsible for many distinctions between the physical layers of UMTS and cdma2000.
Similarly to Section 11.3, we can hardly present here anything more than a very short sketch, but many recently published books dedicated to the UMTS standard [92,104,114,115,120–122] will help the interested reader to expand his/her knowledge about this system, which is likely to become dominant among mobile telecommunications in the near future.
11.4.2 Types of UMTS channels
According to the terminology of the UMTS specifications there are logical, transport and physical channels. On the layers higher than physical the data is distributed between the logical channels on the basis of information content, but before arriving at the physical layer it is restructured into the transport channels. The criterion to distinguish transport channels is mode and format of data representation, while physical channels (which are just signals bearing messages), as in any CDMA system, are distinguished by their specific codes. The physical layer consists of two sublayers. The transmitted data arrives at the first physical sublayer from the upper layers packed into transport channels according to information content. The first sublayer includes among other things attachment of CRC for data block protection, channel coding and interleaving. Channel coding is either convolutional (constraint length 9, rates 1/2 or 1/3) or turbo coding (constituent encoders of memory 3, rate 1/3). For very high data rate uncoded transmission is possible, too. The second sublayer, i.e. radio link, covers mapping the transport channels to the physical ones (signals), and transmitting signals over the propagation medium. The signal received by MS (downlink) or BS (uplink) then undergoes all necessary reciprocal operations of the two sublayers (demodulation,

Operational wireless spread spectrum systems |
359 |
|
|
deinterleaving, decoding etc.), reverse mapping when necessary, and passing the data over to the higher layers.
Another classification applicable to both transport and physical channels discriminates between common and dedicated ones. The first of them contain data relating to the whole system and commonly used by all users, whereas the second serve to establish a connection between BS and individual MS.
The time structure of all channels is strictly predetermined by the standard. All of them consist of frames of duration 10 ms (38 400 chips) and every frame is in its turn divided into 15 slots of duration 666:66 . . . ms (2560 chips).
11.4.3 Dedicated physical uplink channels
A dedicated physical channel is the one which the network grants to the MS to utilize exclusively, i.e. two mobiles within the same cell can never use the same dedicated channel. There are two types of dedicated uplink channels: dedicated physical data channel (DPDCH)4 and dedicated physical control channel (DPCCH), whose names are consistent with their functionalities. The DPCCH transmits to the BS service information: the pilot signal necessary to estimate propagation parameters and synchronize BS coherent reference, message about the format of data in DPDCH, feedback information used in handoff and power control commands. There is always only one DPCCH per MS, and the transmitted user’s data arrives at the physical layer packed into one dedicated transport channel per MS. But this unique transport channel may be mapped to several (up to six) DPDCH, if the necessary rate surpasses the maximum provided by a single DPDCH.
Multiplexing of dedicated channels is performed as follows (see Figure 11.7). The DPCCH is always transmitted through a quadrature branch of the QPSK modulator, while the first of the DPDCH is fed into the in-phase branch. The rest of the DPDCH, if any, are distributed between branches as equally as possible. Thus, despite the QPSK modulator involvement data modulation in the uplink is BPSK. The transmission rate over the DPCCH is always constant, equal to 15 kbps or 10 bits per slot. Then each bit occupies 2560/10 ¼ 256 chips and the spreading factor of DPCCH is always 256. The spreading factor of DPDCH, on the other hand, is variable depending on the necessary data rate and may change from 256 (minimal rate) to 4 (maximal rate). Thus the minimal data transmission rate is 15 kbps, while the maximal per DPDCH is 64 times higher, i.e. 960 kbps. Using up to six parallel DPDCH in the multicode transmission mode described in the previous section allows in principle a maximal rate of 5760 kbps. Certainly, the so-called gross rate (i.e. of codestream after a channel encoder) is meant, the raw datastream rate being lower proportionally to the channel code rate.
Every uplink physical channel has its specific channelization code multiplied with encoded data. Figure 11.7 presents a scenario where all DPDCH are active, using six different channelization codes CC1–CC6 with designation CCc reserved for the channelization code of DPCCH. After multiplication by the channelization code all physical
4 The names and abbreviations of the UMTS channels reproduce exactly those of the UMTS documents.

360 |
Spread Spectrum and CDMA |
|
|
CC1 Gd
DPDCH1 ×
×
CC2 Gd
DPDCH2 ×
×
CC3 Gd
DPDCH3 ×
×
CC4 Gd
DPDCH4 ×
×
CC5 Gd
DPDCH5 ×
×
CC6 Gd
DPDCH6 ×
×
CCc Gc
DPCCH ×
×
ΣI
To modulator (via scrambler)
Q
Σ
Figure 11.7 Multiplexing of dedicated uplink channels
channels are weighted by their gains, implementing the reverse link power control. Actually, only two different gains are involved: whatever the number of DPDCH, all of them have the same gain Gd , while the gain of DPCCH is Gc. The maximal gain value is one, zero gain cuts off a channel, and the step of variations of gain value is 1/15.
11.4.4 Common physical uplink channels
Common physical channels represent a resource that is at the common disposal of all mobiles. There are two types of common uplink channels: random access channel (RACH) and common packet channel (CPCH), the terms being used for both the transport and corresponding physical channels. The MS utilizes RACH to initiate a contact (e.g. call) with the network and to transmit short packet messages, CPCH being the main resource for MS packet transmission.
Physical RACH (PRACH) contains a preamble of 4096 chips, which is 16-chip MS identifier repeated 256 times. The MS can start transmission over PRACH at the beginning of any of 15 access slots occupying together two frames, i.e. 5120 chips or 20 ms. The diagram of access slots is set up in the BS transmission format using a special transport downlink channel (broadcasting channel, BCH). At the initial stage the MS has