Lecture Notes

Note 010 : Random Processes

Note 010 : Communication Theory: Introduction

Note 011 : Information Theory: Introduction

Note 020 : Discrete Memoryless Channel Capacity

Note 020 : Entropy and Mutual Information

Note 021 : Entropy of Markov Sources

Note 040 : Capacity of Waveform Channels

Note 040 : Jensen Inequality

Note 041 : Gaussian Random Processes

Note 041 : Symmetric Channels

Note 042 : Sampling Random Processes

Note 050 : Detection

Note 050 : Viterbi Algorithm

Note 050 : Viterbi Algorithm Dicode Channel: Example

Note 060 : Metric Spaces, Vector Spaces, Hilbert Spaces

Note 060 : Signal Space

Note 060 : Representation of Digitally Modulated Signals

Note 060 : Representation of Band-Pass Signals

Note 070 : Correlation and the Optimum Detector

Note 070 : Maximum Likelihood (ML) Sequential Detector

Note 070 : Optimal Receivers for the AWGN Channel

Note 071 : Introduction to Error Control Codes

Note 080 : Performance of Optimal Receiver for Memoryless Modulation

Note 080 : Optimal Receivers for Signals with Random Phase

Note 090 : Probability of Error for normal M-ary PSK

Note 090 : Probability of Error for the M-ary Bi-orthogonal Signals

Slide 100 : Codes on Graphs and Iterative Decoding: Part 1

Slide 100 : Codes on Graphs and Iterative Decoding: Part 2

There are no lecture videos currently available for viewing.