WO2020108931A2

WO2020108931A2 - Simplified combination of coded data packets

Info

Publication number: WO2020108931A2
Application number: PCT/EP2019/080289
Authority: WO
Inventors: Gerd Kilian; Josef Bernhard; Thomas Kauppert; Hristo PETKOV; Johannes WECHSLER; Jakob KNEISSL; Raphael MZYK; Dominik Soller
Original assignee: Diehl Metering Gmbh; Fraunhofer Gesellschaft Zur Förderung Der Angewandten Forschung E. V.
Priority date: 2018-11-30
Filing date: 2019-11-05
Publication date: 2020-06-04
Also published as: EP3888278A2; WO2020108931A3; DE102018220766A1; DE102018220766B4

Abstract

Exemplary embodiments of the invention relate to a communication system, comprising a data transmitter and a data receiver, wherein: in order to transfer payload data, a plurality of channel-coded data packets are produced from the payload data; each of the channel-coded data packets has packet core data, which are coded with a channel code of higher redundancy than the payload data; the plurality of channel-coded data packets is transferred in a time interval (T); time distances and/or frequency distances between the channel-coded data packets are known to or can be determined by both the data transmitter and the data receiver, such that the data receiver, in the case of failure of error-free decoding of a channel-coded data packet, can determine an additional channel-coded data packet on the basis of the known or determined time distances and/or frequency distances, in order to obtain, by means of a combination of the channel-coded data packet and the additional channel-coded data packet, an increased coding gain for decoding of the payload data.

Description

Simplified combination of encoded data packets

description

The present invention relates to a concept for transmitting user data in the form of a plurality of coded data packets which can be combined on the receiving end, adapted to a transmission quality, in order to adapt a coding gain to the transmission quality or a transmission situation. Embodiments of the present invention can be used in particular in unidirectional multipoint-to-point transmission systems (multipoint-to-point).

DE 10 2010 031 41 1 B4 shows a method which makes it possible, in the case of uncoordinated data transmission, to combine a plurality of coded data packets in order to achieve code gain at the data receiver by means of code combining (German: incremental redundancy) in the event of faults or low signal levels .

The basis of code combining is a common code word (result of the encoder of the FEC (FEC = forward error correction, dt. Forward error correction)), which is distributed over at least two data packets in such a way that each of the at least two data packets taken by itself can be decoded by the receiver is. If the at least two data packets cannot be decoded individually on the receiver side, a code gain can be achieved by combining the at least two data packets.

There are also other methods, e.g. described in DE 10 2016 013 654 A1, which do not achieve code gain. Here data packets are combined to compensate / correct errors in the data packets.

So that in DE 10 2010 031 41 1 B4 between the at least two data packets there is statistical independence from interferers (external and intrinsic interference), the second data packet is transmitted at a random time after the first data packet. After receiving the first data packet, the data receiver therefore does not know when the second data packet will be sent. For the maximum time limit, a time interval T is introduced in which all data packets are guaranteed to be transmitted. This scheme is shown graphically in FIG. 1. 1 shows a schematic view of an occupancy of a communication channel between the data transmitter and the data receiver during the transmission of a plurality of data packets 10-n (n = 1, 2, N) within a time interval T. As can be seen in FIG. 1 , the data packets 10-n (n = 1, 2, N) each have packet core data 12-n (n = 1, 2, N) and user data 14-n (n = 1, 2, N).

So that each of the data packets 10-n (n = 1, 2, ..., N) can be detected on its own and the information can be decoded for code combining, each of the data packets 10-n (n = 1, 2,. .., N) a core packet (packet core data) 12-n (n = 1, 2, ..., N), which has a higher coding than the user data 14-n (n = 1, 2, ..., N) having.

If a core data packet (e.g. 12-1) is correctly recognized in the data receiver, whereas the user data (e.g. 14-1) cannot be decoded correctly, the respective data packet (e.g. 10-1) must be saved until at least one further data packet (e.g. 10 -2) was received, which contains the same information in the core data packet (eg 12-2) (so-called partner search). If at least two related data packets (e.g. 10-1 and 10-2) have been found, decoding can be carried out using code combining.

The data receiver must therefore store all incorrectly decoded data packets over the length of the time period T and wait when a further data packet is available for code combining. If a data packet is decoded incorrectly, this data packet is therefore stored in the memory and then waited until a further data packet could not be decoded correctly. If there are at least two incorrectly decoded data packets in the memory, it must be checked for each combination of data packets whether the information in the core packet is the same. If this is the case, a combination can be carried out.

Since such a communication system is to be operated precisely at low signal levels, a low detection threshold is necessary, which leads to a high number of false detections and thus to a high number of incorrectly decoded data packets, all of which are stored in the memory for the partner search.

For every possible combination of the data packets in the memory, it must be checked whether the information in the core data packet matches the information to be compared. The necessary computing load thus increases exponentially with the number of data packets in the memory. Frequently, a transmission consists of more than two data packets, in which case, combinations of three, four, etc. may have to be checked.

In addition, all data packets following the first data packet are sent at random, so that if a disturbance occurs in the last data packet within the time interval T, so that this cannot be decoded, the data packet at the data receiver is indeed due to the previous data packets can usually be received correctly, but the data receiver cannot deduce the time of the last data packet and therefore cannot respond to the following transmission, since the last data packet is missing and there is no temporal connection to the other data packets.

The present invention has for its object to improve the existing situation.

This problem is solved by the independent claims.

Advantageous further developments can be found in the dependent claims.

Embodiments create a data transmitter for transmitting user data within a time interval via a communication channel to a data receiver, the data transmitter being designed to generate a plurality of channel-coded data packets from the user data, each of the channel-coded data packets having packet core data corresponding to a different packet identifier for each data packet and wherein the packet core data is encoded with a channel code of higher redundancy than the user data, the data transmitter being designed to transmit the plurality of channel-coded data packets to the data receiver in the time interval, the data transmitter being designed to transmit the plurality of channel-coded data packets in time and / or frequency, with given [eg defined; e.g. the data receiver known] time intervals and / or frequency intervals, to send distributed.

In exemplary embodiments, the data transmitter is designed to send the plurality of channel-coded data packets with regard to content, transmission times and / or transmission frequencies independently of a return channel from the data receiver to the data transmitter.

