- Article
5 Citations
4,559 Views
22 Pages
On the Derivation of Winograd-Type DFT Algorithms for Input Sequences Whose Length Is a Power of Two
Winograd’s algorithms are an effective tool for calculating the discrete Fourier transform (DFT). These algorithms described in well-known articles are traditionally represented either with the help of sets of recurrent relations or with the he...