LOW-LATENCY DATA TRANSMITTER AND DATA RECEIVER FOR THE TELEGRAM SPLITTING TRANSMISSION METHOD

Description

[0001] Embodiments relate to a data transmitter and a data receiver for the telegram splitting transmission method, and more specifically, to a low-latency data transmitter and data receiver for the telegram splitting transmission method. Some embodiments relate to a low-latency transmission mode for telegram splitting.

[0002] Systems for transmitting data from many sensor nodes to one base station(s), or for transmitting data from one base station(s) to many sensor nodes, are known. This is used, for example, in the IoT (Internet of Things). There, for example, sensor data (e.g., from streetlights or parking sensors) is sent to a base station, which then processes the data and provides the user with added value (e.g., route guidance to a free parking space).

[0003] Typically, such sensor networks comprise a large number of sensor nodes equipped with very small batteries. However, to achieve a long service life, channel access is usually uncoordinated, meaning each sensor node accesses the channel at random times. This concept is also called ALOHA access or, in a sub-form, slotted ALOHA access.

[0004] Due to the high number of participants and uncoordinated channel access, interference occurs between the transmissions of the various sensor nodes. In addition, transmission often takes place in the so-called ISM or SRD bands (ISM = Industrial, Scientific and Medical; SRD = Short Range Devices), which are also used by other systems (e.g., Wi-Fi, Bluetooth, remote key fobs). These systems attempt to cause additional interference during transmission.

[0005] The telegram splitting transmission method is known, which, under the aforementioned conditions, significantly increases transmission reliability when transmitting telegrams in these channels. In detail, the telegram splitting transmission method, described in EP 2 751 526 B1, uses specific time-frequency hopping patterns to transmit data over the radio channel. To successfully decode a packet, the hopping pattern used for transmission must be known to the receiver. To ensure this, time-frequency hopping patterns are defined for telegram splitting networks and are known to all participants.

[0006] The telegram splitting transmission method is further described in WO 2015 / 128385 A1, WO 2017 / 017257 A1 and WO 2017 / 167366 A1 as well as in the publications [G. Kilian, H. Petkov, R. Psiuk, H. Lieske, F. Beer, J. Robert, and A. Heuberger, "Improved coverage for low-power telemetry systems using telegram splitting," in Proceedings of 2013 European Conference on Smart Objects, Systems and Technologies (SmartSysTech), 2013] and [G. Kilian, M. Breiling, HH Petkov, H. Lieske, F. Beer, J. Robert, and A. Heuberger, "Increasing Transmission Reliability for Telemetry Systems Using Telegram Splitting," IEEE Transactions on Communications, vol. 63, no. 3, pp. 949-961, Mar. 2015].

[0007] The disadvantage of the Telegram splitting transmission method, however, is the high latency, which is caused by the pauses between the individual sub-packets of the transmission.

[0008] The Internet of Things (IoT) has a wide range of application possibilities; for some applications, system latency is of secondary importance (e.g., reading water meters), but there are also systems where latency plays a significant role (e.g., pipe bursts or security monitoring of emergency services in crisis areas).

[0009] For this second class of systems, where latency plays an important role, there is currently no suitable solution for low-power sensor networks.

[0010] DE 101 64 665 A1 describes a digital time-division radio frame structure with time and frequency diversity. Each data packet is transmitted twice in consecutive frequency hops, so that the redundant transmission differs from the primary transmission in both time and frequency. A communication system using the frame structure can be configured to dynamically switch between a fully diverse, asynchronous, and non-diverse operating mode. The operating mode can be selected based on one or more operating parameters, such as battery power or detected interference. If error correction is implemented and a primary transmission is received without errors, system devices can shut down the circuitry to reduce power consumption.

[0011] The present invention is therefore based on the object of improving the latency in telegram splitting-based communication networks.

[0012] This problem is solved by the independent patent claims.

[0013] Embodiments of the present invention are described in more detail with reference to the accompanying figures. They show: Fig. 1 is a schematic block diagram of a system with a data transmitter and a data receiver; Fig. 2 is a diagram showing an exemplary occupancy of the transmission channel during the transmission of a plurality of sub-data packets according to a time and frequency hopping pattern; Fig. 3a is a diagram showing an exemplary occupancy of the transmission channel during the transmission of the first plurality of sub-data packets according to the first hopping pattern, distributed in time and frequency; Fig. 3b is a diagram showing an exemplary occupancy of the transmission channel during the transmission of the second plurality of sub-data packets according to the second hopping pattern, distributed in time and frequency; Fig. 4a is a diagram showing an exemplary occupancy of the transmission channel during the transmission of the first plurality of sub-data packets according to the first hopping pattern, distributed in time and frequency;4b shows a diagram illustrating an exemplary occupancy of the transmission channel during the transmission of the second plurality of sub-data packets according to the second hopping pattern, distributed in time and frequency; Fig. 5 shows a diagram illustrating an exemplary occupancy of the transmission channel during the transmission of channel-coded data by means of the plurality of sub-data packets, wherein transmission pauses between the sub-data packets of a first group of sub-data packets are shorter than transmission pauses between sub-data packets of a second group of sub-data packets; Fig.6 shows a diagram illustrating an exemplary occupancy of the transmission channel during the transmission of channel-coded data using the plurality of sub-data packets, wherein transmission pauses between the sub-data packets of a first group of sub-data packets are shorter than transmission pauses between sub-data packets of a second group of sub-data packets, and wherein transmission pauses between the sub-data packets of the second group of sub-data packets increase with the increasing number of transmitted sub-data packets; Fig. 7 shows a diagram illustrating an exemplary occupancy of the transmission channel during the transmission of channel-coded data using a plurality of sub-data packets using a first hop pattern and repeatedly using a second hop pattern; Fig. 8 shows a diagram illustrating an exemplary occupancy of the transmission channel during the transmission of the plurality of sub-data packets using a hop pattern that extends over two separate frequency bands; Fig.9 is a diagram showing an exemplary occupancy of the transmission channel during the transmission of the plurality of sub-data packets using the first hop pattern twice in two separate frequency bands and repeatedly using the second hop pattern twice in two separate frequency bands; Fig. 10 is a diagram showing an exemplary occupancy of the transmission channel during the transmission of the plurality of sub-data packets using the first hop pattern and repeatedly using the second hop pattern, wherein sub-data packets transmitted according to the first hop pattern are arranged between sub-data packets transmitted according to the second hop pattern; Fig.11 in a diagram, an exemplary occupancy of the transmission channel during a transmission of the first downlink message, synchronized in time with a transmission of the first plurality of sub-data packets according to the first hop pattern, compared to an occupancy of the transmission channel during a transmission of the second downlink message, synchronized in time with a transmission of the second plurality of sub-data packets according to the second hop pattern; Fig.12 in a diagram, an exemplary occupancy of the transmission channel during a transmission of an acknowledgment of receipt divided into a plurality of sub-data packets temporally interleaved with the transmission of the first plurality of sub-data packets according to the second hop pattern, compared to an occupancy of the transmission channel during a transmission of an acknowledgment of receipt divided into a plurality of sub-data packets temporally after the transmission of the first plurality of sub-data packets according to the second hop pattern; Fig.13 is a diagram showing an exemplary occupancy of the transmission channel during the transmission of the first plurality of sub-data packets according to the first hop pattern, the transmission of the second plurality of sub-data packets according to the second hop pattern, and the transmission of an acknowledgment divided among a plurality of sub-data packets temporally interleaved with the transmission of the second plurality of sub-data packets according to the second hop pattern; Fig. 14 is a diagram showing an exemplary occupancy of the transmission channel during the transmission of the first plurality of sub-data packets according to the first hop pattern, distributed in time and frequency such that sub-data packets on different frequencies completely overlap in time; Fig.15 shows a diagram illustrating an exemplary occupancy of the transmission channel during the transmission of the first plurality of sub-data packets according to the first hopping pattern, distributed in time and frequency such that sub-data packets 162 partially overlap at different frequencies; Fig. 16 shows a diagram illustrating an exemplary occupancy of the transmission channel during the transmission of data of a first class using one data packet and repeatedly using a plurality of sub-data packets, distributed in time and frequency according to a first hopping pattern; Fig.17 is a diagram illustrating the occupancy of the transmission channel during the transmission of data of a first class using a data packet and repeatedly using a further data packet and repeatedly using a plurality of sub-data packets distributed in time and frequency according to a hopping pattern, wherein the further data packet and the plurality of sub-data packets are interleaved such that the further data packet is arranged temporally between two of the plurality of sub-data packets; Fig. 18 is a diagram illustrating an exemplary occupancy of the transmission channel during the transmission of data of a first class using a data packet and repeatedly using a plurality of sub-data packets distributed in time and frequency according to a first hopping pattern, and a transmission of a receipt acknowledgment at a time interval between the data packet and the plurality of sub-data packets; Fig.19a is a diagram showing an exemplary occupancy of the transmission channel during the transmission of the first plurality of sub-data packets according to the first hop pattern, distributed in time and frequency, synchronized with a synchronization signal; Fig. 19b is a diagram showing an exemplary occupancy of the transmission channel during the transmission of the first plurality of sub-data packets according to a hop pattern with a first group of hops and a second group of hops, wherein the first group of hops is fixed, and wherein the second group of hops is calculated from the data of the first class or a channel-coded version of the data of the first class; Fig.20 is a diagram showing an exemplary occupancy of the transmission channel during the transmission of the first plurality of sub-data packets, distributed in time and frequency according to the first hopping pattern, wherein each sub-data packet is decodable on the receiver side in the case of error-free transmission; Fig. 21 is a diagram showing an exemplary occupancy of the transmission channel during the transmission of the first plurality of sub-data packets, distributed in time and frequency according to the first hopping pattern, wherein the channel-coded data of the first class is distributed among the first plurality of sub-data packets in such a way that each group of sub-data packets can be decoded individually in the case of error-free transmission to obtain the data of the first class; Fig.22 in a diagram, an exemplary occupancy of the transmission channel during the transmission of the first plurality of sub-data packets according to the first hopping pattern, distributed in time and frequency, wherein the channel-coded data of the first class is distributed among the first plurality of sub-data packets such that a first group of sub-data packets comprises channel-coded data according to a first coding polynomial (polynomial 0), and that a second group of sub-data packets comprises channel-coded data according to several coding polynomials (polynomial 1 and polynomial 2); Fig.23 is a diagram showing an exemplary occupancy of a transmission channel during the transmission of the first plurality of sub-data packets distributed in time and frequency according to the first hop pattern, wherein a first group of sub-data packets comprises core information and a second group of sub-data packets comprises extension information, wherein the first group of sub-data packets is transmitted before the second group of sub-data packets; Fig. 24 is a diagram showing an exemplary occupancy of the transmission channel during the transmission of the first plurality of sub-data packets distributed in time and frequency according to the first hop pattern, wherein a first group of hops of the hop pattern identifies the data transmitter; Fig.25 is a diagram showing an exemplary occupancy of the transmission channel during the transmission of the first plurality of sub-data packets according to the first hop pattern, distributed in time and frequency such that sub-data packets sent according to the first hop pattern have the same time and frequency spacing from one another; Fig. 26 is a diagram showing an exemplary occupancy of the transmission channel during the transmission of the first plurality of sub-data packets according to the first hop pattern, distributed in time and frequency; Fig. 27 is a diagram showing an exemplary occupancy of the transmission channel during the transmission of the first plurality of sub-data packets according to the first hop pattern, distributed in time and frequency; Fig.28 is a diagram showing an exemplary occupancy of the transmission channel during the transmission of the first plurality of sub-data packets distributed in time and frequency according to the first hop pattern, wherein the length of the sub-data packets decreases with an increasing number of sent sub-data packets; Fig. 29 is a flowchart of a method for generating a set of hop patterns, according to an embodiment; Fig. 30 is a flowchart of a method for generating two sets of hop patterns, according to an embodiment; Fig. 31a is a diagram showing the structure of a frame with a TSMA hop pattern; Fig. 31b is a diagram showing the occupancy of two frequency channels during the repeated transmission of data using a first hop pattern and a second hop pattern; Fig. 32 is a diagram showing a schematic view of the structure of a TSMA hop pattern;33a shows a diagram of the main and secondary maxima of an autocorrelation function of a jump pattern that has predetermined autocorrelation properties, plotted over frequency and time; Fig. 33b shows a diagram of the main and secondary maxima of an autocorrelation function of a jump pattern that does not have predetermined autocorrelation properties, plotted over frequency and time; Fig. 34a shows a diagram of the main and secondary maxima of a cross-correlation function of two jump patterns that have predetermined cross-correlation properties, plotted over frequency and time; Fig. 34b shows a diagram of the main and secondary maxima of a cross-correlation function of two jump patterns that do not have predetermined cross-correlation properties, plotted over frequency and time; Fig. 35 shows a flowchart of a method for generating jump patterns, according to an embodiment;Fig. 36 shows a diagram illustrating an exemplary occupancy of a transmission channel during the transmission of the first plurality of sub-data packets according to the first hopping pattern, distributed in frequency and time; Fig. 37 shows a table defining a low-delay frequency hopping pattern according to an embodiment; and Fig. 38 shows a table defining a low-delay time hopping pattern according to an embodiment.

[0014] In the following description of the embodiments of the present invention, identical or equivalent elements in the figures are provided with the same reference numerals so that their description is interchangeable.

[0015] Before embodiments of the present invention are described in detail, an example will first be given using the Fig. 1 and 2The communication system underlying the invention will be discussed in more detail, which is to be expanded to include a mode for higher priority data and / or higher requirements for a maximum transmission time. However, it should be noted that the Fig. 1 and 2 The communication system explained is presented or described merely as an example and is in no way intended to be limiting. Rather, the communication system is presented in a highly abstract manner in order to explain the underlying principles in a simple and understandable manner.

[0016] Fig. 1 shows a schematic block diagram of an exemplary communication system with a data transmitter 100 and a data receiver 110.

[0017] The data transmitter 100 may be configured to divide data 120 (or a data packet including the data 120) into a plurality of sub-data packets 142 and to transmit the plurality of sub-data packets 142 distributed in time and / or frequency using a hopping pattern 140.

[0018] The data receiver 110 may be configured to receive the plurality of sub-data packets 142 to obtain the data that is divided into the plurality of sub-data packets and transmitted distributed in time and / or frequency according to the hopping pattern 140.

[0019] As in Fig. 1As shown by way of example, the data transmitter 100 can have a transmitting device (or transmitting module, or transmitter) 102 that is configured to transmit the data 120. The transmitting device 102 can be connected to an antenna 104 of the data transmitter 100. The data transmitter 100 can further have a receiving device (or receiving module, or receiver) 106 that is configured to receive data. The receiving device 106 can be connected to the antenna 104 or to another (separate) antenna of the data transmitter 100. The data transmitter 100 can also have a combined transceiver.

[0020] The data receiver 110 may include a receiving device (or receiving module, or receiver) 116 configured to receive data 120. The receiving device 116 may be connected to an antenna 114 of the data receiver 110. Furthermore, the data receiver 110 may include a transmitting device (or transmitting module, or transmitter) 112 configured to transmit data. The transmitting device 112 may be connected to the antenna 114 or to another (separate) antenna of the data receiver 110. The data receiver 110 may also include a combined transceiver.

[0021] In embodiments, the data transmitter 100 may be a sensor node, while the data receiver 110 may be a base station. Typically, a communication system comprises at least one data receiver 110 (base station) and a plurality of data transmitters (sensor nodes, such as heating meters). Of course, it is also possible for the data transmitter 100 to be a base station, while the data receiver 110 is a sensor node. Furthermore, it is possible for both the data transmitter 100 and the data receiver 110 to be sensor nodes. Furthermore, it is possible for both the data transmitter 100 and the data receiver 110 to be base stations.

[0022] The data transmitter 100 and the data receiver 110 can be configured to send and receive the data 120 using the telegram splitting method (TS method). Here, a telegram or data packet 120 is split into a plurality of sub-data packets (or partial data packets, or sub-packets) 142, and the sub-data packets 142 are transmitted from the data transmitter 100 to the data receiver 110 in a time- and / or frequency-distributed manner according to the hop pattern 140. The data receiver 110 reassembles (or combines) the sub-data packets to obtain the data packet 120. The sub-data packets 142 can each contain only a portion of the data packet 120, so that the sub-data packets 142 are each shorter than the data packet 120.The data packet 120 may further be channel-coded, so that for error-free decoding of the data packet 120, not all sub-data packets 142 are required, but only a part of the sub-data packets 142.

[0023] The temporal distribution of the plurality of sub-data packets 142 can, as already mentioned, be carried out according to a time and / or frequency hopping pattern.

[0024] A time hop pattern can specify a sequence of transmission times or transmission time intervals (hops) at which the sub-data packets are sent. For example, a first sub-data packet can be sent at a first transmission time (or in a first transmission time slot) and a second sub-data packet at a second transmission time (or in a second transmission time slot), whereby the first transmission time and the second transmission time are different. The time hop pattern can define (or predefine, or indicate) the first transmission time and the second transmission time. Alternatively, the time hop pattern can specify the first transmission time and a time interval between the first transmission time and the second transmission time. Of course, the time hop pattern can also only specify the time interval between the first time and the second transmission time. There can be transmission pauses between the sub-data packets during which no transmission takes place.The sub-data packets can also overlap in time.

[0025] A frequency hopping pattern can specify a sequence of transmission frequencies or transmission frequency hops with which the sub-data packets are sent. For example, a first sub-data packet can be sent at a first transmission frequency (or in a first frequency channel) and a second sub-data packet can be sent at a second transmission frequency (or in a second frequency channel), wherein the first transmission frequency and the second transmission frequency are different. The frequency hopping pattern can define (or predefine, or indicate) the first transmission frequency and the second transmission frequency. Alternatively, the frequency hopping pattern can specify the first transmission frequency and a frequency spacing (transmission frequency hop) between the first transmission frequency and the second transmission frequency. Of course, the frequency hopping pattern can also only specify the frequency spacing (transmission frequency hop) between the first transmission frequency and the second transmission frequency.

[0026] Of course, the plurality of sub-data packets 142 can also be transmitted from the data transmitter 100 to the data receiver 110 in a manner distributed both in time and frequency. The distribution of the plurality of sub-data packets in time and frequency can occur according to a time and frequency hopping pattern. A time and frequency hopping pattern can be a combination of a time hopping pattern and a frequency hopping pattern, i.e., a sequence of transmission times or transmission time intervals at which the sub-data packets are transmitted, with transmission frequencies (or transmission frequency hops) being assigned to the transmission times (or transmission time intervals).

[0027] The time and / or frequency hopping pattern may comprise a plurality of hops, wherein the plurality of hops each indicate a transmission time and / or a transmission frequency (or a transmission time hop or transmission frequency hop) according to which the plurality of sub-data packets 142 may be transmitted.

[0028] Fig. 2 shows a diagram illustrating an exemplary transmission channel occupancy during the transmission of a plurality of sub-data packets 142 according to a time and frequency hopping pattern. The ordinate represents the frequency and the abscissa represents time.

[0029] As in Fig. 2 As can be seen, the data packet 120 can be divided into n = 7 sub-data packets 142, for example, and transmitted from the data transmitter 100 to the data receiver 110 in a time and frequency hopping pattern.

[0030] As in Fig. 2As can be further seen, a synchronization sequence 144 can also be divided into the plurality of sub-data packets 142, so that the plurality of sub-data packets 142 contain, in addition to data (data symbols in Fig. 2 ) 146 each a part of the synchronization sequence (synchronization symbols in Fig. 2 ) 144 included.

[0031] Detailed embodiments of the data transmitter 100 and the data receiver 110 are described in more detail below. 1. Different classes of jump patterns

[0032] Until now, all hop patterns in a system were designed to have approximately the same latency. This makes it impossible to achieve a lower latency for specific use cases, making the system unsuitable for those applications. 1.1. Reduction of pauses between sub-packets

[0033] In embodiments, the data transmitter 100 may be configured to divide data of a first class into a first plurality of sub-data packets 162 and to transmit the first plurality of sub-data packets 162 using a first hop pattern 160, wherein the data transmitter 100 is configured to divide data of a second class into a second plurality of sub-data packets 142 and to transmit the second plurality of sub-data packets 142 using a second hop pattern 140, wherein transmission pauses between sub-data packets 162 transmitted according to the first hop pattern 160 are smaller than transmission pauses between sub-data packets 142 transmitted according to the second hop pattern 140.

[0034] Accordingly, the data receiver 110 can be configured to receive data of a first class, which is transmitted divided into a first plurality of sub-data packets 162, using a first hop pattern 160, wherein the data receiver 110 can be configured to receive data of a second class, which is transmitted divided into a second plurality of sub-data packets 142, using a second hop pattern 140, wherein transmission pauses between sub-data packets 162 received according to the first hop pattern 160 are smaller than transmission pauses between sub-data packets 142 received according to the second hop pattern 140.

[0035] In embodiments, the data of the first class may have a higher priority and / or higher requirements for a maximum transmission time than the data of the second class.

[0036] Fig. 3ashows in a diagram an exemplary occupancy of the transmission channel during the transmission of the first plurality of sub-data packets 142 according to the first hop pattern 140, while Fig. 3b shows in a diagram an exemplary occupancy of the transmission channel during the transmission of the second plurality of sub-data packets 162 according to the second hop pattern 160. As in the comparison between the Fig. 3a and 3b As can be seen, transmission pauses between sub-data packets 162 transmitted according to the first hop pattern 160 are smaller than transmission pauses between sub-data packets 142 transmitted according to the second hop pattern 140. In other words, Fig. 3a and 3b show a comparison between the different classes of jump patterns when reducing the pauses.

[0037] In the exemplary embodiment, to solve the problem from Section 1, different classes of hop patterns can be defined, each with a different latency. Patterns with lower latency (low-delay mode) have, on average, shorter pauses between subpackets than those with higher latency. Depending on the application or the urgency of the message, the sender 100 selects a pattern from the corresponding class.

[0038] The receiver can be configured to detect and receive (all) different classes of hop patterns. This may require at least partially parallel processing. Assuming that the pilot sequence in each subpacket is the same for all hop pattern classes, the computational effort for the same total number of hop patterns in detection is no higher than if only one class of hop pattern were used.

[0039] In this case, receiver 110 can first perform a sub-packet correlation (or partial pilot sequence correlation) common to all classes (and hop patterns). Subsequently, a correlation (or a comparable methodology) is performed separately for each hop pattern 160 and 140 on the results of the sub-packet correlation to obtain the overall result.

[0040] Fig. 3a and 3b show an example comparison between the jump patterns 160 and 140 from the different classes. The jump pattern 140 from Fig. 3a represents the conventional class, which has been optimized for high transmission reliability in favor of latency. The pattern 160 from Fig. 3b has a significantly lower latency and can therefore be used for time-critical applications.

[0041] If more than two classes are defined, the sender can select an appropriate class based on the required latency for the application. The disadvantage of hop patterns with lower latency, however, is their lower immunity to interference during transmission. As a result, packet errors occur more frequently during transmission for low-latency patterns than for higher-latency patterns (the following ideas address this problem).

[0042] In embodiments, different classes of jump patterns can be used on the data transmitter side, which can be selected according to the application.

[0043] In embodiments, an at least partially parallel detection of the different jump patterns of the classes can be carried out on the data receiver side. 1.2. Reduction of the number of sub-packages

[0044] The implementation example from Section 1.1 has the disadvantage that, under certain circumstances, new hop patterns must be designed, which must also be detected by the receiver. This is particularly problematic if the receiver has limited computing power.

[0045] In embodiments, the first plurality of sub-data packets 162 may therefore comprise fewer sub-data packets than the second plurality of sub-data packets 142, wherein sub-data packets 162 transmitted according to the first hop pattern 160 may optionally be longer than sub-data packets 142 transmitted according to the second hop pattern 140.

[0046] In embodiments, the sub-data packets that are sent according to the first hop pattern 160 and / or second hop pattern 140 can be provided with synchronization sequences such that a time interval between synchronization sequences of the sub-data packets 162 that are sent with the first hop pattern 160 and synchronization sequences of the sub-data packets 142 that are sent with the second hop pattern 140 is the same.

[0047] Instead of reducing the pauses between sub-packets 162, fewer sub-packets can be used and their length increased. This offers the advantage that the same detection can be used for both (or more) classes of hop patterns (subject to the restriction that the spacing of the synchronization sequences remains the same). In the case of the low-latency hop pattern class, detection can optionally be performed only over the first hops.

[0048] Fig. 4a shows in a diagram an exemplary occupancy of the transmission channel during the transmission of the first plurality of sub-data packets 142 according to the first hop pattern 140, while Fig. 4b shows in a diagram an exemplary occupancy of the transmission channel during the transmission of the second plurality of sub-data packets 162 according to the second hop pattern 160. In other words, Fig. 4a and 4b show a comparison of a hop pattern in normal mode (with high latency) and a hop pattern from the low latency class. To transmit the same amount of data with fewer subpackets, the length of the subpackets was increased.

[0049] In the example, the length of the subpackets on the data sender side can depend on the hop pattern class used. Depending on the application, a long subpacket length can be selected for low latency.

[0050] In embodiments, the detection of the various jump patterns of the classes can be carried out on the data receiver side together with an algorithm. 1.3. Increasing bandwidth in low-delay mode

[0051] The two previous embodiments from sections 1.1 and 1.2 have the disadvantage under certain circumstances that the interference immunity decreases due to the reduction of the pauses or the number of sub-packets.

[0052] To counteract this problem, the signal bandwidth can be increased. This reduces the probability that an external interferer can destroy more than one subpacket, since the interference is also band-limited, and increasing the bandwidth increases the probability that an interferer is only partially in the same band as the telegram.

[0053] By expanding the transmission bandwidth, the bandwidth in which interference can occur also increases. If the interference is evenly distributed across the entire used bandwidth, there is no advantage in this scenario. However, transmission usually takes place in the so-called ISM bands, where the maximum channel occupancy is prescribed. However, there are different maximum permitted channel occupancy values ​​for the various bands. If the hopping pattern is selected to be wide enough that several (at least two) bands with different channel occupancy values ​​are used for transmission, this results in an advantage in terms of interference immunity, since the channel occupancy of the interferers varies across the bands.

[0054] Increasing only the bandwidth of the low-delay mode has the disadvantage under certain circumstances that detection must be performed separately for the different modes, as described in Section 1.1. However, the immunity to external and self-interference increases. If the bandwidth of the normal mode is also increased, joint detection can still be performed using Section 1.2. In this case, the self-interference immunity is the same as if all transmitters were transmitting in normal mode.

[0055] In embodiments, the bandwidth of the different classes of hop patterns can be varied on the data transmitter side.

[0056] In embodiments, the detection of the different jump patterns of the classes can be carried out on the data receiver side over different bandwidths. 1.4. Use of a different data rate or modulation method

[0057] Similar to (or in combination with) the example in Section 1.3, a higher data rate or a different modulation method can be used for transmission in low-delay mode. Ideally, the data rate is increased to reduce the transmission duration, resulting in a longer pause between subpackets and thus increasing transmission reliability against interference.

[0058] If the modulation type is changed, care should also be taken to reduce the transmission time if possible (e.g. QPSK instead of BPSK).

[0059] The application can decide on the data rate or modulation type to be used based on the priority and the necessary latency of the message.

[0060] In embodiments, the data rate or the modulation type of the different classes of hop patterns can be varied on the data transmitter side.

[0061] In embodiments, the detection of the different jump patterns of the classes can be carried out on the data receiver side using different data rates and / or modulation types. 2. Combination of normal and low-delay jump patterns

[0062] In embodiments, the data transmitter 100 can be configured to channel-code data and divide it into a plurality of sub-data packets, and to transmit the plurality of sub-data packets 162 according to a hopping pattern 160. The data transmitter 100 can be configured to channel-code the data and divide it into the plurality of sub-data packets 162 in such a way that, in the case of error-free transmission, only a first group 170 of sub-data packets 162 is required for successful decoding of the data, and that, in the case of an erroneous transmission, a higher code gain is achieved by combining the first group of sub-data packets and the second group of sub-data packets.

[0063] Accordingly, the data receiver 110 can be configured to receive at least the first group 170 of sub-data packets 162 and to decode a portion of the channel-coded data received with the first group 170 of sub-data packets 162 to obtain the data. Furthermore, if the decoding of the data was unsuccessful, the data receiver 110 can be configured to combine at least a second portion of the channel-coded data received with at least a second group 172 of sub-data packets 162 with the first portion of the channel-coded data to achieve a higher code gain and to decode it to obtain the data.

[0064] Instead of defining different classes of jump patterns, it is also possible to send a message with redundancy in such a way that early decoding is possible. 2.1. Short pauses at the beginning of the telegram

[0065] The embodiment described in Section 2 can reduce transmission latency; however, under certain circumstances, the required latency is still not achieved for certain applications. To solve this problem, the pauses of the first subpackets can be shortened similarly to the embodiment in Section 1. The difference, however, is that not all pauses are shortened, but only the number required for early decoding.

[0066] In embodiments, the transmission pauses between the sub-data packets 162 of the first group 170 of sub-data packets 162 may therefore be smaller than transmission pauses between sub-data packets 162 of a second group 172 of sub-data packets 162 that are transmitted after the first group 170 of sub-data packets 162, as shown in Fig. 5 is shown.

[0067] In detail, Fig. 5in a diagram an exemplary occupancy of the transmission channel during the transmission of channel-coded data by means of the plurality of sub-data packets 142, wherein transmission pauses between the sub-data packets 162 of a first group 170 of sub-data packets 162 are smaller than transmission pauses between sub-data packets 162 of a second group 172 of sub-data packets 162. In other words, Fig. 5 shows a combination of a normal and a low-delay jump pattern.

[0068] The advantage of this methodology is that the delay for telegrams with a good SNR can be significantly reduced without additional effort or overhead, since the first part of the message can be decoded in advance with a low delay. If the SNR is low, the transmission does not need to be repeated; it is sufficient to receive the remaining information and then perform normal decoding.

[0069] If the receiver is capable of estimating the SNR or reception level of the telegram, it is possible to make a direct decision (signal SNR above threshold) as to whether the telegram can be decoded early or not. In this case, it is not necessary to attempt a decoding attempt with a portion of the data for each received subpacket.

[0070] In embodiments, the first sub-packets on the data transmitter side may have shorter pauses than the rear sub-packets.

[0071] In some embodiments, the data receiver (or decoder) may attempt to decode the telegram even before receiving the complete message. If this is not possible, the remaining part of the message can also be received and subsequently decoded. 2.2. Increasing pauses with increasing number of transmitted sub-packets

[0072] The embodiment according to section 2.1 has the disadvantage under certain circumstances that after a failed previous decoding, a relatively long wait must be made until further sub-packets are received and a new decoding attempt can be carried out.

[0073] In embodiments, therefore, transmission pauses between the sub-data packets of the second group 172 of sub-data packets 162 may increase with increasing number of transmitted sub-data packets 162, as shown in Fig. 6 is shown.

[0074] In detail, Fig. 6in a diagram, an exemplary occupancy of the transmission channel during the transmission of channel-coded data by means of the plurality of sub-data packets 142, wherein transmission pauses between the sub-data packets 162 of a first group 170 of sub-data packets 162 are smaller than transmission pauses between sub-data packets 162 of a second group 172 of sub-data packets 162, and wherein transmission pauses between the sub-data packets 162 of the second group 172 of sub-data packets 162 increase with an increasing number of transmitted sub-data packets 162. In other words, Fig. 6 shows increasing pauses between the sub-packets for reception field strength dependent decoding.

[0075] The problem mentioned above can thus be avoided by gradually increasing the pauses between the sub-packets as the number of sub-packets sent increases.

[0076] It is important to note that the breaks do not have to be distributed in a strictly monotonically increasing manner, but there should be a tendency towards increasing breaks.

[0077] If the receiver cannot estimate the SNR or received power, a decoding attempt is made after each received block of new sub-packets (see Figure 4 (above, the representation of the sub-packet blocks.) If the receiver has an SNR or reception level estimate, it can calculate which block is required to decode the telegram.

[0078] In exemplary embodiments, the pauses between subpackets on the data transmitter side can increase on average with the increasing number of subpackets. The transmission latency depends on the SNR or the level of interference at the receiver.

[0079] In some embodiments, the data receiver can attempt to decode the telegram even before the complete message has been received. If this is not possible, the remaining part of the message can also be received and subsequently decoded. The receiver can optionally estimate the SNR or the reception level of the telegram and use this to determine a point in time at which it is appropriate to initiate an early decoding attempt. 3. Telegram repetition

[0080] The implementation examples presented in Sections 1 and 2 have the disadvantage, under certain circumstances, that reducing the pauses between telegrams increases susceptibility to interference and thus reduces the probability of transmission success. One solution for increasing transmission reliability is telegram repetition. Optimized concepts for this are presented below. 3.1. Low-Delay and Standard Jump Patterns

[0081] In embodiments, the data transmitter 100 may be configured to divide data into a plurality of sub-data packets 162 and to transmit the plurality of sub-data packets 162 using a first hop pattern 160, wherein the data transmitter is configured to repeatedly transmit the plurality of sub-data packets 162 using a second hop pattern 140, wherein transmission pauses between sub-data packets 162 transmitted according to the first hop pattern 162 are smaller than transmission pauses between sub-data packets 162 transmitted according to the second hop pattern 140.

[0082] In embodiments, the data receiver 110 may be configured to receive data divided into a plurality of sub-data packets 162 and transmitted using a first hop pattern 160 and repeatedly using a second hop pattern 140, wherein transmission pauses between sub-data packets 162 transmitted according to the first hop pattern 160 are smaller than transmission pauses between sub-data packets 162 transmitted according to the second hop pattern 140.

[0083] Instead of sending a single low-delay jump pattern, the same telegram can be sent again with a different jump pattern that has a longer delay to increase transmission reliability. This principle is illustrated by Fig. 7 .

[0084] In detail, Fig. 7in a diagram an exemplary occupancy of the transmission channel during the transmission of channel-coded data by means of a plurality of sub-data packets 162 using a first hop pattern 160 and repeated using a second hop pattern 140. In other words, Fig. 7 shows a combination of a low-delay transmission with a standard transmission as a repeat.

[0085] If multiple repetition is used, the jump patterns, apart from the last repetition, can also have the same or a similar latency as the initial pattern (e.g. the telegram can be sent twice with the low-delay pattern and finally once with the standard pattern).

[0086] If the low-delay telegram is already correctly decoded in the receiver, the receiver can skip decoding the message of the standard telegram with a higher delay.

[0087] If the message was not received correctly, the receiver can receive the standard telegram and then decode it. If this also fails due to noise or interference, it can perform a combination of at least the two transmissions (e.g., Maximum Ratio Combining, or MRC for short).

[0088] As an alternative to fully receiving the standard telegram, it would also be possible to receive only part of the message of the standard telegram and perform a partial combination with the low-delay telegram.

[0089] If the receiver has an SNR or reception level estimate, it would again be possible to determine the (presumably) necessary number of sub-packets in advance and then start the decoding accordingly after receiving them.

[0090] In exemplary embodiments, the data transmitter side can always initially perform (at least) one transmission with a low-delay hop pattern. This can be followed by repetitions with hop patterns that have a higher latency than the initial pattern.

[0091] In some embodiments, the receiver may first attempt to receive the initial telegram. If that fails, it may attempt to decode the retransmission or a combination of the initial transmission and the retransmission. 3.2. Distribution of telegrams across multiple frequency bands

[0092] The use of low-delay telegrams has the disadvantage of increased susceptibility to interference due to the shortened pauses. One possible solution to this problem is the parallel transmission of a low-delay telegram on two different frequency bands ("dual method") (similar to the bandwidth increase described in Section 1.3). In contrast to multi-carrier methods (see Section 5), dual methods never transmit on two frequencies simultaneously; instead, the subpackets are transmitted sequentially, as is the case when using a single frequency band.

[0093] As explained below, this can happen in different ways.

[0094] In embodiments (case a)), the first hopping pattern may extend over two separate frequency bands, as shown in Fig. 8 is shown.

[0095] Fig. 8shows in a diagram an exemplary occupancy of the transmission channel during the transmission of the plurality of sub-data packets 162 using a hopping pattern 160 extending over two separate frequency bands 180 and 182. In other words, Fig. 8 shows a "dual procedure" according to case a), where sub-data packets are distributed over two separate frequency bands, on each of which half a low delay telegram is transmitted.