In embodiments, the time interval is at least 20 s [or 30 s, or 40 s, or 50, or 60 sj. In exemplary embodiments, the time intervals between the channel-coded data packets are at least 8 s [or 10 s, or 12 s, or 15 s] [eg so that the energy buffer of the data transmitter can charge up].

In exemplary embodiments, a time interval between a channel-coded data packet of the plurality of channel-coded data packets sent out first and a channel-coded data packet of the plurality of channel-coded data packets sent out last is at most 120 s [e.g. maximum distance between the removed data packets in the time interval is 120 seconds]

In exemplary embodiments, the data transmitter is an energy self-sufficient data transmitter with a maximum available energy of 20 Ah [or 10 Ah, or 7.2 Ah, or 3.6 Ah]

In embodiments, the data transmitter is configured to send a first channel-coded data packet of the plurality of channel-coded data packets at a random or pseudo-random time [e.g. wherein the transmission time of the first channel-coded data packet defines the start time of the time interval T].

In exemplary embodiments, the data transmitter is designed to transmit the first channel-coded data packet of the plurality of channel-coded data packets on a random or pseudo-random transmission frequency within the time interval.

In exemplary embodiments, the data transmitter is designed to send the channel-coded data packets of the plurality of channel-coded data packets following the first channel-coded data packet within the time interval.

In exemplary embodiments, the time intervals and / or frequency intervals between the plurality of channel-coded data packets are fixed [e.g. firmly defined; e.g. known to the data recipient].

In exemplary embodiments, the time intervals and / or frequency intervals between the plurality of channel-coded data packets are selected in accordance with a time interval pattern and / or the frequency interval pattern such that a correlation result of an autocorrelation function (time and / or frequency) of the time interval pattern and / or frequency interval pattern has as small as possible secondary peaks identifies. In exemplary embodiments, the time interval is a transmission time interval, the data transmitter [for example end point] being designed to receive at least one data packet from the data receiver [for example base station] or another data receiver in a reception time interval which follows the transmission time interval.

In embodiments, a time interval [e.g. and frequency spacing] between the transmission time interval and the reception time interval [e.g. between predetermined areas [e.g. Start times] of the transmission time interval and the reception time interval] [e.g. fixed; e.g. defined or firmly defined; e.g. known to the data recipient].

In embodiments, a time interval [e.g. and frequency spacing] between the transmission time interval and the reception time interval [e.g. between predetermined areas [e.g. Start times] of the transmission time interval and the reception time interval] pseudo random.

In exemplary embodiments, the data transmitter is designed to determine the pseudo-random time interval between the transmission time interval and the reception time interval based on an intrinsic parameter of the data transmitter, the data receiver or a communication system of the data transmitter and / or data receiver, or

information that is transmitted with the packet core data of the channel-coded data packets,

to derive.

In exemplary embodiments, the data transmitter is designed to determine the pseudo-random time interval between the transmission time interval and the reception time interval by means of a deterministic random number generator.

In exemplary embodiments, the data transmitter is designed to

an intrinsic parameter of the data transmitter, the data receiver or a communication system of the data transmitter and / or data receiver, or

to be used as the start state of the deterministic random number generator.

Further exemplary embodiments provide a data receiver for receiving user data which are transmitted within a time interval by means of a plurality of channel-coded data packets a data transmitter is transmitted to the data receiver via a communication channel, each of the channel-coded data packets having packet core data corresponding to a packet identifier of the respective channel-coded data packet, and wherein the packet core data are encoded with a channel code of higher redundancy than the user data, the plurality of channel-coded data packets distributed in time and / or frequency who who, a time interval and / or frequency interval between the channel-coded data packets is specified, wherein the data receiver is designed to at least one channel-coded data packet [eg a first channel-coded data packet] of the plurality of kanalco received data packets, the data receiver being designed to decode packet core data of the channel-coded data packet and, in the event of an error-free decoding of the channel-coded data packet, to decode based on the predetermined time interval and / or frequency distance between the channel-coded data packets to determine a further channel-coded data packet [for example a second channel-coded data packet] of the plurality of channel-coded data packets [for example to be received or to be selected from a multiplicity of received channel-coded data packets], and in order to combine the channel-coded data packet and the to receive further channel-coded data packets an increased code gain for decoding the user data.

In exemplary embodiments, the data receiver does not include a return channel for the data transmission in order to cause the transmitter to retransmit a channel-coded data packet in the event of a failed decoding of the useful data.

In exemplary embodiments, the data receiver knows the predetermined time interval and / or frequency interval between the channel-coded data packets.

For example, the distances within the time interval are known, while the distances outside the time interval may or may not be known.

In exemplary embodiments, the data receiver is designed to decode packet core data of a first received channel-coded data packet of the time interval and, in the event of successful decoding of the first channel-coded data packet, not to decode any further channel-coded data packets of the plurality of channel-coded data packets.

In exemplary embodiments, the time interval is a transmission time interval, the data receiver being designed to transmit at least one data packet to the data transmitter in a reception time interval following the transmission time interval. In exemplary embodiments, a time interval [for example and frequency interval] between the transmission time interval and the reception time interval [for example between predetermined areas [for example start times] of the transmission time interval and the reception time interval] is predetermined [for example fixed; eg defined or firmly defined; eg known to the data recipient].

In exemplary embodiments, the data receiver is designed to determine the pseudorandom time interval between the transmission time interval and the reception time interval based on an intrinsic parameter of the data transmitter, the data receiver or a communication system of the data transmitter and / or data receiver, or

to derive.

In exemplary embodiments, the data receiver is designed to determine the pseudo-random time interval between the transmission time interval and the reception time interval by means of a deterministic random number generator.

In exemplary embodiments, the data receiver is designed to

to be used as the start state of the deterministic random number generator.

Further exemplary embodiments provide a system with at least one data transmitter according to one of the exemplary embodiments described here and a data receiver according to one of the exemplary embodiments described here.

In exemplary embodiments, the system comprises a plurality of data transmitters, the plurality of data transmitters being designed to encode the respective plurality of channel-coded ones To transmit data packets with the same predetermined time intervals and / or frequency intervals in the time and / or frequency.

Further exemplary embodiments create a method for sending user data within a time interval via a communication channel. The method comprises a step of generating a plurality of channel-coded data packets from the user data, each of the channel-coded data packets having packet core data corresponding to a packet identifier that is different for each data packet, and wherein the packet core data are encoded with a channel code of higher redundancy than the user data. Furthermore, the method comprises a step of sending the plurality of channel-coded data packets in the time interval, the plurality of channel-coded data packets in time and / or frequency, with predetermined [e.g. defined; e.g. known to the data receiver] time intervals and / or frequency intervals, are distributed.

Further exemplary embodiments provide a method for receiving user data which are transmitted within a time interval by means of a plurality of channel-coded data packets via a communication channel, each of the channel-coded data packets having packet core data corresponding to a packet identifier of the respective channel-coded data packet, and the packet core data having a higher channel code Redundancy is coded as the user data, the plurality of channel-coded data packets being transmitted in a distributed manner in terms of time and / or frequency, with a time interval and / or frequency spacing being specified between the channel-coded data packets. The method comprises a step of receiving at least one channel coded data packet [e.g. a first channel-coded data packet] of the plurality of channel-coded data packets. The method further comprises a step of decoding packet core data of the channel-coded data packet. The method further comprises a step of determining [e.g. Receiving or selecting from a plurality of received channel-coded data packets], in the event of an error-free decoding of the channel-coded data packet, of another channel-coded data packet [e.g. of a second channel-coded data packet] of the plurality of channel-coded data packets based on the predetermined time interval and / or frequency interval between the channel-coded data packets, and in order to obtain an increased code gain for decoding the useful data by a combination of the channel-coded data packet and the further channel-coded data packet.

Further exemplary embodiments create a data transmitter for transmitting useful data within a time interval via a communication channel to a data receiver, the data transmitter being designed to contain a plurality of channel-coded data packets to generate from the user data, each of the channel-coded data packets having packet core data corresponding to a different packet identifier for each data packet, and where the packet core data are encoded with a channel code of higher redundancy than the user data, the data transmitter being designed to contain the plurality of channel-coded data packets to transmit to the data receiver in the time interval, the data transmitter being designed to transmit the plurality of channel-coded data packets in time and / or frequency, with pseudo-random time intervals and / or frequency intervals between the channel-coded data packets, wherein the data transmitter is formed to based on the pseudo-due time intervals and / or frequency intervals between the channel-coded data packets

an intrinsic parameter of the data transmitter, the data receiver or a communication system of the data transmitter, or

to derive.

In embodiments, the intrinsic parameter

a network ID,

a data transmitter ID [e.g. Endpoint ID],

information from a previous transmission,

a hardware ID,

a transmission frequency,

a data rate,

a modulation,

a counter state of a packet / sequence counter, and / or

an operating mode / state.

In exemplary embodiments, the information is at least part of error protection data [eg CRC] of the packet core data of the channel-coded data packets. In exemplary embodiments, the data transmitter is designed to send a first channel-coded data packet of the plurality of channel-coded data packets at a random or pseudo-random time [for example, the transmission time of the first channel-coded data packet defining the start time of the time interval T].

In exemplary embodiments, the data transmitter is designed to determine the pseudo-random time intervals and / or frequency intervals between the channel-coded data packets by means of a deterministic random number generator.

In embodiments, the intrinsic parameter is used as the start state of the deterministic random number generator.

In exemplary embodiments, the information is used as the start state of the deterministic random number generator.

In embodiments, the number of bit sequences generated by the deterministic random number generator is so long that all possible time states are covered within the time interval.

In exemplary embodiments, the data transmitter is designed to use the same deterministic random number generator to determine the pseudo-random time intervals and frequency intervals.

In exemplary embodiments, the data transmitter is designed to determine the pseudo-random time intervals by means of a first deterministic random number generator, the data transmitter being designed to determine the pseudo-random frequency intervals by means of a second deterministic random number generator. In exemplary embodiments, the time interval is a transmission time interval, the data transmitter [for example end point] being designed to receive at least one data packet from the data receiver [for example base station] or another data receiver in a reception time interval which follows the transmission time interval.

to derive.

In exemplary embodiments, the data transmitter is designed to

to be used as the start state of the deterministic random number generator.

Further exemplary embodiments provide a data receiver for receiving user data which are transmitted within a time interval by means of a plurality of channel-coded data packets a data transmitter is transmitted to the data receiver via a communication channel, each of the channel-coded data packets having packet core data corresponding to a packet identifier of the respective channel-coded data packet, and wherein the packet core data are encoded with a channel code of higher redundancy than the user data, the plurality of channel-coded data packets distributed in time and / or frequency who the, wherein a time interval and / or frequency interval between the channel-coded data packets is pseudo-random, wherein the data receiver is designed to at least one channel-coded data packet [eg a first channel-coded data packet] of the plurality of channels receive coded data packets, the data receiver being designed to decode packet core data of the channel-coded data packet and, in the event of failure of error-free decoding of the channel-coded data packet, to based on a determined pseudo-random time interval and / or frequency spacing between the channel-coded data packets to determine a further channel-coded data packet [eg a second channel-coded data packet] of the plurality of channel-coded data packets [for example to receive or to select from a plurality of received channel-coded data packets], and to use a combination of the channel-coded data packets and the further channel-coded data packets to obtain an increased code gain for decoding the useful data, the data receiver being designed to base the pseudo-random time intervals and / or frequency intervals between the channel-coded data packets on

an intrinsic parameter of the data transmitter, the data receiver or a communication system of the data receiver [e.g. and data transmitters], or

to derive.

In exemplary embodiments, the data receiver does not include a return channel for the data transmission in order to cause the data transmitter to retransmit a channel-coded data packet in the event of a failed decoding of the useful data.

In embodiments, the intrinsic parameter

a network ID,

a data transmitter ID [e.g. Endpoint ID],

information from a previous transmission,

a hardware ID,

a transmission frequency,

a data rate,

a modulation, a counter state of a packet / sequence counter, and / or

an operating mode / state.

In embodiments, the information is at least part of error protection data [e.g. CRC] of the packet core data of the channel-coded data packets.

In exemplary embodiments, the data receiver is designed to determine the pseudo-random time intervals and / or frequency intervals between the channel-coded data packets by means of a deterministic random number generator.

In exemplary embodiments, the number of bit sequences generated by the deterministic random number generator is so long that all possible time states are covered within the time interval.

In exemplary embodiments, the data receiver is designed to determine the pseudo-random time intervals and frequency intervals using the same de terministic random number generator.

In exemplary embodiments, the data receiver is designed to determine the pseudo-random time intervals by means of a first de-terministic random number generator, the data receiver being designed to determine the pseudo-random frequency intervals using a second deterministic random number generator.

In exemplary embodiments, the time interval is a transmission time interval, the data receiver being designed to transmit at least one data packet to the data transmitter in a reception time interval following the transmission time interval.

In exemplary embodiments, there is a time interval [for example and frequency interval] between the transmission time interval and the reception time interval [for example between predetermined ranges Chen [eg start times] of the transmission time interval and the reception time interval] [eg fixed; eg defined or firmly defined; eg known to the data recipient].

to derive.

In exemplary embodiments, the data receiver is designed to

to be used as the start state of the deterministic random number generator.

In exemplary embodiments, the system comprises a plurality of data transmitters, the data receiver being designed to determine channel-coded data packets from a multiplicity of different data transmitters, those channel-coded data packets of a specific data transmitter based on the determined pseudorandom time interval and / or frequency interval. Further exemplary embodiments provide a method for transmitting useful data within a time interval from a data transmitter via a communication channel to a data receiver. The method comprises a step of generating a plurality of channel-coded data packets from the user data, each of the channel-coded data packets having packet core data corresponding to a different packet identifier for each data packet, and the packet core data being encoded with a channel code of higher redundancy than the user data. The method further comprises a step of transmitting the plurality of channel-coded data packets in the time interval, the plurality of channel-coded data packets being distributed in time and / or frequency, with pseudo-random time intervals and / or frequency intervals between the channel-coded data packets, wherein the pseudorandom time intervals and / or frequency intervals between the channel-coded data packets

based.

Further exemplary embodiments provide a method for receiving user data which are transmitted within a time interval by means of a plurality of channel-coded data packets from a data transmitter via a communication channel to a data receiver, each of the channel-coded data packets having packet core data corresponding to a packet identifier of the respective channel-coded data packet, and the packet core data being encoded with a channel code of higher redundancy than the user data, the plurality of channel-coded data packets being transmitted in a distributed manner in time and / or frequency, with a time interval and / or frequency interval between the channel-coded data packets being pseu coincidental. The method comprises a step of receiving at least one channel-coded data packet [for example a first channel-coded data packet] of the plurality of channel-coded data packets. The method further comprises a step of decoding packet core data of the channel-coded data packet. Furthermore, the method comprises a step of determining [eg receiving or selecting from a multiplicity of received channel-coded data packets], in the event of an error-free decoding of the channel-coded data packet, of a further channel-coded data packet [eg of a second channel-coded data packet] of the plurality of channel-coded data packets based on a determined pseudorandom time interval and / or frequency spacing between the channel-coded data packets, by a combination of the channel-coded data packet and the to obtain additional channel-coded data packets to obtain an increased code gain for decoding the user data, the pseudo-random time intervals and / or frequency intervals between the channel-coded data packets being based on

information which is transmitted with the packet core data of the channel-coded data packets,

is determined.

Further exemplary embodiments provide a data transmitter for transmitting user data within a time interval via a communication channel to a data receiver, the data transmitter being designed to generate a plurality of channel-coded data packets from the user data, each of the channel-coded data packets having packet core data corresponding to a packet identifier that is different for each data packet and where the packet core data is encoded with a channel code of higher redundancy than the useful data, the data transmitter being designed to transmit the plurality of channel-encoded data packets to the data receiver in a first time interval, the data transmitter being designed to transmit the data To transmit a plurality of channel-coded data packets distributed in time and / or frequency, the data transmitter being designed to repeatedly transmit the plurality of channel-coded data packets to the data receiver in a second time interval, one time her distance between the first time interval and the second time interval is fixed, or wherein a time interval between the first time interval and the second time interval is random or pseudo-random.

In exemplary embodiments, time intervals and / or frequency intervals between the channel-coded data packets are specified [e.g. stipulate; e.g. Are defined; e.g. firmly defined; e.g. known to the data recipient].

In exemplary embodiments, time intervals and / or frequency intervals between the channel-coded data packets are pseudo-random, the data transmitter being designed to base the pseudo-random time intervals and / or frequency intervals between the channel-coded data packets on an intrinsic parameter of the data transmitter, the data receiver or a communication system of the data transmitter, or

to derive.

In exemplary embodiments, time intervals and / or frequency intervals between the channel-coded data packets are pseudo-random, the data transmitter being designed to determine the pseudo-random time intervals and / or frequency intervals between the channel-coded data packets by means of a deterministic random number generator.

In exemplary embodiments, a time interval between the first time interval and the second time interval is pseudo-random, the data transmitter being designed to be the time interval between the first time interval and the second time interval based on an inherent parameter of the data transmitter, the data receiver or a communication system of the Data transmitter [e.g. and data recipient].

In exemplary embodiments, a time interval between the first time interval and the second time interval is pseudo-random, the data transmitter being designed to determine the time interval between the first time interval and the second time interval based on information which is transmitted with the packet core data of the channel-coded data packets, to derive.

In exemplary embodiments, a time interval between the first time interval and the second time interval is pseudo-random, the data transmitter being designed to determine the time interval between the first time interval and the second time interval by means of a deterministic random number generator.

In exemplary embodiments, the data transmitter is designed to

to be used as the start state of the deterministic random number generator. In exemplary embodiments, the time interval is a transmission time interval, the data transmitter [for example end point] being designed to receive at least one data packet from the data receiver [for example base station] or another data receiver in a reception time interval which follows the transmission time interval.

to derive.

In exemplary embodiments, the data transmitter is designed to

to be used as the start state of the deterministic random number generator.

Further exemplary embodiments provide a data receiver for receiving user data which are transmitted within a first time interval by means of a plurality of channel-coded data packets are transmitted from a data transmitter via a communication channel to the data receiver, each of the channel-coded data packets having packet core data corresponding to a packet identifier of the respective channel-coded data packet, and wherein the packet core data are encoded with a channel code of higher redundancy than the user data, the plurality of channel-coded data packets are transmitted distributed in time and / or frequency, the plurality of channel-coded data packets being transmitted repeatedly within a second time interval, the data receiver being designed to contain at least one channel-coded data packet [for example a first channel-coded data packet] of the plurality of channel-coded data packets to be received, the data receiver being designed to decode packet core data of the channel-coded data packet and, in the event of an error-free decoding of the channel-coded data packet, to decode based on a time interval and / or Fr equivalence distance between the channel-coded data packets at least one further channel-coded data packet [eg second channel-coded data packet] of the plurality of channel-coded data packets [to be received or selected from a plurality of received channel-coded data packets], and by a combination of the channel-coded data packet and the at least one a further channel-coded data packet to receive an increased code gain for decoding the useful data, the data receiver being designed to also in the event of failure of error-free decoding of the channel-coded data packets of the first time interval based on a combination of the first channel-coded data packet and the at least one further channel-coded data packets of the first time interval, to receive at least one further channel-coded data packet [eg a third channel-coded data packet] of the plurality of channel-coded data packets of the second time interval in order to determine the useful data [for example by combining the at least one further channel-coded data packet of the second time interval with the channel-coded data packet and / or the at least one further channel-coded data packet of the first time interval], with a time interval between the first time interval and the second time interval is fixed, or where a time interval between the first time interval and the second time interval is due or pseudo-random.

In exemplary embodiments, the data receiver does not include a return channel for the data transmission in order to cause the data transmitter to retransmit a channel-coded data packet in the event of a failed decoding of the user data,

In exemplary embodiments, time intervals and / or frequency intervals between the channel-coded data packets are specified [for example, specified; eg defined; eg firmly defined; eg known to the data recipient]. In exemplary embodiments, time intervals and / or frequency intervals between the channel-coded data packets are pseudo-random, the data receiver being designed to base the pseudo-random time intervals and / or frequency intervals between the channel-coded data packets on

to derive.

In exemplary embodiments, time intervals and / or frequency intervals between the channel-coded data packets are pseudo-random, the data receiver being designed to determine the pseudo-random time intervals and / or frequency intervals between the channel-coded data packets by means of a deterministic random number generator.

In exemplary embodiments, a time interval between the first time interval and the second time interval is pseudo-random, the data receiver being designed to be the time interval between the first time interval and the second time interval based on an intrinsic parameter of the data receiver, the data transmitter or a communication system of the data receiver [e.g. and data transmitters].

In exemplary embodiments, a time interval between the first time interval and the second time interval is pseudo-random, the data receiver being designed to determine the time interval between the first time interval and the second time interval based on information which is transmitted with the packet core data of the channel-coded data packets, to derive.

In exemplary embodiments, a time interval between the first time interval and the second time interval is pseudo-random, the data receiver being designed to determine the time interval between the first time interval and the second time interval by means of a deterministic random number generator.

In exemplary embodiments, the data receiver is designed to

an intrinsic parameter of the data transmitter, the data receiver or a communication system of the data receiver, or information that is transmitted with the packet core data of the channel-coded data packets,

to be used as the start state of the deterministic random number generator.

to derive.

In exemplary embodiments, the data receiver is designed to

to be used as the start state of the deterministic random number generator. Further exemplary embodiments provide a method for transmitting useful data within a time interval via a communication channel. The method comprises a step of generating a plurality of channel-coded data packets from the user data, each of the channel-coded data packets having packet core data corresponding to a different packet identifier for each data packet, and the packet core data being encoded with a channel code of higher redundancy than the user data. Furthermore, the method comprises a step of transmitting the plurality of channel-coded data packets in a first time interval, the plurality of channel-coded data packets being transmitted in a distributed manner in time and / or frequency. Furthermore, the method comprises a step of repeatedly sending the plurality of channel-coded data packets in a second time interval, the plurality of channel-coded data packets being transmitted distributed over the time and / or frequency, with a time interval between the first time interval and the second time interval being fixed is predetermined, or wherein a time interval between the first time interval and the second time interval is random or pseudo-random.

Further exemplary embodiments provide a method for receiving user data which are transmitted within a first time interval by means of a plurality of channel-coded data packets via a communication channel, each of the channel-coded data packets having packet core data corresponding to a packet identifier of the respective channel-coded data packet, and the packet core data having one Channel codes of higher redundancy are coded than the user data, the plurality of channel-coded data packets being transmitted in a distributed manner in time and / or frequency, the plurality of channel-coded data packets being transmitted repeatedly within a second time interval. The method comprises a step of receiving at least one channel-coded data packet [for example a first channel-coded data packet] of the plurality of channel-coded data packets. The method also includes a step of decoding packet core data of the at least one channel-coded data packet. Furthermore, the method comprises a step of determining [eg receiving or selecting from a multiplicity of received channel-coded data packets], in the event of an error-free decoding of the channel-coded data packet, of a further channel-coded data packet [eg a second channel-coded data packet] of the plurality of channel-coded data packets based on a time interval and / or frequency interval between the channel-coded data packets, in order to obtain an increased code gain for decoding the useful data through a combination of the channel-coded data packet and the at least one further channel-coded data packet. The method also includes a step of determining [eg receiving or selecting from a Plurality of received channel-coded data packets] in the event of failure of an error-free decoding of the channel-coded data packets of the first time interval based on a combination of the first channel-coded data packet and the at least one further channel-coded data packet of the first time interval, at least one further channel-coded data packet [eg a third channel coded Data packet] of the plurality of channel-coded data packets of the second time interval in order to determine the useful data [for example by combining the at least one further channel-coded data packet of the second time interval with the channel-coded data packet and / or the at least one further channel-coded data packet of the first time interval] , wherein a time interval between the first time interval and the second time interval is fixed, or wherein a time interval between the first time interval and the second time interval is random or pseudo is random.

Embodiments of the present invention are described in more detail with reference to the accompanying figures. Show it:

1 shows a schematic view of an assignment of a communication channel between the data transmitter and data receiver during the transmission of a plurality of data packets within a time interval T;

Figure 2 is a schematic view of a unidirectional multi-point-to-point communication system with a plurality of transmitters and a central receiver.

3 shows a schematic view of the generation of a plurality of channel-coded data packets from a user data packet;

4a-b show schematic views of a plurality of generated coded data packets in a time interval;

5 shows a schematic view of a unidirectional transmission of incremental redundancy by means of a plurality of coded data packets;

6 shows a schematic view of a structure of a data packet; Fig. 7 is a schematic block diagram of a communication system with a

A plurality of data transmitters and a data receiver, according to an exemplary embodiment of the present invention;

8 shows a schematic view of an occupancy of a communication channel between the data transmitter and the data receiver during the transmission of a plurality of channel-coded data packets within a time interval T, with time intervals between the channel-coded data packets being predetermined, according to an exemplary embodiment of the present invention;

9 shows a flowchart of a method 200 for sending user data within a time interval via a communication channel, according to an exemplary embodiment of the present invention;

10 shows a flowchart of a method for receiving user data which are transmitted within a time interval by means of a plurality of channel-coded data packets via a communication channel, according to an exemplary embodiment of the present invention;

11 shows a flowchart of a method for transmitting useful data within a time interval via a communication channel, according to an exemplary embodiment of the present invention;

12 shows a flowchart of a method for receiving user data which are transmitted within a time interval by means of a plurality of channel-coded data packets via a communication channel, according to an exemplary embodiment of the present invention;

13 shows a flowchart of a method for transmitting useful data within a time interval via a communication channel, according to an exemplary embodiment of the present invention;

14 shows a flowchart of a method for receiving user data which are transmitted within a time interval by means of a plurality of channel-coded data packets via a communication channel, according to an exemplary embodiment of the present invention; and 15 shows a schematic view of an assignment of a communication channel between the data transmitter and the data receiver during the transmission of a plurality of channel-coded data packets within a first transmission time interval and a transmission of at least one data packet within a first reception time interval from the data receiver to the data transmitter, according to an exemplary embodiment of the present invention .

In the following description of the exemplary embodiments of the present invention, elements that are the same or have the same effect are provided with the same reference symbols in the figures, so that their description is interchangeable.

Before exemplary embodiments of the present invention are described below in section 2 which enable a simplified combination of channel-coded data packets, the underlying combination of channel-coded data packets is first explained in section 1.

1. Combination of channel-coded data packets

Fig. 2 shows schematically a multi-subscriber communication system 100, in which a plurality of transmitters 1 10-m (m = 1, 2, ..., M) each send their user data 1 12-m unidirectionally to a central receiver 120, i. that is, there is no return channel from receiver 120 to one of transmitters 1 10-m (m = 1, 2, ..., M).

Each of the transmitters 1 10-m (m = 1, 2, ..., M) has a device ENC for generating a plurality of channel-coded data packets from the user data 1 12-m (m = 1, 2, ..., M ) on. This can be interpreted in such a way that the user data 1 12-m (m = 1, 2, ..., M), which are to be sent in each case within a transmission time interval, are assigned the majority of the channel-coded data packets. Furthermore, each transmitter 1 10-m (m = 1, 2, ..., M) has a device TX for sending the plurality of channel-coded data packets to the receiver 120 in the time interval.

One of the transmitters 1 10-m (m = 1, 2, ..., M) or the device ENC for generating the majority of the channel-coded data packets will now be explained in more detail with reference to FIGS. 3-6. For a better overview, the participant index m (m = 1, 2, ..., M) is mostly omitted in the following. 3 illustrates that the device ENC is designed to form a plurality of channel-coded data packets 210-n (n = 1, 2,... N) from the user data 1 12, each of the channel-coded data packets 210-n ( n = 1, 2, ..., N) packet core data 212-n (n = 1, 2, ..., N) corresponding to a different packet identifier P-Id _n (n = 1, 2, ... for each data packet) , N), and wherein the packet core data 212-n (n = 1, 2, ..., N) are encoded with a channel code of higher redundancy than the user data 1 12. This means that per data packet 210-n (n = 1, 2, ..., N) more redundancy information relating to the packet core data 212-n (n = 1, 2, ... N) is transmitted than redundancy information relating to the useful data. The user data 1 12 and / or redundancy information derived therefrom, such as. B. error-detecting redundancy information and / or error-correcting redundancy information are transmitted in the data packets 210-n (n = 1, 2, ..., N) in corresponding data fields 214-n (n = 1, 2, ..., N) . According to exemplary embodiments, the user data 1 12 are not transmitted split. Rather, who the entire user data 1 12 either transmitted differently coded in each of the channel-coded data packets 210-n (n = 1, 2, ... N), or the user data 1 12 are transmitted coded only in a first 210-1 of the data packets , whereupon only additional redundancy information is subsequently transmitted in the further data packets 210-n (n = 2, 3, ... N).

