Gray codes, fast Fourier transforms and hypercubes

DOI10.1016/0167-8191(88)90087-7zbMath0635.65145OpenAlexW1972843132MaRDI QIDQ1097676

R. M. Chamberlain

Publication date: 1988

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-8191(88)90087-7

zbMATH Keywords

fast Fourier transformparallel processingGray codehypercube architecture

Mathematics Subject Classification ID

Trigonometric interpolation (42A15) Parallel numerical computation (65Y05) Numerical methods for trigonometric approximation and interpolation (65T40)

Related Items

FFT algorithms and their adaptation to parallel processing, The parallel Fourier pseudospectral method, Resource allocation strategies for hypercube architectures, Product-shuffle networks: Toward reconciling shuffles and butterflies, On constructing multiple spanning trees in a hypercube, Optimal embeddings of butterfly-like graphs in the hypercube, Pseudospectral methods on massively parallel computers, Gray codes for reflection groups, A new parallel strategy for two-dimensional incompressible flow simulations using pseudo-spectral methods, Fault-tolerant algorithm for Fast Fourier Transform on hypercubes