SPECIFIC HOPPING PATTERNS FOR TELEGRAM SPLITTING

Description

[0001] Embodiments relate to a data transmitter and, in particular, to a data transmitter that transmits data using a custom hopping pattern. Further embodiments relate to a data receiver and, in particular, to a data receiver that receives data transmitted using a custom hopping pattern. Further embodiments relate to the generation of specific hopping patterns. Further embodiments relate to the transmission and reception of data using specific hopping patterns. Some embodiments relate to specific hopping patterns for telegram splitting. Some embodiments relate to an optimization process for generating hopping patterns.

[0002] From DE 10 2011 082 098 B4 the telegram splitting method is known, according to which a telegram (or data packet) is divided into a plurality of sub-data packets, which are transmitted distributed in time and optionally in frequency using a hop pattern.

[0003] WO 2015 / 128385 A1 describes a data transmission arrangement that has an energy harvesting element as an energy source. The data transmission arrangement is designed to transmit data using the telegram splitting method, whereby a partial packet awaiting transmission is either transmitted, buffered and transmitted later, or discarded, depending on the amount of electrical energy available from the energy supply device.

[0004] The paper [G. Kilian, H. Petkov, R. Psiuk, H. Lieske, F. Beer, J. Robert, and A. Heuberger, "Improved coverage for low-power telemetry systems using telegram splitting," in Proceedings of 2013 European Conference on Smart Objects, Systems and Technologies (SmartSysTech), 2013] describes an improved coverage for low-power telemetry systems using the telegram splitting technique.

[0005] 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 improved transmission reliability for low-power telemetry systems using the telegram splitting method.

[0006] The telegram splitting technique uses specific time-frequency hopping patterns to transmit data over the radio channel. To successfully decode a data packet, the hopping pattern used for transmission must be known to the receiver. To ensure this, global time and frequency hopping patterns are defined for telegram splitting networks, which are known to all participants.

[0007] When multiple nodes communicate using telegram splitting in the same band, the transmission's interference immunity is reduced if the same time and / or frequency hopping pattern is used for data transmission by multiple nodes. If two nodes initiate a transmission with the same hopping 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.

[0008] US 2005 / 176371 A1 relates to the transmission of data in a short-range communication system. A frequency hopping method is used for data transmission, in which individual OFDM symbols are transmitted in consecutive time slots in different frequency bands.

[0009] US 2009 / 109953 A1 relates to the temporal synchronization of a receiver to a transmission from a transmitter with a unique frequency hopping pattern, which is generated based on a so-called time-frequency code.

[0010] US Patent No. 6,967,974 B1 relates to a telemetry system in which transmitters transmit data using individual time and frequency hopping patterns. The individual time and frequency hopping patterns are generated depending on the transmitter ID of the respective transmitter.

[0011] DE 102 11 235 A1 relates to a method for generating a frequency hopping frequency sequence.

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

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

[0014] The invention is defined in the independent claims.

[0015] Advantageous further developments can be found in the dependent patent claims.

[0016] Embodiments of the present invention are described in more detail with reference to the accompanying figures. They show: Fig. 1 is a schematic block diagram of a system with a data transmitter and a data receiver, according to an example; Fig. 2 is a diagram showing the occupancy of the transmission channel during the transmission of a plurality of sub-data packets according to a time and frequency hopping pattern; Fig. 3 is a diagram showing a frequency band of a communication system defined by band boundaries, as well as a frequency A to be used by a data transmitter for transmission and a tolerance range around frequency A in which the transmission of the data transmitter actually takes place due to its quartz tolerance; Fig. 4 is a diagram showing a frequency band of a communication system defined by band boundaries, as well as a frequency range used by a wide hopping pattern and its tolerance range, and a frequency range used by a narrow hopping pattern and its tolerance range; Fig.5in a diagram a frequency band of a communication system which is defined by band boundaries, as well as unused frequency ranges of the frequency band which result from a data transmitter with a small tolerance range which is . Fig. 4used; Fig. 6 shows a flowchart of a method for transmitting a signal, according to an example; Fig. 7 shows a flowchart of a method for receiving a signal, according to an example; Fig. 8 shows a flowchart of a method for transmitting a signal, according to an example; Fig. 9 shows a flowchart of a method for receiving a signal, according to an example; Fig. 10 shows a flowchart of a method for generating hopping patterns, according to an example; Fig. 11 shows a diagram of the structure of a frame with a TSMA hopping pattern; Fig. 12 shows a schematic view of the structure of a TSMA hopping pattern; Fig. 13a shows a diagram of the main and secondary maxima of an autocorrelation function of a hopping pattern having predetermined autocorrelation properties, plotted against frequency and time;13b shows a diagram of the main and secondary maxima of an autocorrelation function of a jump pattern that does not have predetermined autocorrelation properties, plotted over frequency and time; Fig. 14a shows a diagram of the main and secondary maxima of a cross-correlation function of two jump patterns that have predetermined cross-correlation properties, plotted over frequency and time; Fig. 14b shows a diagram of the main and secondary maxima of a cross-correlation function of two jump patterns that do not have predetermined cross-correlation properties, plotted over frequency and time; and Fig. 15 shows a flowchart of a method 260 for generating jump patterns, according to an example.

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

[0018] Fig. 1 shows a schematic block diagram of a system with a data transmitter 100 and a data receiver 110, according to an example.

[0019] The data transmitter 100 is configured to transmit a signal 120, wherein the signal has an individual hop pattern, wherein the individual hop pattern is dependent on an operating parameter.

[0020] The data receiver 110 is configured to receive the signal 120 from the data transmitter 100, wherein the signal 120 has the individual hop pattern, wherein the individual hop pattern depends on the operating parameter.

[0021] In examples, the data transmitter 100 and the data receiver 110 use an individual hop pattern 140 for communication instead of a uniform (global) hop pattern that is used equally by all data transmitters and data receivers of a communication system. This individual hop pattern depends on an operating parameter (e.g., an operating parameter of the data transmitter 100, data receiver 110, or communication system) and is thus only used by the data transmitter 100 and the data receiver 110 themselves or a small group of data transmitters and / or data receivers, which can significantly increase interference immunity.

[0022] For example, the data transmitter 100 and / or the data receiver 110 can be configured to calculate the individual jump pattern 140 depending on the operating parameter, e.g., using a mapping rule with the operating parameter as an input variable. Furthermore, the data transmitter 100 and / or the data receiver 110 can be configured to select (or choose) a jump pattern from a set of jump patterns depending on the operating parameter to obtain the individual jump pattern 140.

[0023] As in Fig. 1 As indicated, the individual hop pattern 140 can have a plurality of hops 142 distributed in time and / or frequency. The distribution of the plurality of hops 142 in time and / or frequency can depend on the operating parameter.

[0024] In examples, the data transmitter 100 may be configured to transmit data 120 distributed in time and / or frequency according to the individual hopping pattern 140. Accordingly, the data receiver 110 may be configured to receive data 120 transmitted distributed in time and / or frequency according to the individual hopping pattern 140.

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

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

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

[0028] The data transmitter 100 and the data receiver 110 can optionally be configured to send and receive data 120 using the telegram splitting method. In this method, a telegram or data packet 120 is split into a plurality of sub-data packets (or partial data packets, or sub-packets) 142, and the sub-data packets 142 are transmitted from the data transmitter 100 to the data receiver 110 in a time-distributed and / or frequency-distributed manner according to the individual hop pattern 140. The data receiver 110 then reassembles (or combines) the sub-data packets to obtain the 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 for error-free decoding of the data packet 120, not all of the sub-data packets 142 but only a part of the sub-data packets 142 are required.

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

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

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

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

[0033] Fig. 2 shows a diagram illustrating the occupancy 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 represents the frequency and the abscissa represents time.

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

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

[0036] The following describes detailed examples of the data transmitter 100 and data receiver 110, which use an individual hop pattern for transmission, where the individual hop pattern depends on an operating parameter. The use of the telegram splitting method is purely optional.

[0037] Furthermore, it is assumed below that the operating parameter is an operating parameter of the data transmitter 100 or of the communication system. The operating parameter can be an inherent operating parameter of the data transmitter or an operating parameter assigned to the data transmitter. 1.1. Varying jump patterns

[0038] In examples, as already mentioned several times, instead of a fixed hop pattern, an individual hop pattern 140 can be used for the transmission between data transmitter 100 and data receiver 110.

[0039] This can solve the problem described below. When multiple nodes communicate using telegram splitting in the same band, the transmission's interference immunity is reduced if the same time-frequency hop pattern is used for data transmission by multiple nodes. If two nodes initiate a transmission with the same hop pattern within a short time window, all subpackets of the telegram overlap and, in the worst case, cancel each other out.

[0040] Depending on the network topology, there are different ways to vary the hop patterns for allocation

[0041] In examples, the individual hop pattern 140 may depend on an (inherent) operating parameter of the data transmitter 100, wherein the (inherent) operating parameter of the data transmitter may be addressing information or identification information of the data transmitter 100.

[0042] For example, an addressing hop pattern can be used. When transmitting to a known station, instead of a predefined hop pattern, a hop pattern can be used that is calculated from a value that identifies or addresses the target station, such as a serial number or a network address.

[0043] This has the advantage that the hop patterns 140 are individual for each data sender 100 (or user) and the probability of a collision of identical hop patterns can be drastically reduced.

[0044] However, the number of hop patterns that a data receiver (e.g., a base station) 110 can continuously search for is limited by computing power. If an individual hop sequence is defined for each data transmitter (e.g., node) 100, the number of nodes that can receive simultaneously is correspondingly lower.

[0045] In examples, an individual hopping pattern 140 may be used on the data transmitter side (or waveform side) for each transmission between two participants, which may be derived, for example, from addressing information or identification information, such as a date, a serial number, or a network address, that identifies the receiver or transmitter.

[0046] In examples, when using a time and frequency hopping pattern that identifies the transmitter, a time and frequency hopping pattern list can be maintained on the data receiver side that contains the hopping patterns or the identifying date of the data transmitters to be received. 1.2 Local jump patterns

[0047] In examples, the individual hopping pattern 140 may depend on an (assigned) operating parameter of the data transmitter 100, where the (assigned) operating parameter of the data transmitter 100 may be a radio cell.

[0048] This can solve the problem described below. If a radio-based network is set up consisting of several central nodes (e.g., many end nodes communicating with a base station), radio cells form around each central node. If the transmissions within a radio cell are not decoupled from one another using classic multiplexing methods (e.g., frequency division multiplexing) and appropriate network planning, the communications within one cell will also interfere with the communications of all overlapping or neighboring radio cells. This problem also arises in telegram splitting-based networks, since all participants (e.g., data senders) use the global time-frequency hopping patterns to communicate with the central node (e.g., data receivers).

[0049] In examples, each central station (e.g., data receiver 110) can have its own set of local time and frequency hopping patterns, which allows the network's radio cells to operate in an overlapping manner. These can complement or completely replace the global hopping patterns.

[0050] Allocation can occur during registration. In a star network, where many nodes communicate with a base station, initial communication can be handled using global hopping patterns. When a node is assigned to a base station or registers with it, it informs the end node which set of local hopping patterns it is using.

[0051] The communication of which set is used can be done explicitly by transmitting the set's time-frequency hopping patterns. It is also possible to define one or more sets of local hopping patterns in the nodes and negotiate the set to be used when contacting.

[0052] In examples, the individual hopping pattern 140 may depend on an (assigned) operating parameter of the data transmitter 100, where the (assigned) operating parameter of the data transmitter 100 may be a geographical location.

[0053] For example, regional hop patterns can be used. If the nodes know their position (e.g., via GNSS), they can use this information to determine which set of local hop patterns they can use. This can be done using previously stored sets or by calculation from the position. Likewise, the selection of the hop pattern set can also be determined by other external influences, such as radio signals from external systems. The position can also be signaled by the base station. 1.3 QoS hop pattern (QoS = quality of service)

[0054] In examples, the individual jump pattern 140 can be selected from a set of jump patterns, wherein each jump pattern of the set of jump patterns can be assigned a defined usage frequency (=operating parameter). This means that the jump patterns are not used evenly, but rather deliberately unevenly.

[0055] This solves the problem described below. To achieve the maximum theoretical capacity of the network, it is necessary that all hop patterns be used with the same frequency. However, this means that the probability of a packet drop when the capacity limit is exceeded becomes equally poor for all hop patterns, and no more packets can be transmitted. 1.3.1 Varying frequency of use

[0056] In some examples, varying usage frequency can be used. This can reduce or even prevent graceful network degradation.

[0057] For example, the frequency with which hop patterns are used can be fixed in the hop pattern set. This results in network capacity being reached more quickly for the frequently used hop patterns. If the usage frequency of the remaining hop patterns is set to be correspondingly lower, the probability of successfully transmitting a message with a rarely used hop pattern increases, as the probability of full overlap decreases.

[0058] This means that the network will be able to successfully transmit fewer messages at its capacity limit. However, it won't completely collapse when the limit is exceeded. Instead, the network latency will increase according to the selected usage frequency. This allows for a controlled and predictable performance loss of the network at the capacity limit.

[0059] In examples, the frequency of use of the jump pattern for transmission can be determined on the data sender side (and / or data receiver side) according to a predefined rule for the frequency of use.

[0060] In examples, the computing power provided for decoding a hop pattern on the data receiver side can be allocated according to the frequency of use of the hop pattern.

[0061] To illustrate, consider the following example. In the time-frequency hop pattern set S1, the hop patterns M1 and M2 are defined. Each set is then assigned a relative usage frequency: M1 75% and M2 25%. This means that hop pattern M1 is used three times more frequently for transmission than M2. Thus, the probability that a transmission with hop pattern M1 will be disrupted by the simultaneous transmission of another node with hop pattern M1 is three times higher than a transmission with hop pattern M2, since this is used less frequently in the network. 1.3.2. Application-specific or proprietary jump patterns

[0062] In examples, the individual hop pattern can be selected from a set of hop patterns depending on an (assigned) operating parameter, where the (assigned) operating parameter is an application. Thus, the hop patterns can be selected depending on the application. For example, some hop patterns may only be used for certain message types (e.g., alarms). This also makes it possible to implement QoS for certain services or to allow proprietary extensions of the global hop patterns for a specific network provider.

[0063] This can solve the problem described below. Important or special messages (e.g., alarms) can only be transmitted using the known global hopping patterns with the same probability of success as a normal message. Depending on the message, however, it may be desirable for the transmission to have a higher or lower priority, and thus a higher or lower probability of success, than others. For example, a fire alarm or a vehicle accident notification has a higher priority than others.

[0064] In examples, the hopping pattern used for transmission can be selected on the data transmitter side (or waveform side) depending on the data to be sent.

[0065] In examples, the computing power provided for decoding a hop pattern on the data receiver side can be adjusted according to the priority of the hop pattern. 1.4 Performance-dependent jump patterns

[0066] In examples, the individual hopping pattern may depend on an (inherent) operating parameter of the data transmitter 100, wherein the (inherent) operating parameter of the data transmitter 100 may be a quartz tolerance.

[0067] This can solve the problem described below. A radio transmission system is bound to a predefined frequency channel for regulatory and implementation purposes. Due to tolerances in the quartz crystals used, it is not possible to precisely determine the frequency at which a message is actually transmitted. For this reason, guard bands are often defined in which no transmission takes place, but which are nevertheless used due to the tolerances.

[0068] Fig. 3shows a diagram of a frequency band 150 of a communications system, which is defined by band boundaries 152, as well as a frequency A 154 to be used by a data transmitter 100 for transmission, and a tolerance range 156 around the frequency A 154, within which the transmission of the data transmitter 100 can actually take place due to its quartz tolerance. The ordinate represents the frequency, and the abscissa represents time.

[0069] In other words, Fig. 3 shows a transmission defined at frequency A 154. The actual transmission occurs at a frequency within the range of frequency A ± tolerance (blue range) 156, since a 100% accurate determination is not possible. To remain within the specified band with this offset, a certain margin must be defined 158, which is not intended for transmissions but is large enough to ensure that the band limits 152 are not exceeded with large tolerances.

[0070] In order to utilize the frequency resources as completely as possible, it is desirable to keep the guard bands as narrow as possible, which, however, increases the requirements for the quartz crystals used and thus the costs of the nodes.

[0071] The aforementioned points also occur in telegram splitting radio transmission systems and mean that the larger the permitted tolerance for the nodes of the radio system, the fewer frequency subchannels can be used in the time and frequency hopping patterns.

[0072] This results in smaller tolerance ranges at the edge of the hop pattern for nodes with high accuracy, allowing a wide hop pattern to be defined for these nodes without exceeding the band limits. If the tolerances are larger, it is necessary to increase the tolerance range, which requires a narrower hop pattern to continue transmitting within the band limits. This is possible in Fig. 4illustrated again.

[0073] Fig. 4 shows a diagram of a frequency band of a communication system defined by band boundaries 152, as well as a frequency range 154_1 used by a wide hopping pattern 140_1 and its tolerance range 156_1, and a frequency range 154_2 used by a narrow hopping pattern 140_2 and its tolerance range 156_2. In other words, Fig. 4 shows a comparison of wide and narrow jump patterns caused by different tolerance ranges. The ordinate represents frequency and the abscissa represents time.

[0074] If nodes with a low tolerance use the hopping patterns defined for nodes with a high tolerance, the probability that these nodes will interfere with each other is increased, as they do not fully utilize the tolerance range and thus effectively use fewer frequency resources. This is Fig. 5 shown.

[0075] In detail, Fig. 5 in a diagram a frequency band 150 of a communication system, which is defined by band limits 152, as well as unused frequency ranges 158 of the frequency band which result from a data transmitter 100 with a small tolerance range 156_2 in Fig. 4 shown narrow jump pattern 140_2 is used. In other words, Fig. 5 shows a narrow jump pattern at nodes with low tolerance. The ordinate represents frequency and the abscissa represents time.

[0076] In examples, the hop patterns (or hop sequences) 140 can be adapted to the tolerances of the data transmitters 100 (e.g., nodes).

[0077] This has the advantage that more expensive data transmitters (e.g., nodes) with lower tolerances have access to a larger number of radio channels than cheaper data transmitters (e.g., nodes) with higher tolerances, thus reducing the likelihood of interference between the data transmitters (e.g., nodes). Furthermore, cheaper data transmitters (e.g., nodes) can still operate in the same network. 1.4.1. Jump pattern to compensate for high quartz tolerances

[0078] In examples, the individual hopping pattern 140 may be dependent on an (inherent) operating parameter of the data transmitter 100, wherein the (inherent) operating parameter may be a quartz tolerance of the data transmitter 100, wherein the data transmitter 100 may be configured to determine a maximum range of frequency subchannels of a frequency channel to be used as a function of the quartz tolerance, and to calculate the individual hopping pattern 140 or to select it from a set of hopping patterns such that it lies within the maximum range of frequency subchannels of the frequency channel (or frequency band) to be used.

[0079] For example, for data transmitters 100 (e.g., nodes) with high tolerances, sets of hop patterns can be defined that use a smaller number of subchannels, thus ensuring compliance with the overall channel.

[0080] In examples, the jump pattern 140 used for transmission on the data transmitter side (or waveform side) can be selected depending on the tolerances of the data transmitter 100.

[0081] For example, wide hop patterns with subchannels closer to the edge of band 150 can be selected for data transmitters 100 with small tolerances, while narrow hop patterns with subchannels farther from the edge of band 150 can be selected for data transmitters 100 with large tolerances. 1.4.2. Omission of edge channels for high quartz tolerances

[0082] Data senders (e.g. nodes) with high tolerances should not transmit sub-data packets 142 on the edge subchannels in accordance with their tolerance if they cannot guarantee that the transmission still takes place within the channel due to the quartz tolerance.

[0083] If the hop patterns are selected so that the subchannels are used evenly, only a few subpackets are dropped from the transmission and the error protection used in telegram splitting ensures that the messages from the bad data senders (e.g. nodes) can still be received and reconstructed.

[0084] In examples, on the data transmitter side (or waveform side), the jump pattern 140 used for transmission may be left unused at the edges as far as the tolerances require, depending on the tolerances of the data transmitter 100.

[0085] In examples, the data receiver 110 may be configured to receive hop patterns whose frequency is so greatly shifted by the tolerances of the data transmitter 100 that they actually lie outside the defined band 150. Furthermore, the data receiver 110 may be configured to continue receiving a hop pattern that has been stretched or compressed by the frequency tolerances, for example, by defining additional receive hop patterns that correspond to the distorted version of the original hop pattern. 1.4.3. Puncturing the jump pattern to balance the battery

[0086] In examples, the individual hopping pattern may depend on an (inherent) operating parameter of the data transmitter 100, wherein the (inherent) operating parameter of the data transmitter 100 may be an available transmission energy or an amount of energy that can be provided by an energy supply device (e.g., button cell or energy harvesting element) of the data transmitter 100.

[0087] The data transmitter 100 can be designed to puncture a hop pattern depending on the available transmission energy in order to obtain the individual hop pattern 140.

[0088] For example, the data transmitter 100 (e.g., node) may have a power supply that requires a longer regeneration phase after a transmission on the radio channel than the pause between individual sub-data packets 142 would allow. In this case, the data transmitter 100 (e.g., node) can "punctuate" the time and frequency hopping pattern accordingly in order to maintain the minimum pause required for regeneration. It should be noted that the number of omitted sub-data packets 142 is selected according to the rate of the error protection used so that the decodability of the data is still maintained.

[0089] In examples, the hopping pattern used for transmission on the data transmitter side (or waveform side) can be punctuated in such a way that the pause times between two transmissions allow battery-saving operation. 1.4.4 Frequency-shifted jump pattern

[0090] In examples, the individual hopping pattern 140 may depend on an (inherent) operating parameter of the data transmitter 100, wherein the (inherent) operating parameter may be a frequency offset that the data transmitter imparts to a hopping pattern to obtain the individual hopping pattern 140. The frequency offset may be a random frequency offset.

[0091] If a hop pattern that is too narrow is defined for a node with low tolerances, the problem of unused frequency ranges arises, such as Fig. 5This can be avoided by randomly shifting the frequency of the hop pattern 140 as a whole. The limits of the random frequency shift can be chosen so that the ranges previously unused by the narrow hop pattern are also utilized.

[0092] For later processing in the data receiver 110, it may be advantageous if the random frequency offset used is stored in a portion of the transmitted data. This allows the data receiver to further determine the frequency offset caused by the tolerance. Without this information, this may not be possible, since the data receiver may not know the nominal frequency, without tolerance, at which the data transmitter 100 transmitted. 1.4.5. Over-provisioning jump patterns Puncturing

[0093] In some examples, a hop pattern can also be chosen so that the number of subpackets sent is less than the number of transmissions defined in the hop pattern. This means that hops can be randomly omitted during transmission without negatively affecting the transmission probability, since all sub-data packets are still sent. This allows for increased network capacity, as the random omissions reduce the probability of complete overlap.

[0094] In examples, a hop pattern on the data transmitter side (or waveform side) that defines more hops than sub-data packets are to be sent can be shortened to the required number of hops by random puncturing.

[0095] In some examples, detection on the data receiver side can be continued across all defined jumps, since the puncturing pattern is unknown. An exact determination of the puncturing pattern is possible, for example, by comparing the detection quality of different puncturing patterns. 1.5 Extension jump pattern

[0096] In examples, a further (or second) individual hop pattern may be used for the transmission between data transmitter 100 and data receiver 110, wherein the further (or second) individual hop pattern depends on the (first) individual hop pattern 140 or the operating parameter. The further (or second) individual hop pattern is referred to below as an extension hop pattern, while the (first) individual hop pattern 140 is referred to as a core hop pattern. The core hop pattern may correspond to the individual hop pattern 140 described above.

[0097] The core hop sequence 140 may have a fixed length (fixed number of hops 142) and be used for transmitting data of fixed length, while the extension hop sequence may have a variable length (variable number of hops) and be used for transmitting data of variable length.

[0098] In order to ensure that the benefit from adapting the core jump sequence (= individual jump pattern) is not lost, the special properties of the core jump sequence can be taken into account when generating the extension jump sequence, so that the extension jump sequence also has the above-mentioned advantages in addition to the possibility of transmitting additional data of variable length. 1.5.1. Extension sequence with core hop sequence channels

[0099] In examples, the extension hop sequence may be calculated, adjusted, or selected from a set of hop patterns depending on the core hop sequence such that the extension hop sequence only has frequency subchannels that the core hop sequence also has. The extension hop sequence may have fewer frequency subchannels than the core hop sequence.

[0100] For example, when generating (or forming) the extension hop sequence, only the subchannels used by the core hop sequence 140 can be used. Any missing subchannels are also omitted, as illustrated by the following table: Subchannel Used in core sequence Available for expansion sequence 0 No No 1 Yes Yes 2 Yes Yes 3 Yes Yes 4 No No 5 Yes Yes 6 Yes Yes 7 No No 8 No No 9 Yes Yes 10 No No 11 Yes Yes 12 No No

[0101] For generation, for example, a pseudorandom number can be created for each sub-data packet, and the resulting number can be limited to the corresponding number of subchannels using the modulo operation. The random number can be known to the data receiver 110 through the core hop sequence 140, as can the method for random number generation.

[0102] In examples, only the subchannels of the core hop sequence 140 can be used for the extension hop sequence on the data transmitter side.

[0103] In examples, the expected sub-data packets of the extension hop sequence can be adapted accordingly on the data receiver side. 1.5.2. Extension sequence within the core sequence boundaries

[0104] In examples, the extension hopping sequence may be calculated, adjusted, or selected from a set of hopping patterns depending on the core hopping sequence such that the extension hopping sequence also includes frequency subchannels that the core hopping sequence does not include.

[0105] For example, when generating (or forming) the extension hop sequence, (all) subchannels can be used for the extension hop sequence which are less than or equal to the highest used frequency subchannel of the core hop sequence and greater than or equal to the lowest used frequency subchannel of the core hop sequence, as is illustrated by the following table: Subchannel Used in core sequence Available for expansion sequence 0 No No 1 Yes Yes 2 Yes Yes 3 Yes Yes 4 No Yes 5 Yes Yes 6 Yes Yes 7 No Yes 8 No Yes 9 Yes Yes 10 No Yes 11 Yes Yes 12 No No

[0106] For example, a pseudorandom number can be generated for each sub-data packet, and the resulting number can be restricted to the corresponding number of sub-frequency channels using the modulo operation. The random number can be known to the data receiver through the kernel hopping sequence, as can the method for random number generation.

[0107] In examples, only the subchannels that are not used for the core hop sequence 140 can be used for the extension hop sequence on the data transmitter side.

[0108] In examples, the expected sub-data packets of the extension hop sequence can be adapted accordingly on the data receiver side. 1.6. Further examples

[0109] Fig. 6shows a flowchart of a method 160 for transmitting a signal, according to an example. The method 160 includes a step 162 of transmitting the signal, wherein the signal has an individual hop pattern, wherein the individual hop pattern depends on a transmitter-side operating parameter.

[0110] Fig. 7 shows a flowchart of a method 170 for receiving 172 a signal, according to an example. The method 170 includes a step of receiving the signal, wherein the signal has an individual hopping pattern, wherein the individual hopping pattern depends on a transmitter-side operating parameter.

[0111] Fig. 81 shows a flowchart of a method 180 for transmitting data according to a hop pattern, according to an example. The method 180 includes a step 182 of selecting a subset of hops from a plurality of hops of the hop pattern, wherein the subset of hops is selected from the plurality of hops randomly or depending on an operating parameter. Furthermore, the method 180 includes a step 184 of transmitting the data in the selected hops of the hop pattern.

[0112] Fig. 9 shows a flowchart of a method 190 for receiving data according to a hop pattern, according to an example. The method 190 includes a step 192 of receiving the data, wherein the data is transmitted only in selected hops of a plurality of hops of the hop pattern, wherein the hops are selected randomly or depending on an operating parameter. 2. Generation of jump patterns

[0113] Examples of a method for generating jump patterns are described in more detail below.

[0114] Fig. 10 shows a flowchart of a method 200 for generating jump patterns, according to an example. The method 200 comprises a step 202 of randomly generating a plurality of jump patterns, wherein the jump patterns have at least two jumps distributed in frequency and time. The method 200 further comprises a step 204 of selecting the jump patterns from the plurality of jump patterns whose autocorrelation functions have predetermined autocorrelation properties in order to obtain jump patterns with predetermined autocorrelation properties.

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

[0116] In examples, those jump patterns can satisfy the specified autocorrelation properties if their partial sum, calculated over a specified number of largest amplitude values ​​of the respective autocorrelation function, is less than a specified threshold. The threshold can be chosen such that at least two jump patterns (or a specified number of jump patterns) satisfy the specified autocorrelation properties.

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

[0118] In examples, those jump patterns can satisfy the given cross-correlation properties whose partial sums, formed over a given number of largest amplitude values ​​of the respective cross-correlation function, are the smallest. 2.1 Generation of jump patterns for TSMA

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

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

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

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

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

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

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

[0126] The start time T 0 a frame 120 with the total duration T-Frame is randomly selected by the sensor node 100 due to the asynchronous transmission. The time duration T Burst of a burst 142 can vary, is assumed to be constant in the following without loss of generality, whereas the time intervals tn ,(n+1) , which each represent the distance between two adjacent burst centers (here the two bursts with the indices n and n+1) are random variables that are all within a predefined range T A_min ≤ tn,(n+1) ≤ T A_max for n ∈ {1,2,...,N} lay. N The number of bursts 142 within a frame is 120. The frequencies used for transmission are assumed to be in the form of discrete frequency channels, which are located in a given frequency channel grid. The frequency separation fn,(n+1) between 2 bursts 142 is a multiple of the TSMA carrier spacing BC .

[0127] The number of available frequency channels is L given and N ≤ L. In this respect, there are more or exactly as many frequency channels available as the N Bursts 142 are needed and within a frame 120 each of the N Bursts 142 in another frequency channel.

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

