DE10215990B4 - Method for determining the identification numbers of subscribers in a hierarchical bus system - Google Patents

Abstract

method for determining the identification numbers (IDs) of subscribers (A, B, C, D) in a hierarchical bus system, in particular in an EIB installation, with at least one segment and at least a parent Instance (Master, LC), whereby the at least one higher-level entity (Master, LC) by querying the identification numbers (IDs) of the participants (A, B, C, D) determined in this segment, the query by a broadcast query (broadcast) takes place, which is a predefinable structure involving different participants (A, B, C, D) allows is to specifically respond to this broadcast query, characterized that the predeterminable structure is a fixed structure and each participant (A, B, C, D) the low part of its integer division identification number (for example, div14) and derives from the result of integer division (Integer value) determines its time window (slot) independently for its response, wherein the bus access method operates according to the CSMA / CA method.

Description

The The invention relates to methods for determining the identification numbers of subscribers in a hierarchical bus system, in particular in an EIB installation, with at least one segment and at least one parent Instance, wherein the at least one parent instance by Query the identification numbers of the subscribers in this segment determined.

Around in a bus system existing participants to be determined, is at a known method with the identification number (address) of every possible one Participant, so with each participant would have to be present, one Attempting to establish a connection (TCONNECT). The targeted explicit Query of the participants by the higher-level instance will - if so the first query was not answered - for each participant several times, for example up to three times, repeated. If after the last repetition the query still receives no response from the parent instance, the participant is classified as non-existent.

He follows but an answer, then the connection between the parent Instance and the participant concerned (Mask Version Read). After the complete Establishment of the connection is closed again (TDISCONNECT) and the participant from the parent Instance registered as existing.

Since all theoretically possible addresses must be queried in this method, this method is correspondingly time-consuming. With a 16-bit frame (FFFF _h , 2 ¹⁶ possible addresses), the time required is more than one hour.

In the US 4,730,251 A method is described for determining the identification numbers of subscribers in a hierarchical bus system with at least one segment and at least one higher-level instance. The at least one higher-level entity determines by querying the identification numbers of the subscribers in this segment. The query is made by a broadcast query, which includes a predeterminable structure. This allows different subscribers to respond specifically to this broadcast poll.

task The present invention is to provide a method in the time required to determine the identification numbers of Participants in a hierarchical bus system is significantly reduced.

The The object is achieved by a Method solved with the features of claim 1. An advantageous embodiment The invention is the subject of claim 2.

The The method of claim 1 is used to determine the identification numbers of subscribers in a hierarchical bus system, in particular in an EIB installation, with at least one segment and at least a parent instance, the at least one parent instance by querying the identification numbers of the participants in this Segment determined. According to the invention the query by a broadcast request (broadcast), which is a predefinable Structure, preferably a mathematical structure, includes which allows different participants to target these Broadcast query to answer. The predeterminable structure is a solid structure and each subscriber submits the low part of his identification number an integer division (eg div14) and determines itself independently the result of integer division representing an integer value his time slot for his Answer, wherein the bus access method according to the CSMA / CA method (Carrier Sense Multiple Access with Collision Avoi dance - Multi-Access Carrier Recognition and collision avoidance) works.

at the method according to the invention becomes the usual one Request / Response mechanism for the selective selection of participants is not required. Thereby allows the inventive method the automatic determination of the bus system assigned to the participants Identification numbers. This is the determination of the participants in any size Bus system easily possible.

The The method of claim 1 is also throughout the system parallelizable, resulting in a very short time for the determination the identification numbers. In addition, the method according to the invention also for them Parameterization can be used.

following become two embodiments the invention explained in more detail with reference to the drawing. Show it:

1 a constellation in a bus system, wherein identified with a first embodiment of the method identification numbers of participants of the bus system become;

2 a constellation in a bus system, being determined with a second embodiment of the method identification numbers of participants of the bus system.

1 and 2 each show as a hierarchical bus system an EIB installation (European Installation Bus). The EIB installation has a line coupler LC, which is responsible as a higher-level instance (master) in a segment for a predeterminable number of subscribers A, B, C, D. The subscribers are for this purpose coupled via a line L with the line coupler LC.

In the EIB installation according to 1 has the line coupler LC, which is assigned as a subscriber to an area coupler, not shown, the identification number 1.1.00. Furthermore, all the line coupler LC associated participants A, B, C, D have different identification numbers (physical addresses). The subscriber A has the identification number 1.1.03, the subscriber B the physical address 1.1.07, the subscriber C the identification number 1.1.08 and the subscriber D the physical address 1.1.64. Furthermore, all subscribers A, B, C, D support a polling performed by the line coupler LC.

The determination of the identification numbers (physical addresses) of the participants takes place in the in 1 shown embodiment according to the master-slave principle.

Master may be a new line coupler LC, a BCU 2 (Bus Coupling Unit Version 2) or the like. The master, in the illustrated embodiment, the line coupler LC, as long as polls (until) in the whole polling frame only values are equal to 0FE _h (= 254). The line coupler LC (Master) collects the values and stores them in a 256-bit field (Property). All empty bits could be devices (BCU 1 - Bus Coupling Unit Version 1) that do not support polling. In these cases, the address search is performed according to TCONNECT (point-to-point oriented connection establishment) and TDISCONNECT.

The slaves are at the in 1 each of the participants A, B, C, D detects a collision in its time slot and repeats until it could send its value.

All Inquiries of the line coupler LC [in the present case the requests 1.) to 4.)] have the fixed (constant) structure "F0 1100 0000 0E CRC", the 14th Time window (0th to 13th slot), in which the answers of the participants A, B, C, D are written with the stuffing bytes "FE" of the Line coupler LC filled are.

In the example shown, each of the subscribers A, B, C, D leads from the low part 03 _h or 07 _h or 08 _h or 064 _h (= 100) of its physical address (identification number) an integer division with 14 (div14 value ) by. In the present case, an integer division with 14 integer values from 0 to 7, by means of which all subscribers A, B, C, D independently determine their time slots for their responses (return values).

The Responses of the participants A, B and C are exclusively in 0. Slot sorted because the respective integer divisions each give the value "0".

In the illustrated embodiment, the logic "0" is dominant over the logic "1", so "0" overrides "1". In the case of collision avoidance, therefore, subscriber C (low part 08 _h = 8 = 1000 ₂ ) is placed opposite to subscriber A (low part 03 _h = 3 = 0011 ₂ ) and this compared to subscriber B (low part 07 _h = 7 = 0111 ₂ ) by [CSMA / CA (Carrier Sense Multiple Access with Collision Avoidance) methods. The answer from subscriber C is therefore already taken into account in the 1st request and written in the 0th slot, whereas the answer of the subscriber A is only written to the 0th slot on the 2nd request. The answer of the participant B is written only in the 3rd request in the 0th slot. If the answer of the respective participant has been written into the respective slot, this participant does not answer to the following requests. The occurring collisions are in 1 marked "coll".

The answer of the participant D (return value 64 _h ) is sorted only in the 7th slot, since 100div14 = 7. The answer of the participant does not conflict with the answers of the participants A, B and C.

in the Slot 7 takes place no collision, since the subscriber D is the only one Participant whose answer is to be sorted in the 7th slot.

Subscribers to be sorted in slot 7 are subscribers whose low part of their identification number is between 62 _h = 98 = 1100000 ₂ and 6F _h = 111 = 1101101 ₂ , since 98div14 = 7 and 111div14 = 7.

If No feedback from the participants takes place, the 14 time slots (0 Slot to 13 Slot) remain with the Fill bytes "FE" of the line coupler LC occupied.

in the shown embodiment four requests 1.) to 4.) are started by the line coupler LC. At the first request 1.) the answer of the subscriber C in the = 0. Slot and the answer of the participant D in the 7. Slot written. The also for the 0th slot certain answers of the participants A and B are overwritten, since the answer of the subscriber C is dominant. At the second request 2.) will be the answer of the participant A and at the third query the answer of the participant B written in the 0th slot.

When polling for the in 1 As a result of the return values, there must not be any pre-assigned but only free bits.

