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. Van Buskirk},
  journal={Computing},
  year={2007},
  volume={80},
  pages={23-45}
}
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… 
Improved QFT algorithm for power-of-two FFT
This paper shows that it is possible to improve the computational cost, the memory requirements and the accuracy of Quick Fourier Transform (QFT) algorithm for power-of-two FFT (Fast Fourier
A Modified Split-Radix FFT With Fewer Arithmetic Operations
TLDR
A simple recursive modification of the split-radix algorithm is presented that computes the DFT with asymptotically about 6% fewer operations than Yavne, matching the count achieved by Van Buskirk's program-generation framework.
Generating and Searching Families of FFT Algorithms
TLDR
A Boolean Satisfiability-based proof of the lowest operation count for certain classes of DFT algorithms, and a novel way to choose new yet valid twiddle factors for the nodes in flowgraphs generated by common power-of-two fast Fourier transform algorithms, FFTs.
Prime factor FFT for modern computers
  • R. Stasinski
  • Computer Science
    2012 19th International Conference on Systems, Signals and Image Processing (IWSSIP)
  • 2012
TLDR
The novel form of arithmetical complexity criterion is proposed, and applied in optimization of small-N DFT modules, and it is shown that indeed, prime factor FFTs containing 15-point, and especially 63-point modules may easily outperform F FTs for data sizes being powers of number 2.
The tangent FFT
TLDR
The tangent FFT is presented, a straightforward in-place cache-friendly DFT algorithm having exactly the same operation counts as Van Buskirk’s algorithm, and it is pinpoints how the tangentFFT saves time compared to the split-radix FFT.
Novel Convolutions Using First-Order Moments
TLDR
A novel fast algorithm is presented that is able to compute arbitrary-length convolutions more efficiently via transforming the convolution into a first-order moment and has some advantages such as the avoidance of multiplications, simple computation structure, and only integer additions.
The Tangent FFT
TLDR
The tangent FFT is presented, a straightforward in-place cache-friendly DFT algorithm having exactly the same operation counts as Van Buskirk's algorithm, and it is pinpoints how the tangentFFT saves time compared to the split-radix FFT.
On the real complexity of a complex DFT
TLDR
It is shown that the DFT of a complex vector of length N is performed with complexity of 3.76875N log2N real operations of addition, subtraction, and scalar multiplication.
with reduced number of arithmetic operations
We present algorithms for the discrete cosine trans- form (DCT) and discrete sine transform (DST), of types II and III, that achieve a lower count of real multiplications and additions than
A performance model for Fast Fourier Transform
TLDR
The most common Cooley-Tukey FFT algorithm factorizes a large FFT into a combination of smaller ones, and the choice of factors and the order in which they are applied are critical to the ultimate performance of the large F FT.
...
...

References

SHOWING 1-10 OF 24 REFERENCES
`Split radix' FFT algorithm
A new N = 2n fast Fourier transform algorithm is presented, which has fewer multiplications and additions than radix 2n, n = 1, 2, 3 algorithms, has the same number of multiplications as the
A new set of minimum-add small- n rotated DFT modules
Fast Mixed-Radix Real Fourier Transforms
The Design and Implementation of FFTW3
TLDR
It is shown that such an approach can yield an implementation of the discrete Fourier transform that is competitive with hand-optimized libraries, and the software structure that makes the current FFTW3 version flexible and adaptive is described.
FFT algorithms for prime transform sizes and their implementations on VAX, IBM3090VF, and IBM RS/6000
Variants of the Winograd fast Fourier transform (FFT) algorithm for prime transform size that offer options as to operational counts and arithmetic balance are derived. Their implementations on VAX,
Discrete Fourier transforms when the number of data samples is prime
  • C. Rader
  • Mathematics, Computer Science
  • 1968
TLDR
The discrete Fourier transform of a sequence of N points, where N is a prime number, is shown to be essentially a circular correlation, which permits the discrete Fouriers transform to be computed by means of a fast Fouriertransform algorithm, with the associated increase in speed, even though N is prime.
Automatic generation of prime length FFT programs
Describes a set of programs for circular convolution and prime length fast Fourier transforms (FFTs) that are relatively short, possess great structure, share many computational procedures, and cover
Real-valued fast Fourier transform algorithms
TLDR
A new implementation of the real-valued split-radix FFT is presented, an algorithm that uses fewer operations than any otherreal-valued power-of-2-length FFT.
Algorithms for Discrete Fourier Transform and Convolution
Contents: Introduction to Abstract Algebra.- Tensor Product and Stride Permutation.- Cooley-Tukey FFF Algorithms.- Variants of FFT Algorithms and Their Implementations.- Good-Thomas PFA.- Linear and
...
...