Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 1 of 1 for “"Multiply-count optimization in DFT algorithms"”.

  1. An Introduction to the Winograd Discrete Fourier Transform

    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 …

    ucf Repository record for An Introduction to the Winograd Discrete Fourier Transform (opens in a new tab)