|

Prentice Hall

Engineering

My Instructor Resource Center :  Log in or request access

Discrete-Time Signal Processing, 2/E
Alan V. Oppenheim, Massachusetts Institute of Technology
Ronald W. Schafer, Georgia Institute of Technology
John R. Buck, University of Massachusettes-Dartmouth

ISBN-10: 0137549202
ISBN-13:  9780137549207

Publisher:  Prentice Hall
Copyright:  1999
Format:  Cloth; 870 pp
Published:  12/31/1998

For senior/graduate-level courses in Discrete-Time Signal Processing. THE definitive, authoritative text on DSP — ideal for those with an introductory-level knowledge of signals and systems. Written by prominent, DSP pioneers, it provides thorough treatment of the fundamental theorems and properties of discrete-time linear systems, filtering, sampling, and discrete-time Fourier Analysis. By focusing on the general and universal concepts in discrete-time signal processing, it remains vital and relevant to the new challenges arising in the field —without limiting itself to specific technologies with relatively short life spans.

NEW TO THIS EDITION

  • NEW - Provides a new chapter organization reflecting the fact that students in graduate signal processing courses now have no process exposure to the Z-transform.
  • NEW - Material on:

    • Multi-rate filtering banks.

    • The discrete cosine transform.

    • Noise-shaping sampling strategies.

  • NEW - Includes several dozen new problem-solving examples that not only illustrate key points, but demonstrate approaches to typical problems related to the material.
  • NEW - Contains a wealth of “combat tested” problems which are the best produced over decades of undergraduate and graduate signal processing classes at MIT and Georgia Tech.
  • NEW - Problems are completely reorganized by level of difficulty into separate categories:

    • Basic Problems with Answers to allow students to check their results, but not solutions (20 per chapter).

    • Basic Problems — without answers.

    • Advanced Problems — provide an opportunity for students to understand.

    • Extension Problems — start from the discussion in the text and lead students beyond to glimpse some advanced areas of signal processing.

  • NEW - Provides an accompanying Instructor's Manual.
  • Covers the history of discrete-time signal processing as well as contemporary developments in the field.
  • Discusses the wide range of present and future applications of the technology.
  • Focuses on the general and universal concepts in discrete-time signal processing.
  • Offers a wealth of problems and examples.

  • Provides a new chapter organization reflecting the fact that students in graduate signal processing courses now have no process exposure to the Z-transform.
  • Material on:

    • Multi-rate filtering banks.

    • The discrete cosine transform.

    • Noise-shaping sampling strategies.

  • Includes several dozen new problem-solving examples that not only illustrate key points, but demonstrate approaches to typical problems related to the material.
  • Contains a wealth of “combat tested” problems which are the best produced over decades of undergraduate and graduate signal processing classes at MIT and Georgia Tech.
  • Problems are completely reorganized by level of difficulty into separate categories:

    • Basic Problems with Answers to allow students to check their results, but not solutions (20 per chapter).

    • Basic Problems — without answers.

    • Advanced Problems — provide an opportunity for students to understand.

    • Extension Problems — start from the discussion in the text and lead students beyond to glimpse some advanced areas of signal processing.

  • Provides an accompanying Instructor's Manual.



1. Introduction.


2. Discrete-Time Signals and Systems.

Introduction. Discrete-time Signals: Sequences. Discrete-time Systems. Linear Time-Invariant Systems. Properties of Linear Time-Invariant Systems. Linear Constant-Coefficient Difference Equations. Frequency-Domain Representation of Discrete-Time Signals and Systems. Representation of Sequence by Fourier Transforms. Symmetry Properties of the Fourier Transform. Fourier Transform Theorems. Discrete-Time Random Signals. Summary.



3. The z-Transform.

Introduction. The z-Transform. Properties of the Region of Convergence for the z-Transform. The Inverse z-Transform. z-Transform Properties. Summary.



4. Sampling of Continuous-Time Signals.

Introduction. Periodic Sampling. Frequency-Domain Representation of Sampling. Reconstruction of a Bandlimited Signal from its Samples. Discrete-Time Processing of Continuous-Time Signals. Continuous-Time Processing of Discrete-Time Signals. Changing the Sampling Rate Using Discrete-Time Processing. Practical Considerations. Oversampling and Noise Shaping. Summary.



5. Transform Analysis of Linear Time-Invariant Systems.

Introduction. The Frequency Response of LTI Systems. System Functions for Systems Characterized by Linea. Frequency Response for Rational System Functions. Relationship Between Magnitude and Phase. All-Pass Systems. Minimum-Phase Systems. Linear Systems with Generalized Linear Phase. Summary.



6. Structures for Discrete-Time Systems.

Introduction. Block Diagram Representation of Linear Constant-Coefficient Difference Equations. Signal Flow Graph Representation of Linear Constant-Coefficient Difference Equations. Basic Structures for IIR Systems. Transposed Forms. Basic Network Structures for FIR Systems. Overview of Finite-Precision Numerical Effects. The Effects of Coefficient Quantization. Effects of Roundoff Noise in Digital Filters. Zero-Input Limit Cycles in Fixed-Point Realizations of IIR Digital Filters. Summary.



7. Filter Design Techniques.

Introduction. Design of Discrete-Time IIR Filters from Continuous-Time Filters. Design of FIR Filters by Windowing. Examples of FIR Filter Design by the Kaiser Window Method. Optimum Approximations of FIR Filters. Examples of FIR Equiripple Approximation. Comments on IIR and FIR Digital Filters. Summary.



