A free road research procedure of a switching network. (Machine-translation by Google Translate, not legally binding)

摘要

A free path research procedure in a switching network between a given input conductor and any one of the output conductors of that network, the network of the genre comprising matrixes of switches arranged according to several stages in cascade and connection conductors between the matrices of the different stages, network in which each line or column conductor of a matrix can be characterized by an address of several coordinates corresponding respectively to the order number of the conductor in its matrix (the lowest range), of the matrix in a subgroup of matrices, of the subgroup in a group of matrices, etc. and the topographic structure of the network being such that the directions of a given input conductor and output conductor completely define the connection conductors and the switches to be used to electrically connect these two conductors, a procedure essentially characterized in that all the relationships existing between the respective coordinates of two pairs each formed by an input conductor and an output conductor for each case of interference are established once and for all, each of these relationships defining the level where the interference occurs , the addresses of all the pairs of input conductors and output conductors corresponding to the already established paths are stored in a memory, and because it is associated with the address of said input conductor given the direction of the output conductor whose coordinates have the lowest values, the respective coordinates of the pair of addresses thus formed with the corresponding coordinates of each pair of addresses in the memory, in the increasing order of the directions of the output conductors, until one of said relations is satisfied, in which case the direction of the output conductor is determined whose coordinates have the lowest values to associate with that of the given input conductor to suppress the interference, and the new pair of addresses thus formed is compared with the next pair of addresses in memory, and so on until it is determined whether there is no possible way, whether there is no possible interference, in which case the given driver is definitively attributed to the given output driver whose address corresponds to the last address associated with that of the input driver in the course of the investigation. (Machine-translation by Google Translate, not legally binding)