Spread Spectrum and CDMA: Principles and Applications

Spread Spectrum and CDMA......Page 4
Contents......Page 8
Preface......Page 14
1.1 Basic definition......Page 16
1.2 Historical sketch......Page 20
2.1 Gaussian channel, general reception problem and optimal decision rules......Page 22
2.2 Binary data transmission (deterministic signals)......Page 26
2.3 M-ary data transmission: deterministic signals......Page 32
2.4 Complex envelope of a bandpass signal......Page 38
2.5 M-ary data transmission: noncoherent signals......Page 41
2.6 Trade-off between orthogonal-coding gain and bandwidth......Page 43
2.7.1 Time-shift coding......Page 46
2.7.3 Spread spectrum orthogonal coding......Page 48
2.8.1 Problem statement and estimation rule......Page 52
2.8.2 Estimation accuracy......Page 54
2.9 Amplitude estimation......Page 56
2.11 Autocorrelation function and matched filter response......Page 58
2.12.1 Estimation algorithm......Page 61
2.12.2 Estimation accuracy......Page 63
2.13 Estimation of carrier frequency......Page 68
2.14 Simultaneous estimation of time delay and frequency......Page 70
2.15 Signal resolution......Page 73
2.16 Summary......Page 76
Problems......Page 77
Matlab-based problems......Page 83
3.1 Jamming immunity......Page 92
3.1.1 Narrowband jammer......Page 93
3.1.2 Barrage jammer......Page 95
3.2 Low probability of detection......Page 97
3.3 Signal structure secrecy......Page 102
3.4 Electromagnetic compatibility......Page 103
3.5 Propagation effects in wireless systems......Page 104
3.5.2 Shadowing......Page 105
3.5.3 Multipath fading......Page 106
3.5.4 Performance analysis......Page 110
3.6.1 Combining modes......Page 113
3.6.2 Arranging diversity branches......Page 115
3.7 Multipath diversity and RAKE receiver......Page 117
Problems......Page 121
Matlab-based problems......Page 124
4.1 Multiuser systems and the multiple access problem......Page 130
4.2 Frequency division multiple access......Page 132
4.3 Time division multiple access......Page 133
4.4 Synchronous code division multiple access......Page 134
4.5 Asynchronous CDMA......Page 136
4.6.1 The resource reuse problem and cellular systems......Page 139
4.6.2 Number of users per cell in asynchronous CDMA......Page 140
Problems......Page 144
Matlab-based problems......Page 145
5.1 Spread spectrum modulation......Page 150
5.2 General model and categorization of discrete signals......Page 151
5.3 Correlation functions of APSK signals......Page 152
5.4 Calculating correlation functions of code sequences......Page 154
5.5 Correlation functions of FSK signals......Page 157
Problems......Page 160
Matlab-based problems......Page 161
6.1 Demands on ACF: revisited......Page 164
6.2 Signals with continuous frequency modulation......Page 166
6.3 Criterion of good aperiodic ACF of APSK signals......Page 169
6.4 Optimization of aperiodic PSK signals......Page 170
6.5 Perfect periodic ACF: minimax binary sequences......Page 174
6.6.1 Definition of a finite field......Page 176
6.6.2 Linear sequences over finite fields......Page 178
6.6.3 m-sequences......Page 180
6.7 Periodic ACF of m-sequences......Page 182
6.8 More about finite fields......Page 185
6.9 Legendre sequences......Page 187
6.10 Binary codes with good aperiodic ACF: revisited......Page 189
6.11 Sequences with perfect periodic ACF......Page 191
6.11.1 Binary non-antipodal sequences......Page 192
6.11.2 Polyphase codes......Page 194
6.11.3 Ternary sequences......Page 196
6.12 Suppression of sidelobes along the delay axis......Page 200
6.12.1 Sidelobe suppression filter......Page 201
6.12.2 SNR loss calculation......Page 202
6.13 FSK signals with optimal aperiodic ACF......Page 207
Problems......Page 209
Matlab-based problems......Page 211
7.1.1 Direct sequence spreading: BPSK data modulation and binary signatures......Page 218
7.1.2 DS spreading: general case......Page 222
7.1.3 Frequency hopping spreading......Page 227
7.2.1 Problem formulation......Page 229
7.2.2 Optimizing signature sets in minimum distance......Page 230
7.2.3 Welch-bound sequences......Page 238
7.3 Approaches to designing signature ensembles for asynchronous DS CDMA......Page 242
7.4 Time-offset signatures for asynchronous CDMA......Page 247
7.5.1 Frequency-offset binary m-sequences......Page 250
7.5.2 Gold sets......Page 251
7.5.3 Kasami sets and their extensions......Page 254
7.5.4 Kamaletdinov ensembles......Page 256
Problems......Page 258
Matlab-based problems......Page 261
8.1 Acquisition and tracking procedures......Page 266
8.2.1 Algorithm model......Page 268
8.2.2 Probability of correct acquisition and average number of steps......Page 269
8.2.3 Minimizing average acquisition time......Page 273
8.3.1 Problem statement......Page 276
8.3.2 Sequential cell examining......Page 277
8.3.3 Serial-parallel search......Page 278
8.3.4 Rapid acquisition sequences......Page 279
8.4.1 Delay estimation by tracking......Page 280
8.4.2 Early–late DLL discriminators......Page 282
8.4.3 DLL noise performance......Page 285
Problems......Page 288
Matlab-based problems......Page 289
9.1 Preliminary notes and terminology......Page 292
9.2.1 Binary block codes and detection capability......Page 294
9.2.2 Linear codes and their polynomial representation......Page 296
9.2.3 Syndrome calculation and error detection......Page 299
9.2.4 Choice of generator polynomials for CRC......Page 300
9.3.1 Convolutional encoder......Page 301
9.3.2 Trellis diagram, free distance and asymptotic coding gain......Page 304
9.3.3 The Viterbi decoding algorithm......Page 307
9.4.1 Turbo encoders......Page 311
9.4.2 Iterative decoding......Page 314
9.4.3 Performance......Page 315
9.4.4 Applications......Page 316
Problems......Page 317
Matlab-based problems......Page 319
10.1.1 Optimal (ML) multiuser rule for synchronous CDMA......Page 322
10.1.2 Decorrelating algorithm......Page 324
10.1.3 Minimum mean-square error detection......Page 326
10.1.4 Blind MMSE detector......Page 329
10.1.5 Interference cancellation......Page 330
10.2 Multicarrier modulation and OFDM......Page 331
10.2.1 Multicarrier DS CDMA......Page 332
10.2.2 Conventional MC transmission and OFDM......Page 333
10.2.3 Multicarrier CDMA......Page 337
10.2.4 Applications......Page 340
10.3.1 Transmit diversity and the space–time coding problem......Page 341
10.3.2 Efficiency of transmit diversity......Page 342
10.3.3 Time-switched space–time code......Page 344
10.3.4 Alamouti space–time code......Page 346
10.3.5 Transmit diversity in spread spectrum applications......Page 348
Problems......Page 349
Matlab-based problems......Page 351
11.2 Global positioning system......Page 354
11.2.1 General system principles and architecture......Page 355
11.2.2 GPS ranging signals......Page 356
11.2.3 Signal processing......Page 358
11.2.5 GLONASS and GNSS......Page 359
11.3.1 Introductory remarks......Page 360
11.3.2 Spreading codes of IS-95......Page 361
11.3.3.2 Synchronization channel......Page 362
11.3.3.3 Paging channels......Page 363
11.3.3.4 Traffic channels......Page 364
11.3.3.5 Forward link modulation......Page 366
11.3.3.6 MS processing of forward link signal......Page 367
11.3.4.1 Reverse link traffic channel......Page 368
11.3.4.3 Reverse link modulation......Page 370
11.3.5 Evolution of air interface cdmaOne to cdma2000......Page 371
11.4.1 Preliminaries......Page 372
11.4.2 Types of UMTS channels......Page 373
11.4.3 Dedicated physical uplink channels......Page 374
11.4.4 Common physical uplink channels......Page 375
11.4.5 Uplink channelization codes......Page 376
11.4.6 Uplink scrambling......Page 377
11.4.7 Mapping downlink transport channels to physical channels......Page 378
11.4.8 Downlink physical channels format......Page 379
11.4.10 Downlink scrambling codes......Page 380
11.4.11.2 Primary synchronization code......Page 381
11.4.11.3 Secondary synchronization code......Page 382
References......Page 384
Index......Page 390