Analysis of an ADA based version of Glassman's general N point fast Fourier transform

DOI10.1016/0898-1221(93)90322-MMaRDI QIDQ2367570zbMATH OpenFDO

Authors B. D. Raduenz, Bruce W. Suter, E. R. Christensen

Publication date 2 September 1993

Published in Computers & Mathematics with Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0898-1221(93)90322-M

zbMATH Keywords

ADA programfast Fourier transformFORTRAN program

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50) Theory of programming languages (68N15)

Recommendations

• scientific article; zbMATH DE number 3997125
• scientific article; zbMATH DE number 3956396
• Banyan models for the parallel implementation of the fast Fourier transform algorithm
• Conversion of FFT’s to Fast Hartley Transforms
• A high-performance fast Fourier transform algorithm for the Cray-2

Cites work

• A Generalization of the Fast Fourier Transform
• A simple derivation of Glassman's general N fast Fourier transform
• scientific article; zbMATH DE number 53687 (Why is no real title available?)

This page was built for publication: Analysis of an ADA based version of Glassman's general \(N\) point fast Fourier transform

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