✦ LIBER ✦

A Permutation Network

✍ Scribed by Waksman, Abraham

Book ID: 121383774
Publisher: Association for Computing Machinery
Year: 1968
Tongue: English
Weight: 271 KB
Volume: 15
Category: Article
ISSN: 0004-5411
DOI: 10.1145/321439.321449

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

✍ Waksman, Abraham 📂 Article 📅 1968 🏛 Association for Computing Machinery 🌐 English ⚖ 271 KB

In this paper the construction of a switching network capable of n !-permutation of its n input terminals to its n output terminals is described. The building blocks for this network are binary cells capable of permuting their two input terminals to their two output terminals. The number of cells us

A fault-tolerant rearrangeable permutati

A fault-tolerant rearrangeable permutation network

✍ Yang, Y.; Wang, J. 📂 Article 📅 2004 🏛 IEEE 🌐 English ⚖ 784 KB

A new self-routing permutation network

✍ Wang-Jiunn Cheng; Wen-Tsuen Chen 📂 Article 📅 1996 🏛 IEEE 🌐 English ⚖ 805 KB

The KR-Benes network: a control-optimal

The KR-Benes network: a control-optimal rearrangeable permutation network

✍ Rajgopal Kannan 📂 Article 📅 2005 🏛 IEEE 🌐 English ⚖ 832 KB

A fast VLSI-efficient self-routing permu

A fast VLSI-efficient self-routing permutation network

✍ Cam, H.; Fortes, J.A.B. 📂 Article 📅 1995 🏛 IEEE 🌐 English ⚖ 610 KB

Characterizing bit permutation networks

✍ Chang, Gerard J.; Hwang, Frank K.; Tong, Li-Da 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 129 KB

In recent years, many multistage interconnection networks using 2 1 2 switching elements have been proposed for parallel architectures. Typical examples are baseline networks, banyan networks, shuffle-exchange networks, and their inverses. As these networks are blocking, such networks with extra sta