| |
| |
| Preface | |
| |
| |
| Acknowledgments | |
| |
| |
| |
| Inner Product Spaces | |
| |
| |
| |
| Motivation | |
| |
| |
| |
| Definition of Inner Product | |
| |
| |
| |
| The Spaces L[superscript 2] and l[superscript 2] | |
| |
| |
| |
| Definitions | |
| |
| |
| |
| Convergence in L[superscript 2] versus Uniform Convergence | |
| |
| |
| |
| Schwarz and Triangle Inequalities | |
| |
| |
| |
| Orthogonality | |
| |
| |
| |
| Definitions and Examples | |
| |
| |
| |
| Orthogonal Projections | |
| |
| |
| |
| Gram-Schmidt Orthogonalization | |
| |
| |
| |
| Linear Operators and Their Adjoints | |
| |
| |
| |
| Linear Operators | |
| |
| |
| |
| Adjoints | |
| |
| |
| |
| Least Squares and Linear Predictive Coding | |
| |
| |
| |
| Best Fit Line for Data | |
| |
| |
| |
| General Least Squares Algorithm | |
| |
| |
| |
| Linear Predictive Coding | |
| |
| |
| |
| Exercises | |
| |
| |
| |
| Fourier Series | |
| |
| |
| |
| Introduction | |
| |
| |
| |
| Historical Perspective | |
| |
| |
| |
| Signal Analysis | |
| |
| |
| |
| Partial Differential Equations | |
| |
| |
| |
| Computation of Fourier Series | |
| |
| |
| |
| On the Interval -[pi] [less than or equal] x [less than or equal] [pi] | |
| |
| |
| |
| Other Intervals | |
| |
| |
| |
| Cosine and Sine Expansions | |
| |
| |
| |
| Examples | |
| |
| |
| |
| The Complex Form of Fourier Series | |
| |
| |
| |
| Convergence Theorems for Fourier Series | |
| |
| |
| |
| The Riemann-Lebesgue Lemma | |
| |
| |
| |
| Convergence at a Point of Continuity | |
| |
| |
| |
| Convergence at a Point of Discontinuity | |
| |
| |
| |
| Uniform Convergence | |
| |
| |
| |
| Convergence in the Mean | |
| |
| |
| |
| Exercises | |
| |
| |
| |
| The Fourier Transform | |
| |
| |
| |
| Informal Development of the Fourier Transform | |
| |
| |
| |
| The Fourier Inversion Theorem | |
| |
| |
| |
| Examples | |
| |
| |
| |
| Properties of the Fourier Transform | |
| |
| |
| |
| Basic Properties | |
| |
| |
| |
| Fourier Transform of a Convolution | |
| |
| |
| |
| Adjoint of the Fourier Transform | |
| |
| |
| |
| Plancherel Formula | |
| |
| |
| |
| Linear Filters | |
| |
| |
| |
| Time Invariant Filters | |
| |
| |
| |
| Causality and the Design of Filters | |
| |
| |
| |
| The Sampling Theorem | |
| |
| |
| |
| The Uncertainty Principle | |
| |
| |
| |
| Exercises | |
| |
| |
| |
| Discrete Fourier Analysis | |
| |
| |
| |
| The Discrete Fourier Transform | |
| |
| |
| |
| Definition of Discrete Fourier Transform | |
| |
| |
| |
| Properties of the Discrete Fourier Transform | |
| |
| |
| |
| The Fast Fourier Transform | |
| |
| |
| |
| The FFT Approximation to the Fourier Transform | |
| |
| |
| |
| Application--Parameter Identification | |
| |
| |
| |
| Application--Discretizations of Ordinary Differential Equations | |
| |
| |
| |
| Discrete Signals | |
| |
| |
| |
| Time Invariant, Discrete Linear Filters | |
| |
| |
| |
| Z-Transform and Transfer Functions | |
| |
| |
| |
| Exercises | |
| |
| |
| |
| Haar Wavelet Analysis | |
| |
| |
| |
| Why Wavelets? | |
| |
| |
| |
| Haar Wavelets | |
| |
| |
| |
| The Haar Scaling Function | |
| |
| |
| |
| Basic Properties of the Haar Scaling Function | |
| |
| |
| |
| Basic Properties of the Haar Scaling Function | |
| |
| |
| |
| The Haar Wavelet | |
| |
| |
| |
| Haar Decomposition and Reconstruction Algorithms | |
| |
| |
| |
| Decomposition | |
| |
| |
| |
| Reconstruction | |
| |
| |
| |
| Filters and Diagrams | |
| |
| |
| |
| Summary | |
| |
| |
| |
| Exercises | |
| |
| |
| |
| Multiresolution Analysis | |
| |
| |
| |
| The Multiresolution Framework | |
| |
| |
| |
| Definition | |
| |
| |
| |
| The Scaling Relation | |
| |
| |
| |
| The Associated Wavelet and Wavelet Spaces | |
| |
| |
| |
| Decomposition and Reconstruction Formulas: A Tale of Two Bases | |
| |
| |
| |
| Summary | |
| |
| |
| |
| Implementing Decomposition and Reconstruction | |
| |
| |
| |
| The Decomposition Algorithm | |
| |
| |
| |
| The Reconstruction Algorithm | |
| |
| |
| |
| Processing a Signal | |
| |
| |
| |
| Fourier Transform Criteria | |
| |
| |
| |
| The Scaling Function | |
| |
| |
| |
| Orthogonality via the Fourier Transform | |
| |
| |
| |
| The Scaling Equation via the Fourier Transform | |
| |
| |
| |
| Iterative Procedure for Constructing the Scaling Function | |
| |
| |
| |
| Exercises | |
| |
| |
| |
| The Daubechies Wavelets | |
| |
| |
| |
| Daubechies's Construction | |
| |
| |
| |
| Classification, Moments, and Smoothness | |
| |
| |
| |
| Computational Issues | |
| |
| |
| |
| The Scaling Function at Dyadic Points | |
| |
| |
| |
| Exercises | |
| |
| |
| |
| Other Wavelet Topics | |
| |
| |
| |
| Computational Complexity | |
| |
| |
| |
| Wavelet Algorithm | |
| |
| |
| |
| Wavelet Packets | |
| |
| |
| |
| Wavelets in Higher Dimensions | |
| |
| |
| |
| Relating Decomposition and Reconstruction | |
| |
| |
| |
| Transfer Function Interpretation | |
| |
| |
| |
| Wavelet Transform | |
| |
| |
| |
| Definition of the Wavelet Transform | |
| |
| |
| |
| Inversion Formula for the Wavelet Transform | |
| |
| |
| |
| Technical Matters | |
| |
| |
| |
| Proof of the Fourier Inversion Formula | |
| |
| |
| |
| Rigorous Proof of Theorem 5.17 | |
| |
| |
| |
| Proof of Theorem 5.10 | |
| |
| |
| |
| Proof of the Convergence Part of Theorem 5.23 | |
| |
| |
| |
| Matlab Routines | |
| |
| |
| |
| General Compression Routine | |
| |
| |
| |
| Use of MATLAB's FFT Routine for Filtering and Compression | |
| |
| |
| |
| Sample Routines Using MATLAB's Wavelet Toolbox | |
| |
| |
| |
| MATLAB Code for the Algorithms in Section 5.2 | |
| |
| |
| Bibliography | |
| |
| |
| Index | |