Digital signal processing

Covers 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.

Course text: Digital signal processing / Alan V. Oppenheim, Ronald W. Schafer. -- Englewood Cliffs, N.J. : Prentice-Hall, c1975.

no. 1.01. Introduction -- no. 1.02. Discrete-time signals and systems (1) -- no. 1.03. Discrete-time signals and systems (2) -- no. 1.04. The discrete-time Fourier transform -- no. 1.05. Sampling, aliasing, and frequency response -- no. 1.06. Demonstrations of sampling, aliasing, and frequency response -- no. 1.07. The z-transform -- no. 1.08. The inverse z-transform -- no. 1.09. Z-transform properties -- no. 1.10. The discrete Fourier series -- no. 1.11. The discrete Fourier transform -- no. 1.12. Circular convolution -- no. 1.13. Representation of linear digital networks -- no. 1.14. Network structures for infinite impulse response (IIR) digital filters ̲̲ no. 1.15. Network structures for finite impulse response (FIR) digital filters and parameter-quantitization effects in digital filter structures -- no. 1.16. Design of IIR digital filters (1) -- no. 1.17. Design of IIR digital filters (2) -- no. 1.18. Examples of IIR filter design -- no. 1.19. Design of FIR digital filters -- no. 1.20. Computation of the discrete Fourier transform (1) -- no. 1.21. Computation of the discrete Fourier transform (2) -- no. 1.22. Computation of the discrete Fourier transform (3).