[0096] As in Fig. 8 As shown, the hopping pattern can be selected so that a complete low-delay telegram is distributed across the two frequency bands used. This method increases immunity to narrowband interference compared to using a single frequency band and reduces latency compared to standard TS telegrams.

[0097] In embodiments (case b)), the data can be transmitted twice in two separate frequency bands using the first hop pattern. In other words, a complete low-delay telegram can be transmitted on each of the two frequency bands used. This means that, in contrast to case a), two complete low-delay telegrams can be transmitted instead of one. This further increases robustness against interference, at the expense of higher latency.

[0098] In embodiments (case c)), the plurality of sub-data packets 162 may be transmitted twice in two separate frequency bands using the first hopping pattern and repeatedly transmitted twice in two separate frequency bands using the second hopping pattern, as shown in Fig. 9 is shown.

[0099] In detail, Fig. 9in a diagram an exemplary occupancy of the transmission channel during the transmission of the plurality of sub-data packets 162 using the first hop pattern 160 twice in two separate frequency bands 180 and 182 and repeated using the second hop pattern 140 twice in two separate frequency bands 180 and 182. In other words, Fig. 9 shows a hopping pattern distributed over two frequency bands; transmission of a low delay telegram followed by a standard telegram.

[0100] As in Fig. 9As can be seen, a combination of the low-delay telegram and the standard TS telegram described in Section 2.1 is possible to further increase the robustness of the "dual procedure." The transmission of half a low-delay telegram on each of the two frequency bands is followed by a standard TS telegram, whose subpackets are also transmitted half on each of the two bands. This means that a total of two telegrams are transmitted: a low-delay telegram and a standard TS telegram. The advantage is a significantly increased probability of reception in the event of a fault by using a standard TS telegram.

[0101] In the exemplary embodiments (case d)), the highest interference immunity can be achieved by combining variants b) and c). A complete low-delay telegram followed by a complete standard TS telegram is sent on each of the two frequency bands. This can also increase interference immunity against broadband interference. The disadvantage is that the latency is not as significantly improved as in cases a) or c). A total of four complete telegrams are transmitted here (two low-delay telegrams and two standard TS telegrams).

[0102] In embodiments, the combination of a low delay telegram and a standard TS telegram allows transmission with low latency (e.g., fast alarming), whereby the standard TS telegram transmission serves as a backup to increase the probability of reception.

[0103] In embodiments, the hopping pattern can be divided into several, e.g. two, frequency bands on the data transmitter side, with a gap between the frequency bands which is not used.

[0104] In some embodiments, the detection of telegrams on the data receiver side can, for example, be performed only in one of the two bands. If a telegram is detected in one of these two bands, the remaining sub-packets in the other band can be automatically determined based on the fixed time-frequency offset. 3.3. Nesting a Low Delay Telegram in a Standard TS Telegram Jump Pattern

[0105] In embodiments, the data may be transmitted using the first hop pattern 160 and repeatedly using the second hop pattern 140 in an interleaved manner, such that at least one sub-data packet 142 sent according to the second hop pattern 140 is arranged between two sub-data packets 162 sent according to the first hop pattern 160, as shown in Fig. 10 is shown.

[0106] In detail, Fig. 10 in a diagram, an exemplary occupancy of the transmission channel during the transmission of the plurality of sub-data packets 162 using the first hop pattern 160 and repeatedly using the second hop pattern 140, wherein sub-data packets 162 transmitted according to the first hop pattern 160 are arranged between sub-data packets 142 transmitted according to the second hop pattern 140. In other words, Fig. 10shows low delay telegrams nested in a standard telegram.

[0107] As in Fig. 10 As can be seen, the jump patterns can be selected so that one or more low delay telegrams are nested with a standard TS telegram. The advantage of this method is, on the one hand, the short latency when transmitting the high-priority message using the low delay telegram, and on the other hand, the time saved compared to the consecutive transmission of a low delay telegram and the standard TS telegram, i.e. a shorter latency even if the low delay telegram is not received (e.g. due to interference) and the message can only be forwarded after the standard TS telegram has been fully received.

[0108] In exemplary embodiments, the jump patterns on the data sender side can be defined such that one or more low-delay telegrams and a standard TS telegram can be nested within each other. This means that the pauses between the subpackets of the standard TS telegram are large enough to accommodate at least one subpacket of the low-delay telegram.

[0109] In some embodiments, the receiver can first receive the low-delay telegram and parts of the standard TS telegram, and then attempt to decode the low-delay telegram. If this attempt fails, the receiver can combine the low-delay telegram with the already received subpackets of the standard TS telegram for another decoding attempt. If this attempt also fails, the receiver can decode the complete standard TS telegram (possibly including the subpackets of the low-delay telegram) after receiving it. 4. Receipt confirmations for critical messages (in bidirectional systems) 4.1. Shortened time window until the downlink after low delay uplink

[0110] In embodiments, the data transmitter 100 can be configured to receive a first signal 190 in a time-synchronized manner with the transmission of the data of the first class using the first hop pattern 160, and wherein the data transmitter 100 can be configured to receive a second signal 192 in a time-synchronized manner with the transmission of the data of the second class using the second hop pattern 140, wherein a time interval between the first hop pattern 160 and the first message 190 is smaller than a time interval between the second hop pattern 140 and the second message.

[0111] In embodiments, the data receiver 110 can be configured to send a first message using the first hop pattern 160, which is synchronized in time with the reception of the data of the first class, and the data receiver 110 can be configured to send a second message 192 using the second hop pattern 140, which is synchronized in time with the reception of the data of the second class, wherein a time interval between the first hop pattern 160 and the first message 190 is smaller than a time interval between the second hop pattern 140 and the second message 192.

[0112] For example, the first message may be a first downlink message 190 that is transmitted divided into a plurality of sub-data packets according to a first downlink hop pattern, wherein the second message may be a second downlink message 192 that is transmitted divided into a plurality of sub-data packets according to a second downlink hop pattern, wherein transmission pauses between the plurality of sub-data packets that are transmitted by means of the first downlink hop pattern are shorter than transmission pauses between the plurality of sub-data packets that are transmitted by means of the second downlink hop pattern, as shown in Fig. 11 is shown.

[0113] In detail, Fig. 11in a diagram an exemplary occupancy of the transmission channel during a transmission of the first downlink message 190 synchronized in time with a transmission of the first plurality of sub-data packets 162 according to the first hop pattern 160 compared to an occupancy of the transmission channel during a transmission of the second downlink message 192 synchronized in time with a transmission of the second plurality of sub-data packets 142 according to the second hop pattern 140. In other words, Fig. 11 shows a shortened time window between a low delay uplink and downlink compared to the standard case.

[0114] A bidirectional, non-synchronized system optimized for energy efficiency is typically characterized by the start of the downlink slot being defined by a fixed time interval after the end of the uplink slot. This means that a downlink message can only be sent after an uplink message. The interval between the uplink and downlink messages is fixed or signaled or specified in advance.

[0115] However, a requirement for critical applications may be to minimize latency in both transmission directions (uplink and downlink) in order to be able to send a fast acknowledgment of the message (ACK).

