MATERIAL FOR FINAL EXAM - 2002

CHAPTER 1: ELEMENTARY ANALYSIS
  Practically everything is included.
  Mason's gain formula is not needed.
  Include signal flowgraph representation and reduction.

CHAPTER 2: THE z TRANSFORM
Exclude the proofs of:
  Theorem 2.10 Complex convolution
  Theorem 2.11 Parceval's discrete-time formula

CHAPTER 3: THE APPLICATION OF THE z TRANSFORM
Exclude:
  Sec. 3.3.4 Test for common factors
  Sec. 3.3.5 Schur-Cohn stability criterion
  Sec. 3.3.6 Schur-Cohn-Fujiwara stability criterion
  Sec. 3.3.8 Liapunov stability criterion

CHAPTER 4: REALIZATION
Exclude:
  Sec. 4.5    Ladder·realization
  Sec. 4.10.1 Tellegen's theorem
  Sec. 4.10.2 Reciprocity
  Sec. 4.10.3 Interreciprocity
Include:
  Sec. 4.10.4 Transposition
  Sec. 4.10.5 Sensitivity analysis

CHAPTER 5: ANALOG FILTER APPROXIMATION
Include:
  You should be able to calculate the minimum order for
  Butterworth, Chebyshev, and inverse-Chebyshev filters (See RRR
  materials).

  You should know how to obtain transfer functions for the
  Butterworth, Chebyshev, inverse-Chebyshev, and Bessel
  approximations in terms of poles and zeros or coefficients.

  You should know what are elliptic approximations although
  you are not going to be asked to get the transfer function.

  The analog-filter transformations are required.

Exclude:
  The derivations of Butterworth, Chebyshev, inverse- Chebyshev, elliptic, and
  Bessel approximations are not needed.

CHAPTER 6: CONTINUOUS-TIME, SAMPLED, AND DISCRETE-TIME SIGNALS
Include:
  You must know how to apply the Fourier transform and
  Poisson's summation formula to nonperiodic, periodic, and
  sampled signals.

  Effect of imperfections in analog-to-digital and digital-to-
  analog converters
Exclude:
  Sect. 6.3 Generalized functions
  Sect. 6.5 Derivation of the Poisson summation formula

CHAPTER 7: APPROXIMATIONS FOR RECURSIVE FILTERS
Exclude:
  Sect. 7.4 Modified invariant-impulse-response method 
  Sect. 7.7 Digital filter transformations