An algorithm is developed to control a class of rearrangeable switching networks, particularly with the base-2 structure. Various methods of implementing this algorithm are also described. System organization and processing time for rearranging the network are studied and are shown to be practical.
No takes yet. Share an insight, caveat, or question.
Opferman et al. (1971) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: