File : pdf, 1.5 MB, 313 pages
by Robert M. Gray (ee.stanford.edu)
TOC
1 Information Sources
1.1 Introduction
1.2 Probability Spaces and Random Variables
1.3 Random Processes and Dynamical Systems
1.4 Distributions
1.5 Standard Alphabets
1.6 Expectation
1.7 Asymptotic Mean Stationarity
1.8 Ergodic Properties
2 Entropy and Information
2.1 Introduction
2.2 Entropy and Entropy Rate
2.3 Basic Properties of Entropy
2.4 Entropy Rate
2.5 Conditional Entropy and Information
2.6 Entropy Rate Revisited
2.7 Relative Entropy Densities
3 The Entropy Ergodic Theorem
3.1 Introduction
3.2 Stationary Ergodic Sources
3.3 Stationary Nonergodic Sources
3.4 AMS Sources
3.5 The Asymptotic Equipartition Property
4 Information Rates I
4.1 Introduction
4.2 Stationary Codes and Approximation
4.3 Information Rate of Finite Alphabet Processes
5 Relative Entropy
5.1 Introduction
5.2 Divergence
5.3 Conditional Relative Entropy
5.4 Limiting Entropy Densities
5.5 Information for General Alphabets
5.6 Some Convergence Results
6 Information Rates II
6.1 Introduction
6.2 Information Rates for General Alphabets
6.3 A Mean Ergodic Theorem for Densities
6.4 Information Rates of Stationary Processes
7 Relative Entropy Rates
7.1 Introduction
7.2 Relative Entropy Densities and Rates
7.3 Markov Dominating Measures
7.4 Stationary Processes
7.5 Mean Ergodic Theorems
8 Ergodic Theorems for Densities
8.1 Introduction
8.2 Stationary Ergodic Sources
8.3 Stationary Nonergodic Sources
8.4 AMS Sources
8.5 Ergodic Theorems for Information Densities
9 Channels and Codes
9.1 Introduction
9.2 Channels
9.3 Stationarity Properties of Channels
9.4 Examples of Channels
9.5 The Rohlin-Kakutani Theorem
10 Distortion
10.1 Introduction
10.2 Distortion and Fidelity Criteria
10.3 Performance
10.4 The rho-bar distortion
10.5 d-bar Continuous Channels
10.6 The Distortion-Rate Function
11 Source Coding Theorems
11.1 Source Coding and Channel Coding
11.2 Block Source Codes for AMS Sources
11.3 Block Coding Stationary Sources
11.4 Block Coding AMS Ergodic Sources
11.5 Subadditive Fidelity Criteria
11.6 Asynchronous Block Codes
11.7 Sliding Block Source Codes
11.8 A geometric Interpretation of operational DRFs
12 Coding for noisy channels
12.1 Noisy Channels
12.2 Feinstein’s Lemma
12.3 Feinstein’s Theorem
12.4 Channel Capacity
12.5 Robust Block Codes
12.6 Block Coding Theorems for Noisy Channels
12.7 Joint Source and Channel Block Codes
12.8 Synchronizing Block Channel Codes
12.9 Sliding Block Source and Channel Coding
Download : link