Since the channel-coded data packets 210-n generally have the coded user data or the coded user data word together with the redundancy information (data fields 214-n), the coded data field 214-n is often also represented in the following description as “user data with redundancy” . It is pointed out that, in accordance with the above explanations relating to FIG. 3, the data fields 214-n, either the coded user data with the redundancy information derived from the associated user data 1 12, or only redundancy information derived from the associated user data 1 12 can point.

The data packets 210-n (n = 1, 2,..., N) associated with a user data packet 1 12 are transmitted from the transmitter 1 10 to the receiver 120 within a transmission time interval T. According to one exemplary embodiment, the transmitter 110 or the device TX is designed to transmit a first of the plurality of channel-coded data packets 210-1 at a random point in time ti and remaining data packets 210-n (n = 2, 3, ... , N) the majority of the channel-coded data packets subsequently to be sent within the transmission time interval T. The time interval T thus quasi forms a transmission time frame for the channel-coded data packets 210-n assigned to a useful data word or packet 1 12 (n = 1, 2,..., N). Whether within this transmission time frame T the individual data packets 210-n (n = 1, 2, ..., N) are sent at random or pseudo-random transmission times t _n (n = 1, 2, ..., N) According to another exemplary embodiment, time intervals At = (t _{n + i} - t _n ) of successive data packets 210-n, 210- (n + 1) (n = 1, 2, N-1) are determined or predetermined , similar to a time division multiple access (TDMA). In other words, the device TX for transmitting is designed in accordance with one exemplary embodiment to transmit the plurality of channel-coded data packets 210-n to the receiver 120 in the time interval T in accordance with a time division method.

As already explained above, the packet core data 212-n (n = 1, 2, ..., N) contain a different packet identifier or packet number for each data packet 210-n (n = 1, 2, ..., N) P-Id _n (n = 1, 2, ..., N). In a multi-subscriber system with a plurality of transmitters 110, it is not mandatory, but advantageous, in the core data area 212-n of a data packet 210-n (n = 1, 2, ..., N) in addition to P-Id _n (n = 1, 2, ..., N) to provide at least part of a transmitter identifier S-Id _m (m = 1, 2, ..., M) of the respective transmitter 1 10-m in order to receive the respective data packet 210 on the receiver side -n (n = 1, 2, ..., N) can also assign the correct transmitter 1 10-m (m = 1, 2, ..., M). This enables the receiver 120 of a non-synchronous multipoint-to-point transmission system without a return channel to sort the possibly large number of reception packets (MN per time interval T) and to combine the correct data packets with one another. Instead of the transmitter identifier, time information could also be provided, which indicates the time interval to the next data packet sent. This could also identify packets that belong together.

The receiver 120 receives the transmitter-specific user data 1 12-m (m = 1, 2, ..., M), which within the time interval T by means of the plurality of channel-coded data packets from one of the transmitters 1 10-m (m = 1, 2, ..., M) are transmitted to the receiver 120 via a communication channel. Each of the channel-coded data packets 210-n (n = 1, 2, ..., N) has packet core data 212-n (n = 1, 2, ..., N) at least in accordance with a packet identifier of the respective channel-coded data packet 210-n (n = 1, 2, ..., N), the packet core data 212-n (n = 1, 2, ..., N) being encoded with a channel code of higher redundancy than the transmitter-specific user data 1 12-m ( m = 1, 2, ..., M). The receiver 120 has a device RX for receiving the majority of the channel-coded data packets 210-n (n = 1, 2, ..., N) in the time interval T, such as. B. an antenna with a downstream analog front end and a digi tal receiver stage. Furthermore, the receiver 120 has a decoder DEC, which is adapted to receive packet core data 212-n (n = 1, 2, ..., N) of a first received channel-coded data packet, e.g. B. 210-1, to decode the time interval T and, in the event of failure of an error-free decoding of the first channel-coded data packet 210-1 (to get to the sen of the specific user data 1 12-m), to packet-encoded core data of at least one further ren received Data packet 210-n (n = 2, 3, ..., N) of the time interval T. decode in order to determine a suitable further channel-coded data packet of the time interval T for a combination with the first channel-coded data packet 210-1 in order to increase the code gain for decoding the transmitter-specific user data 1 12-m (m = 1, 2,. .., M).

The receiver 120 has no return channel to any of the transmitters 1 10-m (m = 1, 2, ..., M) in order to cause the latter to retransmit a channel-coded data packet in the event of a failed decoding of the useful data 1 12 .

The decoder DEC is designed according to exemplary embodiments in order to provide information about redundancy and / or user data obtained by decoding the first channel-coded data packet 210-1 as redundancy information for decoding the at least second channel-coded data packet 210-n (n = 2, 3, ..., N) to use to get the increased codege winn.

Since at least the transmission time ti of the first data packet 210-1 is pseudo-random for each transmitter 1 10-m, the receiver 120 does not immediately recognize which reception packets belong together. This is particularly the case when the receiver 120 and / or the transmitters 1 are 10 m mobile. Trying out all possible combination attempts of data packets would take up too much computing time or hardware resources in the receiver 120, and the transmission system 100 could not be operated or could only be operated in real time with a high computing effort. For this reason, certain information (packet core data) about the transmission packet 210-n (n = 1, 2, ..., N) in the better protected core area 212-n (n = 1, 2, ..., N) of the data packet 210-n (n = 1, 2, ..., N). This information is at least the packet identifier P-Id _n (n = 1, 2, ..., N) and advantageously also the transmitter identifier S-Id _m (m = 1, 2, ..., M ) or information derived from the respective transmitter. The core area or the packet core data 212-n (n = 1, 2, ..., N) are each protected with a code of higher redundancy, the data field 214-n (n = 1, 2, ..., N). This makes it possible to decode the packet core data 212-n (n = 1, 2, ..., N) even at a low signal / noise or signal / interference ratio at the receiver 120 and thus to the packet identifier P -Id _n (n = 1, 2, ..., N) and, if available, also to the transmitter identifier S-Id _m (m = 1, 2, ..., M). The threshold of decodability of the packet core data 212-n (n = 1, 2, ..., N) is at least as good as the threshold which, when combining all possible N data packets 210-n (n = 1, 2, ... ..., N) of the transmission time frame T is reached. In other words, the code gain assigned to the core area 212-n (n = 1, 2, ..., N) corresponds at least to that Code gain that results from the combination of all N data packets 210-n (n = 1, 2, N) or their coded useful data fields 214-n (n = 1, 2, N).

As has already been described at the beginning, there are in principle various possibilities for combining the received, channel-coded data packets 210-n (n = 1, 2, ..., N), or a part thereof, with one another, in order to use the combination to get a higher code gain.

4a shows a transmission frame 300 of a transmitter 1 10. Within the transmission time interval T, 10 N channel-coded data packets 210-n are transmitted by the transmitter 1 at pseudo-random times points t _n (n = 1, 2, ..., N) . According to one exemplary embodiment, each data packet 210-n (n = 1, 2, ..., N) in the data field 214-n (n = 1, 2, ..., N) contains the coded user data which are coded differently and thus the redundancy information differs from data packet to data packet. That is, according to one exemplary embodiment, the device ENC is designed to generate, for example, in order to generate the channel-coded data packets 210-n (n = 1, 2, ..., N), each with different redundancy information with regard to the useful data packet 1 12.

A method according to the invention for generating the channel-coded data packets 210-n, each with different coded user data and associated redundancy information relating to the associated original user data packet 1 12, is illustrated with reference to FIG. 4b. As is shown in FIG. 4b, the useful data 1 12 of length L are fed to the encoder ENC, for example a convolutional encoder, with the code rate R '<R _n / N, which converts the useful data 1 12 into a coded, long data packet 210 with the Length L / R 'generated. With regard to the overview shown in FIG. 4b, it is pointed out that only the coded user data with the redundancy information (data fields 214-n) derived from the user data are shown in the data packets 210-n without explicitly specifying the assigned core data 212-n , which can be assigned to the associated data fields 214-n, for example, before the transmission process.

According to the invention, a so-called puncturing scheme is now carried out on the long code word 210 obtained in the convolutional encoder ENC, with certain positions of the long code word obtained being omitted or removed (“punctured”) during the puncturing. This enables the resulting code rate to be increased, for example. Furthermore, for example, the code word lengths can be designed precisely for a specific frame length for the subsequent data transmission or data storage. As illustrated in FIG. 4b by way of example, a puncturing scheme is used in which the encoded output data packet 210 is divided into two parts of equal size (ie N = 2), so that two punctured transmission packets 1 and 2 result, which are in the form of the encoded Useful and redundancy data 214-1, 214-2 with the associated core data 212-1, 212-2 can each be sent as a coded data packet 210-1, 210-2. The coded data packets 1 and 2 can now both have, for example, the same code rate L _n (R-R2) or different code rates (Ri F R2).

If, for example, the punctured transmission packets 1 and 2 have the same code rate RI = R2, a combination code of the first data packet 210-1 and the second data packet 210-2 on the receiver side results in a lower combined code rate R '= R _n / 2. If a further received channel-coded data packet 210-3 with the code rate R3 = RI = R2 (not shown in FIG. 4b) were used on the receiver side for decoding and combination, the combined code rate in this case would be R '= R _n / 3 reduce if the data was also sent 3 times differently coded accordingly. This sequence can be continued as required. For the above explanations, it was assumed that the code rate R _n (with Ri = R ₂ = ... = R _n ) is the same for the data packets 210-n used for the combination and decoding.

According to further exemplary embodiments of the present invention, it is also possible that the code rates R _n (n = 1, 2,... N) with which the user data 112 in the associated coded data packets 210-n (for example with the punctured ones) Transmission packets) are coded, can differ from data packet to data packet. It is also possible that predetermined groups of data packets 210-n (eg with n = 1, 3, ... "odd" or n = 2, 4 ... "even") can have different code rates from one another. The respective group can include any selection (for example individual data packets, several successive data packets, etc.) of the data packets 210-n, which are based on an associated user data packet 1 12. This assignment of different code rates can take place, for example, in that the punctured data packets 210-n have a different size, so that with respect to the code rates Ri F R2 results (for example with Ri =! And R2 =% etc.). For example, this can result in a channel code of the rate Ri in a first data packet 210-1, while in a second data packet 210-2 the coded user data are transmitted coded with a channel code of the rate R2, etc.

If the decoding of the first data packet 210-1 or of the data field 214-1 on the receiver side fails due to a too low SNR at the receiver 120, a combination of the first encoded data packet 210-1 with the second encoded data packet could result 210-2 an effective code rate of R '= 1 / (1 / Ri + I / R2) = 1 / (2 + 3) = 1/5 can be achieved, which increases the probability of successful decoding of the user data 1 12. Decoding of the packet core data 212-n ensures that the correct packets are combined with one another.

According to exemplary embodiments of the present invention, the encoder ENC can now be designed to generate at least one predefined group or all of the encoded data packets 210-n such that they can each be decoded on the decoder side on their own during a (sufficiently correct) transmission in order to obtain the associated user data 1 12. In addition, the encoder ENC can be designed such that a predetermined selection of the coded further data packets 210-n (n = 2, 3,... N) can also be combined and decoded, for example by returning the puncturing. For example, the majority of the channel-coded data packets 210-n can be generated from a single, longer channel-coded data packet 210 by suitable puncturing, the folding code and the puncturing being selected such that each of the plurality of the channel-coded data packets can be decoded by itself / or all possible combinations of data packets 210-n (2, 3, ... N data packets) can be decoded by returning the puncturing.

These properties can be obtained, for example, by the choice of the generator polynomials for the convolutional encoder ENC and the puncturing pattern (puncturing scheme). Furthermore, the generator polynomials for the convolutional encoder ENC and the puncturing pattern (puncturing scheme) can be adapted to the specific data rate, coding rate and detection threshold SNR of the transceiver system. Specifically, performance characteristics can be obtained or set for the decoding by the coded transmission packets 210-n. For example, the generator polynomials for the convolutional encoder ENC and the puncturing pattern can be selected such that a desired performance is achieved on the decoder side, for example independently of which coded data packets 210-n or which predefined group of coded data packets are combined and decoded on the receiver side becomes.

Furthermore, exemplary embodiments are also conceivable in which the data of the first data packet 210-1 (coded user data + redundancy) are not exactly repeated in a later data packet, but rather only additional redundancy information is sent which would not be possible without the data of the first data packet 210-1 alone would be decodable. In other words, in such a case, only the user data 112 and associated redundancy information for error detection and correction would be sent in the first data packet 210-1. In on it The following data packets 210-2, 210-3, ..., 210-N would then only be sent incrementally additional redundancy information che che. This will be explained in more detail with reference to FIG. 5.

