Gray codes, fast Fourier transforms and hypercubes (Q1097676)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4035096
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Gray codes, fast Fourier transforms and hypercubes |
scientific article; zbMATH DE number 4035096 |
Statements
Gray codes, fast Fourier transforms and hypercubes (English)
0 references
1988
0 references
The usefulness of the hypercube architecture is stressed for the implementation of the fast Fourier transform. It is so because the data communications at every step of computation are only needed between neighbouring processors. If the data are distributed according to a binary reflected Gray code, the computing time increases a little as an effect due to imbalance in the load between processors.
0 references
parallel processing
0 references
hypercube architecture
0 references
fast Fourier transform
0 references
Gray code
0 references
0.8469402194023132
0 references
0.7485439777374268
0 references
0.7443144917488098
0 references
0.7427078485488892
0 references
