Cambridge University Press
0521837162 - Wireless Communications - Andrea Goldsmith
Frontmatter/Prelims



WIRELESS COMMUNICATIONS

Wirelesss technology is a truly revolutionary paradigm shift, enabling multimedia communications between people and devices from any location. It also underpins exciting applications such as sensor networks, smart homes, telemedicine, and automated highways. This book provides a comprehensive introduction to the underlying theory, design techniques, and analytical tools of wireless communications,focusing primarily on the core principles of wireless system design.

   The book begins with an overviewof wireless systems and standards. The characteristics of the wireless channel are then described, including their fundamental capacity limits. Various modulation, coding, and signal processing schemes are then discussed in detail, including state-of-the- art adaptive modulation, multicarrier,spread-spectrum, and multiple-antenna techniques. The concluding chapters deal with multiuser communications, cellular system design, and ad hoc wireless network design.

   Design insights and trade-offs are emphasized throughout the book. It contains many worked examples, more than 200 figures, almost 300 homework exercises, and more than 700 references. Wireless Communications is an ideal textbook for students as well as a valuable reference for engineers in the wireless industry.

Andrea Goldsmith received her Ph.D. from the University of California, Berkeley, and is an Associate Professor of Electrical Engineering at Stanford University. Prior to this she was an Assistant Professor at the California Institute of Technology,and she has also held positions in industry at Maxim Technologies andAT&T Bell Laboratories. She is a Fellow of the IEEE, has received numerous other awards and honors, and is the author of more than 150 technical papers in the field of wireless communications.




Wireless Communications

ANDREA GOLDSMITH
Stanford University




CAMBRIDGE UNIVERSITY PRESS
Cambridge, NewYork, Melbourne, Madrid, Cape Town, Singapore, São Paulo

Cambridge University Press
40West 20th Street, NewYork, NY 10011-4211, USA

www.cambridge.org
Information on this title: www.cambridge.org/9780521837163

© Cambridge University Press 2005

This publication is in copyright. Subject to statutory exception
and to the provisions of relevant collective licensing agreements,
no reproduction of any part may take place without
the written permission of Cambridge University Press.

First published 2005

Printed in the United States of America

A catalog record for this publication is available from the British Library.

Library of Congress Cataloging in Publication Data
Goldsmith, Andrea
Wireless communications / Andrea Goldsmith.
p. cm.
Includes bibliographical references and index.
ISBN-13: 978-0-521-83716-3
1. Wireless communication systems. I. Title.

TK5103.2.G65    2005
621.382 – dc22    2005047075

ISBN-13 978-0-521-83716-3 hardback
ISBN-10 0-521-83716-2 hardback

Cambridge University Press has no responsibility for
the persistence or accuracy of URLs for external or
third-party InternetWeb sites referred to in this publication
and does not guarantee that any content on such
Web sites is, or will remain, accurate or appropriate.




   To Arturo, Daniel, and Nicole




The possession of knowledge does not kill the sense of wonder and mystery.

—Anaïs Nin




Brief Table of Contents

Preface page xvii
Abbreviations xxii
Notation xxvii
1   Overview of Wireless Communications 1
2   Path Loss and Shadowing 27
3   Statistical Multipath Channel Models 64
4   Capacity of Wireless Channels 99
5   Digital Modulation and Detection 126
6   Performance of Digital Modulation over Wireless Channels 172
7   Diversity 204
8   Coding for Wireless Channels 228
9   Adaptive Modulation and Coding 283
10   Multiple Antennas and Space-Time Communications 321
11   Equalization 351
12   Multicarrier Modulation 374
13   Spread Spectrum 403
14   Multiuser Systems 452
15   Cellular Systems and Infrastructure-Based Wireless Networks 505
16   Ad Hoc Wireless Networks 535
Appendices 573
Bibliography 605
Index 633



Contents

Preface page xvii
List of Abbreviations xxii
List of Notation xxvii
 
1 Overview of Wireless Communications 1
  1.1 History of Wireless Communications 1
  1.2 Wireless Vision 4
  1.3 Technical Issues 6
  1.4 Current Wireless Systems 8
     1.4.1 Cellular Telephone Systems 8
     1.4.2 Cordless Phones 13
     1.4.3 Wireless Local Area Networks 15
     1.4.4 Wide AreaWireless Data Services 16
     1.4.5 BroadbandWireless Access 17
     1.4.6 Paging Systems 17
     1.4.7 Satellite Networks 18
     1.4.8 Low-Cost, Low-Power Radios: Bluetooth and ZigBee 19
     1.4.9 Ultrawideband Radios 20
  1.5 TheWireless Spectrum 21
     1.5.1 Methods for Spectrum Allocation 21
     1.5.2 Spectrum Allocations for Existing Systems 22
  1.6 Standards 23
  Problems 24
  References 26
 
