EE I1600 Digital Signal Processing Algorithms

The latest developments in Digital Signal Processing (DSP) algorithms and their implementation on various computers. A survey of basic algebra is given, the tensor product will be a recurring theme. The Cooley-Tukey FFT algorithm and its variants are unified under the banner of tensor product formulation. The Good-Thomas Prime Factor algorithm is also reformulated in this way. Various linear and cyclic convolution algorithms are described; results of the Cook-Toom and the Winograd are emphasized. Newly developed multiplicitive FFT algorithms will be introduced. Techniques of writing efficient FORTRAN code.

Credits

3

Prerequisite

EE 30600 and EE I5300.

Contact Hours

3 hr./wk.