Principles of Communications Networks and Systems

Professor Nevio Benvenuto, University of Padova, Italy Professor Benvenuto was employed by Bell Laboratories to work on signal analysis problems and held faculty positions at the universities of Ancona and L'Aquila before being appointed as a Professor in the Electrical Engineering Department at the University of Padova. He is an Editor for Modulation/Detection of the IEEE Communications Society and is the author of Algorithms for Communications Systems and their Applications.Professor Michele Zorzi, University of Padova, Italy Professor Zorzi joined the faculty at the Information Engineering Department at the University of Padova in 2003. He has been a member of faculty at the Politecnico di Milano and the University of Ferrara in Italy, and he spent three years with the Center for Wireless Communications at UCSD. Zorzi was the Editor-In-Chief of the IEEE Wireless Communications Magazine in 2003—2005, is currently the Editor-In-Chief of the IEEE Transactions on Communications, and serves on the Editorial Boards for a variety of respected journals. He is a Fellow of the IEEE.

“I think the book is very well designed as a textbook for students and as a handbook for engineers.”  (Zentralblatt MATH, 1 December 2012)

• Preface xiii List of Acronyms xviiList of Symbols xxi1 Introduction to Telecommunication Services, Networks and Signaling 11.1 Telecommunication Services 11.1.1 Definition 11.1.2 Taxonomies According to Different Criteria 21.1.3 Taxonomies of Information Sources 41.2 Telecommunication Networks 51.2.1 Introduction 51.2.2 Access Network and Core Network 91.3 Circuit-Switched and Packet-Switched Communication Modes 111.4 Introduction to the ISO/OSI Model 131.4.1 The Layered Model 131.4.2 The ISO/OSI Model 161.5 Signaling 181.5.1 Introduction 191.5.2 Channel-Associated and Common-Channel Signaling 191.5.3 SS7 201.5.4 PDH Networks 221.5.5 SDH Networks 24References 252 Deterministic and Random Signals 272.1 Time and Frequency Domain Representation 272.1.1 Continuous Time Signals 272.1.2 Frequency Domain Representation for Periodic Signals 342.1.3 Discrete Time Signals 362.2 Energy and Power 392.2.1 Energy and Energy Spectral Density 392.2.2 Instantaneous and Average Power 422.3 Systems and Transformations 462.3.1 Properties of a System 462.3.2 Filters 472.3.3 Sampling 502.3.4 Interpolation 512.4 Bandwidth 542.4.1 Classification of Signals and Systems 562.4.2 Uncertainty Principle 582.4.3 Practical Definitions of Band 582.4.4 Heaviside Conditions 602.4.5 Sampling Theorem 612.4.6 Nyquist Criterion 642.5 The Space of Signals 662.5.1 Linear Space 662.5.2 Signals as Elements in a Linear Space 702.5.3 Gram–Schmidt Orthonormalization in Signal Spaces 712.5.4 Vector Representation of Signals 762.5.5 Orthogonal Projections onto a Signal Space 792.6 Random Variables and Vectors 812.6.1 Statistical Description of Random Variables 822.6.2 Expectation and Statistical Power 842.6.3 Random Vectors 882.6.4 Second Order Description of Random Vectors and Gaussian Vectors 942.6.5 Complex-Valued Random Variables 972.7 Random Processes 992.7.1 Definition and Properties 992.7.2 Point and Poisson Processes 1012.7.3 Stationary and Ergodic Random Processes 1082.7.4 Second Order Description of a WSS Process 1102.7.5 Joint Second-Order Description of Two Random Processes 1152.7.6 Second-Order Description of a Cyclostationary Process 1172.8 Systems with Random Inputs and Outputs 1182.8.1 Filtering of a WSS Random Process 1192.8.2 Filtering of a Cyclostationary Random Process 1222.8.3 Sampling and Interpolation of Stationary Random Processes 123Appendix: The Complementary Normalized Gaussian Distribution Function 126Problems 130References 1363 Sources of Digital Information 1373.1 Digital Representation of Waveforms 1373.1.1 Analog-to-Digital Converter (ADC) 1383.1.2 Digital-to-Analog Converter (DAC) 1403.1.3 Quantizer 1423.1.4 Uniform Quantizers 1433.1.5 Quantization Error 1453.1.6 Quantizer SNR 1483.1.7 Nonuniform Quantizers 1503.1.8 Companding Techniques and SNR 1523.2 Examples of Application 1583.3 Information and Entropy 1623.3.1 A Measure for Information 1623.3.2 Entropy 1643.3.3 Efficiency and Redundancy 1713.3.4 Information Rate of a Message 1723.4 Source Coding 1733.4.1 The Purpose of Source Coding 1733.4.2 Entropy Coding 1743.4.3 Shannon Theorem on Source Coding 1773.4.4 Optimal Source Coding 1803.4.5 Arithmetic Coding 183Problems 188References 1964 Characterization of Transmission Media and Devices 1974.1 Two-Terminal Devices 1984.1.1 Electrical Representation of a Signal Source 1984.1.2 Electrical Power 1984.1.3 Measurement of Electrical Power 2004.1.4 Load Matching and Available Power 2014.1.5 Thermal Noise 2034.1.6 Other Sources of Noise 2054.1.7 Noise Temperature 2054.2 Two-Port Networks 2064.2.1 Reference Model 2064.2.2 Network Power Gain and Matched Network 2074.2.3 Power Gain in Terms of Electrical Parameters 2084.2.4 Noise Temperature 2094.2.5 Noise Figure 2114.2.6 Cascade of Two-Port Networks 2134.3 Transmission System Model 2164.3.1 Electrical Model 2164.3.2 AWGN Model 2174.3.3 Signal-to-noise Ratio 2174.3.4 Narrowband Channel Model and Link Budget 2204.4 Transmission Media 2234.4.1 Transmission Lines and Cables 2234.4.2 Power-Line Communications 2294.4.3 Optical Fiber 2344.4.4 Radio Links 2374.4.5 Underwater Acoustic Propagation 242Problems 250References 2565 Digital Modulation Systems 2595.1 Introduction 2595.2 Digital Modulation Theory for an AWGN Channel 2605.2.1 Transmission of a Single Pulse 2605.2.2 Optimum Detection 2625.2.3 Statistical Characterization of Random Vectors 2635.2.4 Optimum Decision Regions 2655.2.5 Maximum A Posteriori Criterion 2695.2.6 Maximum Likelihood Criterion 2705.2.7 Minimum Distance Criterion 2705.2.8 Implementation of Minimum Distance Receivers 2735.2.9 The Theorem of Irrelevance 2765.3 Binary Modulation 2775.3.1 Error Probability 2775.3.2 Antipodal and Orthogonal Signals 2825.3.3 Single Filter Receivers 2855.4 M-ary Modulation 2885.4.1 Bounds on the Error Probability 2885.4.2 Orthogonal and Biorthogonal Modulations 2925.5 The Digital Modulation System 2965.5.1 System Overview 2965.5.2 Front-end Receiver Implementation 3015.5.3 The Binary Channel 3025.5.4 The Inner Numerical Channel 3035.5.5 Realistic Receiver Structure 3065.6 Examples of Digital Modulations 3075.6.1 Pulse Amplitude Modulation (PAM) 3075.6.2 Quadrature Amplitude Modulation (QAM) 3135.6.3 Phase Shift Keying (PSK) 3235.6.4 Frequency Shift Keying (FSK) 3295.6.5 Code Division Modulation 3335.7 Comparison of Digital Modulation Systems 3365.7.1 Reference Bandwidth and Link Budget 3365.7.2 Comparison in Terms of Performance, Bandwidth and Spectral Efficiency 3385.8 Advanced Digital Modulation Techniques 3395.8.1 Orthogonal Frequency Division Multiplexing 3395.8.2 Spread Spectrum Techniques 3425.9 Digital Transmission of Analog Signals 3445.9.1 Transmission through a Binary Channel 3455.9.2 Evaluation of the Overall SNR 3465.9.3 Digital versus Analog Transmission 3485.9.4 Digital Transmission over Long Distances: Analog versus Regenerative Repeaters 352Problems 355References 3706 Channel Coding and Capacity 3736.1 Principles of Channel Coding 3736.1.1 The Purpose of Channel Coding 3736.1.2 Binary Block Codes 3756.1.3 Decoding Criteria. Minimum Distance Decoding 3766.2 Linear Block Codes 3836.2.1 Construction of Linear Codes 3836.2.2 Decoding of Linear Codes 3866.2.3 Cyclic Codes 3906.2.4 Specific Classes of Linear Block Codes 3926.2.5 Performance of Linear Codes 3956.3 Convolutional Codes 3976.3.1 Construction and Properties 3976.3.2 Decoding of Convolutional Codes and the Viterbi Algorithm 4016.4 Channel Capacity 4056.4.1 Capacity of a Numerical Channel 4056.4.2 Capacity of the AWGN Channel 4116.5 Codes that Approach Capacity 4206.5.1 Soft Decoding 4206.5.2 Concatenated Codes 4226.5.3 Low Density Parity Check Codes 423Problems 424References 4297 Markov Chains Theory 4317.1 Introduction 4327.2 Discrete-Time Markov Chains 4327.2.1 Definition of Discrete-Time MC 4327.2.2 Transition Probabilities of Discrete-Time MC 4357.2.3 Sojourn Times of Discrete-Time MC 4377.2.4 Chapman–Kolmogorov Equations for Discrete-Time MC 4397.2.5 Transition Diagram of Discrete-Time MC 4407.2.6 State Probability of Discrete-Time MC 4417.2.7 Classification of Discrete-Time Markov Chains 4447.2.8 Asymptotic Behavior of Discrete-Time MC 4557.3 Continuous-Time Markov Chains 4677.3.1 Definition of Continuous-Time MC 4687.3.2 Transition Probabilities of Continuous-Time MC 4687.3.3 Sojourn Times of Continuous-Time MC 4697.3.4 Chapman–Kolmogorov Equations for Continuous-Time MC 4747.3.5 The Infinitesimal Generator Matrix Q 4747.3.6 Forward and Backward Equations for Continuous-Time MC 4767.3.7 Embedded Markov Chain 4787.3.8 Flow Diagram of Continuous-Time MC 4827.3.9 State Probability of Continuous-Time MC 4827.3.10 Classification of Continuous-Time MC 4877.3.11 Asymptotic Behavior of Continuous-Time MC 4887.4 Birth-Death Processes 4927.4.1 Definition of BDP 4927.4.2 Time-Dependent Behavior of BDP 4947.4.3 Asymptotic Behavior of BDP 500Problems 507References 5168 Queueing Theory 5178.1 Objective of Queueing Theory 5188.2 Specifications of a Queueing System 5188.2.1 The Arrival Process 5218.2.2 The Service Process 5238.2.3 The Queueing Structure 5248.2.4 The Service Discipline 5258.2.5 Kendall Notation 5268.3 Performance Characterization of a QS 5278.3.1 Occupancy Measures 5288.3.2 Time Measures 5298.3.3 Traffic Measures 5318.4 Little’s Law 5348.5 Markovian Queueing Models 5378.5.1 The M/M/1 Queueing System 5428.5.2 The M/M/m Queueing System 5548.5.3 The M/M/1/K Queueing System 5658.5.4 The M/M/m/m Queueing System 5738.5.5 The M/M/m/K Queueing System 5778.6 The M/G/1 Queueing System 5818.7 The M/D/1 Queueing System 589Problems 590References 5969 Data Link Layer 5979.1 Introduction 5989.2 Medium Access Control 5999.2.1 Deterministic Access: TDMA and FDMA 6049.2.2 Time-Division Multiple Access 6049.2.3 Frequency-Division Multiple Access 6069.2.4 Comparison between TDMA and FDMA 6079.2.5 Demand-Based Access: Polling and Token Ring 6099.2.6 Random Access Protocols: ALOHA and Slotted ALOHA 6249.2.7 Carrier Sense Multiple Access 6339.2.8 Performance Comparison of Channel Access Schemes 6599.3 Automatic Retransmission Request 6629.3.1 Stop-and-Wait ARQ 6669.3.2 Go Back N ARQ 6689.3.3 Selective Repeat ARQ 6719.3.4 Performance Comparison of ARQ Schemes 6759.3.5 Optimal PDU Size for ARQ 6779.4 Examples of LAN Standards 6799.4.1 Ethernet 6799.4.2 Wireless Local Area Networks 6829.4.3 IEEE 802.11 6849.4.4 Bluetooth 691Problems 697References 70310 Network Layers 70710.1 Introduction 70810.1.1 Switching and Connecting 70810.1.2 Networks and Network Topology 71010.2 Routing 71410.2.1 Routing Objectives 71510.2.2 Routing Algorithms 72210.2.3 Technical Aspects of Routing Implementation 73210.2.4 Routing Strategies 73810.2.5 Routing Protocols 74410.3 The Internet and IP 74710.3.1 The Internet Protocol 74810.3.2 IP Addressing System 75010.3.3 Control Protocols 75610.4 The Transport Layer 75910.4.1 User Datagram Protocol 76210.4.2 Transmission Control Protocol 76310.5 The Application Layer 76910.5.1 Domain Name Server 76910.5.2 Email Exchange and the World Wide Web 772References 774Index 777