2 Path Loss and Shadowing 27
  2.1 RadioWave Propagation 28
  2.2 Transmit and Receive Signal Models 29
  2.3 Free-Space Path Loss 31
  2.4 Ray Tracing 33
     2.4.1 Two-Ray Model 34
     2.4.2 Ten-Ray Model (Dielectric Canyon) 37
     2.4.3 General Ray Tracing 38
     2.4.4 Local Mean Received Power 41
  2.5 Empirical Path-Loss Models 42
     2.5.1 Okumura Model 42
     2.5.2 Hata Model 43
     2.5.3 COST 231 Extension to Hata Model 44
     2.5.4 Piecewise Linear (Multislope) Model 44
     2.5.5 Indoor Attenuation Factors 45
  2.6 Simplified Path-Loss Model 46
  2.7 Shadow Fading 48
  2.8 Combined Path Loss and Shadowing 51
  2.9 Outage Probability under Path Loss and Shadowing 52
  2.10 Cell Coverage Area 53
  Problems 56
  References 60
 
3 Statistical Multipath Channel Models 64
  3.1 Time-Varying Channel Impulse Response 65
  3.2 Narrowband Fading Models 70
     3.2.1 Autocorrelation, Cross-Correlation, and Power Spectral Density 71
     3.2.2 Envelope and Power Distributions 78
     3.2.3 Level Crossing Rate and Average Fade Duration 79
     3.2.4 Finite-State Markov Channels 82
  3.3 Wideband Fading Models 82
     3.3.1 Power Delay Profile 86
     3.3.2 Coherence Bandwidth 88
     3.3.3 Doppler Power Spectrum and Channel Coherence Time 90
     3.3.4 Transforms for Autocorrelation and Scattering Functions 91
  3.4 Discrete-Time Model 92
  3.5 Space-Time Channel Models 93
  Problems 94
  References 97
 
4 Capacity of Wireless Channels 99
  4.1 Capacity in AWGN 100
  4.2 Capacity of Flat Fading Channels 102
     4.2.1 Channel and System Model 102
     4.2.2 Channel Distribution Information Known 102
     4.2.3 Channel Side Information at Receiver 103
     4.2.4 Channel Side Information at Transmitter and Receiver 107
     4.2.5 Capacity with Receiver Diversity 113
     4.2.6 Capacity Comparisons 114
  4.3 Capacity of Frequency-Selective Fading Channels 116
     4.3.1 Time-Invariant Channels 116
     4.3.2 Time-Varying Channels 119
  Problems 121
  References 124
 
5 Digital Modulation and Detection 126
  5.1 Signal Space Analysis 127
     5.1.1 Signal and System Model 128
     5.1.2 Geometric Representation of Signals 129
     5.1.3 Receiver Structure and Sufficient Statistics 132
     5.1.4 Decision Regions and the Maximum Likelihood Decision Criterion 134
     5.1.5 Error Probability and the Union Bound 137
  5.2 Passband Modulation Principles 142
  5.3 Amplitude and Phase Modulation 142
     5.3.1 Pulse Amplitude Modulation (MPAM) 144
     5.3.2 Phase-Shift Keying (MPSK) 146
     5.3.3 Quadrature Amplitude Modulation (MQAM) 148
     5.3.4 Differential Modulation 149
     5.3.5 Constellation Shaping 152
     5.3.6 Quadrature Offset 152
  5.4 Frequency Modulation 153
     5.4.1 Frequency-Shift Keying (FSK) and Minimum-Shift Keying 155
     5.4.2 Continuous-Phase FSK (CPFSK) 156
     5.4.3 Noncoherent Detection of FSK 156
  5.5 Pulse Shaping 157
  5.6 Symbol Synchronization and Carrier Phase Recovery 160
     5.6.1 Receiver Structure with Phase and Timing Recovery 161
     5.6.2 Maximum Likelihood Phase Estimation 163
     5.6.3 Maximum Likelihood Timing Estimation 165
  Problems 167
  References 170
 
6 Performance of Digital Modulation over Wireless Channels 172
  6.1 AWGN Channels 172
     6.1.1 Signal-to-Noise Power Ratio and Bit/Symbol Energy 172
     6.1.2 Error Probability for BPSK and QPSK 173
     6.1.3 Error Probability for MPSK 175
     6.1.4 Error Probability for MPAM and MQAM 176
     6.1.5 Error Probability for FSK and CPFSK 179
     6.1.6 Error Probability Approximation for Coherent Modulations 180
     6.1.7 Error Probability for Differential Modulation 180
  6.2 Alternate Q-Function Representation 182
  6.3 Fading 182
     6.3.1 Outage Probability 183
     6.3.2 Average Probability of Error 184
     6.3.3 Moment Generating Function Approach to Average Error Probability 187
  6.4 Doppler Spread 192
  6.5 Intersymbol Interference 195
  Problems 197
  References 202
 
7 Diversity 204
  7.1 Realization of Independent Fading Paths 204
  7.2 Receiver Diversity 206
     7.2.1 System Model 206
     7.2.2 Selection Combining 208
     7.2.3 Threshold Combining 211
     7.2.4 Maximal-Ratio Combining 214
     7.2.5 Equal-Gain Combining 216
  7.3 Transmitter Diversity 217
     7.3.1 Channel Known at Transmitter 217
     7.3.2 Channel Unknown at Transmitter– The Alamouti Scheme 219
  7.4 Moment Generating Functions in Diversity Analysis 220
     7.4.1 Diversity Analysis for MRC 221
     7.4.2 Diversity Analysis for EGC and SC 224
     7.4.3 Diversity Analysis for Noncoherent and Differentially Coherent Modulation 224
  Problems 225
  References 227
 
