A Matrix Laurent Series-based Fast Fourier Transform for Blocklengths N=4 (mod 8)
classification
💻 cs.DS
cs.DMeess.SP
keywords
presentedblocklengthsfastlaurentachievingblocklengthcasescomplexity
read the original abstract
General guidelines for a new fast computation of blocklength 8m+4 DFTs are presented, which is based on a Laurent series involving matrices. Results of non-trivial real multiplicative complexity are presented for blocklengths N=64, achieving lower multiplication counts than previously published FFTs. A detailed description for the cases m=1 and m=2 is presented.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.