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 71
Page 53
... inverse z - transform relation is given by the contour integral x ( n ) = 1 27 ; $ X ( 2 ) z ^ ~ 1 dz x ( z ) z " -1 2пj Jc ( 2.22 ) where C is a counterclockwise closed contour in the ... inverse transform 2.2 Inverse z - Transform 53.
... inverse z - transform relation is given by the contour integral x ( n ) = 1 27 ; $ X ( 2 ) z ^ ~ 1 dz x ( z ) z " -1 2пj Jc ( 2.22 ) where C is a counterclockwise closed contour in the ... inverse transform 2.2 Inverse z - Transform 53.
Page 236
... Inverse Design In the two procedures discussed above , the filter was specified in the frequency domain and the resulting set of equations was nonlinear in the filter parameters . An alternative procedure , based on a least - squares ap ...
... Inverse Design In the two procedures discussed above , the filter was specified in the frequency domain and the resulting set of equations was nonlinear in the filter parameters . An alternative procedure , based on a least - squares ap ...
Page 319
... inverse trans- form , requiring coefficients in bit - reversed order , or the decimation - in- frequency algorithm for the direct transform should be paired with the decimation - in - time algorithm for the inverse transform , which ...
... inverse trans- form , requiring coefficients in bit - reversed order , or the decimation - in- frequency algorithm for the direct transform should be paired with the decimation - in - time algorithm for the inverse transform , which ...
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