CAN Arbitration and Receiver Checks

CAN Arbitration and Receiver Checks

CAN arbitration and receiver checks narrated tour

Play silently with captions on provisional storyboard timing; narration audio is pending. Production pacing is not simulated protocol or network time. Choose Reduced motion for a complete still at each beat.

Play the tour to open the workbench. Pause, replay a beat, or read the full transcript below. Some situations cannot be shown by this teaching model; those beats provide captions only.

Full transcript — CAN arbitration and receiver checks (8 beats)

B1 — Gateway test
Imagine you are testing a gateway connected to a vehicle's shared bus. A safety command for the brakes starts at the same moment as a comfort update from the body controller. The stakes are concrete: the brake message must keep going while the competing sender yields.

Model caption: Gateway test: a brake safety command and a body-control comfort update start together.

B2 — Arbitration rule
The bus uses arbitration, meaning a decision about which sender continues. Each message has an identifier, and the senders compare those identifiers one bit at a time. A bit is a zero or a one. During arbitration, dominant zero overrides recessive one.

Model caption: Arbitration chooses a sender. Dominant 0 overrides recessive 1.

B3 — Fixed identifiers
For your test, the brake message has identifier two hundred eighty-eight. The body controller's comfort message has identifier two hundred ninety-six. Both use the standard format, with eleven identifier bits. The brake message has the lower identifier, but the bit comparison explains why it wins.

Model caption: Brake: 0x120 = 288. Body control: 0x128 = 296. Both identifiers use 11 bits.

B4 — Bit-eight decision
Starting from the beginning of the identifiers, the first seven bits match. At the eighth bit, the brake sender transmits zero and the body controller transmits one. Take the smaller of zero and one: zero. That is the bit carried by the shared bus.

Model caption: 288 → 00100100000; 296 → 00100101000. First seven bits match. At bit 8: A=0, B=1; minimum(0,1)=0.

B5 — Winner completes
The body controller sent one but reads zero, so it loses arbitration and stops transmitting. It becomes a receiver. The brake sender continues with its message intact. The body controller can retry after the winning frame finishes. Losing arbitration has allowed the safety command to continue.

Model caption: Body control sent 1, read 0, and yielded. Brake continues intact; body control can retry after completion.

B6 — Nondestructive arbitration
The misconception is that losing arbitration means a corrupted frame. It fails because the losing sender yields without damaging the winner's message. In the worked example, the comfort message stopped at the eighth identifier bit, while the brake message kept going. That is nondestructive arbitration.

Model caption: Arbitration loss: body control yields at bit 8; the brake frame remains intact.

B7 — Receiver rejects frame
A corrupted frame takes a different path. When the receiver's check disagrees with the check sent in the frame, the receiver sends an error flag. The frame is not accepted, and transmission must be tried again later. That differs from letting the brake message finish intact.

Model caption: Receiver check disagrees: error flag, frame rejected, transmission tried again later. Arbitration had already chosen the brake sender.

B8 — Arbitration and acceptance
Arbitration chooses whose message continues; a failed receiver check means the frame cannot be accepted.

Model caption: Arbitration chooses whose message continues; a failed receiver check means the frame cannot be accepted.

Back to the chapter