8. The Discrete Fourier Transform.

Introduction. Representation of Periodic Sequences: the Discrete Fourier Series. Summary of Properties of the DFS Representation of Periodic Sequences. The Fourier Transform of Periodic Signals. Sampling the Fourier Transform. Fourier Representation of Finite-Duration Sequences: The Discrete-Fourier Transform. Properties of the Discrete Fourier Transform. Summary of Properties of the Discrete Fourier Transform. Linear Convolution Using the Discrete Fourier Transform. The Discrete Cosine Transform (DCT). Summary.



9. Computation of the Discrete Fourier Transform.

Introduction. Efficient Computation of the Discrete Fourier Transform. The Goertzel Algorithm Decimation-in-Time FFT Algorithms. Decimation-in-Frequency FFT Algorithms. Practical Considerations Implementation of the DFT Using Convolution. Summary.



10. Fourier Analysis of Signals Using the Discrete Fourier Transform.

Introduction. Fourier Analysis of Signals Using the DFT. DFT Analysis of Sinusoidal Signals. The Time-Dependent Fourier Transform. Block Convolution Using the Time-Dependent Fourier Transform. Fourier Analysis of Nonstationary Signals. Fourier Analysis of Stationary Random Signals: the Periodogram. Spectrum Analysis of Random Signals Using Estimates of the Autocorrelation Sequence. Summary.



11. Discrete Hilbert Transforms.

Introduction. Real and Imaginary Part Sufficiency of the Fourier Transform for Causal Sequences. Sufficiency Theorems for Finite-Length Sequences. Relationships Between Magnitude and Phase. Hilbert Transform Relations for Complex Sequences. Summary.



Appendix A: Random Signals.

Discrete-Time Random Process. Averages. Properties of Correlation and Covariance Sequences. Transform Representation of Random Signals.



Appendix B: Continuous-Time Filters.

Butterworth Lowpass Filters. Chebyshev Filters. Elliptic Filters.

  • 9780131988422
    Discrete-Time Signal Processing, 3/E
    Oppenheim & Schafer
    ©2010 | Prentice Hall | Cloth; 1120 pp | Instock
    ISBN-10: 0131988425 | ISBN-13: 9780131988422
    Brief Description

THE definitive, authoritative book on DSP — ideal for those with an introductory-level knowledge of signals and systems. Written by prominent, DSP pioneers, it provides thorough treatment of the fundamental theorems and properties of discrete-time linear systems, filtering, sampling, and discrete-time Fourier Analysis. By focusing on the general and universal concepts in discrete-time signal processing, it remains vital and relevant to the new challenges arising in the field — without limiting itself to specific technologies with relatively short life spans.

FEATURES

  • NEW—Provides a new chapter organization.
  • NEW—Material on:
    • Multi-rate filtering banks.
    • The discrete cosine transform.
    • Noise-shaping sampling strategies.
  • NEW—Includes several dozen new problem-solving examples that not only illustrate key points, but demonstrate approaches to typical problems related to the material.
  • NEW—Contains a wealth of "combat tested" problems which are the best produced over decades of undergraduate and graduate signal processing classes at MIT and Georgia Tech.
  • NEW—Problems are completely reorganized by level of difficulty into separate categories:
    • Basic Problems with Answers to allow the user to check their results, but not solutions (20 per chapter).
    • Basic Problems — without answers.
    • Advanced Problems.
    • Extension Problems — start from the discussion in the book and lead the reader beyond to glimpse some advanced areas of signal processing.
  • Covers the history of discrete-time signal processing as well as contemporary developments in the field.
  • Discusses the wide range of present and future applications of the technology.
  • Focuses on the general and universal concepts in discrete-time signal processing.
  • Offers a wealth of problems and examples.

Companion Website - Oppenheim, 2/E
Oppenheim
©1999 | Prentice Hall | On-line Supplement | Instock
ISBN-10: 0130401250 | ISBN-13: 9780130401250


Companion Website - Oppenheim, 2/E
Oppenheim
©1999 | Prentice Hall | On-line Supplement | Instock
ISBN-10: 0130401250 | ISBN-13: 9780130401250


Companion Website - Oppenheim, 2/E
Oppenheim
©1999 | Prentice Hall | On-line Supplement | Instock
ISBN-10: 0130401250 | ISBN-13: 9780130401250


Companion Website - Oppenheim, 2/E
Oppenheim
©1999 | Prentice Hall | On-line Supplement | Instock
ISBN-10: 0130401250 | ISBN-13: 9780130401250


Log in to the Instructor Resource Center

Login name: 

  Password: 

Forgot login/password?  |  Need to redeem an access code?

         

Instructor Resource Center File Download

This work is protected by local and international copyright laws and is provided solely for the use of instructors in teaching their courses and assessing student learning. Dissemination or sale of any part of this work (including on the World Wide Web) will destroy the integrity of the work and is not permitted. The work and materials from this site should never be made available to students except by instructors using the accompanying text in their classes. All recipients of this work are expected to abide by these restrictions and to honor the intended pedagogical purposes and the needs of other instructors who rely on these materials.

Cancel                       I accept, proceed with download

Pearson Higher Education offers special pricing when you choose to package your text with other student resources. If you're interested in creating a cost-saving package for your students contact your Pearson Higher Education representative.

Copyright © Pearson Education, All rights reserved. Legal Notice | Privacy Policy | Permissions