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

322 |
Spread Spectrum and CDMA |
|
|
. |
|
|
. |
|
|
|
|
|
Y(t) |
|
Sampler |
Yi |
Dropping |
|
|
Serial to |
|
|
|
|
|
prefix |
|
|
parallel |
|
|
|
|
|
|
|
|
||
|
|
|
|
|
|
|
|
|
DDFT
~.
Y1
~.
Y2
w*1
~.
YMc
w*Mc
Decision unit
ˆ
b1
ˆ
b2
ˆ
bMc
Figure 10.5 OFDM receiver structure
~
unit by the channel transfer function H_ i at the corresponding frequencies.1 To learn
~
the current channel state, i.e. H_ i, some special training procedures are typically used. Note also that since the guard interval creates a sort of overhead reducing the data transmission rate, it is often reasonable to increase Mc, making the guard interval a small fraction of OFDM symbol duration.
When data are transmitted with PSK and subchannel signals are processed separately, i.e. the ith component of DDFT (10.32) is used independently of the others to demodulate the modulation symbol bi, the equalization above may be simplified to just compensation of the channel phase shift, since subcarrier amplitude is redundant for a decision. If joined subchannel processing is necessary,~however, e.g. in the case of MC-based CDMA considered below, the amplitudes of H_ i are of serious importance, and the ultimate equalizing may appear preferable.
Summarizing, we may present the OFDM receiver structure in the form of Figure 10.5. The sampler provides samples Y_ l, from which the prefix ones are then discarded. The
sample sequence is then transformed into a parallel form. The DDFT unit outputs DFT
~
spectral components Y_ i, which are data symbols bi distorted by noise and channel effects.
Therefore they, after equalizing (just multiplying by an appropriate weight coefficients wi ),
^
may serve to elaborate data symbol estimates bi in the same manner as for BPSK, QPSK, QAM or other modulation mode.
10.2.3 Multicarrier CDMA
The MC modulation scheme is easily adaptable to the multiuser environment to provide code division multiplexing. Unlike DS CDMA, where an appropriate signature shaping in the time domain provides separation of user signals, in multicarrier CDMA (MC-CDMA) signatures are formed in the frequency domain, by controlling the amplitudes and phases of subcarriers in a user-specific manner. One way of explaining MC-CDMA is linking DS CDMA with MC transmission. Let us refer back to Figure 10.3 and imagine that instead of the source fast bit stream we have the kth user data symbol
1 Such evening of the channel transfer function is known as zero-forcing equalizing and was mentioned earlier in Section 6.12.

Spread spectrum systems development |
323 |
|
|
stream spread by the kth user DS signature of length (spreading factor) N. By this we have N DS chips of duration D per kth user data symbol of duration Tp. Let us demultiplex this fast DS spread stream into Mc ¼ N slow streams, unfolding every data symbol into Mc ¼ N parallel chips of long duration D0 ¼ Tp ¼ ND. Each of these parallel slow chip streams is further transmitted in an MC (OFDM) manner, so that each user has his specific law of modulating subcarriers.
Let us describe the same more directly. Let bk be a current data symbol of the kth user. Let ak ¼ (ak, 0, ak, 1, . . . , ak, N 1) be the kth user signature vector, now used in the frequency domain. To form the MC-CDMA signal N components of vector bkak manipulate in parallel amplitudes and phases of Mc ¼ N subcarriers f1, f2, . . . , fN during the pulse of duration Tp. Summation of all manipulated subcarriers produces the ith MC-CDMA symbol of duration Tp transmitted by the kth user. Certainly, with F ¼ 1/Tp implementing MC-CDMA is more feasible in a typical OFDM DFT-based form, but the direct way of generating the MC-CDMA signal shown in Figure 10.6 for the case of real (e.g. BPSK) alphabets of data symbols and signatures is more transparent as an illustration of the idea. Its generalization to complex alphabets is straightforward. In the OFDM implementation the IDFT unit replaces the multi-channel structure of Figure 10.6.
In synchronous non-oversaturated systems, like mobile radio downlink, any set of K N orthogonal signature vectors (Walsh functions etc.) might provide MAI-free separation of OFDM MC-CDMA user signals, since the orthogonality of the DFT spectra guarantees the orthogonality of OFDM symbols. Selection of signatures in asynchronous systems (e.g. mobile radio uplinks) is not that straightforward, although some minimax signature ensembles characteristic of asynchronous DS CDMA (see Section 7.5) may be of interest for MC-CDMA, too [105–107]. There is one more complication related to designing MC-CDMA signatures which is especially topical for mobile uplinks: the real envelope of the MC-CDMA signal, in contrast to that of DS CDMA, has significant variations, making the peak-factor perceptibly greater than
|
|
× |
× |
|
|
|
|
|
|
|
|
|
|
|
|
|
|||
|
|
|
cos(2π f1t) |
|
|
|
|
||
|
|
|
|
|
|
|
|
||
|
|
ak,0 |
|
|
|
|
|||
kth user datastream |
× |
× |
|
|
∑ |
MC symbols |
|||
|
|
|
|
cos(2π f2t) |
|
|
|
|
|
|
|
|
|
|
|
|
|
||
|
|
ak,1 |
|
|
|
|
|||
|
|
× |
× |
|
|
|
|
|
|
|
|
|
|
|
|
|
|||
|
|
|
cos(2π fNt) |
|
|
|
|
||
|
|
|
|
|
|
|
|
||
|
|
ak,N – 1 |
|
|
|
|
Figure 10.6 Generation of kth user MC-CDMA signal

