INTRODUCTION TO DIGITAL COMMUNICATION Rodger E. Ziemer Department of Eletcal and Computer Engineering University of Colorado at Colorado Springs Roger L. Peterson Motorola Labs Sehaumbarg, lnois Prentice Hall Upper Sadile River, New Jersey 07458 httpilwow prenhall.com“Library of Congress Cataloging -Pubiaton Data lem, Roger, Tnoduction to dial communiaonRodgerE. Zim, Roger L Peso — Pe pen Ics bibliographical reference an nde, ISBN 0.13 8900615, |. igialcommunicaioas. 1 Tite: Digital conncato,H Peteson Roger Tie ‘TKSI03:7255 2000 enka coarssi6 cw Vice rset and edt dretr: Moria Horton Pabisher Tom Robbins Associate et Alice Dorin Titra asst Jerea Power “Market manager: Danny Hye Production eta Pine Tre Composition Executive managing er: Vine OBrien Managing elo: David A. George ‘Ar decir: Jayne Cone (Cover design Brace Renelar Ate Adam Vetus Manufcting manape: Trudy Pct Manus yer: Dawn Marin ‘Assan vice president of producti and manucing: David W, Ricard {©2001 1992 by Prenic- Halo, ‘Uper Sate River, New esey Alig served, No pat of his ook maybe ‘reproduce, nay foo by any meas hou eosin in wing rom the publishr, “Te thor and publisher ofthis bok have wed ther et tos n preparing his book These ffs inchs the devclopment research, and eng of thoes to determine hel eflecvenest. Printed ithe United Stes of America wes7e sas ISBN 0-33-a9b482-5 Prec Hal Itai (UK) Limit, Landon rene lof Attala Py Lite, Sey Prete al Coad le, Toronto Prentice-Hall Hispnounercana S.A. Mesko Prete Hall of nda Piva Lito, New Deki Premie Hal fap, ne, Toko raion Edveaton Asia Re. Ld, Shgopore tora Pence Hal do Bas Las, Rode Jani Proface Contents 1 Introduction to Digital Data Transmission a4 12 13 15 16 47 Introduction Components of a Digital Communication System 1.2.1 General Considerations 1.2.2 Subsystems in a Typical Communication System 1.2.3 Capacity of a Communications Link ‘Communications Channel Modeling 1.3.4 Introduction 1.3.2 _ Specific Examples of Communication Channels: 1.3.2.1 Propagation Channels 13.22 Land Line 13.23 Compact Disc (CD) Channels 1.3.3 Approaches to Communication Channel Modeling 13.3.4 Discrete Channel Approach 13.3.2 Waveform Description of Communication Channels 11.3.4 Interference and Distortion in Communication Channels 4.3.5 External Channel Propagation Considerations. Communication Link Power Calculations 1.4.1 Decibels in Communication System Performance Calculations 4.4.2. Caloulation of Power Levels in Communication ‘Systems; Link Budgets Driving Forces in Communications ‘Computer Use in Communication System Analysis and Design Preview of the Book References Problems vil Bown » a 14 13 14 15 162 Signals, Systems, Modulation, and Noise: Overview 2.4 Review of Signal and Linear System Theory 2.4.4 Introduction 24.2 Classification of Signals 2.1.3 Fundamental Properties of Systems 2.1.4 Complex Exponentials as Eigenfunctions {or a Fixed, Linear System; Frequency Response Function Orthogonal Function Series Complex Exponential Fourier Series The Fourier Transform Signal Spectra Energy Relationships 2.4.10 System Analysis 2.2 Basic Analog Modulation Techniques 2.2.1 Double-Sideband Modulation 2.2.2 The Hilbert Transform; Single Sideband Modulation 2.2.3 Angle Modulation 2.3. Complex Envelope Representation of Bandpass Signals, and Systems 2.3.1 Bandpass Signals 2.3.2 Bandpass Systems 2.4 Signal Distortion and Filtering 2.4.4 Distortonless Transmission and Ideal Filters 2.4.2 Group and Phase Delay 24,3 Nonlinear Systems and Nonlinear Distortion 2.8 Practical Filter Types and Characteristics 2.5.1 General Terminology 2.8.2 Butterworth Filters (Maximally Fat) 2.5.3 Chebyshev Fiters (Equal Ripple) 2.5.4 Bessel (Maximally Flat Delay) Fiters 2.6 Sampling Theory 2.6.1 The Lowpass Sampling Theorem 2.6.2 Nonideal Effects in Sampling 2.6.3 Sampling of Bendpass Signals 2.6.4 Oversampling and Downsampling to Ease Filter Requirements 2.6.5 Pulse Code Modulation Differential Pulse Code Modulation 2.7 Random Processes 2.7.4 Mathematical Description of Random Processes 2.7.2 Input Output Relationships for Fixed Linear Systems with Random Inputs; Power Spectral Density Contents Contents 2.7.2.4 Partial Descriptions 2.7.2.2 Output Statistics of Linear Systems 2.7.2.8 The Central and Noncentral Chi Square Distributions 2.7.3 Examples of Random Processes 2.7.4 Narrowband Noise Representation 2.7.5 Distributions of Envelopes of Narrowband Gaussian Processes 2.8 Computer Generation of Random Variables 2.8.1 Introduction 2.8.2 Generation of Random Variables Having 2 Specific Distribution 2.8.3 Spectrum of a Simulated White Noise Process 2.8.4 Generation of Pseudo Noise Sequences 2.9 Summary References Problems Basie Digital Communication Systems 8.4. Introduction 3.2 The Binary Digital Communications Problem 3.2.4 Binary Signal Detection in AWGN 3.2.2 The Matched Filter 3.2.3 Application of the Matched Fitter to Binary Data Detection 3.4. General Formula for Pe ‘2 Antipodal Baseband Signaling ‘3 Baseband Orthogonal Signaling 3.2.3.4 Baseband On-Off Signaling 3.2.4 Cortelator Realization of Matched Filter Recelvers 3.3. Signaling Through Bandlimited Channels 3.3.1 System Model 3.3.2 Designing for Zero ISI: Nyquist’s Pulse-Shaping Criterion ‘Optimum Transmit and Receive Filters, ‘Shaped Transmit Signal Spectra Duobinary Signaling tion in Digital Data Transmission Introduction Zero-Forcing Equalizers ‘Minimum Mear-Square Error Equalization Adaptive Weight Adjustment Other Equalizer Structures Equalizer Performance 105, 108 112 112 114 a7 119 119 120 125 129 133 134 141 141 141 145, 148, 148, 150 150 151 154 155 155 187 160 164 166 168 168 169 173 ut 182 183Contents 3.8 A Digital Communication System Simulation Example 184 3.6 Noise Effects in Pulse Code Modulation 190 3.7 Summary 194 References 195 Problems 196 ‘Signal-Space Methods in Digital Data Transmission 199 4A. Introduction 199 4.2. Optimum Receiver Principals in Terms of Vector Spaces 202 4.2. Maximum a Posteriori Detectors 202 42.2 Vector Representation of Signals 205, ‘4.2.2.4 KDimensional Signal Space Representation of the Received Waveform 206 42.2.2 Scalar Product 206 42.2.3 GramSchmidt Procedure 207 42.2.4 Schware's Inequality 209 42.2.5 _Parseval's Theorem 210 4.2.3. MAP Detectors in Terms of Signal Spaces 212 4.2.4 Performance Calculations for MAP Receivers 215 4.3. Performance Analysis of Coherent Digital Signaling Schemes 219 43.4. Coherent Binary Systems 219 4.3.2 Coherent Mary Orthogonal Signal Schemes 220 4.3.3. Mary Phase Shift Keying 224 4.3.4 Quadrature-Amplitude Modulation 227 4.4 Signaling Schemes Not Requiring Coherent References at the Receiver 232 44.1. Noncoherent Frequency Shift Keying (NFSK) 232 4.4.2 Differential Phase Shift Keying (DPSK) 235 ) 4.8. Comparison of Digital Modulation Systems ar 4.8.4 Bit Error Probabilities from Symbol Error Probabilities 243 4.5.2. Bandwidth Efficiencies of Mary Digital ‘Communication Systems 244 4.6 Comparison of Mary Digital Modulation Schemes (on Power and Bandwidth-Equivalent Bases 245 4.8.1 Coherent Digital Modulation Schemes 245 4.6.2 _Noncoherent Digital Modulation Schemes. 247 4.7 Some Commonly Used Modulation Schemes 248, 4.7.4 Quadrature Multiplexed Signaling Schemes. 249 4.7.1.4 Quadrature Multiplexing 249, 4.71.2 Quadrature and Offset Quadrature Phase-Shift Keying 251, 4.7.4.3 Minimum Shift Keying. 254 Contents 48 49 44 4.7.1.4 Perfomance of Digital Quadrature Modulation Systems 4.7.2. Gaussian MSK 4.13 1/4Differential QPSK 4.7.4 Power Spectra for Quadrature Modulation Schemes. Design Examples and System Tradeotts ‘Multih Continuous Phase Modulation 4.9.4 Description of the Mult-h CPM Signal Format 4.9.2 Calculation of Power Spectra for Multi CPM Signals 49.3 Synchronization Considerations for Mult: CPM Signals, Orthogonal Frequency Division Multiplexing 4.40.1 Introduction 4.10.2 The Idea behind OFDM 4.40.3 Mathematical Description of DFTAmplemented ‘OFDM 4.40.4 Effect of Fading on OFDM Detection 410.5 Parameter Choices and Implementation Issues in OFDM 4.40.5.4 OFDM Symbol Rate for Combating Delay Spread 4.40.5.2 Realizing Diversity in OFOM 40.5.3 Implementation Issues 4.40.6 Simulation of OFDM Waveforms, Summary References Problems Channel Degradations in Digital Communteations Ba 52 83 Introduction ‘Synchronization in Communication Systems 5.24 Carrier Synchronization 5.2.2 Symbol Symchronization 5.2.3 Frame Synchronization The Effects of Slow Signal Fading in Communication Systems 5.3.1 Performance of Binary Modulation Schemes In Rayleigh Fading Channels 5.3.1.4 Introduction 8.31.2 Bit Error Probability Performance In Slow Rayleigh Fading 5.3.4.3 The Use of Path Diversity to Improve Performance in Fading 5.3.1.4 DPSK Performance in Moderately Fast Rayleigh Fading 254 258 258 261, 271 271 276 282 284 284 286 286 291 203, 293, 295 295 296 299 301, 307 307 307 317 319 321 324 321 322 324 329wi 5a 55 5.3.2 Performance of Mary Modulation Schemes in Slow Fading 5.3.2.1 Introduction B.32.2 Mary PSK and DPSK Performance in Siow Rayleigh Fading 5.3.2.3 Mary PSK and DPSK Performance in Siow Ricean Fading 5.3.2.4 Mary QAM Performance in Siow Rayleigh Fading 5.3.2.5 Mary Noncoherent FSK Performance in Siow Ricean Fading 5.3.3 Mary PSK and DPSK Performance in Slow Fading with Diversity 5.3.3.4 Rayleigh Fading 5.3.3.2 Ricean Fading Diagnostic Tools for Communication System Design 5.4.1 Introduction 5.4.2 Eye Diagrams 5.4.3 Envelope Functions for Digital Modulation Methods 8.4.4 Phasor Plots for Digital Modulation Systems Summary References Problems. 6 Fundamentals of Information Theory and Block Coding 64 62 Introduction Basic Concepts of information Theory 6.2.1 Source Coding 6.2.2 LempelZiv Procedures 6.2.3 Channel Coding and Capacity 62.3.1 General Considerations 6.2.3.2 Shannon's Capacity Formula Capacity of Discrete Memoryless Channels .3:4 Computational Cutoff Rate Fundamentals of Block Coding 6.3.1 Basic Concepts 6.3.3.4 Definition of a Block Code 6.3.3.2 Hamming Distance and Hamming Weight 6.3.3.3 Error Vectors 6.3.3.4 Optimum Decoding Rule 6.3.3.5 Decoding Regions and Error Probability 6.3.3.6 Coding Gain 6.3.3.7 Summary 6.3.2 Linear Codes 6.3.21 Modulo2 Vector Arithmetic Contents 332 332 Contents ay 6.3.2.2 Binary Linear Vector Spaces 83.2.3 Linear Block Codes 6.3.24 Sjstematic Linear Block Codes 6.3.2.5. Distance Properties of Linear Block Codes 83.26 Decoding Using the Standard Array 6.3.2.7 Error Provabilties for Linear Codes D833 Owl Codes 263.34 Deiiition of Cycle Codes 63.3.2 Polmomial Arithmetic 62.3.3 Properties of Cyclo Codes 63.34 Encoding of Cyclic Codes 83.35 Decoding of Cele Codes 6.3.4” Hamming Codes {63.4.1 Definition of Hamming Codes 6.342 Encoding of Homming Codes 6343 Decoding of Hamming Codes 6.3.4.4 _ Performance of Hamming Cods 6.3.5 BCH Codes 6.3.5.4 Defntion and Encoding for BCH Codes 635.2 Decoding af BCH Codes 5, 83.6.3 Performance of BCH Codes ( 76.3.6 Reed-Solomon Codes 6.3.64 Definition of Reed-Solomon Codes 63.6.2 Decoding the Reed-Solomon Codes 8.3.6.3 Performance of te Reed-Solomon Codes 6.3.7 _ The Golay Code 6.3.7.4 Defntion of the Golay Code 6.3.7.2 Decoding the Golay Code 8.3.7.3 Performance ofthe Golay Code 6.4 Cocing Performance in Slow Fading Channels 65 Summary References Problems Fundamentals of Convolutional Coding 74. introduction 7.2. Basic Concepts 7.2.1" Defition of Convolutional Codes 7.2.2 Decoding Convolutional Codes 7.2.3 Potential Coding Gains for Soft Decisions 7.2.4 Distance Properties of Convolutional Codes: 7.3 The Viterbi gorithm 7.3.1 Hard Decision Decoding 7.3.2 Soft Decision Decoding 7.3.3 Decoding Error Probability 441 444 446 a7 447 448, 449, 450 452, 462 463,Contents Contents " 7.34 BitEror Probability 508 QPSK Direct Sequence Spread Spectrum sr 7.4 Good Convolutional Codes and Their Performance 507 Nonconetent SlowFrequency-Hop Spread Spectrum 583, 14 Good coms 510 NonconerentFastFrequeney-Hop Spread 7.84. Sequertiol Decoding Sit Spectrum 506 7152. Theshold Decoding sit Hybrid Direct Sequence /Frequency-Hop TES Concatenated Reed-Solomon/Conolutional Coding 542 . Spread Spectrum 586 718.4 Punctured Convoltionel Codes S14 > 94 Complex Envelope Representation of Spread'Spectrum 7.8.5 Trelis Coded Moduation 516 systems 580 756 Turbo Codes 522 8.5. Generation and Properties of Pseudorandom Sequences 594 TE7 Appications 526 9.84 Definitions and Mathematical Background 594 287 As 526 9.5.2 _mSequence Generator Configurations 596 References 530 9.5.3 Properties of mSequences Ser Probleme 532 9.5.4 Power Spectrum of mSequences 599 9.8.5 Tables of Polynomials Velding mSequences 601 ‘8 Fundamentals of Repeat Request Systems 536 9.5.6 Security of mSequences 608 536 9.5.7 Gold Codes 605 8.4 Introduction 536 8.8.8 Kasami Sequences (Small Set) 607 8.2 General Considerations 337 9.5.9 Quatemary FourPhase) Sequences 608 8.3 Three ARQ Stateges 3s 9.8.10 Walsh Codes bt 8.3.4 StopandiWal 8 2.8 _Synetronization of Spread Spectrum Systems ett 4.3. General Descrintion S32 Througnpt Calculation 539 8.7 Poromance of Sead Spectrum Sats 8.3.2. GoBack ARQ 54a in Jamming Environments ot 8.3.2.4 General Description 54a 71 Introduction oi 832.2 Throughput Calevation 546 9.7.2 Types of Janmers bie 8.3.3 Selective Repeat ARQ 548 9.7.3 Combating Smart Jammers oie 8.3.3.4 General Description 543 "7.4 Error Probabilities for Barrage Noise Jammers 618 8333 fhroughout Calelation 550 8:75 sor roabities fr Optmzed Para and for Error Detection of Pulsed Jammers * Sia Goncral Considerations 551 9.8. Performance in Multiple User Environments 624 8.4.2. Hamming Codes 355 9.9 Multiuser Detection @4 84.3 BCH Codes 586 9.40 Examples of Spread Spectrum Systems 633 8.4.4 Golay Codes 558 9.40.1. Space Shuttle Spectrum Despreader 633 8.5 Summary 387 9.40.2 Global Positioning System 638 Referees 8 942 Suny on Problems ferences 642 sca Probiems ota 2c-Spectrum Systems a vet 362 10 Introduction to Cellular Radio Communications 650 9.2. Two Communication Problems 563 20.4 Introduction 650 9.2.4 PulseNNoise Jamming 568 20.2 Frequency Reuse 651 9.2.2 Low Probably of Detection 566 40.3 Channel Models oes 9.3. Types of Spreat-Spectrum Systems 568 40.3.4. Path Loss and Shadow Fading Models 650 9.3.4. BPSK DireckSequence Spread Spectrum 569 8.4 Free Space Path Loss 66010.8.1.2 Flat Earth Path Loss 10.3.1.3 Okumura/Hata Path Attenuation Model 10.3.1.4 LogNormal Shadow Fading y 20.3.2. Multipath Channel Models 10.6 10.9 10.3.2.1 Rayleigh Fading (Unresolvable Multipath) Models. 20.3.2.2 Ricean (Unresolvable) Fading 10.3.2.3 Summary 40:3.2.4 Resolvable Multipath Components 40.3.2.5 A Mathematical Model for the WSSUS Channel Mitigation Techniques for the Muitipath Fading Channel 10.4.1. Introduction 10.4.3 Frequency Diversity 14 Time Diversity 10.4.5 Multipath Diversity and RAKE Rec ‘System Design and Performance Prediction 20.5.1 Introduction 40.5.2 Performance Figures of Merit, 20.5.3 Frequency Reuse 40.5.4 Cells Are Never Hexagons 10.5.8 Interference Averaging ‘Advanced Mobile Phone Service 10.6.4. Introduction 10.6.2 Call Setup and Control 10.6.3 Modulation and Signaling Formats Global System for Mobile Communications 10.7.4. Introduction 10.7.2 System Overview 10.7.3 Modulation and Signaling Formats 10.7.4 Summary and Additional Comments Code Division Multiple Access 10.8.1 Introduction 40.8.2 Forward Link Description 40.8.3 Reverse Link Description 20.8.4 Capacity of CDMA 40.8.5 Additional Comments Recommended Further Reading 10.9.4 Cellular Concepts and Systems. 10.9.2 Channel Modeling and Propagation 10.9.3 Concluding Remarks References Problems, Contents 661 667 669 687 eon 692, 603 698 608, 701 7o1 702 703 706 707 708 713 713 715 715 a7 m8 720 720 722 724 730 731 731 735 743, 747 752 753 754, 754 756 756 753 Contents 14. Satellite Communications - 444 Introduction 44.4.4 A Brief History of Satellite Communications 41.4.2 Basic Concepts and Terminology 44.4.3 Orbital Relationships 41.1.4 Antenna Coverage 11.2 Allocation of a Satelite Transmission Resource 14.24 FOMA 1122 TOMA 4123 CDMA 41.3 Link Power Budget Analysis 11.3.1 BentPipe Relay 11.3.2 Demod/Remod (Regenerative) Digital Transponder 14.3.3 Adjacent Channel Interference 11.3.4 Adjacent Satelite Interference 11.3.5 Power Division in Limiting Repeaters 411.4 Examples of Link Power Budget Caleulations 11.8 Low- and MediunEarth Orbit Voice Messaging Satelite Systems 11.6 Summay References Problems A Probability and Random Variables Aa as aa AS Probability Theory AA.4 Definitions AL2 Axioms A-L.3 Joint, Marginal, and Conditional Probabilities, Random Variables, Probability Density Functions, ‘and Averages A241 Random Variables A2.2 Probability Distribution and Density Functions A2.3 Averages of Random Variables Characteristic Function and Probability Generating Function ABA Characteristic Function ‘3.2 Probability Generating Function Transformations of Random Variables AAA General Results ‘A4.2__ Linear Transformations of Gaussian Random Variables Central Limit Theorem References Problems all 764 764 764 766 768 770 7 772 774 m7 TT 719 Te 784 785 788 790 801, 803 803 807 807 807 808 809 sit Bit B11 a4 815 815 818 820 820 825 826 826 826