[0116] One possible solution is to shorten the time interval until the start of the downlink slot compared to the standard case in response to the receipt of a low-delay telegram ("low-delay downlink"). For standard telegrams, the pause between the uplink and downlink typically corresponds approximately to the duration of a telegram, i.e., approximately a few seconds (reasons include energy efficiency / the time required to recharge the transmitter's energy storage / capacity limitations of the base station). Similarly, in the case of a received low-delay telegram, the pause between the uplink and downlink can be shortened to approximately the duration of a low-delay telegram.

[0117] The advantage of this solution is that it not only allows for low latency when sending the message, but also provides the sender with timely confirmation of receipt.

[0118] In embodiments, the reception of a low-delay telegram on the data transmitter side can lead to a shortened interval between the low-delay uplink and the start of the downlink slot compared to the standard TS telegram.

[0119] In embodiments, the receiver expects the receipt of the downlink after the transmission of a low delay telegram after a shorter time window compared to the standard case. 4.2. Low delay uplink requests ACK

[0120] Applications that require low latency, i.e., are time-critical, are often also safety-critical (e.g., alarm notifications). In this case, it's a problem that the sender has no certainty about whether the message was successfully transmitted.

[0121] In embodiments, the data transmitter 100 may be configured to receive an acknowledgment of receipt from a data receiver 110 upon sending the first-class data, signaling successful receipt of the first-class data.

[0122] In embodiments, the data receiver 110 may be configured to

[0123] For example, in combination with or in addition to the example in Section 4.1, a bidirectional system can require that the base station always confirm the receipt of a low-delay telegram with an acknowledgment (ACK). The advantage of this approach is that the acknowledgment provides the sender with assurance that the message was successfully received.

[0124] In embodiments, an ACK can be sent on the data receiver side upon successful receipt of a low delay telegram. 4.3. Low Delay Uplink is sent until ACK is received

[0125] In embodiments, the data transmitter 100 may be configured to repeatedly transmit the first class data using the first hop pattern 160 or another hop pattern until the acknowledgment of receipt is received.

[0126] In embodiments, the data receiver 110 may be configured to transmit a receipt acknowledgment signaling successful receipt of the first class data in response to successful receipt of the first class data, wherein the data receiver may be configured to transmit the receipt acknowledgment only for the first class data and not for the second class data.

[0127] One disadvantage of using low-delay telegrams is their lower immunity to interference. To increase the probability that at least one low-delay telegram will be successfully received, the transmitter can transmit it until it receives an acknowledgment (ACK) from the base station. Upon receipt of the ACK, the transmitter stops transmitting. This method has several advantages: It increases the probability that each individual transmitting node will successfully receive its low-delay telegram. By stopping transmission upon the ACK, occupied channel capacity is also freed up. This further increases the reception probability of the entire system in scenarios where several or many sensor nodes want to transmit a low-delay telegram simultaneously.

[0128] In embodiments, an ACK must be sent on the data receiver side upon successful receipt of a low delay telegram.

[0129] In embodiments, the end node may send a low delay telegram until an ACK is received and then the transmission is stopped. 4.4. Downlink nested in uplink

[0130] To increase the probability of receiving a telegram sent as an alarm signal, for example, it can be sent continuously until an ACK is received (see the example in Section 4.3). Normally, a transmission pause must be observed after several transmissions (e.g., two) in order to receive the ACK.

[0131] However, in embodiments, the data transmitter 100 may be configured to receive the acknowledgment of receipt from the data receiver 110 in a temporally overlapping manner with (1) the transmission of the data of the first class using the first hop pattern or (2) the data of the second class using the second hop pattern, such that at least one sub-data packet transmitted according to the respective hop pattern is arranged between two sub-data packets of a hop pattern with which the acknowledgment of receipt of the data receiver is transmitted.

[0132] In embodiments, the data receiver 110 may be configured to transmit the receipt acknowledgment using a hop pattern in a temporally overlapping manner with the reception of (1) the data of the first class using the first hop pattern, or (2) the data of the second class using the second hop pattern, such that at least one sub-data packet transmitted according to the first hop pattern or second hop pattern is arranged between two sub-data packets of the hop pattern with which the receipt acknowledgment is transmitted.

[0133] Fig. 12shows in a diagram an exemplary occupancy of the transmission channel during a transmission of an acknowledgment of receipt 194 divided into a plurality of sub-data packets 195 temporally interleaved with the transmission of the first plurality of sub-data packets 142 according to the second hop pattern 140 in comparison to an occupancy of the transmission channel during a transmission of an acknowledgment of receipt 196 divided into a plurality of sub-data packets 197 temporally after the transmission of the first plurality of sub-data packets 142 according to the second hop pattern 140. In other words, Fig. 12 shows the standard case above and the nested downlink below with the advantage that an additional telegram can be sent and at the same time the downlink can be received earlier.

[0134] In other words, it is alternatively possible to nest the downlink into the still-transmitted uplink hopping pattern after a period of time corresponding to the time interval between the uplink and downlink slots. The advantage of this solution is that no time slot is lost for transmitting the alarm, thus maximizing the probability of reception. At the same time, the time until the ACK is received is minimized, enabling the most timely confirmation of alarm receipt.

[0135] In embodiments, on the data receiver side, after receiving at least one standard TS telegram and the time window until the start of the downlink slot, the jump pattern for a standard TS telegram in the downlink can be selected such that it can be nested in the uplink that is still being transmitted.

[0136] In embodiments, the base station on the data transmitter side can transmit the downlink in parallel with reception, while the sensor node on the data receiver side receives the downlink in parallel with the transmission of the uplink. In other words, both the data transmitter and the data receiver switch between the transmit and receive paths during a telegram. 4.5. Combination of nested downlink with low delay uplink

[0137] In order to achieve the goal of a short latency until successful notification, which is important for critical applications, and based on the previous embodiment from Section 4.4, the first transmissions of a standard TS telegram can be replaced by the transmission of several low delay telegrams in order to reduce the latency. A sequence of several (e.g. two) low delay telegrams is then followed by the transmission of a standard TS telegram in the uplink so that the nested ACK can be received simultaneously in the downlink. The advantages are reduced latency until the first possible reception of the telegram, as well as increased security in the event of non-reception of the low delay telegrams. This is because, by omitting a pause for the downlink, an additional transmission takes place and, secondly, the probability of reception is further increased by the standard TS telegram.

[0138] Fig. 13shows an occupancy of the transmission channel during the transmission of the first plurality of sub-data packets 162 according to the first hop pattern 160, the transmission of the second plurality of sub-data packets 142 according to the second hop pattern 140 and the transmission of a receipt acknowledgment 194 divided into a plurality of sub-data packets 195 temporally interleaved with the transmission of the second plurality of sub-data packets 142 according to the second hop pattern 140. In other words, Fig. 13 shows a low delay uplink followed by a transmission of a standard telegram, in whose pauses the low delay downlink is nested.

[0139] In some embodiments, a standard TS telegram can be transmitted on the data sender side after one or more (e.g., two) low-delay telegrams have been transmitted, and a possible ACK can be received simultaneously in the downlink. The pauses between the subpackets of the standard TS telegram can be used for additional downlink slots.

[0140] In embodiments, the pauses between the sub-packets of the standard TS telegram on the data transmitter side can be used to receive the downlink message, i.e. the sensor node switches between the transmit and receive branches within a telegram. 5. Multi-carrier transmission

[0141] The transmission hop patterns have previously been defined so that at any given time during the telegram transmission, a maximum of one subpacket is transmitted. This has the advantage that virtually any radio chip available on the market can be used for transmission.

[0142] The disadvantage, however, is that this restriction and the pauses in Telegram splitting result in high latencies. 5.1. Fully overlapping multi-carrier mode

[0143] In embodiments, the data transmitter 100 may be configured to transmit at least two sub-data packets 162 corresponding to the first hopping pattern 160 at different frequencies and completely overlapping in time.

[0144] In embodiments, the data receiver 110 may be configured to receive at least two sub-data packets 162 corresponding to the first hopping pattern 160 on different frequencies and completely overlapping in time.

[0145] Fig. 14shows a diagram of an exemplary occupancy of the transmission channel during the transmission of the first plurality of sub-data packets 162 according to the first hopping pattern 160 such that sub-data packets 162 on different frequencies completely overlap in time. In other words, Fig. 14 shows a multi-carrier mode with Telegram splitting.

[0146] As in Fig. 14 As can be seen, it is possible to carry out a so-called multi-carrier transmission, provided that special radio chips, an SDR front end or similar transmitters are used that have the ability to transmit on several frequencies in parallel.

[0147] In combination with telegram splitting, this means that at certain times, several sub-packets are sent in parallel. However, there are also times within the telegram during which no transmission takes place (a transmission pause).

[0148] Previously used receivers can continue to be used without modifying the algorithms (by adapting the hopping pattern), since channel decomposition is usually already implemented in the receiver.

[0149] In embodiments, the jump pattern on the data transmitter side can be defined such that a parallel transmission takes place at least at one point in time. 5.2 Partial overlapping multi-carrier mode

[0150] The previous embodiment according to Section 5.1 has the disadvantage of lower immunity to broadband interference under certain circumstances, since this can now destroy more than one subpacket when it occurs compared to the previous telegram splitting. This is due to the bandwidth of the interference, which is usually larger than the typical jump distances of telegram splitting.

[0151] However, due to the high symbol rate (the symbol rate is related to the bandwidth), this broadband interference is very short in transmission duration. Therefore, it is possible to increase interference immunity by transmitting the sub-packets only partially overlapped.

[0152] In embodiments, the data transmitter 100 can thus be configured to transmit at least two sub-data packets 162 corresponding to the first hop pattern 160 on different frequencies and partially overlapping in time.

[0153] In embodiments, the data receiver 110 may be configured to receive at least two sub-data packets 162 corresponding to the first hopping pattern 160 on different frequencies and partially overlapping in time.

[0154] Fig. 15shows a diagram of an exemplary occupancy of the transmission channel during the transmission of the first plurality of sub-data packets 162 according to the first hop pattern 160, distributed in time and frequency such that sub-data packets 162 partially overlap at different frequencies. In other words, Fig. 14 shows a multi-carrier mode with partial overlays for Telegram splitting.

[0155] As in Fig. 15 As can be seen, the probability that a broadband interferer destroys more than one sub-packet in the area in which the superimposed transmission takes place can be reduced by only partially superimposing the sub-packets.

[0156] In embodiments, the hopping pattern can be defined on the data transmitter side such that a parallel transmission takes place at least at one point in time, whereby the overlay can also occur only in a part of a sub-packet. 6. Combination of classic transmission and telegram splitting

[0157] Provided that transmission reliability is not critical for a low-delay message, the message can initially be sent as a conventional telegram. The message can then be repeated using telegram splitting.

[0158] In embodiments, the data transmitter 100 may be configured to transmit data of a first class using a data packet 150, and wherein the data transmitter 100 may be configured to repeatedly transmit the data using a plurality of sub-data packets 162, wherein the plurality of sub-data packets 162 are transmitted according to a first hopping pattern 160.

[0159] In embodiments, the data receiver 110 may be configured to receive the first class data transmitted using the one data packet 150, and wherein the data receiver 110 may be configured to receive the first class data repeatedly transmitted using the plurality of sub-data packets 162 according to the first hopping pattern 160.

[0160] Fig. 16 shows a diagram of an exemplary occupancy of the transmission channel during the transmission of data of a first class using a data packet and repeated using a plurality of sub-data packets 162 distributed in time and frequency according to a first hopping pattern. In other words, Fig. 16 shows a combination of a classic telegram and a telegram with telegram splitting.

[0161] The time interval and the optional frequency offset between the classic telegram and the telegram splitting telegram can be freely selected. In this case, only separate decoding of the message is possible, unless the detection can detect both telegrams and successfully synchronize.

[0162] Optionally, the time and frequency interval between the two transmissions can also be fixed. In this case, a combination of the two transmissions is possible; it is sufficient if only one of the two telegrams is detected and can be used for synchronization.

[0163] In the example embodiments, the data sender can always initially transmit using a conventional transmission method (e.g., BPSK without pauses). This is followed by repetitions using telegram splitting.

[0164] In some embodiments, the receiver can have two separate processing threads. One is responsible for detecting and processing the classic transmission method, and another for processing telegram splitting. Optionally, a combination of both transmissions can be performed if the time and frequency between the two transmissions are known or a hypothesis test is being performed. 6.1. Nested transmission of the classic transmission with Telegram splitting

[0165] The implementation example described in Section 6 has the disadvantage, under certain circumstances, that if the transmission is incorrect using the traditional transmission method, the latency increases significantly. One possible solution to this problem would be to repeat the transmission using the traditional transmission method (e.g., two or three times) before performing the transmission using telegram splitting.

[0166] This increases the probability of getting through, but still has the disadvantage that on heavily interfered channels, there is still a comparably high failure rate for conventional transmission. In these channels, it is therefore more likely that conventional telegrams cannot be received correctly, even when repeated, than transmissions using telegram splitting.

[0167] This means that these channels continue to face the problem of rapidly increasing latency during transmission.

[0168] In embodiments, the data transmitter 100 can therefore be configured to transmit the data of the first class repeatedly using a further data packet 151. In this case, the data transmitter 100 can be configured to transmit the data of the first class using the further data packet 151 and the plurality of sub-data packets 162 in a temporally interleaved manner, such that the further data packet 151 is arranged temporally between two of the plurality of sub-data packets 162.

[0169] In embodiments, the data receiver 110 can be configured to further repeatedly receive the data of the first class using a further data packet 151. In this case, the data receiver 110 can be configured to receive the data of the first class using the further data packet 151 and the plurality of sub-data packets 162 in a temporally interleaved manner, such that the further data packet 151 is arranged temporally between two of the plurality of sub-data packets 162.

[0170] Fig. 17shows in a diagram an occupancy of the transmission channel during the transmission of data of a first class using a data packet 150 and repeatedly using a further data packet 151 and repeatedly using a plurality of sub-data packets 162 distributed in time and frequency according to a hopping pattern, wherein the further data packet 151 and the plurality of sub-data packets 162 are interleaved such that the further data packet 151 is arranged temporally between two of the plurality of sub-data packets 162. In other words, Fig. 17 shows a nested transmission of a telegram with a classic transmission method and a telegram with telegram splitting.

[0171] As in Fig. 17As can be seen, the problem mentioned at the beginning can be avoided by transmitting the telegram (multiple times) using the classic transmission method interleaved with the telegram splitting.

[0172] The jump pattern can be defined in such a way that the pauses between the sub-packets are so long that a telegram with classic transmission methods fits into this gap or a puncturing of the telegram splitting telegram is carried out.

[0173] In embodiments, the (repeated) transmission on the data transmitter side can be carried out using a classic transmission method (e.g. BPSK without pauses) interleaved with the transmission of the telegram with telegram splitting.

[0174] In some embodiments, the receiver can have two separate processing threads. One is responsible for detecting and processing the classic transmission method, and another for processing telegram splitting. Optionally, a combination of both transmissions can be performed if the time and frequency between the two transmissions are known or a hypothesis test is being performed. 6.2. Acknowledgement in bidirectional systems

[0175] In embodiments, the data transmitter may be configured to select a time interval between the transmission of the data packet 150 and the plurality of sub-data packets 162 so large that a receipt acknowledgment 154 from a data receiver 110 is possible within the time interval.

[0176] In embodiments, the data receiver 110 may be configured to send a receipt acknowledgment 154 at a time interval between the receipt of the data packet 150 and the plurality of sub-data packets 150.

[0177] Fig. 18 shows in a diagram an exemplary occupancy of the transmission channel during the transmission of data of a first class using a data packet 150 and repeatedly using a plurality of sub-data packets 162 according to a first hop pattern 160 distributed in time and frequency, and a transmission of a receipt acknowledgment 154 at a time interval between the data packet 150 and the plurality of sub-data packets 162. In other words, Fig. 18 shows a combination of a classic telegram and a telegram with telegram splitting with an acknowledgment of receipt for the classic transmission method.

[0178] As in Fig. 18As can be seen, in addition to the two previous embodiments from sections 6 and 6.1, in a bidirectional system the pause between the classic transmission and the telegram with telegram splitting or, in the embodiment according to section 6.1, the pause to the next sub-packet can be chosen to be so long that an acknowledgment of receipt can be sent back by the recipient of the message between the two transmissions.

[0179] If the sender of the original message correctly receives the confirmation of receipt, the telegram splitting telegram can be omitted because the correct receipt of the message has already been acknowledged by the recipient.

[0180] Otherwise, if no acknowledgement of receipt has been received from the message recipient, the telegram can be sent using telegram splitting. If the message has a high priority, the classic telegram can also be sent again.

[0181] The acknowledgement of receipt can take place in the same frequency band or in a different frequency band where, for example, there is less interference.

[0182] In embodiments, on the data receiver side, provided the transmission was correctly received using a conventional transmission method, the receiver of the message can send an acknowledgment of receipt back to the sender, whereby on the data sender side the data sender can decide whether further transmissions are made depending on the receipt (or non-reception) of the acknowledgment of receipt.

[0183] In some embodiments, the receiver can have two separate processing threads. One is responsible for detecting and processing the classic transmission method, and another for processing telegram splitting. Optionally, a combination of both transmissions can be performed if the time and frequency between the two transmissions are known or a hypothesis test is being performed. 7. Information coding in the jump pattern

[0184] As already described in Section 1.2, the number of subpackets to be transmitted can be reduced to reduce transmission latency. To achieve this, Section 1.2 increases the length of the subpackets to transmit the same amount of data with fewer subpackets. However, this has the disadvantage of reducing the system's noise immunity.

[0185] To solve the problem mentioned above, the information encoding (part of) the data can be done in the hop pattern. This means that a predefined pattern is no longer used; instead, the position of the sub-packets in frequency and / or time defines the data symbols.

[0186] In embodiments, the data transmitter 100 may thus be configured to calculate at least a portion of the first hop pattern from the first class data or a channel-coded version of the first class data, such that at least a portion of the first hop pattern itself encodes at least a portion of the first class data.

[0187] For example, a first group of hops of the first hop pattern can be fixed, wherein the data transmitter can calculate a second group of hops of the first hop pattern from the data of the first class or a channel-coded version of the data of the first class, so that the second group of hops of the first hop pattern itself encodes at least a portion of the data of the first class. The data transmitter 100 can be configured to transmit the first plurality of sub-data packets corresponding to the first group of hops and the second group of hops.

[0188] In embodiments, the data receiver 110 may be configured to decode the pattern of the second group of hops of the first hop pattern to obtain at least the part of the first class data or the channel-coded version of the first class data.

[0189] In some embodiments, this can be used exclusively for modulating the data bits (i.e., all information is encoded in the hopping pattern). In this case, the symbols within the subpackets consist of a pure synchronization sequence, or the subpackets contain, in addition to the synchronization sequence, additional data bits that have been mapped to symbols according to the modulation rule. In this case, the data transmission consists of the information in the hopping pattern and the information in the symbols of the subpackets.

[0190] In the receiver, the hopping pattern can be detected using hypothesis testing and the data bits can be extracted from the determined frequencies and time intervals of the sub-packets.

[0191] For example, two carrier frequencies (fc1 and fc2) can be defined. If a one is to be transmitted as the data bit, frequency fc1 is used as the carrier frequency; otherwise, if a zero is to be transmitted as the data bit, frequency fc2 is used.

[0192] The assignment of frequencies and times can be done arbitrarily, but must be known to both the transmitter and the receiver.

[0193] Optionally, channel coding of the data bits can be performed before assigning the data bits to the respective frequencies and / or time intervals. This can be used to correct errors that occur during transmission (e.g., due to noise or interference) or during estimation in the receiver. This channel coding also makes it possible to use this method in interference channels and with low SNR, where the temporal position and / or frequency cannot be determined for all subpackets.

[0194] In embodiments, the position of the sub-packets in time and / or frequency on the data transmitter side may depend on (a part of) the information to be transmitted.

[0195] In embodiments, the receiver can determine the time and / or frequency intervals between the sub-packets by means of hypothesis testing (e.g., a correlation with the synchronization sequence in the sub-packet) in order to be able to extract the transmitted information therefrom. 7.1. Simplified detection using a fixed reference

[0196] The embodiment described in Section 6 may have the disadvantage that, in unsynchronized systems, the receiver has no information about where and when the telegram starts. Encoding the information in the hop pattern makes it impossible to easily detect the telegram, as the positions of the subpackets vary in time and / or frequency.

[0197] Thus, the receiver must continuously search for a telegram, examining all possible hop patterns. With limited computing power available, it is usually not possible to search for all possible transmission combinations.

[0198] In embodiments, the data transmitter 100 may therefore be configured to transmit the first plurality of sub-data packets 162 according to the first hop pattern 160 in a distributed, time-synchronized manner to a synchronization signal for synchronization in a data receiver.

[0199] In embodiments, the data receiver 110 may be configured to detect the first plurality of sub-data packets 162, transmitted distributed according to the first hopping pattern 160, in a received data stream using the synchronization signal, wherein the data receiver may be configured to decode the first hopping pattern itself to obtain at least the part of the first-class data or the channel-coded version of the first-class data.

[0200] Fig. 19ashows in a diagram an exemplary occupancy of the transmission channel during the transmission of the first plurality of sub-data packets 162 according to the first hop pattern 160, distributed in time and frequency, synchronized with a synchronization signal 158. The synchronization signal 158 can, for example, have two (or more) sub-data packets 159 with synchronization sequences for synchronizing the sub-data packets 159 in a data receiver 110, wherein the two (or more) sub-data packets 159 are transmitted according to a fixed (non-variable or predetermined) hop pattern. In other words, Fig. 19a shows a combination of a fixed and variable jump pattern.

[0201] In exemplary embodiments, one or more synchronization bursts (in the limiting case this is only a sub-packet) can be sent with a fixed jump pattern before the actual transmission (see Figure 11(bottom sketch). The receiver can use this part of the transmission for telegram detection.

[0202] In embodiments, the data transmitter 100 can alternatively also be configured to transmit the first plurality of sub-data packets 162 corresponding to a first group 163_1 of hops and a second group 163_2 of hops of the first hop pattern 160, wherein the first group 163_1 of hops is fixedly predetermined, and wherein the data transmitter 100 is configured to calculate the second group 163_2 of hops from the data of the first class or a channel-coded version of the data of the first class, so that the second group 163_1 of hops of the first hop pattern itself encodes at least part of the data of the first class.

[0203] Fig. 19bshows a diagram of an exemplary occupancy of the transmission channel during the transmission of the first plurality of sub-data packets 162 according to a hop pattern with a first group 163_1 of hops and a second group 163_2 of hops, wherein the first group 163_1 of hops is fixed, and wherein the second group 163_2 of hops is calculated from the data of the first class or a channel-coded version of the data of the first class. In other words, Fig. 19b shows a combination of a fixed and a variable jump pattern.

[0204] In embodiments, it is also possible to send a part 163_1 of the actual sub-packets (these contain a pilot sequence and data) with a fixed hop pattern.

[0205] The time of the subsequent transmission of the previously sent information with the fixed jump pattern is defined and known to the receiver. It would also be possible to send the data of the variable jump pattern before or between the fixed jump pattern. Thus, the reference used for detection would be at the end or in the middle of the telegram.

[0206] The length, data rate, modulation method, bandwidth, and other parameters of the transmission with the fixed hop pattern may differ from the transmission with the information in the hop pattern.

[0207] In embodiments, sub-packets with a fixed hop pattern can be sent on the data transmitter side before the transmission of the sub-packets, in which the position in time and / or frequency depends on (a part of) the information to be transmitted.

[0208] In embodiments, the receiver can use the subpackets with the fixed hopping pattern to determine whether and when a transmission has occurred. If a transmission has been detected, the receiver uses this detection to determine the time and / or frequency intervals between the subpackets in order to extract the transmitted information. 8. All information in each sub-packet

[0209] In embodiments, the data transmitter 100 can be configured to divide the data of the first class into the first plurality of sub-data packets 162 in such a way that each sub-data packet 162 can be decoded on the receiver side in the case of an error-free transmission in order to obtain the data of the first class, and that in the case of an error-prone transmission, a higher code gain is achieved by combining at least two of the sub-data packets 162.

[0210] In embodiments, the data receiver 110 may be configured to receive at least a first sub-data packet of the first plurality of sub-data packets 162, and to decode the first sub-data packet to obtain the data of the first class, and, if the decoding of the data of the first class using the first sub-data packet was not successful, to combine the first sub-data packet with at least a second sub-data packet of the first plurality of sub-data packets 162 to achieve a higher code gain and to decode it to obtain the data of the first class.

[0211] Fig. 20 shows a diagram of an exemplary occupancy of the transmission channel during the transmission of the first plurality of sub-data packets 162 according to the first hop pattern 162, wherein each sub-data packet 162 is decodable on the receiver side in the case of error-free transmission. In other words, Fig. 20shows a transmission with full information on each sub-packet.

[0212] In exemplary embodiments, it is thus also possible to transmit the entire information in each subpacket instead of dividing the entire information into several subpackets to reduce latency. Thus, with an interference-free channel and sufficient SNR (signal-to-noise ratio), it is possible to decode the information after receiving just one subpacket.

[0213] The transmissions of the subsequent subpackets can either be repetitions or be encoded together with the subpacket so that each subpacket carries the full information. This means that each subpacket has a code rate of at least one. For example, if three subpackets are sent, a code rate of 1 / 3 is used.

[0214] Optionally, it is also possible to further increase the code rate. For example, a code with a rate of 1 / 4 could be used for three subpackets. In this case, each subpacket would have a code rate of 3 / 4, which has the advantage that in the case of only "minor" interference, there is no need to wait for the next subpacket.

[0215] In embodiments, each sub-packet on the data sender side can contain the full information of the telegram.

[0216] In embodiments, the receiver may attempt to decode the message after receiving the first sub-packet. 9. Special interleaving for early decoding

[0217] In embodiments, the data transmitter 100 can be configured to channel-code the data of the first class and to transmit it using the first hopping pattern 160, wherein the data transmitter is configured to distribute the channel-coded data of the first class among the first plurality of sub-data packets 162 in such a way that only a first group 163_1 of sub-data packets 162 is required for successful decoding of the data of the first class in the case of error-free transmission thereof, and that in the case of an erroneous transmission, a higher code gain is achieved by a combination of the first group 163_1 of sub-data packets 162 and a second group 163_2 of sub-data packets 162 (and optionally a third group 163_3 of sub-data packets 162), wherein the first group 163_1 of sub-data packets 162 is transmitted chronologically before the second group 163_2 of sub-data packets 162 (and the third Group 163_3 of sub-data packets 162) is sent.

[0218] In embodiments, the data receiver may be configured to decode a first portion of the channel-coded data received with the first group 163_1 of sub-data packets 162 to obtain the data of the first class, and, if the decoding of the data of the first class was unsuccessful, to combine at least a second portion of the channel-coded data received with at least a second group 162_2 of sub-data packets 162 with the first portion of the channel-coded data to achieve a higher code gain and to decode it to obtain the data of the first class.

[0219] Fig. 21shows a diagram of an exemplary occupancy of the transmission channel during the transmission of the first plurality of sub-data packets 162 according to the first hop pattern 160, distributed in time and frequency, wherein the channel-coded data of the first class is distributed among the first plurality of sub-data packets 162 such that each group 163_1 to 163_3 of sub-data packets 162 can be decoded individually during error-free transmission to obtain the data of the first class. In other words, Fig. 21 shows a special division of the channel-coded data into sub-packets in Telegram splitting to enable the earliest possible decoding.

[0220] Instead of (or in combination with) reducing the pauses in section 1 or the telegram repetition in section 3, a special interleaver structure can also be selected to reduce transmission latency. The goal is to divide the data as efficiently as possible so that a first attempt at decoding the data can be made at the earliest possible time.

[0221] This means that the information does not have to be transmitted multiple times and, compared to the previously known transmission with Telegram splitting, there is no difference in the performance of the system (when considering the complete transmission).

[0222] This goal will now be explained in more detail using the example of a convolutional code with a code rate of 1 / 3, but applies analogously to other channel codes.

[0223] For a convolutional code with a code rate of 1 / 3 (without puncturing), three polynomials are used during encoding. The output of these three polynomials after encoding is then distributed among the subpackets as follows: The bits of the first polynomial are mapped to the first subpackets (first group 163_1 of subpackets), while the bits of the second polynomial are mapped to the middle subpackets (second group 163_2 of subpackets), and the bits of the third polynomial are mapped to the last subpackets (third group 163_3 of subpackets).

[0224] This special division allows the receiver to initiate a decoding attempt after receiving, in the example, just one-third of the subpackets. If this attempt fails, it can receive additional data and initiate new decoding attempts accordingly.

[0225] In embodiments, the interleaver on the data transmitter side can be designed so that the minimum information required for a decoding attempt can be introduced and transmitted as early as possible in the packet.

[0226] In some embodiments, the receiver can attempt to decode the message after receiving all data from polynomial 0. If this fails, further information is received. Alternatively, if the receiver has an estimate of the reception parameters, it can calculate at what point decoding seems appropriate. 9.1. Combination of polynomials

[0227] If, for example, in the embodiment according to Section 9, the first sub-packet of polynomial 0 and the first sub-packet of polynomial 1 are disturbed, premature decoding of the telegram after receiving polynomial 1 is generally not possible; polynomial 2 must also be received. To improve the latency, the second and third polynomials in the example from Section 9 can be nested. Such a structure is shown in Fig. 22 to see.

[0228] In detail, Fig. 22in a diagram, an exemplary occupancy of the transmission channel during the transmission of the first plurality of sub-data packets 162 according to the first hopping pattern 160, distributed in time and frequency, wherein the channel-coded data of the first class is distributed among the first plurality of sub-data packets 162 such that a first group 163_1 of sub-data packets 162 comprises channel-coded data according to a first coding polynomial (polynomial 0), and that a second group 163_2 of sub-data packets 162 comprises channel-coded data according to several coding polynomials (polynomial 1 and polynomial 2). In other words, Fig. 22 shows a special division of the channel-coded data into sub-packets in telegram splitting to enable decoding as early as possible, with the first polynomial followed by the two other polynomials in a nested manner.

[0229] Due to the fact that polynomial 0 is still completely included in the first sub-packets, the minimum latency is still maintained, but in the case of disturbances such as in the introductory example, it may be sufficient to receive only half (or even less) of the sub-packets of the two remaining polynomials.

[0230] In embodiments, the interleaver on the data transmitter side can be designed such that the minimum information required for a decoding attempt is introduced as early as possible in the packet, with the remaining polynomials being nested.

[0231] In some embodiments, the receiver may attempt to decode the message after receiving all data from polynomial 0. If this fails, further information is received. 9.2. Decision on decoding attempt using the transinformation

[0232] In the two previous embodiments described in Sections 9 and 9.1, the decoding attempt was performed regardless of the channel characteristics. This means that even with poor channel characteristics, a decoding attempt is initiated after receiving polynomial 0, but this attempt is usually unsuccessful.

[0233] In embodiments, the data receiver 110 can be configured to determine, based on an estimation of a transinformation, whether the first group 163_1 of sub-data packets 162 is sufficient for successful decoding of the data of the first class, or whether a combination of the first group 163_1 of sub-data packets and the second group 163_2 of sub-data packets 162 is required for successful decoding of the data of the first class, wherein the data receiver can be configured to decode the first group 163_1 of sub-data packets 162 in order to obtain the data of the first class, provided that the estimation of the transinformation showed that the first group 163_1 of sub-data packets 162 is sufficient for successful decoding of the data of the first class, and wherein the data receiver 110 can be configuredto combine and decode the first group 163_1 of sub-data packets 162 and the second group 163_2 of sub-data packets 162, provided that the estimation of the transinformation showed that a combination of the first group 163_1 of sub-data packets 162 and the second group 163_2 of sub-data packets 162 is required for successful decoding of the data of the first class.

[0234] In embodiments, the data receiver 110, if it has methods for estimating the transinformation of the LLRs (e.g., from the SNR), can calculate the time of a possible correct decoding.

[0235] This means that it is no longer necessary to perform blind decoding attempts until the data has been correctly decoded, thus reducing the computing power in the receiver.

[0236] In embodiments, the receiver can use the transinformation to calculate the point in time at which decoding of the telegram appears to be sensible. 10. Short message with low latency and subsequent details

[0237] In embodiments, the data transmitter 100 may be configured to divide the data of the first class into the first plurality of sub-data packets 162 such that a first group 163_1 of sub-data packets 162 includes core information of the data of the first class and a second group 163_2 of sub-data packets 162 includes extension information of the data of the first class, wherein the first group 163_1 of sub-data packets 162 is sent before the second group 163_2 of sub-data packets 162.

[0238] In embodiments, the data receiver 110 may be configured to first receive the first group 163_1 of sub-data packets 162 and then receive the second group 163_2 of sub-data packets 162 to obtain the core information before the extension information.

[0239] Fig. 23 shows in a diagram an exemplary occupancy of a transmission channel during the transmission of the first plurality of sub-data packets 162 according to the first hop pattern 160, distributed in time and frequency, wherein a first group 163_1 of sub-data packets 162 comprises core information and a second group 163_2 of sub-data packets 162 comprises extension information, wherein the first group 163_1 of sub-data packets 162 is transmitted before the second group 163_2 of sub-data packets 162. In other words, Fig. 23 shows that early alarm is possible because only part of the information is needed at the beginning.

[0240] In many applications, only the information that an event has occurred and the information about which device sent the event are initially required. Further information about the event (such as an excessive temperature in a factory or the cause of an alarm) is required later. For example, in many cases, emergency personnel can already set off to the event originator without knowing the exact cause. During the journey there, the exact cause can be provided later.

[0241] This fact makes it possible to send only the most important information about the event (event + ID) in advance with a short delay. Due to the reduced amount of data to be transmitted, only relatively few sub-packets are required, allowing the pauses between the sub-packets to be similar to the previous durations. This achieves approximately the same interference immunity (at low latency) for high-priority transmission as for a normal telegram with more information. This generally eliminates the need for further telegram repetition to achieve the desired interference immunity.

[0242] In some embodiments, the telegram on the data sender side can be structured such that the first part of the message contains only the information necessary to report an event. The last part contains additional information about the event.

[0243] In some embodiments, the event can be forwarded on the data receiver side after partial decoding of the event and its necessary information, thus reducing latency. Once the complete telegram has been received, the additional data is also made available. 10.1. Assignment of jump patterns

[0244] In embodiments, the data transmitter 100 can be configured to calculate at least a first group of jumps of the first jump pattern 162 using address information of the data transmitter 100 or information derived therefrom, so that the first jump pattern 162 itself identifies the data transmitter. A second group 163_2 of jumps of the jump pattern 162 can be fixed.

[0245] In embodiments, the data transmitter 100 may further be configured to send coded or encrypted information about the first hop pattern in advance to a data receiver 110.

[0246] In embodiments, the data receiver 110 may be configured to identify the data transmitter based on the first hop pattern 160, for example, via previously received coded or encrypted information about the first hop pattern.

[0247] Fig. 24 shows in a diagram an exemplary occupancy of the transmission channel during the transmission of the first plurality of sub-data packets 162 according to the first hop pattern 160 distributed in time and frequency, wherein a first group 163_1 of hops of the hop pattern 162 identifies the data transmitter.

[0248] Instead of encoding the entire information into subpackets, some embodiments also allow a high-priority portion of the message to be included in the hopping pattern. The most sensible approach is to use the sensor node's ID, as this remains constant for multiple transmissions, meaning the base station only needs to search for this pattern.

[0249] This results in different hopping patterns for the different sensor nodes when transmitting the high-priority message, which must be known to the base station. Due to this, the ID of the sensor nodes is encoded into the hopping pattern when transmitting a high-priority message and does not need to be transmitted explicitly.

[0250] To prevent attacks on the system, it is advisable to keep the hop patterns between the nodes and the base station secret. This makes it impossible for outsiders to trigger a false alarm because the hop pattern is unknown.

[0251] To communicate the hop pattern to the base station, a so-called hop pattern identifier can be sent in advance in a normal message (with encryption). From this identifier, the hop pattern used can then be calculated.

[0252] To ensure security, it is also possible to adjust the jump pattern from time to time to avoid replay attacks.

[0253] To maintain low latency in transmitting the high priority message, the hop pattern for reporting the high priority message has fewer hops than a normal telegram.

[0254] In some embodiments, the sensor node can communicate a hopping pattern to the base station using an identifier, which only the sensor node uses to signal high-priority messages. This eliminates the need for an explicit transmission of the ID.

[0255] In some embodiments, in addition to the normal hop patterns, the receiver can detect the hop patterns of the sensor nodes known to it for high-priority messages. If such a pattern is detected, the actual ID can be linked to the hop pattern. 10.2. Assignment of short IDs

[0256] In embodiments, the data transmitter 100 can be configured to receive short address information, which is shorter than address information that uniquely identifies the data transmitter 100 within a communications network, from a base station of the communications network and to use this information when transmitting with the first hop pattern. For example, the data transmitter 100 can be configured to calculate at least one group of hops of the first hop pattern 162 from the short address information, so that the first hop pattern 162 itself identifies the data transmitter.

[0257] In one embodiment, the data receiver 110 can be configured to identify the data transmitter 100 based on the short address information. For example, the data receiver 110 can be configured to identify the data transmitter 100 based on the first hop pattern, which can be calculated at least partially from the short address information.

[0258] In embodiments, the data receiver (e.g., a base station) may be configured to assign to the data transmitter 100 the short address information, which is shorter than address information that uniquely identifies the data transmitter within a communication network.

[0259] Typically, a sensor network contains up to several million sensor nodes, which are served by multiple base stations. Due to this large number of devices, a certain length is required for the unique assignment of the devices using IDs (e.g., IP-v6).

[0260] However, these relatively long IDs are difficult to combine with the concept from Section 10.

[0261] However, since the number of sensor nodes per base station is smaller and not all devices need to send high-priority messages, a short ID can be assigned to these devices by the base station.

[0262] This short ID is then used to transmit the message with high priority. The base station maps the short ID back to the actual ID.

[0263] The short IDs can be repeated in a sensor network; it is only important that all sensor nodes within a base station have a unique short ID.

[0264] In embodiments, short IDs can be used on the data transmitter side for the transmission of high-priority messages, with a base station, for example, assigning the short IDs within the connected devices.

[0265] In embodiments, the receiver can map the short IDs back to the original IDs. 10.3 Assigning short IDs to groups

[0266] In embodiments, the short address information may be assigned to a group of data transmitters 100, wherein the group of data transmitters is arranged in a spatially contiguous area.

[0267] For example, the data receiver 110 may be configured to assign the short address information to the group of data transmitters 110, wherein the group of data transmitters is arranged in a spatially contiguous area.

[0268] It often happens that several event sensors are installed in close proximity (e.g., in a building). In these cases, it is usually not immediately necessary to know the exact event sensor for planning countermeasures. Knowing the building is often sufficient to dispatch emergency personnel to the crisis point.

[0269] For this reason, it's also possible to assign so-called group short IDs. This means that multiple transmitters within a base station receive the same short ID. This makes it impossible to initially assign the short ID to the original ID in the base station.

[0270] For example, the full ID could be included at the end of the message or sent as a separate message.

[0271] In embodiments, short IDs can be used on the data transmitter side for the transmission of high-priority messages, wherein the base station can assign the short IDs to the connected sensor nodes, wherein the IDs can also be assigned multiple times depending on the affiliation of the sensor nodes.

[0272] In some embodiments, upon receiving a short ID, the receiver can initially only transmit the short ID's affiliation. Upon receiving the full ID, this can also be output. 10.4. Abbreviations for high-priority messages

[0273] In embodiments, the first class data may be a short information derived from a sensor value that is shorter than the sensor value.

[0274] In embodiments, the data receiver 110 may be configured to associate the short information with a known sensor value upon receiving the first class data comprising a short information item.

[0275] In most cases, the information for a high-priority message can be narrowed down to a few possible events. This means that, for example, in the case of alarms, there are only a very small number of possible alarms.

[0276] For example, it is not necessary to transmit the entire sensor value of the smoke detector for an alarm; it is sufficient to transmit the alarm message that a smoke detector has been triggered.

[0277] Typically, not every base station will need to process all types of different high-priority messages (events), since not all types of sensor nodes will communicate with the single base station.

[0278] Here it is useful for the base station to know which different types of high-priority messages it needs to receive.

[0279] From this set of message types, the base station can assign an abbreviation (similar to Short ID, but not for the ID but for the message content) to each event and transmit this to the corresponding sensor nodes.

[0280] The combination of short messages into the corresponding message types can vary between base stations, i.e. a short message can have a different meaning at different base stations.

[0281] This allows the amount of data to be transmitted for high-priority events to be significantly reduced and thus the number of sub-packets to be transmitted, resulting in a lower transmission latency.

[0282] If further information is required at a later date in addition to the message type, this can be attached according to section 10 or sent in a separate telegram.

[0283] In embodiments, a class of different high-priority message types can be defined for each base station. The various events within this class can be assigned short messages that are communicated to the corresponding sensor nodes.

[0284] In embodiments, when receiving a short message, the recipient can use the defined class to determine the type of the short message and pass it on. 10.5. Abbreviation of frequently sent message parts

[0285] In embodiments, the data of the first class may be a short information derived from a sensor value that is shorter than the sensor value, wherein the data transmitter may be configured to send the short information and a sensor value associated with the short information or a group of sensor values ​​associated with the short information in advance to a data receiver.

[0286] In embodiments, the data receiver 110 may be configured to receive the short information and a sensor value associated with the short information or a group of sensor values ​​associated with the short information in advance from the data receiver, wherein the data receiver 110 may be configured to associate the short information with a known sensor value or a group of sensor values ​​upon receiving the data of the first class comprising a short information.

[0287] In other words, similar to section 9.3, abbreviations for recurring or frequently sent message parts can also be made in non-high priority messages or in the subsequent details of a high priority message.

[0288] For this, the base station must be provided with information in advance about which message parts and their content occur more frequently. This could, for example, be sensor values ​​from a sensor, whereby after digitizing the data, only the lower byte of a 4-byte ADC value is output. Thus, in this example, the recurring message would be the 3 MSBs (most significant bytes) of the sensor value, which would always be zero.

[0289] If the base station has no prior knowledge of recurring message parts from the sensor nodes connected to it, it can also measure and analyze the received data to detect recurring parts.

[0290] If a recurring message part is detected, it can either be transferred to a shorter message using a table or an arithmetic coding or a Huffman coding or another method can be used to reduce the message volume.

[0291] In exemplary embodiments, a class of different recurring message parts can be defined for each base station (or globally). The various events within this class are assigned short messages (using a table or coding), which are then communicated to the corresponding sensor nodes.

[0292] In embodiments, when the recipient receives a short message, he can use the defined class to convert the short message into the actual message and forward it. 11. Special jump patterns or pilot sequences 11.1. Special jump patterns for priority messages

[0293] In embodiments, the first hopping pattern may be assigned to the data transmitter by a data receiver (e.g., a base station) 110 according to a frequency of use and / or priority.

[0294] Due to the very high number of sensor nodes (several thousand transmitter nodes) in a sensor network, disturbances mainly / often result in self-disturbances between the sensor nodes.

[0295] Self-interference poses a problem with telegram splitting when two senders start transmitting with the same hop pattern within the duration of a sub-packet, as this then leads to a total overlap of the sub-packets.

[0296] If a message with a low delay and high priority is to be sent, it makes the most sense to use a different jump pattern than for normal transmissions.

[0297] However, since the receiver can normally only detect a certain number of patterns, it is not possible to provide each sensor node with its own jump pattern for alerting. Therefore, multiple nodes must share the specific jump patterns.

[0298] Typically, the base station knows which nodes are communicating with it and how frequently these nodes send high-priority messages. Therefore, it makes sense for the base station to assign the available hop patterns for high-priority messages to the corresponding sensor nodes based on their priorities and usage frequency.

[0299] In embodiments, the base station can assign special hopping patterns to the sensor nodes, which can be used for a high priority message. 11.2. Staircase jump pattern for priority messages

[0300] By defining additional jump patterns in Section 11.1, the receiver must also perform detection for these jump patterns. If the receiver's processing power is such that the normal jump patterns require almost all of the receiver's processing power, no jump patterns can be added for high-priority messages unless all jump patterns of the normal mode are no longer supported. However, this results in a performance penalty for normal telegrams.

[0301] To solve this problem, jump patterns can be used for high-priority messages, which can be detected with very little computational effort.

[0302] In embodiments, the first hop pattern 160 may be generated such that sub-data packets 162 that are sent according to the first hop pattern 160 have the same time interval and frequency interval from each other, as shown in Fig. 25 is shown.

[0303] In detail, Fig. 25 in a diagram, an exemplary occupancy of the transmission channel during the transmission of the first plurality of sub-data packets 162 according to the first hop pattern 160, distributed in time and frequency such that sub-data packets 162 sent according to the first hop pattern 160 have the same time and frequency spacing from one another. In other words, Fig. 25 shows a transmission of a telegram with a stair-jump pattern.

[0304] As in Fig. 25A so-called stair-step pattern is a suitable option, which can be detected with very little computational effort. In a stair-step pattern, the frequencies of the consecutive sub-packets are chosen so that the difference between two sub-packets is always the same. The pauses between the sub-packets can optionally be equidistant (i.e., all pauses are the same length) to further reduce computational effort.

[0305] At the receiver, such a telegram (just like a normal telegram) arrives with a frequency offset due to quartz tolerances. When detecting a telegram with a normal hop pattern, detection must be performed across all possible frequency deviations, since the frequency spacing between the sub-packets is not equal.

[0306] In the case of the staircase jump pattern, it is sufficient to search a smaller area, since the frequency shift has shifted the entire telegram and the relative frequency distances between the sub-packets are still constant. Fig. 26 shows a telegram at the receiver which was received without frequency offset, it lies completely within the detection range. In Fig. 27 Two telegrams are still visible, arriving at the receiver with a positive and negative frequency offset, respectively. The telegrams are now only partially within the detection range.

[0307] For detection, a correlation is first performed across the individual subpackets (or a type of correlation) at all possible frequencies within the detection range. The results of these partial correlations are then added according to the hopping pattern of the telegram.

[0308] This is precisely where the advantage of the staircase hopping pattern becomes apparent, as the frequency spacing between the sub-packets is equidistant. In the event of a frequency offset, the telegram is detected on the remaining sub-packets within the detection range.

[0309] This means, however, that the receiver no longer necessarily detects the start of the telegram, but rather any point in the telegram, which depends on the frequency offset.

[0310] Thus, when a telegram is detected, a further determination of the telegram start time must be carried out.

[0311] Another advantage of choosing a step function as a hopping pattern is that each frequency can be used only once, thus maximizing the signal's bandwidth. This results in better immunity to interference from other systems.

[0312] However, this method also has a disadvantage: reduced system capacity due to a reduction in inherent noise immunity. However, this is not a problem if normal messages and high-priority, low-delay messages use different hopping patterns.

[0313] In embodiments, the hopping pattern 162 (on the data transmitter side) can be selected such that all frequency intervals between two sub-packets are equidistant and, optionally, the pauses are also of equal length.

[0314] In some embodiments, the detection range for the stair-step pattern (on the data receiver side) can be smaller than for normal jump patterns. After detecting a stair-step pattern, a further analysis of the exact starting time is performed. 11.3. Special pilot sequences for priority messages

[0315] In section 10.2, so-called short IDs were defined, with which it is possible to send a high-priority message with low latency by reducing the amount of data.

[0316] Another method to reduce the data volume is to encode the short ID, a portion of the full ID, or any part of the message into the pilot sequence. If only a few options are available (such as for the various types of high-priority messages), the receiver can perform a search of the sequences and thus extract the transmitted information from the pilot sequence using hypothesis testing.

[0317] In embodiments, the data transmitter 100 may be configured to calculate at least a portion of a synchronization sequence for synchronizing the first plurality of sub-data packets 162 in a data receiver 110 from at least a portion of the first class data, the first class, address information of the data transmitter 100, or short address information of the data transmitter 100.

[0318] For example, the short ID can be 2 bits long, allowing four different priority types to be signaled. To modulate these four different types into the pilot sequence, four different sequences must be present. One possibility is to develop four sequences that are as orthogonal as possible and can be detected and recognized by the receiver. However, this requires the parallel detection of the four pilot sequences.

[0319] In the case where the pilot sequence is split into multiple parts (at least four in the example) and the addition between the parts of the pilot sequence is performed incoherently (see WO 2017 / 167366), instead of using multiple, preferably orthogonal sequences, a phase offset on the symbols can be used to signal the information in the pilot sequence. In this case, the detection of the four sequences would occur jointly; only the decoder would still need to analyze the phase information of the pilot sequence parts (or phase information between the pilot sequence parts).

[0320] It would also be possible, similar to section 7.1, not to modify all synchronization sequences and to use the remaining part of the synchronization sequence (which is then still constant) for synchronization.

[0321] In embodiments, the pilot sequence on the data transmitter side may be dependent on a message type or a part of the data of a high priority message.

[0322] In embodiments, the receiver can determine the transmitted pilot sequence by means of hypothesis testing and thus extract the type or part of the data of a high priority message. 12. Adaptation of the data rate in the telegram 12.1. Step-wise adjustment of the data rate

[0323] In embodiments, the data transmitter 100 can be configured to channel-code the data of the first class and to transmit it using the first hopping pattern 160, wherein the data transmitter 100 can be configured to distribute the channel-coded data of the first class among the first plurality of sub-data packets 162 in such a way that only a first group of sub-data packets is required for successful decoding of the data of the first class in the case of error-free transmission thereof, and that in the case of an erroneous transmission, a higher code gain is achieved by combining the first group of sub-data packets and the second group of sub-data packets, wherein the data transmitter 100 can be configured to transmit the first group of sub-data packets at a different data rate than a second group of sub-data packets.

[0324] In embodiments, the data receiver 110 may be configured to decode a first portion of the channel-coded data received with the first group of sub-data packets 162 to obtain the first-class data, and, if the decoding of the first-class data was unsuccessful, to combine at least a second portion of the channel-coded data received with at least a second group of sub-data packets 162 with the first portion of the channel-coded data to achieve a higher code gain and to decode it to obtain the first-class data.

[0325] Instead of adjusting the data rate or the modulation method of the entire telegram as described in Section 1.4, it is also possible in some embodiments to adjust the data rate during a telegram. This means that a higher data rate is usually selected at the beginning of the message in order to transmit the minimum information required for early decoding as quickly as possible. After this minimum information has been transmitted, the data rate can be reduced, thus resulting in a longer transmission time for all subsequent subpackets and thus a higher latency.

[0326] Optionally, a few additional redundancy subpackets can be appended before the data rate is varied, which can be used by the receiver in case of interference.

[0327] Thus, a decoding attempt on the sub-packets with a higher data rate can also be successful if a few sub-packets are unusable due to interference.

[0328] This methodology has the advantage over Section 1.4 that the link budget of the transmission is increased with increasing latency due to the reduced data rate. Therefore, transmitters arriving at the receiver with a marginal SNR cannot be received using the method from Section 1.4, but can be received with the data rate adjustment (although this requires accepting high latency).

[0329] In some cases, detection of the transmission at the high data rate may not be possible or may fail (e.g., due to interference or noise). In this case, detection only occurs on the subpackets of the transmission with the lower data rate. Therefore, it is advisable to choose the coding and interleaving so that each of the two parts can be decoded independently, but a combination of both can also be used for decoding.

[0330] Optionally, after varying the data rate, a few additional redundancy subpackets can also be appended, which can be used by the receiver in case of interference.

[0331] In some embodiments, the data rate can change within a telegram (on the data sender side). The change is chosen such that early decoding is possible as soon as all or some of the subpackets have been received at the higher data rate.

[0332] In some embodiments, the receiver may first attempt to decode the telegram after receiving all or part of the subpackets at the higher data rate. If this fails, the remaining subpackets are received at the lower data rate. 12.2. Gradual adjustment of the data rate

[0333] In embodiments, the data transmitter 100 may be configured to channel-code the data of the first class and to divide it into the first plurality of sub-data packets 162, wherein the data transmitter 100 may be configured to successively increase or decrease a data rate at which the sub-data packets 162 are transmitted.

[0334] In some embodiments, instead of adjusting the data rate step by step within a telegram, a gradual adjustment (e.g., linear descent) of the data rate can also be performed. This means that the data rate decreases (or increases) with the increasing number of subpackets sent.

[0335] As discussed in Section 2.2, this has the advantage that the receiver 110 can decide when decoding seems appropriate based on reception parameters. While this is also possible in principle in the previous idea, the latency is not optimized for this scenario.

[0336] If, for example, in the embodiment from section 12.1, one more sub-packet is required than the sub-packets sent with the higher data rate, the latency increases because the sub-packets with the lower data rate, which have a longer transmission time, now follow.

[0337] If we now increase the data rate successively, the latency also increases in the example above, but not as much as if the data rate were adjusted suddenly.

[0338] In exemplary embodiments, the data rate on the data transmitter side can change within a telegram, with several different data rates within the telegram. For example, the data rate can be selected to decrease linearly.

[0339] In some embodiments, the receiver can use reception parameters (SNR, interference) to determine how many subpackets are necessary for early decoding and receives the corresponding number of subpackets. The data rate is successively adjusted according to the method selected in the transmitter. 13. Successive adjustment of sub-packet lengths

[0340] In embodiments, a length of the sub-data packets of the first plurality of sub-data packets 162 may decrease or increase with increasing number of sent sub-data packets.

[0341] Fig. 28 shows in a diagram an exemplary occupancy of the transmission channel during the transmission of the first plurality of sub-data packets 162 according to the first hop pattern 160 distributed in time and frequency, wherein a length of the sub-data packets decreases with increasing number of sent sub-data packets.

[0342] In other embodiments, similar to the successive variation of data rates (see Section 12.2), the length of the subpackets can also be varied based on the number of transmitted subpackets. This means that the length of the subpackets increases or decreases with the number of transmitted subpackets.

[0343] The first sub-packet (or the first 2, 3, 4, ...) already contains the majority (or all) of the information to be transmitted. Thus, from the 2nd or 3rd sub-packet onward, it is pure redundancy.

[0344] The receiver can start a decoding attempt after the 2nd or 3rd received sub-packet or decide based on the reception parameters (SNR, interference level) when a first decoding attempt seems sensible.

[0345] Using this methodology, the latency depends on the reception parameters, similar to Section 2. Therefore, nodes with better reception parameters have a lower latency than nodes with poor reception parameters.

[0346] In embodiments, the length of the sub-packets within a telegram can change on the data sender side, whereby the length depends on the number of sub-packets already sent.

[0347] In embodiments, the receiver can start a decoding attempt as soon as all necessary information has been received or otherwise decides based on reception parameters (SNR, interference) how many sub-packets are necessary for early decoding and receives the corresponding number of sub-packets. 14. Adjusting the transmission power

[0348] The previously described embodiments have the disadvantage under certain circumstances that a reduction in latency can usually only be achieved if the reception parameters (SNR, interference level) of the telegram are good.

[0349] However, typical telegram networks are designed in such a way that there are always some sensor nodes that are at the reception limit (poor SNR and / or severe interference). For these nodes, latency reduction is possible using the previous concepts, but not to the same extent as for transmitters with good reception parameters.

[0350] To solve this problem, the base station can assign different transmission power levels to the sensor nodes based on the reception parameters. These levels are either used for all transmissions or only for high-priority telegrams. This allows even sensor nodes with poor reception parameters to transmit a message with low latency when needed.

[0351] In embodiments, the transmission power of the individual nodes is specified by the base station and determined there based on the reception parameters. 15. Erzeugung von Sprungmustern

[0352] In the following, exemplary embodiments of a method for generating jump patterns are described in more detail. Fig. 29 a method for generating jump patterns for a simple (ie one-time) transmission of data by means of a jump pattern, while Fig. 30 shows a method for generating hop patterns for repeated transmission of data using two hop patterns.

[0353] Fig. 29 shows a flowchart of a method 200 for generating a set of hop patterns, according to one embodiment. The method 200 comprises a step 202 of randomly generating a plurality of hop patterns, wherein the hop patterns have at least two hops distributed in frequency and time. The method 200 further comprises a step 204 of selecting the hop patterns from the plurality of hop patterns whose autocorrelation functions have predetermined autocorrelation properties in order to obtain hop patterns with predetermined autocorrelation properties.

[0354] In embodiments, those jump patterns whose autocorrelation function secondary maxima do not exceed a predetermined minimum amplitude threshold can satisfy the predetermined autocorrelation properties. The amplitude threshold can, for example, be equal to the number of jumps in a cluster of a plurality of clusters into which the jump pattern is divided. A cluster can, for example, be a number of jumps that have the same time and / or frequency separation from one another.

[0355] In embodiments, those jump patterns whose partial sum, calculated over a predetermined number of largest amplitude values ​​of the respective autocorrelation function, is less than a predetermined threshold can satisfy the predetermined autocorrelation properties. The threshold can be selected such that at least two jump patterns (or a predetermined number of jump patterns) satisfy the predetermined autocorrelation properties.

[0356] As in Fig. 29 As can be seen, the method 200 may further comprise a step 206 of calculating cross-correlation functions between the jump patterns with predetermined autocorrelation properties. Furthermore, the method 200 may comprise a step 208 of selecting the jump patterns from the jump patterns with predetermined autocorrelation properties whose cross-correlation functions have predetermined cross-correlation properties in order to obtain jump patterns with predetermined autocorrelation properties and predetermined cross-correlation properties.

[0357] In embodiments, those jump patterns can satisfy the predetermined cross-correlation properties whose partial sums, formed over a predetermined number of largest amplitude values ​​of the respective cross-correlation function, are the smallest.

[0358] Fig. 30 shows a flowchart of a method 210 for generating a first set of hop patterns and a second set of hop patterns. The method 210 includes a step 212 of randomly generating a plurality of hop patterns for the first set of hop patterns and a plurality of hop patterns for the second set of hop patterns, wherein the hop patterns comprise at least two hops distributed in frequency and time, wherein the hop patterns for the first set of hop patterns and the hop patterns for the second set of hop patterns are different.Furthermore, the method 210 comprises a step 214 of selecting the jump patterns from the plurality of jump patterns for the first set of jump patterns whose autocorrelation functions have predetermined autocorrelation properties in order to obtain jump patterns with predetermined autocorrelation properties for the first set of jump patterns, and selecting the jump patterns from the plurality of jump patterns for the second set of jump patterns whose autocorrelation functions have predetermined autocorrelation properties in order to obtain jump patterns with predetermined autocorrelation properties for the second set of jump patterns.

[0359] In embodiments, a time interval between the jumps of the jump patterns for the second set of jump patterns may be at least as long as a time length of one of the jumps of the jump patterns for the first set of jump patterns.

[0360] For example, to nest as many repetitions as possible, the shortest time interval between two sub-data packets (or bursts) can be maximized. This would be (T_Frame - N*T_Burst) / (N-1), i.e., an equidistant temporal distribution of the bursts (within and between clusters). Since this regularity is obviously not optimal for the design process, a slight jitter can be introduced.

[0361] In embodiments, those jump patterns whose autocorrelation function secondary maxima do not exceed a predetermined minimum amplitude threshold can satisfy the predetermined autocorrelation properties. The amplitude threshold can, for example, be equal to the number of jumps in a cluster of a plurality of clusters into which the jump pattern is divided. A cluster can, for example, be a number of jumps that have the same time and / or frequency separation from one another.

[0362] In embodiments, those jump patterns whose partial sum, calculated over a predetermined number of largest amplitude values ​​of the respective autocorrelation function, is less than a predetermined threshold can satisfy the predetermined autocorrelation properties. The threshold can be selected such that at least two jump patterns (or a predetermined number of jump patterns) satisfy the predetermined autocorrelation properties.

[0363] As in Fig. 30 As can be seen, the method 210 may further comprise a step 216 of calculating cross-correlation functions between the jump patterns with predetermined autocorrelation properties for the first set of jump patterns and cross-correlation functions between the jump patterns with predetermined autocorrelation properties for the second set of jump patterns.Furthermore, the method may comprise a step 218 of selecting the jump patterns from the jump patterns with predetermined autocorrelation properties for the first set of jump patterns, whose cross-correlation functions have predetermined cross-correlation properties, to obtain jump patterns with predetermined autocorrelation properties and predetermined cross-correlation properties for the first set of jump patterns, and the jump patterns from the jump patterns with predetermined autocorrelation properties for the second set of jump patterns, whose cross-correlation functions have predetermined cross-correlation properties, to obtain jump patterns with predetermined autocorrelation properties and predetermined cross-correlation properties for the second set of jump patterns.

[0364] In embodiments, those jump patterns can satisfy the predetermined cross-correlation properties whose partial sums, formed over a predetermined number of largest amplitude values ​​of the respective cross-correlation function, are the smallest. 15.1 Erzeugung von Sprungmustern für TSMA

[0365] Jump patterns that are related to the Fig. 29 or Fig. 30 The data generated using the method shown can be used, for example, in a system for unidirectional or bidirectional data transmission from many sensor nodes to a base station using the so-called "Telegram Splitting Multiple Access (TSMA)" access method.

[0366] With TSMA, the transmission of a message is divided into a multitude of short bursts (= hops, or sub-data packets) 142, each separated by transmission-free time intervals of varying lengths. The bursts 142 can be distributed according to a true or pseudo-random principle, both over time and across the available frequencies.

[0367] This telegram splitting approach provides particularly high robustness against interference from other sensor nodes, regardless of whether it originates from the system's own or external systems. The interference robustness of the system's own sensor nodes is achieved in particular by distributing the various user signal bursts as evenly as possible across both the time and frequency domains.

[0368] This random-like distribution can be achieved by various measures, such as (1) unavoidable tolerance deviations of the crystal reference oscillator with respect to the frequency, (2) random asynchronous channel access with arbitrary granularity in the time domain, and (3) different burst arrangement of the different sensor nodes to different hopping patterns.

[0369] To further increase the probability of failure in data transmission, time and frequency diversity can be used when transmitting user data. The sub-data packets (bursts) can be sent at least twice, offset in time, using, for example, different hop patterns and frequency bands. Since only one transmitter is available in the sensor node for signal transmission, nested repetition imposes certain restrictions on the temporal burst arrangement in the hop pattern. The method of nesting the first and second transmission in the case of repetition will be explained in more detail later.

[0370] The diversely redundant signals can be combined at the receive end in a variety of ways, such as maximum ratio combining (MRC), equal-gain combining, scanning / switching combining, or selection combining. When designing such diversely redundant hop patterns, it is also important to ensure that the combiner can easily detect that a repeat and not an initial transmission has been sent.

[0371] The design and optimization of such hopping patterns is explained in detail below.

[0372] In the TSMA transmission method, the individual bursts of a data packet are 120 (hereinafter also referred to as frame), as in Fig. 31a shown, distributed both over time and over frequencies.

[0373] In detail, Fig. 31a in a diagram a structure of a frame 120 with a TSMA jump pattern 140. The ordinate describes the frequency or channels (frequency channels) and the abscissa the time.

[0374] The start time T 0 a frame 120 with the total duration T Frame is randomly selected by the sensor node 100 due to the asynchronous transmission. The time duration T Burst of a burst 142 can vary, is assumed to be constant in the following without loss of generality, whereas the time intervals t n ,(n + 1) , which each represent the distance between two adjacent burst centers (here the two bursts with the indices n and n+1 ) are random variables that are all within a predefined range T A _ min ≤ t n,(n+1) ≤ T A _ max for n ∈ {1,2,...,N-1} lay. NThe number of bursts within a frame is 142. The frequencies used for transmission are assumed to be in the form of discrete frequency channels located in a given frequency channel grid. The frequency separation f n,(n+1) between 2 bursts 142 is a multiple of the carrier spacing used in TSMA B C and thus independent of the symbol rate used S R . ( S R ≤ B C ) . The relative starting frequency of a frame is denoted by f 0 .

[0375] The number of available frequency channels is L specified and it applies N ≤ L. In this respect, there are usually more or exactly as many frequency channels as are required by the N Bursts 142 are needed and within a frame 120 each of the N Bursts 142 in another frequency channel. The NThe frequencies used in bursts do not have to be contiguous, but can be within the L Distribute existing frequencies as desired.

[0376] The arrangement of the N The time and frequency variation of 142 bursts is referred to below as the TSMA pattern (TSMA hopping pattern). If this hopping pattern is known to the receiver, it can synchronize to it using the pilot sequences contained in some or every 142 burst and then decode the received data.

[0377] Regarding the design of one or more TSMA patterns, the following system-related assumptions and limitations can be considered.

[0378] (1) The frequency deviation of the oscillator from its nominal frequency can be taken into account. Depending on the system parameters and hardware requirements, the frequency deviation can be several times the carrier spacing B c Since this frequency offset can take both positive and negative values, a safety strip 156 of S frequency channels can be provided at both edges of the total frequency range considered for use, in which no burst is located (see also Fig. 32 ). In this respect, the degree of freedom for the individual bursts of the jump pattern is reduced to (L-2·S) Frequencies, although still N ≤ (L-2·S) (2) Due to the temporally asynchronous transmission, the receiver 110 does not know when a transmitter 100 is transmitting, and the receiver also does not know which transmitter is transmitting with which hopping pattern. Therefore, detecting a signal would involve considerable additional effort if the pattern arrangement, i.e. the grouping of the N Bursts 142 within the time range T Frame and about the (L-2·S) frequencies would be completely random. In this respect, for example, Cconsecutive bursts 142 are combined into a so-called cluster 148, which are, for example, identical in terms of their time and frequency intervals relative to each other. A jump pattern 140 thus consists of N / C Cluster 148 with each C Bursts 142. C can advantageously be chosen so that it is an integer divisor of N So it is N / C N ⇔ ∃ k ∈ ℤ : k ⋅ N / C = N . Details will be Fig. 32 However, it should be mentioned here that a jump pattern structure consisting of N / C Clusters 148, which are completely identical in their internal structure, have certain disadvantages regarding their correlation properties (occurrence of strongly pronounced secondary maxima with an amplitude of N / C in the 2D autocorrelation function. All first bursts 142 in the N / CClusters have an identical repetition pattern with a different frequency (and possibly also a different time).

[0379] Accordingly, it happens that at the same time N / C Burst 142 interfere with each other. However, this disadvantage can be accepted in view of the simplifications it can achieve in the receiver. A cluster size of C=1 (and thus no cluster) is always most advantageous with regard to the correlation properties. (3) Due to telegram splitting, the time duration T Burst a burst 142 is relatively short in relation to the transmission time T Frame of the entire frame 120. If you leave a certain minimum time after sending the first burst 142 T A _ min This can have certain advantages regarding the power consumption of the battery-operated sensor nodes (battery recovery time after a comparatively energy-intensive transmission process). This minimum distance T A_ min should be adhered to as a design specification, if possible, within the clusters and between the clusters.

[0380] The above points 1) to 3) can be used as a starting point for the design of jump patterns for single (= once or not repeatedly) sent data (user data).

[0381] To further increase the probability of failure in data transmission, time and frequency diversity in the form of nested repetitions can now optionally be used when sending user data. In this case, the bursts (=hops or sub-data packets) 142 of the two hop patterns to be repeated can be frame-by-frame, as in Fig. 31b As indicated, they are interwoven in time. To keep the transmission time required for both repetitions as short as possible, an alternating interleaving is recommended, where the bursts of the first and second transmissions alternate.

[0382] The next sections will describe further requirements for the newly designed jump patterns. The new jump patterns for repeatedly transmitted data can optionally match the jump patterns for singly transmitted data, i.e., have the lowest possible cross-correlation.

[0383] (4) Selection of the frequency hopping pattern. The TSMA hopping patterns should be a) robust against external interference from other systems (here, neither the bandwidth nor the duration of the interference is known), as well as b) against interference from the own system. Optionally, c) it can be made as easy as possible for the receiver to distinguish between transmissions with and without repetition, especially when using maximum ratio combining. Aspects a) and c) are independent of the design process and can be specified in advance. Improved or even maximum immunity to external interference can be achieved, for example, by transmitting the two frames to be repeated in two different frequency bands (with their respective L frequency channels). The greater the frequency spacing (see Fig. 31b ), the lower the probability that an external interferer can interfere with both frames simultaneously. In detail, Fig. 31b A diagram showing the occupancy of two frequency channels 150_1 and 150_2 during the repeated transmission of data using a first hop pattern 140_1 and a second hop pattern 140_2. The ordinate represents the frequency and the abscissa represents time. In other words, Fig. 31b shows an interleaved frame transmission with repetition using two different frequency bands.

