This way we say that we generate a random variable x

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: f values for X . This way we say that we generate a random variable X . Let FX (x ) be the CDF of X . From the description, we have X = F −1 (U ) and U = F (X ). We have FX (x ) = P (X ≤ x ) = P F −1 (U ) ≤ x = P (U ≤ F (x )) = F (x ) Thus the generated random variable X follows the desired CDF F (x ). M. Chen ([email protected]) ENGG2430C lecture 10 3 / 29 Inequality: Motivation In engineering design problems, often we care about bounding the probability of a “bad” event. In wireless communication: bound the probability of error decoding. In ATV poll problem: bound the probability of our estimation being too off. But computing the exact probability of the events can be complicated. Sometime critical information for their computation is not available. What can we do? Essentially, computing probability exactly needs distribution functions, which can be hard to get. One way out is to compute a bound on the probability using less information, e.g., mean and variance. M. Chen ([email protected]) ENGG2430C lecture 10 4 / 29 Markov Inequality If a random variable X takes only nonnegative values, then P (X ...
View Full Document

This document was uploaded on 03/31/2014.

Ask a homework question - tutors are online