It often happens that the probability of one event is influenced by the outcome another event. As an example, consider drawing two cards in succession from a deck. Let A denote the event that the first card drawn is an ace. We do not replace the card drawn in the first trial. Let B denote the event that the second card drawn is an ace. It is evident that the probability of drawing an ace in the second trial will be influenced by the outcome of the first draw. If the draw does not result in an ace, then the probability of obtaining an ace in the second trial is 4\/51.<\/p>\n
The probability of event B thus depends on whether event A occurs.
\nConditional probability P(B|A) denote the probability of event B when it is known that event A has occurred. P(B|A) is read as \u201cprobability of B given A\u201d![\"Conditional](\"https:\/\/study.madeeasy.in\/wp-content\/uploads\/2024\/08\/conditional-probability.jpg\")
This relation is known as Baye\u2019s rule.
\nIn Baye\u2019s rule, one conditional probability is expressed in terms of the reversed conditional probability.<\/p>\n
The outcome of an experiment may be a real number or it may be non-numerical and describable by a phrase (such as \u201cheads\u201d or \u201ctail\u201d in tossing a coin).
\nFrom a mathematical point of view, it is simpler to have numerical value for all outcomes. For this reason, we assign a real number to each sample point according to some rule.<\/p>\n
The probability of an RV \u201cX\u201d taking a value xi<\/sub> is<\/p>\n Px(xi<\/sub>) = Probability of \u201cX\u201d = xi<\/sub><\/p>\n Thus, a random variable may be almost any function we wish. We shall, however, require that it not be multivalued. That is, every point in sample space \u2018S\u2019 must correspond to only one value of the random variable. Moreover, we shall require that two additional conditions be satisfied in order that a function X be a random variable. First, the set {X \u2264 x} shall be an event for any real number x. The satisfaction of this condition will be no trouble in practical problems. This set corresponds to those points s in the sample space for which the\u00a0 random variable X(s) does not exceed the number x. The probability of this event, denoted by P(X \u2264 x), is equal to the sum of the probabilities of all the elementary events corresponding to {X \u2264 x}.<\/p>\n The second condition we require is that the probabilities of the events {X = \u221e} and {X = \u2013\u221e} be 0.<\/p>\n P{X = \u2013\u221e}=0 This condition does not prevent X from being either \u2013\u221e or \u221e for some values of S; it only requires that the probability of the set of those s be zero.<\/p>\n A discrete random variable is one having only discrete values. The sample space for a discrete random variable can be discrete, continuous, or even a mixture of discrete and continuous points. For example, the \u201cwheel of chance when spun, the possible outcomes are the numbers from 0 to 12 marked on the wheel,\u201d has a continuous sample space, but we could define a discrete random variable as having the value 1 for the set of outcomes {0 < s \u2264 6} and \u20131 for {6 < s \u2264 12}. The result is a discrete random variable defined on a continuous sample space.<\/p>\n A continuous random variable is one having a continuous range of values. It cannot be produced from a discrete sample space because of our requirement that all random variables be single-valued functions of all sample-space points. Similarly, a purely continuous random variable cannot result from a mixed sample space because of the presence of the discrete portion of the sample space.<\/p>\n A mixed random variable is one for which some of its values are discrete and some are continuous. The mixed case is usually the least important type of random variable, but it occurs in some problems of practical significance.<\/p>\n The probability P {X \u2264 x} is the probability of the event{X \u2264 x}. It is a number that depends on x; that is, it is a function of x. We call this function, denoted FX<\/sub>(x), the cumulative probability distribution function of the random variable X. Thus,<\/p>\n FX<\/sub>(x) = P {X \u2264 x}<\/p>\n We shall often call FX<\/sub>(x) just the distribution function of X. The argument x is any real number ranging from \u2013\u221e to \u221e. The distribution function has some specific properties derived from the fact that FX<\/sub>(x) is a probability. A random process is a natural extension of the concept of random variable when dealing with signal. In analyzing communication systems we are basically dealing with time varying signals. In our development so far, we have assumed that all the signals are deterministic. In many situations the deterministic assumption on time varying signals is not a valid assumption, and it is more appropriate to model signals as random rather than deterministic function. One such example is the case of thermal noise in electronic circuits. This type of noise is due to the random movement of electrons as a result of thermal agitation and therefore, the resulting current and voltage can only be described statistically.<\/p>\n Another example is the reflection of radio waves from different layers of the ionosphere that makes long rang broadcasting of short-wave radio possible. Due to randomness of this reflection, the received signal can again be modeled as a random signal. These two examples show that random signals are suitable for description of certain phenomena in signal transmission.<\/p>\n Another situation where modeling by random processes proves useful is in the characterization of information source. An information source, such as a speed source, generates time varying signals whose contents are not known in advance, otherwise there would be no need to transmit them. Therefore, random process provide a natural way to model information sources as well.<\/p>\n The way to think about the relationship between probability theory and stochastic processes is as follows. When we consider the statistical characterization of a stochastic process at a particular instant of time, we are basically dealing with the characterization of a random variable sampled (i.e. observed) at that instant of time. When, however, we consider a single realization of the process, we have a random waveform that evolves across time. The study of stochastic processes, therefore, embodies two approaches: one based on ensemble averaging and the other based on temporal averaging. Both approaches and their characterizations are considered in this chapter.<\/p>\n Stochastic processes have two properties. First, they are functions of time. Second, they are random in the sense that, before conducting an experiment, it is not possible to define the waveforms that will be observed in the future exactly.<\/p>\n Consider, then, a stochastic process specified by<\/strong> X(t, s), \u2013T \u2264 t \u2264 T<\/p>\n Where 2T is the total observation interval. For a fixed sample point sj, the graph of the function X(t, sj) versus time t is called a realization or sample function of the stochastic process. To simplify the notation,<\/p>\n we denote this sample function as<\/p>\n xj<\/sub> (t) = X(t, sj)<\/p>\n A stochastic process X(t) is an ensemble of time function, which together with a probability rule, assigns a probability to any meaningful event associated with an observation of one of the sample functions of the stochastic process.<\/p>\n Mean, Correlation, and Covariance Functions of Weakly Stationary Processes<\/strong><\/p>\n Consider a real-valued stochastic process X(t). We define the mean of the process X(t) as the expectation of the random variable obtained by sampling the process at some time t, as shown by<\/p>\n Properties of the Autocorrelation Function<\/strong><\/p>\n Property 1: Mean-square value<\/strong><\/p>\n The mean-square value of a stationary process X(t) is obtained from autocorrelation function RXX<\/sub>(\u03c4) simply by putting \u03c4 = 0 as shown by<\/p>\n RXX<\/sub>(0) = E[X2<\/sup>(t)] = Mean square value = Total power<\/p>\n Property 2 : Symmetry<\/strong><\/p>\n The auto-correlation function RXX<\/sub>(\u03c4) is an even function of the time shift \u03c4 ; that is,<\/p>\n RXX<\/sub>(\u03c4) = RXX<\/sub>(\u2013 \u03c4)<\/p>\n It is an even function.<\/p>\n Property 3 : Bound on the autocorrelation function<\/strong><\/p>\n The autocorrelation function RXX(\u03c4) attains its maximum magnitude at \u03c4 = 0; that is,<\/p>\n |RXX<\/sub>(\u03c4)| \u2264 RXX<\/sub>(0)<\/p>\n Property 4: normalization<\/strong><\/p>\n Values of the normalized autocorrelation function<\/p>\n \u03c1XX<\/sub>(\u03c4) = RXX<\/sub>(\u03c4)\/RXX<\/sub>(0)<\/p>\n are confined to the range [\u20131, 1].<\/p>\n << Previous<\/a> | Next >><\/a> <\/p>\n","protected":false},"excerpt":{"rendered":" It often happens that the probability of one event is influenced by the outcome another event. As an example, consider<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[758,6],"tags":[769,767,768],"class_list":["post-2802","post","type-post","status-publish","format-standard","hentry","category-communication-systems","category-ec","tag-covariance","tag-distribution-function","tag-stochastic-processes"],"_links":{"self":[{"href":"https:\/\/www.madeeasy.in\/study\/wp-json\/wp\/v2\/posts\/2802","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.madeeasy.in\/study\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.madeeasy.in\/study\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.madeeasy.in\/study\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.madeeasy.in\/study\/wp-json\/wp\/v2\/comments?post=2802"}],"version-history":[{"count":0,"href":"https:\/\/www.madeeasy.in\/study\/wp-json\/wp\/v2\/posts\/2802\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.madeeasy.in\/study\/wp-json\/wp\/v2\/media?parent=2802"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.madeeasy.in\/study\/wp-json\/wp\/v2\/categories?post=2802"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.madeeasy.in\/study\/wp-json\/wp\/v2\/tags?post=2802"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}Conditions for Function to be a Random Variable<\/h3>\n
\nP{X = \u221e}=0<\/p>\nDiscrete and Continuous Random Variables<\/h4>\n
Mixed Random Variable<\/h4>\n
Distribution Function CDF Specifies the Probability of a RV \u2018X \u2019 Taking Values upto \u2018X\u2019<\/h3>\n
\nThese are:![\"](\"https:\/\/study.madeeasy.in\/wp-content\/uploads\/2024\/08\/distribution-function.jpg\")
<\/p>\nStochastic Processes or Random Processes<\/h3>\n
\n(a) Outcomes s observed from some sample space S,
\n(b) Events defined on the sample space S and
\n(c) Probabilities of these events.
\nSuppose that we assign to each sample point s a function of time in accordance with the rule<\/p>\n![\"Stochastic](\"https:\/\/study.madeeasy.in\/wp-content\/uploads\/2024\/08\/stochastic-process.jpg\")
<\/p>\n![\"Covariance\"](\"https:\/\/study.madeeasy.in\/wp-content\/uploads\/2024\/08\/covariance.jpg\")
<\/p>\n
\n Must Read: <\/strong> What is Communication?<\/strong><\/a><\/p>\n