[0384] The receiver (data receiver) can, for example, differentiate between transmissions with and without repetition based on the hop pattern if different hop patterns are used for both transmission types. Without restricting generality, the hop patterns shown in Section 3.2 can be used for transmissions without repetition, and the hop patterns shown in Section 3.3 can be used for transmissions with repetition. In principle, a different (new) hop pattern can be used for the first transmission in repetition mode than for the second transmission. However, it has been shown that, with the appropriate measures described below, the use of a single hop pattern is sufficient for all transmissions in repetition mode. This measure also makes it easier for the receiver to jointly recognize the individual bursts with the same pattern in repetition mode.

[0385] How improved or even maximum robustness against interference from the own system can be achieved by using the same hop patterns for the first and second transmission in the case of repetition (point (4b)) is explained below. Since, according to one embodiment, different hop patterns are used for the individual transmission (e.g., the hop patterns from section 3.2) than for the first and second transmission in the case of repetition (e.g., the hop patterns from section 3.2), a full interference with the hop patterns in the case of repetition (the overlap of all N bursts of a frame). In a later example, the cross-correlations will be used to show that in the worst case, a maximum of Cbursts (of a cluster). If the hop patterns to be used for the repetition case also have (slightly) different time intervals between the bursts in the cluster, the average number of hits can be reduced even further. The following examines the interference immunity of transmitters that use the same hop pattern in repetition mode. If two transmitters with identical hop patterns were to transmit at the same time, T 0 (see Fig. 31b ) in the same frequency band, then without any countermeasures there would be a complete overlap of all 2N Bursts in both frames of the repeat mode. Such a situation can be almost completely prevented by parameter variation. For example, diversity can be achieved by introducing a variable, multi-stage time offset T W (see Figure 2), or the random starting of the first burst in one of the two frequency bands A or B. In addition, the TSMA pattern can be combined with a random positive or negative frequency offset (e.g. in multiples of the carrier spacing B C According to the specifications in [ETSI TS 103 357 V0.0.5 (2017-03), "ERM-Short Range Devices - Low Throughput Networks; Protocols for Interfaces A, B and C ", Chapter 7 "Telegram splitting ultra narrow band (TS-UNB) family, March 2017], the additional specification of eight different repetition hop patterns would result in a residual probability of 0.2% that, given the same random T 0 two jump patterns would completely cancel each other out. A random coincidence of the transmissions of two data transmitters at T 0 depends on the duty cycle and the burst duration and is usually also in the low per mille range.

[0386] The following describes limitations in the time domain behavior. The time constraints mentioned in point 2) are the division of the frame into N / C Clusters with C bursts each were introduced, with the individual bursts of the cluster always having the same time intervals to their neighboring bursts. And in point 3), a minimum time T A _ min between the bursts, which should not be undercut. In general, it can be said that the smaller the N Bursts available frequency band with its (L-2.S) possible provable frequencies, the more important is the pseudo-random principle of the time intervals t n ,(n+1) between the clusters. To what extent this random principle is due to the variable, multi-stage time offset required in point 4) T W (see Fig. 31b ) can be maintained for the repeated jump pattern needs to be clarified. The fact that the same jump pattern is used in the repetition case is definitely a positive aspect with regard to the pseudo-random principle.

