/*! This file is auto-generated */ .wp-block-button__link{color:#fff;background-color:#32373c;border-radius:9999px;box-shadow:none;text-decoration:none;padding:calc(.667em + 2px) calc(1.333em + 2px);font-size:1.125em}.wp-block-file__button{background:#32373c;color:#fff;text-decoration:none} Q122E Consider a communication source... [FREE SOLUTION] | 91影视

91影视

Consider a communication source that transmits packets containing digitized speech. After each transmission, the receiver sends a message indicating whether the transmission was successful or unsuccessful. If a transmission is unsuccessful, the packet is re-sent. Suppose a voice packet can be transmitted a maximum of \({\rm{10}}\) times. Assuming that the results of successive transmissions are independent of one another and that the probability of any particular transmission being successful is \({\rm{p}}\), determine the probability mass function of the rv \({\rm{X = }}\)the number of times a packet is transmitted. Then obtain an expression for the expected number of times a packet is transmitted.

Short Answer

Expert verified

The probability mass function is\({\rm{p(k) = P(X = k) = }}\left\{ {\begin{array}{*{20}{c}}{{{{\rm{(1 - p)}}}^{{\rm{k - 1}}}}{\rm{p}}}&{{\rm{k = 1,2,3,4,5,6,7,8,9}}}\\{{\rm{1 - }}\sum\limits_{{\rm{k = 0}}}^{\rm{9}} {{{{\rm{(1 - p)}}}^{{\rm{k - 1}}}}} {\rm{p}}}&{{\rm{k = 10}}}\end{array}} \right.\).

The expected number of times a packet is transmitted is \({\rm{\mu = 10 - 9}}\sum\limits_{{\rm{k = 1}}}^{\rm{9}} {\rm{k}} {{\rm{(1 - p)}}^{{\rm{k - 1}}}}{\rm{p}}\).

Step by step solution

01

Concept Introduction

Probability refers to the likelihood of a random event's outcome. This word refers to determining the likelihood of a given occurrence occurring.

The complement rule is a statistical theorem that establishes a link between the probability of an occurrence and the probability of its complement, such that if one of these probabilities is known, automatically the other is also known.

02

Probability Mass Function

It is given that\({\rm{P(}}\)successful\({\rm{) = p}}\).

A packet can be transmitted at most\({\rm{10}}\)times 鈥揬({\rm{k}} \le {\rm{10}}\).

The transmissions are independent.

Probability Mass Function 鈥

\({\rm{X = }}\)the number of times a packet is transmitted, thus\({\rm{X}}\)is the number of trials until the first success\({\rm{Y}}\)(successful transmission) occurs up to\({\rm{10}}\)packets.

The number of trials until the first success follows a geometric distribution with probability of success\(p\).

\({\rm{Y}} \sim {\rm{Geometric(p)}}\)

Definition geometric probability 鈥

\({\rm{P(Y = k) = }}{{\rm{q}}^{{\rm{k - 1}}}}{\rm{p = (1 - p}}{{\rm{)}}^{{\rm{k - 1}}}}{\rm{p}}\)

The definition of geometric probability is for all nonnegative integers, however for \({\rm{X}}\) it is given \({\rm{k}} \le {\rm{10}}\). Use the definition for \({\rm{k = 1, 2, 3, 4, 5, 6, 7, 8, 9}}\).

03

The Complement Rule

The complement rule is represented as 鈥

\({\rm{P(not A) = 1 - P(A)}}\)

Addition rule for disjoint or mutually exclusive events 鈥

\({\rm{P(A or B) = P(A) + P(B)}}\)

Use the complement rule and the addition rule 鈥

\(\begin{array}{c}{\rm{P(X = 10) = P(Y}} \ge {\rm{10) = 1 - P(Y}} \le {\rm{9) = 1 - P(Y = 1) - P(Y = 2) - \ldots - P(Y = 9)}}\\{\rm{ = 1 - }}\sum\limits_{{\rm{k = 0}}}^{\rm{9}} {\rm{P}} {\rm{(Y = k) = 1 - }}\sum\limits_{{\rm{k = 0}}}^{\rm{9}} {{{{\rm{(1 - p)}}}^{{\rm{k - 1}}}}} {\rm{p}}\end{array}\)

Combining these results to obtain the probability distribution 鈥

\(\begin{array}{l}{\rm{p(k) = P(X = k)}}\\{\rm{ = }}\left\{ {\begin{array}{*{20}{c}}{{{{\rm{(1 - p)}}}^{{\rm{k - 1}}}}{\rm{p}}}&{{\rm{k = 1,2,3,4,5,6,7,8,9}}}\\{{\rm{1 - }}\sum\limits_{{\rm{k = 0}}}^{\rm{9}} {{{{\rm{(1 - p)}}}^{{\rm{k - 1}}}}} {\rm{p}}}&{{\rm{k = 10}}}\end{array}} \right.\end{array}\)

04

The Expected Value

The expected value (or mean) is the sum of the product of each possibility \({\rm{x}}\) with its probability \({\rm{P(x)}}\)鈥

\(\begin{aligned}\mu &= \sum\limits_{{\rm{10}}} {\rm{x}} {\rm{P(x)}}\\&= \sum\limits_{{\rm{k = 1}}}^{\rm{9}} {\rm{k}} {\rm{P(X = k)}}\\&= \sum\limits_{{\rm{k = 1}}}^{\rm{9}} {\rm{k}} {{\rm{(1 - p)}}^{{\rm{k - 1}}}}{\rm{p + 10}}\left( {{\rm{1 - }}\sum\limits_{{\rm{k = 0}}}^{\rm{9}} {{{{\rm{(1 - p)}}}^{{\rm{k - 1}}}}} {\rm{p}}} \right)\\&= \sum\limits_{{\rm{k = 1}}}^{\rm{9}} {\rm{k}} {{\rm{(1 - p)}}^{{\rm{k - 1}}}}{\rm{p + 10 - 10}}\sum\limits_{{\rm{k = 0}}}^{\rm{9}} {{{{\rm{(1 - p)}}}^{{\rm{k - 1}}}}} {\rm{p Distributive Property}}\\&= 10 + (1 - 10)\sum\limits_{{\rm{k = 1}}}^{\rm{9}} {\rm{k}} {{\rm{(1 - p)}}^{{\rm{k - 1}}}}{\rm{p Combine like terms}}\\&= 10 - 9\sum\limits_{{\rm{k = 1}}}^{\rm{9}} {\rm{k}} {{\rm{(1 - p)}}^{{\rm{k - 1}}}}{\rm{p}}\end{aligned}\)

Therefore, the expression is obtained as \({\rm{10 - 9}}\sum\limits_{{\rm{k = 1}}}^{\rm{9}} {\rm{k}} {{\rm{(1 - p)}}^{{\rm{k - 1}}}}{\rm{p}}\).

Unlock Step-by-Step Solutions & Ace Your Exams!

  • Full Textbook Solutions

    Get detailed explanations and key concepts

  • Unlimited Al creation

    Al flashcards, explanations, exams and more...

  • Ads-free access

    To over 500 millions flashcards

  • Money-back guarantee

    We refund you if you fail your exam.

Over 30 million students worldwide already upgrade their learning with 91影视!

One App. One Place for Learning.

All the tools & learning materials you need for study success - in one app.

Get started for free

Most popular questions from this chapter

Two fair six-sided dice are tossed independently. Let M = the maximum of the two tosses (so M(1,5) =5, M(3,3) = 3, etc.).

a. What is the pmf of M? (Hint: First determine p(1), then p(2), and so on.)

b. Determine the cdf of M and graph it.

Automobiles arrive at a vehicle equipment inspection station according to a Poisson process with rate \(\alpha = 10\)per hour. Suppose that with probability \(.{\bf{5}}\) an arriving vehicle will have no equipment violations. a. What is the probability that exactly ten arrive during the hour and all ten have no violations? b. For any fixed \(y \ge 10\), what is the probability that y arrives during the hour, of which ten have no violations? c. What is the probability that ten 鈥渘o-violation鈥 cars arrive during the next hour?

An educational consulting firm is trying to decide whether high school students who have never before used a hand-held calculator can solve a certain type of problem more easily with a calculator that uses reverse Polish logic or one that does not use this logic. A sample of \({\rm{25}}\) students is selected and allowed to practice on both calculators. Then each student is asked to work one problem on the reverse Polish calculator and a similar problem on the other. Let \({\rm{p = P(S)}}\), where \({\rm{S}}\) indicates that a student worked the problem more quickly using reverse Polish logic than without, and let \({\rm{X = }}\)number of \({{\rm{S}}^{\rm{'}}}{\rm{s}}\).

a. If \({\rm{p = }}{\rm{.5}}\), what is \({\rm{P(7}} \le {\rm{X}} \le {\rm{18)}}\)?

b. If \({\rm{p = }}{\rm{.8}}\), what is \({\rm{P(7}} \le {\rm{X}} \le {\rm{18)}}\)?

c. If the claim that \({\rm{p = }}{\rm{.5}}\) is to be rejected when either \({\rm{x}} \le {\rm{7}}\) or \({\rm{x}} \ge {\rm{18}}\), what is the probability of rejecting the claim when it is actually correct?

d. If the decision to reject the claim \({\rm{p = }}{\rm{.5}}\) is made as in part (c), what is the probability that the claim is not rejected when \({\rm{p = }}{\rm{.6}}\)? When \({\rm{p = }}{\rm{.8}}\)?

e. What decision rule would you choose for rejecting the claim \({\rm{p = }}{\rm{.5}}\) if you wanted the probability in part (c) to be at most \({\rm{.01}}\)?

In proof testing of circuit boards, the probability that any particular diode will fail is\(.{\bf{01}}\). Suppose a circuit board contains\({\bf{200}}\)diodes. a. How many diodes would you expect to fail, and what is the standard deviation of the number that is expected to fail? b. What is the (approximate) probability that at least four diodes will fail on a randomly selected board? c. If five boards are shipped to a particular customer, how likely is it that at least four of them will work properly? (Aboard works properly only if all its diodes work.)

Forty percent of seeds from maize (modern-day corn) ears carry single spikelets, and the other \({\rm{60\% }}\) carry paired spikelets. A seed with single spikelets will produce an ear with single spikelets \({\rm{29\% }}\) of the time, whereas a seed with paired spikelets will produce an ear with single spikelets \({\rm{26\% }}\) of the time. Consider randomly selecting ten seeds.

a. What is the probability that exactly five of these seeds carry a single spikelet and produce an ear with a single spikelet?

b. What is the probability that exactly five of the ears produced by these seeds have single spikelets? What is the probability that at most five years have single spikelets?

See all solutions

Recommended explanations on Math Textbooks

View all explanations

What do you think about this solution?

We value your feedback to improve our textbook solutions.

Study anywhere. Anytime. Across all devices.