Bus Slave Registration via Arbitration Time Windows
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In bus communication systems, integrating multiple slaves simultaneously can lead to address allocation errors and data traffic disruptions, especially when slaves move between different areas of influence, requiring a method to efficiently register new slaves while minimizing interference with existing data traffic.
Innovation Solution
A registration method where the master maintains a list of registered slaves, uses time windows for arbitration sequences, and allows newly registering slaves to send arbitration elements, resolving collisions and enabling seamless integration during normal bus communication by utilizing existing processing time slots.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If multiple slaves are integrated into the bus system simultaneously with automatic addressing, then the integration speed is improved, but address allocation errors and collisions increase
Solution Approach 1:
The patent applies preliminary action by having new slaves send arbitration elements containing their identification information before the master assigns addresses. This preliminary transmission of slave identifiers allows the master to process and allocate addresses systematically, preventing collisions that would occur with simultaneous addressing of multiple slaves.
Solution Approach 2:
The patent introduces an intermediary mechanism in the form of arbitration elements that carry slave identification information. These elements act as mediators between the new slaves and the master, enabling the master to identify and address multiple slaves sequentially without direct simultaneous addressing, thus avoiding allocation errors.
2Productivity
If time windows are kept free in the chronological sequence of master calls and slave responses, then new slaves can be registered during normal bus communication, but the complexity of coordinating arbitration sequences increases
Solution Approach 1:
The patent applies periodic action by creating regular time windows within the existing master call and slave response cycle. These periodic time windows provide predictable opportunities for new slaves to transmit arbitration elements without disrupting the regular bus communication rhythm, allowing registration to occur systematically during normal operation.
Solution Approach 2:
The patent segments the bus communication timeline by dividing it into distinct time windows separated from master calls and slave responses. This segmentation creates dedicated intervals for arbitration element transmission, organizing the complex coordination into manageable, structured segments that reduce overall system complexity.
3Loss of time
If arbitration elements are transmitted in time windows during normal bus communication, then registration delay is reduced, but data traffic disruptions may occur
Solution Approach 1:
The patent maintains continuity of useful action by integrating the arbitration element transmission into the existing bus communication cycle rather than creating separate registration phases. The time windows for arbitration are embedded within the continuous flow of master calls and slave responses, ensuring that bus communication remains ongoing without interruption while new slaves register.
Solution Approach 2:
The patent applies skipping by having new slaves transmit their arbitration elements rapidly during the brief time windows available, completing the registration-critical transmission quickly. This rushed transmission through designated intervals minimizes the time arbitration occupies the bus, reducing potential disruptions to data traffic while ensuring registration occurs without delay.
Data Source
AI summary
For a registration method for an as yet unregistered slave (Neu1, Neu2, Neu3, Neu4) in a bus system (9, 10) with at least one master (M1, M2) and already registered slaves (SL1, SL2, SL3) it is proposed to interrupt data exchange in normal operation in the chronological sequence (22) of master calls (11) and slave responses (12) within time windows (23), wherein, in the time windows (23), each of the as yet unregistered slaves (Neu1, Neu2, Neu3, Neu4) transmits an arbitration element (21) of the individually assigned arbitration sequence (20), and to enter the as yet unregistered slave (Neu1, Neu2, Neu3, Neu4) which has won the arbitration procedure into the list (19) of already registered slaves (SL1, SL2, SL3).