Banyan models for the parallel implementation of the fast Fourier transform algorithm
From MaRDI portal
(Redirected from Publication:1107307)
This paper describes parallel implementations of the fast Fourier transforms on: (1) \(2^ k\)-point data, (2) n-point data, (3) two- dimensional (n\(\times n)\) arrays of data, and (4) \(\mu\)-dimensional \(n^{\mu}\) arrays of data in both the decimation-in-time version and the decimation-in-frequency version.
Recommendations
Cites work
Cited in
(4)- Balanced computation of two-dimensional transforms on a tree machine
- Analysis of an ADA based version of Glassman's general \(N\) point fast Fourier transform
- scientific article; zbMATH DE number 97099 (Why is no real title available?)
- scientific article; zbMATH DE number 2090611 (Why is no real title available?)
This page was built for publication: Banyan models for the parallel implementation of the fast Fourier transform algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1107307)