By Topic

Optimal Structures of Benes' Switching Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
A. Jajszczyk ; Tech Univ of Poznan, Poland

The class of switching networks, composed of stages of identical square switches arranged symmetrically around a center stage (Benes' networks), is considered. The synthesis problem of selecting from this class a rearrangeable network with the minimum number of crosspoints is solved. Benes' approach, (using relation of covering), is taken into consideration. The new structures of the networks are in some cases different than those already known. Modifications of Benes' theorems result in lowering the number of stages of a switching network with the minimum number of crosspoints. This lowering can bear some practical significance, which could simplify the control devices. A model comparison is given of the known and new results.

Published in:

IEEE Transactions on Communications  (Volume:27 ,  Issue: 2 )