scientific article; zbMATH DE number 4164118

MaRDI QIDQ3490924zbMATH OpenFDO

Authors Klaus Gola

Publication date 1990

zbMATH Keywords

bit reversionCooley-Tukey algorithmdiscrete Fourier transformfast Fourier transformRadix-2 FFTunscrambling algorithm

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50) Searching and sorting (68P10)

Recommendations

• scientific article; zbMATH DE number 3970070
• scientific article; zbMATH DE number 3974248
• Fast Fourier transforms for nonequispaced data. II
• Fast Fourier Transforms for Nonequispaced Data
• scientific article; zbMATH DE number 1284007
• Fast Approximate Fourier Transforms for Irregularly Spaced Data
• On a fast algorithm for computing the Fourier transform
• On a fast and accurate method for computing Fourier transforms
• scientific article; zbMATH DE number 3956396
• scientific article; zbMATH DE number 4007688

Cited in

(2)

• scientific article; zbMATH DE number 4180760 (Why is no real title available?)
• scientific article; zbMATH DE number 4209550 (Why is no real title available?)

This page was built for publication:

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