The Fast Fourier Transform (FFT) is an implementation of the Discrete Fourier Transform (DFT) using a divide-and-conquer approach. A DFT can transform any discrete signal, such as an image, to and ...

Design linear discrete-time systems and filters and analyze their behavior. Represent continuous-time signals and linear systems in discrete time, so that such signals can be recovered in continuous ...

To study the application of digital signal processing to problems in image processing. Topics covered will range from the fundamentals of 2-D signals and systems, to image enhancement, restoration and ...