DocumentCode :
775430
Title :
A Simple Algorithm for the Control of Rearrangeable Switching Networks
Author :
Jajszczyk, Andrzej
Author_Institution :
Institute of Electronics, Technical Univ. of Poznan, Poland
Volume :
33
Issue :
2
fYear :
1985
fDate :
2/1/1985 12:00:00 AM
Firstpage :
169
Lastpage :
171
Abstract :
A simple algorithm for the control of rearrangeable switching networks 
is given. This algorithm makes it possible to compute the switch settings that implement a given Permutation. The algorithm takes serial time 
and consists of one phase, i.e., it does not require iterations. The version of the algorithm which can be used for group switching is also presented.
is given. This algorithm makes it possible to compute the switch settings that implement a given Permutation. The algorithm takes serial time and consists of one phase, i.e., it does not require iterations. The version of the algorithm which can be used for group switching is also presented.Keywords :
Communication switching; Switching, communication; Communication switching; Communications Society; Matrix decomposition; Multiprocessing systems; Neural networks; Switches; Telephony;
fLanguage :
English
Journal_Title :
Communications, IEEE Transactions on
Publisher :
ieee
ISSN :
0090-6778
Type :
jour
DOI :
10.1109/TCOM.1985.1096266
Filename :
1096266
Link To Document :
