01.05.2017 Views

563489578934

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

B–7 Examples of Important Distributions 695<br />

Thus, there are two ways to evaluate the variance: (1) by use of the definition as given<br />

by Eq. (B–27) and (2) by use of the theorem that is Eq. (B–29).<br />

B–7 EXAMPLES OF IMPORTANT DISTRIBUTIONS<br />

There are numerous types of distributions. Some of the more important ones used in communication<br />

and statistical problems are summarized in Table B–1. Here, the equations for their PDF<br />

and CDF, a sketch of the PDF, and the formula for the mean and variance are given. These<br />

distributions will be studied in more detail in the paragraphs that follow.<br />

Binomial Distribution<br />

The binomial distribution is useful for describing digital, as well as other statistical problems.<br />

Its application is best illustrated by an example.<br />

Assume that we have a binary word n bits long and that the probability of sending a<br />

binary 1 is p. Consequently, the probability of sending a binary 0 is 1 - p. We want to evaluate<br />

the probability of obtaining n-bit words that contain k binary 1s. One such word is k binary<br />

1s followed by n - k binary 0s. The probability of obtaining this word is p k (1 - p) n-k . There<br />

are also other n-bit words that contain k binary 1s. In fact, the number of different n-bit words<br />

containing k binary 1s is<br />

a n (B–32)<br />

k b = n!<br />

(n - k)!k!<br />

(This can be demonstrated by taking a numerical example, such as n = 8 and k = 3.) The<br />

symbol Ak n B is used in algebra to denote the operation described by Eq. (B–32) and is read “the<br />

combination of n things taken k at a time.” Thus, the probability of obtaining an n-bit word<br />

containing k binary 1s is<br />

P(k) = a n k bpk (1 - p) n-k<br />

(B–33)<br />

If we let the random variable x denote these discrete values, then x = k, where k can take on<br />

the values 0, 1, 2,..., n, and we obtain the binomial PDF<br />

n<br />

f(x) = a P(k)d(x - k)<br />

k = 0<br />

(B–34)<br />

where P(k) is given by Eq. (B–33).<br />

The name binomial comes from the fact that the P(k) are the individual terms in a<br />

binomial expansion. That is, letting q = 1 - p, we get<br />

(p + q) n n<br />

= a a n k b pk q n-k n<br />

= a P(k)<br />

k = 0<br />

k = 0<br />

(B–35)

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!