8 Coding for Wireless Channels 228
  8.1 Overview of Code Design 229
  8.2 Linear Block Codes 230
     8.2.1 Binary Linear Block Codes 231
     8.2.2 Generator Matrix 232
     8.2.3 Parity-Check Matrix and Syndrome Testing 234
     8.2.4 Cyclic Codes 236
     8.2.5 Hard Decision Decoding (HDD) 238
     8.2.6 Probability of Error for HDD in AWGN 240
     8.2.7 Probability of Error for SDD in AWGN 242
     8.2.8 Common Linear Block Codes 244
     8.2.9 Nonbinary Block Codes: The Reed Solomon Code 245
  8.3 Convolutional Codes 246
     8.3.1 Code Characterization: Trellis Diagrams 246
     8.3.2 Maximum Likelihood Decoding 249
     8.3.3 The Viterbi Algorithm 252
     8.3.4 Distance Properties 253
     8.3.5 State Diagrams and Transfer Functions 254
     8.3.6 Error Probability for Convolutional Codes 257
  8.4 Concatenated Codes 258
  8.5 Turbo Codes 259
  8.6 Low-Density Parity-Check Codes 262
  8.7 Coded Modulation 263
  8.8 Coding with Interleaving for Fading Channels 267
     8.8.1 Block Coding with Interleaving 267
     8.8.2 Convolutional Coding with Interleaving 270
     8.8.3 Coded Modulation with Symbol/Bit Interleaving 271
  8.9 Unequal Error Protection Codes 271
  8.10 Joint Source and Channel Coding 274
  Problems 275
  References 279
 
9 Adaptive Modulation and Coding 283
  9.1 Adaptive Transmission System 284
  9.2 Adaptive Techniques 285
     9.2.1 Variable-Rate Techniques 285
     9.2.2 Variable-Power Techniques 286
     9.2.3 Variable Error Probability 287
     9.2.4 Variable-Coding Techniques 288
     9.2.5 Hybrid Techniques 288
  9.3 Variable-Rate Variable-Power MQAM 288
     9.3.1 Error Probability Bounds 289
     9.3.2 Adaptive Rate and Power Schemes 290
     9.3.3 Channel Inversion with Fixed Rate 292
     9.3.4 Discrete-Rate Adaptation 293
     9.3.5 Average Fade Region Duration 298
     9.3.6 Exact versus Approximate Bit Error Probability 300
     9.3.7 Channel Estimation Error and Delay 300
     9.3.8 Adaptive Coded Modulation 303
  9.4 General M-ary Modulations 305
     9.4.1 Continuous-Rate Adaptation 305
     9.4.2 Discrete-Rate Adaptation 309
     9.4.3 Average BER Target 310
  9.5 Adaptive Techniques in Combined Fast and Slow Fading 314
  Problems 315
  References 319
 
10 Multiple Antennas and Space-Time Communications 321
  10.1 Narrowband MIMO Model 321
  10.2 Parallel Decomposition of the MIMO Channel 323
  10.3 MIMO Channel Capacity 325
     10.3.1 Static Channels 325
     10.3.2 Fading Channels 329
  10.4 MIMO Diversity Gain: Beamforming 334
  10.5 Diversity Multiplexing Trade-offs 335
  10.6 Space-Time Modulation and Coding 337
     10.6.1 ML Detection and Pairwise Error Probability 337
     10.6.2 Rank and Determinant Criteria 339
     10.6.3 Space-Time Trellis and Block Codes 339
     10.6.4 Spatial Multiplexing and BLAST Architectures 340
  10.7 Frequency-Selective MIMO Channels 342
  10.8 Smart Antennas 343
  Problems 344
  References 347
 
11 Equalization 351
  11.1 Equalizer Noise Enhancement 352
  11.2 Equalizer Types 353
  11.3 Folded Spectrum and ISI-Free Transmission 354
  11.4 Linear Equalizers 357
     11.4.1 Zero-Forcing (ZF) Equalizers 358
     11.4.2 Minimum Mean-Square Error (MMSE) Equalizers 359
  11.5 Maximum Likelihood Sequence Estimation 362
  11.6 Decision-Feedback Equalization 364
  11.7 Other Equalization Methods 365
  11.8 Adaptive Equalizers: Training and Tracking 366
  Problems 368
  References 372
 
12 Multicarrier Modulation 374
  12.1 Data Transmission Using Multiple Carriers 375
  12.2 Multicarrier Modulation with Overlapping Subchannels 378
  12.3 Mitigation of Subcarrier Fading 380
     12.3.1 Coding with Interleaving over Time and Frequency 381
     12.3.2 Frequency Equalization 381
     12.3.3 Precoding 381
     12.3.4 Adaptive Loading 382
  12.4 Discrete Implementation of Multicarrier Modulation 383
     12.4.1 The DFT and Its Properties 383
     12.4.2 The Cyclic Prefix 384
     12.4.3 Orthogonal Frequency-Division Multiplexing (OFDM) 386
     12.4.4 Matrix Representation of OFDM 388
     12.4.5 Vector Coding 390
  12.5 Challenges in Multicarrier Systems 393
     12.5.1 Peak-to-Average Power Ratio 393
     12.5.2 Frequency and Timing Offset 395
  12.6 Case Study: The IEEE 802.11a Wireless LAN Standard 396
  Problems 398
  References 401
 
