Rearrangeability of multistage shuffle/exchange networks

DOI10.1109/26.7531zbMath0657.94025OpenAlexW2012950107MaRDI QIDQ3807135

Anujan Varma, Cauligi S. Raghavendra

Publication date: 1988

Published in: IEEE Transactions on Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/26.7531

zbMATH Keywords

outputsrearrangeabilityinputsperfect shuffle permutationshuffle/exchange stages

Mathematics Subject Classification ID

Applications of graph theory to circuits and networks (94C15)

Related Items (4)

A new policy to solve routing conflicts in shuffle-exchange networks ⋮ A lower bound for sorting networks based on the shuffle permutation ⋮ On the construction of balanced matrices ⋮ Analyzing permutation capability of multistage interconnection networks with colored Petri nets

This page was built for publication: Rearrangeability of multistage shuffle/exchange networks