Scribd
Upload
59 views

HW 3

This document contains an assignment for Professor Shayman's ENEE324 course in Spring 2021. It includes 8 problems covering topics such as data compression, wireless transmission, error detection, queueing theory, and passenger waiting times for buses. The assignment requires determining probabilities, probability mass functions, means, variances, and solving related equations.

Uploaded by

Catherine Gao
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
59 views

HW 3

This document contains an assignment for Professor Shayman's ENEE324 course in Spring 2021. It includes 8 problems covering topics such as data compression, wireless transmission, error detection, queueing theory, and passenger waiting times for buses. The assignment requires determining probabilities, probability mass functions, means, variances, and solving related equations.

Uploaded by

Catherine Gao
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

ENEE324 (Spring 2021): Professor Shayman

Assignment 3

1. An information source produces symbols at random from a 5-letter alpha-


bet: S = {a, b, c, d, e}. The probabilities of the symbols are p(a) = 1/2,
p(b) = 1/4, p(c) = 1/8, p(d) = p(e) = 1/16. A data compression system
encodes the letters into binary strings as follows: a → 1, b → 01, c → 001,
d → 0001, e → 0000. Let the random variable Y be equal to the length of
the binary string output by the system.
(a) Determine the pmf of Y .
(b) Determine the mean and variance of Y .
(c) If the system is restricted to using outputs 1, 01, 001, 0001, and 0000,
does it make sense to use the encoding mapping described above?
Explain.
2. Consider two wireless transmitters, A and B, that are near each other. In
each time slot, each transmitter sends a message with probability 1/2 and
is otherwise idle. Whether or not B transmits in a time slot is independent
of whether A transmits in the slot. Simultaneous transmissions result in
loss of the messages (called a collision). Let X be the number of time slots
until the first message gets through.
(a) Describe the underlying sample space Ω of this random experiment
and specify the probabilities of its elementary events.
(b) Find the pmf of X.
3. In Problem 2, suppose that A transmits with probability 1/2 in a given
slot, but B transmits with probability p.

(a) Find the pmf for the number of transmissions X until a message gets
through.
(b) Given a successful transmission, find the probability that it was B
that transmitted.
4. Computers use the ASCII code to represent 128 characters (upper and
lower case English letters, digits, and some other characters) by a string
of 7 bits. A parity bit is added to each 7-tuple, creating an octet, to
enable some degree of error detection when data is transferred between
computers. The parity bit is chosen so that the number of 1s in the octet
is even. Thus, if a computer receives an octet that has an odd number of
1s, it knows that an error must have occurred. Suppose that each bit has
a probability p = 0.1 of being received in error (flipped), and assume that
errors in different bits are independent. (This value for p is unrealistically
large.)
(a) Determine the probability that a received octet contains an error.
(b) Determine the probability that a received octet contains an unde-
tectable error.
(c) Given that a received octet contains an error, determine the proba-
bility that the error is detectable.
5. Consider a wireless communication system with discrete time slots. There
are n users, and each user transmits in a given time slot with probability p
independently of the other users. Let N denote the number of users that
transmit in a given time slot.

(a) Determine P (N = 0) (probability of idle slot), P (N > 1) (probability


of collision), and P (N = 1) (probability of successful transmission).
(b) For a given number of users, determine the value of p that maximizes
the probability of a successful transmission.

6. Let X be a binomial random variable that results from the performance


of n Bernoulli trials with probability of success p.
(a) Suppose that X = 1. Find the probability that the single success
occurred in the k th Bernoulli trial.
(b) Suppose that X = 2. Find the probability that the two successes
occurred in the j th and k th Bernoulli trials, where j < k.
(c) In light of your answers to (a) and (b), in what sense are successes
distributed “completely at random” over the n Bernoulli trials?
7. The number of jobs waiting to be processes in a computer system is given
by a Poisson random variable with parameter α = λ/nµ, where λ is the
average number of jobs that arrive in a second, µ is the number of jobs that
can be processed by a single processor in a second, and n is the number
of parallel processors.Let λ = 3 and µ = 1.
(a) Find the number of processors required so that the probability that
more than 4 jobs are waiting is less than 90%.
(b) Given your answer to (a), what is the probability that there are no
jobs waiting?
8. Let X be the number of customer waiting for a bus. Assume that the pmf
of X is given by the version of the geometric distribution that starts at 0,
rather than 1, namely

pX (k) = (1 − p)k p, k≥0

Suppose that the bus has a capacity of M passengers.

2
(a) Find the pmf for Y = g(X) := (X − M )+ , the number of passengers
left behind. In other words,
(
X − M if X − M ≥ 0
Y =
0 if X − M < 0

(b) Determine E[Y ] by using pY (k) obtained in (a). Then verify your
answer by calculating E[Y ] viewing Y as a function of X and using
pX (k).

You might also like