Scribd
Upload
67 views2 pages

Assignment - Probability and Random Variables

This document contains 18 questions regarding probability and random variables for an assignment in digital communication. The questions cover topics such as the binary symmetric channel, PCM channels, error correction codes, probability of receiving bits in error, quantization noise power, probability of error estimation, uniformly distributed random variables, normal distributions, and independence of random variables. The assignment is due on February 28, 2019.

Uploaded by

Khyati
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
67 views2 pages

Assignment - Probability and Random Variables

This document contains 18 questions regarding probability and random variables for an assignment in digital communication. The questions cover topics such as the binary symmetric channel, PCM channels, error correction codes, probability of receiving bits in error, quantization noise power, probability of error estimation, uniformly distributed random variables, normal distributions, and independence of random variables. The assignment is due on February 28, 2019.

Uploaded by

Khyati
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Government Engineering College, Sector-28, Gandhinagar

(Affiliated to Gujarat Technological University)

Electronics & Communication Engineering Department


Subject: Digital Communication

Assignment: Probability and Random Variables

Last date of Submission: 28-2-2019.

Q.1. A binary Symmetric Channel (BSC) has an error probability Pe. A sequence of n bits is
transmitted over this channel. Determine an expression for the probability of receiving exactly k bits
in error. Using this result, find the probability of receiving two bits in error if a sequence of eight bits
is received for this channel when Pe=10-5.

Q.2. A certain PCM channel consists of n identical links in tandem. The pulses are detected at the
end of each link and clean new pulses are transmitted over the net link. If Pe is the probability of
error in detecting a pulse over any one link, show that the probability of error in detecting a pulse
over the entire channel, PE, is given by PE  nPe. Assume, nPe<<1.

Q.3. In a binary communication, a repetition code is used to get single error correction capacity. If Pe
is the error probability of one digit and P () is the probability of wrong detection, determine the
expression of P (). Also, calculate P () if Pe=10-5.

Q.4. A BSC exhibits error probability of Pe. The probability of transmitting 1 is V. Determine the
expressions for the probability of receiving 1 and 0, respectively.

Q.5. Derive an expression for the quantization noise power in PCM assuming L uniform quantization
levels and signal range (-mp, mp) using the concept of uniform RV.

Q.6. For a certain communication system with Pe=10-4 and 2=Pe/Number of experiment, what is the
probability that estimated probability of error p, does not differ from Pe by more than 50% for
400000 experiments?

Q.7. If two statistically independent RVs X & Y are uniformly distributed in the range (-2, 2), what is
the value of the probability P(X+1>Y)?

Q.8. Find the value of


1/ 2
Q.9. For a RV U (0,  ) , fX(x) = 0.5. Determine f ( x | X  0).dx
2
X
1/ 4
Q.10. If X & Y are statistically independent discrete RVs which takes values 1,2, & 3 with equal
probability, find P[X+Y>4|X-Y<0].

Q. 11. For a RV N(2,5), FX(4)=0.68. Find P[X  0].


Q.12. For the electrical network in FIG.1 the probability that a switch is closed is same for every
switch and is ‘p’. Determine the probability that current does not flow in the load.

FIG.1
Q.13. Urn A contains 2 white balls and 3 black balls. Urn B contains 3 white balls and 4 black balls.
Assume your eyes are closed and you pick up a ball. What is the probability that the ball is white?

Q.14. Priya (P1) and Priyesh (P2), after seeing each other for some time (and after a few tiffs!) decide
to get married, much against the wishes of the parents on both the sides. They agreed to meet at
the office of registrar of marriages at 11:30 a.m. on the ensuing Friday (looks like they are not aware
of Rahu Kalam or they don’t care about it!!). However, both are somewhat lacking in punctuality
and their arrival times are equally likely to be anywhere in the interval 11 to 12 hrs on that day. Also
arrival of one person is independent of the other. Unfortunately, both are also very short tempered
and will wait only 10 min. before leaving in a huff never to meet again. Find the probability that the
lovebirds will get married and (hopefully) will live happily ever after.

Q.15. A fair coin is tossed 10 times. Let X is the random variable (RV) showing number of HEADs. Plot
CDF & PDF for this random experiment & determine the probability that exactly four HEADs appear
in those 10 trials.

Q.16. The PDF of a continuous RV ‘X’ is given below:

fx(x) = A e-x 1<x<3


=0 otherwise
Find: A. The value of ‘A’.
B. The probability that the RV takes values between 2 & 3.5
C. What is the probability that X takes on a value greater than 2 given that it has a value
greater than 1.5?

Q.17. Probability distributions of two Discrete RVs X & Y are tabulated below:

Assume P(x1)= P(x2)= P(x3) and P(y1)= P(y2).

Y \ X x1= -1 x2= 0 x3= 1 Total


y1= 0 0 1/3 0 1/3
y2= 1 1/3 0 1/3 2/3
Total 1/3 1/3 1/3 1

Determine: A. Are they statistically Independent?


B. Are they correlated?

Q.18. Find P (| x- E[x] | < 3) for a Gaussian RV with zero mean and unity variance.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy