Specific hopping patterns for repeated sending and receiving of data and

Process for producing the same

description

Exemplary embodiments relate to a data transmitter and a method for operating the same. Further exemplary embodiments relate to a data receiver and a method for operating the same. Further exemplary embodiments relate to the generation of specific jump patterns for a repeated transmission of data. Further exemplary embodiments relate to repeated transmission and reception of data using specific jump patterns. Some exemplary embodiments relate to an optimization process for generating hopping patterns for use in nested repetitions.

From DE 10 201 1 082 098 B4 the telegram splitting method (telegram splitting method) is known, according to which a telegram (or data packet) is divided into a plurality of sub-data packets which are used in time and optionally in frequency using a jump pattern distributed.

WO 2015/128385 A1 describes a data transmission arrangement which has an energy harvesting element as an energy source. The data transmission arrangement is designed to transmit data using the telegram splitting method, in which case a partial packet due to be transmitted is either transmitted, buffered and later transmitted, or discarded depending on an amount of electrical energy that can be provided by the energy supply device.

In the publication [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), 20 3] describes an improved range for low-energy telemetry systems that use the telegram splitting method.

In the publication [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] describes an improved transmission security for low-energy telemetry systems that use the Telegram splitting method.

The telegram splitting process uses certain time-frequency hopping patterns to transmit data over the radio channel. In order to successfully decode a data packet, it is necessary that the jump pattern that was used for sending is known at the receiver. To ensure this, global time and frequency hopping patterns are known for telegram spiitting networks, which are known to all participants.

When several participants communicate using telegram splitting in the same band, the interference immunity of the transmission is worse if the same time and / or frequency hopping pattern is used for data transmission from several nodes. If two nodes start a transmission with the same jump pattern within a short time window (e.g. the duration of a sub-data packet), all sub-data packets of the telegram overlap and, in the worst case, cancel each other out.

The present invention is therefore based on the object of creating a concept which increases the transmission security when a plurality of nodes use a time and / or frequency hopping pattern for the data transmission.

This problem is solved by the independent claims.

Advantageous further developments can be found in the dependent claims.

Embodiments provide a data transmitter configured to repeatedly transmit data in a first mode using a first hopping pattern and a second hopping pattern, the data transmitter configured to transmit data in a second mode once using a third hopping pattern, the hopping patterns the first mode and the second mode are different.

Further exemplary embodiments provide a data receiver which is designed to receive data repeatedly using a first jump pattern and a second jump pattern in a first mode, the data receiver being designed to receive data once using a third jump pattern in a second mode, the jump patterns of the first mode and the second mode are different.

In exemplary embodiments, data transmitters and data receivers use a first hopping pattern and a second hopping pattern in a first mode (= retransmission mode) for repeated transmission of data and a third hopping pattern in a second mode (= single transmission mode) for simple transmission of data, the hopping pattern of first mode and second mode are different. This can reduce the likelihood of a collision during the simultaneous transmission of data by another data transmitter in a different mode and thus increase the transmission security.

In exemplary embodiments, the data receiver can be designed to recognize a repeated transmission of data on the basis of the first branch pattern and / or the second branch pattern and to recognize a simple transmission of data on the basis of the third branch pattern.

In exemplary embodiments, the data receiver can be designed to detect one of the two hopping patterns (e.g. the first hopping pattern) in a received data stream in order to receive the data transmitted with the one hopping pattern, wherein the data receiver can be designed to detect the other hopping pattern (e.g. second Jump pattern) in the received data stream using the already detected jump pattern (eg first jump pattern) in order to receive the data transmitted with the other jump pattern (eg second jump pattern). The data transmitted with the first branch pattern and the data transmitted with the second branch pattern are the same due to the repetition.

In embodiments, the first jump pattern and the second jump pattern can be selected from a first set of jump patterns, while the third jump pattern can be selected from a second set of jump patterns. The first set of jump patterns and the second set of jump patterns can be different.

For example, the data transmitter or the data receiver for the transmission of data in the first mode can select the first branch pattern and the second branch pattern from the first class of branch patterns, while another data transmitter for the transmission of data in the second mode can select a branch pattern from the second class can choose from jump patterns. Since the first class of jump patterns and the second class of jump patterns are different, it can be ensured that the probability of a collision can be kept as low as possible even when data is transmitted simultaneously or at least overlapping by the data transmitter and the further data transmitter.

In exemplary embodiments, in order to set up a connection between the data transmitter and the data receiver, the first jump pattern and the second jump pattern, ie also the second jump pattern, can also be selected from a third set of jump patterns in the second mode. The third set of hopping patterns may be a subset of the first set of hopping patterns or the second set of hopping patterns, or different from them.

In exemplary embodiments, the first hopping pattern and the second hopping pattern can be shifted relative to one another in at least one of the frequency and the time, so that the first hopping pattern and the second hopping pattern are at least partially nested in one another.

For example, both the first jump pattern and the second jump pattern can have jumps which are distributed in time and / or frequency, so that the jumps of a jump pattern are spaced apart in time and / or frequency, the first jump pattern and the second jump pattern the time and / or frequency can be shifted relative to one another such that at least some of the jumps in the second jump pattern are arranged between at least some of the jumps in the first jump pattern. For example, the jumps of the first jump pattern and the jumps of the second jump pattern can be arranged alternately in time.

In exemplary embodiments, the first jump pattern and the second jump pattern can be different. For example, jumps of the first jump pattern and jumps of the second jump pattern can be distributed differently in time and / or frequency. For example, two successive jumps (eg first jump and second jump) of the first jump pattern can have a different time interval and / or frequency spacing than two successive jumps (eg first jump and second jump) of the second jump pattern.

In exemplary embodiments, the second hopping pattern can be a version of the first hopping pattern that is shifted in frequency and / or time. For example, the first hopping pattern and the second hopping pattern can be the same and only be shifted in time and / or frequency. For example, jumps of the first jump pattern and jumps of the second jump pattern can have the same relative time interval and frequency interval.

In exemplary embodiments, the data transmitter can be designed to transmit the first hopping pattern and the second hopping pattern in only partially overlapping or different frequency bands.

In exemplary embodiments, the data transmitter can be designed to transmit the first hopping pattern or the second hopping pattern randomly in one of at least two different frequency bands and to transmit the other hopping pattern in the other frequency band.

In exemplary embodiments, the data transmitter can be designed to determine a time offset and / or a frequency offset between the first hopping pattern and the second hopping pattern as a function of an operating parameter of the data transmitter. In this case, the data receiver may either know the operating parameters of the data transmitter, or the data receiver may be designed to determine, for example, estimate or calculate the operating parameters using a hypothesis test.

For example, the operating parameter of the data transmitter can be an intrinsic parameter of the data transmitter itself, such as addressing information, identification information, quartz tolerance, a frequency offset or an available transmission energy.

For example, the operating parameter of the data transmitter 100 can be a parameter assigned to the data transmitter 100, such as an assigned frequency offset, an assigned time offset, a radio cell, a geographic position, a system time or a priority of the data transmitter or of the data to be transmitted by the data transmitter.

For example, the operating parameter of the data transmitter 100 can be at least part of user data or error protection data.

For example, the operating parameter of data transmitter 00 can be a random frequency offset or a random time offset.

Further exemplary embodiments provide a method for sending data. The method includes a step of repeatedly sending data in a first mode using a first hopping pattern and a second hopping pattern. Furthermore, the method comprises a step of sending data once in a second mode

Using a third jump pattern, the jump patterns of the first mode and the second mode being different.

Further exemplary embodiments provide a method for receiving data, according to an exemplary embodiment. The method includes a step of receiving data in a first mode repeatedly using a first hopping pattern and a second hopping pattern. Furthermore, the method comprises a step of receiving data in a second mode once using a third jump pattern, the jump patterns of the first mode and the second mode being different.

Further exemplary embodiments provide a method for generating a first set of branch patterns and a second set of branch patterns. The method includes a step of randomly generating a plurality of hopping patterns for the first set of hopping patterns and a plurality of hopping patterns for the second set of hopping patterns, the hopping patterns having at least two hops distributed in frequency and time, the hops patterns for the first set of jump patterns and the jump patterns for the second set of jump patterns are different. The method further comprises a step of selecting the jump patterns from the plurality of jump patterns for the first set of jump patterns, the auto-correlation functions of which have predetermined auto-correlation properties,

In exemplary embodiments, a time interval between the jumps of the jump patterns for the second set of jump patterns can 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.

In exemplary embodiments, the time intervals between the jumps of the jump pattern can be equidistant within a predetermined jump pattern length with a deviation of ± 20%.

In exemplary embodiments, the method can include a step of mapping the plurality of jump patterns for the first set of jump patterns into a two-dimensional time and frequency occupancy matrix with calculation of the applied to it

Autocorrelation functions and the mapping of the plurality of jump patterns for the second set of jump patterns in a two-dimensional time and frequency occupancy matrix with applied calculation of the autocorrelation functions.

In the case of exemplary embodiments, the step of imaging the plurality of hopping patterns for the first set of hopping patterns and / or mapping the plurality of hopping patterns for the second set of hopping patterns can take place in each case taking into account any influences that may occur from adjacent frequency positions (adjacent channel interference).

In exemplary embodiments, the autocorrelation functions can be two-dimensional autocorrelation functions.

In exemplary embodiments, when selecting the jump patterns for the first set of jump patterns, those jump patterns whose autocorrelation function secondary maxima do not exceed a predetermined maximum first amplitude threshold value, and those jump patterns which meet the predetermined autocorrelation properties when selecting the jump patterns for the second set of jump patterns whose autocorrelation function secondary maxima do not exceed a predetermined maximum second amplitude threshold.

In embodiments, the first amplitude threshold can be equal to the second amplitude threshold.

In exemplary embodiments, the first amplitude threshold can be a number of jumps that form a repeating sub-jump pattern of the respective jump patterns for the first set of jump patterns that is shifted in time and / or frequency, and the second amplitude threshold value can be a number of jumps which form a repetitive sub-jump pattern of the respective jump pattern for the second set of jump patterns and shifted in time and / or frequency.

In exemplary embodiments, when selecting the jump patterns for the first set of jump patterns, those jump patterns can meet the predetermined autocorrelation properties, the partial sum of which, formed over a predetermined number of the greatest amplitude values ​​of the respective autocorrelation function, are smaller than a predetermined first welding value, and wherein when selecting the jump patterns for the second set of jump patterns, those jump patterns that meet the given autocorrelation properties whose

Partial sum formed over a predetermined number of largest amplitude values ​​of the respective autocorrelation function, which is less than a predetermined second threshold value.

In exemplary embodiments, the first threshold value can be selected such that at least two jump patterns for the first set of jump patterns meet the specified autocorrelation properties, and the second threshold value is selected such that at least two jump patterns for the second set of jump patterns meet the specified autocorrelation properties, or wherein the first threshold value and / or the second threshold value can be selected as a function of respective boundary parameters.

In exemplary embodiments, the method can further comprise a step of calculating cross-correlation functions between the jump patterns with predefined autocorrelation properties for the first set of jump patterns and cross-correlation functions between the jump patterns with predefined autocorrelation properties for the second set of jump patterns. Furthermore, the method can include a step of selecting the jump patterns from the jump patterns with predefined autocorrelation properties for the first set of jump patterns, the cross-correlation functions of which have predefined cross-correlation properties, in order to obtain jump patterns with predefined autocorrelation properties and predefined cross-correlation properties for the first set of jump patterns,

In exemplary embodiments, when calculating cross-correlation functions, cross-correlation functions between the branch patterns for the first set of branch patterns and the second branch patterns can also be calculated, wherein when selecting the branch patterns only those branch patterns for the first set of branch patterns and / or the second set of branch patterns are selected whose cross-correlation functions between the jump patterns for the first set of jump patterns and the second set of jump patterns also have predetermined cross-correlation properties.

In exemplary embodiments, the cross-correlation functions can be two-dimensional cross-correlation functions.

In exemplary embodiments, when selecting the hopping patterns from the hopping patterns with predetermined autocorrelation properties for the first set of hopping patterns, those hopping patterns can fulfill the predetermined cross-correlation properties, the partial sums of which are the smallest over a predetermined number of largest amplitude values ​​of the respective cross-correlation function, and when selecting the hopping patterns from the hopping patterns with predetermined autocorrelation properties for the second set of hopping patterns, those hopping patterns fulfill the predetermined cross-correlation properties, the partial sums of which are formed the smallest over a predetermined number of largest amplitude values ​​of the respective cross-correlation function.

In exemplary embodiments, when the plurality of hopping patterns for the first set of hopping patterns and the second set of hopping patterns are generated randomly, the hopping patterns can be generated such that the hops of the respective hopping patterns lie within a predetermined frequency band.

Further embodiments relate to sending data using a first jump pattern and a second jump pattern, the data being sent using the first jump pattern, and the data being sent repeatedly using the second jump pattern, the first jump pattern and the second jump pattern each is a time hopping pattern, a frequency hopping pattern or a combination of the time hopping pattern and the frequency hopping pattern, the time hopping pattern being one of the eight time hopping patterns with 24 hops each mentioned in the following table:

# from Sub-Dateriga icetef! in the core frame SC

where in the table each row is a time jump pattern, in the table each column is a jump of the respective time jump pattern starting from a second jump so that each time jump pattern has 24 jumps, in the table each cell a time interval of a reference point of the respective jump for a same reference point of an immediately following jump in - preferably multiples of - symbol duration; where the frequency hopping pattern is one of the eight frequency hopping patterns with 24 hops each mentioned in the following table:

where in the table each line is a frequency hopping pattern, in the table each column is a jump of the respective frequency hopping pattern, in the table each cell indicating a transmission frequency of the respective hopping of the respective frequency hopping pattern in carriers from UCG_C0 to UCG_23.

In exemplary embodiments, the hopping pattern can be a combination of the time hopping pattern and the frequency hopping pattern, the time hopping pattern and the frequency hopping pattern having the same line number in the respective table.

In exemplary embodiments, a data packet can be sent divided into a plurality of sub-data packets in accordance with the branch pattern, so that a sub-data packet of the plurality of sub-data packets is sent in each branch of the branch pattern.

Further embodiments relate to receiving data using a first time hopping pattern and a second time hopping pattern, the data being received using the first hopping pattern and the data being received repeatedly using the second hopping pattern, the first hopping pattern and the second hopping pattern each is a time hopping pattern, a frequency hopping pattern or a combination of the time hopping pattern and the frequency hopping pattern, the time hopping pattern being one of the eight time hopping patterns with 24 hops each mentioned in the following table:

# of sub-data packets in the core frame SC

No, 1 2 ■ rV, 3 v :; , 4 • ;; ': S 6 ••• 7 : :: 8: ' 9 7.1P. 11 ■■ xi. i3: 14 . 45 .16 ... 17 18. 19 ; 20 21 - 22 23

1 373 319 545 373 319 443 373 319 349 373 319 454 373 319 578 373 319 436 373 319 398 373 319

2 373 319 371 373 319 410 373 319 363 373 319 354 373 319 379 373 319 657 373 319 376 373 319

3 373 319 414 373 319 502 373 319 433 373 319 540 373 319 428 373 319 467 373 319 409 373 319

4 373 319 396 373 319 516 373 319 631 373 319 471 373 319 457 373 319 416 373 319 354 373 319

5 373 319 655 373 319 416 373 319 367 373 319 400 373 319 415 373 319 342 373 319 560 373 319

6 373 319 370 373 319 451 373 319 465 373 319 593 373 319 545 373 319 380 373 319 365 373 319

7 373 319 393 373 319 374 373 319 344 373 319 353 373 319 620 373 319 503 373 319 546 373 319

8 373 319 367 373 319 346 373 319 584 373 319 579 373 319 519 373 319 351 373 319 486 373 319

where in the table each row is a time jump pattern, in the table each column is a jump of the respective time jump pattern starting from a second jump, so that each time jump pattern has 24 jumps, with each cell in the table a time interval of a reference point of the respective jump indicates an identical reference point of a jump that follows immediately in - preferably multiples of - symbol durations;

where the frequency hopping pattern is one of the eight frequency hopping patterns with 24 hops each mentioned in the following table:

where in the table each line is a frequency hopping pattern, in the table each column is a jump of the respective frequency hopping pattern, in the table each cell indicating a transmission frequency of the respective hopping of the respective frequency hopping pattern in carriers from UCG_C0 to UCG_C23.

In exemplary embodiments, the hopping pattern can be a combination of the time hopping pattern and the frequency hopping pattern, the time hopping pattern and the frequency hopping pattern having the same line number in the respective table.

In exemplary embodiments, a data packet divided into a plurality of sub-data packets can be received in accordance with the branch pattern, so that a sub-data packet of the plurality of sub-data packets is received in each branch of the branch pattern.

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

a schematic block diagram of a system with a data transmitter and a data receiver, according to an embodiment of the present invention;

in a diagram an assignment of the transmission channel in the transmission of a plurality of sub-data packets according to a time and frequency hopping pattern;

a schematic block diagram of a system with a data transmitter and a data receiver, according to an embodiment of the present invention;

a flowchart of a method for sending data, according to an embodiment;

a flowchart of a method for receiving data, according to an embodiment;

a flowchart of a method for generating a set of jump patterns, according to an embodiment;

a flowchart of a method for generating two sets of jump patterns, according to an embodiment;

in a diagram a structure of a frame with a TSMA jump pattern;

in a diagram an occupancy of two frequency channels and the repeated transmission of data using a first hopping pattern and a second hopping pattern;

in a diagram a schematic view of a structure of a TS A jump pattern;

in a diagram, main and secondary maxima of an autocorrelation function of a jump pattern, which has predetermined autocorrelation properties, plotted against frequency and time;

10b shows a diagram of the main and secondary maxima of an autocorrelation function of a jump pattern which does not have predetermined autocorrelation properties, plotted against the frequency and the time;

11a shows a diagram of the main and secondary maxima of a cross-correlation function of two step patterns which have predetermined cross-correlation properties, plotted against frequency and time;

11b shows a diagram of the main and secondary maxima of a cross-correlation function of two step patterns which do not have predetermined cross-correlation properties, plotted against frequency and time; and

12 shows a flowchart of a method 260 for generating jump patterns, according to an exemplary embodiment.

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

1. Simple (non-repetitive) sending of data using one

hopping pattern

1 shows a schematic block diagram of a system with a data transmitter 100 and a data receiver 110, according to an exemplary embodiment of the present invention.

The data transmitter 100 is designed to send data 120 using a jump pattern.

The data receiver 110 is designed to receive data 120 from the data transmitter 100 using a jump pattern.

As indicated in FIG. 1, the hopping pattern 140 can have a plurality of hops 142, which are distributed in time and / or frequency.

In exemplary embodiments, the data transmitter 100 can be designed to send data 120 distributed in time and / or frequency in accordance with the jump pattern 140. Accordingly, the data receiver 110 can be configured to receive data 120

received, which are transmitted according to the hopping pattern 140 distributed in time and / or frequency.

As shown by way of example in FIG. 1, the data transmitter 100 can have a transmission device (or transmission module, or transmitter) 102 which is designed to transmit the data 120. The transmission device 102 can be connected to an antenna 104 of the data transmitter 100. The data transmitter 100 may further comprise a receiving device (or receiving module, or receiver) 106, which is designed to receive data. The receiving device 06 can be connected to the antenna 104 or a further (separate) antenna of the data transmitter 100. The data transmitter 100 can also have a combined transceiver.

The data receiver 1 10 can have a receiving device (or receiving module, or receiver) 116, which is designed to receive data 120. The receiving device 116 can be connected to an antenna 114 of the data receiver 110. Furthermore, the data receiver 110 can have a transmission device (or transmission module, or transmitter) 112 which is designed to transmit data. The transmitting device 1 12 can be connected to the antenna 114 or a further (separate) antenna of the data receiver 110. The data receiver 1 10 can also have a combined transceiver.

In embodiments, data transmitter 100 may be a sensor node, while data receiver 110 may be a base station. A communication system typically comprises at least one data receiver 110 (base station) and a large number of data transmitters (sensor nodes, such as, for example, 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.

The data transmitter 100 and the data receiver 110 can optionally be designed to send or receive data 120 using the telegram splitting method. In this case, a telegram or data packet 120 is divided into a plurality of sub-data packets (or sub-data packets, or sub-packets) 142 and the sub-data packets 142 are distributed in time and / or in frequency by the data transmitter 100 in accordance with the jump pattern 140 transmitted to the data receiver 110, wherein the data receiver 110 again the sub-data packets

merges (or combines) to obtain data packet 120. Each of the sub-data packets 142 contains only a part of the data packet 120. The data packet 120 can also be channel-coded, so that not all sub-data packets 142 but only a part of the sub-data packets 142 are required for error-free decoding of the data packet 120.

As already mentioned, the temporal distribution of the plurality of sub-data packets 142 can take place in accordance with a time and / or frequency hopping pattern.

A time jump pattern can specify a sequence of transmission times or transmission intervals with which the sub-data packets are sent. For example, a first sub-data packet can be transmitted 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), the first transmission time and the second transmission time being different. The time jump pattern can define (or specify or specify) the first transmission time and the second transmission time. Alternatively, the time jump pattern can indicate the first transmission time and a time interval between the first transmission time and the second transmission time. Of course, the time jump pattern can also only indicate the time interval between the first time and the second time of transmission. There may be pauses in transmission between the sub-data packets in which there is no transmission. The sub-data packets can also overlap in time (overlap).

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 with a first transmission frequency (or in a first frequency channel) and a second sub-data packet with a second transmission frequency (or in a second frequency channel) can be transmitted, the first transmission frequency and the second transmission frequency being different. The frequency hopping pattern can define (or specify or specify) the first transmission frequency and the second transmission frequency. Alternatively, the frequency hopping pattern can indicate the first transmission frequency and a frequency spacing (transmission frequency hopping) between the first transmission frequency and the second transmission frequency.

Of course, the plurality of sub-data packets 142 can also be distributed from the data transmitter 100 to the data receiver 110 in both time and frequency

become. The distribution of the plurality of sub-data packets in time and in frequency can take place according to a time and frequency hopping pattern. A time and frequency hopping pattern can be the combination of a time hopping pattern and a frequency hopping pattern, ie a sequence of transmission times or transmission time intervals with which the sub-data packets are transmitted, transmission frequencies (or transmission frequency jumps) being assigned to the transmission times (or transmission time intervals).

2 shows in a diagram an assignment of the transmission channel during the transmission of a plurality of sub-data packets 142 according to a time and frequency hopping pattern. The ordinate describes the frequency and the abscissa the time.

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

As can also be seen in FIG. 2, a synchronization sequence 144 can also be divided between the plurality of sub-data packets 142, so that the plurality of sub-data packets 142 in addition to data (data symbols in FIG. 2) 146 each form part of the synchronization sequence (Synchronization symbols in Fig. 2) 144 included.

2. Repeated transmission of data using two hopping patterns

The data transmitter 100 described above and shown, for example, in FIG. 1 can be extended by a retransmission mode, in which the data transmitter 100 transmits the data 120 using a first jump pattern and repeatedly (ie again) using a second jump pattern. The data transmitter 100 can be operated both in the repeat transmission mode and in a single transmission mode, ie as described above. Of course, the data transmitter 100 can also be operated in both modes.

Likewise, the data receiver 110 described above and shown, for example, in FIG. 1 can be extended by a retransmission mode, in which the data receiver 110 receives the data 120 using a first jump pattern and repeatedly (ie again) using a second jump pattern. The data receiver 110 can both in the retransmission mode and in

a single transmission mode, that is, as described above. Of course, the data receiver 110 can also be operated in both modes.

The following description primarily deals with the retransmission mode, reference being made to the above description for the single transmission mode. It should also be noted that the aspects of the single transmission mode described above are also applicable to the retransmission mode.

3 shows a schematic block diagram of a system with a data transmitter 100 and a data receiver 110, according to an exemplary embodiment of the present invention.

The data transmitter 100 is designed to repeatedly transmit data 120 in a first mode (= retransmission mode) using a first jump pattern 140_1 and a second jump pattern 140_2. Furthermore, the data transmitter 100 is designed to transmit data 120 in a second mode (= single transmission mode) simply (ie once or not repeatedly) using a third jump pattern 142 (see FIG. 1), the jump patterns of the first mode and the second mode are different.

The data receiver 110 is designed to receive data 120 in a first mode repeatedly using a first jump pattern 140_1 and a second jump pattern 140_2. Furthermore, the data receiver 110 is designed to receive data 120 in a second mode simply (ie once or not repeatedly) using a third jump pattern 142 (see FIG. 1), the jump patterns of the first mode and the second mode being different are.

For example, the data receiver 110 can be designed to recognize a repeated transmission of data based on the first branch pattern 140_1 and / or the second branch pattern 140_2, and to recognize a simple transmission of data based on the third branch pattern.

In exemplary embodiments, the data receiver can be designed to detect one of the two hopping patterns (e.g. the first hopping pattern) in a received data stream in order to receive the data transmitted with the one hopping pattern, wherein the data receiver can be designed to detect the other hopping pattern (e.g. second Jump pattern) in the received data stream using the one already detected

To determine the jump pattern (eg first jump pattern) in order to receive the data transmitted with the other jump pattern (eg second jump pattern).

For example, this has the advantage for the data receiver that the detection and synchronization (eg time and frequency estimation) only has to be carried out once, or that it is sufficient to detect one of the two hopping patterns. The detection can, for example, be designed in such a way that it detects almost all jump patterns (eg telegrams) up to a given Es / NO (eg approx. -3dB). Therefore, at lower Es / NO it cannot be guaranteed that the detection will work on both emissions. Due to the time and frequency coherence between the two transmissions (first jump pattern and second jump pattern), it is sufficient to detect only one of the two transmissions.

For example, the data receiver 110 can search for the jump patterns 140_1 and 140_2, and should find at least one of the two jump patterns 140_1 and 140_2. The data receiver 110 can then decode this hopping pattern and determine whether it is error-free. If it is not error-free, the data receiver 110 can search for the other hopping pattern, the data receiver 110 not knowing whether the previously found hopping pattern was the first or second transmission (the first hopping pattern 140_1 or the second hopping pattern 140_2). Since this was more difficult to find, individual decoding should not help here. In this respect, MRC (MRC = maximum ratio combining). The data receiver 110 can calculate the LLRs of the data from the two transmissions and add them up (weighting according to the individual C / Is), in order then to go through the decoder. Achieve here in comparison to the individual broadcast.

The first jump pattern 140_1 and the second jump pattern 140_2 can be selected from a first set of jump patterns, while the third jump pattern can be selected from a second set of jump patterns. The first set of jump patterns and the second set of jump patterns can be different.

For example, for the transmission of data in the first mode, the data transmitter 100 (or the data receiver 110) can select the first jump pattern 142_1 and the second jump pattern 142_2 from the first class of jump patterns (e.g. from the eight jump patterns listed in section 3.3) while on further data transmitter for the transmission of data in the second mode can select a jump pattern from the second class of jump patterns (for example from the eight jump patterns listed in section 3.2). Because the first class of jump patterns and the second class of jump patterns

differ, it can be ensured that even in the case of a simultaneous or at least temporally overlapping transmission of data by the data transmitter and the further data transmitter, a collision probability can be kept as low as possible.

To establish a connection between the data transmitter and the data receiver, the first jump pattern 140_1 and the second jump pattern 140_2 can be selected from a third set of jump patterns both in the first mode and also in the second mode. The third set of hopping patterns may be a subset of the first set of hopping patterns or the second set of hopping patterns, or different from them.

The first hopping pattern 140_1 and the second hopping pattern 140_2 can be shifted from one another in at least one of the frequency and the time, so that the first hopping pattern 142_0 and the second hopping pattern 1 2_0 are at least partially nested in one another.

For example, both the first jump pattern 140_1 and the second jump pattern 140_2 can have jumps 142 which are distributed in time and / or frequency, so that the jumps 142 of a jump pattern are spaced apart in time and / or frequency, the first jump pattern 140_1 and the second jump pattern 140_2 can be shifted in time and / or frequency relative to one another such that at least a part of the jumps 142 of the second jump pattern 140_2 are arranged between at least a part of the jumps 142 of the first jump pattern 140_1. For example, the jumps 142 of the first jump pattern 140_1 and the jumps 142 of the second jump pattern 140_1 can be arranged alternately in time.

The first jump pattern 140_1 and the second jump pattern 140_2 can be different. For example, jumps 142 of the first jump pattern 140_1 and jumps 142 of the second jump pattern 140_2 can be distributed differently in time and / or frequency. For example, two successive jumps (eg first jump and second jump) of the first jump pattern 140_1 can have a different time interval and / or frequency spacing than two successive jumps (eg first jump and second jump) of the second jump pattern 40_2.

The second hopping pattern 140_2 can be a version of the first hopping pattern 140_1 shifted in frequency and / or time. For example, the first hopping pattern 140_1 and the second hopping pattern 140_2 can be the same and only be shifted in time and / or frequency. For example, jumps 142 of the first jump pattern 140_1 and jumps 142 of the second jump pattern 140_2 can have the same relative time interval and frequency interval.

The data transmitter 100 can be designed to transmit the first hopping pattern 140_1 and the second hopping pattern 140_2 in only partially overlapping or different frequency bands.

Furthermore, the data transmitter 100 can be designed to randomly transmit the first hopping pattern 140_1 or the second hopping pattern 140_2 in one of at least two different frequency bands and to transmit the other hopping pattern in the other frequency band.

The data transmitter 100 can be designed to determine a time offset and / or a frequency offset between the first jump pattern 40_1 and the second jump pattern 140_2 as a function of an operating parameter of the data transmitter 100. In this case, the data receiver 110 may either know the operating parameters of the data transmitter 100, or the data receiver 110 may be designed to determine, for example, estimate or calculate the operating parameters using a hypothesis test. Furthermore, the data receiver 110 can be designed to try out all possible time offsets until the correct time offset is found. Furthermore, the data receiver 110 can be designed to try out all possible frequency offsets until the correct frequency offset is found.

For example, the operating parameter of the data transmitter 100 can be an intrinsic parameter of the data transmitter itself, such as, for example, addressing information, identification information, quartz tolerance, a frequency offset or an available transmission energy.

For example, the operating parameter of the data transmitter 100 can be a parameter assigned to the data transmitter 100, such as an assigned frequency offset, an assigned time offset, a radio cell, a geographic position, a system time or a priority of the data transmitter or the data.

For example, the operating parameter of the data transmitter 100 can be at least part of user data or error protection data.

For example, the operating parameter of the data transmitter 00 can be a random frequency offset or a random time offset.

FIG. 4 shows a flowchart of a method 160 for sending data, according to an exemplary embodiment. The method 160 includes a step 162 of sending data in a first mode repeatedly using a first hopping pattern and a second hopping pattern. The method 160 further includes a step 164 of sending data in a second mode once using a third hopping pattern, the hopping patterns of the first mode and the second mode being different.

5 shows a flow diagram of a method 170 for receiving data, according to an exemplary embodiment. The method 170 includes a step 172 of receiving data in a first mode repeatedly using a first hopping pattern and a second hopping pattern. The method 170 further includes a step 174 of receiving data in a second mode once using a third hopping pattern, the hopping patterns of the first mode and the second mode being different.

3. Generation of jump patterns

Exemplary embodiments of a method for generating jump patterns are described in more detail below. In detail, FIG. 6 shows a method for generating jump patterns for simple (ie once) transfer of data using a jump pattern, while FIG. 7 shows a method for generating jump patterns for repeated transfer of data using two jump patterns.

6 shows a flow diagram of a method 200 for generating a set of jump patterns, according to an exemplary embodiment. The method 200 comprises a step 202 of randomly generating a plurality of hopping patterns, the hopping patterns having at least two hops that are distributed in frequency and time. The method 200 further comprises a step 204 of selecting the jump patterns from the plurality of jump patterns, the autocorrelation functions of which have predefined autocorrelation properties, in order to obtain jump patterns with predefined autocorrelation properties.

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

In the case of exemplary embodiments, those step patterns can fulfill the predetermined autocorrelation properties, the partial sum of which, formed over a predetermined number of largest amplitude values ​​of the respective autocorrelation function, is smaller than a predetermined threshold value. The threshold value can be selected so that at least two hopping patterns (or a predetermined number of hopping patterns) meet the predetermined autocorrelation properties.

As can be seen in FIG. 6, the method 200 can further comprise a step 206 of calculating cross-correlation functions between the jump patterns with predetermined autocorrelation properties. Furthermore, the method 200 can include a step 208 of selecting the jump patterns from the jump patterns with predetermined autocorrelation properties, the cross-correlation functions of which have predetermined cross-correlation properties, in order to obtain jump patterns with predetermined autocorrelation properties and predetermined cross-correlation properties.

In the case of exemplary embodiments, those step patterns which fulfill the predefined cross-correlation properties, the partial sums of which are formed the smallest over a predefined number of largest amplitude values ​​of the respective cross-correlation function.

FIG. 7 shows a flow diagram of a method 210 for generating a first set of jump patterns and a second set of jump patterns. The method 210 includes a step 212 of randomly generating a plurality of hopping patterns for the first set of hopping patterns and a plurality of hopping patterns for the second set of hopping patterns, the hopping patterns having at least two hops that are distributed in frequency and time, wherein the jump patterns for the first set of jump patterns and the jump patterns for the second set of jump patterns are different. The method 210 further comprises a step 214 of selecting the jump patterns from the plurality of jump patterns for the first set of jump patterns, the auto-correlation functions of which have predetermined auto-correlation properties,

In exemplary embodiments, a time interval between the jumps of the jump patterns for the second set of jump patterns can 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.

For example, in order to be able 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 the clusters and between the clusters). Since this regularity is of course not optimal for the design process, a slight jitter can be inserted.

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

In the case of exemplary embodiments, those step patterns can fulfill the predetermined autocorrelation properties, the partial sum of which, formed over a predetermined number of largest amplitude values ​​of the respective autocorrelation function, is smaller than a predetermined threshold value. The threshold value can be selected so that at least two hopping patterns (or a predetermined number of hopping patterns) meet the predetermined autocorrelation properties.

As can be seen in FIG. 7, the method 210 can 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 of cross-correlation functions between the jump patterns with predetermined autocorrelation properties for the second set of jump patterns. Furthermore, the method can include a step 218 of selecting the jump patterns from the jump patterns with predetermined autocorrelation properties for the first set of jump patterns, the cross-correlation functions of which are predetermined

Have cross-correlation properties to jump patterns with given

Obtain autocorrelation properties and predetermined cross-correlation properties for the first set of branch patterns, and the branch pattern from the branch patterns with predetermined autocorrelation properties for the second set of branch patterns, whose cross-correlation functions have predetermined cross-correlation properties, in order to obtain branch patterns with predetermined autocorrelation properties and predetermined cross-correlation properties for the second set of branch patterns receive.

In the case of exemplary embodiments, those step patterns which fulfill the predefined cross-correlation properties, the partial sums of which are formed the smallest over a predefined number of largest amplitude values ​​of the respective cross-correlation function.

3.1 Generation of jump patterns for TSMA

Jump patterns that are generated with the method shown in FIG. 6 or FIG. 7 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 come.

In TSMA, the transmission of a message is divided into a large number of short bursts (= jumps or sub-data packets) 142, between which there are transmission-free time intervals of different lengths. The bursts 142 can be distributed according to a real or a pseudo-random principle both over time and over the available frequencies.

This approach of Telegram splitting provides a particularly high level of robustness against disturbances from other sensor nodes, regardless of whether they come from your own system or from other systems. The robustness in terms of interference with the own sensor nodes is achieved in particular by distributing the various user signal bursts as evenly as possible over both the time and the frequency range.

This random distribution can be achieved by various measures, such as (1) the inevitable tolerance deviations of the crystal reference oscillator with regard to the frequency, (2) the random asynchronous channel access results in any granularity in the time domain, and (3) the different burst arrangement of the different sensor nodes for different jump patterns.

To achieve a further increase in the probability of failure in data transmission, time and frequency diversity can now be used when sending user data. The sub-data packets (bursts) can be transmitted at least twice at different times in, for example, different hopping patterns and in, for example, different frequency bands. Since only one transmitter is available in the sensor node for the transmission of the signal, there are certain restrictions for the nested repetition with regard to the temporal burst arrangement in the branch pattern. The way in which the first and second transmissions are interleaved in the event of repetition will be explained in more detail later.

The diversely redundant signals can be combined at the receiving end, for example, in all possible forms, such as maximum ratio combining (MRC), equal-gain combining, scanning / switching combining or selection combining. When designing such diversely redundant jump patterns, it is also important to note that the combiner recognizes as simply as possible that a repeat and not a first broadcast was sent.

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

In the TSMA transmission method, the individual bursts of a data packet 120 (also referred to below as a frame), as shown in FIG. 8a, are distributed both over time and over the frequencies.

8a shows in detail in a diagram a structure of a frame 120 with a TSMA step pattern 140. The ordinate describes the frequency or channels (frequency channels) and the abscissa the time.

The start time To of a frame 120 with the total duration Tpra e is randomly selected by the sensor node 100 due to the asynchronous transmission. The time duration expensive of a burst 142 can vary, is assumed to be constant in the following without restricting its general validity, whereas the time intervals t n , (n + D, which in each case are the distance between two neighboring burst centers (here the two bursts with the indices n and n + 1), each is a random variable, all within a definable range T A _min s tn, 3 kel: k N / C = N. Details are shown in Fig. 9 A jump pattern 140 thus consists of N / C clusters 148 with C bursts 142 in each case. C can advantageously be selected such that it is an integer divisor of N. So N / C | applies N <=> 3 kel: k N / C = N. Details are shown in Fig. 9 A jump pattern 140 thus consists of N / C clusters 148 with C bursts 142 in each case. C can advantageously be selected such that it is an integer divisor of N. So N / C | applies N <=> 3 kel: k N / C = N. Details are shown in Fig. 9

discussed. However, it should already 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 with regard to their correlation properties (occurrence of strongly pronounced secondary maxima, each with an amplitude of N / C In the 2D autocorrelation function, all first bursts 142 in the N / C clusters have an offset (and possibly also a time offset) identical repetition pattern, which means that N / C burst 142 can interfere with each other at the same time the simplifications that can be achieved in this way are accepted in the receiver. A cluster size of C = 1 (and thus no cluster) is always the most advantageous with regard to the correlation properties. (3) Because of the telegram splitting, the time period TThe burst of a burst 142 is relatively short in relation to the transmission time TFrame of the entire frame 120. If a certain minimum time ΓΛ “ ™” elapses after the transmission of the first burst 142 , this can have certain advantages with regard to the power consumption of the battery-operated sensor nodes (recovery time of the Battery after comparatively energy-intensive transmission process). As a design specification, this minimum distance T _mm should also be maintained within the clusters and between the clusters.

The above-mentioned points 1) to 3) can be used as a starting point for the design of jump patterns for data (user data) sent out simply (= once or not repeatedly).

In order to further increase the probability of failure in data transmission, the use of time and frequency diversity in the form of nested repetitions can now optionally occur when sending the user data. In this case, the bursts (= jumps or sub-data packets) 142 of the two jump patterns to be repeated can, for example, be interwoven in terms of time, as indicated in FIG. 8b. In order to keep the transmission time required for both repetitions as short as possible, alternating nesting is recommended, where the bursts alternate between first and second transmission.

The next points describe which other requirements still exist for the new jump patterns to be designed. The new hopping patterns for repeatedly transmitted data can optionally match the hopping patterns for simply transmitted data, ie have the lowest possible cross-correlation.

(4) Selection of the frequency hopping pattern. The TSMA hopping patterns should be a) robust against external disturbances from other systems (neither the bandwidth nor the duration of the disturbance is known here), as well as b) against disturbances from our own

System. Optionally, c) it can be made as easy as possible for the recipient to distinguish between programs with and without repetition, especially when using maximum ratio combining. Aspects a) and c) are independent of the design process and can be determined in advance. Improved or even maximum immunity to external interference can be achieved, for example, by placing the two frames to be repeated in two different frequency bands (with their L frequency channels in each case). The greater the frequency spacing (see FIG. 8b), the lower the probability that an external interferer can disturb both frames at the same time. Fig. 8b in a diagram an occupancy of two frequency channels 150_1 and 150_2 during the repeated transmission of data by means of a first hopping pattern 140_1 and a second hopping pattern 140_2. The ordinate describes the frequency and the abscissa the time. In other words, Fig. 8b shows an interleaved frame transmission with repetition when using two different frequency bands.

The receiver (data receiver) can, for example, use the jump pattern to distinguish between transmissions with and without repetition if different jump patterns are used for both transmission types. Without restricting the generality, the hopping patterns shown in section 3.2 can be used for transmissions without repetition, for example, and the hopping patterns shown in section 3.3 can be used for transmissions with repetition. In principle, a different (new) hopping pattern can be used for the first transmission in the repeat mode as for the second transmission. However, it has been shown that with corresponding measures described below, the use of a single hopping pattern is sufficient for all transmissions in the repeat mode.

The following explains how to use the same hopping patterns for first and second transmission in the event of repetition to achieve improved or even maximum robustness against interference from your own system (point (4b)). Since according to an example of execution! use different hopping patterns for the individual transmission (e.g. the hopping patterns from section 3.2) than for the first and second transmission in the event of repetition (e.g. the hopping patterns from section 3.2) is a complete interference with the hopping patterns in the event of repetition (the overlap of all N bursts of a frame) is not possible. In a later example, the cross-correlated shows that in the worst case, a maximum of C bursts (of a cluster) can meet. If the jump patterns to be used for the repetition case also have (somewhat) different time intervals between the bursts in the cluster, the average number of hits can be reduced again. The immunity to interference of transmitters that use the same hopping pattern in repeat mode is considered below. Would two transmitters with identical hopping patterns at the same time T0(see Fig. 8b) start in the same frequency band, then there would be a complete overlay of all 2N bursts in both frames of the repeat mode without any countermeasures. Such a situation can be almost completely prevented by parameter variation. For example, a variety can be achieved by introducing a variable, multi-level time offset TW (see Figure 2), or by randomly starting the first burst in one of the two frequency bands A or B. In addition, a random positive or negative frequency offset (for example in multiples of the carrier spacing Sc) can be applied to the TS A pattern. According to the specifications in [ETSI TS 103 357 VO.0.5 (2017-03), "ERM-Short Range Devices - Low Throughput Networks; Protocois for Interfaces A, B and C", Chapter 7 " Telegram Splitting ultra narrow band (TS-UNB) family, March 2017], if eight different repeat jump patterns were additionally specified, there would be a residual probability of 0.2% that two accidentally identical jump patterns would be completely canceled. A coincidence of the transmissions of two data transmitters at To depends on the duty cycle and the burst duration and is usually also in the low alcohol range.

Restrictions in time domain behavior are described below. Under point 2), the subdivision of the frame into N / C clusters with C bursts each was introduced as time restrictions, the individual bursts of the clusters always having the same time intervals from their neighboring bursts. And in point 3) due to the electricity economy, a minimum time ΤΑ_ΠΜ Π between the bursts was introduced, which should not be undercut. In general, it can be stated that the smaller the frequency band available for the N bursts with its (L-2-S) possible assignable frequencies, the more important the pseudo-random principle of the time intervals t n, ^ between the clusters. The extent to which this random principle can be maintained for the repetitive jump patterns due to the variable, multi-stage time offset TW required in point 4) has to be clarified. The fact that the same jump pattern is used in the event of a repetition is definitely positive in terms of the pseudo-random principle.

Taking into account the restrictions listed above, the structure of a TSMA pattern 142 shown in FIG. 9 results.

9 shows in a diagram a schematic view of a structure of a TSMA hopping pattern 142. The ordinate describes the frequency in frequency channels and the abscissa the time. In other words, FIG. 9 shows a structure of the TSMA hopping pattern 142 with cluster arrangement and frequency assignment.

For better comprehensibility, the values ​​in FIG. 9 are to the extent necessary and are given examples with concrete numbers: L = 44, S = 4, N = 24, C - 3. S = 4 frequency bands are due to the frequency deviation of the oscillator from its nominal frequency blocked for the burst assignment, which still leaves 36 frequency bands for the 24 bursts or the 8 clusters.

The degrees of freedom described below with regard to the frequency channel assignment result. Since the 3 bursts in the 8 clusters can each have the same frequency spacing relative to each other, at least 8 further frequency bands can be reserved, leaving a maximum of 28 frequency bands for the basic assignment of the 3 bursts. For example, any relative assignment can be made with 3 different frequency bands. The largest possible frequency swing in adjacent bursts, as is the case, for example, with the basic assignments (1, 28, 14) or (1, 24, 12), has proven to be advantageous with regard to the subsequent optimizations. The individual clusters can also be assigned to one another at random. For example, in the basic assignments (1, 28, 14) the order of the numbers {1, 2,3, 4,5,6,7,8} can be permuted with one another as desired (Matlab command: randperm (8)) and these 8 different values ​​can each be added with the basic assignment in order to obtain the frequency assignment of the bursts in the 8 clusters. With the basic assignments (1, 24, 12), a permutation of 12 start values ​​(Matlab command: randperm (12)) is even possible and the first 8 values ​​can be added again with the corresponding basic assignment (1, 24, 12). If two groups of hopping patterns are to be designed, for example two groups of 8 hopping patterns with and without repetition, then it is advisable to use two basic arrangements with different frequency sweeps. Then whole clusters cannot collide between the groups. randperm (8)) and these 8 different values ​​can each be added to the base assignment in order to obtain the frequency assignment of the bursts in the 8 clusters. With the basic assignments (1, 24, 12), a permutation of 12 start values ​​(Matlab command: randperm (12)) is even possible and the first 8 values ​​can be added again with the corresponding basic assignment (1, 24, 12). If two groups of hopping patterns are to be designed, for example two groups of 8 hopping patterns with and without repetition, then it is advisable to use two basic arrangements with different frequency sweeps. Then whole clusters cannot collide between the groups. randperm (8)) and these 8 different values ​​can each be added to the base assignment in order to obtain the frequency assignment of the bursts in the 8 clusters. With the basic assignments (1, 24, 12), a permutation of 12 start values ​​(Matlab command: randperm (12)) is even possible and the first 8 values ​​can be added again with the corresponding basic assignment (1, 24, 12). If two groups of hopping patterns are to be designed, for example two groups of 8 hopping patterns with and without repetition, then it is advisable to use two basic arrangements with different frequency sweeps. Then whole clusters cannot collide between the groups. 12) it is even possible to permutate 12 start values ​​(Matlab command: randperm (12)) and the first 8 values ​​can be added again with the corresponding basic assignment (1, 24, 12). If two groups of hopping patterns are to be designed, for example two groups of 8 hopping patterns with and without repetition, then it is advisable to use two basic arrangements with different frequency sweeps. Then whole clusters cannot collide between the groups. 12) it is even possible to permutate 12 start values ​​(Matlab command: randperm (12)) and the first 8 values ​​can be added again with the corresponding basic assignment (1, 24, 12). If two groups of hopping patterns are to be designed, for example two groups of 8 hopping patterns with and without repetition, then it is advisable to use two basic arrangements with different frequency sweeps. Then whole clusters cannot collide between the groups.

The degrees of freedom described below with regard to the time intervals result. Here it is important to define both the 2 time intervals between the 3 bursts of the clusters and the 7 time intervals between the 8 clusters. A certain minimum time T ^ min should not be exceeded. An upper time limit T A _max results from the specification of the frame duration Tprame. The random time intervals can also be determined by dicing (Matlab command: ΔΤ = T / ™ + (T A _ max -T A_min) rand (7, 1)). Here, too, it is advisable to use different burst intervals in the clusters if a design of two different hopping pattern groups is planned. In the case of the time intervals between the clusters, it can also be checked in the repeat jump patterns to what extent the shift through the multi-stage time offset TW does not lead to burst overlaps and to what extent T A _ min is also maintained between all nested bursts. If this is not the case, the time scaling can be carried out again. It should also be mentioned that the above Matlab command equates T A _max = A _ m , nalso allow equidistant time intervals AT to be achieved.

In the "Telegram Splitting Multiple Access (TSMA)" access method, the message is broken down into many small bursts 142 in both time and frequency directions in accordance with the hopping pattern 140. The bursts 142 become both due to the asynchronous transmission and the different frequency storage of the individual sensor nodes 100 If all sensor nodes 100 have the same hopping pattern, then with increasing number of participants it happens more often that bursts of different participants overlap in time (in the worst case completely) and thus interfere with each other the more bursts 142 within a frame 120 are disturbed by bursts from other participants, the greater the probabilitythat the error correction on the receiver side fails and transmission errors occur.

Embodiments create a set of hopping patterns which ideally minimize the packet error rate (frame or packet error rate, FER, PER) of the radio transmission system. This is done on the assumption that all radio subscribers use the same set of hopping patterns. While with regard to the arrangement of the radio frequencies in a hopping pattern only a finite (albeit relatively large) number of permutations is possible due to the introduction of discrete radio channels, the temporal arrangement of the bursts 142 leads to an extremely large number of permutation possibilities due to a continuous time axis, ie hopping patterns. A "full search" across all possible jump patterns is therefore almost impossible. The method on which the invention is based is therefore based on a Monte Carlo approach, which, from a very large number of (pseudo) randomly generated jump patterns, uses suitable design criteria to select a sentence with the best properties in terms of an expected minimum error rate. The number of jump patterns in this set is PAuswahi.

A metric is required to create suitable hopping patterns 142, which ideally has a strictly monotonous relationship with the expected packet error rate, so minimizing it ideally minimizes the packet error rate. In exemplary embodiments, the two-dimensional (2D) auto-correlated or cross-correlated of the jump pattern can be considered as the design criterion.

The 2D auto-correlated (AKF) Θ χ . χ the matrix X of the jump pattern 142, which spans the area over the time period T frame scanned with multiples of 7 A and the occupied frequency spectrum with the L frequency bands, can be specified as follows:

where L is the number of rows in the matrix and M = T frame! Tf is the number of columns in the matrix. If there is a burst at the relevant point x (l, m) of the matrix X, then an entry is made at x (l, m) = 1 at this point, otherwise x (l, m) = 0. The indexed ones Elements of X that lie outside the occupied area are also zero:

x (l, m) = 0, 1 <0 or I> L or m <0 or m> M

Since the oscillator frequency error per subscriber can by definition amount to a deviation of S frequency channels, the frequency index f in the AKF extends from -2S to + 2S. The time index t, on the other hand, runs from -T Frame to T Fr ame, in steps of TFrame / Τ / The AKF dimension of Θ χ , χ is (4S + 1) x (2M + 1),

If desired, the influence of adjacent channel interference can also be taken into account in the time and frequency information matrix X. This is important if the reception filter in the receiver 110 has no particular selectivity with regard to adjacent channel interference. For this purpose, a metric vector mutute = {same channel, 1st adjacent channel, 2nd adjacent channel, ...} can be introduced, which inserts the corresponding information in the matrix X. For example, if you specify a metric with mt = {1, 0.5, 0. 1}, then in X at the point x (l, m), where we assume the presence of a burst, a 1 and x at the two positions of the neighboring frequencies (l-1, m) and x (l + 1, m) is 0.5. Accordingly, the value 0.1 for the 2nd adjacent channel is located further out at x (l-2, m) and x (l + 2, m).

10a and 10b show two examples of AKF. In Fig. 10a, in addition to the unavoidable main maximum at f = f = 0 (since the unshifted sequence is most similar to itself, the 2D-AKF has the highest value in our sequence for the sequence shifted in both dimensions (time and frequency) In the case of N burst collisions) and the 2 or 4 possible secondary maxima with the amplitudes of N / C each due to the cluster formation, only values ​​that are less than or equal to a threshold value N weld. The lower this threshold is, the fewer bursts are disturbed in a frame and the probability of a transmission error decreases. 10b, on the other hand, shows a more unfavorable step pattern in which the threshold value, for example, is clearly exceeded in some places. This increases the likelihood of transmission errors.

The individual design steps are described in detail below.

In a first design step, poptimai candidates of the jump patterns can be generated whose AKF secondary maxima do not exceed a predetermined minimum amplitude threshold value Nschweißie ^ C (C is the cluster size). Candidates of the jump patterns are generated in the context of a Monte Carlo simulation, in which jump patterns with random time and frequency patterns (within the framework of the boundary conditions mentioned, see above) are generated. If N weld> C applies to the threshold value, the number of values ​​that exceed the value C should be as small as possible.

For this purpose, the (4S + 1) x (2M + 1) elements of the 2D auto-correlated Q X , X can be sorted in a vector V in ascending order. 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 available assumes that only the last VAKF elements of Vsort, ie Vs 0 rt (end VAXF + 1 end) are considered. As a criterion (given autocorrection property) it can therefore be specified that the sum SUMAKF of these VAKF elements should have a sum threshold of Ssum_AKF_sct> weiie = (V AKF-1) does not exceed C + N. If one does not find enough different jump patterns for this, the value of Ssum_A F schwe «e can be increased by 1 step by step until a sufficient number of poptimai of jump patterns is available. The sum threshold Ssum_AKF_scr> weiie can rise significantly, especially when using the metric vector with adjacent channel interference in the calculation of the 2D AKF.

If different sets of jump patterns 142 are to be searched for, the first design step can be repeated with a new parameter set. For example, the

There is a desire to generate several sets of jump patterns with different oscillator deviations and to optimize them together. Different oscillator deviations cause different security strips S, which changes the degree of freedom of the possible burst occupancy. In this respect, this also changes some parameters within the AKF calculation. Or a new jump pattern set is to be generated which enables multiple repetitions using a multi-stage time offset Tw. Here the demands on the timing change. If a burst-wise alternating nesting of the jump patterns is provided, the shortest distance between two original bursts of a jump pattern can be determined and specified, which then defines the time offset TW.

The first design step, finding P'optimai candidates from a set of hopping pattern patterns, is completely independent of finding P 2 o P timai candidates from another pattern set. In this respect, all parameter specifications for the patterns (clusters, frequency patterns, time intervals, etc.), as well as the design parameters {welding, Vsort. Number of rows and columns of the 2D AKF Q x , x , etc.) can be changed as desired. Only in the second design step, the calculation of the cross-correlated, is a merging of all designed candidates.

If a predetermined number P AuS wahi different jump patterns is searched, then each individual jump pattern pair should be as orthogonal as possible to one another and the individual 2D cross-correlation matrices (2D-KKF)

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 Q x y continues unchanged in increments
of - T F rame to T frame .. The CCF frequency index f, however, extends generally from - (S x + S y ) to + (S X + S y), since the two jump patterns considered can have different deviations in their frequency error behavior (oscillator frequency deviations). 1 a and 11 b again show two 2D KKF examples, a favorable case (FIG. 1 a) and an unfavorable case (FIG. 11 b).

In a second design step , all (Poptimai -1) x (Poptimai) possible, usually different, cross correlation sequences 0, y can be calculated from the poptimai preselected jump pattern candidates with their associated 2D autocorrelation sequences Θ χ , χ . For each 2D KKF, the values ​​of 0x , y can then be sorted again in ascending order (analogous to the procedure for the 2D AKF), the sum of the last V K KF elements can be calculated, i.e. SUMKKF = sum (V So rt (end-v KK F + 1: end)) and in a square (Poptimai x Poptimai) matrix OVKKF.

If the 2D autocorrelation sequences Θ χ , χ were calculated from different sets of jump patterns in the first design step , the different candidate sets (P f o P timai and ^ optimal) are processed in sequence and a square matrix OVKKF is also created Dimension ((Poptimai + P 2 o P timai) x (P'optimai + P 2 o P timai)), which contains all cross correlation sequences 0 x , y of all possible combinations.

In a third step, it is necessary to search for the different jump patterns 142 which have the most favorable 2D-KKF properties among one another, since these correlate with a comparatively low maximum number of colliding bursts in one frame. For this purpose, the properties of ((PAuswaM -1) - PAuswahi) / 2 different 2D-KKF can be evaluated based on the sum SUMKKF stored in the matrix OVKKF. Those PAuswahi of different jump patterns, the total of which over the (PAuswahi -1) · PA U SW «W) / 2 different partial sums SUMKKF from O VKKF results in a minimum, the optimal PAuswahi jump pattern results. Since P uswa i «Poptimai is to be aimed at in the course of an extensive Monte Carlo simulation, there are various possible combinations in accordance with the binomial coefficient" Poptimaii over selection ", a scope that can generally not be worked through completely and randomly selected from the poptimai jump patterns available Matlab commands: F = randperm (1: Po P timai) and Pattem uswahl = F (1: PA US W SM)) and always the total sum GS is calculated from the different subtotals SUMKKF. With a correspondingly large sample size, there is a local minimum of the total, which then provides the desired set of PAuswaw jump patterns.

If the 2D autocorrelation sequences Θ, χ were calculated from different sets of jump patterns in the first design step , then a random, permanently permuted selection of P 1 selection from the P 1 optimally available jump patterns of sentence 1, as well as a random, constantly permuted Selection of P 2 selection from the P 2 or P timai available jump patterns from sentence 2. Via this jump pattern set [P selection, P 2 selection 1, the total sum GS is always

calculated from the various partial sums SUMKKF and then selected the sentence with the local minimum.

The complete design process, as well as the degrees of freedom when determining the jump pattern, is shown again in FIG. 12. The possibility of optimizing several sets of jump patterns at the same time is taken into account, but only hinted at.

In detail, FIG. 12 shows a flow diagram of a method 260 for generating

Jump patterns, according to one embodiment.

In a first step 262, method 260 is started.

In a second step 264, n is set equal to one, where n is a run variable.

In a third step 266, a jump pattern can be generated randomly. Here, the above-mentioned degrees of freedom with regard to the frequency channel assignment, such as a frequency channel assignment of the bursts with a basic 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 with regard to the time intervals, such as a determination of the time intervals within the cluster and between the clusters, can be taken into account.

In a fourth step 268, the autocorrelation function of the randomly generated jump pattern can be calculated. For example, a 2D AKF calculation Q x , x (f, t) can be carried out. Furthermore, the 2D AKF values ​​can be sorted in a vector. Furthermore, a partial sum can be formed over a predetermined number of largest amplitude values ​​of the autocorrelation function, SUMAKF = sum (v Sort (end-VAKF + 1: end)).

In a fifth step 270 it can be determined whether the randomly generated jump pattern has the predetermined autocorrelation properties. For example, it can be determined whether the AKF secondary maxima of the jump pattern do not exceed a predetermined minimum amplitude threshold value Nschweib & C (C is the cluster size); in detail, it can be determined whether the sum SUMAKF of these VAKF elements (partial sum) exceeds the sum threshold value of Ssum_AKF_schweiie of, for example, (VAKF-1) -C + N does not exceed.

If the jump pattern does not have the specified autocorrelation properties, the third step is repeated. If the jump pattern has the predetermined autocorrelation properties, then the process continues.

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

In a seventh step 274 it can be checked whether an optimal number of Popamai jump patterns are available.

If an optimal number of pop ai of hopping patterns is not available, then the third step 266 is repeated. If an optimal number of pop ai jump patterns are available, the process continues.

In an eighth step 276 it is determined whether a new set of jump patterns is to be generated. If so, then the second step 264 is repeated. If not, the process continues. Furthermore, it can be determined whether an additional set of hopping patterns for another parameter set, such as another oscillator offset or a different cluster appearance with changed time intervals or frequency jumps, is to be generated.

In a ninth step 278, the cross-correlation functions between the jump patterns with predetermined autocorrelation properties are calculated. For example, a 2D KKF calculation Qx ft) can be carried out for all jump pattern sets, the 2D KKF values ​​are sorted in a vector vso «, the partial sums SUMKKF = sum (vsc * t (end-VKKF + 1: end) ) are calculated, and the subtotals SUMKKF are stored in a matrix O V KKF.

In a tenth step 280, n can be set equal to one and the GS range to a large threshold, such as 10 6 .

In an eleventh step 282, P 1 selection jump patterns are newly and randomly selected from the P 1 o P ai existing first jump patterns and P 2 selection jump patterns new and random from the P 2 optimai existing second jump patterns. For this purpose, P 1 optimally different numbers are thrown out in random order, F 1 = randperm (1: P 1 o P timai) and P 2 o P timai different numbers in random order, F 2 = randperm (1: P 2 o PTimai). From this, the first P 1 selection can be selected, Pattern 1 selection = F (1: PVswahi), and the first P 2 selection can be selected, Pattern2Auswahi = F (1: P 2 selection). Using the Pattern 1 selection and Pattern2 selection, the total sum of GS can then be selected

Subtotals SUMKKF, which are in the matrix O V KKF, via PAuswahi = {P 1 selection! P 2 selection can be calculated.

In a twelfth step 282 it can be determined whether GS <> GS weld. If GS s GS welding is not satisfied, then n is increased by one, n-n + 1, and the eleventh step 282 is repeated. If GS M ■ '• 15 ■ l6 17 18 19 20. 21 22 23

1 373 319 545 373 319 443 373 319 349 373 319 454 373 319 578 373 319 436 373 319 398 373 319

2 373 319 371 373 319 410 373 319 363 373 319 354 373 319 379 373 319 657 373 319 376 373 319

3 373 319 414 373 319 502 373 319 433 373 319 540 373 319 428 373 319 467 373 319 409 373 319 4 373 319 396 373 319 516 373 319 631 373 319 471 373 319 457 373 319 416 373 319 354 373 319

5 373 319 655 373 319 416 373 319 367 373 319 400 373 319 415 373 319 342 373 319 560 373 319

6 373 319 370 373 319 451 373 319 465 373 319 593 373 319 545 373 319 380 373 319 365 373 319

7 373 319 393 373 319 374 373 319 344 373 319 353 373 319 620 373 319 503 373 319 546 373 319

8 373 319 367 373 319 346 373 319 584 373 319 579 373 319 519 373 319 351 373 319 486 373 319

In the table, each row is a time jump pattern, with each column in the table being a jump of the respective time jump pattern starting from a second jump, so that each time jump pattern has 24 jumps, each cell in the table showing a time interval between a reference point of the respective jump indicates a same reference point of a jump that follows immediately in - preferably multiples of - symbol durations.

The frequency hopping pattern can be one of the eight frequency hopping patterns mentioned in the following table, each with 24 hops:

In the table, each line is a frequency hopping pattern, with each column in the table being a hopping of the respective frequency hopping pattern, with each cell indicating a transmission frequency of the respective hopping of the respective frequency hopping pattern in carriers from UCG_C0 to UCG_23 in the table.

With a combination of the hopping pattern from a time hopping pattern and a frequency hopping pattern, the respective time hopping pattern and the respective frequency hopping pattern can have the same line number in the respective table.

4. Further examples of execution

Although some aspects have been described in connection with a device, it goes without saying that these aspects also represent a description of the corresponding method, so that a block or a component of a device is also to be understood as a corresponding method step or as a feature of a method step. Analogously, aspects related to or as a

The method step has also been described, also a description of a corresponding block or detail or feature of a corresponding device. Some or all of the method steps can be carried out by a hardware apparatus (or using a hardware apparatus), such as a microprocessor, a programmable computer or to run an electronic circuit. In some embodiments, some or more of the most important process steps can be performed by such an apparatus.

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

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

In general, exemplary embodiments of the present invention can be implemented as a computer program product with a program code, the program code being effective to carry out one of the methods when the computer program product runs on a computer.

The program code can, for example, also be stored on a machine-readable carrier.

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

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

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

A further exemplary embodiment of the method according to the invention is thus a data stream or a sequence of signals which represents the computer program for performing 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.

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

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

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

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

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

The 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).

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

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

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

List of abbreviations

Sc frequency carrier spacing, corresponds to the distance between two neighboring ones

frequency channels

BS base station

C Number of bursts that form a cluster

Frame data packet, consisting of N bursts

L Number of available frequency bands

MRC maximum ratio combining

N Number of bursts that make up a frame

Nschweie amplitude threshold in the AKF candidate generation

PAuswaM Optimizing the number of 2D AKF and KKF properties

Hopping pattern

S Number of frequency bands that may not contain bursts as security strips due to oscillator frequency errors

SR used symbol rate

To start time of a frame

TA sampling rate of the timeline

Expensive duration of a burst

Tprame duration of a frame

TSMA Telegram Splitting Multiple Access

TSMA pattern Hopping pattern of a frame in the time and frequency domain

X matrix with time and frequency information of the hopping patterns

Θχ, χ 2D auto-correlation function (2D-AKF)

Θχ, γ 2D cross-correlation function (2D-KKF)

claims

A data transmitter (100) configured to repeatedly transmit data (120) in a first mode using a first jump pattern (140_1) and a second jump pattern (140_2);

wherein the data transmitter (100) is designed to transmit data (120) in a second mode once using a third jump pattern (140);

the jump patterns of the first mode and the second mode are different.

The data transmitter (100) according to the preceding claim, wherein the data transmitter (100) is configured to select the first jump pattern (140_1) and the second jump pattern (140_2) from a first set of jump patterns and the third jump pattern (140) from one select second set of hopping patterns;

the first set of hopping patterns and the second set of hopping patterns being different.

Data transmitter (100) according to one of the preceding claims, wherein the data transmitter (100) is designed to establish a connection to a data receiver (10), the first jump pattern (140_1), second jump pattern (140_2) and / or third jump pattern ( 140) from a third set of hopping patterns.

Data transmitter (100) according to one of the preceding claims, wherein the first hopping pattern (140_1) and the second hopping pattern (140_2) are shifted from one another in at least one of the frequency and the time, and wherein the first hopping pattern (140_1) and the second hopping pattern ( 140_2) are at least partially nested.

5. Data transmitter (100) according to one of claims 1 to 4, wherein the first jump pattern (140_1) and the second jump pattern (140_2) are different.

6. Data transmitter (100) according to one of claims 1 to 4, wherein the second hopping pattern (140_2) is a frequency and / or time shifted version of the first hopping pattern (140_1).

7. The data transmitter (100) according to claim 6, wherein the first hopping pattern and the second hopping pattern are the same and are only shifted in time and / or frequency.

8. Data transmitter (100) according to one of the preceding claims, wherein the data transmitter (100) is designed to transmit the first hopping pattern (140_1) and the second hopping pattern (140_2) in different frequency bands.

9. Data transmitter (100) according to the preceding claim, wherein the data transmitter (100) is designed to transmit the first hopping pattern (140_1) or the second hopping pattern (140_2) randomly in one of at least two different frequency bands.

10. Data transmitter (100) according to one of the preceding claims, wherein the data transmitter (100) is designed to transmit the first hopping pattern (140_1) and the second hopping pattern (140_2) in at least partially overlapping frequency bands.

1 1. Data transmitter (100) according to any one of the preceding claims, wherein the data transmitter (100) is designed to a time offset between the first jump pattern (140_1) and the second jump pattern (140_2) depending on an operating parameter of the data transmitter (100) determine.

12. Data transmitter (100) according to one of the preceding claims, wherein the data transmitter (100) is designed to determine a frequency offset between the first hopping pattern (140_1) and the second hopping pattern (140_2) as a function of an operating parameter of the data transmitter (100) ,

13. Data transmitter (100) according to one of claims 11 to 12, wherein the operating parameter of the data transmitter (100) is an intrinsic parameter of the data transmitter (100) itself.

14. Data transmitter (100) according to claim 13, wherein the intrinsic parameter of the data transmitter (100) is addressing information, identification information, quartz tolerance, a frequency offset or an available transmission energy.

Data transmitter (100) according to one of claims 11 to 12, wherein the operating parameter of the data transmitter (100) is a parameter assigned to the data transmitter (100).

The data transmitter (100) of claim 15, wherein the parameter assigned to the data transmitter (100) is an assigned frequency offset, an assigned time offset, a radio line, a geographic position, a system time or a priority of the data transmitter or the data (120).

Data transmitter (100) according to any one of claims 11 to 12, wherein the operating parameter of the data transmitter (100) is at least part of user data or error protection data.

Data transmitter (100) according to one of claims 11 to 12, wherein the operating parameter of the data transmitter (100) is a random frequency offset or a random time offset.

A data transmitter (100) according to one of the preceding claims, wherein the first hopping pattern (140_1) and the second hopping pattern (1 0_2) are each a frequency hopping pattern, a time hopping pattern or a combination of a frequency hopping pattern and a time hopping pattern.

The data transmitter (100) according to one of the preceding claims, wherein the data (120) is a data packet, the data transmitter (100) being designed to divide the data packet into a plurality of sub-data packets, each of the sub-data packets being shorter than the data packet;

wherein the data transmitter (100) is designed to transmit the plurality of sub-data packets distributed according to the first hopping pattern in frequency and / or time and to transmit repeatedly according to the second hopping pattern of frequency and / or time.

A data transmitter (100) according to any one of the preceding claims, wherein

- the first jump pattern (140_1) and the second jump pattern (1 0_2) each,

- or the third jump pattern (140)

is a time hopping pattern, a frequency hopping pattern, or a combination of the time hopping pattern and the frequency hopping pattern;

where the time jump pattern is one of the eight time jump patterns with 24 jumps each mentioned in the following table:

where in the table each row is a time jump pattern, in the table each column is a jump of the respective time jump pattern starting from a second jump, so that each time jump pattern has 24 jumps, with each cell in the table a time interval of a reference point of the respective jump indicates an identical reference point of a jump that follows immediately in - preferably multiples of - symbol durations;

where the frequency hopping pattern is one of the eight frequency hopping patterns with 24 hops each mentioned in the following table:

# of sub-data packets in the core frame SC

where in the table each line is a frequency hopping pattern, in the table each column is a jump of the respective frequency hopping pattern, in the table each cell indicating a transmission frequency of the respective hopping of the respective frequency hopping pattern in carriers from UCG_C0 to UCG_23.

A data transmitter (100) according to the preceding claim, wherein in a combination of the time hopping pattern and the frequency hopping pattern, the time hopping pattern and the frequency hopping pattern in the respective table have the same line number.

A data transmitter (100) according to any one of the preceding claims, wherein

- or the first hopping pattern (140_1) and the second hopping pattern (1 0_2) are each a time hopping pattern, a frequency hopping pattern or a combination of the time hopping pattern and the frequency hopping pattern;

the time jump pattern being one of the eight listed in the table below

Time jump pattern with 24 jumps each is:

where in the table each row is a time jump pattern, in the table each column is a jump of the respective time jump pattern starting from a second jump, so that each time jump pattern has 24 jumps, with each cell in the table a time interval of a reference point of the respective jump indicates an identical reference point of a jump that follows immediately in - preferably multiples of - symbol durations;

where the frequency hopping pattern is one of the eight frequency hopping patterns with 24 hops each mentioned in the following table:

# of sub-data files in Kernrahmeri SC

where in the table each line is a frequency hopping pattern, in the table each column is a jump of the respective frequency hopping pattern, in the table each line indicating a transmission frequency of the respective hopping of the respective frequency hopping pattern in carriers from UCG_C0 to UCG_23.

24. Data transmitter (100) according to the preceding claim, wherein in a combination of the time hopping pattern and the frequency hopping pattern, the time hopping pattern and the frequency hopping pattern in the respective table have the same line number.

25. Data receiver (110), which is designed to receive data (120) repeatedly in a first mode using a first jump pattern (140_1) and a second jump pattern (140_2);

wherein the data transmitter (100) is configured to receive data (120) once using a third hopping pattern (140) in a second mode;

the jump patterns of the first mode and the second mode are different.

26. The data receiver (110) according to the preceding claim, wherein the data receiver (1 10) is designed to select the first jump pattern (140_1) and the second jump pattern (140_2) from a first class of jump patterns and to the third jump pattern (140 ) choose from a second class of jump patterns;

where the first class of jump patterns and the second class of jump patterns are different.

27. Data receiver (110) according to one of the preceding claims, wherein the first hopping pattern (1 0_1) and the second hopping pattern (1 0_2) are shifted from one another in at least one of the frequency and the time, and wherein the first hopping pattern (140_1) and the second jump pattern (140_2) are at least partially nested in one another.

28. Data receiver (1 10) according to one of claims 25 to 27, wherein the first jump pattern (140_1) and the second jump pattern (140_2) are different.

29. Data receiver (1 10) according to one of claims 25 to 27, wherein the second hopping pattern (140_2) is a version of the first hopping pattern (140_1) shifted in frequency and / or time.

30. The data receiver (110) according to claim 29, wherein the first hopping pattern and the second hopping pattern are the same and are only shifted in time and / or frequency.

31. The data receiver (110) according to one of the preceding claims, wherein the data receiver (110) is designed to detect one of the two hopping patterns in a received data stream in order to receive the data (120) transmitted with the one hopping pattern;

wherein the data receiver (110) is designed to determine the other hopping pattern in the received data stream using the already detected hopping pattern in order to receive the data (120) transmitted with the other hopping pattern.

32. Data receiver (110) according to one of the preceding claims, wherein the data receiver (1 10) is designed to a time offset between the first jump pattern (140_1) and the second jump pattern (140_2) depending on an operating parameter of a data transmitter (100) center that sends the data (120).

33. Data receiver (110) according to one of the preceding claims, wherein the data receiver (110) is designed to a frequency offset between the first hopping pattern (140_1) and the second hopping pattern (1 0_2) depending on an operating parameter of a data transmitter (100) determine who sends the data (120).

34. Data receiver (110) according to one of claims 32 to 33, wherein the data receiver (110) the operating parameters of the data transmitter (100) is known.

35. Data receiver (110) according to any one of claims 32 to 33, wherein the data receiver (110) is designed to determine the operating parameter by means of a hypothesis test.

36. Data receiver (110) according to any one of claims 32 to 35, wherein the operating parameter of the data transmitter (100) is an intrinsic parameter of the data transmitter (100) itself.

37. Data receiver (110) according to claim 36, wherein the intrinsic parameter of the data transmitter (100) is addressing information, identification information, quartz tolerance, a frequency offset or an available transmission energy.

38. Data receiver (1 10) according to any one of claims 32 to 35, wherein the operating parameter of the data transmitter (100) is a parameter assigned to the data transmitter (100).

39. The data receiver (1 10) according to claim 38, wherein the parameter assigned to the data transmitter (100) is an assigned frequency offset, an assigned time offset, a radio cell, a geographical position, a system time or a priority of the data transmitter or the data (120).

40. Data receiver (1 10) according to one of claims 32 to 35, wherein the operating parameter of the data transmitter (100) is at least part of user data or error protection data.

41. Data receiver (110) according to one of claims 32 to 35, wherein the operating parameter of the data transmitter (100) is a random frequency offset or a random time offset.

42. Data receiver (110) according to one of the preceding claims, wherein the data receiver (110) is designed to receive the first hopping pattern (140_1) and the second hopping pattern (140_2) in different frequency bands.

43. Data receiver (1 10) one of the preceding claims, wherein the data receiver (110) is designed to transmit data repeatedly (120) based on the first jump pattern (140_1) and / or second jump pattern

(140_2) to recognize; or

wherein the data receiver (1 10) is designed to recognize a simple transmission of data (120) on the basis of the third jump pattern.

44. Data receiver (110) according to one of the preceding claims, wherein the first hopping pattern (140_1) and the second hopping pattern (1 0_2) are each a frequency hopping pattern, a time hopping pattern or a combination of a frequency hopping pattern and a time hopping pattern.

45. Data receiver (110) according to any one of the preceding claims, wherein

- the first jump pattern (140_1) and the second jump pattern (140_2) each, - or the third jump pattern (140)

a time hopping pattern, a frequency hopping pattern, or a combination

Time hopping pattern and frequency hopping pattern;

where the time jump pattern is one of the eight time jump patterns with 24 jumps each mentioned in the following table:

' tVörtSyt

where in the table each row is a time jump pattern, in the table each column is a jump of the respective time jump pattern starting from a second jump, so that each time jump pattern has 24 jumps, with each cell in the table a time interval of a reference point of the respective jump indicates an identical reference point of a jump that follows immediately in - preferably multiples of - symbol durations;

where the frequency hopping pattern is one of the eight frequency hopping patterns with 24 hops each mentioned in the following table:

where in the table each line is a frequency hopping pattern, in the table each column is a jump of the respective frequency hopping pattern, in the table each cell indicating a transmission frequency of the respective hopping of the respective frequency hopping pattern in carriers from UCG_C0 to UCG_23.

46. ​​Data receiver (110) according to the preceding claim, wherein in a combination of the time hopping pattern and the frequency hopping pattern, the time hopping pattern and the frequency hopping pattern in the respective table have the same line number.

47. Data receiver (110) according to one of the preceding claims, wherein

- the third jump pattern (140),

- or the first hopping pattern (140_1) and the second hopping pattern (140_2) are each a time hopping pattern, a frequency hopping pattern or a combination of the time hopping pattern and the frequency hopping pattern;

where the time jump pattern is one of the eight time jump patterns with 24 jumps each mentioned in the following table:

# of sub-data packets in the core frame SC

where in the table each row is a time jump pattern, in the table each column is a jump of the respective time jump pattern starting from a second jump, so that each time jump pattern has 24 jumps, with each cell in the table a time interval of a reference point of the respective jump indicates an identical reference point of a jump that follows immediately in - preferably multiples of - symbol durations;

where the frequency hopping pattern is one of the eight frequency hopping patterns with 24 hops each mentioned in the following table:

# from Sub-Da-t ripaketeri in the core frame SC

No. 1, / . G. " - ' S ' v-6. · 7 '' : S " 9 10 iii- 12 ... 13; :. - ' Ϊ4 15 16 : . 17 18 " ' 19 ' 20 21 ' 22, 23 : 24

1 5 21 13 6 22 14 1 17 9 0 ie 8 7 23 15 4 20 12 3 19 11 2 18 10

2 4 20 12 1 17 9 0 16 8 6 22 14 7 23 15 2 18 10 5 21 13 3 19 11

3 4 20 12 3 19 11 6 22 14 7 23 15 0 16 8 5 21 13 2 18 10 1 17 9

4 6 22 14 2 18 10 7 23 15 0 16 8 1 17 9 4 20 12 5 21 13 3 19 11

7 23 15 4 20 12 3 19 11 2 18 10 6 22 14 0 16 8 1 17 9 5 21 13

3 19 11 6 22 14 2 18 10 0 16 8 7 23 15 1 17 9 4 20 12 5 21 13

3 19 11 1 17 9 5 21 13 7 23 15 0 16 8 2 18 10 6 22 14 4 20 12

0 16 8 6 22 14 3 19 11 2 18 10 4 20 12 7 23 15 5 21 13 1 17 9

where in the table each line is a frequency hopping pattern, in the table each column is a jump of the respective frequency hopping pattern, in the table each cell indicating a transmission frequency of the respective hopping of the respective frequency hopping pattern in carriers from UCG_CO to UCG_23.

A data receiver (110) according to the preceding claim, wherein in a combination of the time hopping pattern and the frequency hopping pattern, the time hopping pattern and the frequency hopping pattern in the respective table have the same row number.

System with the following features:

a data transmitter (00) according to any one of claims 1 to 24; and

a data receiver (110) according to any one of claims 25 to 48.

A method (160) for sending data, the method comprising:

Repeatedly sending (162) data in a first mode using a first hopping pattern and a second hopping pattern;

Sending data (164) in a second mode once using a third hopping pattern;

the jump patterns of the first mode and the second mode are different.

A method (170) for receiving data, the method comprising:

Receiving (172) data in a first mode repeatedly using a first hopping pattern and a second hopping pattern;

Receiving (174) data in a second mode once using a third hopping pattern;

the jump patterns of the first mode and the second mode are different.

Computer program for performing the method according to one of claims 50 to 51.

A method (210) for generating a first set of hopping patterns and a second set of hopping patterns, the method comprising:

randomly generating (212) a plurality of hopping patterns for the first set of hopping patterns and a plurality of hopping patterns for the second set of hopping patterns, the hopping patterns having at least two hops distributed in frequency and time, the hopping patterns for the first Set of hopping patterns and the hopping patterns for the second set of hopping patterns are different;

Selecting (214) the hopping patterns from the plurality of hopping patterns for the first set of hopping patterns whose autocorrelation functions have predetermined autocorrelation properties to obtain jumping patterns with predetermined autocorrelation properties for the first set of hopping patterns, and selecting the hopping patterns from the plurality of jumping patterns for the second Set of jump patterns, the autocorrelation functions of which have predetermined autocorrelation properties, in order to obtain jump patterns with predetermined autocorrelation properties for the second set of jump patterns.

Method according to the preceding claim, wherein a time interval between the jumps of the jump patterns for the second set of jump patterns is at least as large as a time length of one of the jumps of the jump patterns for the first set of jump patterns.

Method according to one of the preceding claims, wherein the time intervals between the jumps of the jump patterns within a predetermined jump pattern length are equidistant with a deviation of ± 20%.

Method (210) according to one of the preceding claims, the method comprising a step of mapping the plurality of hopping patterns for the first set of hopping patterns into a two-dimensional time and frequency occupancy matrix with calculation of the autocorrelation functions and mapping of the plurality of hopping patterns applied to it for the second set of hopping patterns each has a two-dimensional time and frequency bending matrix with the calculation of the autocorrelation functions applied to it.

Method (210) according to the preceding claim, wherein the step of mapping the plurality of hopping patterns for the first set of hopping patterns and / or mapping the plurality of hopping patterns for the second set of hopping patterns in each case taking into account any influences that may occur from adjacent frequency positions (adjacent channel interference ) he follows.

Method (210) according to one of the preceding claims, wherein the autocorrelation functions are two-dimensional autocorrelation functions.

Method (210) according to one of the preceding claims, wherein when selecting the hopping patterns for the first set of hopping patterns, those hopping patterns fulfill the predetermined autocorrelation properties whose autocorrelation function secondary maxima do not exceed a predetermined maximum first amplitude threshold value, and wherein when selecting the hopping patterns for the second set of jump patterns those jump patterns that are given

Fulfill autocorrelation properties whose autocorrelation function secondary maxima do not exceed a predetermined maximum second amplitude threshold.

The method (210) of the preceding claim, wherein the first amplitude threshold is equal to the second amplitude threshold.

The method (210) according to one of claims 59 and 60, wherein the first amplitude threshold value is equal to a number of jumps which form a repeating and in terms of time and / or frequency shifted sub-jump pattern of the respective jump pattern for the first set of jump patterns, and wherein the second amplitude threshold value is equal to a number of jumps which form a repeating sub-jump pattern of the respective jump patterns for the second set of jump patterns and shifted in time and / or frequency.

Method (210) according to one of the preceding claims, wherein when selecting the hopping pattern for the first set of hopping patterns, those hopping patterns fulfill the predetermined autocorrelation properties, the partial sum of which over a predetermined number of the greatest amplitude values ​​of the respective

Autocorrelation function formed, is smaller than a predetermined first threshold value, and wherein when selecting the jump patterns for the second set of jump patterns, those jump patterns fulfill the predetermined autocorrelation properties, the partial sum of which is formed over a predetermined number of largest amplitude values ​​of the respective autocorrelation function, less than a predetermined second

Is threshold.

Method (210) according to the preceding claim, wherein the first threshold value is selected such that at least two hopping patterns for the first set of hopping patterns meet the predetermined autocorrelation properties, and wherein the second threshold value is selected such that at least two hopping patterns for the second set of Jump patterns meet the given autocorrelation properties;

or wherein the first threshold value and / or the second threshold value is selected as a function of respective boundary parameters.

The method (210) according to any one of the preceding claims, the method further comprising:

Computing (216) cross-correlation functions between the hopping patterns with predetermined autocorrelation properties for the first set of hopping patterns and cross-correlation functions between the hopping patterns with predetermined autocorrelation properties for the second set of hopping patterns; and

Selecting (218) the jump patterns from the jump patterns with predetermined autocorrelation properties for the first set of jump patterns, the cross-correlation functions of which have predetermined cross-correlation properties, in order to obtain jump patterns with predetermined autocorrelation properties and predetermined cross-correlation properties for the first set of jump patterns, and the jump pattern from the jump patterns with predetermined Autocorrelation properties for the second set of jump patterns, the cross-correlation functions of which have predetermined cross-correlation properties, in order to obtain jump patterns with predetermined autocorrelation properties and predetermined cross-correlation properties for the second set of jump patterns.

65. The method (210) according to claim 64, wherein when calculating (216) cross-correlation functions also cross-correlation functions between the

Jump patterns are calculated for the first set of jump patterns and the second jump patterns;

wherein when selecting the jump patterns, only those jump patterns for the first set of jump patterns and / or the second set of jump patterns are selected whose cross-correlation functions between the jump patterns for the first set of jump patterns and the second set of jump patterns also have predetermined cross-correlation properties.

A method (210) according to any one of claims 64 and 65, wherein cross-correlation functions are two-dimensional cross-correlation functions.

The method (210) according to one of claims 64 to 66, wherein when selecting the jump patterns from the jump patterns with predetermined autocorrelation properties for the first set of jump patterns, those jump patterns fulfill the predetermined cross-correlation properties, the partial sums of which are formed over a predetermined number of the greatest amplitude values ​​of the respective cross-correlation function, are the smallest, and when selecting the hopping patterns from the hopping patterns with predetermined autocorrelation properties for the second set of hopping patterns, those hopping patterns fulfill the predetermined cross-correlation properties, the partial sums of which are formed the smallest over a predetermined number of largest amplitude values ​​of the respective cross-correlation function.

Method (2 0) according to one of the preceding claims, wherein in the random generation of the plurality of hopping patterns for the first set of hopping patterns and the second set of hopping patterns, the hopping patterns are generated such that the hops of the respective hopping patterns lie within a predetermined frequency band ,

Sending data using a first hopping pattern and a second hopping pattern;

wherein the data is sent using the first jump pattern and the data is sent repeatedly using the second jump pattern;

wherein the first hopping pattern and the second hopping pattern are each a time hopping pattern, a frequency hopping pattern, or a combination of the time hopping pattern and the frequency hopping pattern;

the time jump pattern being one of the eight listed in the table below

Time jump pattern with 24 jumps each is:

where in the table each row is a time jump pattern, in the table each column is a jump of the respective time jump pattern starting from a second jump, so that each time jump pattern has 24 jumps, with each cell in the table a time interval of a reference point of the respective jump indicates an identical reference point of a jump that follows immediately in - preferably multiples of - symbol durations;

where the frequency hopping pattern is one of the eight frequency hopping patterns with 24 hops each mentioned in the following table:

where in the table each line is a frequency hopping pattern, in the table each column is a jump of the respective frequency hopping pattern, in the table each cell indicating a transmission frequency of the respective hopping of the respective frequency hopping pattern in carriers from UCG_C0 to UCG_23.

70. Transmission according to the preceding claim, wherein the hopping pattern is a combination of the time hopping pattern and the frequency hopping pattern, the time hopping pattern and the frequency hopping pattern in the respective table having the same line number.

71. Transmission according to one of the preceding claims, wherein a data packet divided into a plurality of sub-data packets is sent in accordance with the branch pattern, so that a sub-data packet of the plurality of sub-data packets is sent in each branch of the branch pattern.

72. receiving data using a first time jump pattern and a second time jump pattern;

wherein the data is received using the first hopping pattern and wherein the data is received repeatedly using the second hopping pattern;

wherein the first hopping pattern and the second hopping pattern are each a time hopping pattern, a frequency hopping pattern, or a combination of the time hopping pattern and the frequency hopping pattern;

where the time jump pattern is one of the eight time jump patterns with 24 jumps each mentioned in the following table:

where in the table each row is a time jump pattern, in the table each column is a jump of the respective time jump pattern starting from a second jump, so that each time jump pattern has 24 jumps, with each cell in the table a time interval of a reference point of the respective jump to a

specifies the same reference point of an immediately following jump in - preferably multiples of - symbol durations;

where the frequency hopping pattern is one of the eight frequency hopping patterns with 24 hops each mentioned in the following table:

where in the table each line is a frequency hopping pattern, in the table each column is a jump of the respective frequency hopping pattern, in the table each cell indicating a transmission frequency of the respective hopping of the respective frequency hopping pattern in carriers from UCG_C0 to UCG_C23.

73. Receiving according to the preceding claim, wherein the hopping pattern is a combination of the time hopping pattern and the frequency hopping pattern, the time hopping pattern and the frequency hopping pattern in the respective table having the same line number.

74. Receiving according to one of the preceding claims, wherein a data packet divided into a plurality of sub-data packets is received in accordance with the branch pattern, so that a sub-data packet of the plurality of sub-data packets is received in each branch of the branch pattern.