Beruflich Dokumente
Kultur Dokumente
Communication Systems II
Outline:
1. Syllabus
2. Topics covered
• Prerequisite:
− EE 322 Probabilistic Methods for Electrical Engineers, and
− Enrollment in EE423 Lab.
• Grading: (tentative)
Homework + project 30%
Quizzes 20%
Midterm 20%
Final Exam 30%
• Concept of Probability
− Conditional Probability and Independence
− Bernoulli Trials
• Random Variables
− Continuous and Discrete Random Variables
− PDF and CDF
− Some Classical Distributions
• P (A) is defined by
nA
P (A) = lim (1)
n→∞ n
Let R denote the event that the signal is through to the output.
A1
• Q1) what is the probability
P (R)? x(t ) A2 y(t )
• Q2) Given event R, what is the
probability that A1 is working?
A3
This coding method has an efficiency of 1/3, and so not very efficient.
If U = [A1, . . . , An] is a partition of the whole set S (i.e., P(S) =1) and B
is an arbitrary event, then P (B) = P (B|A1)P (A1) + · · · + P (B|An)P (An).
Proof: P (B) = P (BS) = P [B(A1 ∪ A2 ∪ · · · ∪ An)],
Pn
Note that the bottom of the last term, i=1 P (B|Ai )P (Ai ), is equal to
P (B), called total probability theorem.
2. Find the probability that “0” was sent given that ’1’ was detected.
Solution:
Example:
Define an RV X(fi) = 10i of the die experiment, where i is the number of
the die which shows up. Thus X(f1) = 10, X(f2) = 20, . . . , X(f6) = 60.
The set {X ≤ 35} consists of elements f1, f2, f3 only. The set {15 ≤ X ≤
60} consists of f2, · · · , f6.
For example, F (4.5) = P (f1, f2, f3, f4) = 4/6, and F (10) =
P (f1, · · · , f6) = 1.
d F (x) P (x ≤ X ≤ x + ∆x)
f (x) = = lim
dx ∆x→0 ∆x
For a discrete type of RV, the derivative of the CDF is called the PMF
(probability mass function).
P
f (x) = i piδ(x − xi), where pi = P (X = xi), and δ(x) is the impulse
function.
Example: In a fair die experiment let x(fi) = i, where i = 1, . . . , 6,
then f (x) = 1/6[δ(x − 1) + δ(x − 2) + · · · + δ(x − 6)].
δ(x) is the Kronecker Delta function.
1
Z ∞ Z ∞
−x2 /2
Q(y) = g(x)dx = √ e dx
y 2π y