ECE 4110/5110 - Random Signals in Communications and Signal Processing
Undergrad & grad course, Cornell University, School of Electrical and Computer Engineering, 2024
General Information
- Instructor: Qing Zhao, 325 Rhodes Hall. Email: qz16@cornell.edu
- Lecture: MW 1:25pm - 2:40pm, Hollister Hall 320
- Discussion: F 10:10pm - 11:00pm, Hollister Hall 206
- Office Hour: W: 4:30-6:00 via Zoom
- Credits: 4
Prerequisites
ECE 3100 Probability and ECE 3250 Signals and Systems (or equivalent courses).
References and Reading Materials
- Class notes posted on Canvas.
- Probability, Statistics, and Random Processes for Electrical Engineering, Third Edition, by A. Alberto Leon-Garcia, Prentice Hall, 2008.
- Introduction to Probability, Second Edition, by Dmitri P. Bertsekas and John N. Tsitsiklis, Athena Scientific, 2008.
- Introduction to Probability for Computing, by Mor Harchol-Balter, Cambridge University Press, 2024, available online https://www.cs.cmu.edu/ harchol/Probability/book.html.
Course Description
Introduction to models for random signals in discrete and continuous time; Poisson processes, Gaussian processes, Markov chains, renewal processes, queuing theory, power spectral densities, response of linear systems to random signals.
- Review of probability
- Probabilistic models
- Conditional probability, total probability theorem and Bayes rule, independence and conditional independence
- Discrete and continuous random variables, PMF, PDF, and CDF
- Expectation and moments of a random variable
- Jointly distributed random variables: conditional distribution, conditional mean, correlation and covariance
- Bayesian statistical inference: MAP and MMSE
- Random vectors, jointly Gaussian random variables
- Basic concepts of random processes
- Definition and description of a random process
- Important properties of a random process: 1. Stationarity and wide-sense stationarity 2. Independent increments
- Examples of widely used random processes: 1. Discrete-time processes: i.i.d. sequence, sum process, random walk, and Binomial counting process 2. Continuous-time processes: Poisson process, Gaussian process, Wiener process and Brownian motion
- Markov chains, renewal processes, and queueing theory
- Discrete-time Markov chains: transition matrix, Chapman-Kolmogorov equations, stationary distribution, classification of states, recurrence and transience, ergodicity and limit theorem
- Continuous-time Markov processes: transition rate matrix, stationary distribution, global balance equations
- Renewal processes
- Queueing systems, M/M/1 queue, Little’s formula
- Analysis and processing of random signals
- Correlation functions and power spectral densities
- Response of linear systems to random signals
- Wiener filtering