SOME GROUP THEORETIC RESULTS TOWARDS A LINEAR-TIME SET UP ALGORITHM FOR BENES NETWORKS.

John Carpinelli, A. Yavuz Oruc

Research output: Contribution to conferencePaperpeer-review

Abstract

An open problem about Benes networks deals with setting them up for a permutation in less than O(nlgn) steps. The paper considers the problem within the framework of group theory and provides results that may ultimately lead to a linear set up time for such networks. More specifically, we establish a firm relation between Benes networks, and coset and double coset decompositions of symmetric groups. This relation then leads to the elimination of some combinations of switch settings as possible solutions. We also discuss how these decompositions may be used to factor arbitrary permutations into the generic permutations of Benes networks.

Original languageEnglish (US)
Pages563-567
Number of pages5
StatePublished - Dec 1 1986
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Engineering(all)

Fingerprint Dive into the research topics of 'SOME GROUP THEORETIC RESULTS TOWARDS A LINEAR-TIME SET UP ALGORITHM FOR BENES NETWORKS.'. Together they form a unique fingerprint.

Cite this