/*! 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] | 魅影直播

魅影直播

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 魅影直播!

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

A reservation service employs five information operators who receive requests for information independently of one another, each according to a Poisson process with rate a \({\rm{\alpha = 2}}\) per minute.

a. What is the probability that during a given \({\rm{1 - min}}\) period, the first operator receives no requests?

b. What is the probability that during a given \({\rm{1 - min}}\) period, exactly four of the five operators receive no requests?

c. Write an expression for the probability that during a given \({\rm{1 - min}}\) period, all of the operators receive exactly the same number of requests.

A second-stage smog alert has been called in a certain area of Los Angeles County in which there are \({\rm{50}}\) industrial firms. An inspector will visit \({\rm{10}}\) randomly selected firms to check for violations of regulations. a. If \({\rm{15}}\) of the firms are actually violating at least one regulation, what is the pmf of the number of firms visited by the inspector that are in violation of at least one regulation? b. If there are \({\rm{500}}\) firms in the area, of which \({\rm{150}}\) are in violation, approximate the pmf of part (a) by a simpler pmf. c. For X = the number among the 10 visited that are in violation, compute E(X) and V(X) both for the exact pmf and the approximating pmf in part (b).

Consider writing onto a computer disk and then sending it through a certifier that counts the number of missing pulses. Suppose this number X has a Poisson distribution with parameter\({\rm{\mu = }}{\rm{.2}}\). (Suggested in 鈥淎verage Sample Number for Semi-Curtailed Sampling Using the Poisson Distribution,鈥 J. Quality Technology,\({\rm{1983 = 126 - 129}}\).) a. What is the probability that a disk has exactly one missing pulse? b. What is the probability that a disk has at least two missing pulses? c. If twodisks are independently selected, what is the probability that neither contains a missing pulse?

Compute the following binomial probabilities directly from the formula for \(b(x;n,p)\):

a. \(b(3;8,.35)\)

b. \(b(5;8,.6)\)

c. \(P(3 \le X \le 5)\) when \(n = 7\) and \(p = .6\)

d. \(P(1 \le X)\) when \(n = 9\) and \(p = .1\)

Starting at a fixed time, each car entering an intersectionis observed to see whether it turns left (L), right (R), orgoes straight ahead (A). The experiment terminates assoon as a car is observed to turn left. Let X = the numberof cars observed. What are possible X values? List five outcomes and their associated X values.

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.