High capacity time connection networks
AssigneeSociete Anonyme de Telecommunications
InventorJacques Henri Provendier
Life of this patent
Estimating the term…
Abstract
A time connection network of the kind comprising p switching units having each an input buffer store and an output buffer store, and a space stage to transmit digital information in form of words or groups of n binary digits from one input buffer store toward one output buffer store at a rate of one word per digit time slot. The information signals, read in an input buffer store, are conveyed serially through the space stage together with a clock signal at the rate of the serial transmission and a rectangular signal having a period preferably of two words. The information and clock signals are then distributed in two paths by means of the rectangular signal. The information signals are de-serialized on each path and then multiplexed to an output buffer store.
Claims1
A time connection network of the kind comprising p switching units having each an input buffer store and an output buffer store, and a space stage to transmit digital information in form of words or groups of n binary digits from one input buffer store toward one output buffer store at a rate of one word per digit time slot, comprising means for serially transmitting the information signals read in an input buffer store, means for transmitting clock signals at the rate of said series transmission, means for generating a rectangular signal having a period of m words, preferably of two words, means for distributing information signals and clock signals in two paths A and B, one path being gated by the leading edges of said rectangular signal and the other path by the trailing edges of the same signal, means for serial-to-parallel converting the information signals controlled by said clock signals, means for re-phasing the transmitted signals, controlled by said rectangular signal, serial-to-parallel conversion and re-phasing being carried out in each path, and means for multiplexing signals from paths A and B and transmitting them to an output buffer store.
Dependencies are inferred from the claim text.