13 Spread Spectrum 403
  13.1 Spread-Spectrum Principles 403
  13.2 Direct-Sequence Spread Spectrum (DSSS) 409
     13.2.1 DSSS System Model 409
     13.2.2 Spreading Codes for ISI Rejection: Random,Pseudorandom, and m-Sequences 413
     13.2.3 Synchronization 417
     13.2.4 RAKE Receivers 419
  13.3 Frequency-Hopping Spread Spectrum (FHSS) 421
  13.4 Multiuser DSSS Systems 424
     13.4.1 Spreading Codes for Multiuser DSSS 425
     13.4.2 Downlink Channels 428
     13.4.3 Uplink Channels 433
     13.4.4 Multiuser Detection 438
     13.4.5 Multicarrier CDMA 441
  13.5 Multiuser FHSS Systems 443
  Problems 443
  References 449
 
14 Multiuser Systems 452
  14.1 Multiuser Channels: The Uplink and Downlink 452
  14.2 Multiple Access 454
     14.2.1 Frequency-Division Multiple Access (FDMA) 455
     14.2.2 Time-Division Multiple Access (TDMA) 456
     14.2.3 Code-Division Multiple Access (CDMA) 458
     14.2.4 Space-Division Multiple Access (SDMA) 459
     14.2.5 Hybrid Techniques 460
  14.3 Random Access 461
     14.3.1 Pure ALOHA 462
     14.3.2 Slotted ALOHA 463
     14.3.3 Carrier-Sense Multiple Access (CSMA) 464
     14.3.4 Scheduling 466
  14.4 Power Control 466
  14.5 Downlink (Broadcast) Channel Capacity 469
     14.5.1 Channel Model 470
     14.5.2 Capacity in AWGN 470
     14.5.3 Common Data 476
     14.5.4 Capacity in Fading 477
     14.5.5 Capacity with Multiple Antennas 483
  14.6 Uplink (Multiple Access) Channel Capacity 484
     14.6.1 Capacity in AWGN 484
     14.6.2 Capacity in Fading 488
     14.6.3 Capacity with Multiple Antennas 490
  14.7 Uplink – Downlink Duality 490
  14.8 Multiuser Diversity 494
  14.9 MIMO Multiuser Systems 496
  Problems 497
  References 500
 
15 Cellular Systems and Infrastructure-Based Wireless Networks 505
  15.1 Cellular System Fundamentals 505
  15.2 Channel Reuse 508
  15.3 SIR and User Capacity 514
     15.3.1 Orthogonal Systems (TDMA/FDMA) 514
     15.3.2 Nonorthogonal Systems (CDMA) 516
  15.4 Interference Reduction Techniques 518
  15.5 Dynamic Resource Allocation 520
     15.5.1 Scheduling 520
     15.5.2 Dynamic Channel Assignment 521
     15.5.3 Power Control 522
  15.6 Fundamental Rate Limits 524
     15.6.1 Shannon Capacity of Cellular Systems 524
     15.6.2 Area Spectral Efficiency 525
  Problems 528
  References 531
 
16 Ad Hoc Wireless Networks 535
  16.1 Applications 535
     16.1.1 Data Networks 537
     16.1.2 Home Networks 537
     16.1.3 Device Networks 538
     16.1.4 Sensor Networks 538
     16.1.5 Distributed Control Systems 539
  16.2 Design Principles and Challenges 540
  16.3 Protocol Layers 542
     16.3.1 Physical Layer Design 543
     16.3.2 Access Layer Design 544
     16.3.3 Network Layer Design 547
     16.3.4 Transport Layer Design 552
     16.3.5 Application Layer Design 553
  16.4 Cross-Layer Design 554
  16.5 Network Capacity Limits 556
  16.6 Energy-Constrained Networks 558
     16.6.1 Modulation and Coding 559
     16.6.2 MIMO and Cooperative MIMO 560
     16.6.3 Access, Routing, and Sleeping 561
     16.6.4 Cross-Layer Design under Energy Constraints 562
     16.6.5 Capacity per Unit Energy 562
  Problems 564
  References 566
 
Appendix A
Representation of Bandpass Signals and Channels 573
 
Appendix B
Probability Theory, Random Variables, and Random Processes 577
B.1 Probability Theory 577
B.2 Random Variables 578
B.3 Random Processes 583
B.4 Gaussian Processes 586
 
Appendix C
Matrix Definitions, Operations, and Properties 588
C.1 Matrices and Vectors 588
C.2 Matrix and Vector Operations 589
C.3 Matrix Decompositions 592
 
Appendix D
Summary of Wireless Standards 595
D.1 Cellular Phone Standards 595
   D.1.1 First-Generation Analog Systems 595
   D.1.2 Second-Generation Digital Systems 596
   D.1.3 Evolution of Second-Generation Systems 598
   D.1.4 Third-Generation Systems 599
D.2 Wireless Local Area Networks 600
D.3 Wireless Short-Distance Networking Standards 601
 
Bibliography 605
Index 633



Preface

