 Computer system capable of connecting expansion unit |
| It is an object of the present invention to provide a computer system capable of connecting an ... |
|
| Device and method for providing a simulation of an idle UART to prevent computer lockup |
| OF A PREFERRED EMBODIMENT The present invention prevents an operating system such as Windows.RTM. 9... |
|
| Low-power consuming information processing apparatus |
| It is an object of the first embodiment to solve the above-described conventional problems and ... |
|
| Power management process |
| The underlying concept of the invention is to subtract the torque (or power) required to drive the ... |
|
| Method and apparatus for selecting nodes in configuring massively parallel systems |
| To address the requirements described above, the present invention discloses a simplified method, ... |
|
| System and method for reduced network information handovers |
| The present invention is directed to a system and method for reducing or eliminating the ... |
|
| System and method for providing multimedia quality of service sessions in a communications network |
| According to the present invention there is provided a system and method for effecting multimedia ... |
|
|
Asynchronous digital time-division multiplexing system with distributed bus
| Details |
Inventors: Chomel, Denis; Devault, Michel; Le Bris, Herve; Rouaud, Yvon;
Assignee:
Primary Examiner: Safourek; Benedict V.
Assistant Examiner: Chin; Wellington
Attorney, Agent or Firm: Laubscher, Presta & Laubscher
The system comprises a first unidirectional packet bus having a bit rate D, each packet including an e-bit identifier and a b-bit package, sources having differing bit rates d.sub.i such that d.sub.m .ltoreq.d.sub.i .ltoreq.d.sub.M <D, and access means for introducing packets from the sources into the first bus. An allocator located at the receiving end of the first bus builds up frames of identifiers identifying active sources. Each frame has a length T=b/d.sub.m and is shared into N=d.sub.M /d.sub.m time slots. Each time slot has a period .theta.=b/d.sub.M and includes a source identifier. The identifier for a same active source having a bit rate d.sub.i is repeated in the frame n.sub.i times such that n.sub.i =d.sub.i /d.sub.m when d.sub.i /d.sub.m is an integer, or such that n.sub.i =1+ integer part of (d.sub.i /d.sub.m) otherwise. The identifier frames are transmitted from the allocator into a second unidirectional bus distributed to all the access means. The access means of each source transmits a packet in the first bus whenever a b-bit package delivered from the source is received and an identifier of the source is detected in the second bus after package reception. |
|
DETAILED DESCRIPTION What we claim is: 1.
An asynchronous digital time-division multiplexing system, comprising (a) plural data sources each having active and inactive states and being identified by respective identifiers, each active source supplying data bits with a corresponding bit rate, and said corresponding bit rates of said active sources being different therebetween; (b) plural access means associated with said data sources, respectively, for linking each associated data source to an identifier bus and to a packet bus, each access means transmitting a packet into said packet bus in response to each identifier of said associated data source detected on said identifier bus, and each transmitted packet consisting of said identifier and a group of data bits delivered by said associated data source; and (c) allocating means linked to said identifier bus for constituting identifier frames and transmitting said frames into said identifier bus; and wherein (d) each said identifier frame has a determined length and is composed of said identifiers corresponding to said active sources; and (e) each identifier is repeated in said identifier frame a number of times approximately proportional to said bit rate of said active source corresponding to said identifier.
2.
The system defined in claim 1, wherein said data sources have bit rates between a minimum bit rate d.
sub.
m and a maximum bit rate N.
d.
sub.
m less than a predetermined bit rate D of said packet bus, where N is an integer, each identifier frame has a length equal to b/d.
sub.
m and is split into N time slots, where b is a number of bits of said data bit group, each time slot has a period equal to b/(N.
d.
sub.
m) and includes one identifier, and further wherein each identifier has a bit rate d.
sub.
i and is repeated in said frame n.
sub.
i times such that n.
sub.
i =d.
sub.
i /d.
sub.
m and n.
sub.
i =l+(integer part of (d.
sub.
i /d.
sub.
m)) when d.
sub.
i /d.
sub.
m is equal to and different from an integer, respectively.
3.
The system defined in claim 2, wherein said length of each frame time slot is equal to (e+b)/D increased by an amount equal to twice a bit propagation time in said identifier and packet buses between one of said access means nearest said allocating means and one of said access means farthest from said allocating means, where e is a number of bits of said identifier
|
|
I/O Systems 
