Digital Signal ProcessingCovers the analysis and representation of discrete-time signals and systems, including discrete-time convolution, difference equations, the z-transform, and the discrete-time Fourier transform. Emphasis is placed on the similarities and distinctions between discrete-time and continuous-time signals and systems. Also covers digital network structures for implementation fo both recursive (infinite impulse response) and nonrecursive (finite impulse response) digital filters with four videocassettes devoted to digital filter design for recursive and nonrecursive filters. Concludes with a discussion of the fast Fourier transform algorithm for computation of the discrete Fourier transform. |
From inside the book
Results 1-3 of 81
Page xii
... Chapter 2 , we generalize the treatment of the Fourier transform to a discussion of the representation of discrete - time systems and signals in terms of the z - trans- form . Most of Chapter 2 deals with the definition and properties ...
... Chapter 2 , we generalize the treatment of the Fourier transform to a discussion of the representation of discrete - time systems and signals in terms of the z - trans- form . Most of Chapter 2 deals with the definition and properties ...
Page xiii
... Chapter 10 . In the discussion in the first seven chapters , it is assumed that the discrete- time signals with ... Chapter 8 we introduce some of the basic concepts concerning discrete random signals . While random signals arise in a ...
... Chapter 10 . In the discussion in the first seven chapters , it is assumed that the discrete- time signals with ... Chapter 8 we introduce some of the basic concepts concerning discrete random signals . While random signals arise in a ...
Page 251
... chapter ) . However , as we have seen , this approxima- tion criterion leads to adverse behavior at discontinuities of H1 ( ej ) . A better criterion for many types of filters is minimization of the maximum absolute error . For example ...
... chapter ) . However , as we have seen , this approxima- tion criterion leads to adverse behavior at discontinuities of H1 ( ej ) . A better criterion for many types of filters is minimization of the maximum absolute error . For example ...
Contents
INTRODUCTION | 1 |
THE ZTRANSFORM | 45 |
FLOW GRAPH AND MATRIX REPRESENTA | 136 |
Copyright | |
6 other sections not shown
Other editions - View all
Common terms and phrases
analog filter applied approximation arithmetic assume autocovariance causal cepstrum chapter circular convolution coefficients complex cepstrum complex logarithm computation consider continuous-time corresponding defined denote depicted in Fig derived determine difference equation digital filter digital signal processing discrete Fourier transform discrete-time discussed error example expressed FFT algorithm finite finite-duration sequence fixed-point floating-point flow graph frequency response Hilbert transform implementation impulse response input integral inverse length linear phase linear shift-invariant system linear system lowpass filter magnitude minimum-phase multiplication node noise sources noise-to-signal ratio obtain output noise parameters passband periodic sequence periodogram poles and zeros polynomial power spectrum Problem properties quantization random process random variables realization region of convergence representation represented result samples second-order sequence x(n Show shown in Fig spectrum estimate stopband system function theorem truncation two-dimensional unit circle unit-sample response variance window x₁(n z-plane z-transform