×

Bitwise arbitration on a serial bus using arbitrarily selected nodes for bit synchronization

  • US 7,769,932 B2
  • Filed: 09/09/2005
  • Issued: 08/03/2010
  • Est. Priority Date: 09/09/2005
  • Status: Active Grant
First Claim
Patent Images

1. A method of communicating between a plurality of nodes coupled via a serial data bus so that simultaneous transmission on the bus of a dominant state by at least one of the nodes and a recessive state by the other nodes results in the dominant state being detectable on the bus, the method comprising:

  • repeatedly transmitting onto the bus for each bit of a message, a transition from a first state to a second state from a node arbitrarily selected from the plurality of nodes,wherein the first and second states are complementary states selected from the dominant and recessive states, wherein the arbitrarily selected node is defined as the bit master;

    transmitting onto the bus a dominant or recessive state from one or more of the nodes at a first predetermined time after each transition, the transmitted state representing a respective dominant or recessive bit of the message;

    detecting, at the one or more nodes, a sensed dominant or recessive state of the bus at a second predetermined time after each transition, the sensed dominant or recessive state representing the respective dominant or recessive bit of the message;

    ceasing transmission of the message by any of the one or more nodes that transmits the recessive state at the first predetermined time and detects the dominant state at the second predetermined time;

    for each node of the plurality of nodes, measuring a timeout value between successive transitions from the first state to the second state onto the bus as transmitted by the bit master; and

    if the timeout value exceeds a predetermined value, repeatedly transmitting onto the bus a transition from the first state to the second state by a second node arbitrarily selected from the plurality of nodes that are not presently defined as the bit master, wherein the second arbitrarily selected node is thereafter defined as the bit master.

View all claims
  • 3 Assignments
Timeline View
Assignment View
    ×
    ×