Method for transmitting data

Patent metadata

Field	Value
Publication number	US-9252969-B2
Application number	US-201414499524-A
Country	US
Kind code	B2
Filing date	Sep 29, 2014
Priority date	Sep 27, 2010
Publication date	Feb 2, 2016
Grant date	Feb 2, 2016

Abstract

A method is described for transmitting data between participants of a serial, ring-shaped communications arrangement in which the participants are serially connected to one another, wherein a data packet is passed from a participant provided as a master to further participants provided as slaves, wherein the data packet is passed from slave to slave, and wherein address information of the data packet is altered by each slave.

First claim

What is claimed is:

1. A method for transmitting data between participants of a serial, ring-shaped communications arrangement, in which the participants are serially connected to one another, the method comprising:
passing a data packet from a participant provided as a master to further participants provided as slaves, wherein the data packet is passed from one of the slaves to another of the slaves; and
prioritizing an interrupt received at the master from the slaves on the basis of the position of the slave having sent the interrupt in the ring-shaped communications arrangement;
wherein a protocol for priority control is provided with which at least one slave transmits a request to the master via a data packet including an empty frame.

2. The method of claim 1 wherein the slaves have identical local addresses, and wherein an identical algorithm for communication is stored in each of the slaves.

3. The method of claim 1 , wherein encoding for recovery of timing information from a signal is used for a data packet that is to be transmitted, wherein a parity bit is inserted equidistantly in the data frame by that encoding, so that a bit stream for transmission of data packets has at least one edge change within a specified period of time.

4. The method of claim 1 , wherein the data are transmitted continuously, and wherein the data packet includes with an address field useful data provided for a slave.

5. The method of claim 1 , wherein, as address information, an address value of the received data packet is altered by one of adding and subtracting a fixed value by each slave.

6. A communications arrangement, which has a ring-shaped configuration, comprising:
a plurality of participants which are serially connected to one another, wherein one of the participants is a master and other ones of the participants are slaves;
wherein the master is configured to pass the data packet to the slaves, each of the slaves passing the data packet to a subsequent one of the slaves;
wherein interrupts received at the master from the slaves are prioritized on the basis of the position of the slave having sent the interrupt in the ring-shaped communications arrangement; and
wherein a protocol for priority control is provided with which at least one slave transmits a request to the master via a data packet including an empty frame.

7. The communications arrangement of claim 6 , wherein each participant has at least one serial interface with which the participant is connected via a communications connection having a serial interface to an adjacent participant of the communications arrangement.

Assignees

• Bosch Gmbh Robert

Inventors

• Rohatschek Andreas-Juergen
• Lutz Bernd
• Thoss Dieter
• Huck Thorsten
• Todorov Stoyan

Classifications

• H04L45/74

  Address processing for routing · CPC title

• G06F2213/0038

  System on Chip · CPC title

• H04L12/43

  with synchronous transmission, e.g. time division multiplex [TDM], slotted rings · CPC title

• H04L25/49

  using code conversion at the transmitter; using predistortion; using insertion of idle bits for obtaining a desired frequency spectrum; using three or more amplitude levels {; Baseband coding techniques specific to data transmission systems (spectral shaping H04L25/03828)} · CPC title

• H04L25/4904

  using self-synchronising codes, e.g. split-phase codes · CPC title