[0387] Taking into account the limitations listed above, the Fig. 32 shown structure of a TSMA pattern 140.

[0388] In detail, Fig. 32 A diagram showing a schematic view of the structure of a TSMA jump pattern 140. The ordinate represents the frequency in frequency channels and the abscissa represents time. In other words, Fig. 9 shows a structure of the TSMA hopping pattern 140 with cluster arrangement and frequency allocation.

[0389] For better understanding, Fig. 9 the values ​​are supported with concrete figures where necessary and purely as examples: L = 44 , S = 4 , N = 24 , C = 3 . Respectively S=4Frequency bands are blocked for burst allocation due to the frequency deviation of the oscillator from its nominal frequency, leaving 36 frequency bands for the 24 bursts or the 8 clusters.

[0390] This results in the degrees of freedom described below regarding frequency channel allocation. Since the three bursts in the eight clusters can each have the same frequency spacing relative to each other, at least eight additional frequency bands can be reserved, leaving a maximum of 28 frequency bands for the base assignment of the three bursts. For example, any relative assignment can be made with three different frequency bands. The largest possible frequency deviation for neighboring bursts, as is the case with the base assignments (1, 28, 14) or (1, 24, 12), proves advantageous for later optimizations. The assignment of the individual clusters to one another can also be random.For example, with the basis assignments (1, 28, 14), the sequence of the numbers {1, 2, 3, 4, 5, 6, 7, 8} can be arbitrarily permuted (Matlab command: randperm(8)), and these 8 different values ​​can each be added to the basis assignment to obtain the frequency assignment of the bursts in the 8 clusters. With the basis assignments (1, 24, 12), a permutation of 12 starting values ​​is even possible (Matlab command: randperm(12)), and the first 8 values ​​can be added again to the corresponding basis assignment (1, 24, 12). If two groups of jump patterns are to be designed, for example, two groups of 8 jump patterns with and without repetition, it is recommended to use two basis arrangements with different frequency deviations. This prevents entire clusters from colliding between the groups.