Of the Time requirement per line L is approx. 0.7 seconds, as in systems with a maximum of approx. (256/14) + 1 = 19 polling frames for all lines the determination of the identification numbers is carried out in parallel.

In the EIB installation according to 2 the line coupler LC, which is assigned as a subscriber to an area coupler, not shown, again has the identification number 1.1.00. Furthermore, all subscribers A, B, C, D also have different identification numbers (physical addresses). The subscriber A has the identification number 1.1.03, the subscriber B the physical address 1.1.07, the subscriber C the identification number 1.1.08 and the subscriber D the physical address 1.1.64. Furthermore, all subscribers A, B, C, D likewise support a polling poll conducted by the line coupler LC.

The Determining the identification numbers (physical addresses) the participant is also in this embodiment also after the Master-slave principle.

master In this case again a new line coupler LC, a BCU 2 (Bus Coupling Unit Version 2) or the like. The master, in the illustrated embodiment the line coupler LC queries 19 frames in one line (pollt 19 Frames in a line). The line coupler LC (Master) collects the Values and stores them in a 256-bit field (Property). All empty bits could equipment (BCU 1 (Bus Coupling Unit Version 1), which is a polling query not support. In these cases the address search is performed according to TCONNECT (point-by-point oriented) Connection establishment) and TDISCONNECT.

The slaves are at the in 2 The participants A, B, C, D. Each of the participants A, B, C, D sets in his time slot (slot) from a fixed value, for example, the value of 1.

The Inquiries of the line coupler LC [in the illustrated embodiment Inquiries 1.) to 8.)] have a variable structure "F0 1100 000n 0E CRC", where n = 0, 1, ... 7 is the integer division share that is in addition to the modulo calculation described below is determined.

The 14 time slots (0th to 13th slot), in which the answers of the participants A, B, C, D are written with the filling bytes "FE" of the Line coupler LC filled.

In the example shown, each of the subscribers A, B, C, D forms from the low part 03 _h or 07 _h or 08 _h or 064 _h (= 100) of its physical address (identification number) by a modulo calculation the mod14- Value and additionally calculates the integer division fraction n (div14 value). With a mod14 calculation, 256 entries and 14 slots (0th slot to 13th slot) result in return values of 0 to 18 for the integer division share n.

The Responses of the participants A, B and C result in the integer division share n = 0 and are therefore assigned to the 1st request 1.). The concerned mod14 values are "3" for the participant A, "7" for the participant B and "8" for the participant C. After completion of the 1st request 1.) the fill bytes are "FE" of the 3. Slots, 7th slots and 8th slots are overwritten with "01".

The Answer of the participant D becomes with the 8. request 8.) in the 2. Slot sorted because 100mod14 = 2 and the integer division share n = 7.

In the embodiment according to 2 Therefore, if the predeterminable structure is variable according to a law, each participant A, B, C, D generates a response to this variable request for exactly one structure and the slot for this response via a modulo calculation and an additional integer division independently determined.

When polling for the in 2 The EIB installation does not require a new polling type.

Of the Time requirement per line L is approx. 0.7 seconds, as in systems with a maximum of approx. (256/14) + 1 = 19 polling frames for all lines the determination of the identification numbers is carried out in parallel.

Claims (2)

Method for determining the identification numbers (IDs) of subscribers (A, B, C, D) in a hierarchical bus system, in particular in an EIB installation, with at least one segment and at least one higher-level instance (master, LC), wherein the at least one higher-level instance (Master, LC) by querying the identification numbers (IDs) of the participants (A, B, C, D) determined in this segment, wherein the query is made by a broadcast request (Broadcast), which includes a predeterminable structure, which makes it different Subscribers (A, B, C, D) is allowed to respond specifically to this broadcast query, characterized in that the predeterminable structure is a fixed structure and each participant (A, B, C, D) the low part of his Identification number of an integer division (eg, div14) and determined from the result of the integer division (integer value) its time slot for its response independently, the bus access method according to the CSMA / CA procedure surmounts. Method according to claim 1, characterized in that that the windows of time for missing answers from the parent Instance (LC) with fill bytes be synchronized.