Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
