A new matrix approach to real FFTs and convolutions of length 2k

@article{Lundy2007ANM,
  title={A new matrix approach to real FFTs and convolutions of length 2k},
  author={T. Lundy and J. V. Buskirk},
  journal={Computing},
  year={2007},
  volume={80},
  pages={23-45}
}
  • T. Lundy, J. V. Buskirk
  • Published 2007
  • Mathematics, Computer Science
  • Computing
  • A new matrix, scaled odd tail, SOT, is introduced. This new matrix is used to derive real and complex FFT algorithms for lengths n = 2k. A compromise is reached between Fourier transform and polynomial transform methods for computing the action of cyclic convolutions. Both of these methods lead to arithmetic operation counts that are better than previously published results. A minor improvement is also demonstrated that enables us to compute the actions of Fermat prime order FFTs in fewer… CONTINUE READING
    44 Citations

    Figures, Tables, and Topics from this paper

    Improved QFT algorithm for power-of-two FFT
    • 1
    • PDF
    A Modified Split-Radix FFT With Fewer Arithmetic Operations
    • S. Johnson, M. Frigo
    • Mathematics, Computer Science
    • IEEE Transactions on Signal Processing
    • 2007
    • 322
    • PDF
    Generating and Searching Families of FFT Algorithms
    • 6
    • Highly Influenced
    • PDF
    Prime factor FFT for modern computers
    • R. Stasinski
    • Mathematics
    • 2012 19th International Conference on Systems, Signals and Image Processing (IWSSIP)
    • 2012
    • 1
    The tangent FFT
    • PDF
    Novel Convolutions Using First-Order Moments
    • 9
    • Highly Influenced
    The Tangent FFT
    • 17
    • PDF
    On the real complexity of a complex DFT
    • I. S. Sergeev
    • Mathematics, Computer Science
    • Probl. Inf. Transm.
    • 2017
    with reduced number of arithmetic operations
    • 2
    A performance model for Fast Fourier Transform
    • 8

    References

    SHOWING 1-10 OF 24 REFERENCES
    `Split radix' FFT algorithm
    • 419
    • PDF
    Simple FFT and DCT algorithms with reduced number of operations
    • 357
    • PDF
    A new set of minimum-add small- n rotated DFT modules
    • 20
    Fast Mixed-Radix Real Fourier Transforms
    • 57
    • Highly Influential
    The Design and Implementation of FFTW3
    • 4,281
    • PDF
    FFT algorithms for prime transform sizes and their implementations on VAX, IBM3090VF, and IBM RS/6000
    • 16
    • Highly Influential
    Discrete Fourier transforms when the number of data samples is prime
    • 498
    Automatic generation of prime length FFT programs
    • 41
    • Highly Influential
    • PDF
    Real-valued fast Fourier transform algorithms
    • 439
    • Highly Influential
    • PDF
    Algorithms for Discrete Fourier Transform and Convolution
    • 236
    • Highly Influential
    • PDF