zz - ECE 6010 Lecture 1 Introduction Review of Random...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
ECE 6010 Lecture 1 – Introduction; Review of Random Variables : Chapter 1. Section 2.1, Section 2.3, Section 2.4, Section 3.1, Section 3.2, Section 3.5, Section 4.1, Section 4.2, Section 4.4, Section 4.5 Why study probability? 1. Communication systems. Noise. Information. 2. Control systems. Noise in observations. Noise in interference. 3. Computer systems. Random loads. Networks. Random packet arrival times. Probability can become a powerful engineering tool. One way of viewing it is as “quantified common sense.” Great success will come to those whose tool is sharp! Set theory Probability is intrinsically tied to set theory. We will review some set theory concepts. We will use c to denote complementation of a set with respect to its universe. – union: A B is the set of elements that are in A or B . – intersection: A B is the set of elements that are in A and B . We will also denote this as AB . a A : a is an element of the set A . A B : A is a subset of B . A B : A B and B A . Note that A A c  (where  is the universe). Notation for some special sets: R – set of all real numbers Z – set of all integers Z – set of all positive integers N – set of all natural numbers, 0,1,2,…, R n – set of all n tuples of real numbers C – set of complex numbers Definition 1 A field (or algebra) of sets is a collection of sets that is closed under comple- mentation and finite union. 2 That is, if F is a field and A F , then A c must also be in F (closed under complemen- tation). If A and B are in F (which we will write as A , B F ) then A B F . Note: the properties of a field imply that F is also closed under finite intersection. (DeMorgan’s law: AB ( A c B c ) c ) Definition 2 A σ -field (or σ -algebra) of sets is a field that is also closed under countable unions (and intersections). 2 What do we mean by countable? • A set with a finite number in it is countable. • A set whose elements can be matched one-for-one with Z is countable (even if it has an infinite number of elements!) Are there non-countable sets? Note: For any collection F of sets, there is a σ -field containing F , denoted by σ ( F ) . This is called the σ -field generated by F .
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
ECE6010:Lecture1–Introduction;ReviewofRandomVariables 2 Definition of probability We now formally define what we mean by a probability space. A probability space has three components. The first is the sample space , which is the collection of all possible outcomes of some experiment. The outcome space is frequently denoted by  . Example 1 Suppose the experiment involves throwing a die.  1 , 2 , 3 , 4 , 5 , 6 2 We deal with subsets of  . For example, we might have an event which is “all even throws of the die” or “all outcomes 4”. We denote the collection of subsets of interest as F . The elements of F (that is, the subsets of  ) are called events . F is called the event class . We will restrict F to be a σ -field . Example2
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 03/01/2012 for the course ECE 6010 taught by Professor Stites,m during the Spring '08 term at Utah State University.

Page1 / 10

zz - ECE 6010 Lecture 1 Introduction Review of Random...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online