Gray codes, fast Fourier transforms and hypercubes (Q1097676): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0167-8191(88)90087-7 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1972843132 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 18:54, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Gray codes, fast Fourier transforms and hypercubes |
scientific article |
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
