We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

On Neiman's Algorithm for the Control of Rearrangeable 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
$31 $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)
Tsao-Wu, N. ; Bell Telephone Labs., Denver, CO, USA

Modifications to the first phase of Neiman's algorithm to control the rearrangeable switching networks (RSN) are presented. This algorithm is not limited to networks composed of (2 × 2 )switches. These modifications result in lowering the upper bound on the number of iterative steps which must be performed in the second phase of Neiman's algorithm. An example is given to show that this bound is tight. With RSN's of base 2 structure, the modified Neiman's algorithm is seen to be equivalent to the looping algorithm previously studied. It is also pointed out that the interpretation of the control for RSN as a matrix decomposition can have some practical significance which could increase the efficiency in switch rearrangements. The modified algorithm was implemented with a minicomputer, and a typical printout appears in the Appendix.

Published in:

Communications, IEEE Transactions on  (Volume:22 ,  Issue: 6 )