FREE SHIPPING BOTH WAYS
ON EVERY ORDER!
LIST PRICE:
$88.00

Sorry, this item is currently unavailable.

Discrete-Time Signal Processing

ISBN: 9780132162920 | 013216292X
Format: Hardcover
Publisher: Prentice Hall
Pub. Date: 3/1/1989

Why Rent from Knetbooks?

Because Knetbooks knows college students. Our rental program is designed to save you time and money. Whether you need a textbook for a semester, quarter or even a summer session, we have an option for you. Simply select a rental period, enter your information and your book will be on its way!

Top 5 reasons to order all your textbooks from Knetbooks:

  • We have the lowest prices on thousands of popular textbooks
  • Free shipping both ways on ALL orders
  • Most orders ship within 48 hours
  • Need your book longer than expected? Extending your rental is simple
  • Our customer support team is always here to help
SummaryTable of Contents
The definitive, authoritative guide to DSP -- ideal for those with an introductory-level knowledge of signals and systems -- but not necessarily DSP. Written by a prominent, standard-setting team.
Prefacexi
1 Introduction
1(7)
2 Discrete-Time Signals and Systems
8(72)
... MORE
2.0 Introduction
8(1)
2.1 Discrete-Time Signals: Sequences
9(8)
2.2 Discrete-Time Systems
17(4)
2.3 Linear Time-Invariant Systems
21(6)
2.4 Properties of Linear Time-Invariant Systems
27(6)
2.5 Linear Constant-Coefficient Difference Equations
33(6)
2.6 Frequency-Domain Representation of Discrete-Time Signals and Systems
39(6)
2.7 Representation of Sequences by Fourier Transforms
45(7)
2.8 Symmetry Properties of the Fourier Transform
52(4)
2.9 Fourier Transform Theorems
56(7)
2.10 Discrete-Time Random Signals
63(4)
2.11 Summary
67(1)
Problems
68(12)
3 Sampling of Continuous-Time Signals
80(69)
3.0 Introduction
80(1)
3.1 Periodic Sampling
80(2)
3.2 Frequency-Domain Representation of Sampling
82(5)
3.3 Reconstruction of a Bandlimited Signal from Its Samples
87(4)
3.4 Discrete-Time Processing of Continuous-Time Signals
91(8)
3.5 Continuous-Time Processing of Discrete-Time Signals
99(2)
3.6 Changing the Sampling Rate Using Discrete-Time Processing
101(11)
3.7 Practical Considerations
112(18)
3.8 Summary
130(1)
Problems
131(18)
4 The z-Transform
149(53)
4.0 Introduction
149(1)
4.1 The z-Transform
149(11)
4.2 Properties of the Region of Convergence for the z-Transform
160(5)
4.3 The Inverse z-Transform
165(7)
4.4 z-Transform Properties
172(9)
4.5 The Inverse z-Transform Using Contour Integration
181(3)
4.6 The Complex Convolution Theorem
184(2)
4.7 Parseval's Relation
186(2)
4.8 The Unilateral z-Transform
188(3)
4.9 Summary
191(1)
Problems
192(10)
5 Transform Analysis of Linear Time-Invariant Systems
202(88)
5.0 Introduction
202(1)
5.1 The Frequency Response of LTI Systems
203(3)
5.2 System Functions for Systems Characterized by Linear Constant-Coefficient Difference Equations
206(7)
5.3 Frequency Response for Rational System Functions
213(17)
5.4 Relationship Between Magnitude and Phase
230(4)
5.5 Allpass Systems
234(6)
5.6 Minimum-Phase Systems
240(10)
5.7 Linear Systems with Generalized Linear Phase
250(20)
5.8 Summary
270(1)
Problems
270(20)
6 Structures for Discrete-Time Systems
290(113)
6.0 Introduction
290(1)
6.1 Block Diagram Representation of Linear Constant-Coefficient Difference Equations
291(6)
6.2 Signal Flow Graph Representation of Linear Constant-Coefficient Difference Equations
297(3)
6.3 Basic Structures for IIR Systems
300(9)
6.4 Transposed Forms
309(4)
6.5 Basic Network Structures for FIR Systems
313(4)
6.6 Lattice Structures
317(11)
6.7 Overview of Finite-Precision Numerical Effects
328(7)
6.8 The Effects of Coefficient Quantization
335(16)
6.9 Effects of Roundoff Noise in Digital Filters
351(22)
6.10 Zero-Input Limit Cycles in Fixed-Point Realizations of IIR Digital Filters
373(5)
6.11 Summary
378(1)
Problems
379(24)
7 Filter Design Techniques
403(11)
7.0 Introduction
403(3)
7.1 Design of Discrete-Time IIR Filters from Continuous-Time Filters
406(24)
7.2 Frequency Transformations of Lowpass IIR Filters
430(8)
7.3 Computer-Aided Design of Discrete-Time IIR Filters
438(6)
7.4 Design of FIR Filters by Windowing
444(14)
7.5 Examples of FIR Filter Design by the Kaiser Window Method
458(6)
7.6 Optimum Approximations of FIR Filters
464(17)
7.7 Examples of FIR Equiripple Approximation
481(7)
7.8 Comments on IIR and FIR Digital Filters
488(1)
7.9 Summary
489(1)
Problems
490(24)
8 The Discrete Fourier Transform
514(67)
8.0 Introduction
514(1)
8.1 Representation of Periodic Sequences: The Discrete Fourier Series
515(5)
8.2 Properties of the Discrete Fourier Series
520(5)
8.3 Summary of Properties of the DFS Representation of Periodic Sequences
525(1)
8.4 The Fourier Transform of Periodic Signals
526(1)
8.5 Sampling the Fourier Transform
527(3)
8.6 Fourier Representation of Finite-Duration Sequences: The Discrete Fourier Transform
530(5)
8.7 Properties of the Discrete Fourier Transform
535(12)
8.8 Summary of Properties of the Discrete Fourier Transform
547(1)
8.9 Linear Convolution Using the Discrete Fourier Transform
548(12)
8.10 Summary
560(1)
Problems
561(20)
9 Computation of the Discrete Fourier Transform
581(81)
9.0 Introduction
581(1)
9.1 Efficient Computation of the Discrete Fourier Transform
582(3)
9.2 The Goertzel Algorithm
585(2)
9.3 Decimation-in-Time FFT Algorithms
587(12)
9.4 Decimation-in-Frequency FFT Algorithms
599(6)
9.5 Implementation of FFT Algorithms
605(5)
9.6 FFT Algorithms for Composite N
610(12)
9.7 Implementation of the DFT Using Convolution
622(6)
9.8 Effects of Finite Register Length in Discrete Fourier Transform Computations
628(13)
9.9 Summary
641(1)
Problems
642(20)
10 Discrete Hilbert Transforms
662(33)
10.0 Introduction
662(2)
10.1 Real and Imaginary Part Sufficiency of the Fourier Transform for Causal Sequences
664(6)
10.2 Sufficiency Theorems for Finite-Length Sequences
670(4)
10.3 Relationships Between Magnitude and Phase
674(2)
10.4 Hilbert Transform Relations for Complex Sequences
676(13)
10.5 Summary
689(1)
Problems
689(6)
11 Fourier Analysis of Signals Using the Discrete Fourier Transform
695(73)
11.0 Introduction
695(1)
11.1 Fourier Analysis of Signals Using the DFT
696(3)
11.2 DFT Analysis of Sinusoidal Signals
699(14)
11.3 The Time-Dependent Fourier Transform
713(8)
11.4 Block Convolution Using the Time-Dependent Fourier Transform
721(2)
11.5 Fourier Analysis of Nonstationary Signals
723(7)
11.6 Fourier Analysis of Stationary Random Signals: The Periodogram
730(12)
11.7 Spectrum Analysis of Random Signals Using Estimates of the Autocorrelation Sequence
742(13)
11.8 Summary
755(1)
Problems
756(12)
12 Cepstrum Analysis and Homomorphic Deconvolution
768(67)
12.0 Introduction
768(1)
12.1 Definition of the Complex Cepstrum
769(2)
12.2 Homomorphic Deconvolution
771(4)
12.3 Properties of the Complex Logarithm
775(3)
12.4 Alternative Expressions for the Complex Cepstrum
778(1)
12.5 The Complex Cepstrum of Exponential Sequences
779(2)
12.6 Minimum-Phase and Maximum-Phase Sequences
781(6)
12.7 Realizations of the Characteristic System D*[.]
787(10)
12.8 Examples of Homomorphic Filtering
797(18)
12.9 Applications to Speech Processing
815(10)
12.10 Summary
825(1)
Problems
826(9)
Appendix A Random Signals835(10)
A.1 Discrete-Time Random Processes835(2)
A.2 Averages837(4)
A.3 Properties of Correlation and Covariance Sequences841(2)
A.4 Transform Representations of Random Signals843(2)
Appendix B Continuous-Time Filters845(6)
B.1 Butterworth Lowpass Filters845(2)
B.2 Chebyshev Filters847(2)
B.3 Elliptic Filters849(2)
Bibliography851(18)
Index869

Related Products


  • Discrete-Time Signal Processing
    Discrete-Time Signal Processing
  • Discrete-Time Signal Processing
    Discrete-Time Signal Processing
  • Outlines and Highlights for Discrete-Time Signal Processing by Alan V Oppenheim, Isbn : 9780131988422
    Outlines and Highlights for Di...


Please wait while this item is added to your cart...