324 |
Spread Spectrum and CDMA |
|
|
one. This issue is to be taken into consideration and, all other factors being the same, of the many candidates the signature set providing the smallest peak-factor should be preferred.
Figure 10.7 presents a generic (non-DFT-based) structure of the kth user’s MC-CDMA receiver. It consists of N ¼ Mc channels, each tuned to its own frequency and realized as a complex correlator processing the observation complex envelope Y_ (t). To counter flat fading within each frequency subchannel, the complex value zk, i from the ith
correlator output is weighted by a complex coefficient wi and multiplied by the conjugated signature symbol ak, i. The last operation is nothing but despreading in the frequency domain. Summation of such products over all subchannels produces the statistic zk to be used in estimating the kth user’s current data symbol bk. Again, in a
DFT realization the DDFT unit replaces the set of correlators.
Let us briefly touch upon the issue of choosing weight coefficients wi , i ¼ 1, 2, . . . , N. In the scenario of MC-CDMA this task is somewhat more complicated than in conventional MC transmission, due to the necessity of controlling MAI level. Suppose that all user signals pass through the same channel, as is the case, e.g., for a mobile downlink.
Since subcarrier spacing F is no smaller than the channel coherence bandwidth, values
~
of the channel transfer function H_ i, i ¼ 1, 2, . . . , N at the subcarrier frequencies may
disperse independently in a wide range. Normalizing the channel transfer function as
N 1 |
|
N |
|
~ |
|
2 |
P |
i¼1 |
H_ i |
¼ 1 lets us characterize the kth signal undistorted intensity by amplitude |
|||
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Ak. Then the powers Pk, Pnk, Pl created by the useful signal, noise and the lth MAI, respectively, at the kth user output are calculated as:
Pk ¼ Ak |
|
|
ak;i 1 |
|
|
H_ iwi |
; Pnk ¼ |
|
|
|
|
ak;i 1 |
|
|
jwij ; Pl ¼ Al |
al;i 1ak;i 1H_ iwi |
|
2 |
||||||||||||||||
|
|
|
N |
|
|
|
|
|
|
|
|
2 |
|
|
N |
|
|
|
|
|
|
|
|
|
|
|
N |
|
|
|
|
|||
|
|
i¼1 |
|
|
|
|
|
|
|
|
|
i¼1 |
|
|
|
|
|
|
|
|
|
|
|
i¼1 |
|
|
|
|
||||||
2 |
|
X |
|
|
|
2 |
~ |
|
|
|
X |
|
|
2 |
2 |
|
|
2 |
X |
~ |
|
|
||||||||||||
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
. |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
||
|
|
|
|
|
|
|
Correlator |
|
zk,1 |
× |
|
|
|
|
|
|
× |
|
|
|
|
|
|
|
|
|
|
|||||||
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|||||||||
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|||
|
|
|
|
|
|
|
|
|
|
|
exp(–j2πf1t) |
|
* |
|
|
|
|
|
a* |
|
|
|
|
|
|
|
|
|||||||
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
||||||||||
. |
|
|
|
|
|
|
|
|
|
|
|
. |
|
|
w1 |
|
|
|
|
|
|
|
k,0 |
|
|
|
|
. |
|
|
|
|||
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
||||
|
Y(t) |
|
|
|
|
Correlator |
|
zk,2 |
× |
|
|
|
|
|
|
× |
|
|
|
|
|
∑ |
zk |
|
|
|||||||||
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
||||||||||||
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|||
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
||
|
|
|
|
|
|
|
|
|
|
|
exp(–j2πf2t) |
|
* |
|
|
|
|
|
|
* |
|
|
|
|
|
|
|
|
||||||
|
|
|
|
|
|
|
|
|
|
|
|
|
. |
|
|
w2 |
|
|
|
|
|
|
ak,1 |
|
|
|
|
|
|
|
|
|||
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
||
|
|
|
|
|
|
|
Correlator |
|
zk,N |
× |
|
|
|
|
|
|
× |
|
|
|
|
|
|
|
|
|
|
|||||||
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|||||||||
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|||
|
|
|
|
|
|
|
|
|
|
|
exp( –j2πfNt) |
|
wN* |
|
|
|
|
|
ak,N* –1 |
|
|
|
|
|
|
|
|
|||||||
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
||||||||||
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Figure 10.7 Generic scheme of MC-CDMA receiver

