The Fast Fourier Transform

DOI10.1137/060658242zbMATH Open1141.65093OpenAlexW2082484042MaRDI QIDQ5453574FDOQ5453574

Authors: Ulrich Oberst 

Publication date: 3 April 2008

Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/060658242

Recommendations

• scientific article; zbMATH DE number 3974248
• scientific article; zbMATH DE number 610966
• Recent progress and applications in group FFTs
• scientific article; zbMATH DE number 2177607
• An Algorithm for the Machine Calculation of Complex Fourier Series

zbMATH Keywords

algorithmscomplexitydiscrete Fourier transformfast Fourier transformfinite abelian groupsfast convolutionnumber theoretic transforms

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20) Numerical methods for discrete and fast Fourier transforms (65T50)

Cited In (28)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Parametric versions of the fast Fourier transform
• Fast Fourier transform of small orders.
• Matrices of finite abelian groups, finite Fourier transform and codes.
• Title not available (Why is that?)
• Title not available (Why is that?)
• The fast Fourier transform and fast wavelet transform for patterns on the torus
• Title not available (Why is that?)
• A new approach to the Cooley-Tukey algorithm
• Fast Fourier transforms: A tutorial review and a state of the art
• Title not available (Why is that?)
• Recent progress and applications in group FFTs
• Fast Fourier transforms on finite groups as a method in synthesis for regularity
• Fast Fourier transforms for the rook monoid.
• The Cooley-Tukey FFT and group theory.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Correlated pseudorandomness from the hardness of quasi-abelian decoding
• Title not available (Why is that?)
• Fast Fourier transform: algorithms and applications
• Title not available (Why is that?)
• Fast Fourier transforms over poor fields
• An Algorithm for the Machine Calculation of Complex Fourier Series
• Title not available (Why is that?)
• Algebraic signal processing theory: Cooley-Tukey type algorithms on the 2-D hexagonal spatial lattice

This page was built for publication: The Fast Fourier Transform

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