Foundations — CAN bus — frame format, arbitration, error handling — critical in aerospace

This page assumes you know nothing. We will name every symbol, draw the picture behind it, and only then let it appear in the main topic. Read top to bottom; each idea is a brick for the next.

1. A "bit" — the smallest thing on the wire

Picture it: a light switch. Down = 0, up = 1. A wire carrying a bit is a switch someone is holding in one position for a slice of time.

Why the topic needs it: CAN sends messages as a long stream of these switch-positions, one after another in time. Before we can talk about frames or IDs, we must agree that the wire, at each instant, is showing exactly one of two symbols.

2. Dominant and recessive — CAN's two special names for 0 and 1

The CAN designers gave the two bit-states nicknames, because on this wire the two states are not equal in power.

Picture it (figure above): think of a rope everyone holds. Recessive = let the rope float up (that's the relaxed state). Dominant = one strong person yanks it down. One yank beats any number of relaxers — the rope goes down.

Why the topic needs it: this inequality is the entire mechanism of arbitration. A "polite" state (recessive) that anyone can override with a "loud" state (dominant) is what lets nodes compete without a referee.

3. The AND operation — the rule that combines everyone's bit

Now we need the exact rule for what the wire shows when several nodes push different bits at the same instant.

$0\wedge 0=0,0\wedge 1=0,1\wedge 0=0,1\wedge 1=1$

Picture it (figure above): a row of switches wired in series to a lamp. The lamp lights (result 1) only if every switch is closed (1). Open even one switch (a single 0) and the lamp is dark (0). One 0 kills the whole chain — that is exactly $\wedge$.

Why this exact tool, not OR or XOR? We want a rule where a single node can force the outcome by itself, using the quiet action of "not pushing". AND is the unique operation where one 0 decides everything and the "default" (all 1s) needs unanimous agreement. That maps perfectly onto "one dominant bit wins".

Why the topic needs it: every clever behaviour of CAN (arbitration, the collective ACK, error flags) is just this one formula applied to different fields of the message.

4. Reading numbers written in binary

The message priority is a number, but written as bits. You must be able to read that notation.

Picture it: columns like place-value in decimal, but doubling instead of ×10:

$\underset{8}{\underbrace{1}}\underset{4}{\underbrace{0}}\underset{2}{\underbrace{1}}\underset{1}{\underbrace{1}}=8+0+2+1=11$

So 0b1011 $=11$.

Why the topic needs it: an ID like 0b00010110000 is compared bit by bit from the MSB. Reading MSB→LSB is exactly the order arbitration happens, and leading zeros (which are dominant bits!) are what make a number "win early".

5. Sending bits over time — a bitstream and its clock

Picture it (figure above): a strip of equal-width boxes moving past a reader. Each box holds one bit. If two people read the strip but disagree on box-width, they read different messages — so a shared sense of timing (a "clock") is essential. See Bit stuffing and clock recovery for how CAN keeps everyone aligned using edges in the stream.

Why the topic needs it: arbitration compares bits at the same instant across nodes. That only works if everyone marches to the same bit-time grid.

6. Comparison and "reading back" — the symbols $=$, $\ne$, $\le$, $>$

The whole cleverness of a node is: "I sent one thing — did the wire agree?"

Picture it: two sticky notes side by side. $=$ if they match, $\ne$ if they differ. For $\le$ and $>$, imagine a marked ruler with a threshold line; a value sits below-or-on it ($\le$) or above it ($>$).

Why the topic needs it:

• A node checks "bit I sent $\ne$ bit on bus?" → if a node sent recessive (1) but reads dominant (0), that mismatch tells it to back off (arbitration) or flags an error.
• The fault-confinement counters use $\le 127$, $>127$, $>255$ as thresholds. Those symbols are just fences: below the fence = healthy, above = punished.

7. Counters — a number that goes up and down

Picture it: a tally scoreboard. Every foul you cause while talking adds 8 points; every clean moment subtracts 1. Cross point 127 → benched to a quiet mode; cross 255 → you sit out entirely (Bus-Off).

Why the topic needs it: this is how CAN isolates a broken node by itself, without any central authority — the same "no referee" spirit as arbitration, applied to errors.

8. CRC — a checksum, in one sentence

Picture it: a fingerprint of the message. Change any bit and the fingerprint almost certainly changes, so a mismatch shouts "damaged!". Full details live in CRC cyclic redundancy check.

Why the topic needs it: it is one of CAN's five error guardians — the one that catches bits that got flipped by noise after they were sent correctly.

Prerequisite map

This whole page feeds the parent: the CAN bus topic. Related buses that share the wired-AND idea: Open-collector buses, Wired-AND logic. The opposite philosophy (collisions destroy data) is CSMA-CD (Ethernet). Where CAN meets aerospace rules: ARINC 825, DO-178C / DO-254 aerospace certification, and Real-Time scheduling.

Equipment checklist

Self-test: can you answer each before revealing?