A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
On the Derivation of Winograd-Type DFT Algorithms for Input Sequences Whose Length Is a Power of Two
2022
Electronics
Preserved Fulltext
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 help of products of sparse matrices obtained on the basis of various methods of the DFT matrix factorization. Unfortunately, in the mentioned papers, it is not shown how the described relations were obtained or how the presented factorizations were found.
doi:10.3390/electronics11091342
fatcat:zk4d5wyzgzfxvanjtpv4veq3bu