| ## Probability, Statistics, and Random Processes For Electrical Engineering (3rd Edition) |

List Price: | $253.80 |

Price: | $239.57 Details |

**Availability: **Usually ships in 24 hours

Ships from and sold by Amazon.com

42 new or used available from $129.46

Average customer review:(53 customer reviews)

## Book Description

This is the standard textbook for courses on probability and statistics, not substantially updated. While helping students to develop their problem-solving skills, the author motivates students with practical applications from various areas of ECE that demonstrate the relevance of probability theory to engineering practice. Included are chapter overviews, summaries, checklists of important terms, annotated references, and a wide selection of fully worked-out real-world examples. In this edition, the Computer Methods sections have been updated and substantially enhanced and new problems have been added.

### Book Details

- Amazon Sales Rank: #588229 in Books
- Published on: 2008-01-07
- Original language: English
- Number of items: 1
- Dimensions: 8.90" h x 1.80" w x 7.00" l, 3.00 pounds
- Binding: Paperback
- 832 pages

## Editorial Reviews

From the Inside Flap

Probability and Random Processes for Electrical Engineering presents a carefully motivated, accessible, and interesting introduction to probability and random processes. It is designed to allow the instructor maximum flexibility in the selection of topics. In addition to the standard topics taught in introductory courses on probability, random variables, and random processes, the book includes sections on modeling, basic statistical techniques, computer simulation, reliability, and entropy, as well as concise but relatively complete introductions to Markov chains and queueing theory. The complexity of the systems encountered in electrical and computer engineering calls for an understanding of probability concepts and a facility in the use of probability tools from an increasing number of B.S. degree graduates. The introductory Course should therefore teach the student not only the basic theoretical concepts but also how to solve problems that arise in engineering practice. This course requires that the student develop problem-solving skills and understand how to make the transition from a real problem to a probability model for that problem. Relevance to Engineering Practice Motivating students is a major challenge in introductory probability courses. Instructors need to respond by showing students the relevance of probability theory to engineering practice. Chapter 1 addresses this challenge by discussing the role of probability models in engineering design. Practical applications from various areas of electrical and computer engineering are used to show how averages and relative frequencies provide the proper tools for handling the design of systems that involve randomness. These application areas are used in examples and problems throughout the text. From Problems to Probability Models The transition from real problems to probability models is shown in several ways. First, important concepts are usually developed by presenting real data or computer-simulated data. Second, sections on basic statistical techniques are integrated throughout the text. These sections demonstrate how statistical methods provide the link between theory and the real world. Finally, the significant random variables and random processes are developed using model-building arguments that range from simple to complex. For example, in Chapter 2 and 3, text discussion proceeds from coin tossing to Bernoulli trials. It then continues to the binomial and geometric distributions, and finally proceeds via limiting arguments to the Poisson, exponential, and Gaussian distributions. Examples and Problems Numerous examples in every section are used to demonstrate analytical and problem-solving techniques, develop concepts using simplified cases, and illustrate applications. The text includes over 700 problems, identified by section to help the instructor select homework problems. Additional sets of problems requiring cumulative knowledge are provided at the end of each chapter. Answers to selected problems are included at the end of the text. A Student Solutions Manual accompanies this text to develop problem-solving skills. A sampling of 25% of carefully worked out problems has been selected to help students understand concepts presented in the text. An Instructors Solutions Manual with complete solutions is also available. Computer Methods The development of an intuition for randomness can be aided by the use of computer exercises. Appendix C contains computer programs for generating several well-known random variables. The resulting data from computer-generated random numbers and variables can be analyzed using the statistical methods introduced in the text. Sections on computer methods have been integrated into the text rather than isolated in a separate chapter because performing the computer exercises during lessons helps students to learn basic probability concepts. It should be noted that the computer methods introduced in Sections 2.7, 3.11, and 4.10 do not necessarily require entirely new lectures. The transformation method in Section 3.11 can be incorporated into the discussion on functions of a random variable. Similarly, the material in Section 4.10 can be incorporated into the discussion on transformations of random vectors. Random Variables and Continuous-Time Random Processes Discrete-time random processes provide a crucial "bridge" in going from random variables to continuous-time random processes. Care is taken in the first five chapters to lay the proper groundwork for this transition. Thus sequences of dependent experiments are discussed in Chapter 2 as a preview of Markov chains. In Chapter 4, emphasis is placed on how a joint distribution generates a consistent family of marginal distributions. Chapter 5 introduces sequences of independent identically distributed (iid) random variables. Chapter 6 considers the sum of an iid sequence to produce important examples of random processes. Throughout Chapters 6 and 7, a concise development of the concepts is achieved by developing discrete-time and continuous-time results in parallel. Markov Chains and Queueing Theory Markov chains and queueing theory have become essential tools in communication network and computer system modeling. In the introductory course on probability only a few changes need to be made to accommodate these new requirements. The treatment of conditional probability and conditional expectation needs to be modified, and the Poisson and gamma random variables need to be given greater prominence. In an introductory course on random processes a new balance needs to be struck between the traditional discussion of wide-sense stationary processes and linear systems and the discussion of Markov chains and queueing theory. The "optimum" balance between these two needs will surely vary from instructor to instructor, so the text includes more material than can be covered in one semester in order to give the instructor leeway to strike a balance. Suggested Syllabi The first five chapters form the basis of a one-semester introduction to probability. In addition to the optional sections on computer methods, these chapters also include optional sections on combinatorics, reliability, confidence intervals, and basic results from renewal theory. In a one-semester course, it is possible to provide an introduction to random processes by omitting all the starred sections in the first five chapters and covering instead the first part of Chapter 6. The material in the first five chapters has been used at the University of Toronto in an introductory junior-level required course for electrical engineers. A one-semester course on random processes with Markov chains can be taught using Chapters 6 though 8. A quick introduction to Markov chains and queueing theory is possible by covering only the first three sections of Chapter 8 and then proceeding to the first few sections in Chapter 9. A one-semester introduction to queueing theory can be taught from Chapters 6, 8, and 9. Changes in the Second Edition The only changes in the second edition that affect the first half of the book, and hence introductory courses on probability, involve the addition of more examples and problems. In keeping with our goal of giving the instructor flexibility in the selection of topics, we have expanded the optional section on reliability (Section 3.10) and introduced a new optional section on entropy (Section 3.12). Care has been taken not just to define the various quantities associated with entropy but also to develop an understanding of the interpretation of entropy as a measure of uncertainty and information. The most significant change to the second edition is the addition of material to make the text more suitable for a course that provides a more substantial introduction to random processes:In Chapter 4, a section on the joint characteristic function has been added and the discussion of jointly Gaussian random variables has been expanded. Section 5.5 discusses the various types of convergence of sequences of random variables. A carefully selected set of examples is presented to demonstrate the differences in the various types of convergence. Section 6.6 uses these results to develop the notions of mean square continuity, derivatives, and integrals of random processes. This section presents the relations between the Wiener process and white Gaussian noise. It also develops the Ornstein-Uhlenbeck process as the transient solution to a first-order linear system driven by noise. Section 6.8 uses Fourier series to introduce the notion of representing a random process by a linear combination of deterministic functions weighted by random variables. It then proceeds to develop the Karhunen-Loeve expansion for vector random variables and then random processes. Section 7.4 now contains a separate section on prediction and the Levinson algorithm. Finally, Section 7.5 presents a discussion of the Kalman filter to complement the Wiener filter introduced in Section 7.4. Acknowledgments I would

