HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

Digraph Isomorphisms and Free Space Optical Networks

David Coudert 1 Afonso Ferreira 1 Stéphane Pérennes 1
1 SLOOP - Simulation, Object Oriented Languages and Parallelism
CRISAM - Inria Sophia Antipolis - Méditerranée , Laboratoire I3S - COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
Abstract : The de Bruijn digraph B(d,D) is usually defined by words of size D on an alphabet of cardinality d, through a cyclic left shift permutation on the words, after which the rightmost symbol is changed. In this paper, we show that any digraph defined on words and alphabets of the same size, through an arbitrary permutation on the alphabet and an arbitrary permutation on the word indices, is isomorphic to the de Bruijn, provided that this latter permutation is cyclic. As an application, we recall that it is known that the Optical Transpose Interconnection System from UCSD can implement the de Bruijn interconnections for n$ nodes, for a fixed d, with O(n) lenses. We show here how to improve this hardware requirement to $\Theta(\sqrtn)$.\\
Document type :
Complete list of metadata

Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Wednesday, May 24, 2006 - 11:04:45 AM
Last modification on : Friday, February 4, 2022 - 3:20:07 AM
Long-term archiving on: : Sunday, April 4, 2010 - 11:24:49 PM


  • HAL Id : inria-00072841, version 1



David Coudert, Afonso Ferreira, Stéphane Pérennes. Digraph Isomorphisms and Free Space Optical Networks. [Research Report] RR-3817, INRIA. 1999. ⟨inria-00072841⟩



Record views


Files downloads