[0391] This results in the degrees of freedom described below regarding the time intervals. Here, both the two time intervals between the three bursts of the clusters and the seven time intervals between the eight clusters must be determined. A certain minimum time T A _ min should not be undercut. An upper time limit T A _ max results from the specification of the frame duration T Frame . The determination of the random time intervals can also be done by rolling a dice (Matlab command: ΔT = T A_min + (T A_max -T A_min )·rand(7,1)). Here, too, it is recommended to use different burst time intervals in the clusters if a design of two different jump pattern groups is planned. The time intervals between the clusters can also be checked for the repetition jump patterns to what extent the shift is caused by the multi-stage time offset. T W does not lead to any burst overlaps and to what extent T A_min is maintained between all nested bursts. If this is not the case, the time scaling can be performed again. It should also be mentioned that with the above Matlab command, with the equation of T A _ max = T A _ min also equidistant time intervals ΔT can be achieved.

[0392] In the "Telegram Splitting Multiple Access (TSMA)" access method, the message is split into many small bursts 142 according to the hopping pattern 140, both in time and frequency directions. Due to the asynchronous transmission and the different frequency offsets of the individual sensor nodes 100, the bursts 142 are smeared both over time and across the available frequency spectrum. If all sensor nodes 100 have the same hopping pattern, then with increasing number of participants, bursts from different participants increasingly overlap in time (in the worst case, completely), thus interfering with each other. The more bursts 142 within a frame 120 are interfered with by bursts from other participants, the greater the probability that the receiver-side error correction will fail and transmission errors will occur.

[0393] Embodiments create a set of hop patterns that ideally minimize the packet error rate (Frame or Packet Error Rate, FER, PER) of the radio transmission system. This is done under the assumption that all radio users use the same set of hop patterns. While only a finite (albeit generally relatively large) number of permutations is possible with regard to the arrangement of the radio frequencies in a hop pattern by introducing discrete radio channels, the temporal arrangement of the bursts 142, due to a continuous time axis, leads to an extremely large number of permutation possibilities, i.e., hop patterns. This virtually eliminates a "full search" across all possible hop patterns.The method underlying the invention is therefore based on a Monte Carlo approach, which selects a set with the best properties in terms of an expected, minimal error rate from a very large number of (pseudo-)randomly generated jump patterns using suitable design criteria. The number of jump patterns in this set amounts to . P Auswahl .

[0394] To create suitable hop patterns 140, a metric is required that ideally has a strictly monotonic relationship with the expected packet error rate, so minimizing it ideally minimizes the packet error rate. In exemplary embodiments, the two-dimensional (2D) autocorrelated or cross-correlated metric of the hop pattern can be considered as a design criterion.

[0395] The 2D autocorrelated (AKF) Θ x,x the matrix X of the jump pattern 140, which covers the area over the multiples of TA sampled time period T Frame and the occupied frequency spectrum with the L frequency bands can be specified as follows: θ x , x f t = ∑ l = 0 L − 1 ∑ m = 0 M − 1 x l , m ⋅ x l + f , m + t where L the number of rows in the matrix X and M = T Frame / T A is the number of columns in the matrix X If the area in question is x(l,m) the matrix X a burst is located, then an entry is made at this point in X with x(l,m ) = 1, otherwise x(l,m) = 0 . The indexed elements of X , that lie outside the occupied area are also zero: x l m = 0 , l < 0 oder l ≥ L oder m < 0 oder m ≥ M

[0396] Since the oscillator frequency error per participant is by definition limited to a maximum deviation of S frequency channels, the frequency index extends f in the AKF of -2S until +2S. The time index t runs from - T Frame until T Frame , in steps of T Frame / T A . The AKF dimension of Θ x,x is thus (4S+1) x (2M+1).

[0397] In the time and frequency information matrix X If desired, the influence of adjacent channel interference can also be taken into account. This is important if the receive filters in the receiver 110 do not have a particular selectivity with regard to adjacent channel interference. For this purpose, a metric vector m Met = {Same channel, 1st adjacent channel, 2nd adjacent channel, ...} introduced in the matrix X inserts the corresponding information. For example, if you specify a metric with m Met = {1, 0.5, 0.1}, then in X at the place x(L,m), where we assume the presence of a burst, a 1 and at the two positions of the neighboring frequencies x(l-1,m) and x(l+1,m) there is a 0.5. Accordingly, further out at x(l-2,m) and x(l+2,m) the value 0.1for the 2nd adjacent channel. This indexing can be done at all positions where a burst is in X is located.

[0398] Fig. 33a and 33b show two AKF examples. In Fig. 33a occur in addition to the unavoidable main maximum t = f = 0 (Since the unshifted sequence is most similar to itself, the 2D-AKF for the sequence unshifted in both dimensions (time and frequency) has the highest value, in our case N Burst collisions) and the 2 or 4 possible secondary maxima with amplitudes of N / C due to clustering, only values ​​that are less than or equal to a threshold N Schwelle The lower this threshold, the fewer bursts are disturbed in a frame and the lower the probability of a transmission error. Fig. 33b In contrast, it shows a less favorable jump pattern, where the threshold is significantly exceeded at some points. This increases the probability of transmission errors.

[0399] The individual design steps are described in detail below.

[0400] In a first design step, P Optimal candidates of the jump patterns are generated whose AKF secondary maxima exceed a given minimum amplitude threshold N Schwelle ≥ C ( C is the cluster size). The generation of candidates for the jump patterns is carried out within a Monte Carlo simulation, in which jump patterns are generated with random time and frequency patterns (within the framework of the mentioned boundary conditions, see above). If the threshold N Schwelle > C applies, the number of values ​​exceeding the value C should be as small as possible.

[0401] For this purpose, the (4S+1) x (2M+1) Elements of the 2D autocorrelated Θ x,x in ascending order in a vector V Sort Since the total sum of all AKF elements is always approximately constant for all jump patterns and most AKF elements have values ​​of 0, 1 or C (complete cluster collision), only the values ​​greater than C are of interest, if any. In this respect, it is sufficient that only the last v AKF Elements of V Sort ,so V Sort (end- v AKF +1:end) As a criterion (predefined autocorrelation property) it can therefore be specified that the sum SUM AKF this v AKF Elements should preferably have a sum threshold of S Sum _ AKF _ Schwelle = (v AKF -1)·C+N If you do not find enough different jump patterns, then the value of S Sum _ AKF _ Schwelle be increased gradually by 1 until a sufficient number POptimal jump patterns are available, especially when using the metric vector m Met If adjacent channel interference is included in the calculation of the 2D-AKF, then the sum threshold S Sum _ AKF _ Schwelle increase significantly.

[0402] If different sets of jump patterns 140 are to be searched, the first design step can be repeated with a new set of parameters. For example, it may be desirable to generate several sets of jump patterns with different oscillator deviations and optimize them together. Different oscillator deviations result in different safety bands S, which changes the degree of freedom of the possible burst occupancy. Therefore, some parameters within the AKF calculation also change. Or a new jump pattern set should be generated that allows multiple repetitions using a multi-stage time offset. T W This is where the requirements for timing change. If a burst-by-burst alternating nesting of the jump patterns is planned, the shortest distance between two original bursts of a jump pattern can be determined and specified, which then corresponds to the time offsets T W The time offset T W should be significantly longer than the minimum time T A _ min be elected.

[0403] The first design step, finding P 1< Optimal candidates of a set of jump patterns is completely independent of finding P 2< Optimal candidates of another pattern set. In this respect, all parameter specifications for the patterns (clusters, frequency patterns, time intervals, etc.), as well as the design parameters ( N Schwelle , V Sort ,Number of rows and columns of the 2D AKF Θ x,x , etc.) can be changed at will. Only in the second design step, the calculation of the cross-correlations, are all designed candidates combined.

[0404] If a given number P Auswahl different jump patterns, then each individual jump pattern pair should be as orthogonal to each other as possible and the individual 2D cross-correlation matrices (2D-KKF) θ x , y f t = ∑ l = 0 L − 1 ∑ m = 0 M − 1 x l , m ⋅ y l + f , m + t of the two jump patterns with the matrices X and Y have the lowest possible maximum values, since high maximum values ​​in radio transmission potentially correspond to a large number of colliding bursts in a single frame. The time index of Θ x,y runs unchanged in steps of T Fframe / T A from - T Frrame until T Frame. . The KKF frequency index f generally extends from -(S x +S y ) until +(S x +S y ), since the two jump patterns considered may exhibit different deviations in their frequency error behavior (oscillator frequency deviations). Fig. 34a and 34b show again two 2D-KKF examples, a favorable case ( Fig. 34a ) and an unfavorable case ( Fig. 34b ).

[0405] In a second design step, based on the P Optimally preselected jump pattern candidates with their corresponding 2D autocorrelation sequences Θ x,x , all ( P Optimally -1) x ( P Optimal ) possible, usually different cross-correlation sequences Θ x,y For each 2D-CCF, the values ​​of Θ x,y sorted again in ascending order (analogous to the procedure for 2D-AKF), the sum of the last v KKF Elements calculated, also SUM KKF = sum( V Sort (end- v kKF +1:end)) and in a square ( P Optimal x P Optimal ) Matrix O vKKFbe saved.

[0406] In the first design step, the 2D autocorrelation sequences Θ x,x of different sets of jump patterns, the different candidate sets ( P 1< Optimal and P 2< Optimal ) are processed one after the other and a square matrix is ​​then created O vKKF the dimension (( P 1< Optimal + P 2< Optimal ) X ( P 1< Optimal + P 2< Optimal ) ), which includes all cross-correlation sequences Θ x,y all possible combinations.

[0407] In a third step, the P Auswahl different jump patterns 140, which have the most favorable 2D-KKF properties, since these correlate with a comparatively low maximum number of colliding bursts in a frame. For this purpose, the properties of (( P Auswahl -1)· P Auswahl ) / 2 different 2D-KKF based on the stored sums SUM KKF in the matrix O vKKF be evaluated. Those P Auswahl different jump patterns, the total sum of which is over the (( P Auswahl -1)· P Auswahl ) / 2 different subtotals SUM KKF out of O vKKF a minimum, results in the optimal P Auswahl Jump pattern. Since in the course of an extensive Monte Carlo simulation P Auswahl << P Optimally, according to the binomial coefficient "P Optimall above P Selection " various combination possibilities, a scope that can usually no longer be fully processed. In this respect, P Selection Jump patterns new and random from the P Optimal existing jump pattern can be selected Matlab commands: F=randperm(1: P Optimal ) and Pattern selection = F(1: P Selection )) and always the total sum GS from the various subtotals SUM KKFWith a sufficiently large sample size, a local minimum of the total sum results, which then determines the desired set of P Selection jump pattern provides.