From the Back Cover

This is the standard textbook for courses on probability and statistics, not substantially updated. While helping students to develop their problem-solving skills, the author motivates students with practical applications from various areas of ECE that demonstrate the relevance of probability theory to engineering practice. Included are chapter overviews, summaries, checklists of important terms, annotated references, and a wide selection of fully worked-out real-world examples. In this edition, the Computer Methods sections have been updated and substantially enhanced and new problems have been added.

Excerpt. © Reprinted by permission. All rights reserved.

Probability and Random Processes for Electrical Engineering presents a carefully motivated, accessible, and interesting introduction to probability and random processes. It is designed to allow the instructor maximum flexibility in the selection of topics. In addition to the standard topics taught in introductory courses on probability, random variables, and random processes, the book includes sections on modeling, basic statistical techniques, computer simulation, reliability, and entropy, as well as concise but relatively complete introductions to Markov chains and queueing theory. The complexity of the systems encountered in electrical and computer engineering calls for an understanding of probability concepts and a facility in the use of probability tools from an increasing number of B.S. degree graduates. The introductory Course should therefore teach the student not only the basic theoretical concepts but also how to solve problems that arise in engineering practice. This course requires that the student develop problem-solving skills and understand how to make the transition from a real problem to a probability model for that problem.

### Relevance to Engineering Practice

Motivating students is a major challenge in introductory probability courses. Instructors need to respond by showing students the relevance of probability theory to engineering practice. Chapter 1 addresses this challenge by discussing the role of probability models in engineering design. Practical applications from various areas of electrical and computer engineering are used to show how averages and relative frequencies provide the proper tools for handling the design of systems that involve randomness. These application areas are used in examples and problems throughout the text.

