Discrete Stochastic Processes and Optimal Filtering / Edition 1

Hardcover (Print)
Buy New
Buy New from BN.com
Used and New from Other Sellers
Used and New from Other Sellers
from $128.86
Usually ships in 1-2 business days
(Save 24%)
Other sellers (Hardcover)
  • All (5) from $128.86   
  • New (4) from $128.86   
  • Used (1) from $163.19   


Optimal filtering applied to stationary and non-stationary signals provides the most efficient means of dealing with problems arising from the extraction of noise signals. Moreover, it is a fundamental feature in a range of applications, such as in navigation in aerospace and aeronautics, filter processing in the telecommunications industry, etc. This book provides a comprehensive overview of this area, discussing random and Gaussian vectors, outlining the results necessary for the creation of Wiener and adaptive filters used for stationary signals, as well as examining Kalman filters which are used in relation to non-stationary signals. Exercises with solutions feature in each chapter to demonstrate the practical application of these ideas using MATLAB.

Read More Show Less

Product Details

  • ISBN-13: 9781905209743
  • Publisher: Wiley
  • Publication date: 2/4/2008
  • Series: ISTE Series, #673
  • Edition number: 1
  • Pages: 287
  • Product dimensions: 6.34 (w) x 9.41 (h) x 0.76 (d)

Meet the Author

Jean-Claude Bertein has a Master’s and PhD degree from the University of Paris VI. He was formerly a research engineer at Alcatel and today is Professor in the Department of Mathematics and Physics at the Graduate School of Electrical and Electronic Engineering (ESIEE) Paris.

Roger Ceschi is an ENSEA engineer and holds a Master’s and PhD degree from the University of Paris XI. He was formerly Director of the ENSEA and today he is Director General of the ESIEE Amiens. He is also the author of a theorem on analytic signals and is Visiting Professor at the BIPT and BIT Universities in China.

Read More Show Less

Table of Contents

Preface xi

Introduction xiii

Chapter 1. Random Vectors 1

1.1. Definitions and general properties 1

1.2. Spaces L1(dP) and L2(dP) 20

1.2.1. Definitions 20

1.2.2. Properties 22

1.3. Mathematical expectation and applications 23

1.3.1. Definitions 23

1.3.2. Characteristic functions of a random vector 34

1.4. Second order random variables and vectors 39

1.5. Linear independence of vectors of L2(dP) 47

1.6. Conditional expectation (concerning random vectors with density function) 51

1.7. Exercises for Chapter 1 57

Chapter 2. Gaussian Vectors 63

2.1. Some reminders regarding random Gaussian vectors 63

2.2. Definition and characterization of Gaussian vectors 66

2.3. Results relative to independence 68

2.4. Affine transformation of a Gaussian vector 72

2.5. The existence of Gaussian vectors 74

2.6. Exercises for Chapter 2 85

Chapter 3. Introduction to Discrete Time Processes 93

3.1. Definition 93

3.2. WSS processes and spectral measure 105

3.2.1. Spectral density 106

3.3. Spectral representation of a WSS process 110

3.3.1. Problem 110

3.3.2. Results 111 Process with orthogonal increments and associated measurements 111 Wiener stochastic integral 113 Spectral representation 114

3.4. Introduction to digital filtering 115

3.5. Important example: autoregressive process 128

3.6. Exercises for Chapter 3 134

Chapter 4. Estimation 141

4.1. Position of the problem 141

4.2. Linear estimation 144

4.3. Best estimate – conditional expectation 156

4.4. Example: prediction of an autoregressive process AR (1) 165

4.5. Multivariate processes 166

4.6. Exercises for Chapter 4 175

Chapter 5. The Wiener Filter 181

5.1. Introduction 181

5.1.1. Problem position 182

5.2. Resolution and calculation of the FIR filter 183

5.3. Evaluation of the least error 185

5.4. Resolution and calculation of the IIR filter 186

5.5. Evaluation of least mean square error 190

5.6. Exercises for Chapter 5 191

Chapter 6. Adaptive Filtering: Algorithm of the Gradient and the LMS 197

6.1. Introduction 197

6.2. Position of problem 199

6.3. Data representation 202

6.4. Minimization of the cost function 204

6.4.1. Calculation of the cost function 208

6.5. Gradient algorithm 211

6.6. Geometric interpretation 214

6.7. Stability and convergence 218

6.8. Estimation of gradient and LMS algorithm 222

6.8.1. Convergence of the algorithm of the LMS 225

6.9. Example of the application of the LMS algorithm 225

6.10. Exercises for Chapter 6 234

Chapter 7. The Kalman Filter 237

7.1. Position of problem 237

7.2. Approach to estimation 241

7.2.1. Scalar case 241

7.2.2. Multivariate case 244

7.3. Kalman filtering 245

7.3.1. State equation 245

7.3.2. Observation equation 246

7.3.3. Innovation process 248

7.3.4. Covariance matrix of the innovation process 248

7.3.5. Estimation 250

7.3.6. Riccati’s equation 258

7.3.7. Algorithm and summary 260

7.4. Exercises for Chapter 7 262

Table of Symbols and Notations 281

Bibliography 283

Index 285

Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star


4 Star


3 Star


2 Star


1 Star


Your Rating:

Your Name: Create a Pen Name or

Barnes & Noble.com Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & Noble.com that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & Noble.com does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at BN.com or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation


  • - By submitting a review, you grant to Barnes & Noble.com and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Noble.com Terms of Use.
  • - Barnes & Noble.com reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & Noble.com also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on BN.com. It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)