[0129] Regarding the design of one or more TSMA patterns, the following system-related restrictions can be observed: (1) The frequency deviation of the oscillator from its nominal frequency can be taken into account. Depending on the system parameters and hardware requirements, the frequency deviation can be several times the carrier spacing. Since this frequency offset can take on both positive and negative values, a safety strip 156 of S Frequency channel in which there is no burst (see also Fig. 12). In this respect, the degree of freedom for the individual bursts of the jump pattern is reduced to (L-2·S) Frequencies, although still N ≤ ( L-2·S) (2) Due to the temporally asynchronous transmission, the receiver 110 does not know when a transmitter 100 is transmitting, and the receiver also does not know which transmitter is transmitting. Therefore, detecting a signal would involve considerable additional effort if the pattern arrangement, i.e. the grouping of the N Bursts 142 within the time range T-Frame and about the (L-2·S) frequencies would be completely random. In this respect, for example, C consecutive bursts 142 are combined into a so-called cluster 148, which are, for example, identical in terms of their time and frequency intervals relative to each other. A jump pattern 140 thus consists of N / C Cluster 148 with each CBursts 142. C can advantageously be chosen so that it is an integer divisor of N So it is N / C N ⇔ ∃ k ∈ ℤ : k ⋅ N / C = N . . Details will be Fig. 12 However, it should be mentioned here that a jump pattern structure consisting of N / C Clusters 148, which are completely identical in their internal structure, have certain disadvantages regarding their correlation properties (occurrence of strongly pronounced secondary maxima with an amplitude of N / C in the 2D autocorrelation function. All first bursts 142 in the N / C Clusters have an identical repetition pattern with a different frequency (and possibly also a different time). N / CBurst 142 interfere with each other. However, this disadvantage can be accepted in view of the simplifications it can achieve in the receiver. A cluster size of C=1 (and thus no cluster) is always most advantageous with regard to the correlation properties. (3) Due to telegram splitting, the time duration T Burst of a burst 142 is relatively short in relation to the transmission time of the entire frame 120. If a certain minimum time is allowed after the transmission of the first burst 142 T A_min This can have certain advantages regarding the power consumption of the battery-operated sensor nodes (battery recovery time after a comparatively energy-intensive transmission process). This minimum distance T A_min should be adhered to as a design specification within the clusters as far as possible.

[0130] Taking into account the limitations listed above, the Fig. 12 shown structure of a TSMA pattern 142.

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

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

[0133] This results in the degrees of freedom described below regarding frequency channel allocation. Since the three bursts in the eight clusters can each have the same frequency spacing relative to each other, at least eight additional frequency bands can be reserved, leaving a maximum of 28 frequency bands for the base assignment of the three bursts. For example, any relative assignment can be made with three different frequency bands. The largest possible frequency deviation for neighboring bursts, as is the case with the base assignments (1, 28, 14) or (1, 24, 12), proves advantageous for later optimizations. The assignment of the individual clusters to one another can also be random.For example, the sequence of the numbers {1,2,3,4,5,6,7,8} can be arbitrarily permuted with each other (Matlab command: randperm(8)) and these 8 different values ​​can each be added with the base assignment to obtain the frequency assignment of the bursts in the 8 clusters.

[0134] This results in the degrees of freedom described below regarding the time intervals. Here, both the two time intervals between the three bursts of the clusters and the seven time intervals between the eight clusters must be determined. A certain minimum time T A_min should not be undercut. An upper time limit T A_max results from the specification of the frame duration T-Frame The time intervals can also be determined by rolling the dice (Matlab command: ΔT = T A_min + (T A_max -T A_min )·rand(7,1)).

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

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

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

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

[0139] Since the oscillator frequency error per participant can, by definition, amount to a maximum deviation of S frequency channels, the frequency index extends f in the AKF of -2S until +2S. The time index t runs from -T Frame until T-Frame, in steps of T Ffame / TA .The AKF dimension of Theta x, x is therefore (4S+1) x (2M+1).

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

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

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

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

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

[0145] If different sets of jump patterns 142 are to be searched, the first design step can be repeated with a new set of parameters. For example, it may be desirable to generate multiple sets of jump patterns with different oscillator deviations and optimize them together. Different oscillator deviations result in different safety bands. S, This changes the degree of freedom of the possible burst occupancy. Therefore, some parameters within the ACF calculation also change.

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

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

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

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

[0150] In detail, Fig. 15 a flowchart of a method 260 for generating jump patterns, according to an example.

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

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

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

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

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

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

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

[0158] In a seventh step 274, it can be checked whether an optimal number P Optimal of jump patterns is available.

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

[0160] In an eighth step 276, it is determined whether another set of jump patterns should be generated for a different parameter set (e.g., a different oscillator offset). If so, the second step 264 is repeated. If not, the method continues.

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

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

[0163] In an eleventh step 282 P Selection Jump patterns new and random from the P Optimal existing jump patterns. P Optimal different numbers are thrown in random order, F = randperm(1: P Optimal ). Of these, the first P Selection of which are selected, Pattern Selection = F(1: P Selection ). Pattern selection The total sum GS can then be calculated from the individual subtotals SUM KKF , in the matrix O vKKF are calculated.

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

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

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

[0167] In the following, two exemplary jump patterns are described that were generated using the above-mentioned method. Jump pattern 1

[0168] A first hop pattern is a combination of a time hop pattern and a frequency hop pattern for node 100 with a quartz tolerance of + / - 20 ppm or better, where the time hop pattern is one of the eight time hop patterns with 24 hops each listed in the following table: wherein in the table each row is a time hopping pattern, wherein in the table each column is a hop of the respective time hopping pattern starting from a second hop, so that each time hopping pattern has 24 hops, wherein in the table each cell indicates a time interval between a center of the respective hop and a center of an immediately following hop in (preferably multiples of) symbol durations; wherein 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 row is a frequency hopping pattern, where in the table each column is a hop of the respective frequency hopping pattern, where in the table each cell indicates a transmission frequency of the respective hop of the respective frequency hopping pattern in carriers from UCG_C0 to UCG_C23. Jump pattern 2

[0169] A second hop pattern is a combination of a time hop pattern and a frequency hop pattern for node 100 with a quartz tolerance of + / - 10 ppm or better, where the time hop pattern is one of the eight time hop patterns with 24 hops each listed in the following table: wherein in the table each row is a time hopping pattern, wherein in the table each column is a hop of the respective time hopping pattern starting from a second hop, so that each time hopping pattern has 24 hops, wherein in the table each cell indicates a time interval between a center of the respective hop and a center of an immediately following hop in (preferably multiples of) symbol durations; wherein 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 row is a frequency hopping pattern, where in the table each column is a hop of the respective frequency hopping pattern, where in the table each cell indicates a transmission frequency of the respective hop of the respective frequency hopping pattern in carriers from UCG_C0 to UCG_29. Jump pattern 3

[0170] A first hop pattern is a combination of a time hop pattern and a frequency hop pattern for node 100 with a quartz tolerance of + / - 20 ppm or better, where the time hop pattern is one of the eight time hop patterns with 18 hops each listed in the following table: Pattern number r # of sub-data packets in the core frame SC 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 1 47 1 59 5 59 4 49 6 54 5 44 5 44 0 53 5 60 1 52 2 43 0 54 5 51 9 43 9 48 4 43 8 60 5 2 51 2 42 4 64 9 44 7 55 0 61 1 62 4 41 8 50 1 46 4 60 6 50 9 63 6 44 3 46 5 43 4 43 1 3 62 5 54 8 54 0 43 4 52 0 55 9 48 8 53 1 50 1 46 5 45 9 42 8 44 4 45 9 50 5 45 9 63 3 4 45 7 48 9 61 2 45 0 45 7 44 0 56 7 53 8 51 6 51 4 54 0 47 4 59 2 44 5 57 7 44 4 49 3 5 48 8 64 3 62 6 54 1 56 0 55 0 45 0 47 5 52 0 45 6 61 8 44 7 45 5 44 0 45 5 51 0 47 7 6 54 8 44 4 45 9 52 9 45 3 52 5 44 0 55 3 58 3 52 7 52 0 46 1 57 5 45 7 46 4 53 3 42 1 7 46 1 60 7 50 1 53 4 50 5 56 9 56 1 47 2 50 9 45 0 55 5 44 0 42 3 49 4 44 8 52 5 48 5 8 57 7 61 1 46 4 55 2 45 1 50 8 47 8 43 8 44 3 50 7 42 0 55 3 52 0 57 6 58 0 56 4 40 4 wherein in the table each row is a time jump pattern, wherein 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 18 jumps, wherein in the table each cell indicates a time distance of a center of the respective jump to a center 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 18 hops each listed in the following table: Sample number # of sub-data packets in the core frame SC 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 1 19 18 12 21 15 14 22 2 5 10 17 6 8 4 7 20 13 0 2 10 4 1 7 23 6 3 8 17 2 18 9 22 14 11 16 5 21 3 0 16 11 20 9 13 23 21 2 19 1 15 3 7 12 4 22 6 4 14 9 0 15 7 5 8 18 1 12 19 23 17 16 10 2 13 11 5 6 12 19 10 4 22 13 17 11 5 23 3 1 8 14 0 9 20 6 16 20 3 5 21 10 17 1 12 18 15 11 0 9 2 14 6 8 7 15 0 8 18 9 23 11 20 14 3 16 22 19 13 7 21 12 4 8 4 7 16 22 13 19 2 3 6 15 10 20 23 5 21 17 18 1 where in the table each row is a frequency hopping pattern, where in the table each column is a hop of the respective frequency hopping pattern, where in the table each cell indicates a transmission frequency of the respective hop of the respective frequency hopping pattern in carriers from UCG_C0 to UCG_23. Jump pattern 4

[0171] A second hop pattern is a combination of a time hop pattern and a frequency hop pattern for node 100 with a quartz tolerance of + / - 10 ppm or better, where the time hop pattern is one of the eight time hop patterns with 18 hops each listed in the following table: Pattern number r # of sub-data packets in the core frame SC 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 1 44 2 45 5 58 6 52 0 43 6 48 5 50 6 44 6 59 0 45 9 63 7 46 6 59 7 44 5 47 1 41 9 54 7 2 44 7 59 4 45 9 51 2 57 7 49 0 51 0 50 0 57 6 58 1 51 2 44 1 48 3 50 7 46 7 44 7 61 2 3 52 5 44 6 42 8 45 0 43 4 44 5 45 7 56 3 47 0 53 7 52 9 52 7 53 7 51 3 42 8 52 5 62 0 4 62 6 46 7 45 0 54 4 56 4 50 5 45 0 64 5 45 7 42 3 43 3 43 9 55 9 54 7 44 9 64 1 50 8 5 59 0 59 2 42 3 54 4 44 4 55 3 47 5 43 1 45 2 55 1 45 4 45 9 45 0 51 2 49 9 53 2 44 7 6 47 6 42 0 51 6 42 2 55 8 48 3 47 4 46 2 47 4 45 8 52 9 59 6 56 2 41 9 41 7 60 0 63 4 7 50 0 46 2 60 1 48 4 55 6 59 1 42 3 42 9 54 0 52 3 53 0 60 6 58 9 45 9 41 5 41 9 60 6 8 42 2 47 3 45 8 53 5 42 0 42 3 50 2 42 5 60 2 47 2 55 5 65 0 50 9 57 9 59 5 51 0 56 8 wherein in the table each row is a time jump pattern, wherein 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 18 jumps, wherein in the table each cell indicates a time distance of a center of the respective jump to a center 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 18 hops each listed in the following table: Sample number # of sub-data packets in the core frame SC 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 1 2 14 16 18 0 26 21 9 6 28 5 24 22 29 17 27 13 12 2 23 7 19 15 8 3 1 11 10 20 25 4 6 9 14 17 5 0 3 10 23 11 2 25 22 4 24 27 8 16 15 1 18 28 7 21 26 4 12 13 29 20 3 19 26 15 1 21 27 6 17 14 4 2 25 7 5 19 22 12 13 11 28 23 18 16 0 10 24 3 5 29 20 8 9 6 16 12 18 25 19 23 20 4 5 6 9 27 21 10 15 28 24 13 7 14 29 26 11 22 2 0 1 7 3 8 9 23 4 27 16 15 17 8 0 24 28 3 29 5 14 8 18 22 20 17 10 6 26 11 21 12 where in the table each row is a frequency hopping pattern, where in the table each column is a hop of the respective frequency hopping pattern, where in the table each cell indicates a transmission frequency of the respective hop of the respective frequency hopping pattern in carriers from UCG_C0 to UCG_29.

[0172] If a jump is generally specified in multiples of symbol durations, this preferably refers to an integer multiple of the symbol durations or to a fraction of a symbol duration. 3. Further examples

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

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

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

[0176] Depending on specific implementation requirements, embodiments of the invention may be implemented in hardware or software. The implementation may be performed using a digital storage medium, such as a floppy disk, a DVD, a Blu-ray Disc, a CD, a ROM, a PROM, an EPROM, an EEPROM, or a FLASH memory, a hard disk, or other magnetic or optical storage device storing electronically readable control signals that can interact or cooperate with a programmable computer system to perform the respective method. Therefore, the digital storage medium may be computer-readable.

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

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

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

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

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

[0182] A further embodiment of the method according to the invention is thus a data carrier (or a digital storage medium or a computer-readable medium) on which the computer program for performing one of the methods described herein is recorded. The data carrier, the digital storage medium, or the computer-readable medium is typically physical and / or non-perishable or non-transient.

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

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

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

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

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

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

[0189] 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).

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

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