### From Problems to Probability Models

The transition from real problems to probability models is shown in several ways. First, important concepts are usually developed by presenting real data or computer-simulated data. Second, sections on basic statistical techniques are integrated throughout the text. These sections demonstrate how statistical methods provide the link between theory and the real world. Finally, the significant random variables and random processes are developed using model-building arguments that range from simple to complex. For example, in Chapter 2 and 3, text discussion proceeds from coin tossing to Bernoulli trials. It then continues to the binomial and geometric distributions, and finally proceeds via limiting arguments to the Poisson, exponential, and Gaussian distributions.

### Examples and Problems

Numerous examples in every section are used to demonstrate analytical and problem-solving techniques, develop concepts using simplified cases, and illustrate applications. The text includes over 700 problems, identified by section to help the instructor select homework problems. Additional sets of problems requiring cumulative knowledge are provided at the end of each chapter. Answers to selected problems are included at the end of the text. A Student Solutions Manual accompanies this text to develop problem-solving skills. A sampling of 25% of carefully worked out problems has been selected to help students understand concepts presented in the text. An Instructors Solutions Manual with complete solutions is also available.

### Computer Methods

The development of an intuition for randomness can be aided by the use of computer exercises. Appendix C contains computer programs for generating several well-known random variables. The resulting data from computer-generated random numbers and variables can be analyzed using the statistical methods introduced in the text. Sections on computer methods have been integrated into the text rather than isolated in a separate chapter because performing the computer exercises during lessons helps students to learn basic probability concepts. It should be noted that the computer methods introduced in Sections 2.7, 3.11, and 4.10 do not necessarily require entirely new lectures. The transformation method in Section 3.11 can be incorporated into the discussion on functions of a random variable. Similarly, the material in Section 4.10 can be incorporated into the discussion on transformations of random vectors.

### Random Variables and Continuous-Time Random Processes

Discrete-time random processes provide a crucial "bridge" in going from random variables to continuous-time random processes. Care is taken in the first five chapters to lay the proper groundwork for this transition. Thus sequences of dependent experiments are discussed in Chapter 2 as a preview of Markov chains. In Chapter 4, emphasis is placed on how a joint distribution generates a consistent family of marginal distributions. Chapter 5 introduces sequences of independent identically distributed (iid) random variables. Chapter 6 considers the sum of an iid sequence to produce important examples of random processes. Throughout Chapters 6 and 7, a concise development of the concepts is achieved by developing discrete-time and continuous-time results in parallel.

### Markov Chains and Queueing Theory

Markov chains and queueing theory have become essential tools in communication network and computer system modeling. In the introductory course on probability only a few changes need to be made to accommodate these new requirements. The treatment of conditional probability and conditional expectation needs to be modified, and the Poisson and gamma random variables need to be given greater prominence. In an introductory course on random processes a new balance needs to be struck between the traditional discussion of wide-sense stationary processes and linear systems and the discussion of Markov chains and queueing theory. The "optimum" balance between these two needs will surely vary from instructor to instructor, so the text includes more material than can be covered in one semester in order to give the instructor leeway to strike a balance.

### Suggested Syllabi

The first five chapters form the basis of a one-semester introduction to probability. In addition to the optional sections on computer methods, these chapters also include optional sections on combinatorics, reliability, confidence intervals, and basic results from renewal theory. In a one-semester course, it is possible to provide an introduction to random processes by omitting all the starred sections in the first five chapters and covering instead the first part of Chapter 6. The material in the first five chapters has been used at the University of Toronto in an introductory junior-level required course for electrical engineers. A one-semester course on random processes with Markov chains can be taught using Chapters 6 though 8. A quick introduction to Markov chains and queueing theory is possible by covering only the first three sections of Chapter 8 and then proceeding to the first few sections in Chapter 9. A one-semester introduction to queueing theory can be taught from Chapters 6, 8, and 9.

### Changes in the Second Edition

The only changes in the second edition that affect the first half of the book, and hence introductory courses on probability, involve the addition of more examples and problems. In keeping with our goal of giving the instructor flexibility in the selection of topics, we have expanded the optional section on reliability (Section 3.10) and introduced a new optional section on entropy (Section 3.12). Care has been taken not just to define the various quantities associated with entropy but also to develop an understanding of the interpretation of entropy as a measure of uncertainty and information. The most significant change to the second edition is the addition of material to make the text more suitable for a course that provides a more substantial introduction to random processes:

