✦ LIBER ✦

Optimal permutation routing for low-dimensional hypercubes

✍ Scribed by Ambrose K. Laing; David W. Krumme

Publisher: John Wiley and Sons
Year: 2009
Tongue: English
Weight: 244 KB
Volume: 55
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.20325

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Rearrangeable Circuit-Switched Hypercube

Rearrangeable Circuit-Switched Hypercube Architectures for Routing Permutations

✍ S.B. Choi; A.K. Somani 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 496 KB

Rearrangeable hypercube architectures and routing algorithms are developed to realize arbitrary permutations in circuit switching. We prove that if each connection between two neighboring nodes consists of two pairs of links (two full-duplex communication lines), the hypercube can handle two arbitra

Automatic dimensional synthesis without

Automatic dimensional synthesis without optimization for stepped impedance low-pass filters

✍ M. Simeoni; S. Cacchione; F. Vanin; J. Molina-Perez; D. Schmitt 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 198 KB

interface and a vertical electric dipole (VED) source were considered. The reflected field was obtained from a reflection-image source, which is the same as the case when a Veselago medium is replaced by a corresponding regular medium with positive medium parameters. The transmission-image problem c