𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Realization of an arbitrary permutation on a hypercube

✍ Scribed by Xiaojun Shen; Qing Hu; Weifa Liang

Book ID
107766214
Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
561 KB
Volume
51
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An Efficient Algorithm for Gray-to-Binar
An Efficient Algorithm for Gray-to-Binary Permutation on Hypercubes
✍ C.T. Ho; M.T. Raghunath; S.L. Johnsson πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 539 KB

Both Gray code and binary code are frequently used in mapping arrays into hypercube architectures. While the former is preferred when communication between adjacent array elements is needed, the latter is preferred for FFT-type communication. When different phases of computations have different type

Topological automorphisms of modified Si
Topological automorphisms of modified SierpiΕ„ski gaskets realize arbitrary finite permutation groups
✍ Reinhard Winkler πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 71 KB

The n-dimensional SierpiΕ„ski gasket X, spanned by n + 1 vertices, has (n + 1)! symmetries acting as the symmetric group on the vertices. The object of this note is the remarkable observation that for n 2 every topological automorphism of X is one of these symmetries. A modification of the arguments

Bluestein's FFT for arbitrary N on the h
Bluestein's FFT for arbitrary N on the hypercube
✍ Paul N. Swarztrauber; Roland A. Sweet; William L. Briggs; Van Emden Henson; Jame πŸ“‚ Article πŸ“… 1991 πŸ› Elsevier Science 🌐 English βš– 592 KB