- In Chapter 4, a section on the joint characteristic function has been added and the discussion of jointly Gaussian random variables has been expanded.
- Section 5.5 discusses the various types of convergence of sequences of random variables. A carefully selected set of examples is presented to demonstrate the differences in the various types of convergence.
- Section 6.6 uses these results to develop the notions of mean square continuity, derivatives, and integrals of random processes. This section presents the relations between the Wiener process and white Gaussian noise. It also develops the Ornstein-Uhlenbeck process as the transient solution to a first-order linear system driven by noise.
- Section 6.8 uses Fourier series to introduce the notion of representing a random process by a linear combination of deterministic functions weighted by random variables. It then proceeds to develop the Karhunen-Loeve expansion for vector random variables and then random processes.
- Section 7.4 now contains a separate section on prediction and the Levinson algorithm.
- Finally, Section 7.5 presents a discussion of the Kalman filter to complement the Wiener filter introduced in Section 7.4.

### Acknowledgments

I would like to acknowledge the help of several individuals in the preparations of the second edition. First and foremost, I must thank the users of the first edition, both professors and students, who provided many of the suggestions incorporated into this edition. I would also like to thank my graduate students for providing feedback on parts of the manuscript, especially Masoud Khansari and Sameh Sowelam, who took a special interest. I also thank Indra Widjaja for preparing the programs to generate random variables. My colleagues, Professors Frank Kschischang, ...

## Customer Reviews

Most helpful customer reviews

0 of 0 people found the following review helpful.

like a clamp and making sure not to fully open ...

By Amazon Customer

I bought the paper back version for nearly $200 for a class. Upon receiving the book, I cracked it open and was surprised to find the pages came out of the book as I turned them. I'm dealing with it, but it's hard to focus on the material while holding the previously read sections with my left hand, like a clamp and making sure not to fully open each page by cracking the book open just enough so light can shine into the crevasse formed between two pages - as fully opening the pages like one would normally causes the pages to come loose. I'll likely DIY re-bind the book somehow. The content seems good so far - only in chapter 2, but it's so much work just to read a new page and maintain the previous read sections so the entire book does not come apart. Forget about quickly flipping back to previous sections for a reference; it's just not possible to do and maintain the delicate binding. I generously give a 2 starts since I have not completed the book yet. I may bump it up to a three stars if the content turns out to be amazing.

1 of 1 people found the following review helpful.

Could be great

By devdas14224

As a first time student of probability, random variables, and stochastic processes, I was extremely enthusiastic about learning a subject that has so many uses in various fields of science and engineering. It is safe to say my professor wasn't the greatest, therefore I was left to turn to this textbook and Papoulis' book for reference; since the latter is nearly impossible to read as an amateur, I turned to this one.

Conceptually, this book shines, and gives you a good overall base on each of the concepts, along with some simple examples that make much of the material, a usually undecipherable subject, understandable.

HOWEVER, that being said, the book's biggest downfall is the problems at the end of the book. Although they could be considered a gold mine for practice, the problems tend to go from trivially easy to extremely difficult, with no steady progression in difficulty. Also, the questions tend to expect a great many number of assumptions; therefore solving a problem can lead you in a completely opposite direction from what it actually meant.

It truly does not help either that there are no solutions (not even final answers) to these problems available (except for a horrible student solutions manual that picks out a handful of the easiest problems). I feel as if it would be fair to AT LEAST provide final answers (if not solutions) for AT LEAST the odd problems (as many textbooks nowadays do). Without these, practicing blindly can lead to horrible problem solving skills, and incorrect application of concepts.

0 of 0 people found the following review helpful.

Good for review and reference

By Thomas Edward

To start with, I want to be clear that when I used this textbook for a graduate course it was at least ten years after I had graduated from my undergraduate studies in engineering, so my perspective will be different from many other reviewers.

I found that this book was much more clear and well-organized than other textbooks in probability and random processes that I had encountered in the past. This subject, like many other subjects in higher-level mathematics, is full of notation and terminology which can be somewhat ambiguous without good examples to help illustrate what the notation/terminology is attempting to communicate. The author of this book was very good about putting one or more examples for each new topic presented, and this was very helpful in clarifying the more difficult equations/terminology. I have a few other books on the same subject and many of them just present the terminology without any examples.

I also thought that this book was more comprehensive than other ones that I have seen in the past. As an engineer, I occasionally come across equations related to probability/random processes in the papers and presentations that I have to read which I need to find more about - I think this book covers enough ground that it was useful as a reference.