[0192] The above-described embodiments are merely illustrative of the principles of the present invention. It is understood that modifications and variations of the arrangements and details described herein will be apparent to others 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 in the description and explanation of the embodiments herein. List of abbreviations

[0193] C :Number of bursts that form a cluster L :Number of available frequency bands N :Number of bursts that make up a frame N threshold Amplitude threshold for AKF candidate generation P Selection Number of jump patterns optimizing 2D-AKF and KKF properties S:Number of frequency bands that may not contain bursts due to oscillator frequency errors as a safety strip T A :Sampling rate of the time axis T Burst :Duration of a burst T-Frame :Duration of a frame TSMA:Telegram Splitting Multiple Access TSMA pattern:Jump pattern of a frame in the time and frequency domain X Matrix with time and frequency information of the jump patterns Θ x,x 2D autocorrelation function (2D-AKF) Θ x,y 2D cross-correlation function (2D-CCF)

Claims

1. Method for transmitting a signal from a data transmitter to a data receiver, the method comprising: transmitting a signal with a hopping pattern; wherein the hopping pattern is a time hopping pattern, a frequency hopping pattern, or a combination of the time hopping pattern and the frequency hopping pattern; wherein the time hopping pattern is one of the following eight time hopping patterns having 24 hops each: wherein each line in the table is a time hopping pattern, wherein each column in the table is a hop of the respective time hopping pattern starting from a second hop so that each time hopping pattern comprises 24 hops, wherein each cell in the table indicates a temporal interval of a reference point of the respective hop to a same reference point of an immediately subsequent hop in symbol durations or multiples of symbol durations; wherein the frequency hopping pattern is one of the following eight frequency hopping patterns having 24 hops each: wherein each line in the table is a frequency hopping pattern, wherein each column in the table is a hop of the respective frequency hopping pattern, wherein each cell in the table indicates a transmission frequency of the respective hop of the respective frequency hopping pattern in carriers (UCG_C0-UCG_23). wherein the signal is transmitted by a node comprising a quartz tolerance of + / - 20 ppm or better.

2. Method for transmitting a signal from a data transmitter to a data receiver, the method comprising: transmitting a signal with a hopping pattern; wherein the hopping pattern is a time hopping pattern, a frequency hopping pattern, or a combination of the time hopping pattern and the frequency hopping pattern; wherein the time hopping pattern is one of the following eight time hopping patterns having 24 hops each: wherein each line in the table is a time hopping pattern, wherein each column in the table is a hop of the respective time hopping pattern starting from a second hop so that each time hopping pattern comprises 24 hops, wherein each cell in the table indicates a temporal interval of a reference point of the respective hop to a same reference point of an immediately subsequent hop in symbol durations or multiples of symbol durations; wherein the frequency hopping pattern is one of the following eight frequency hopping patterns having 24 hops each: wherein each line in the table is a frequency hopping pattern, wherein each column in the table is a hop of the respective frequency hopping pattern, wherein each cell in the table indicates a transmission frequency of the respective hop of the respective frequency hopping pattern in carriers (UCG_C0-UCG_C29). wherein the signal is transmitted by a node comprising a quartz tolerance of + / - 10 ppm or better.

3. Method according to any of the preceding claims 1 to 2, wherein a data packet is transmitted divided into a plurality of sub-data packets according to the hopping pattern so that a sub-data packet of the plurality of sub-data packets is transmitted in each hop of the hopping pattern.

4. Method according to any of the preceding claims 1 to 2, wherein the hopping pattern is a combination of the time hopping pattern and the frequency hopping pattern; wherein the time hopping pattern and the frequency hopping pattern comprise the same line number in the respective table.

5. Method for receiving a signal with a data receiver, the method comprising: receiving a signal having a hopping pattern; wherein the hopping pattern is a time hopping pattern, a frequency hopping pattern, or a combination of the time hopping pattern and the frequency hopping pattern; wherein the time hopping pattern is one of the following eight time hopping patterns having 24 hops each: wherein each line in the table is a time hopping pattern, wherein each column in the table is a hop of the respective time hopping pattern starting from a second hop so that each time hopping pattern comprises 24 hops, wherein each cell in the table indicates a temporal interval of a reference point of the respective hop to a same reference point of an immediately subsequent hop in symbol durations or multiples of symbol durations; wherein the frequency hopping pattern is one of the following eight frequency hopping patterns having 24 hops each: wherein each line in the table is a frequency hopping pattern, wherein each column in the table is a hop of the respective frequency hopping pattern, wherein each cell in the table indicates a transmission frequency of the respective hop of the respective frequency hopping pattern in carriers (UCG_C0-UCG_C23), wherein the signal is received from a node comprising a quartz tolerance of + / - 20 ppm or better.

6. Method for receiving a signal with a data receiver, the method comprising receiving a signal having a hopping pattern; wherein the hopping pattern is a time hopping pattern, a frequency hopping pattern, or a combination of the time hopping pattern and the frequency hopping pattern; wherein the time hopping pattern is one of the following eight time hopping patterns having 24 hops each: wherein each line in the table is a time hopping pattern, wherein each column in the table is a hop of the respective time hopping pattern starting from a second hop so that each time hopping pattern comprises 24 hops, wherein each cell in the table indicates a temporal interval of a reference point of the respective hop to a same reference point of an immediately subsequent hop in symbol durations or multiples of symbol durations; wherein the frequency hopping pattern is one of the following eight frequency hopping patterns having 24 hops each: wherein each line in the table is a frequency hopping pattern, wherein each column in the table is a hop of the respective frequency hopping pattern, wherein each cell in the table indicates a transmission frequency of the respective hop of the respective frequency hopping pattern in carriers of (UCG_C0-UCG_C29), wherein the signal is received from a node comprising a quartz tolerance of + / - 10 ppm or better.

