An algorithm for distributed computation of FFTs (Q1097679)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An algorithm for distributed computation of FFTs |
scientific article; zbMATH DE number 4035098
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An algorithm for distributed computation of FFTs |
scientific article; zbMATH DE number 4035098 |
Statements
An algorithm for distributed computation of FFTs (English)
0 references
1987
0 references
Distributed computation of a one-dimensional radix-2 FFT with N data points on an SIMD parallel computer with P processors and butterfly interconnection network (N and P are powers of 2). Special consideration is devoted to fault tolerance using S spare processors.
0 references
fast Fourier transform
0 references
parallel processing
0 references
distributed processing
0 references
butterfly interconnection network
0 references
fault tolerance
0 references
0.8246512413024902
0 references
0.8166024088859558
0 references
0.8166024088859558
0 references
