IP Library Granted Patent US 12701030
Granted Patent B2
US 12701030 · App. 18/355,759 · Granted Aug 4, 2026

Protocol for autoconfiguration of communication network

Inventors: Raik Frost (Erfurt, DE); Thomas Freitag (Erfurt, DE); Michael Frey (Erfurt, DE); Heiko Leutert (Erfurt, DE)
Assignee: MELEXIS TECHNOLOGIES NV
H04L12/40078G06F13/4247H04L12/40H04L12/40013H04L41/0886H04L61/5038H04L69/26H05B47/18H05B47/199G06F2213/0052
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12701030
App. No.
18/355,759
Granted
Aug 4, 2026
Kind
B2
Abstract

A method for autoconfiguration of a plurality of nodes in a linear network allows extracting the address and position of each node. The method includes applying an identifier field for transmitting to the bus the bit sequence of the identifier of a chosen node. Then for at least for the first node to the last but one node, a field comprising a predetermined bit sequence is applied. The field comprises dominant bits, so a current is transmitted. Then, a further field is applied for transmitting any stored direction bit associated to that node and obtained in any previous iteration. The iteration continues by choosing a node different from a node chosen in any previous cycle, starting the communication, until all nodes are identified.

Claims (16)

1 . A method of autoconfiguration of a plurality of nodes connected via a bus forming a linear network, each node being identified by an identifier comprising an identifier bit sequence, the identifier being unique for each node connected to the linear network, the method comprising interchanging, in each iteration cycle, a data frame including a frame bit sequence between the plurality of nodes, the frame bit sequence being divided in fields of consecutive bit strings, the iteration cycle comprising:

applying an identifier field for transmitting to the bus the identifier bit sequence of the identifier of a chosen node,

at least for the first node to the last but one node, applying a field comprising a predetermined bit sequence comprising dominant bits for transmitting a current to the bus from the chosen node, allowing reading a direction of the current through at least each remaining node of the plurality that was not previously chosen, wherein the reading is performed by said remaining node, the direction being represented by a value of a bit being a direction bit, thus allowing storing a direction bit associated to a position of the chosen node relative to said at least each node that was not previously chosen,

applying a further field for transmitting any stored direction bit associated to that node and obtained in any previous iteration,

performing a further iteration cycle of the three previous steps by choosing a node different from a node chosen in any previous cycle, and starting again a communication, until all nodes of the linear network are identified,

further comprising storing the direction bit obtained during each iteration cycle linked together with the identifier of the chosen node which transmits the current in said each iteration, further comprising determining a physical position of each node relative to the rest of nodes connected to the linear network, based on the stored direction bits obtained from the nodes and linked chosen nodes in each iteration cycle, wherein determining the physical position is performed by a plurality of nodes, further comprising comparing the physical position obtained by at least two nodes.

2 . The method of claim 1 wherein choosing a node further comprises applying each bit of the identifier of the nodes of the plurality simultaneously into the bus as a field in the data frame, wherein each bit has the same position in the respective identifier bit sequence, and performing arbitration on the bus.

3 . The method of claim 1 wherein the method is an autoconfiguration of a plurality of nodes connected via a bus, the bus being a differential bus, wherein interchanging a data frame including a frame bit sequence comprises interchanging the data frame by differential signaling.

4 . The method of claim 1 wherein reading the current through the bus comprises reading the current through a resistor shunting a first bus connection to the node and a second bus connection to the node, where the first bus connection and the second bus connection are connections to a same channel of the bus.

5 . The method of claim 1 further comprising broadcasting a header message as sequence of bits for initiating autoconfiguration.

6 . The method of claim 5 wherein a master node connected to the network bus initiates autoconfiguration by broadcasting the header message in a master-to-slave message frame.

7 . The method of claim 1 wherein the direction read in a node during an iteration cycle is stored as a direction bit in that node, wherein applying a further field for transmitting any stored direction bit further comprises transmitting any stored direction bit by the node to the bus when the node becomes the chosen node in an iteration cycle.

8 . The method of claim 7 wherein any stored direction bit is sent within a field with a dynamic size as a part of a slave-to-master communication frame, the size of the field being a number of direction bits transmitted to the bus.

9 . A node connectable to a linear network, the node comprising an identifier, the node being programmed to execute the method of claim 1 , wherein the current is read through a shunt resistor shunting two contacts to a same line of the bus of the linear network, wherein two or more nodes of the plurality are configured to execute the method and compare the determined physical position of each node in order to detect mismatches and restart the method of autoconfiguration.

10 . The node of claim 9 further comprising an integrated circuit as a programmable processing unit.

11 . The linear network of claim 9 , wherein the linear network is a differential network.