[0408] In the first design step, the 2D autocorrelation sequences Θ x,x of different sets of jump patterns, a random, constantly permuted selection of P 1< Selection from the P 1< Optimal existing jump patterns of Theorem 1, as well as a random, constantly permuted selection of P 2< Selection from the P 2< Optimal existing jump patterns of sentence 2. About this jump pattern sentence [ P 1< Selection , P 2< Selection ] the total sum GS is always calculated from the various subtotals SUM KKF calculated and then the set with the local minimum is selected.

[0409] The complete design process, as well as the degrees of freedom in determining the jump patterns, is described in Fig. 35The possibility of optimizing multiple sets of jump patterns simultaneously is considered, but only hinted at.

[0410] In detail, Fig. 35 a flowchart of a method 260 for generating jump patterns, according to an embodiment.

[0411] In a first step 262, the method 260 is started.

[0412] In a second step 264, n is set equal to one, where n is a control variable.

[0413] In a third step 266, a hopping pattern can be randomly generated. The above-mentioned degrees of freedom regarding frequency channel occupancy, such as frequency channel assignment of the bursts with a base assignment of the bursts within the cluster and an assignment of the clusters to one another, can be taken into account. Furthermore, the above-mentioned degrees of freedom regarding time intervals, such as determining the time intervals within the cluster and between the clusters, can be taken into account.

[0414] In a fourth step 268, the autocorrelation function of the randomly generated jump pattern can be calculated. For example, a 2D ACF calculation Θ x,x (f,t) Furthermore, the 2D AKF values ​​can be stored in a vector v Sort Furthermore, a partial sum can be calculated over a given number of largest amplitude values ​​of the autocorrelation function, SUM AKF = sum( v Sort(end-v AKF +1:end)).

[0415] In a fifth step 270, it can be determined whether the randomly generated jump pattern has the specified autocorrelation properties. For example, it can be determined whether the AKF secondary maxima of the jump pattern exceed a specified minimum amplitude threshold. N threshold ≥ C ( C is the cluster size), in detail, it can be determined whether the sum SUM AKF this v AKF Elements (subtotal) the sum threshold of S Sum _ AKF _ threshold from for example (v AKF -1)·C+N does not exceed.

[0416] If the jump pattern does not exhibit the specified autocorrelation properties, the third step is repeated. If the jump pattern exhibits the specified autocorrelation properties, the procedure continues.

[0417] In a sixth step 272, the jump pattern (with the given autocorrelation properties) and the matrix X Furthermore, the index n can be increased by one, n = n+1.

[0418] In a seventh step 274, it can be checked whether an optimal number P Optimal from jump patterns are available.

[0419] If no optimal number P Optimal of jump patterns is available, then the third step 266 is repeated. If an optimal number P Optimal of jump patterns is available, then the procedure continues.

[0420] In an eighth step 276, it is determined whether a new set of jump patterns should be generated. If so, the second step 264 is repeated. If not, the method continues. Furthermore, it can be determined whether, optionally, another set of jump patterns should be generated for a different parameter set, such as a different oscillator offset or a different cluster appearance with different time intervals or frequency jumps.

[0421] In a ninth step 278, the cross-correlation functions between the jump patterns are calculated with given autocorrelation properties. For example, a 2D-KKF calculation Θ x,y (f,t) for all jump pattern sets, the 2D-KKF values ​​in a vector v Sort are sorted, the partial sums SUM KKF = sum( v Sort (end-v KKF +1:end)) and the partial sums SUM KKF in a matrix O vKKF be saved.

[0422] In a tenth step 280, n can be set equal to one and GS threshold can be set to a large threshold, such as 10 6<.

[0423] In an eleventh step 282 P 1< Selection Jump patterns new and random from the P 1< Optimal existing first jump patterns and P 2< Selection Jump patterns new and random from the P 2< Optimal existing second jump patterns are selected. P 1< Optimal different numbers are thrown out in random order, F 1< = randperm(1: P 1< Optimal ) and P 2< Optimal different numbers are thrown in random order, F 2< = randperm(1: P 2< Optimal ). Of these, the first P 1< Selection of which are selected, Pattern1 Selection = F(1: P 1< Selection ), and the first P 2< Selection of which are selected, Pattern2 Selection = F(1: P 2< Selection ). Pattern1 selection and Pattern2 selection The total sum GS can then be calculated from the individual subtotals SUM KKF that are in the matrix O vKKFstand, over P Selection = [ P 1< Selection ; P 2< Selection ] can be calculated.

[0424] In a twelfth step 282, it can be determined whether GS ≤ GS threshold. If GS ≤ GS threshold is not met, then n is incremented by one, n = n+1, and the eleventh step 282 is repeated. If GS ≤ GS threshold, then the threshold GS threshold is overwritten with GS and the method continues.

[0425] In a thirteenth step 286, the selected jump pattern can be saved.

[0426] In a fourteenth step 288, it can be determined whether n ≥ Abort. If n ≥ Abort is not met, then n is incremented by one, n = n+1, and the eleventh step 282 is repeated. If n ≥ Abort is met, then the method is terminated. 15.2 Generation of jump patterns for Low Delay TSMA

[0427] In Section 15.1, various groups of TSMA (hopping) patterns were designed that exhibited favorable 2D autocorrelation and 2D cross-correlation properties. Each pattern consisted of N Bursts with a time duration each T Burst . The N bursts were arranged almost randomly in time and frequency directions. To simplify the detection of the patterns for the receiver, C consecutive bursts were always grouped into a so-called cluster, which were identical relative to each other in terms of their time and frequency intervals. N / C N ⇔ ∃ k ∈ ℤ : k ⋅ N / C = N . The total duration of a hopping pattern was T-Frame which is significantly longer than the actual duration of the N Bursts with N·T Burst was, since there was always a random transmission pause between two adjacent bursts with a time interval of ΔT ( T A _ min≤ ΔT ≤ T A_max ) was inserted to allow the battery to recover. The minimum distance requirements T A _ min or the maximum distance T A_max applied both within the clusters and for the time intervals between the clusters.

[0428] Since the time interval ΔT between two bursts was significantly longer than the actual burst duration T Burst , nested repetitions were permitted in Section 15.1. In this case, the bursts of the two patterns to be repeated are temporally interwoven frame by frame. In order to minimize the transmission time required for both repetitions, T Frame + T Rep To keep the transmission frequency as low as possible, an alternating interleaving was recommended, where the bursts of first and second transmission alternated.

[0429] All previous patterns had in common that for the transmission of the N Bursts a period of T-Frame was needed.

[0430] However, there are now loT applications where a data packet can be transmitted in a significantly shorter time than with the previous frame duration. T-Frame is to be transmitted, the so-called Low Delay Mode. For this, a single new pattern (first jump pattern 160), the so-called Low Delay Pattern, must be designed. The cluster structure with the N / C Clustering should be retained, and any of the basic clusters can be used. Only the requirement that C consecutive bursts are always combined into a so-called cluster is abandoned.

[0431] The problem is solved by nesting as many clusters as possible. If the distance ΔT ≥ T A _ min not enough, all N / CTo nest clusters within a base cluster, a new base cluster is appended, where the remaining clusters are again nested. The new minimum time interval T A _ min _ LOW _ DELAY is therefore significantly smaller than T-Frame from (approximately T A _ min _ LOW _ DELAY = T-Frame / 4) .

[0432] By retaining the basic clusters, partially joint detection can be achieved for both modes, provided the same synchronization sequence is selected in the bursts and the same data rate is used. The receiver performs symbol recovery, burst correlation, and cluster correlation together. Only the telegram correlation needs to be performed separately due to the interleaving. This results in a significant saving in computing power for detection in both modes.

[0433] Fig. 36 shows a diagram of an exemplary occupancy of a transmission channel during the transmission of the first plurality of sub-data packets 162 according to the first hop pattern 160, distributed in frequency and time. In other words, Fig. 36 shows the embodiment of a nesting of such a low-delay pattern.

[0434] As in Fig. 36 As can be seen, the first hop pattern 162 can have a plurality of sub-hop patterns (clusters) 165 1 to 165 4 which are time- and / or frequency-shifted versions of one another, wherein the plurality of sub-hop patterns (clusters) 165 1 to 165 4 are interleaved such that sub-data packets 162 which are assigned to different sub-hop patterns (clusters) 165 1 to 165 4 are sent alternately.

[0435] For example, the sub-data packets 162 1 , 162 5 and 162 9 can be sent in a time and frequency distributed manner according to the first sub-hop pattern (cluster) 165 1 , wherein the sub-data packets 162 2 , 162 6 and 162 10 can be sent in a time and frequency distributed manner according to the second sub-hop pattern (cluster) 165 2 , wherein the sub-data packets 162 3 , 162 7 and 162 11 can be sent in a time and frequency distributed manner according to the third sub-hop pattern (cluster) 165 3 , and wherein the sub-data packets 162 4 , 162 8 and 162 12 can be sent in a time and frequency distributed manner according to the fourth sub-hop pattern (cluster) 165 4 .

[0436] In embodiments, the basic clusters can be nested within each other (on the data sender side).

[0437] In embodiments, the detection of the normal and low-delay modes can be carried out jointly on the data receiver side until cluster correlation. 15.3 Jump pattern for Low Delay TSMA

[0438] In the following, a concrete second jump pattern 160 (low delay jump pattern) is defined as an example, which can be used, for example, to transmit data of the first class (data with a higher priority and / or higher requirements for a maximum transmission time).

[0439] In embodiments, a time hopping pattern, a frequency hopping pattern, or a combination of a time hopping pattern and the frequency hopping pattern may be used for the individual transmission of data using a hopping pattern.

[0440] The frequency hopping pattern can be the one shown in the table of Fig. 37shown frequency hopping pattern with 24 hops, where in the table the row is the frequency hopping pattern, where in the table each column is a hop of the frequency hopping pattern, where in the table each cell indicates a transmission frequency of the respective hop of the frequency hopping pattern in carriers from UCG_C0 to UCG_C23.

[0441] In other words, Fig. 37 shows in a table a definition of a low-delay frequency hopping pattern (values ​​in carriers from UCG_C0 to UCG_C23) for a crystal tolerance (oscillator tolerance) of + / - 20 ppm.

[0442] The time jump pattern can be the one shown in the table of Fig. 38 shown time jump pattern with 24 jumps, where in the table the Fig. 38the row is the time jump pattern, wherein in the table each column is a jump of the time jump pattern starting from a second jump, so that each time jump pattern has 24 jumps, wherein in the table each cell indicates a time interval of a reference point of the respective jump to an identical reference point of an immediately following jump in - preferably multiples of - symbol durations.

[0443] In other words, Fig. 38 A table shows the definition of a low-delay time-hopping pattern (values ​​in multiples of symbol durations) for a crystal tolerance (oscillator tolerance) of + / - 20 ppm. Since the length of the 24 sub-data packets can vary, the time-hopping pattern is defined between the centers of the 24 sub-data packets.

[0444] When the jump pattern is combined from a time jump pattern and a frequency jump pattern, the respective time jump pattern and the respective frequency jump pattern can have the same row number in the respective table.

[0445] Although some aspects have been described in the context of a device, it should be understood that these aspects also represent a description of the corresponding method, so that a block or component of a device can also be understood as a corresponding method step or as a feature of a method step. Analogously, aspects described in the context of or as a method step also represent a description of a corresponding block, detail, or feature of a corresponding device. Some or all of the method steps may be performed by (or using) a hardware apparatus, such as a microprocessor, a programmable computer, or an electronic circuit. In some embodiments, some or more of the key method steps may be performed by such an apparatus.

[0446] A signal encoded according to the invention, such as an audio signal or a video signal or a transport stream signal, may be stored on a digital storage medium or may be transmitted on a transmission medium such as a wireless transmission medium or a wired transmission medium, e.g. the Internet

[0447] The encoded audio signal according to the invention may be stored on a digital storage medium, or may be transmitted on a transmission medium, such as a wireless transmission medium or a wired transmission medium, such as the Internet.

[0448] Depending on specific implementation requirements, embodiments of the invention may be implemented in hardware or software. The implementation may be performed using a digital storage medium, such as 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 other magnetic or optical storage device storing electronically readable control signals that can interact or cooperate with a programmable computer system to perform the respective method. Therefore, the digital storage medium may be computer-readable.

[0449] Some embodiments according to the invention thus comprise a data carrier having electronically readable control signals capable of interacting with a programmable computer system such that one of the methods described herein is carried out.

[0450] In general, embodiments of the present invention may be implemented as a computer program product having a program code, wherein the program code is effective to perform one of the methods when the computer program product is run on a computer.

[0451] The program code can, for example, also be stored on a machine-readable medium.

[0452] Other embodiments include the computer program for performing one of the methods described herein, wherein the computer program is stored on a machine-readable carrier.

[0453] In other words, an embodiment of the method according to the invention is thus a computer program which has a program code for carrying out one of the methods described herein when the computer program runs on a computer.

[0454] A further 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 performing one of the methods described herein is recorded. The data carrier, the digital storage medium, or the computer-readable medium is typically physical and / or non-perishable or non-transient.

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

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

[0457] A further embodiment comprises a computer on which the computer program for performing one of the methods described herein is installed.

[0458] A further embodiment according to the invention comprises a device or system designed to transmit a computer program for performing at least one of the methods described herein to a recipient. The transmission can be electronic or optical, for example. The recipient can be, for example, a computer, a mobile device, a storage device, or a similar device. The device or system can, for example, comprise a file server for transmitting the computer program to the recipient.

[0459] In some embodiments, a programmable logic device (e.g., a field-programmable gate array, an FPGA) may be used to perform some or all of the functionalities of the methods described herein. In some embodiments, a field-programmable gate array may interact with a microprocessor to perform any of the methods described herein. In general, in some embodiments, the methods are performed by any hardware device. This may be general-purpose hardware such as a computer processor (CPU) or method-specific hardware such as an ASIC.

[0460] The devices described herein may be implemented, for example, using a hardware apparatus, or using a computer, or using a combination of a hardware apparatus and a computer.

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

[0462] The methods described herein may be implemented, for example, using a hardware apparatus, or using a computer, or using a combination of a hardware apparatus and a computer.

[0463] The methods described herein, or any components of the methods described herein, may be implemented at least in part by hardware and / or by software.

[0464] The above-described embodiments are merely illustrative of the principles of the present invention. Therefore, it is intended that the invention be limited only by the scope of the following claims and not by the specific details presented in the description and explanation of the embodiments herein.

Claims

1. A data transmitter (100) configured to transmit data divided onto a plurality of sub-data packets, distributed in time and / or frequency according to a hopping pattern; wherein the hopping pattern is a combination of a time hopping pattern and a frequency hopping pattern; wherein the time hopping pattern is the time hopping pattern with 24 hops indicated in the following table: wherein the line in the table is the time hopping pattern, wherein each column in the table is a hop of the time hopping pattern starting from a second hop so that each time hopping pattern comprises 24 hops, wherein each cell in the table indicates a temporal interval of a reference point of the respective hop to a same reference point of an immediately subsequent hop in symbol durations or multiples of symbol durations; wherein the frequency hopping pattern is the frequency hopping pattern with 24 hops indicated in the following table: wherein the line in the table is the frequency hopping pattern, wherein each column in the table is a hop of the frequency hopping pattern, wherein each cell in the table indicates a transmission frequency of the respective hop of the frequency hopping pattern in carriers of UCG_C0 to UCG_C23.

2. A data receiver (110) configured to receive data transferred divided onto a plurality of sub-data packets, distributed in time and / or frequency according to a hopping pattern; wherein the hopping pattern is a combination of a time hopping pattern and a frequency hopping pattern; wherein the time hopping pattern is the time hopping pattern with 24 hops indicated in the following table: wherein the line in the table is the time hopping pattern, wherein each column in the table is a hop of the time hopping pattern starting from a second hop so that each time hopping pattern comprises 24 hops, wherein each cell in the table indicates a temporal interval of a reference point of the respective hop to a same reference point of an immediately subsequent hop in symbol durations or multiples of symbol durations; wherein the frequency hopping pattern is the frequency hopping pattern with 24 hops indicated in the following table: wherein the line in the table is the frequency hopping pattern, wherein each column in the table is a hop of the frequency hopping pattern, wherein each cell in the table indicates a transmission frequency of the respective hop of the frequency hopping pattern in carriers of UCG_C0 to UCG_C23.

3. A method of transmitting data, the method comprising: transmitting data using a hopping pattern; wherein the hopping pattern is a combination of a time hopping pattern and a frequency hopping pattern, wherein the time hopping pattern is the time hopping pattern with 24 hops indicated in the following table: wherein the line in the table is the time hopping pattern, wherein each column in the table is a hop of the time hopping pattern starting from a second hop so that each time hopping pattern comprises 24 hops, wherein each cell in the table indicates a temporal interval of a reference point of the respective hop to a same reference point of an immediately subsequent hop in symbol durations or multiples of symbol durations; wherein the frequency hopping pattern is the frequency hopping pattern with 24 hops indicated in the following table: wherein the line in the table is the frequency hopping pattern, wherein each column in the table is a hop of the frequency hopping pattern, wherein each cell in the table indicates a transmission frequency of the respective hop of the frequency hopping pattern in carriers of UCG_C0 to UCG_C23.

4. A method of receiving data, the method comprising: receiving data using a hopping pattern; wherein the hopping pattern is a combination of a time hopping pattern and a frequency hopping pattern, wherein the time hopping pattern is the time hopping pattern with 24 hops indicated in the following table: wherein the line in the table is the time hopping pattern, wherein each column in the table is a hop of the time hopping pattern starting from a second hop so that each time hopping pattern comprises 24 hops, wherein each cell in the table indicates a temporal interval of a reference point of the respective hop to a same reference point of an immediately subsequent hop in symbol durations or multiples of symbol durations; wherein the frequency hopping pattern is the frequency hopping pattern with 24 hops indicated in the following table: wherein the line in the table is the frequency hopping pattern, wherein each column in the table is a hop of the frequency hopping pattern, wherein each cell in the table indicates a transmission frequency of the respective hop of the frequency hopping pattern in carriers of UCG_C0 to UCG_C23.