- 1. Introduction
- 2. CAN Communication
- 3. CAN Framing
- 4. CAN Bus Access
- 5. CAN Data Protection
6. CAN FD
- Advantages and Consequences
- New Types of Frames
- Details of a CAN FD Frame
- Distinguishing CAN from CAN FD Frames
- Compatibility of CAN and CAN FD Controllers
- Accelerated Transmission
- Indicating too many Errors
- Length of the Data Field
- More Data with the same Security
- Changed Rules for Bit Stuffing and CRC Calculation
Bitwise Bus Arbitration
The key component of the bus access method defined by ISO 11898-1 is bitwise bus arbitration. It prevents collisions from occurring despite simultaneous bus access. The principle of bitwise bus arbitration is relatively simple.
Unique bus level
After network-wide synchronization, all CAN nodes wishing to send place their identifier of the CAN message bitwise onto the CAN bus, from most significant to least significant bit. In this process, the wired-AND bus logic upon which the CAN network is based ensures that a clear and distinct bus level results on the bus.
Finally, the arbitration logic decides whether a CAN node may continue to send, or whether it must stop sending. The interactive figure “Bus Access Logic” helps you to become more familiar with the mechanisms underlying bitwise bus arbitration.
One sender at a time
At the end of the arbitration phase, the CAN node transmitting the CAN message with the lowest ID gets authorization to send. CAN nodes with lower priority messages switch to the receiving state, later they access the CAN bus for another sending attempt as soon as it is available again. The figure “Bus Access Procedure” depicts all actions of a CAN node in the context of bus access.
You can use the “Bitwise Bus Arbitration” simulation to deepen your knowledge of bus access in the CAN network. The simulation is based on a CAN network consisting of three nodes wishing to send. You can set the identifiers for the CAN messages to be sent by the three CAN nodes yourself.