At the transmitter end, the user data 1 12 and error-detecting bits (CRC) are first coded, for example, using a systematic “mother” code. This results in a code word 410 consisting of systematic bits 412 and parity bits 414. In a first data field 214-1 sent at a time ti, the systematic part 412 of the code word and a certain number, ie not all, of parity bits 414-1, which together are one Form code word 420 of a parent code, transmitted to receiver 120. The transmitter 110 sends at a further point in time t2 in a data field 214-2 of a subsequent encoded data packet 210-2 additional parity bits 414-2 with possibly different performance or via different channel conditions. The transmitter 110 sends a further time t _β in a further data packet 214-3 additional parity bits 414-3, etc.

At the receiver end, an attempt is first made to decode code word 420. If an error-free decoding is not possible, a new decoding attempt is made, the additional parity bits 414-2 of the data packet 210-2 being combined with the previously received parity bits 414-1 of the data packet 210-1. This process can be repeated until the decoding of the user data 1 12 is successful.

The redundant information sent in the incremental part enables the effective code rate R ’resulting from the combination to be adapted to the channel or transmission properties. In the normal case, i.e. H. with a good channel or little interference between the participants, only the punctured code of the first data packet 210-1 is used first and only with decreasing channel quality are the punctured digits in the subsequent data packets 210-2, 210-3,. .., 210-N are included, used to increase the correction ability.

In each of the different cases, the number of data packets 210-n (n = 1, 2,..., N) ultimately combined for error-free decoding is inversely proportional to the SNR at the receiving end. That is, the worse the reception conditions, the larger the number of data packets to be combined.

FIG. 6 once again illustrates a possible structure of a data packet 210-n (n = 1, 2, ..., N). The better protected core area 212-n (n = 1, 2, ..., N) of the data packet 210-n (n = 1, 2, ..., N) contains the packet core data in the form of an optional transmitter identification number or part of it (ID / Sub-ID), as well as the number of the transmission packet (packet number). Before seeing the transmitter identification number or part of it is particularly advantageous for large numbers of participants M.

As already mentioned, the core area 212-n (n = 1, 2, N) is better protected than the user data area 214-n (n = 1, 2, N), so that it can also operate under extremely bad channel conditions (worst case ) can be decoded. Such bad transmission conditions occur at maximum temporal interference of the received data packets at the receiver 120, i. that is, when all M participants happen to send at the same time. Such transmission conditions also occur with transmissions over large distances.

The decoding threshold of the packet core data 212-n (n = 1, 2, ..., N) should be at least equal to or even better than the decoding threshold of the (useful) data fields 214-n (n = 1, 2, ..., N) when combining all N data packets 210-n. That is, the core area 212-n (n = 1, 2, ..., N) should be at least as much or more relative to its source information 512-n (n = 1, 2, ..., N) Redundancy information 513-n (n = 1, 2, ..., N) have, like the sum of the redundancy information 515-n (n = 1, 2, ..., N) of all N data packets 210-n (n = 1, 2, ..., N) of a transmission time interval T. For example, the core area 212-n (n = 1, 2, ..., N) could be protected with a convolutional code of rate! 4, while the useful data 1 12 could be protected an effective convolutional code of the rate! are protected. If the coded user data 214-n were divided into N = 2 user data packets, each data packet would have a rate of 1 per se and therefore no additional redundancy. When combining the two blocks in the receiver 120, e.g. B. the information of the second packet 210-2 can be used as redundancy information of the first packet 210-1.

If the user data are now coded by a convolutional code of rate 1/2, the number of coded user data is therefore twice as large as the number of uncoded user data. If this double number of coded user data is now transmitted in two data packets, the length of a data packet is equal to the length of the uncoded user data. If one considers the code rate between the uncoded user data and the coded user data of a data packet, the code rate 1 results. The division of the data into the two data packets can be carried out in such a way that each data packet can be decoded individually and when the two are combined Data packets in the receiver the code rate 1/2 arises. The coded user data is thus divided into two data packets which are sent out by the transmitter at different times. In addition to the higher redundancy in the core area 212-n (n = 1, 2, N), it is also advantageous to provide a synchronization word 516-n (n = 1, 2, N) in the core area, with the aid of which the receiver 120 can synchronize as quickly as possible. This synchronization or the synchronization word 516-n (n = 1, 2, ..., N) is used in every data packet 210-n (n = 1, 2, ..., N), since in a multi-user system everyone Sen has its own reference clock source (oscillator) with different tolerance. According to a further exemplary embodiment, the device ENC is therefore designed to generate the packet core data 212-n (n = 1, 2, ..., N) of a channel-coded data packet 210-n (n = 1, 2, ... , N) further provided with synchronization data 516-n (n = 1, 2, ..., N) in order to enable the receiver 120 to detect the channel-coded data packet 210-n (n = 1, 2, ..., N) from the transmitter 1 10-m (m = 1, 2, ..., M). For example, the synchronization data 516-n (n = 1, 2, ..., N) could be a so-called Manchester code. The man chester code is a line code that receives the clock signal when encoded. A bit sequence modulates the phase position of a clock signal in binary form. The detection threshold, i.e. the SNR, at which the receiver 120 must recognize a single reception packet 210-n (n = 1, 2, ..., N) depends on an overall sensitivity of the receiver 120, which is the case when all are combined Receive packages 210-1, 210-2, ..., 210-N results. That is, the more data packets 210-n can be combined, the further the reception threshold drops, and the greater the requirements for the synchronization of the receiver 120.

The transmitters send their data packets 210-n (n = 1, 2,..., N) at pseudo-random times that are initially unknown to the receiver 120. If the receiver 120 is also mobile and not stationary, the transmitters in the reception area of the receiver 120 are constantly changing. If a transmitter 1 10-m transmits additional redundant data packets for code combining according to the invention, the receiver 120 should be able to assign the data packets to a sender so that the correct data packets can be combined. The assignment of the receive packets to a transmitter becomes difficult when the packet core data of an individual data packet cannot be uniquely decoded due to the disturbed transmission channel. In this case in particular, the decodability of the user data 1 12-m is to be improved by combining several redundant data packets. So if in a disturbed transmission channel many reception packets from several transmitters were received incompletely and have to be combined with each other, this can be done, for example, by trying out all possible combinations. Incomplete reception in the case mentioned here is, for example, such that the data packets cannot be clearly assigned to a sender because, for example, the ID was received incorrectly. With a small number of transmitters, this may still be practical. However, the number of reception packets increases, e.g. B. because there are a lot of transmitters in the reception area of the receiver, the computing power required for various possible combinations increases exponentially. According to exemplary embodiments of the present invention, however, these possible combinations can be deliberately restricted in the receiver 120, as a result of which the processing speed of the receiver 120 can be increased.

Due to the higher protection of the transmitter and packet identifier in the core area 212-n (n = 1, 2, ..., N) it can be ensured, even in the case of poor reception, that each reception packet 210-n (n = 1, 2, .. ., N) can be clearly assigned. This allows data packets from the same transmitters to be combined in the receiver 120, and it is possible to avoid computing effort for incorrect combinations which would result from the random combination of any data packets. Regarding the term "incorrect combinations", it is pointed out that this does not refer to missing combinations, but to combinations that do not lead to transmitted user data, i.e. that is, combinations with incorrect results. In the case of very long transmitter identifiers, which can be in the range of 48 bits and more, for example, a lot of redundancy information would be transmitted in the core area 212-n (n = 1, 2, ..., N) when using the entire transmitter identifier, which can lead to increased energy consumption and thus shortened battery life of the corresponding transmitter 1 10-m. In order to avoid this, according to one exemplary embodiment, only a part of the transmitter identifier (sub-ID) in the core area 212-n (n = 1, 2, ..., N) or only a smaller MAC address (message authentication code) ) be transmitted. This means that it is no longer possible to clearly assign data packets 210-n (n = 1, 2, ..., N) to a transmitter 1 10-m, since several transmitters have the same partial identifier in the core area 212-n (n = 1 , 2, ..., N), so that incorrect combinations can occur again. However, their number is much lower than in a unidirectional multi-user system without transmitter recognition in the protected core area 212-n (n = 1, 2, ..., N).

According to further exemplary embodiments of the present invention, the number of possible packet combinations can be restricted by using time information. The data packets 210-n (n = 1, 2,..., N) are usually sent by the transmitter 1 10-m randomly, but only within a certain transmission time window T. The receiver 120 can now further limit the number of possible data packet combinations by using this time information. That is, according to exemplary embodiments, the decoder DEC is formed on the receiver side in order to obtain information about the transmission time interval T for decoding the packet core data 212-n (n = 2, 3, ..., N) of the at least second channel-coded data packet 210- n (n = 2, 3, ..., N) to be used by the transmitter 1 10-m, such that starting from the first channel-coded data packet 210-1, the at least second channel-coded data packet 210-n (n = 2, 3, N) was received earlier or later at most a time period corresponding to the time interval T.

2. Simplified combination of channel-coded data packets

FIG. 7 shows a schematic block diagram of a communication system 100 with a plurality of data transmitters 1 10-m (m = 1, 2, ..., M) (for example nodes; for example sensor nodes) and a data receiver 120 (for example a base station) in accordance with an embodiment of the present invention.

Each of the data transmitters 1 10-m (m = 1, 2, ..., M) can have a device (for example an encoder (ENC)) for generating a plurality of channel-coded data packets from the user data 1 12-m (m = 1, 2, ..., M) and a device (for example a transmitter (TX)) for transmitting the plurality of channel-coded data packets in the time interval T to the data receiver 120. The data receiver 1 10 may have a device (e.g. receiver (RX)) for receiving at least one of the plurality of channel-coded data packets and a device (e.g. a decoder (DEC)) for decoding at least one of the plurality of channel-coded data packets.

In the following, one of the data transmitters 1 10-m (m = 1, 2, ..., M) and the data receiver 120 is to be explained in more detail, with the subscriber index m (m = 1, 2, ... , M) is mostly omitted.

The data transmitter 1 10 is designed to generate a plurality of channel-coded data packets 210-n (n = 1, 2, ..., N) from the user data 1 12, each of the channel-coded data packets 210-n (n = 1, 2, ..., N) packet core data 212-N (n = 1, 2, ..., N), wherein the packet core data 212-N (n = 1, 2, ..., N) with a channel code higher Redundancy is coded as the user data 214-n (n = 1, 2, ..., N). The data transmitter 1 10 is further configured to send the plurality of channel-coded data packets 210-n (n = 1, 2, ..., N) to the data receiver 120 in the time interval T, the data transmitter 1 1 being configured to to transmit the plurality of channel-coded data packets 210-n (n = 1, 2, ..., N) distributed in time and / or frequency.

The data receiver 120 is designed to receive at least one channel-coded data packet (for example a first channel-coded data packet) of the plurality of channel-coded data packets 210-n (n = 1, 2, N), such as the data packet 210-1 (or else just as well Good one of the data packets 210-2, 210-3, etc.), and to decode packet core data 212-1 of the channel-coded data packet 210-1 and, in the event of failure in error-free decoding of the channel-coded data packet 210-2, by at least one further channel-coded Data packet (eg a second channel-coded data packet) of the plurality of channel-coded data packets 210-n (n = 1, 2, ..., N), such as the data packet 210-2 (or just as well one of the data packets 210-3, 210-4, etc.), (to receive or select from a plurality of received channel-coded data packets, for example), and in order to increase the code gain by combining the channel-coded data packet 210-1 and the at least one further channel-coded data packet 210-2 for decoding the user data.

Typically, however, the data transmitter 120 not only receives a plurality of channel-coded data packets 210-n (n = 1, 2,..., N) from a data transmitter 1 10-1, but also a multiplicity of channel-coded data packets from a multiplicity of data transmitters 1 10-m (m = 1, 2, ..., M). However, the computing effort for decoding the packet core data (core data packets) of all received data packets, with the aim of identifying or determining related data packets that can be combined with one another in order to achieve a code gain in the event of a faulty transmission, is extremely high.

The present invention is therefore based on the idea of combining the plurality of channel-coded data packets 210-n (n = 1, 2,..., N) with both the data transmitter 110 and the data receiver 120 which are known or can be determined by the same. and / or to transmit frequency intervals so that the data receiver 120 can identify or ascertain at least one further channel-coded data packet for the combination with the channel-coded data packet in order to achieve a code gain on the basis of the known or determined time and / or frequency intervals, e.g. instead of having to decode the packet core data (core data packets) of all received data packets beforehand.

According to one embodiment, the channel-coded data packets 210-n (n = 1, 2, ..., N) can be transmitted at fixed, predetermined (e.g., defined) time and / or frequency intervals.

The data transmitter 1 10 can thus be designed to transmit the channel-coded data packets 210-n (n = 1, 2, ..., N) with fixed (for example defined) time and / or frequency intervals while the data receiver 120 can be configured to add a further channel-coded one based on the time and / or frequency intervals between the channel-coded data packets that are known to the data receiver and are predetermined (for example, defined) To determine the data packet of the plurality of channel-coded data packets for the combination with the channel-coded data packet.

According to a further exemplary embodiment, the channel-coded data packets 210-n (n = 1, 2, ..., N) can be transmitted with pseudo-random time and / or frequency intervals, where the pseudo-random time and / or frequency intervals are based on an intrinsic parameter of the Data transmitter 1 10, the data receiver 120 or the communication system 100 are derived.

The data transmitter 1 10 can thus be designed to send the channel-coded data packets 210-n (n = 1, 2, ..., N) with pseudo-random time and / or frequency intervals, the pseudo-random time and / or frequency intervals of an inherent parameter of the data transmitter 110, the data receiver 120 or the communication system 100 are derived.

The data receiver 120 can be designed to derive the pseudo-random time and / or frequency intervals from an intrinsic parameter of the data transmitter 110, the data receiver 120 or the communication system 100, and based on the pseudo-random time and / or frequency intervals between the channel-coded data packets 210-n (n = 1, 2, ..., N) a further channel-coded data packet of the plurality of channel-coded data packets 210-n (n = 1, 2, ..., N) for the combination with the to determine channel-coded data packet.

According to a further exemplary embodiment, the channel-coded data packets 210-n (n = 1, 2,..., N) can be transmitted with pseudo-random time and / or frequency intervals, where the pseudo-random time and / or frequency intervals differ from information which with the packet core data 212-n (n = 1, 2, ..., N) of the channel-coded data packets 210-n (n = 1, 2, ..., N).

The data transmitter 1 10 can thus be designed to send the channel-coded data packets 210-n (n = 1, 2, ..., N) with pseudo-random time and / or frequency intervals, the pseudo-random time and / or frequency intervals of information derived with the packet core data 212-n (n = 1, 2, ..., N) of the channel-coded data packets 210-n (n = 1, 2, ..., N).

The data receiver 120 can be designed to determine the pseudorandom time and / or frequency intervals from information that is associated with the packet core data 212-n (n = 1, 2, ..., N) channel-coded data packets 210-n (n = 1, 2, N) is transmitted, and in order to based on the pseudo-random time and / or frequency intervals between the channel-coded data packets 210-n (n = 1, 2, ..., N) to determine a further channel-coded data packet of the plurality of channel-coded data packets 210-n (n = 1, 2, ..., N) for the combination with the channel-coded data packet.

For example, the information can be at least part of the error protection data with which the packet core data 212-n (n = 1, 2, ..., N) are provided.

According to a further exemplary embodiment, the channel-coded data packets 210-n (n = 1, 2, ..., N) can be transmitted with pseudo-random time and / or frequency intervals, where the pseudo-random time and / or frequency intervals can be transmitted using a deterministic random number generator are generated, a start state of the deterministic random number generator being known to the data transmitter 110 and the data receiver 120.