Spread spectrum systems development |
325 |
|
|
where 2 is noise subchannel power. It is seen now that even if signatures are originally orthonormal:
N 1
X
al;iak;i ¼ kl
i¼0
the frequency selectivity over the subchannels may destroy orthogonality, amplifying some and suppressing other subcarriers. As a result MAI emerges so that not all
Pl, l 6¼k are zeros. To preserve signature orthogonality at the receiving end indepen-
~
dently of the channel current state one should select wi ¼ 1/H_ i, i ¼ 1, 2, . . . , N, i.e. realize zero-forcing equalizing entirely compensating for the channel effects. This, however, is a mismatched processing whenever the channel amplitude transfer function is non-uniform, so that the penalty for complete suppression of MAI is loss in SNR q2k, zf corresponding to zero-forcing combining:
|
|
|
|
|
|
|
i |
N |
|
|
|
|
|
|
|
|
|
|
2 |
|
2 |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
||||
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|||||||
|
|
|
|
|
|
|
|
|
|
|
ak;i |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
||||||||
|
|
Pk |
|
|
2 |
|
|
|
|
|
|
1 |
|
|
|
|
|
|
|
|
|
|
|
|
2 N |
|
|
|
|
2 ~ |
|
|
|
||||||||||||||
2 |
|
|
Ak |
|
|
|
1 |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2 |
|
|
Ak |
|
|
|
|
|
|
|
2 |
|
|||||||||||||
qk;zf |
|
|
|
|
|
|
|
|
¼ |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
qk;mf |
|
|
|
|
|
|
ak;i |
|
1 |
|
|
|
Hi |
|
|
||||
¼ Pnk |
¼ |
2 |
N |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2 |
|
¼ |
|
2 |
|
|
|
|
|
|
|
|
|
||||||||||||||||
|
|
|
P |
|
|
|
|
1 |
|
|
2 |
|
~ |
|
|
|
|
|
|
|
i |
¼ |
1 |
|
|
|
|
|
|
|
|
|
|||||||||||||||
|
|
|
|
|
|
|
|
|
|
ak;i |
|
|
|
|
|
H_ |
i |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|||||||||
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
X |
|
|
|
|
|
|
|
|
|
||||||||
|
|
|
|
|
|
i¼1 |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
||||||||
2 |
|
|
|
|
|
P |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
||||
where qk, mf is power SNR achieved with the matched processing, i.e. maximal ratio |
|||||||||||||||||||||||||||||||||||||||||||||||
|
|
|
|
|
|
|
|
|
|
|
~ |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
combining (Section 3.6.1) wi |
|
|
|
|
|
_ |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
||||||
¼ Hi . For the case of originally equal intensities of all |
|||||||||||||||||||||||||||||||||||||||||||||||
subcarrier components jak, ij ¼ 1/ |
p |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2 |
|
|
|
2 |
of zero- |
||||||||||||||
|
|
|
N, i ¼ 1, 2, . . . , N SNR loss ¼ qk, mf |
/qk, zf |
|||||||||||||||||||||||||||||||||||||||||||
forcing combining versus the maximal ratio one (cf. (6.42)): |
|
|
|
|
|
|
|
|
|
|
|
|
|||||||||||||||||||||||||||||||||||
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
||
|
|
|
|
|
|
|
|
|
|
|
|
|
|
¼ |
|
1 |
|
N |
|
|
~ |
|
|
2 |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
ð10:33Þ |
|||||||
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
N i¼1 |
H_ i |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|||||||||||||||
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
X |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|||
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
It is seen from (10.33) that when~ nonuniformity of the channel amplitude frequency distortion is remarkable (some H_ i are close to zero), SNR loss, i.e. the penalty for radical elimination of MAI, may appear intolerable, and it is more reasonable to seek for a compromise between the levels of unsuppressed MAI and noise. One of the approaches of this sort leads to MMSE equalization, the idea of which is similar to that discussed in the previous section applied to multiuser detection. Details of this technique, as well as further insight into the spread spectrum MC philosophy, can be found in [105,106] and the numerous references listed there.
In conclusion, we again stress that no hard barrier exists between DS and MC CDMA. They are just parallel technical ways of getting the same result: the spread spectrum signature. The latter may always be synthesized either as a superposition of harmonics in the frequency domain (MC) or by direct shaping in the time domain (DS).
10.2.4 Applications
The penetration of the MC technique into digital telecommunication is presently very wide. Among examples of its practical application are the standards of digital audio and video broadcasting DAB, DVB-T etc. The positive experience accumulated to date