Fast Fourier transform algorithms for real and symmetric data

DOI10.1107/S0108767391015039MaRDI QIDQ3567091zbMATH OpenOpenAlexWikidataFDO

Authors

Publication date 10 June 2010

Published in Acta Crystallographica Section A Foundations of Crystallography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1107/s0108767391015039

Mathematics Subject Classification ID

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

Recommendations

• Symmetric FFTs
• Parallel Compact FFT<scp>s</scp> for Real Sequences
• Very fast computation of the radix-2 discrete Fourier transform
• scientific article; zbMATH DE number 3926792
• Publication:3479507

Cited in

(10)

• Algorithm to retrieve real coefficients of a two-dimensional Fourier series using complex one-dimensional FFTs
• Some features of Fourier spectrum for symbolic sequences
• scientific article; zbMATH DE number 4149523 (Why is no real title available?)
• scientific article; zbMATH DE number 4100582 (Why is no real title available?)
• Symmetric Prime Factor Fast Fourier Transform Algorithms
• Fast algorithm for real joint time–frequency transformations of time-varying signals
• Fast computation of real discrete Fourier transform for any number of data points
• scientific article; zbMATH DE number 1329640 (Why is no real title available?)
• Symmetric FFTs
• Further Symmetries of in-Place FFTs

This page was built for publication: Fast Fourier transform algorithms for real and symmetric data

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