Fundamentals of Probability and Statistics for Engineers

by adding a second stage to the communication channel, with Figure 2.8
showing all the associated probabilities. We wish to de te rmine P(C), the prob-
ability of receiving a 1 at the second stage.
Tree diagrams are useful for determining the behavior of this system when the
system has a ‘one-stage’ memory; that is, when the outcome at the second stage is
dependent only on what has happened at the first stage and not on outcomes at
stages prior to the first. Mathematically, it follows from this property that

The properties describ ed above are commonly referred to as Markovian
properties. Markov processes represent an important class of probabilistic
process that are studied at a more advanced level.
Suppose that Equations (2.30) hold for the system described in Figure 2.8.
The tree diagram gives the flow of conditional probabilities originating from
the source. Starting from the transmitter, the tree diagram for this problem has
the appearance shown in Figure 2.9. The top branch, for example, leads to the
probability of the occurrence of eve nt ABC, which is, according to Equations
(2.26) and (2.30),

The probability of C is then found by su mming the probabilities of all events
that end with C. Thus,

0.4

0.6

0.95

0.9 0.9

0.95

0.^10.^1

0.05 (^0).
(^05)
AB
B
C
A C
Figure 2.8 A two-stage binary channel
Basic Probability Concepts 27
P…CjBA†ˆP…CjB†; P…CjBA†ˆP…CjB†; etc: … 2 : 30 †
P…ABC†ˆP…A†P…BjA†P…CjBA†
ˆP…A†P…BjA†P…CjB†
ˆ 0 : 4 … 0 : 95 †… 0 : 95 †ˆ 0 : 361 :

P…C†ˆP…ABC†‡P…ABC†‡P…ABC†‡P…ABC†

ˆ 0 : 95 … 0 : 95 †… 0 : 4 †‡ 0 : 1 … 0 : 05 †… 0 : 4 †‡ 0 : 95 … 0 : 1 †… 0 : 6 †‡ 0 : 1 … 0 : 9 †… 0 : 6 †

ˆ 0 : 472 :