Wireless communications is a broad and dynamic field that has spurred tremendous excitement and technological advances over the last fewdecades. The goal of this book is to provide readers with a comprehensive understanding of the fundamental principles underlying wireless communications. These principles include the characteristics and performance limits of wireless systems, the techniques and mathematical tools needed to analyze them, and the insights and trade-offs associated with their design. Current and envisioned wireless systems are used to motivate and exemplify these fundamental principles. The book can be used as a senior- or graduate-level textbook and as a reference for engineers, academic and industrial researchers, and students working in the wireless field.

ORGANIZATION OF THE BOOK

Chapter 1 begins with an overview of wireless communications, including its history, a vision for the future, and an overview of current systems and standards. Wireless channel characteristics, which drive many of the challenges in wireless system design, are described in Chapters 2 and 3. In particular, Chapter 2 covers path loss and shadowing in wireless channels, which vary over relatively large distances. Chapter 3 characterizes the flat and frequency-selective properties of multipath fading, which change over much smaller distances– on the order of the signal wavelength. Fundamental capacity limits of wireless channels along with the capacity-achieving transmission strategies are treated in Chapter 4.Although these techniques have unconstrained complexity and delay, they provide insight and motivation for many of the practical schemes discussed in later chapters. In Chapters 5 and 6 the focus shifts to digital modulation techniques and their performance in wireless channels. These chapters indicate that fading can significantly degrade performance. Thus,fading mitigation techniques are required for high-performance wireless systems.

   The next several chapters cover the primary mitigation techniques for flat and frequencyselective fading. Specifically, Chapter 7 covers the underlying principles of diversity techniques, including a newmathematical tool that greatly simplifies performance analysis. These techniques can remove most of the detrimental effects of flat fading. Chapter 8 provides comprehensive coverage of coding techniques, including mature methods for block, convolutional, and trellis coding as well as recent developments in concatenated, turbo, and LDPC codes. This chapter illustrates that, though coding techniques for noisy channels have near-optimal performance, many open issues remain in the design and performance analysis of codes for wireless systems. Chapter 9 treats adaptive modulation in flat fading, which enables robust and spectrally efficient communication by leveraging the time-varying nature of the wireless channel. This chapter also ties the techniques and performance of adaptive modulation to the fundamental capacity limits of flat fading channels. Multiple-antenna techniques and space-time communication systems are covered in Chapter 10: the additional spatial dimension enables high data rates and robustness to fading. Equalization, which exploits signal processing in the receiver to compensate for frequency-selective fading, is covered in Chapter 11. Multicarrier modulation, described in Chapter 12, is simpler and more flexible than equalization for frequency-selective fading mitigation. Single-user and multiuser spread-spectrum techniques are described in Chapter 13. These techniques not only mitigate frequency-selective fading, they also allow multiple users to share the same wireless spectrum.

   The last three chapters of the book focus on multiuser systems and networks. Chapter 14 treats multiple and random access techniques for sharing the wireless channel among many users with continuous or bursty data. Power control is also covered in this chapter as a mechanism to reduce interference between users while ensuring that all users meet their performance targets. The chapter closes by discussing the fundamental capacity limits of multiuser channels as well as the transmission and channel sharing techniques that achieve these limits. Chapter 15 covers the design, optimization, and performance analysis of cellular systems, along with advanced topics related to power control and fundamental limits in these systems. The last chapter, Chapter 16, discusses the fundamental principles and open research challenges associated with wireless ad hoc networks.

REQUIRED BACKGROUND

   The only prerequisite knowledge for the book is a basic understanding of probability, random processes, and Fourier techniques for system and signal analysis. Background in digital communications is helpful but not required, as the underlying principles from this field are covered in the text. Three appendices summarize key background material used in different chapters of the text. Specifically, AppendixAdiscusses the equivalent lowpass representation of bandpass signals and systems, which simplifies bandpass system analysis. Appendix B provides a summary of the main concepts in probability and random processes that are used throughout the book. Appendix C provides definitions, results, and properties related to matrices, which are widely used in Chapters 10 and 12. The last appendix, Appendix D, summarizes the main characteristics of current wireless systems and standards.

BOOK FEATURES

The tremendous research activity in the wireless field – coupled with the complexity of wireless system design – make it impossible to provide comprehensive details on all topics discussed in the book. Thus, each chapter contains a broad list of references that build and expand on what is covered in the text. The book also contains nearly a hundred worked examples to illustrate and highlight key principles and trade-offs. In addition, the book includes about 300 homework exercises. These exercises, which fall into several broad categories, are designed to enhance and reinforce the material in the main text. Some exercises are targeted to exemplify or provide more depth to key concepts, as well as to derive or illustrate properties of wireless systems using these concepts. Exercises are also used to prove results stated but not derived in the text. Another category of exercises obtains numerical results that give insight into operating parameters and performance of wireless systems in typical environments. Exercises also introduce new concepts or system designs that are not discussed in the text. A solutions manual is available that covers all the exercises.

USING THIS BOOK IN COURSES

