Abstract: An arbitration technique for controlling access to a bit-serial bus by multiple nodes in a data processing network. Upon detection of no carrier on the bus (56), a node desiring access to the bus waits a predetermined number of quiet slots (60, 64), each slot being a predetermined interval. If that period elapses without another node's carrier being detected (64), the node desiring access is permitted to transmit (64, 68). For each node, two such delay-interval possibilities are provided, one high slot count (and, hence, low priority) and one low slot count (and, hence, high priority). The delay-interval selection for a node is switched from time to time on a round-robin basis so that all nodes get equal average priority. The high value of the delay interval is N+M+1 slots, where N is the node number and M is the maximum number of nodes allowed on the bus; the low value is N+1 slots. Initially, each node uses the former value.

Abstract: An interface circuit (10) for coupling a parallel data device (12) to a serial data channel (14, 16) over which Manchester-type codes are transmitted. In the interface circuit, an efficient and reliable Manchester decoder (22), comprising a flip-flop (50), an exclusive-or gate (52), and at least one delay line (58A or 58B) separates the data and clocking signals. The serial data signals are clocked into a serial register (30) under control of the external clocking signals from the channel. A carrier detector (24) enables the serial register only when valid information signals are present. A parallel data register (40) receives in parallel the data from the serial data register. To get in phase the external clocking signals with the internal clock source, an internal clock synchronizing circuit (34, 42) recycles the internal clock source upon the occurrence of a synchronizing character that is transmitted over the serial data channel.