ECE 302 Probabilistic Methods in Electrical Engineering

Spring 2007

Course Information

  • Instructor:  Sarah Koskie

  • Email:  skoskie@iupui.edu

  • Lectures:   MW 10:30–11:45 am in SL 055

  • Office Hours: 11:45 am–1:30 pm, or by appointment, in SL 164F

  • Textbook:   Probability and Stochastic Processes: A Friendly Introduction for Electrical and Computer Engineers, 2nd ed. by Roy D. Yates and David J. Goodman, Wiley, 2005.   

  • Grading:  
    • 15% Homework
    • 50% Midterm Exams (25% each)
    • 35% Final Exam (noncumulative)

  • Spring 2007 Course Information Sheet    (Updated January 8, 2007)

  • Homework Assignments    (Updated April 24, 2007)

  • Homework Solutions    (Updated May 02, 2007)

  • Exam Solutions    (Updated March 5, 2015)

  • Practice Exams    (Updated April 15, 2007)

  • Practice Problems for Final    (Updated May 2, 2007)

  • Some Useful Links:

  • Course Outcomes: Upon completion of the course, students should be able to:

    • Solve simple probability problems with electrical and computer engineering applications using the basic axioms of probability.    (Chapters 1 – 3)
    • Describe the fundamental properties of probability density functions with applications to single and multivariate random variables.    (Chapter 1 – 5)
    • Describe the functional characteristics of probability density functions frequently encountered in electrical and computer engineering such as the Binomial, Uniform, Gaussian and Poisson.    (Chapter 1 – 5)
    • Determine the first through fourth moments of any probability density function using the moment generating function.    (Chapter 6)
    • Calculate confidence intervals and levels of statistical significance using fundamental measures of expectation and variance for a given numerical data set.    (Chapters 7, 8)
    • Discern between random variables and random processes for given mathematical functions and numerical data sets.    (Chapter 10)
    • Determine the power spectral density of a random process for given mathematical functions and numerical data sets.    (Chapter 11)
    • Determine whether a random process is ergodic or nonergodic and demonstrate an ability to quantify the level of correlation between sets of random processes for given mathematical functions and numerical data sets.    (Chapter 10)
    • Model complex families of signals by means of random processes.    (Chapter 10)
    • Determine the random process model for the output of a linear system when the system and input random process models are known.    (Chapter 11)

Page last modified 03/05/15.