Comments on "Method of flow graph simplification for the 16-point discrete Fourier Transform"

DOI10.1109/TSP.2006.870622zbMATH Open1388.65194MaRDI QIDQ4587772FDOQ4587772

Steven G. Johnson, Matteo Frigo

Publication date: 30 October 2017

Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)

Recommendations

• Method of flow graph simplification for the 16-point discrete Fourier transform
• Fast discrete Fourier transform computations using the reduced adder graph technique
• Algorithms for defining mixed radix FFT flow graphs
• scientific article; zbMATH DE number 4011887
• Comments on "A Fast Computational Algorithm for the Discrete Sine Transform"
• Publication:3490922
• scientific article
• On the computational complexity of the general discrete Fourier transform
• scientific article
• scientific article; zbMATH DE number 4009771

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50)

Cited In (9)

• Performance and Numerical Accuracy Evaluation of Heterogeneous Multicore Systems for Krylov Orthogonal Basis Computation
• A fast symmetric SVD algorithm for square Hankel matrices
• A comparison of high-order time integrators for thermal convection in rotating spherical shells
• Predictor-corrector pseudospectral methods for stochastic partial differential equations with additive white noise
• The twenty-fourth Fermat number is composite
• Rational Chebyshev spectral transform for the dynamics of broad-area laser diodes
• Algorithms for particle-field simulations with collisions
• Spectral-Lagrangian methods for collisional models of non-equilibrium statistical states
• Spectral Solvers to Non-Conservative Transport for Non-Linear Interactive Systems of Boltzmann Type

This page was built for publication: Comments on "Method of flow graph simplification for the 16-point discrete Fourier Transform"

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4587772)