An Introduction to the Winograd Discrete Fourier Transform
Saved in:
| Title: | An Introduction to the Winograd Discrete Fourier Transform |
|---|---|
| Authors: | Agnello, Janice S. |
| Committee Members: | Bauer, Christian S.; Christian S. Bauer, Jr. (Q57708477) University of Central Florida. College of Engineering [VIAF]University of Central Florida. College of Engineering [LC] |
| Summary: | This paper illustrates Winograd's approach to computing the Discrete Fourier Transform (DFT). This new approach changes the DFT into a cyclic convolution of 2 sequences, and illustrates shortcuts for computing this cyclic convolution. This method is known to reduce the number of multiplies required to about 20% less than the number of multiplies used by the techniques of the Fast Fourier Transform. Three approaches are discussed, one for prime numbers, one for products of primes, and lastly one for powers of odd primes. For powers of 2 Winograd's algorithm is, in general, inefficient and best if it is not used. A computer simulation is illustrated for the 35 point transform and its execution time is compared with that of the Fast Fourier Transform algorithm for 32 points. |
| URL: | https://stars.library.ucf.edu/rtd/392 |
| Database: | OpenDissertations |
| Abstract: | This paper illustrates Winograd's approach to computing the Discrete Fourier Transform (DFT). This new approach changes the DFT into a cyclic convolution of 2 sequences, and illustrates shortcuts for computing this cyclic convolution. This method is known to reduce the number of multiplies required to about 20% less than the number of multiplies used by the techniques of the Fast Fourier Transform. Three approaches are discussed, one for prime numbers, one for products of primes, and lastly one for powers of odd primes. For powers of 2 Winograd's algorithm is, in general, inefficient and best if it is not used. A computer simulation is illustrated for the 35 point transform and its execution time is compared with that of the Fast Fourier Transform algorithm for 32 points. |
|---|