The data transmitter 1 10 can thus be designed to send the channel-coded data packets 210-n (n = 1, 2, ..., N) with pseudo-random time and / or frequency intervals, the data transmitter being designed to transmit the pseudo-random time - and / or to determine frequency spacings by means of a deterministic random number generator.

The data receiver 120 can be designed to determine the pseudo-random time and / or frequency intervals by means of a deterministic random number generator and to use the pseudo-random time and / or frequency intervals between the channel-coded data packets 210-n (n = 1, 2 , ..., N) to determine a further channel-coded data packet of the plurality of channel-coded data packets 210-n (n = 1, 2, ..., N) for the combination with the channel-coded data packet.

For example, the start state can be an intrinsic parameter of the data transmitter 110, the data receiver 120 or the communication system 100, or else an information which is channel-coded with the packet core data 212-n (n = 1, 2, ..., N) Data packets 210-n (n = 1, 2, ..., N) is transmitted.

Detailed exemplary embodiments of the data transmitter 110 and the data receiver 120 are described in more detail below.

2.1 Fixed times (and frequencies ^' ) between the channel-coded data packets Instead of the random times between the data packets (within the time interval T), fixed times can be chosen between the at least two data packets. Here, the time between two reference points (eg the middle or beginning of the synchronization sequence) is specified in the data packets, as is indicated in FIG. 8.

8 shows a schematic view of an occupancy of a communication channel between data transmitter 110 and data receiver 120 during the transmission of a plurality of channel-coded data packets 210-n (n = 1, 2, ..., N) within a time interval T, wherein Time intervals between the channel-coded data packets 210-n (n = 1, 2, ..., N) are fixed. As is also indicated in FIG. 8, the channel-coded data packets 210-n (n = 1, 2, ..., N) each comprise packet core data 212-n (n = 1, 2, ..., N) and coded user data 210-n (n = 1, 2, ..., N).

In other words, FIG. 8 shows the transmission of the data packets within the time period T. In contrast to FIG. 1, the times between the data packets 210-n (n = 1, 2, ..., N) are no longer random chosen, but defined by the times t1, ...., tn.

The time of the first data packet 210-1 can also be random and can be selected by the data transmitter 110 as described above (see section 1). Due to the fixed definition of the times between the data packets 210-n (n = 1, 2, ..., N), the first data packet 210-1 thus provides the reference for the following data packets 210-n (n = 2, 3, ..., N).

In exemplary embodiments, the times between the data packets 210-n (n = 1, 2, ..., N) can be the same for all transmissions and subscribers 1 12-m (m = 1, 2, ..., M). In other words, in the case of exemplary embodiments, the times between the data packets 210-n (n = 1, 2,..., N) can be defined once (ie fixedly defined or specified) and then always by all participants 1 12-m (m = 1, 2, ..., M) can be used.

This information can be used in the data receiver 120 if a core data packet (e.g. 212-1) has been received correctly but the useful data (e.g. 214-1) cannot be decoded. In this case (first case), the data receiver 120 can directly search the data packets (e.g. user data 214-n (n = 2, 3, ..., N)) of the other data packets (e.g. 210-n (n = 2 , 3, ..., N)) received or loaded from memory and decode the data using code combining.

In the case of exemplary embodiments, provided that a core data packet (for example 212-1) is received correctly, the user data (for example 214-1) cannot, however, directly via the temporal relationships corresponding other data packets (e.g. 210-n (n = 2, 3, N)) for code combining without partner search (see section 1) are extracted.

In the second case, in which both the core data packet (eg 212-1) and the user data (214-1) can be decoded, the temporal relationships between the data packets 210- n (n = 1, 2, ..., N) another advantage.

After the correct decoding of the data packet (e.g. 210-1), the times of the following data packets 210-n (n = 2, 3, ..., N), which carry further redundancy, are known. Detection / decoding at these times does not have to be carried out. This enables the data receiver to save 120 computing power, which may be required for other processes.

In exemplary embodiments, provided that a data packet (e.g. 210-1) has been correctly decoded with the user data, the following data packets 210-n (n = 2, 3, ..., N) can no longer be detected / decoded.

In large networks there are often data recipients according to Section 1, who perform the code combining using a partner search. So that new data transmitters (eg nodes) 110, which already have the fixed time intervals, can also be received by these data receivers 120, it is important to determine the times between the data packets 210-n (n = 1, 2, ..., N ) to be chosen so that it does not exceed the time period T.

In exemplary embodiments, the times between the data packets 210-n (n = 1, 2, ..., N) can be selected such that the maximum time period T from section 1 is not exceeded.

If the communication system 100 uses a frequency hopping method between the data packets 210-n (n = 1, 2,..., N) or the transmissions, the frequency spacing between the data packets 210-n (n = 1 , 2, ..., N) are also defined (for example predetermined) and known to the data receiver 120.

In exemplary embodiments, the frequency offsets between the data packets 210-n (n = 1, 2, ..., N) can be defined (e.g. predefined, e.g. predefined), wherein the frequency offset can also be zero.

2.2 Pseudo random times (and frequencies) between the channel-coded data packets Conventionally, the times between the data packets 210-n (n = 1, 2, N) are chosen randomly, which achieves the best performance against self-interference in the system 100, but a very high outlay in the data receiver 120 for the partner search and the subsequent code combining means.

Section 2.1 solved the problem of complexity (computing power) in the data receiver, but this has the disadvantage that the probability of a total interference by another participant (self-interference) (e.g. another data transmitter 1 10-m (m = 1, 2, ..., M) is maximized.

In exemplary embodiments, the times between the data packets 210-n (n = 1, 2, ..., N) are therefore not fixed, but are chosen pseudorandomly on the basis of a (operating) parameter which is in the core data packet 212-n (n = 1, 2, ..., N). This can be, for example (part of) the data which is transmitted in the core data packet 212-n (n = 1, 2, ..., N). For example, (part of) the CRC (CRC = cyclic redundancy check, German: cyclic redundancy check), which is transmitted in the core data packet 212-n (n = 1, 2, ..., N), is particularly advantageous since it usually changes with every broadcast.

In embodiments, the times between data packets 210-n (n = 1, 2, ..., N) can be selected pseudorandomly by (or based on) an intrinsic parameter of the system.

In embodiments, the intrinsic parameter of the system may be the CRC in the core data packet 212-n (n = 1, 2, ..., N).

If the system uses a frequency hopping method similar to section 2.1 between data packets 210-n (n = 1, 2, ..., N) or the transmissions, the frequency spacing between data packets 210-n (n = 1, 2, ..., N) are also pseu randomly chosen by an intrinsic parameter of the system.

In exemplary embodiments, the frequency offsets between the data packets 210-n (n = 1, 2, ..., N) can be selected pseudorandomly by (or based on) an intrinsic parameter of the system.

A data packet (eg 210-1) arrives in the data receiver 120, in which the core data packet (eg 212-1) is correctly received, but the user data (eg 214-1) are not decoded , the data receiver 120 calculates the temporal position of the other data packets 210-n (n = 2, 3, N) on the basis of the immanent parameter and thus carries out the code combining as described in section 2.1.

In the case of exemplary embodiments, when a non-decodable data packet (eg 210-1) is received, the times between the data packets 210-n (n = 1, 2, ..., N) can be calculated according to the intrinsic parameter and the code combining according to section 2.1 can then be carried out will.

The detection / decoding in Section 2.1 at the points in time at which the further redundancy for the data packet (eg 210-1) is received repeatedly can also be used here, however, if reception is correct, the times for the next data packets 210- n (n = 2, 3, ..., N) are calculated and are not implicitly known.

In the case of exemplary embodiments, if a single data packet (for example 210-1) is received correctly, the detection / decoding for the following data packets 210-n (n = 1, 2, ..., N) can be suspended analogously to section 2.1 if the times are up Basis of the intrinsic parameter can be calculated.

If the use of pseudorandom times between data packets 210-n (n = 1, 2, ..., N) should also be possible with data receivers according to Section 1, the pseudorandom times must be limited to the maximum time period T.

In the case of exemplary embodiments, the limits of the pseudo-random choice of times can be restricted so that the times do not exceed the maximum time period T.

Exemplary values of an exemplary communication system 100 are given below for illustration purposes. It is assumed that the maximum time T of the system 100 is e.g. 2 seconds (note: in practice approx. 2 minutes), the transmission of the user data in e.g. three data packets 210-1, 210-2, 210-3 and the data rate of the system 100 is e.g. 100 kSym / s.

If a temporal resolution is to take place in symbol steps (T _sym ), the intrinsic parameter should have at least the following length in bit M:

Tsym = 1 symbol / 100 kSym / s = 10 ps With a duration of T = 2 seconds, this results in N possible time states, which can be chosen pseudo randomly:

N = 2 s / 10 ps = 200,000 states

In order to be able to cover all these states with a number, at least B bits are necessary: B = ceil (ld (200000)) = 18 bits with ceil = rounding up to the next integer

Id = logis dualis

Since the entire transmission is divided into three data packets 210-1, 210-2, 210-3, there are therefore two times between the data packets 210-1, 210-2, 210-3. So that these two times are independent of each other, different bits should be used on the immanent parameter. The minimum length of the intrinsic parameter is:

M = 2 ^* B = 2 ^* 18 bits = 36 bits

In the case of exemplary embodiments, the length of the immanent parameter can be selected such that all possible time states can be achieved using this parameter.

Typically, however, the length of the immanent parameter is shorter than the necessary length so that all possible time states are possible. According to the explanations described above, the maximum period would not be used.

In exemplary embodiments, the intrinsic parameter can therefore be used as the start state of a de-terministic random number generator (pseudorandom binary sequence (PRBS) generator). An example of such a generator would be a linear feedback shift register (LFSR).

The immanent parameter or part of the transmitted packet core data is introduced into the shift register and then the deterministic random number sequence is calculated until the necessary number of bits has been reached. When choosing the immanent parameter that is inserted into the shift register, care should be taken to select a seed that has the maximum sequence length. If this is not given by the intrinsic parameter, this could be achieved by deliberately exchanging / flipping individual bits.

In embodiments, the intrinsic parameter can be used as the start state of a deterministic random number generator.

In exemplary embodiments, the number of bits generated from the random number generator can correspond at least to the necessary number of bits so that all possible time states can be achieved.

In embodiments, the same PRBS generator can be used to generate the time intervals and the frequency offsets.

In the case of exemplary embodiments, different PRBS generators can be used to generate the time intervals and the frequency offsets. These can be coupled. As far as it has been learned what one has just rolled, it is known what the other should roll.

2.3 Times (and frequencies ^' ) between repeated frames

The data packets 210-n shown in FIGS. 1 and 8 (n = 1, 2, ..., N) result in a so-called frame.

These frames are often sent out several times (at least twice) to increase interference immunity. In other words, the transmission is repeated.

Conventionally, a random time unknown to the data recipient is inserted between these repetitions.

Since the times within a frame are typically chosen such that the time period T is almost exhausted, no combined decoding of the at least two frames is possible. If the time between the transmissions is now fixed, as in section 2.1, combined decoding can also take place across the frames, since the data receiver 120 knows directly when the data packets of the following frame are transmitted.

The same applies if the time between the frames is chosen pseudorandomly based on an intrinsic parameter of the system (see section 2.2). In this case, the time after receiving a core data packet can be calculated without the user data being decodable.

Optionally, the intrinsic parameter used to determine the time between frames can be different from the parameter used for times within a frame.

In the case of exemplary embodiments, when a frame is sent repeatedly, the times between the frames can be selected either fixedly or pseudorandomly on the basis of an intrinsic parameter.

In the case of repeated transmission, the exemplary embodiments are welcome. Also combine section 2.1 and section 2.2. For example, the times between the data packets can be fixedly defined, while the times between the frames are pseudo-random.

This can be advantageous for the data receiver 120, since in most cases the decoding of one of the two frames works and only in very rare cases, in which both frames cannot be decoded separately, must the time difference between the two frames be based on the inherent parameter be calculated.

In exemplary embodiments, the times between the data packets can be fixedly defined, while the times between the frames are calculated pseudorandomly on the basis of the intrinsic parameter.

In general, other levels are also conceivable. On the third level, M frames form a cluster. The times between the clusters can then either be defined or generated again using a PRBS sequence.

According to a first option, the times (and optionally also the frequencies) can be fixedly defined at the lowest level, while on the level above the times (and optionally also the frequencies) are determined by a PRBS sequence. According to a second option, the times (and optionally also the frequencies) can be pseudo-random (eg CRC) at the lowest level, while at a higher level the times (and optionally also the frequencies) are determined by a PRBS sequence.

According to a third option, the times (and optionally also the frequencies) can be determined at the lowest level by a PRBS sequence, while on the level above the times (and optionally also the frequencies) are really random.

According to a fourth option, the times (and optionally also the frequencies) can be determined at the lowest level by a PRBS sequence, while on the level above the times (and optionally also the frequencies) are known to be pseudo-random (e.g. CRC).

In exemplary embodiments, any hierarchical combination can take place over any number of levels of the methods for determining the times.

3. Further execution examples

FIG. 9 shows a flowchart of a method 200 for sending user data within a time interval via a communication channel, according to an exemplary embodiment of the present invention. The method 200 comprises a step 202 of generating a plurality of channel-coded data packets from the user data, each of the channel-coded data packets having packet core data corresponding to a packet identifier which is different for each data packet, and the packet core data being encoded with a channel code of higher redundancy than the user data . Furthermore, the method 200 comprises a step 204 of sending the plurality of channel-coded data packets in the time interval, the plurality of channel-coded data packets in time and / or frequency, with predefined (for example defined; for example known to the data receiver) time intervals and / or Fre interval intervals, are distributed.

10 shows a flowchart of a method 210 for receiving user data which are transmitted within a time interval by means of a plurality of channel-coded data packets via a communication channel, according to an exemplary embodiment of the present invention. Each of the channel-coded data packets has packet core data corresponding to a packet identifier of the respective channel-coded data packet, the packet core data being encoded with a channel code of higher redundancy than the useful data, the plurality of channel-coded data packets being distributed in time and / or frequency are, wherein a time interval and / or frequency interval between the channel-coded data packets is specified, the method comprising. The method 210 comprises a step 212 of receiving at least one channel-coded data packet (eg a first channel-coded data packet) of the plurality of channel-coded data packets. The method 210 further includes a step 214 of decoding packet core data of the channel-encoded data packet. Furthermore, the method 210 comprises a step 216 of determining (for example receiving or selecting from a plurality of received channel-coded data packets), in the event that an error-free decoding of the channel-coded data packet, a further channel-coded data packet (for example a second channel-coded data packet) of the plurality of channel-coded data packets based on the predetermined time interval and / or frequency interval between the channel-coded data packets, and in order to obtain an increased code gain for decoding the useful data by a combination of the channel-coded data packet and the further channel-coded data packet.

1 1 shows a flow diagram of a method 220 for transmitting useful data within a time interval from a data transmitter via a communication channel to a data receiver, according to an exemplary embodiment of the present invention. The method 220 comprises a step 222 of generating a plurality of channel-coded data packets from the user data, each of the channel-coded data packets having packet core data corresponding to a packet identifier that is different for each data packet, and where the packet core data is encoded with a channel code of higher redundancy than that The process 220 further comprises a step 224 of transmitting the plurality of channel-coded data packets in the time interval, the plurality of channel-coded data packets in time and / or frequency, with pseudo-random time intervals and / or frequency intervals between the channel-coded data packets , are distributed, the pseudo-random time intervals and / or frequency intervals between the channel-coded data packets

based.

12 shows a flowchart of a method 230 for receiving user data, which are transmitted within a time interval by means of a plurality of channel-coded data packets from a data transmitter via a communication channel to a data receiver, according to an exemplary embodiment of the present invention. Each of the channel-coded data packets packet core data corresponding to a packet identifier of the respective channel-coded data packet, the packet core data being encoded with a channel code of higher redundancy than the user data, the plurality of channel-coded data packets being transmitted in a distributed manner in time and / or frequency, with a time interval and / / o The frequency spacing between the channel-coded data packets is pseudo-random. The method 230 comprises a step 232 of receiving at least one channel-coded data packet (eg a first channel-coded data packet) of the plurality of channel-coded data packets. The method 230 further comprises a step 234 of decoding packet core data of the channel-encoded data packet. Furthermore, the method 230 comprises a step 236 of determining (for example receiving or selecting from a plurality of received channel-coded data packets), in the event that an error-free decoding of the channel-coded data packet, a further channel-coded data packet (for example a second channel-coded data packet) of the plurality of channel-coded packets fails Data packets based on a determined pseudorandom time interval and / or frequency interval between the channel-coded data packets in order to obtain an increased code gain for decoding the user data by a combination of the channel-coded data packet and the further channel-coded data packet, the pseudorandom time intervals and / or frequency intervals between the channel-coded data packets based on

an intrinsic parameter of the data transmitter, the data receiver or a communication system of the data receiver (e.g. and data transmitter), or

is determined.

13 shows a flowchart of a method 240 for transmitting useful data within a time interval via a communication channel, according to an exemplary embodiment of the present invention. The method 240 comprises a step 242 of generating a plurality of channel-coded data packets from the user data, each of the channel-coded data packets having packet core data corresponding to a packet identifier which is different for each data packet, and the packet core data being encoded with a channel code of higher redundancy than the user data . The method 240 further comprises a step 244 of transmitting the plurality of channel-coded data packets in a first time interval, the plurality of channel-coded data packets being transmitted distributed over the time and / or frequency. The method 240 further comprises a step 246 of repeatedly transmitting the plurality of channel-coded data packets in a second time interval, the plurality of channel-coded data packets being transmitted distributed over the time and / or frequency are, wherein a time interval between the first time interval and the second time interval is fixed, or wherein a time interval between the first time interval and the second time interval is random or pseudo-random.

14 shows a flowchart of a method 250 for receiving user data which are transmitted within a first time interval by means of a plurality of channel-coded data packets via a communication channel, according to an exemplary embodiment of the present invention. Each of the channel-coded data packets has packet core data corresponding to a packet identifier of the respective channel-coded data packet, the packet core data being encoded with a channel code of higher redundancy than the useful data, the plurality of channel-coded data packets being transmitted in a time and / or frequency manner, wherein the plurality of channel-coded data packets are repeatedly transmitted within a second time interval. The method 250 comprises a step 252 of receiving at least one channel-coded data packet (eg a first channel-coded data packet) of the plurality of channel-coded data packets. The method 250 further comprises a step 254 of decoding packet core data of the at least one channel-coded data packet. Furthermore, the method 250 comprises a step 256 of determining (eg received or selecting from a multiplicity of received channel-coded data packets), in the event of an error-free decoding of the channel-coded data packet, of a further channel-coded data packet (eg a second channel-coded data packet) of the plurality of channel-coded data packets based on a time interval and / or frequency interval between the channel-coded data packets, in order to obtain an increased code gain for decoding the useful data by combining the channel-coded data packet and the at least one further channel-coded data packet. Furthermore, the method 250 comprises a step 258 of determining (for example, receiving or selecting from a multiplicity of received channel-coded data packets) in the event of failure of error-free decoding of the channel-coded data packets of the first time interval based on a combination of the first channel-coded data packet and the at least one further channel-coded data packets of the first time interval, at least one further channel-coded data packet (for example a third channel-coded data packet) of the plurality of channel-coded data packets of the second time interval, in order to determine the useful data (for example by combining the at least one further channel-coded data packet of the second time interval with the channel-coded data packet and / or the at least one further channel-coded data packet of the first time interval), a time interval between the first time interval and the second time interval being fixed, or where at ei n The time interval between the first time interval and the second time interval is due or pseudo-random. Embodiments of the present invention are used in a system for the transmission of small amounts of data, for example sensor data such as heating, electricity or water meters. A measuring device with a radio transmitter can be attached to the counters / sensors, which wirelessly transmits the data to a data receiver. The system described typically has no return channel and each data transmitter transmits its data at a pseudorandom point in time that is unknown to the data receiver. A data receiver receives a large number of transmission signals from various counters or sensors (data transmitters). Embodiments of the present invention are concerned with the wireless transmission method, which can also be transmitted to other application areas.

In contrast to conventional data receivers, which have to store all incorrectly decoded data packets over the length of the time period T and have to wait until a further data packet is available for code combining, exemplary embodiments create various possibilities which make this partner search superfluous or the partner search simplify significantly.

Exemplary embodiments make it possible to be able to define a fixed reference for the transmission. This can be, for example, the start of the first data packet or the end of the last data packet. With this reference, further communication (e.g. in the downlink) can be triggered, for example, after a (fixed) defined time of the last data packet, as will be explained below with reference to FIG. 15.

15 shows a schematic view of an assignment of a communication channel between data transmitter 110 and data receiver 120 during the transmission of a plurality of channel-coded data packets 210-n (n = 1, 2, ..., N) within a first transmission time interval T1 301 ( = first time interval) (eg frame) and a transmission of at least one (eg channel-coded) data packet 21 1 within a first reception time interval Trx1 302 from the data receiver 120 to the data transmitter 110, according to an embodiment of the present invention.

According to one exemplary embodiment, a time interval 303 between predetermined ranges (for example start times) of the first transmission time interval T1 301 and the first reception interval Trx1 302 can be predetermined (for example fixed or defined) and known to both the data transmitter 110 and the data receiver 120 be. According to a further exemplary embodiment, a time interval 303 between predetermined areas (for example start times) of the first transmission time interval T1 301 and the first reception time interval Trx1 302 can be pseudo-random, wherein both the data transmitter 110 and the data receiver 120 can determine the pseudo-random time interval 303.

For example, the data transmitter 110 and the data receiver 120 can derive the time interval 303 from an intrinsic parameter of the data transmitter 110, the data receiver 120 or a communication system 100 of the data transmitter 110 and / or data receiver 120.

For example, the data transmitter 110 and the data receiver 120 can be the time interval 303 from information that is associated with the packet core data 212-n (n = 1, 2, ..., N) of the channel-coded data packets 210-n (n = 1 , 2, ..., N) is transferred.

For example, the data transmitter 110 and the data receiver 120 can determine the time interval 303 by means of a deterministic random number generator. In this case e.g. (1) the intrinsic parameters of the data transmitter 1 10, the data receiver 120 or a communication system 100 of the data transmitter 1 10 and / or the data receiver 120 or (2) the information associated with the packet core data 212-n (n = 1, 2, .. ., N) of the channel-coded data packets 210-n (n = 1, 2, ..., N) is transmitted, can be used as the start state of the deterministic random number generator.

15 also shows the occupancy of the communication channel between the data transmitter 110 and the data receiver 120 during the repeated transmission of the plurality of channel-coded data packets 210-n ^* (n = 1, 2, ..., N) within a second transmission time interval T2 305 (= second time interval) (e.g. Frame2).

As indicated in FIG. 15, the time interval 306 between predetermined areas (e.g. start times) of the first transmission time interval T1 301 and the second transmission time interval T2 305 can, as has already been explained in detail above, be fixed or pseudo random (e.g. from an immanent one Parameters (e.g. CRC) or a pseudorandom bit sequence (PRBS).

As further indicated in FIG. 15, at least one (channel-coded) data packet 21 1 ^* can also be transmitted from the data receiver 120 to the data transmitter 110 within a second reception time interval Trx2 307. Here, too, the time interval between predetermined areas (for example start times) of the second transmission time interval T2 305 and the second reception time interval Trx2 307, as described above, can be fixed or pseudo random (eg derived from an intrinsic parameter (eg CRC) or a pseudo random bit sequence (PRBS)).

Although some aspects have been described in connection with a device, it is understood that these aspects also represent a description of the corresponding method, so that a block or a component of a device is also to be understood as a corresponding method step or as a feature of a method step . Analogously, aspects described in connection with or as a method step also represent a description of a corresponding block or details or features of a corresponding device. Some or all of the method steps can be carried out by a hardware apparatus (or using a Hardware apparatus), such as a microprocessor, a programmable computer or an electronic circuit. In some embodiments, some or more of the most important process steps can be performed by such an apparatus.

Depending on the specific implementation requirements, exemplary embodiments of the invention can be implemented in hardware or in software. The implementation can be carried out using a digital storage medium, for example a floppy disk, a DVD, a Blu-ray disc, a CD, a ROM, a PROM, an EPROM, an EEPROM or a FLASH memory, a hard disk or one other magnetic or optical memory are carried out, on which electronically readable control signals are stored, which can cooperate or cooperate with a programmable computer system in such a way that the respective method is carried out. The digital storage medium can therefore be computer-readable.

Some exemplary embodiments according to the invention thus comprise a data carrier which has electronically readable control signals which are able to interact with a programmable computer system in such a way that one of the methods described herein is carried out.

In general, exemplary embodiments of the present invention can be implemented as a computer program product with a program code, the program code being effective to carry out one of the methods when the computer program product runs on a computer. The program code can, for example, also be stored on a machine-readable carrier.

Other embodiments include the computer program for performing one of the methods described herein, the computer program being stored on a machine-readable carrier.

In other words, an exemplary embodiment of the method according to the invention is a computer program that has a program code for performing one of the methods described herein when the computer program runs on a computer.

Another exemplary embodiment of the method according to the invention is thus a data carrier (or a digital storage medium or a computer-readable medium) on which the computer program for carrying out one of the methods described herein is recorded. The data carrier, the digital storage medium or the computer-readable medium are typically objective and / or non-transitory or non-temporary.

A further exemplary embodiment of the method according to the invention is thus a data stream or a sequence of signals which represents the computer program for carrying out one of the methods described herein. The data stream or the sequence of signals can, for example, be configured to be transferred via a data communication connection, for example via the Internet.

A further exemplary embodiment comprises a processing device, for example a computer or a programmable logic component, which is configured or adapted to carry out one of the methods described herein.

Another embodiment includes a computer on which the computer program for performing one of the methods described herein is installed.

A further exemplary embodiment according to the invention comprises a device or a system which is designed to transmit a computer program for performing at least one of the methods described herein to a receiver. The transmission can take place electronically or optically, for example. The recipient can be, for example Computer, mobile device, storage device or similar device. The device or the system can comprise, for example, a file server for transmitting the computer program to the recipient.

In some embodiments, a programmable logic device (for example a field programmable gate array, an FPGA) can be used to perform some or all of the functionalities of the methods described herein. In some embodiments, a field programmable gate array may cooperate with a microprocessor to perform one of the methods described herein. Generally, in some embodiments, the methods are performed by any hardware device. This can be a universally usable hardware such as a computer processor (CPU) or hardware specific to the method, such as an ASIC.

The devices described herein can be implemented, for example, using a hardware apparatus, or using a computer, or using a combination of a hardware apparatus and a computer.

The devices described herein, or any components of the devices described herein, may at least partially be implemented in hardware and / or in software (computer program).

For example, the methods described herein can be implemented using a hardware apparatus, or using a computer, or using a combination of a hardware apparatus and a computer.

The methods described herein, or any components of the methods described herein, can be performed at least in part by hardware and / or software.

The above-described embodiments are merely illustrative of the principles of the present invention. It should be understood that modifications and variations in the arrangements and details described herein will be apparent to those skilled in the art. Therefore, it is intended that the invention be limited only by the scope of the following claims and not by the specific details presented with the description and explanation of the embodiments herein.

Claims

1. Data transmitter (110-m) for transmitting useful data (112-m) within a time interval (T) via a communication channel to a data receiver (120), the data transmitter (110-m) being designed to encode a plurality of channels Generate data packets (210-n) from the user data (112-m), each of the channel-coded data packets (210-m) having core packet data (212-n) corresponding to a different packet identifier for each of the data packets (210-n), and the packet core data (212-n) being encoded with a channel code of higher redundancy than the user data, the data transmitter (1 10-m) being designed to transmit the plurality of channel-encoded data packets (210-n) in the time interval (T) to send the data receiver (120), wherein the data transmitter (1 10-m) is designed to distribute the plurality of channel-coded data packets (210-n) in time and / or frequency, with predetermined time intervals and / or frequency intervals send.

2. Data transmitter (110-m) according to claim 1, wherein the data transmitter (1 10-m) is designed to the plurality of channel-coded data packets (210-n) with regard to content, transmission times and / or transmission frequencies regardless of a return channel from the Send data receiver (120) to the data transmitter (1 10-m).

3. Data transmitter (110-m) according to one of claims 1 to 2, wherein the time interval is at least 20 s.

4. Data transmitter (110-m) according to one of claims 1 to 3, wherein the time intervals between the channel-coded data packets (210-n) are at least 8 s.

5. Data transmitter (110-m) according to one of claims 1 to 4, wherein a time interval between a first transmitted channel-coded data packets (210-1) of the plurality of channel-coded data packets (210-n) and a last transmitted channel-coded data packet (210 -N) of the plurality of channel-coded data packets (210-n) is at most 120 s.

6. Data transmitter (110-m) according to one of claims 1 to 5, wherein the data transmitter (110-m) is an energy self-sufficient data transmitter (110-m) with a maximum available energy of 20 Ah.

7. Data transmitter (110-m) according to one of claims 1 to 6, wherein the data transmitter (1 10-m) is designed to receive a first channel-coded data packet (210-1) of the plurality of channel-coded data packets (210-n) at a random or pseudorandom time, and / or wherein the data transmitter (110-m) is designed to transmit the first channel-coded data packet (210-1) of the plurality of channel-coded data packets (210-n) on a random or pseudo-random transmission frequency to send within the time interval.

8. The data transmitter (110-m) according to claim 7, wherein the data transmitter (1 10-m) is designed to transmit the channel-coded data packets of the plurality of channel-coded data packets (210-n) following the first channel-coded data packet (210-1). to send within the time interval.

9. Data transmitter (110-m) according to one of claims 1 to 8, wherein the time intervals and / or frequency intervals between the plurality of channel-coded data packets (210-n) are fixed.

10. Data transmitter (110-m) according to one of claims 1 to 9, wherein the time intervals and / or frequency intervals between the plurality of channel-coded data packets (210-n) are selected in accordance with a time interval pattern and / or frequency interval pattern such that a correlation result of an auto-correlation function of the time interval pattern and / or frequency interval pattern indicates as small as possible secondary peaks.

11. Data transmitter (110-m) according to any one of claims 1 to 10, wherein the time interval (T) is a transmission time interval, wherein the data transmitter (110-m) is designed to in a reception time interval following the transmission time interval (T) (Trx ) to receive at least one data packet (211) from the data receiver (120) or another data receiver.

12. Data transmitter (110-m) according to claim 1 1, wherein a time interval between the transmission time interval (T) and the reception time interval (Trx) is predetermined.

13. Data transmitter (110-m) according to claim 1 1, wherein a time interval between the transmission time interval (T) and the reception time interval (Trx) is pseudorandom.

14. Data transmitter (110-m) according to claim 13, wherein the data transmitter (110-m) is designed to base the pseudorandom time interval between the transmission time interval (T) and the reception time interval (Trx)

an inherent parameter of the data transmitter (1 10-m), the data receiver (120) or a communication system of the data transmitter (1 10-m) and / or data receiver (120), or

information which is transmitted with the packet core data (212-n) of the channel-coded data packets (210-n),

to derive.

15. Data transmitter (110-m) according to claim 13, wherein the data transmitter (110-m) is designed to determine the pseudo-random time interval between the transmission time interval (T) and the reception time interval (Trx) by means of a deterministic random number generator.

16. The data transmitter (110-m) according to claim 15, wherein the data transmitter (1 10-m) is designed to

an intrinsic parameter of the data transmitter (1 10-m), the data receiver (120) or a communication system (100) of the data transmitter (1 10-m) and / o the data receiver (120), or

to be used as the start state of the deterministic random number generator.

17. Data receiver (120) for receiving user data (112-m) which is transmitted within a time interval (T) by means of a plurality of channel-coded data packets (210-n) from a data transmitter (1 10-m) via a communication channel to the data receiver (120 ) are transmitted, each of the channel-encoded data packets (210-n) having packet core data (212-n) corresponding to a packet identifier of the respective channel-encoded data packet, and wherein the packet core data (212-n) are encoded with a channel code of higher redundancy than the user data (214-n), wherein the plurality of channel-coded data packets (210-n) are transmitted in current and / or frequency distribution, with a time interval and / or frequency interval between the channel-coded data packets (210-n) being predetermined, the Data receiver (120) is designed to receive at least one channel-coded data packet (210-1) of the plurality of channel-coded data packets (210-n), wherein the data receiver (120) is designed to receive packet codes decode data (212-n) of the channel-coded data packet (210-1) and, in the event of failure of error-free decoding of the channel-coded data packet (210-1), based on the predetermined time interval and / or frequency interval between the channel-coded data packets (210-n) to determine a further channel-coded data packet (210-2) of the plurality of channel-coded data packets (210-n), and to use a combination of nation of the channel-coded data packet (210-1) and the further channel-coded data packet (210-2) to obtain an increased code gain for decoding the useful data (214-1, 214-2).

18. Data receiver (120) according to claim 17, wherein the data receiver (120) has no return channel to the data transmitter (1 10-m) to the data transmitter (110-m) to retransmit a channel-coded data packet in the event of a failed decoding of the user data.

19. Data receiver (120) according to one of claims 17 to 18, wherein the data receiver (120) the predetermined time interval and / or frequency interval between the channel-coded data packets (210-n) is known.

20. Data receiver (120) according to one of claims 17 to 19, wherein the data receiver (120) is designed to decode packet core data (212-n) of a first received channel-coded data packet (210-1) of the time interval (T) and, in the case of successful decoding of the first channel-coded data packet (210-1), no further channel-coded data packets of the plurality of channel-coded data packets (210-n) are to be decoded.

21. Data receiver (120) according to one of claims 17 to 20, wherein the time interval (T) is a transmission time interval, wherein the data receiver (120) is designed to at least one in a transmission time interval following the transmission time interval (T) (Trx) Send data packet (21 1) to the data transmitter (110-m).

22. Data receiver (120) according to claim 21, wherein a time interval between the transmission time interval (T) and the reception time interval (Trx) is predetermined.

23. Data receiver (120) according to claim 21, wherein a time interval between the transmission time interval (T) and the reception time interval (Trx) is pseudorandom.

24. The data receiver (120) according to claim 23, wherein the data receiver (120) is designed to base the pseudorandom time interval between the transmission time interval (T) and the reception time interval (Trx)

an inherent parameter of the data transmitter (1 10-m), of the data receiver (120) or of a communication system (100) of the data transmitter (110-m) and / o of the data receiver (120), or

to derive.

25. The data receiver (120) according to claim 23, wherein the data receiver (120) is designed to determine the pseudo-random time interval between the transmission time interval (T) and the reception time interval (Trx) by means of a deterministic random number generator.

26. The data receiver (120) according to claim 25, wherein the data receiver (120) is configured to

to be used as the start state of the deterministic random number generator.

27. System (100), having the following features: at least one data transmitter (110-m) according to one of claims 1 to 16, and a data receiver (120) according to one of claims 17 to 26.

28. The system (100) according to claim 27, wherein the at least one data transmitter (1 10-m) is a plurality of data transmitters (1 10-m), the plurality of data transmitters (1 10-m) being configured to the respective To transmit a plurality of channel-coded data packets (210-n) with the same predetermined time intervals and / or frequency intervals in the time and / or frequency.

29. Method (200) for sending user data (1 12-m) within a time interval (T) via a communication channel, the method (200) comprising:

Generating (202) a plurality of channel-coded data packets (210-n) from the user data (1 12-m), each of the channel-coded data packets having packet core data (212-n) corresponding to a different packet identifier for each data packet, and wherein the packet core data (212 -n) are coded with a channel code of higher redundancy than the user data (214-n),

Transmitting (204) the plurality of channel-coded data packets (210-n) in the time interval (T), the plurality of channel-coded data packets (210-n) being distributed at the current and / o frequency, with predetermined time intervals and / or frequency intervals be sent.

30. A method (210) for receiving user data (112-m), which are transmitted within a time interval by means of a plurality of channel-coded data packets (210-n) via a communication channel, each of the channel-coded data packets (210-n) being core packet data ( 212-n) corresponding to a packet identifier of the respective channel-coded data packet, and wherein the packet core data (212-n) are encoded with a channel code of higher redundancy than the user data (214-n), the plurality of channel-coded data packets (210-n) distributed in time and / or frequency, a time interval and / or frequency interval being specified between the channel-coded data packets (210-n), the method (210) comprising: Receiving (212) at least one channel-coded data packet (210-1) of the plurality of channel-coded data packets (210-n),

Decoding (214) packet core data (212-1) of the channel encoded data packet (210-

1 ),

Determining (216), in the event of failure of error-free decoding of the channel-coded data packet (210-1), a further channel-coded data packet (210-2) of the plurality of channel-coded data packets (210-n) based on the predetermined time interval and / or frequency interval between the channel-coded data packets (210-n) in order to increase the code gain for decoding the user data (214-1, 214-2) by combining the channel-coded data packet (210-1) and the further channel-coded data packet (210-2). to obtain.

31. Data transmitter (110-m) for transmitting useful data (112-m) within a time interval (T) via a communication channel to a data receiver (120), wherein the data transmitter (110-m) is designed to encode a plurality of channels Generate data packets (210-n) from the user data (112-m), each of the channel-coded data packets (210-n) having packet core data (212-n) corresponding to a different packet identifier for each of the data packets (210-n), and wherein the packet core data (212-n) are encoded with a channel code of higher redundancy than the user data (214-n), the data transmitter (1 10-m) being designed to transmit the plurality of channel-coded data packets (210-n) in the Time interval (T) to the data receiver (120) to send, wherein the data transmitter (1 10-m) is designed to the plurality of channel-coded data packets (210-n) in time and / or frequency, with pseudo-random time intervals and / or frequency intervals between the channel-coded data packets (210-n), distributed to transmit, the data transmitter (1 10-m) being designed to base the pseudo-random time intervals and / or frequency intervals between the channel-coded data packets (210-n) an intrinsic parameter of the data transmitter (1 10-m), of the data receiver (120) or of a communication system (100) of the data transmitter (1 10-m), or of information which is linked to the packet core data (212-n) of the channel-coded data packets ( 210-n) is transmitted,

to derive.

32. data transmitter (110-m) according to claim 31, wherein the data transmitter (1 10-m) is designed to the plurality of channel-coded data packets (210-n) with regard to content, transmission times and / or transmission frequencies regardless of a return channel of the Send data receiver (120) to the data transmitter (1 10-m).

33. Data transmitter (110-m) according to any one of claims 31 to 32, wherein the intrinsic parameter

- a network ID,

- a data sender ID,

information from a previous transmission,

- a hardware ID,

- a transmission frequency,

- a data rate,

- a modulation,

- a counter state of a packet / sequence counter, and / or

- an operating mode / state,

is.

34. Data transmitter (110-m) according to one of claims 31 to 32, wherein the information is at least part of error protection data (212-n) of the packet core data (212-n) of the channel-coded data packets (210-n).

35. Data transmitter (110-m) according to one of claims 31 to 34, wherein the data transmitter (1 10-m) is designed to receive a first channel-coded data packet (210-1) of the plurality of channel-coded data packets (210-n) send at a random or pseudorandom time, and / or wherein the data transmitter (110-m) is designed to transmit the first channel-coded data packet (210-1) of the plurality of channel-coded data packets (210-n) on a random or pseudo-random transmission frequency within the time interval (T).

36. The data transmitter (110-m) according to claim 35, wherein the data transmitter (1 10-m) is designed to transmit the channel-coded data packets of the plurality of channel-coded data packets (210-n) following the first channel-coded data packet (210-1). to send within the time interval (T).

37. Data transmitter (110-m) according to any one of claims 31 to 36, wherein the data transmitter (1 10-m) is designed to the pseudo-random time intervals and / or frequency intervals between the channel-coded data packets (210-n) by means of a deterministic random number generator to determine.

38. Data transmitter (110-m) according to claim 37, wherein the immanent parameter is used as the start state of the deterministic random number generator.

39. Data transmitter (110-m) according to claim 37, wherein the information is used as the start state of the deterministic random number generator.

40. Data transmitter (110-m) according to any one of claims 37 to 39, wherein a number of bit sequences generated by the deterministic random number generator is so long that all possible time states are covered within the time interval.

41. Data transmitter (110-m) according to one of claims 37 to 40, the data transmitter (110-m) being designed to determine the pseudo-random time intervals and frequency intervals using the same deterministic random number generator.

42. Data transmitter (110-m) according to any one of claims 37 to 40, wherein the data transmitter (1 10-m) is designed to determine the pseudo-random time intervals by means of a first deterministic random number generator, and wherein the data transmitter (110-m) is designed to determine the pseudo-random frequency spacings by means of a second deterministic random number generator.

43. Data transmitter (110-m) according to one of claims 31 to 42, wherein the time interval (T) is a transmission time interval, the data transmitter (110-m) being designed to transmit in a reception time interval (Trx.) Following the transmission time interval (T) ) to receive at least one data packet (211) from the data receiver (120) or another data receiver.

44. Data transmitter (110-m) according to claim 43, wherein a time interval between the transmission time interval (T) and the reception time interval (Trx) is predetermined.

45. Data transmitter (110-m) according to claim 43, wherein a time interval between the transmission time interval (T) and the reception time interval (Trx) is pseudorandom.

46. The data transmitter (110-m) according to claim 45, wherein the data transmitter (110-m) is designed to be based on the pseudo-random time interval between the transmission time interval (T) and the reception time interval (Trx) an inherent parameter of the data transmitter (1 10-m), of the data receiver (120) or of a communication system (100) of the data transmitter (110-m) and / o of the data receiver (120), or

to derive.

47. The data transmitter (110-m) according to claim 45, wherein the data transmitter (110-m) is designed to determine the pseudo-random time interval between the transmission time interval (T) and the reception time interval (Trx) by means of a deterministic random number generator.

48. Data transmitter (110-m) according to claim 47, wherein the data transmitter (1 10-m) is designed to

an intrinsic parameter of the data transmitter (1 10-m), of the data receiver (120) or of a communication system (100) of the data transmitter (1 10-m) and / o of the data receiver (120), or

to be used as the start state of the deterministic random number generator.

49. Data receiver (120) for receiving user data (112-m) that are transmitted within a time interval by means of a plurality of channel-coded data packets (210-n) from a data transmitter (110-m) via a communication channel to the data receiver (120) , wherein each of the channel-coded data packets (210-n) has packet core data (212-n) corresponding to a packet identifier of the respective channel-coded data packet, and wherein the packet core data (212-n) are coded with a channel code of higher redundancy than the user data (214- n), wherein the plurality of channel-coded data packets (210-n) are transmitted in current and / or frequency distribution, wherein a time interval and / or frequency interval between the channel-coded data packets (210-n) is pseudo-random, the data receiver (120 ) is designed to receive at least one channel-coded data packet (210-n) of the plurality of channel-coded data packets (210-n), wherein the data receiver (120) is designed to decode packet core data (212-n) of the channel-coded data packet (210-n) and, in the event of failure in error-free decoding of the channel-coded data packet (210-1), to determine based on one pseudo-random time interval and / or frequency interval between the channel-coded data packets (210-n) to determine a further channel-coded data packet (210-2) of the plurality of channel-coded data packets (210-n), and in order to combine the channel-coded data packet (210-1) and the further channel-coded data packet (210-2) to obtain an increased code gain for decoding the user data (214-1, 214-2), the data receiver (120) being designed to determine the pseudo-random time intervals and / or frequency intervals between the channel-coded data packets (210-n) based on

an intrinsic parameter of the data transmitter (1 10-m), the data receiver (120) or a communication system of the data receiver (120), or information which is transmitted with the packet core data (212-n) of the channel-coded data packets (210-n) ,

to derive.

50. Data receiver (120) according to claim 49, wherein the data receiver (120) has no return channel to the data transmitter (1 10-m) to the data transmitter (110-m) to retransmit a channel-coded data packet in the event of a failed decoding of the user data.

51. Data receiver (120) according to any one of claims 49 to 50, wherein the intrinsic parameter

a network ID,

a data sender ID,

information from a previous transmission,

a hardware ID,

a transmission frequency,

a data rate,

a modulation, a counter state of a packet / sequence counter, and / or

an operating mode / state,

is.

52. Data receiver (120) according to one of claims 49 to 50, wherein the information is at least part of error protection data of the packet core data (212-n) of the channel-coded data packets (210-n).

53. Data receiver (120) according to one of claims 49 to 52, wherein the data receiver (120) is designed to determine the pseudo-random time intervals and / or frequency intervals between the channel-coded data packets (210-n) by means of a deterministic random number generator.

54. Data receiver (120) according to claim 53, wherein the immanent parameter is used as the start state of the deterministic random number generator.

55. Data receiver (120) according to claim 53, wherein the information is used as the start state of the deterministic random number generator.

56. Data receiver (120) according to one of claims 49 to 55, wherein a number of bit sequences generated by the deterministic random number generator is so long that all possible time states are covered within the time interval.

57. Data receiver (120) according to one of claims 49 to 56, wherein the data receiver (120) is designed to determine the pseudo-random time intervals and frequency intervals using the same deterministic random number generator.

58. Data receiver (120) according to one of claims 49 to 57, wherein the data receiver (120) is designed to determine the pseudo-random time intervals by means of a first deterministic random number generator, and wherein the data receiver (120) is designed to use a second deterministic random number generator to determine the pseudo-random frequency spacings.

59. Data receiver (120) according to any one of claims 49 to 58, wherein the time interval (T) is a transmission time interval, the data receiver (120) being designed to at least one in a reception time interval (Trx) following the transmission time interval (T) Send data packet to the data transmitter (1 10-m).

60. Data receiver (120) according to claim 59, wherein a time interval between the transmission time interval (T) and the reception time interval (Trx) is predetermined.

61. Data receiver (120) according to claim 59, wherein a time interval between the transmission time interval (T) and the reception time interval (Trx) is pseudorandom.

62. The data receiver (120) according to claim 61, wherein the data receiver (120) is designed to base the pseudo-random time interval between the transmission time interval (T) and the reception time interval (Trx)

an intrinsic parameter of the data transmitter (1 10-m), the data receiver (120) or a communication system (100) of the data transmitter (110-m) and / o the data receiver (120), or

to derive.

63. Data receiver (120) according to claim 61, wherein the data receiver (120) is designed to determine the pseudo-random time interval between the transmission time interval (T) and the reception time interval (Trx) by means of a deterministic random number generator.

64. The data receiver (120) according to claim 63, wherein the data receiver (120) is configured to

to be used as the start state of the deterministic random number generator.

65. System (100), having the following features: at least one data transmitter (110-m) according to one of claims 31 to 48, and a data receiver (120) according to one of claims 49 to 64.

66. The system (100) according to claim 65, wherein the at least one data transmitter (1 10-m) is a plurality of data transmitters, the data receiver (120) being designed to receive from a multiplicity of different data transmitters (110-m) channel-coded data packets to determine those channel-coded data packets (210-n) of a specific data transmitter (110-m) based on the pseudo-random time interval and / or frequency interval determined.

67. Method (220) for transmitting user data (112-m) within a time interval (T) from a data transmitter (110-m) via a communication channel to a data receiver (120), the method (220) comprising: Generate (222) a plurality of channel-coded data packets (210-n) from the user data (1 12-m), each of the channel-coded data packets (210-n) packet core data (212-n) corresponding to a different packet identifier for each data packet and wherein the packet core data (212-n) are encoded with a channel code of higher redundancy than the user data (214-n),

Transmitting (224) the plurality of channel-coded data packets (210-n) in the time interval (T), the plurality of channel-coded data packets (210-n) at present and / o the frequency, with pseudorandom time intervals and / or frequency intervals between the channel-coded data packets (210-n) are distributed, the pseudo-random time intervals and / or frequency intervals between the channel-coded data packets (210-n)

an intrinsic parameter of the data transmitter (1 10-m), of the data receiver (120) or of a communication system (100) of the data transmitter (1 10-m), or of information that is associated with the packet core data (212-n) of the channel-coded data packets ( 210-1) is transmitted,

based.

68. Method (230) for receiving user data (112-m) which are transmitted within a time interval (T) by means of a plurality of channel-coded data packets (210-n) from a data transmitter (110-m) via a communication channel to a data receiver ( 120) are transmitted, each of the channel-encoded data packets (210-n) having packet core data (212-n) corresponding to a packet identifier of the respective channel-encoded data packet, and wherein the packet core data (212-n) are encoded with a channel code of higher redundancy than that User data (214-n), wherein the plurality of channel-coded data packets (210-n) are transmitted distributed in current and / or frequency, with a time interval and / or frequency interval between the channel-coded data packets (210-n) being pseudo-random, whereby the method (230) comprises:

Receiving (232) at least one channel-coded data packet (210-1) of the plurality of channel-coded data packets (210-n),

Decoding (234) packet core data (212-n) of the channel-coded data packet,

Determining (236), in the event of failure of error-free decoding of the channel-coded data packet (210-1), of another channel-coded data packet (210-2) of the plurality of channel-coded data packets (210-n) based on one determined pseudo-random time interval and / or frequency interval between the channel-coded data packets (210-n) in order to increase the code gain for decoding the user data (214-) by combining the channel-coded data packet (210-1) and the further channel-coded data packet (210-2) 1, 214-2), the pseu do random time intervals and / or frequency intervals between the channel-coded data packets (210-n) based on

an inherent parameter of the data transmitter (1 10-m), the data receiver (120) or a communication system (100) of the data receiver (120), or an information that with the packet core data (212-n) of the channel-coded data packets (210-n ) is transmitted,

is determined.

69. Data transmitter (110-m) for transmitting user data (112-m) within a time interval via a communication channel to a data receiver (120), the data transmitter (110-m) being designed to transmit a plurality of channel-coded data packets (210 -n) from the user data (112-m), each of the channel-coded data packets (210-n) having packet core data (212-n) corresponding to a different packet identifier for each of the data packets, and wherein the packet core data (212-n ) are encoded with a channel code of higher redundancy than the user data (214-n), the data transmitter (1 10-m) being designed to transmit the plurality of channel-coded data packets (210-n) to the data receiver in a first time interval (T1) (120), wherein the data transmitter (1 10-m) is designed to transmit the plurality of channel-coded data packets (210-n) distributed in time and / or frequency, the data transmitter (1 10-m) being configured is the plurality of channel coded data packets (210-n) repeatedly in a second time interval (T2) to send to the data receiver (120), with a time interval between the first time interval (T1) and the second time interval (T2) being fixed, or with a time interval between the first time interval (T1) and the second time interval (T2) is random or pseudo-random.

70. data transmitter (110-m) according to claim 69, wherein the data transmitter (1 10-m) is designed to the plurality of channel-coded data packets (210-n) in terms of content, transmission times and / or transmission frequencies regardless of a return channel of the Send data receiver (120) to the data transmitter (1 10-m),

71. Data transmitter (110-m) according to one of claims 69 to 70, wherein time intervals and / or frequency intervals between the channel-coded data packets (210-n) are specified.

72. Data transmitter (110-m) according to any one of claims 69 to 70, wherein time intervals and / or frequency intervals between the channel-coded data packets (210-n) are pseudo-random, wherein the data transmitter (1 10-m) is designed to the pseudo-random Time intervals and / or frequency intervals between the channel-coded data packets (210-n) based on

an intrinsic parameter of the data transmitter (1 10-m), of the data receiver (120) or of a communication system (100) of the data transmitter (1 10-m), or of information which is linked to the packet core data (212-n) of the channel-coded data packets ( 210-n) is transmitted,

to derive.

73. The data transmitter (110-m) according to any one of claims 69 to 72, wherein time intervals and / or frequency intervals between the channel-coded data packets (210-n) are pseudo-random, the data transmitter (1 10-m) being designed to receive the pseudo-random ones To determine time intervals and / or frequency intervals between the channel-coded data packets (210-n) using a deterministic random number generator.

74. Data transmitter (110-m) according to one of claims 69 to 73, wherein a time interval between the first time interval (T1) and the second time interval (T2) is pseudo-random, the data transmitter (110-m) being designed to vary the time interval between the first time interval (T1) and the second time interval (T2) based on an intrinsic parameter of the data transmitter (1 10-m), the data receiver (120) or a communication system (100) of the data transmitter (110-m).

75. Data transmitter (110-m) according to any one of claims 69 to 73, wherein a time interval between the first time interval (T1) and the second time interval (T2) is pseudorandom, wherein the data transmitter (110-m) is designed to the derive the time interval between the first time interval (T1) and the second time interval (T2) based on information that is transmitted with the packet core data (212-n) of the channel-coded data packets (210-n).

76. Data transmitter (110-m) according to any one of claims 69 to 75, wherein a time interval between the first time interval (T1) and the second time interval (T2) is pseudo-random, wherein the data transmitter (110-m) is designed to the determine the time interval between the first time interval (T1) and the second time interval (T2) by means of a deterministic random number generator.

77. The data transmitter (110-m) according to claim 76, wherein the data transmitter (1 10-m) is configured to

an intrinsic parameter of the data transmitter (1 10-m), of the data receiver (120) or of a communication system (100) of the data transmitter (1 10-m), or information which is associated with the packet core data (212-n) of the channel-coded data packets ( 210-n) is transmitted,

to be used as the start state of the deterministic random number generator.

78. Data transmitter (110-m) according to any one of claims 1 to 10, wherein the first time interval (T1) is a first transmission time interval, wherein the data transmitter (1 10-m) is designed to in a to the first transmission time interval (T1 ) to receive the following first reception time interval (Trx1) at least one data packet (21 1) from the data receiver (120) or another data receiver.

79. Data transmitter (110-m) according to claim 78, wherein a time interval between the first transmission time interval (T1) and the first reception time interval (Trx1) is specified.

80. Data transmitter (110-m) according to claim 78, wherein a time interval between the first transmission time interval (T1) and the first reception time interval (Trx1) is pseudo-random.

81. The data transmitter (110-m) according to claim 80, wherein the data transmitter (110-m) is configured to base the pseudorandom time interval between the first transmission time interval (T1) and the first reception time interval (Trx1)

to derive.

82. Data transmitter (110-m) according to claim 80, wherein the data transmitter (110-m) is designed to determine the pseudo-random time interval between the first transmission time interval (T1) and the first reception time interval (Trx1) by means of a deterministic random number generator.

83. The data transmitter (110-m) according to claim 82, wherein the data transmitter (1 10-m) is configured to

to be used as the start state of the deterministic random number generator.

84. data receiver (120) for receiving user data (112-m), which are transmitted within a first time interval (T1) by means of a plurality of channel-coded data packets from a data transmitter (110-m) via a communication channel to the data receiver (120), wherein each of the channel-coded data packets (210-n) has packet core data (212-n) corresponding to a packet identifier of the respective channel-coded data packet, and wherein the packet core data (212-n) are encoded with a channel code of higher redundancy than the user data (214-n ), wherein the plurality of channel-coded data packets (210-n) are transmitted in a currently and / or frequency-distributed manner, the plurality of channel-coded data packets (210-n) being transmitted repeatedly within a second time interval (T2), the data receiver ( 120) is designed to receive at least one channel-coded data packet (210-1) of the plurality of channel-coded data packets (210-n), the data receiver (120) outputting is formed in order to decode core data (212-1) of the channel-coded data packet (210-1) and, in the event of an error-free decoding of the channel-coded data packet (210-1), based on a time interval and / or frequency interval between the channel-coded data packets (210-n) to determine at least one further channel-coded data packet (210-2) of the plurality of channel-coded data packets (210-n), and by a combination of the channel-coded data packet (210-1) and the at least one to obtain further channel-coded data packets (210-2) an increased code gain for decoding the user data (214-1, 214-2), the data receiver (120) being designed to also in the event of an error-free decoding of the channel-coded data packets ( 210-n) of the first Time interval (T1) based on a combination of the first channel-coded data packet (210-1) and the at least one further channel-coded data packet (210-2) of the first time interval (T1), at least one further channel-coded data packet (210-1 ^* ) of the plurality to receive channel-coded data packets (210-n ^* ) of the second time interval (T2) in order to determine the useful data, a time interval between the first time interval (T1) and the second time interval (T2) being fixed, or a temporal distance between the first time interval (T1) and the second time interval (T2) is random or pseudo-random.

85. The data receiver (120) according to claim 84, wherein the data receiver (120) has no return channel to the data transmitter (1 10-m) to the data transmitter (110-m) to retransmit a channel-coded data packet in the event of a failed decoding of the user data.

86. Data receiver (120) according to one of claims 84 to 85, wherein time intervals and / or frequency intervals between the channel-coded data packets (210-n) are specified.

87. Data receiver (120) according to one of claims 84 to 85, wherein time intervals and / or frequency intervals between the channel-coded data packets (210-n) are pseudo-random, wherein the data receiver (120) is designed to understand the pseudo-random time intervals and / or Frequency intervals between the channel-coded data packets (210-n) based on

an intrinsic parameter of the data transmitter (1 10-m), of the data receiver (120) or of a communication system (210) of the data transmitter (1 10-m), or of information that is linked to the packet core data (212-n) of the channel-coded data packets ( 210-n) is transmitted,

to derive.

88. Data receiver (120) according to one of claims 84 to 87, wherein time intervals and / or frequency intervals between the channel-coded data packets (210-n) are pseudo-random, wherein the data receiver (120) is designed to understand the pseudo-random time intervals and / or To determine frequency spacings between the channel-coded data packets (210-n) using a deterministic random number generator.

89. Data receiver (120) according to one of claims 84 to 88, wherein a time interval between the first time interval (T1) and the second time interval (T2) is pseudorandom, wherein the data receiver (120) is designed to the time interval between the derive first time interval (T1) and the second time interval (T2) based on an intrinsic parameter of the data receiver (120), the data transmitter (1 10-m) or a communication system (100) of the data receiver (120).

90. data receiver (120) according to any one of claims 84 to 88, wherein a time interval between the first time interval (T1) and the second time interval (T2) is pseudorandom, wherein the data receiver (120) is designed to the time interval between the derive first time interval (T1) and the second time interval (T2) based on information that is transmitted with the packet core data (212-n) of the channel-coded data packets.

91. Data receiver (120) according to any one of claims 84 to 90, wherein a time interval between the first time interval (T1) and the second time interval (T2) is pseudorandom, wherein the data receiver (120) is designed to the time interval between the to determine the first time interval (T1) and the second time interval (T2) by means of a deterministic random number generator.

92. The data receiver (120) according to claim 91, wherein the data receiver (120) is configured to

an intrinsic parameter of the data transmitter (1 10-m), the data receiver (120) or a communication system (100) of the data receiver (120), or an information that with the packet core data (212-n) of the channel-coded data packets (210-n ) is transmitted,

to be used as the start state of the deterministic random number generator.

93. Data receiver (120) according to one of claims 84 to 92, wherein the first time interval (T1) is a first transmission time interval, the data receiver (120) being designed to operate in a first reception time interval (T1) following the first transmission time interval (T1) Trx1) to send at least one data packet (211) to the data transmitter (110-m).

94. Data receiver (120) according to claim 93, wherein a time interval between the first transmission time interval (T1) and the first reception time interval (Trx1) is specified.

95. Data receiver (120) according to claim 93, wherein a time interval between the first transmission time interval (T1) and the first reception time interval (Trx1) is pseudo-random.

96. The data receiver (120) according to claim 95, wherein the data receiver (120) is configured to base the pseudorandom time interval between the first transmission time interval (T1) and the first reception time interval (Trx1)

an intrinsic parameter of the data transmitter (1 10-m), the data receiver (120) or a communication system (100) of the data transmitter (110-m) and / o the data receiver (120), or information which is transmitted with the packet core data (212-n) of the channel-coded data packets (210-n),

to derive.

97. The data receiver (120) according to claim 95, wherein the data receiver (120) is designed to determine the pseudo-random time interval between the first transmission time interval (T1) and the first reception time interval (Trx1) by means of a deterministic random number generator.

98. The data receiver (120) according to claim 97, wherein the data receiver (120) is configured to

to be used as the start state of the deterministic random number generator.

99. System (100), having the following features: at least one data transmitter (110-m) according to one of claims 69 to 83, and a data receiver (120) according to one of claims 84 to 98.

100. Method (240) for transmitting user data (112-m) within a time interval via a communication channel,

Generate (242) a plurality of channel-coded data packets (210-n) from the user data (1 12-m), each of the channel-coded data packets (210-n) packet core data (212-n) corresponding to a different packet identifier for each data packet and wherein the packet core data (212-n) are encoded with a channel code of higher redundancy than the user data (214-n), Sending (244) the plurality of channel-coded data packets (210-n) (210-n) in a first time interval (T1), the plurality of channel-coded data packets (210-n) being transmitted distributed in time and / or frequency, repeated Transmitting (246) the plurality of channel-coded data packets (210-n) in a second time interval (T2), the plurality of channel-coded data packets (210-n) being transmitted distributed in time and / or frequency, with a time interval between the the first time interval (T1) and the second time interval (T2) is fixed, or wherein a time interval between the first time interval (T1) and the second time interval (T2) is random or pseudo-random.

101. Method (250) for receiving user data (1 12-m) which are transmitted within a first time interval (T1) by means of a plurality of channel-coded data packets (210-n) via a communication channel, each of the channel-coded data packets (210 -n) has packet core data (212-n) corresponding to a packet identifier of the respective channel-coded data packet, and wherein the packet core data (212-n) are encoded with a channel code of higher redundancy than the user data (214-n), the plurality of channel-coded data packets (210-n) distributed in time and / or frequency are transmitted, the plurality of channel-coded data packets (210-n) being transmitted repeatedly within a second time interval (T2), the method (250) comprising:

Receiving (252) at least one channel-coded data packet (210-1) of the plurality of channel-coded data packets (210-n),

Decoding (254) packet core data (212-n) of the at least one channel-coded data packet (210-1),

Determining (256), in the event of failure of error-free decoding of the channel-coded data packet (210-1), of another channel-coded data packet (210-2) of the plurality of channel-coded data packets (210-n) based on a time interval and / or frequency interval between the channel-coded data packets (210-n) in order to increase the code gain for decoding the user data (214-1, 214-2) by combining the channel-coded data packet (210-1) and the at least one further channel-coded data packet (210-2). to obtain, Determining (258) in the event of failure of error-free decoding of the channel-coded data packets (210-n) of the first time interval based on a combination of the first channel-coded data packet (210-1) and the at least one further channel-coded data packet (210-2) of the first Time interval (T1), at least one further channel-coded data packet (210-1 ^* ) of the plurality of channel-coded data packets (210-n ^* ) of the second time interval (T2), in order to determine the useful data, a time interval between the first time interval ( T1) and the second time interval (T2) is fixed, or a time interval between the first time interval (T1) and the second time interval (T2) is random or pseudo-random.

102. Computer program for performing the method according to one of the preceding claims, when the computer program runs on a computer or microprocessor.