Discrete Transforms and Number Theoretical Methods

Graduate

Introduction to orthogonal transforms, DFT, DCT, DHT; implementation methods; fast algorithms, FFT, WFT; polynomial transforms; finite rings and fields; number theoretic techniques; residue number systems; conversion and computation; finite polynomial rings; VLSI implementation consideration. (3 lecture hours a week.)