The book is designed to provide much flexibility as a textbook, depending on the desired length of the course, student background, and course focus. The core of the book is in Chapters 1 through 6. Thereafter, each chapter covers a different stand-alone topic that can be omitted or may be covered in other courses. Necessary prerequisites for a course using this text are an undergraduate course in signals and systems (both analog and digital) and one in probability theory and random processes. It is also helpful if students have a prerequisite or corequisite course in digital communications, in which case the material in Chapter 5 (along with overlapping material in other chapters) can be covered quickly as a review.

   The book breaks down naturally into three segments: core material in Chapters 1–6, single-user wireless system design in Chapters 7–13, and multiuser wireless networks in Chapters 14–16. Most of the material in the book can be covered in two to three quarters or two semesters. A three-quarter sequence would follow the natural segmentation of the chapters, perhaps with an in-depth research project at the end. For a course sequence of two semesters or quarters, the first course could focus on Chapters 1–10 (single-user systems with flat fading) and the second course could focus on Chapters 11–16 (frequency-selective fading techniques, multiuser systems, and wireless networks). A one-quarter or semester course could focus on single-user wireless systems based on the core material in Chapters 1–6 and selected topics from Chapters 7–13. In this case a second optional quarter or semester could be offered covering multiuser systems and wireless networks (part of Chapter 13 and Chapters 14–16). I use this breakdown in a two-quarter sequence at Stanford, where the second quarter is offered every other year and includes additional reading material from the literature as well as an in-depth research project. Alternatively, a one-quarter or semester course could cover both single and multiuser systems based on Chapters 1–6 and Chapters 13–16, with some additional topics from Chapters 7–12 as time permits.

   A companion Web site (http://www.cambridge.org/9780521837163) provides supplemental material for the book, including lecture slides, additional exercises, and errata.

ACKNOWLEDGMENTS

It takes a village to complete a book, and I am deeply indebted to many people for their help during the multiple phases of this project. I first want to thank the ten generations of students at Caltech and Stanford who suffered through the annual revisions of my wireless course notes: their suggestions, insights, and experiences were extremely valuable in honing the topics, coverage, and tone of the book. John Proakis and several anonymous reviewers provided valuable and in-depth comments and suggestions on early book drafts, identifying omissions and weaknesses, which greatly strengthened the final manuscript. My current graduate students Rajiv Agrawal, Shuguang Cui,Yifan Liang, Xiangheng Liu, Chris Ng, and Taesang Yoo meticulously proofread many chapter drafts, providing new perspectives and insights, rederiving formulas, checking for typos, and catching my errors and omissions. My former graduate students Tim Holliday, Syed Jafar, Nihar Jindal, Neelesh Mehta, Stavros Toumpis, and Sriram Vishwanath carefully scrutinized one or more chapters and provided valuable input. In addition, all of my current and former students (those already mentioned as well as Mohamed-Slim Alouini, Soon-Ghee Chua, Lifang Li, and KevinYu) contributed to the content of the book through their research results, especially in Chapters 4, 7, 9, 10, 14, and 16. The solutions manual was developed by Rajiv Agrawal, Grace Gao, and Ankit Kumar. I am also indebted to many colleagues who took time from their busy schedules, sometimes on very short notice, to read and critique specific chapters. They were extremely gracious, generous, and honest with their comments and criticisms. Their deep and valuable insights not only greatly improved the book but also taught me a lot about wireless. For these efforts I am extremely grateful to Jeff Andrews, Tony Ephremides, Mike Fitz, Dennis Goeckel, Larry Greenstein, Ralf Koetter, P. R. Kumar, Muriel Médard, Larry Milstein, Sergio Servetto, SergioVerdú, and RoyYates. Don Cox was always available to share his infinite engineering wisdom and to enlighten me about many of the subtleties and assumptions associated with wireless systems. I am also grateful to my many collaborators over the years, as well as to my co-workers at Maxim Technologies and AT%T Bell Laboratories, who have enriched my knowledge of wireless communications and related fields.

   I am indebted to the colleagues, students, and leadership at Stanford who created the dynamic, stimulating, and exciting research and teaching environment in which this book evolved. I am also grateful for funding support from ONR and NSF throughout the development of the book. Much gratitude is also due to my administrative assistants Joice DeBolt and Pat Oshiro for taking care of all matters big and small in support of my research and teaching, and for making sure I had enough food and caffeine to get through each day. I would also like to thank copy editor Matt Darnell for his skill and attention to detail throughout the production process. My editor Phil Meyler has followed this book from its inception ten years ago until today. His encouragement and enthusiasm about the book never waned, and he has accommodated all of my changes and delays with grace and good humor. I cannot imagine a better editor with whom to embark on such a difficult, taxing, and rewarding undertaking.

   I would like to thank two people in particular for their early and ongoing support in this project and all my professional endeavors. Larry Greenstein ignited my initial interest in wireless through his deep insight and research experience. He has served as a great source of knowledge, mentoring, and friendship. Pravin Varaiya was deeply influential as a Ph.D.advisor and role model due to his breadth and depth of knowledge along with his amazing rigor, insight, and passion for excellence. He has been a constant source of encouragement, inspiration, and friendship.

   My friends and family have provided much love, support, and encouragement for which I am deeply grateful. I thank them for not abandoning me despite my long absences during the final stages of finishing the manuscript, and also for providing an incredible support network without which the book could not have been completed. I am especially grateful to Remy, Penny, and Lili for their love and support, and to my mother Adrienne for her love and for instilling in me her creativity and penchant for writing. My fatherWerner has profoundly influenced this book and my entire career both directly and indirectly. He was the senior Professor Goldsmith, a prolific researcher, author, and pioneer in many areas of mechanical and biological engineering. His suggestion to pursue engineering launched my career, for which he was my biggest cheerleader. His pride, love, and encouragement have been a constant source of support. I was fortunate to help him complete his final paper, and I have tried in this book to mimic his rigor, attention to detail, and obsession with typos that I experienced during that collaboration.

   Finally, no words are sufficient to express my gratitude and love for my husband Arturo and my children Daniel and Nicole. Arturo has provided infinite support for this book and every other aspect of my career, for which he has made many sacrifices. His pride, love, encouragement, and devotion have sustained me through the ups and downs of academic and family life. He is the best husband, father, and friend I could have dreamed of, and he enriches my life in every way. Daniel and Nicole are the sunshine in my universe – each day is brighter because of their love and sweetness. I am incredibly lucky to share my life with these three special people. This book is dedicated to them.

Abbreviations

3GPP Third Generation Partnership Project
 
ACK acknowledgment (packet)
ACL Asynchronous Connection-Less
AFD average fade duration
AFRD average fade region duration
AGC automatic gain control
AMPS Advance Mobile Phone Service
AOA angle of arrival
AODV ad hoc on-demand distance vector
APP a posteriori probability
ARQ automatic repeat request (protocol)
ASE area spectral efficiency
AWGN additive white Gaussian noise
 
BC broadcast channel
BCH Bose–Chadhuri–Hocquenghem
BER bit error rate
BICM bit-interleaved coded modulation
BLAST Bell Labs Layered Space Time
BPSK binary phase-shift keying
BS base station
 
CCK complementary code keying
CD code division cdf cumulative distribution function
CDI channel distribution information
CDMA code-division multiple access
CDPD cellular digital packet data
CLT central limit theorem
COVQ channel-optimized vector quantizer
CPFSK continuous-phase FSK
CSI channel side information
CSIR CSI at the receiver
CSIT CSI at the transmitter
CSMA carrier-sense multiple access
CTS clear to send (packet)
 
DARPA Defense Advanced Research Projects Agency
D-BLAST diagonal BLAST
DCA dynamic channel assignment
DCS Digital Cellular System
DECT Digital Enhanced Cordless Telecommunications
DFE decision-feedback equalization
DFT discrete Fourier transform
D-MPSK differential M-ary PSK
DPC dirty paper coding
DPSK differential binary PSK
D-QPSK differential quadrature PSK
DS direct sequence
DSDV destination sequenced distance vector
DSL digital subscriber line
DSR dynamic source routing
DSSS direct-sequence spread spectrum
 
EDGE Enhanced Data rates for GSM Evolution
EGC equal-gain combining
ETACS European Total Access Communication System
ETSI European Telecommunications Standards Institute
EURO-COST European Cooperative for Scientific and Technical Research
 
FAF floor attenuation factor
FCC Federal Communications Commission
FD frequency division
FDD frequency-division duplexing
FDMA frequency-division multiple access
FFH fast frequency hopping
FFT fast Fourier transform
FH frequency hopping
FHSS frequency-hopping spread spectrum
FIR finite impulse response
FSK frequency-shift keying
FSMC finite-state Markov channel
 
GEO geosynchronous orbit
GFSK Gaussian frequency-shift keying
GMSK Gaussian minimum-shift keying
GPRS General Packet Radio Service
GRT general ray tracing
GSM Global Systems for Mobile Communications
GTD geometrical theory of diffraction
 
HDD hard decision decoding
HDR high data rate
HDSL high–bit-rate digital subscriber line
HIPERLAN high-performance radio local area network
HSCSD High Speed Circuit Switched Data
HSDPA High Speed Data Packet Access
 
ICI intercarrier interference
IDFT inverse DFT
IEEE Institute of Electrical and Electronics Engineers
IFFT inverse FFT
i.i.d. independent and identically distributed
IIR infinite impulse response
IMT International Mobile Telephone
IP Internet protocol
ISI intersymbol interference
ISM Industrial, Scientific, and Medical (spectrum band)
ITU International Telecommunications Union
 
JTACS Japanese TACS
 
LAN local area network
LDPC low-density parity-check
LEO low-earth orbit
LLR log likelihood ratio
LMA local mean attenuation
LMDS local multipoint distribution service
LMS least mean square
LOS line of sight
 
MAC multiple access channel
MAI multiple access interference
MAN metropolitan area network
MAP maximum a posteriori
MC-CDMA multicarrier CDMA
MDC multiple description coding
MEO medium-earth orbit
MFSK M-ary FSK
MGF moment generating function
MIMO multiple-input multiple-output
MISO multiple-input single-output
ML maximum likelihood
MLSE maximum likelihood sequence estimation
MMDS multichannel multipoint distribution service
MMSE minimum mean-square error
MPAM M-ary PAM
MPSK M-ary PSK
MQAM M-ary QAM
MRC maximal-ratio combining
MSE mean-square error
MSK minimum-shift keying
MTSO mobile telephone switching office
MUD multiuser detector
 
N-AMPS narrowband AMPS
NMT Nordic Mobile Telephone
 
OFDM orthogonal frequency-division multiplexing
OFDMA OFDM with multiple access
O-QPSK quadrature PSK with phase offset
OSI open systems interconnect
OSM Office of Spectral Management
 
PACS Personal Access Communications System
PAF partition attenuation factor
PAM pulse amplitude modulation
PAR peak-to-average power ratio
PBX private branch exchange
PCS Personal Communication Systems
PDA personal digital assistant
PDC Personal Digital Cellular
pdf probability density function
PER packet error rate
PHS Personal Handyphone System
PLL phase-locked loop
PN pseudorandom
PRMA packet-reservation multiple access
PSD power spectral density
PSK phase-shift keying
PSTN public switched telephone network
 
QAM quadrature amplitude modulation
QoS quality of service
QPSK quadrature PSK
 
RCPC rate-compatible punctured convolutional
RCS radar cross-section
RLS root least squares
rms root mean square
RS Reed Solomon
RTS request to send (packet)
RTT radio transmission technology
 
SBS symbol-by-symbol
SC selection combining
SCO Synchronous Connection Oriented
SDD soft decision decoding
SDMA space-division multiple access
SE sequence estimator
SFH slow frequency hopping
SHO soft handoff
SICM symbol-interleaved coded modulation
SIMO single-input multiple-output
SINR signal-to-interference-plus-noise power ratio
SIR signal-to-interference power ratio
SISO single-input single-output
SNR signal-to-noise ratio
SOVA soft output Viterbi algorithm
SSC switch-and-stay combining
SSMA spread-spectrum multiple access
STBC space-time block code
STTC space-time trellis code
SVD singular value decomposition
 
TACS Total Access Communication System
TCP transport control protocol
TD time division
TDD time-division duplexing
TDMA time-division multiple access
TIA Telecommunications Industry Association
 
UEP unequal error protection
UMTS Universal Mobile Telecommunications System
U-NII Unlicensed National Information Infrastructure
US uncorrelated scattering
UWB ultrawideband
 
V-BLAST vertical BLAST
VC vector coding
VCC voltage-controlled clock
VCO voltage-controlled oscillator
VQ vector quantizer
 
WAN wide area network
W-CDMA wideband CDMA
WLAN wireless LAN
WPAN wireless personal area networks
WSS wide-sense stationary
 
ZF zero-forcing
ZMCSCQ zero-mean circularly symmetric complex Gaussian
ZMSW zero-mean spatially white
ZRP zone routing protocol



Notation

≈ approximately equal to
≜ defined as equal to (a ≜ b: a is defined as b)
≫ much greater than
≪ much less than
· multiplication operator
∗ convolution operator
⊛ circular convolution operator
⊗ Kronecker product operator
n¡îx, x1/n nth root of x
arg max[f(x)] value of x that maximizes the function f(x)
arg min[f(x)] value of x that minimizes the function f(x)
Co(W) convex hull of region W
δ(x) the delta function
erfc(x) the complementary error function
exp[x] ex
Im{x} imaginary part of x
I0(x) modified Bessel function of the 0th order
J0(x) Bessel function of the 0th order
L(x) Laplace transform of x
ln(x) the natural log of x
logx(y) the log, base x, of y
logxdet[A] the log, base x, of the determinant of matrix A
maxx f(x) maximum value of f(x) maximized over all x
modn(x) x modulo n
N(μ, σ2) Gaussian (normal) distribution with mean μ and variance σ2
P̄r local mean received power
Q(x) Gaussian Q-function
ℝ field of all real numbers
Re{x} real part of x
rect(x) the rectangular function (rect(x) = 1 for |x| ≤ 5, 0 else)
sinc(x) the sinc function (sin(πx)/(πx))
E[·] expectation operator
E[· | ·] conditional expectation operator
X̄ expected (average) value of random variable X
X ~ pX(x) the random variable X has distribution pX(x)
Var[X] variance of random variable X
Cov[X, Y] covariance of random variables X and Y
H(X) entropy of random variable X
H(Y | X) conditional entropy of random variable Y given random variable X
I(X; Y) mutual information between random variables X and Y
MX(s) moment generating function for random variable X
ɸX(s) characteristic function for random variable X
F[·] Fourier transform operator (Fx[·] is transform w.r.t. x)
F-1[·] inverse Fourier transform operator (F-1x[·] is inverse transform w.r.t. x)
DFT{·} discrete Fourier transform operator
IDFT{·} inverse discrete Fourier transform operator
〈·,·〉 inner product operator
x∗ complex conjugate of x
∠x phase of x
|x| absolute value (amplitude) of x
|X| size of alphabet X
⌊x⌋ largest integer less than or equal to x
⌊x⌋S largest number in set S less than or equal to x
{x : C} set containing all x that satisfy condition C
{xi : i = 1, . . . , n}, {xi}ni=1 set containing x1, . . . , xn
(xi : i = 1, . . . , n) the vector x = (x1, . . . , xn)
‖x‖ norm of vector x
‖A‖F Frobenius norm of matrix A
x∗ complex conjugate of vector x
xH Hermitian (conjugate transpose) of vector x
xT transpose of vector x
A-1 inverse of matrix A
AH Hermitian (conjugate transpose) of matrix A
AT transpose of matrix A
det[A] determinant of matrix A
Tr[A] trace of matrix A
vec(A) vector obtained by stacking columns of matrix A
N ╳ M matrix a matrix with N rows and M columns
diag[x1, . . . , xN] the N ╳ N diagonal matrix with diagonal elements x1, . . . , xN
IN the N ╳ N identity matrix (N omitted when size is clear from the context)



© Cambridge University Press