7. Method for transmitting a signal from a data transmitter to a data receiver, the method comprising: transmitting a signal with a hopping pattern; wherein the hopping pattern is a time hopping pattern, a frequency hopping pattern, or a combination of the time hopping pattern and the frequency hopping pattern; wherein the time hopping pattern is one of the following eight time hopping patterns having 18 hops each: Pattern number# of sub-data packets in the core frame SC123456789101112131415161714715955944965454454405356015224305455194394844386052512424649447550611624418501464606509636443465434431362554854043452055948853150146545942844445950545963344574896124504574405675385165145404745924455774444935488643626541560550450475520456618447455440455510477654844445952945352544055358352752046157545746453342174616075015345055695614725094505554404234944485254858577611464552451508478438443507420553520576580564404 wherein each line in the table is a time hopping pattern, wherein each column in the table is a hop of the respective time hopping pattern starting from a second hop so that each time hopping pattern comprises 18 hops, wherein each cell in the table indicates a temporal interval of a reference point of the respective hop to a same reference point of an immediately subsequent hop in symbol durations or multiples of symbol durations; wherein the frequency hopping pattern is one of the following eight frequency hopping patterns having 18 hops each: Pattern number# of sub-data packets in the core frame SC12345678910111213141516171811918122115142225101768472013021041723638172189221411165213016112091323212191153712422641490157581811219231716102131156121910422131711523318140920616203521101711218151109214687150818923112014316221913721124847162213192361510202352117181 wherein each line in the table is a frequency hopping pattern, wherein each column in the table is a hop of the respective frequency hopping pattern, wherein each cell in the table indicates a transmission frequency of the respective hop of the respective frequency hopping pattern in carriers (UCG_C0-UCG_23). wherein the signal is transmitted by a node comprising a quartz tolerance of + / - 20 ppm or better.

8. Method for transmitting a signal from a data transmitter to a data receiver, the method comprising: transmitting a signal according to a hopping pattern; wherein the hopping pattern is a time hopping pattern, a frequency hopping pattern, or a combination of the time hopping pattern and the frequency hopping pattern; wherein the time hopping pattern is one of the following eight time hopping patterns having 18 hops each: Pattern number# of sub-data packets in the core frame SC123456789101112131415161714424555865204364855064465904596374665974454714195472447594459512577490510500576581512441483507467447612352544642845043444545756347053752952753751342852562046264674505445645054506454574234334395595474496415085590592423544444553475431452551454459450512499532447647642051642255848347446247445852959656241941760063475004626014845565914234295405235306065894594154196068422473458535420423502425602472555650509579595510568 wherein each line in the table is a time hopping pattern, wherein each column in the table is a hop of the respective time hopping pattern starting from a second hop so that each time hopping pattern comprises 18 hops, wherein each cell in the table indicates a temporal interval of a reference point of the respective hop to a same reference point of an immediately subsequent hop in - preferably multiples of - symbol durations; wherein the frequency hopping pattern is one of the following eight frequency hopping patterns having 18 hops each: Pattern number# of sub-data packets in the core frame SC123456789101112131415161718121416180262196285242229172713122237191583111102025469141750310231122522424278161511828721264121329203192615121276171442257519221213112823181601024352920896161218251923204569272110152824137142926112220173892342716151780242832951481822201710626112112 wherein each line in the table is a frequency hopping pattern, wherein each column in the table is a hop of the respective frequency hopping pattern, wherein each cell in the table indicates a transmission frequency of the respective hop of the respective frequency hopping pattern in carriers (UCG_C0-UCG_C29). wherein the signal is transmitted by a node comprising a quartz tolerance of + / - 10 ppm or better.

9. Method according to any of the preceding claims 7 to 8, wherein a data packet is transmitted divided into a plurality of sub-data packets according to the hopping pattern so that a sub-data packet of the plurality of sub-data packets is transmitted in each hop of the hopping pattern.

10. Method according to any of the preceding claims 7 to 9, wherein the hopping pattern is a combination of the time hopping pattern and the frequency hopping pattern, wherein the time hopping pattern and the frequency hopping pattern comprise the same line number in the respective table.

11. Method for receiving a signal with a data receiver, the method comprising: receiving a signal having a hopping pattern; wherein the hopping pattern is a time hopping pattern, a frequency hopping pattern, or a combination of the time hopping pattern and the frequency hopping pattern; wherein the time hopping pattern is one of the following eight time hopping patterns having 18 hops each: Pattern Number# of sub-data packets in the core frame SC123456789101112131415161714715955944965454454405356015224305455194394844386052512424649447550611624418501464606509636443465434431362554854043452055948853150146545942844445950545963344574896124504574405675385165145404745924455774444935488643626541560550450475520456618447455440455510477654844445952945352544055358352752046157545746453342174616075015345055695614725094505554404234944485254858577611464552451508478438443507420553520576580564404 wherein each line in the table is a time hopping pattern, wherein each column in the table is a hop of the respective time hopping pattern starting from a second hop so that each time hopping pattern comprises 18 hops, wherein each cell in the table indicates a temporal interval of a reference point of the respective hop to a same reference point of an immediately subsequent hop in symbol durations or multiples of symbol durations; wherein the frequency hopping pattern is one of the following eight frequency hopping patterns having 18 hops each: Pattern Number# of sub-data packets in the core frame SC12345678910111213141516171811918122115142225101768472013021041723638172189221411165213016112091323212191153712422641490157581811219231716102131156121910422131711523318140920616203521101711218151109214687150818923112014316221913721124847162213192361510202352117181 wherein each line in the table is a frequency hopping pattern, wherein each column in the table is a hop of the respective frequency hopping pattern, wherein each cell in the table indicates a transmission frequency of the respective hop of the respective frequency hopping pattern in carriers (UCG_C0-UCG_C23), wherein the signal is received from a node comprising a quartz tolerance of + / - 20 ppm or better.

12. Method for receiving a signal with a data receiver, the method comprising: receiving a signal having a hopping pattern; wherein the hopping pattern is a time hopping pattern, a frequency hopping pattern, or a combination of the time hopping pattern and the frequency hopping pattern; wherein the time hopping pattern is one of the following eight time hopping patterns having 18 hops each: Pattern number# of sub-data packets in the core frame SC123456789101112131415161714424555865204364855064465904596374665974454714195472447594459512577490510500576581512441483507467447612352544642845043444545756347053752952753751342852562046264674505445645054506454574234334395595474496415085590592423544444553475431452551454459450512499532447647642051642255848347446247445852959656241941760063475004626014845565914234295405235306065894594154196068422473458535420423502425602472555650509579595510568 wherein each line in the table is a time hopping pattern, wherein each column in the table is a hop of the respective time hopping pattern starting from a second hop so that each time hopping pattern comprises 18 hops, wherein each cell in the table indicates a temporal interval of a reference point of the respective hop to a same reference point of an immediately subsequent hop in symbol durations or multiples of symbol durations; wherein the frequency hopping pattern is one of the following eight frequency hopping patterns having 18 hops each: Pattern Number# of sub-data packets in the core frame SC123456789101112131415161718121416180262196285242229172713122237191583111102025469141750310231122522424278161511828721264121329203192615121276171442257519221213112823181601024352920896161218251923204569272110152824137142926112220173892342716151780242832951481822201710626112112 wherein each line in the table is a frequency hopping pattern, wherein each column in the table is a hop of the respective frequency hopping pattern, wherein each cell in the table indicates a transmission frequency of the respective hop of the respective frequency hopping pattern in carriers (UCG_C0-UCG_C29), wherein the signal is received from a node comprising a quartz tolerance of + / - 20 ppm or better.