On Rearrangeable Three-Stage Connecting Networks

1962191 citationsJournal Article

Authors

Abstract

A class of three-stage connecting networks proven rearrangeable by D. Slepian is considered. Bounds on the number of calls that must be moved are obtained by some simple new methods.

Topics & Keywords

Cellular Automata and Applications Interconnection Networks and Systems Cooperative Communication and Network Coding

Publication Details

Published in: Bell System Technical Journal

Volume 41, Issue 5, pp. 1481-1492

DOI: 10.1002/j.1538-7305.1962.tb03990.x

Field-Weighted Citation Impact: 2.79

Command Palette

On Rearrangeable Three-Stage Connecting Networks

Authors

Abstract

Topics & Keywords

Publication Details