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. |
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
addition algorithm analog analysis applied approximation assume bits causal chapter coefficients complex computation consequently consider convolution corresponding defined denote depicted derived desired determine digital filter direct discrete Fourier transform discussed effect equal error estimate evaluating example expressed fact factor finite flow graph follows Fourier transform frequency response given implementation important impulse response input integral inverse length linear system magnitude mean method multiplication node noise obtain output parameters periodic periodic sequence phase points poles possible probability Problem procedure properties quantization random ratio realization referred region of convergence relation representation represented result rounding samples sequence sequence x(n Show shown in Fig signal signal processing specifications spectrum structure system function techniques truncation unit circle unit-sample response variables variance window x₁(n z-plane z-transform zero