Generating and Searching Families of FFT Algorithms

@article{Haynal2011GeneratingAS,
  title={Generating and Searching Families of FFT Algorithms},
  author={S. Haynal and Heidi Haynal},
  journal={ArXiv},
  year={2011},
  volume={abs/1103.5740}
}
  • S. Haynal, Heidi Haynal
  • Published 2011
  • Computer Science, Mathematics
  • ArXiv
  • A fundamental question of longstanding theoretical interest is to prove the lowest exact count of real additions and multiplications required to compute a power-of-two discrete Fourier transform (DFT). For 35 years the split-radix algorithm held the record by requiring just 4n log n - 6n + 8 arithmetic operations on real numbers for a size-n DFT, and was widely believed to be the best possible. Recent work by Van Buskirk et al. demonstrated improvements to the split-radix operation count by… CONTINUE READING
    6 Citations
    Brute-force search of fast convolution algorithms
    • S. Haynal, Heidi Haynal
    • Mathematics, Computer Science
    • 2013 IEEE International Conference on Acoustics, Speech and Signal Processing
    • 2013
    • 2
    • PDF
    Improved QFT algorithm for power-of-two FFT
    • 1
    • PDF
    Parallel Computing for the Radix-2 Fast Fourier Transform
    • G. Xie, Yang-chun Li
    • Computer Science
    • 2014 13th International Symposium on Distributed Computing and Applications to Business, Engineering and Science
    • 2014
    • 1
    On the real complexity of a complex DFT
    • I. S. Sergeev
    • Mathematics, Computer Science
    • Probl. Inf. Transm.
    • 2017
    Enhanced Measurements in Fourier Analysis of MEMS Dynamics

    References

    SHOWING 1-10 OF 78 REFERENCES
    The Tangent FFT
    • 17
    • Highly Influential
    • PDF
    Algorithms meeting the lower bounds on the multiplicative complexity of length-2n DFTs and their connection with practical algorithms
    • P. Duhamel
    • Mathematics, Computer Science
    • IEEE Trans. Acoust. Speech Signal Process.
    • 1990
    • 48
    A Modified Split-Radix FFT With Fewer Arithmetic Operations
    • S. Johnson, M. Frigo
    • Mathematics, Computer Science
    • IEEE Transactions on Signal Processing
    • 2007
    • 321
    • Highly Influential
    • PDF
    An economical method for calculating the discrete Fourier transform
    • R. Yavne
    • Computer Science
    • AFIPS '68 (Fall, part I)
    • 1968
    • 84
    • PDF
    A new matrix approach to real FFTs and convolutions of length 2k
    • 44
    • Highly Influential
    An algorithm for the machine calculation of complex Fourier series
    • 10,663
    • PDF
    On computing the split-radix FFT
    • 222
    The FFT: an algorithm the whole family can use
    • 76
    • PDF
    Automatic generation of customized discrete Fourier transform IPs
    • 67
    • PDF
    Beaver: Engineering an Efficient SMT Solver for Bit-Vector Arithmetic
    • 72
    • Highly Influential
    • PDF