Data transceiver for transmitting and / or receiving data using pseudo-random hopping pattern

Abstract

Embodiments provide a transceiver of a wireless communication network wherein the transceiver is configured to transmit and / or receive data [e.g., telegrams] using a hopping pattern defining a sequence of moments relative to a periodic time grid, the transceiver is configured to determine [e.g., generate or calculate] a hopping pattern by determining a time offset between a moment of at least one moment block of the sequence of moments and a corresponding grid position of the periodic time grid using a first determination function and a second determination function, a first determination function specifies a pseudo-random distribution of time distances between immediately following / consecutive moments of the time block between a predefined minimum time distance and a predefined maximum time distance, a second determination function specifies that a time offset between the time of the time block and the corresponding grid location is within a corresponding time offset range around the corresponding grid location, the time offset range being defined by a time offset limiting function, each time offset range defines a maximum allowable offset of a respective moment of time of the hopping pattern towards a respective grid position of the periodic grid, in which, if a determination is made that the moment of time specified by the first determination function is not within a respective time offset range of the time distance limiting function specified by the second determination function, the maximum allowable offset of the respective moment of time of the hopping pattern towards the respective grid position of the periodic grid. The moments in time are mapped into respective time offset ranges of a time offset limit function [e.g., shifted to the closest edge or reflected to].

Description

Technical Field

[0001] Embodiments of the present invention relate to a data transceiver, and more particularly, to a data transceiver configured to transmit and / or receive data using a pseudo-random hopping pattern. Some embodiments relate to a transceiver configured to generate a hopping pattern having an almost uniform time jitter and a bounded time difference. Background Art

[0002] In an unlicensed frequency band, such as the ISM band (ISM = Industrial, Scientific and Medical), uncoordinated wireless communication systems compete for the same spectrum. [1] proposes a low-power wide area network in which messages (such as telegrams or data packets) are divided into a plurality of sub-packets (or sub-data packets), which are transmitted non-concurrently / discontinuously over a radio channel to reduce the probability of a complete collision with interference occurrence, which would result in the loss of the original message. Therefore, an appropriate error correction code is employed to compensate for individual sub-packet collisions. However, burst collisions involving multiple consecutive sub-packets must be avoided because they may still result in the loss of the entire message. Summary of the Invention

[0003] Accordingly, it is an object of the present invention to reduce the probability of collisions involving multiple consecutive sub-packets from multiple networks covering at least partially overlapping regions.

[0004] This object is solved by the independent claims.

[0005] Advantageous embodiments are set out in the dependent claims.

[0006] An embodiment provides a transceiver of a wireless communication network, wherein the transceiver is configured to send and / or receive data [e.g., telegrams] using a hopping pattern that defines a sequence of instants (or moments, or time instances, or time points) relative to a periodic grid, and wherein the transceiver is configured to determine [e.g., generate or compute] the hopping pattern by considering a first determination constraint and a second determination constraint to determine the time distance [e.g., time delay, time difference] between immediately consecutive instants of the sequence of instants, [e.g., such that the instants are pseudo-randomly distributed over time], wherein the first determination constraint specifies that the time distance is pseudo-randomly distributed between a predefined minimum time distance and a predefined maximum time distance, and wherein the second determination constraint specifies that the time distance lies within a respective time range defined by a time distance [e.g., offset] limiting function, each time range defining a maximum allowed distance [e.g., offset] of the respective instant of the hopping pattern towards a respective grid position of the periodic grid, and wherein, in the case where an instant specified by the first determination constraint is not within the respective time range of the time distance limiting function specified by the second determination constraint, the instant is mapped to [e.g., shifted to the closest edge or reflected into] the respective time range of the time distance limiting function specified by the second determination constraint.

[0007] In an embodiment, the time range defined by the time distance limiting function is equal to or less than the distance between two immediately succeeding grid positions of the periodic grid.

[0008] In an embodiment, the time range defined by the time distance limiting function has at least two different sizes.

[0009] In an embodiment, a proper subset of the time range defined by the time distance limiting function is less than the difference between the predefined maximum time distance and the predefined minimum time distance.

[0010] In an embodiment, the time distance is bounded [or limited] by the time range defined by the time distance limiting function to meet a synchronization enabling criterion, wherein the synchronization enabling criterion specifies that every i-th instant in the sequence of instants lies

[0011] - at the respective grid position of the periodic time grid [e.g., respective time range = 0], or

[0012] - within a predefined time span around the respective grid position of the periodic time grid [e.g., respective time range = predefined time span], or

[0013] - within a predefined time span having a predefined offset towards the respective grid position of the periodic time grid,

[0014] wherein i is equal to or greater than 5.

[0015] In an embodiment, the transceiver is configured to synchronize with a hopping pattern based on a synchronization enabling criterion.

[0016] In an embodiment, the predefined time span is at least two times smaller than the difference between the predefined maximum time distance and the predefined minimum time distance.

[0017] In an embodiment, the sequence of moments is grouped into [e.g., immediately succeeding] moment blocks, where the time ranges defined by a time distance limiting function are grouped into time range blocks, and the time range blocks correspond to the respective moment blocks.

[0018] In an embodiment, the time ranges located at the start and / or end of a time range block limit the positions of the respective moments to meet the synchronization enabling criterion.

[0019] In an embodiment, the synchronization enabling criterion specifies that the respective moment is located

[0020] - at the respective grid position of a periodic time grid,

[0021] - within a predefined time span around the respective grid position of a periodic time grid, or

[0022] - within a predefined time span having a predefined offset towards the respective grid position of a periodic time grid.

[0023] In an embodiment, the time ranges located at the start and / or end of a time range group of a time distance limiting function are smaller than the time range located at the center of the time range group.

[0024] In an embodiment, the time ranges located at the start and / or end of a time range group define a smaller maximum allowed distance for the respective moment of the hopping pattern towards the respective grid position of the periodic grid than the time range located at the center of the time range group.

[0025] In an embodiment, each moment block includes at least five moments [e.g., or at least 10, 20, or 30 moments, such as 36 moments].

[0026] A further embodiment provides a transceiver for a wireless communication network, wherein the transceiver is configured to send and / or receive data [e.g., telegrams] using a hopping pattern, the hopping pattern defining a sequence of instants relative to a periodic time grid, wherein the transceiver is configured to determine [e.g., generate or calculate] the hopping pattern by determining a time offset between at least an instant block of the sequence of instants and a corresponding grid position of the periodic time grid using a first determination function and a second determination function, wherein, according to the first determination function, the time offset is pseudo-randomly distributed within a corresponding time offset range, wherein, for a second instant of the instant block and each subsequent instant, the time offset range is defined by a corresponding relative minimum time distance and relative maximum time difference relative to the immediately preceding instant, wherein the relative minimum time distance and relative maximum distance are defined individually based on a mapping function of the second instant of the instant block and each subsequent instant, and wherein, according to the second determination function, a window function is applied to the time offset obtained by the first determination function.

[0027] In an embodiment, the window function restricts the time offset obtained by the first determination function [e.g., such that the time differences occurring after application of the window function are not violated (even in the most extreme cases at the boundaries of the time distance limiting function)] -

[0028] In an embodiment, the window function limits the absolute time difference between immediately subsequent instants of the instant block within an absolute time difference range defined by an absolute maximum time difference and an absolute minimum time difference.

[0029] In an embodiment, the window function reduces the time offset between an instant at the start and / or end of a time range block and the corresponding grid position to a greater value than the time offset between an instant at the center of the instant block and the corresponding position.

[0030] In an embodiment, the window function reduces the time offset between an instant at the start and / or end of the instant block and the corresponding grid position such that the corresponding instant satisfies a synchronization enabling criterion.

[0031] In an embodiment, the synchronization enabling criterion specifies that the corresponding instant is located

[0032] - at the corresponding grid position of the periodic time grid, or

[0033] - within a predefined time span around the corresponding grid position of the periodic time grid, or

[0034] - within a predefined time span having a predefined offset towards the corresponding grid position of the periodic time grid,

[0035] where i is equal to or greater than 5.

[0036] In an embodiment, the transceiver is configured to synchronize with the hopping pattern based on a synchronization enabling criterion.

[0037] In an embodiment, the mapping function is table-based.

[0038] In an embodiment, the window function is table-based.

[0039] In an embodiment, the transceiver is configured to further determine [e.g., generate or calculate] the hopping pattern using a third determination function, wherein an offset is applied to at least a consecutive portion of the time offset according to the third determination function.

[0040] In an embodiment, the data is segmented into a plurality of sub-packets, and each sub-packet is transmitted at a moment.

[0041] In an embodiment, the transceiver is configured to determine the hopping pattern using a mapping function that takes into account a first determination constraint and a second determination constraint, wherein the mapping function pseudo-randomly determines a time distance based on at least one of the ID of a base station of a wireless communication network and a sequence index or a corresponding partial thereof.

[0042] In an embodiment, the transceiver is a node of a wireless communication network.

[0043] In an embodiment, the transceiver obtains the ID and block number of a base station of a wireless communication network when synchronizing with the wireless communication network.

[0044] In an embodiment, the transceiver is a base station of a wireless communication network.

[0045] In an embodiment, the transceiver is configured to transmit and / or receive data using a hopping pattern, wherein the transceiver is configured to determine the nth moment of the hopping pattern based on the following formula:

[0046]

[0047] wherein, R RE (n) describes a pseudo-random time offset [e.g., in symbols] [e.g., the nth time offset] corresponding to a respective position [e.g., the nth position] relative to a periodic time grid [e.g., a periodic interval having 260 symbols], wherein, R RE ′(n) describes a pseudo-random time offset sequence, wherein, n is a natural number, wherein, m = n modulo 36,

[0048] wherein, w(m) describes a window function, wherein, R DC (n) describes a pseudo-random offset.

[0049] In an embodiment, R RE ′(n) is based on the following formula:

[0050]

[0051] Among them, r(n) is a pseudo-random sequence.

[0052] In an embodiment, the transceiver is configured to determine the pseudo-random sequence r(n) based on the following formula:

[0053]

[0054] Among them, SSHT_CRC(n) is a pseudo-random number depending on the ID of the base station and the nth moment or its corresponding part, where c(m) is the time pattern step size, where N RE,bea Describes the number of elements after which the calculation of BSSHT_CRC(n) must be recalculated.

[0055] In an embodiment, the transceiver is configured to determine the step size c(m) based on m according to the following table:

[0056]

[0057] In an embodiment, the transceiver is configured to determine the window function w(m) based on m according to the following table:

[0058]

[0059] In an embodiment, the transceiver is configured to determine the pseudo-random offset R DC (n):

[0060] R DC (n) = CRC32(BSSHE(R E (n))) modulo 2 16

[0061] Among them, CRC32 is a 32-bit cyclic redundancy check, where, Among them, BSSHE is a combined number obtained by combining the short address of the base station [for example, a part of the ID of the base station] and R E (n).

[0062] In an embodiment, the transceiver is configured to determine the time difference between the immediately following hops of the hopping pattern based on the following formula:

[0063]

[0064] Among them, is the symbol duration, where N RE is the total number of moments.

[0065] A further embodiment provides a method for sending and / or receiving data. The method includes the step of sending and / or receiving data using a hopping pattern [e.g., telegraph], the hopping pattern defining a sequence of instants relative to a periodic grid. Further, the method includes the step of determining [e.g., generating or calculating] the hopping pattern by determining a time distance [e.g., time delay, time difference] between successive instants in the sequence of instants by considering a first determination constraint and a second determination constraint, [e.g., such that the instants are pseudo-randomly distributed over time], wherein the first determination constraint specifies that the time distance is pseudo-randomly distributed between a predefined minimum time distance and a predefined maximum time distance, and wherein the second determination constraint specifies that the time distance lies within a respective time range defined by a time distance limiting function, each time range defining a maximum allowed distance of a respective instant of the hopping pattern towards a respective grid position of the periodic grid, and wherein, in the case where an instant specified by the first determination constraint is not within the respective time range of the time distance limiting function specified by the second determination constraint, mapping the instant to [e.g., shifting to the closest edge or reflecting into] the respective time range of the time distance limiting function specified by the second determination constraint.

[0066] A further embodiment provides a method for sending and / or receiving data. The method includes the step of sending and / or receiving data using a hopping pattern. Further, the method includes the step of determining [e.g., generating or calculating] the hopping pattern by determining a time offset between an instant of at least an instant block of the sequence of instants and a respective grid position of a periodic time grid by using a first determination function and a second determination function, wherein, according to the first determination function, the time offset is pseudo-randomly distributed within a respective time offset range, and wherein, for a second instant and each subsequent instant in the instant block, the time offset range is defined by a respective relative minimum time distance and a relative maximum time difference with respect to the immediately preceding instant, and wherein the relative minimum time distance and the relative maximum time distance are defined individually based on a mapping function of the second instant and each subsequent instant of the instant block, and wherein, according to the second determination function, applying a window function to the time offset obtained by the first determination function.

[0067] A further embodiment provides a method for sending and / or receiving data. The method includes the step of sending and / or receiving data using a hopping pattern. Further, the method includes the step of determining the n-th instant of the hopping pattern based on the following formula:

[0068]

[0069] wherein R RE(n) describes a pseudo-random time offset [e.g., in symbols] [e.g., the n-th time offset] corresponding to a respective position [e.g., the n-th position] relative to a periodic time grid [e.g., a periodic interval having 260 symbols], where R RE ′(n) describes a sequence of pseudo-random time offsets, where n is a natural number, where m = n modulo 36, where w(m) describes a window function, where R DC (n) describes a pseudo-random offset.

[0070] A further embodiment provides a transceiver of a wireless communication network, where the transceiver is configured to send and / or receive data [e.g., telegrams] using a hopping pattern that defines a sequence of instants relative to a periodic time grid, where the transceiver is configured to determine [e.g., generate or calculate] the hopping pattern by determining a time offset between an instant of at least an instant block of the sequence of instants and a respective grid position of the periodic time grid using a first determination function and a second determination function, where the first determination function specifies that a time distance between successive instants of the instant block is pseudo-randomly distributed between a predefined minimum time distance and a predefined maximum time distance, where the second determination function specifies that a time offset between an instant of the instant block and a respective grid position lies within a respective time offset range around the respective grid position, the time offset range being defined by a time offset limiting function, each time offset range defining a maximum allowed offset of a respective instant of the hopping pattern towards the respective grid position of the periodic grid, and where, in case an instant specified by the first determination function is not within the respective time bias range of the time distance limiting function specified by the second determination function, mapping the instant to [e.g., shifting to the closest edge or reflecting to] the respective time bias range of the time offset limiting function. BRIEF DESCRIPTION OF THE DRAWINGS

[0071] Embodiments of the present invention are described herein with reference to the drawings.

[0072] Figure 1 A schematic circuit block diagram of a wireless communication system including a plurality of data transceivers is shown;

[0073] Figure 2 The occupancy of a radio channel when a plurality of sub-packets are sent according to a time and frequency hopping pattern is shown in the figure;

[0074] Figure 3 A schematic block diagram of a transceiver according to an embodiment of the present invention is shown;

[0075] Figure 4 A sequence of transmission instants relative to a periodic grid is shown in the figure;

[0076] Figure 5 Shown in the figure is a transmission time sequence obtained by determining the time distances between immediately consecutive times in a time sequence;

[0077] Figure 6 Shown in the figure is the mapping of a cumulative random walk to a corresponding relative grid offset;

[0078] Figure 7 Shown is a transmission time sequence obtained by determining the time distances between immediately consecutive times in a time sequence according to an embodiment;

[0079] Figure 8 Shown in the figure are two time blocks of a time sequence defined by a time offset between a transmission time and a corresponding grid position according to another embodiment;

[0080] Figure 9 Shown is Figure 8 the probability density function obtained from the time sequence in;

[0081] Figure 10 Shown in the figure are two time blocks of a time sequence defined by a time offset between a transmission time and a corresponding grid position according to another embodiment;

[0082] Figure 11 Shown is Figure 10 the probability density function obtained from the time sequence in;

[0083] Figure 12 Shown in the figure are two time blocks of a time sequence defined by a time offset between a transmission time and a corresponding grid position according to another embodiment;

[0084] Figure 13 Shown is Figure 12 the probability density function obtained from the time sequence in;

[0085] Figure 14 Shown in the figure are two time blocks of a time sequence defined by a time offset between a transmission time and a corresponding grid position before applying a window function according to an embodiment;

[0086] Figure 15 Shown in the figure is, according to an embodiment, after applying a window function, Figure 14 two time blocks of a time sequence defined by a time offset between the transmission time and a corresponding grid position in;

[0087] Figure 16 Shown is Figure 15 the probability density function obtained from the time sequence in;

[0088] Figure 17The figure shows that after applying a window function and an additional (static offset), according to an embodiment, Figure 15 two time blocks of a time sequence defined by a time offset between a transmission time and a corresponding grid position;

[0089] Figure 18 Shows Figure 17 The probability density function obtained from the time sequence in;

[0090] Figure 19 shows the time difference T between two resource elements RE (n) Schematic diagram of the definition.

[0091] Equal or equivalent elements or elements having equal or equivalent functions are denoted by equal or equivalent reference numerals in the following description. DETAILED DESCRIPTION

[0092] In the following description, a number of details are set forth to provide a more thorough explanation of embodiments of the present invention. However, it will be apparent to those skilled in the art that embodiments of the present invention may be practiced without these specific details. In other examples, well-known structures and devices are shown in block diagram form rather than in detail to avoid obscuring embodiments of the present invention. In addition, unless otherwise specifically stated, the features of the different embodiments described below may be combined with each other.

[0093] Figure 1 A schematic block diagram of a wireless communication system 100 comprising a plurality of data transceivers 102_1-102_j is shown. The wireless communication system 100, or more precisely the data transceivers 102_1-102_j of the wireless communication system 100, may be configured to communicate in an unlicensed frequency band, such as an ISM band (ISM=Industrial, Scientific and Medical), where several uncoordinated wireless communication systems compete for the same radio resources.

[0094] Therefore, in Figure 1 In the present invention, it is exemplarily assumed that one of the data transceivers 102_1-102_j (e.g., data transceiver 102_2) is configured to split a data packet (e.g., physical layer) into multiple sub-packets and send the multiple sub-packets 142 non-concurrently / discontinuously on a radio channel using a hopping pattern 140, for example by means of a signal 120 carrying the multiple sub-packets 142, wherein another one of the data transceivers 102_1-102_j (e.g., data transceiver 102_1) is configured to receive and combine the multiple sub-packets 42 to obtain the original data packet.

[0095] In an embodiment, data transceivers 102_1 - 102_j may include a transmitter unit (or transmitter module) 104 configured to transmit a signal 120 carrying a plurality of sub - packets 142 and / or a receiver unit (or receiver module) 106 configured to receive a signal 120 carrying a plurality of sub - packets 142.

[0096] In an embodiment, at least one of the transceivers 102_1 - 102_j (e.g., transceiver 102_1) may be a base station of the wireless communication system 100, where the other transceivers may be endpoints of the wireless communication system 100 (e.g., sensor or actuator nodes). Of course, it is also possible that all transceivers 102_1 - 102_j are endpoints or base stations.

[0097] In an embodiment, data transceivers 102_1 - 102_j may be configured to send and receive data using a telegraph splitting method. In telegraph splitting, a telegraph or data packet (e.g., at the physical layer) is split into a plurality of sub - packets (or partial data packets, or sub - data packets) 142, where the plurality of sub - packets 142 are transmitted and distributed in time and / or frequency according to a hopping pattern 140. On the receiver side, the plurality of sub - packets 142 are received and reassembled (or combined) according to the hopping pattern 140 to obtain the original data packet. Thus, each of the plurality of sub - packets 142 contains only a part of the original data packet, where the original data packet is encoded (e.g., channel - encoded) / includes redundancy such that only a proper subset of the sub - packets 142 is required to decode the original data packet without error.

[0098] In an embodiment, the plurality of sub - data packets 142 may be distributed in time and / or frequency according to a hopping pattern.

[0099] The time - hopping pattern may specify the transmission time sequence or transmission time intervals for sending sub - packets. For example, a first sub - packet may be sent at a first transmission time (or in a first transmission time slot), and a second sub - packet may be sent at a second transmission time (or in a second transmission time slot), where the first transmission time and the second transmission time are different. Thus, the time - hopping pattern may define the first transmission time and the second transmission time. Alternatively, the time - hopping pattern may define the first transmission time and the time interval between the first transmission time and the second transmission time. Of course, the time - hopping pattern may only define the time interval between the first transmission time and the second transmission time. There may be a transmission pause between sub - packets during which no transmission occurs.

[0100] The frequency hopping mode can specify the transmission frequency sequence or transmission frequency hop for sending sub - packets. For example, the first sub - data can be sent at a first transmission frequency (or in a first frequency channel), and the second sub - packet can be sent at a second transmission frequency (or in a second frequency channel), where the first transmission frequency and the second transmission frequency are different. Thus, the frequency hopping mode can define the first transmission frequency and the second transmission frequency. Alternatively, the frequency hopping mode can specify the first transmission frequency and the frequency interval (transmission frequency hop) between the first transmission frequency and the second transmission frequency. Of course, the frequency hopping mode can only define the frequency interval (transmission frequency hop) between the first transmission frequency and the second transmission frequency.

[0101] Of course, multiple sub - packets 142 can also be transmitted distributively in time and frequency. The distribution of multiple sub - packets in time and frequency can be defined by a time and frequency hopping pattern. The time and frequency hopping pattern can be a combination of a time hopping mode and a frequency hopping mode, that is, a sequence of transmission times or transmission time intervals, according to which the sub - packets are sent, where the transmission frequency (or transmission frequency hop) is associated with the transmission time (or transmission time interval).

[0102] Figure 2 The occupancy of the radio channel when multiple sub - packets 142 are sent according to the time and frequency hopping pattern 140 is shown in the figure. Thus, in Figure 2 it, the vertical axis describes the frequency and the horizontal axis describes the time. In Figure 2 it, it is exemplarily assumed that the original data packet is split into, for example, seven sub - packets 142, and these sub - packets are transmitted distributively in time and frequency according to the time and frequency hopping pattern 140. The sub - packets 142 can include synchronization symbols and data symbols.

[0103] In an embodiment, the wireless communication system 100 can be, for example, a low - power wide - area network (LPWAN). Thus, in an embodiment, the data transceiver described herein can be implemented in an LPWAN system, such as an LPWAN system based on [1], or in any other wireless communication system that communicates in an unlicensed frequency band (such as the ISM band (ISM = Industrial, Scientific, and Medical)), where several uncoordinated wireless communication systems compete for the same radio resources.

[0104] Figure 3 A schematic block diagram of a transceiver 102 according to an embodiment of the present invention is shown. The transceiver 102 is configured to use a hopping pattern 140 to send and / or receive data (e.g., telegrams or data packets), and the hopping pattern 140 defines a sequence of moments 144_1 - 144_l (l = 5) relative to a periodic grid 160. Thus, in Figure 3Exemplarily, it is assumed that the time sequence includes l = 5 times 144_1 - 144_l. However, the present invention is not limited to such an embodiment. On the contrary, the time sequence 144_1 - 144_l may include up to l times, where l is a natural number equal to or greater than 3, such as 5, 10, 20, 30, 50, 100, etc.

[0105] In an embodiment, the transceiver 102 may be configured to directly determine the times 144_1 - 144_l (l = 5) with respect to the corresponding grid positions 146_1 - 146_l (l = 5) of the periodic grid 160. Alternatively, the transceiver 102 may be configured to determine the times 144_1 - 144_l (l = 5) with respect to the corresponding grid positions 146_1 - 146_l (l = 5) of the periodic grid 160 by determining the pseudo-random time offsets 150_1 - 150_l (l = 5) between the times and the corresponding grid positions 146_1 - 146_l (l = 5), e.g., a first pseudo-random time offset 150_1 between the first time 144_1 and the first grid position 146_1, a second pseudo-random time offset 150_2 between the second time 144_2 and the second grid position 146_2, and an l-th pseudo-random time offset 150_l between the l-th time 144_l and the l-th grid position 146_l.

[0106] In an embodiment, the transceiver 102 may be configured to determine the times 144_1 - 144_l (l = 5) and / or the time offsets 150_1 - 150_l (l = 5) such that the times 144_1 - 144_l are within the corresponding time ranges (or time offset ranges) 152_1 - 152_l (l = 5) defined by a time offset limiting function. The time offset limiting function defines the maximum allowable distance / offset of the corresponding times of the hopping pattern 142 towards the corresponding grid positions of the periodic grid 160.

[0107] In an embodiment, the times 144_1 - 144_l (l = 5) may define the corresponding time slots 143_1 - 143_l (l = 5) that can be used by the transceiver 102 to transmit / receive data. Thus, the predefined positions of the time slots 143_1 - 143_l (l = 5), such as the start, center, or end, may coincide with the corresponding times 144_1 - 144_l (l = 5).

[0108] In an embodiment, the transceiver 102 may be configured to send / receive data using telegram splitting, for example, the transceiver 102 may be configured to split data (e.g., a telegram or a data packet) into a plurality of sub-packets 142_1-142_k (k=5), and send the plurality of sub-packets 142_1-142_k (k=5) at corresponding moments 144_1-144_5 defined by the hopping pattern 140, for example, sending the first sub-packet 142_1 at a first moment 144_1, sending the second sub-packet 142_2 at a second moment, sending the kth sub-packet at a kth moment, or receiving the plurality of sub-packets 142_1-142_k (k=5) at corresponding moments 144_1-144_5 defined by the hopping pattern 140. Thus, a predefined position of a sub-packet, such as a start, a center, or an end, may coincide with a corresponding moment. Figure 3 In the embodiment, it is assumed that the data is split into k=5 data packets. However, the present invention is not limited to such an embodiment. Instead, the data can be split into k sub-packets 142_1-142_k, where k is a natural number equal to or greater than 3, such as 5, 10, 18, 20, 24 or 30. In addition, multiple data transmissions can be performed using a sequence of time instants 144_1-144_l, such as a first data transmission using a first time instant group (e.g., for a first data transmission consisting of k sub-packets, using time instants 144_1-144_k), and a second data transmission using a second time instant group (e.g., for a second data transmission consisting of k sub-packets, using time instants 144_k+1-144_2k).

[0109] The embodiments described herein focus on the generation of time hopping patterns. Thus, the time hopping patterns generated according to the embodiments can be combined with any frequency hopping pattern, such as the frequency hopping pattern defined in [1], to obtain a time and frequency hopping pattern.

[0110] Subsequently, embodiments of the present invention will be described in more detail.

[0111] In an embodiment, the start times of the sub-packet transmission time slots are distributed in a pseudo-random manner. In a wireless network, these moments may be scheduled, for example, by a base station. In an embodiment, when a user receives signals from multiple base stations, the time slots for each network are different to avoid sub-packet collisions. In an embodiment, since network synchronization is not performed, the performance of the system is independent of the relative time offsets of the base stations. In an embodiment, the time slots are approximately uniformly distributed over the entire time domain. In an embodiment, burst collisions caused by interference with other networks are reduced by low correlation between consecutive start times.

[0112] In an embodiment, a minimum pause between two consecutive sub-packets is guaranteed, which ensures sufficient processing time and enables additional transmissions between regular sub-packets. In an embodiment, an upper limit of the pause between two consecutive sub-packets is provided to limit the worst-case delay of the system. For practical applications, in an embodiment, the absolute position of a single sub-packet can be calculated by other network users with less effort.

[0113] Figure 4 In the figure, a sequence of transmission times 144 relative to a periodic grid 160 is shown, where the transmission times 144 are obtained by determining a pseudo-random time offset 150 between the transmission times 144 and the corresponding grid positions of the periodic grid by considering a maximum allowable time offset range 152 around the corresponding grid positions 146. In other words, Figure 4 In the figure, a scheduling of transmission time slots 143 with pseudo-random offsets relative to the grid 160 is shown. Thus, in Figure 4 it, reference numeral 140 represents a hopping pattern, reference numeral 143 represents a transmission time slot, reference numeral 146 represents a grid position of the periodic grid 160, reference numeral 162 represents the spacing between subsequent grid positions 146, reference numeral 150 represents the offset between the corresponding times 144 of the time sequence and the corresponding grid positions 146 of the periodic grid 60, reference numeral 152 represents a time offset range that defines the maximum allowable offset between the corresponding times and the corresponding grid positions of the periodic grid 160, reference numeral 164 represents the minimum delay (or distance) between immediately subsequent times 144 of the time sequence, and reference numeral 166 represents the maximum delay (or distance) between immediately subsequent times 144 of the time sequence.

[0114] As Figure 4 shown, by adding a random offset 150 to the grid positions 146 of a uniformly spaced time grid 160, the transmission times 144 can be determined. If the offset 150 is bounded to a period less than the grid spacing 162, this meets the requirements for a minimum duration (or distance) 164 and a maximum duration (or distance) 166 between consecutive times (e.g., between predefined positions (e.g., start, center, or end) of consecutive sub-packets).

[0115] In Figure 4In this case, the offset output range (or the maximum allowable time offset range) 152 represents a design parameter that incurs a trade-off. A large output range 152 distributes the moment 144 (e.g., the sub-packet start time) over a large portion of all possible moments. In this limit, when the time offset range 152 is equal to the grid spacing, transmission can be performed over the entire time domain. Additionally, for uniformly distributed time offsets 150, all moments 144 are equally likely. However, a large time offset range 152 reduces the minimum pause between consecutive sub-packets and increases its maximum pause. In this limit, when the time offset range 152 matches the grid spacing 162, the minimum time between consecutive sub-packets cannot be guaranteed.

[0116] Thus, in an embodiment, the start (or center or end) of a sub-packet is determined relative to the start (or center or end) of the previous sub-packet, as Figure 5 shown.

[0117] Specifically, Figure 5 In the figure, a sequence of transmission moments 144 obtained by determining the time distances between immediately consecutive moments of the moment sequence 144 is shown, where the time distances are pseudo-randomly distributed within a time distance range 153, which is defined by a predefined minimum time distance 164 and a predefined maximum time distance 166 towards the immediately preceding moment 144 of the moment sequence. In other words, Figure 5 In the figure, a relative transmission time slot scheduling with a pseudo-random offset relative to the previous time slot is shown. Thus, in Figure 5 this case, reference numeral 140 represents a hopping pattern, reference numeral 143 represents a transmission time slot, reference numeral 144 represents a moment of the moment sequence, reference numeral 146 represents the grid position of the periodic grid 160, reference numeral 153 represents a time distance range defined by a predefined minimum time distance 164 and a predefined maximum time distance 166 towards the immediately preceding moment, reference numeral 164 represents the minimum delay between immediately consecutive moments 144 of the moment sequence, and reference numeral 166 represents the maximum delay between immediately consecutive moments 144 of the moment sequence.

[0118] As Figure 5 shown, the time difference (e.g., the time difference between consecutive transmission moments 144) can be pseudo-randomly distributed between a minimum value 164 and a maximum value 166. By this method, each moment 144 can generally be the start (or center or end) of a transmission time slot 143, which avoids the need for synchronization between users.

[0119] In an embodiment, the transmission time slots are pseudo-randomly distributed relative to their previous moments.

[0120] However, in its pure form, this method has two main limitations. While the average delay (or distance) between consecutive instants (or bursts) is determined by the distribution of the pseudo-random offsets, the sampled average delay of several sub-packets can vary significantly. This affects the maximum delay of the segmented packet transmission, and the enhancements proposed in Section 1 below can mitigate this delay. Since the absolute start time of each sub-packet depends on all previous delays, the entire history of the pseudo-random offsets must be known and accumulated. To reduce the computational effort for initial synchronization and tracking, Section 2 below introduces additional enhancements to periodically allow synchronization independent of previous delays.

[0121] Thus, in an embodiment, a transceiver (see Figure 3 ) may be configured to determine (e.g., generate or calculate) a hop pattern 140 by determining the time distance between immediately consecutive instants of a sequence of instants using a first determination constraint (or a first determination function) and a second determination constraint (or a second determination function), as described below with reference to Figures 7 to 13 .

[0122] 1. Reflective Random Walk

[0123] To limit the system maximum delay of a transmission employing multiple time slots, in an embodiment, the relative distance with respect to a uniformly spaced time grid 160 is further restricted. This is achieved by mapping the accumulated time offset to a continuous and cyclic representation of the time offset with respect to the grid, as shown in Figure 6 . Specifically, Figure 6 the mapping of the accumulated random walk to the corresponding relative grid offset is shown in the figure.

[0124] Figure 7 The resulting time slot schedule is shown, where the cyclic mapping may cause a reflection of the offset range 153 on the grid boundary 147, effectively doubling the probability distribution of these instants. Specifically, Figure 7 the sequence of transmission instants 144 obtained by determining the time distance between immediately consecutive instants of the sequence of instants 144 is shown in the figure, where the time distance is pseudo-randomly distributed within a time distance range 153 defined by a predefined minimum time distance 164 and a predefined maximum time distance 166 towards the immediately preceding instant. Thus, the time distance range 153 is constrained by a time distance limiting function (region 168 in Figure 7 ), which defines the maximum allowable distance of the corresponding instants 144 of the hop pattern towards the corresponding grid positions of the periodic grid. In other words, Figure 7 the relative transmission time slot schedule with respect to the previous time slot and the reflection at the grid boundary is shown in the figure. Thus, in Figure 7In [description], reference numeral 140 represents a jump pattern, reference numeral 144 represents a transmission moment, reference numeral 143 represents a transmission time slot, reference numeral 147 represents the grid boundary of the periodic grid 160 (i.e., the center between subsequent grid positions compared with Figure 4 ), reference numeral 153 represents the time range defined by a predefined minimum time distance 164 and a predefined maximum time distance 166 towards the immediately preceding moment, reference numeral 164 represents the minimum delay between the immediately succeeding moments 144 of the moment sequence, reference numeral 166 represents the maximum delay between the immediately succeeding moments 144 of the moment sequence, reference numeral 168 represents the region of the time distance range, which has twice the probability of compensating for the non - allowed part 153 according to the time - distance constraint function (such as the function shown in Figure 6 ) to maintain the uniform distribution of the moments 144.

[0125] In an embodiment, an integer - to - finite - range cyclic and continuous mapping is performed, which maintains the uniform distribution.

[0126] 2. Block - Based Reflective Random Walk

[0127] The start time of the transmission time slot can be defined according to the sum of all previous pseudo - random time offsets. To simplify the synchronization of the user with the time - hopping pattern, in an embodiment, consecutive packets are grouped into blocks. Then, each block can be independently synchronized with the system without considering the previous state.

[0128] In an embodiment, the transmission time slot sequence (or the transmission moment sequence) is divided into blocks that allow independent synchronization.

[0129] 2.1 Reflective Random Walk with Hard Return

[0130] In an embodiment, by starting with a fixed offset on the first time slot of each block, the synchronization at the start of each block can be simplified. Thus, the previously accumulated time offsets can be ignored. To ensure that the minimum and maximum time offsets between consecutive time slots are not exceeded at the block boundary, the final sub - packets of each block can be constrained. This is shown in Figure 8 .

[0131] Specifically, Figure 8 In the figure, two moment blocks 172 in the moment sequence defined by the time offset between the transmission moment 144 and the corresponding grid position are shown. Thus, the ordinate represents the distance / offset of the corresponding moment to the corresponding grid position, where the abscissa represents the transmission moment (or transmission time slot) index. As shown in Figure 8 , each transmission moment 144 can be pseudo - randomly distributed within the time distance / offset range 153, which is defined by a predefined maximum time distance and a predefined minimum time distance relative to the immediately preceding moment of the moment sequence. As shown inFigure 8 Further shown, the time distance / offset range 153 is only allowed to be located within the corresponding maximum allowable time offset range 152, and each maximum allowable time deviation range 152 defines the maximum allowable distance / offset of the corresponding moment towards the corresponding grid position of the periodic grid 160. The maximum allowable time offset range 152 can be defined by the time distance / offset limiting function 158, where the maximum allowable time deviation range 152 is limited to the predefined offsets at the start and end of the corresponding moment block 172. In other words, Figure 8 The figure shows the grid distances of the selected time slots from two blocks and their global domains, as well as the possible offsets depending on the previous values, such as the reflected random walk with hard returns as shown.

[0132] As previously mentioned, in an embodiment, in order to ensure that the minimum and maximum time offsets (or differences) between consecutive time slots are not exceeded at the boundaries of the block 172, the final moment (or sub-packet) of each block 172 can be constrained. In Figure 8 this, this is achieved by returning to the default state at the last time slot of the block 172. Then, the previous time slot is restricted to a position where it can transition to the final state without violating the minimum or maximum delay between two sub-packets. Random walks outside the compliance range will be mapped to the nearest position within the range. This can be achieved, for example, using minimum and maximum operations.

[0133] Figure 9 The probability density function of the time offset with respect to the grid for the reflected random walk with hard returns is shown, which is normalized by the grid spacing. In addition, in Figure 9 this, the ideal uniform distribution achieved by the (reflected) random walk is shown for comparison. Therefore, in Figure 9 this, the ordinate represents the probability density and the abscissa represents the normalized offset of the grid position. In Figure 9 this, time offsets closer to the grid center are more likely compared to the edges, and there are discrete probability spikes. This may cause the performance of the interfering network to depend on the time offset.

[0134] In an embodiment, returning to a fixed state at the end of each block (the moment block of the moment sequence) is allowed to enable simple synchronization at the start of the next (moment) block.

[0135] In an embodiment, the range of the last time slot in the block is restricted to returning to the default state in the last time slot of the block without violating the minimum and maximum offset constraints.

[0136] 2.2 Reflective Random Walk with Hard Partial Return

[0137] As an alternative to the previous embodiments that return to a single final state (at the end of each block), in an embodiment, the final time slot of each block is allowed to vary within a limited range, while also limiting the random offset of the first time slot of each block. In an embodiment, these limits are selected such that minimum and maximum delay constraints are satisfied. This is shown in Figure 10 as follows.

[0138] Specifically, Figure 10 in the figure, two moments 144 of a moment sequence defined by the time offset between the transmission moment 144 and the corresponding grid position are shown for block 172. Thus, the ordinate represents the distance / offset of the corresponding moment to the corresponding grid position, where the abscissa represents the transmission moment (or transmission time slot) index. As Figure 10 shown, each transmission moment 144 can be pseudo-randomly distributed within a time distance / offset range 153, which is defined by a predefined maximum time distance and a predefined minimum time distance relative to the immediately preceding moment of the moment sequence. As Figure 10 further shown, the time distance / offset range 153 is only allowed to be located within the corresponding maximum allowable time offset range 152, and each maximum allowable time deviation range 152 defines the maximum allowable distance / offset of the corresponding moment towards the corresponding grid position of the periodic grid. The maximum allowable time offset range 152 can be defined by a time distance / deviation limiting function 158, where the time offset range 52 is limited within a predefined offset range at the start and / or end of the corresponding moment block 172. In other words, Figure 10 in the figure, the grid distances of the selected time slots from two blocks and their global domains are shown, as well as the possible offsets depending on the previous values, such as a reflected random walk with a hard part return as shown.

[0139] Figure 11 shows the probability density function of the time offset relative to the grid for a reflected random walk with a hard part return, which is normalized by the grid spacing. In addition, in Figure 11 it is shown, for comparison, the ideal uniform distribution achieved by a (reflected) random walk. Thus, in Figure 11 it is shown that the ordinate represents the probability density and the abscissa represents the normalized offset to the grid position. Figure 11 The overall shape of the probability density function of Figure 9 is similar to the probability density function (hard return) of

[0140] but it avoids the main probability spike at the center of the grid.

[0141] 2.3 Reflective Random Walk with Reverse Return

[0142] Range limiting using minimum and maximum operations results in a peak in the slot distribution at the end of each block. This can be avoided by reusing the pseudo-random offset sequence of the first half of each block in the reverse direction in the second half. However, this reduces the number of independent random steps, thereby increasing the chance of burst collisions. In addition, this method still results in spectral spikes at the last time slot of each block. As Figure 12 shown.

[0143] Specifically, Figure 12 In the figure, two time moments 144 of a block 172 are shown in a sequence of time moments defined by the time offset between the transmission moment 144 and the corresponding grid position. Thus, the ordinate represents the distance / offset of the corresponding time moment to the corresponding grid position, where the abscissa represents the transmission moment (or transmission time slot) index. As Figure 12 shown, each transmission moment 144 can be pseudo-randomly distributed within a time distance / offset range 153, which is defined by a predefined maximum time distance and a predefined minimum time distance relative to the immediately preceding moment. As Figure 12 further shown, the time distance / offset range 153 is only allowed to be within the corresponding maximum allowable time offset range 152, and each maximum allowable time deviation range 152 defines the maximum allowable distance / offset of the corresponding time moment towards the corresponding grid position of the periodic grid. The maximum allowable time offset range 152 can be defined by a time distance / deviation limiting function 158, where the maximum allowable time offset range 152 is restricted within a predefined offset range at the start and / or end of the corresponding time moment block 172. In other words, Figure 12 In the figure, the grid distances of selected time slots from two blocks and their global domains are shown, as well as the possible offsets depending on the previous values, such as a reflected random walk with a reverse return as shown.

[0144] Figure 13 Shows the probability density function of the time offset relative to the grid for a reflected random walk with a reverse return, which is normalized by the grid spacing. In addition, in Figure 13 , an ideal uniform distribution achieved by a (reflected) random walk is shown for comparison. Thus, in Figure 13 , the ordinate represents the probability density and the abscissa represents the normalized offset to the grid position. In Figure 13 , there is only a single probability spike, which is caused by the return to the central position at the end of each block. Due to the fixed initial offset, time offsets closer to the grid center are still more likely.

[0145] In an embodiment, the random walk starts relative to a reference point until half of the block size, and the previous step size is used in the second half but in the opposite direction.

[0146] 2.4 Windowed Reflective Random Walk

[0147] In an embodiment, the transceiver (see Figure 3 ) may be configured to determine (e.g., generate or calculate) the hopping pattern 140 by determining a time offset 150 between a time 144 of at least one time block of the time 144 sequence and a corresponding grid position 146 of the periodic time grid 160 by using a first determination function and a second determination function. Thus, the first determination function and the second determination function may refer to Figure 14 and Figure 15 (or Figure 17 ) as defined below.

[0148] In an embodiment, the windowed reflected random walk starts from an arbitrary absolute offset at the first time slot of each block and then continues by adding a relative offset to that position. As Figure 14 shown.

[0149] Specifically, Figure 14 In the figure, two time 144 blocks 172 in the time sequence defined by the time offset between the transmission time 144 and the corresponding grid position are shown before applying the window function. Thus, the ordinate represents the distance / offset of the corresponding time to the corresponding grid position, where the abscissa represents the transmission time (or transmission time slot) index. As Figure 14 shown, the transmission time 144 is pseudo-randomly distributed within a time distance / offset range 153 (e.g., according to the first determination function), and for the second time and each subsequent time of the time 144 block, this range is defined by a corresponding relative minimum time distance and relative maximum time difference with respect to the immediately preceding time, where the relative minimum time distance and relative maximum time distance are defined separately for the second time and each subsequent time of the time block. Since the window function is applied later in Figure 15 , in Figure 14 , the maximum time distance / offset range 152 still does not constrain or limit the time distance / offset range. In other words, Figure 14 In the figure, the grid distances of selected time slots from two blocks and their global domains, as well as the possible offsets depending on the previous values, are shown as the reflected random walk before windowing.

[0150] Then, as Figure 15 shown, the absolute offset obtained with respect to the grid is windowed separately for each block.

[0151] In detail, Figure 15 In the figure, after applying the window function (e.g., according to the second determination function), it is shown from Figure 14Two moments 144 in the moment sequence defined by the time offset between the transmission moment 144 and the corresponding grid position, and block 172. Thus, the ordinate represents the distance / offset from the corresponding moment to the corresponding grid position, where the abscissa represents the transmission moment (or transmission time slot) index. As Figure 15 shown, the time offset defining moment 144, the time distance / offset range 153, and the maximum allowable time distance / offset range 152 are restricted or constrained by the window function. In other words, Figure 15 In the figure, the grid distances from the selected time slots in two blocks and their global domains are shown, as well as the possible offsets depending on the previous values, such as the reflected random walk after windowing as shown.

[0152] In an embodiment, the windowing function w is selected such that the minimum and maximum time offsets between consecutive time slots are not exceeded, whether within the block or at the boundary. Since the stretching and squeezing of the absolute start position of the time slot introduce additional relative time shifts, the maximum allowable relative time shift must be reduced to allow for this margin. The maximum relative offset can also be set on a per sub-packet basis to maximize the sequence as much as possible, as Figure 14 shown. At the block boundary, the window width is selected such that any transitions within these windows do not exceed the minimum and maximum delays. For the rising part of the window, the most extreme delay is experienced when the relative offset reaches its maximum absolute value, resulting in the largest absolute grid distance. Therefore, the window function and the relative offset range are selected such that these extreme delays are still within the valid range. Then, the falling part of the window can be obtained by mirroring the rising part.

[0153] Figure 16 Shows the probability density function of the time offset relative to the grid for the windowed reflected random walk, which is normalized by the grid spacing. In addition, in Figure 16 it, the ideal uniform distribution achieved by the (reflected) random walk is shown for comparison. Therefore, in Figure 16 it, the ordinate represents the probability density, and the abscissa represents the normalized offset to the grid position. In Figure 16 it, although time offsets closer to the grid center are still more likely, the distribution is flatter than the previous method and there are no spectral spikes. The appearance of the staircase structure is due to the windowing function restricting the range.

[0154] When R DC (n) = 0 holds for all n, Section 2.6 below provides an exemplary implementation in this regard.

[0155] In an embodiment, the time offset can be distributed according to a random walk with a varying step size and subsequent windowing to maintain the minimum and maximum delay constraints.

[0156] 2.5 Windowed Reflective Random Walk with Randomized Block Transition Offset

[0157] The narrow absolute offset ranges at the start and end of each block 172 still result in a non-uniform distribution of time slots in the time domain. This can be mitigated by randomizing their absolute positions at each block transition, as Figure 17 shown.

[0158] Specifically, Figure 17 in the figure, two moments 144 in the sequence of moments defined by the time offset between the transmission moments 144 and the corresponding grid positions in Figure 15 are shown after applying a window function (e.g., according to a second determination function) and an additional (static) offset 170 weighted by the additive inverse of the window function. Thereby, in Figure 17 the ordinate represents the distance / offset of the corresponding moment to the corresponding grid position, and the abscissa represents the transmission moment (or transmission time slot) index. Compared with Figure 15 the additional (static) offset shown in Figure 17 offsets the positions of the moments 144 defined by the corresponding time offsets, especially at the start and end of the corresponding moment blocks 172. In other words, Figure 17 in the figure, the grid distances of selected time slots from two blocks and their global domains are shown, as well as the possible offsets depending on the previous values, such as the reflected random walk after windowing and including the block transmission offset as shown.

[0159] In an embodiment, the introduced static offset requires additional margin, which further reduces the relative offset range. It is expected that the transition offset 170 changes only at the center of each block 172 where the window function is maximum. In an embodiment, the transition offset 170 can be obtained pseudo-randomly from a sub-packet counter, for example, by offsetting the counter value by half of the block length and then performing integer division according to the block length. The static offset 170 affects the final grid offset with a weight of 1 - w, and the final grid offset is the reciprocal of the windowing function. Thus, there is a linear transition from the static offset 170 to the windowed reflected random walk. Here, the minimum static offset results in the most extreme delay when the maximum relative offset results in the maximum absolute offset in the rising part of the window. The same is true for the maximum static offset when the minimum relative offset results in the minimum absolute offset. Therefore, in an embodiment, the static offset range, the windowing function, and the relative offset range are selected to meet the delay constraints of these moments. Additionally, the falling part of the window can be obtained again by mirroring the rising part.

[0160] Figure 18 shows the probability density function of the time offset with respect to the grid for a windowed reflected random walk with randomized block transition offsets, which is normalized by the grid spacing. Additionally, inFigure 18 shows the ideal uniform distribution achieved by (reflective) random walk for comparison. Thus, in Figure 18 , the ordinate represents the probability density and the abscissa represents the normalized offset to the grid position. This smoothing function is closest to the uniform distribution of the proposed block-based reflective random walk. Offsets closer to the grid center are still more likely because these values are possible in most parts of any block transition.

[0161] In an embodiment, linear interpolation of a windowed random walk with pseudo-random offsets is performed, which remains constant during block transitions.

[0162] 2.6 Specific Implementation of Windowed Reflective Random Walk with Randomized Block Transition Offset

[0163] The calculation of the hopping pattern (e.g., the base station specific hopping (BSSH) resource element pattern) is described below. According to Table 1, the 32-bit BSSH number consists of a 16-bit base station (BS) short address (which is usually unique and constant for each base station) and a 16-bit pseudo-random number (which consists of the contents of a 16-bit linear feedback shift register (LFSR)).

[0164] Table 1: BSSH Digital Format (32-bit)

[0165] Bits: 0 - 15 16-31 <![CDATA[Pseudo-random number R b [0-15]]]> BS Short Address [0 - 15]

[0166] R b (n) represents the content of the linear feedback shift register for the b-th beacon period and the n-th resource element. The most significant bit (MSB) of the 32-bit number corresponds to bit index 0. At the start of each beacon period b, the seed s of the linear feedback shift register should be initialized according to the following b = R b (0):

[0167] s b = R b (0) = max((b * N RE,bea ) modulo 65536, 1)

[0168] The basic operation of the 16-bit linear feedback shift register is defined as described in Article 6.4.7.1.6.2 of [1]. The polynomial of the Galois linear feedback shift register (Galois-LFSR) should be 0xD09B in hexadecimal (instead of 0xB4F3). For each resource element n in the beacon period, the content of the shift register (which is directly mapped to the upper 16 bits of the BSSH number) is calculated based on one shift operation of the linear feedback shift register, i.e.,

[0169] R b (n) = LFSR(R b(n - 1)), n ∈ {1, 2, …, N RE,bea -1}

[0170] Follow the same notation used in Article 6.4.7.1.6.2 of [1].

[0171] N RBL,bea The applicable value of (where N RE,bea = 36 * N RBL,bea ), the base station short address STS_SHORT_ADDR, and the beacon period counter b are signaled by the base station to the terminal node during the synchronization process (e.g., within the synchronization information notification control section).

[0172] By applying a 32 - bit CRC operation to the content of the 32 - bit BSSH number, it can be pseudo - randomized, which is denoted as CRC32(...). The definition of the CRC calculation follows the notation in Article 6.4.6.2 of [1]. The 32 - bit CRC should be calculated based on the polynomial 0x4C11DB7, with an initial value of 0xFFFFFFFF for the calculation and no XOR applied.

[0173] BSSHF_CRC = CRC32(BSSH_counter).

[0174] The result is denoted as BSSHF_CRC (Table 2). These bits can be processed in ascending order, and the unsigned integer CRC field should first apply the most significant bit (MSB).

[0175] Table 1: BSSHF_CRC and BSSHT_CRC Formats

[0176]

[0177] The transmission time of the resource element (RE) in the BSSH mode is derived from a 16 - bit unsigned integer BSSHT_CRC, as shown in Table 2. For the resource element n representing the element m = n modulo 36 within its resource block, the time offset R RE is generated from a pseudo - random sequence according to the maximum value c(m) shown in Table 4

[0178]

[0179] For each RB, this sequence is accumulated to

[0180]

[0181] Then, the final time offset is obtained by windowing through the function w(m) shown in Table 4, which controls the transition to the pseudo - random offset R DC (n).

[0182]

[0183] Offset R DC The calculation of (n) is similar to the calculation of BSSHF_CRC of CRC32 from the concatenation of the counter and the base station short address, as shown in Table 3:

[0184]

[0185] Table 2: BSSHE Digital Format (32 bits)

[0186] Bits: 0 - 15 16-31 <![CDATA[Pseudo-random number R E [0-15]]]> BS Short Address [0 - 15]

[0187] Then CRC32 is used to determine the uniformly distributed offset

[0188] R DC (n) = CRC32(BSSHE(R E (n))) modulo 2 16

[0189] R DC ∈ {0, 1, …, 2 16 -1}

[0190] Table 3: Time Pattern Step c(m) and Windowing Function w(m)

[0191]

[0192]

[0193] The time difference T between the centers of two adjacent resource elements RE shall be calculated as:

[0194]

[0195] where the symbol duration of the UL-ULP mode complies with Article 6.4.4.2.1 and Article 6.4.4.2.2 of [1]. Ensure that it is within the range of For the first resource element in the beacon period, the time T RE (1) represents the delay between the middle of the first indexed resource element with index n = 0 and the middle of the second indexed resource unit with index n = 1 in the beacon core frame, similar to Article 6.4.7.1.4 of [1]. The start time T of the beacon period 0,DL-STS is defined as the middle of the first resource element with index n = 0 in the beacon core frame.

[0196] Figure 19Shows the time difference T between two resource elements 143_0 and 143_1 RE (n) schematic definition. As Figure 19 shown, the positions (e.g., centers) of resource elements 143_0 and 143_1 can be defined by times 144_0 and 144_1. Times 144_0 and 144_1 can be defined by respective time offsets 150_0(R RE (0)) and 150_1(R RE (1)) with respect to respective grid positions 146_0 and 146_1 of a periodic grid, which has a period of, for example, 260 symbols between consecutive grid positions. The distance between consecutive times 144_0 and 144_1 can be defined by T RE (1).

[0197] 3. Further Embodiments

[0198] Although some aspects have been described in the context of apparatus, it should be understood that these aspects also represent a description of the corresponding methods, and thus the blocks or components of the apparatus should also be understood as corresponding method steps or features of method steps. Similarly, aspects described in connection with method steps or as method steps also represent a description of corresponding blocks or details or features of the corresponding apparatus. Some or all of the method steps may be performed by (or using) hardware devices, such as a microprocessor, a programmable computer, or an electronic circuit. In some embodiments, some or more of the most important method steps may be performed by such devices.

[0199] Depending on the specific implementation requirements, embodiments of the present invention may be implemented in hardware or software. The implementation may use a digital storage medium to perform, 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 any arbitrary magnetic or optical memory on which electronically readable control signals are stored, which can or do interact with a programmable computer system to perform the corresponding method. Thus, the digital storage medium may be computer-readable.

[0200] Thus, some embodiments according to the present invention include a data carrier having electronically readable control signals capable of cooperating with a programmable computer system to perform any method described herein.

[0201] Generally, embodiments of the present invention may be implemented as a computer program product having program code, which, when run on a computer, can be used to perform any method.

[0202] For example, the program code may also be stored on a machine-readable carrier.

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

[0204] In other words, an embodiment of the method of the present invention is thus a computer program that includes program code for performing any of the methods described herein when the computer program is run on a computer.

[0205] Thus, another embodiment of the method of the present invention is a data carrier (or digital storage medium or computer-readable medium) on which a computer program for performing any of the methods described herein is recorded. The data carrier, digital storage medium or computer-readable medium is generally tangible and / or non-transitory or non-transient.

[0206] Thus, another embodiment of the method of the present invention is a data stream or signal sequence that constitutes a computer program for performing any of the methods described herein. The data stream or signal sequence can be configured, for example, to be transmitted via a data communication link, such as via the Internet.

[0207] Another embodiment includes a processing device, such as a computer or a programmable logic device, which is configured or adapted to perform any of the methods described herein.

[0208] Another embodiment includes a computer on which a computer program for performing any of the methods described herein is installed.

[0209] Another embodiment according to the present invention includes an apparatus or system that is configured to transmit a computer program for performing at least one of the methods described herein to a receiver. For example, the transmission can be electronic or optical. The receiver can be, for example, a computer, a mobile device, a storage device, or a similar device. The apparatus or system can include, for example, a file server for sending the computer program to the receiver.

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

[0211] The apparatuses described herein can be implemented, for example, using a hardware device, or using a computer, or using a combination of a hardware device and a computer.

[0212] The devices described herein or any components of the devices described herein may be implemented at least in part in hardware and / or software (computer programs).

[0213] For example, the methods described herein may be implemented using hardware devices, or using a computer, or using a combination of hardware devices and a computer.

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

[0215] The above embodiments are only used to illustrate the principles of the present invention. It should be understood that modifications and variations to the arrangements and details described herein will be apparent to other persons skilled in the art. Therefore, the present invention is limited only by the scope of the following claims and not by the specific details presented herein in the way of description and explanation of the embodiments.

[0216] References

[0217] [1]ETSI TS 103 357,Low Throughput Networks,v.1.1.1,June 2018.

Claims

1. A transceiver (102) of a wireless communication network (100), Among them, The transceiver (102) is configured to transmit and / or receive data using a hopping pattern (140), and the hopping pattern (140) defines a sequence of times (144) relative to a periodic grid (160), wherein the transceiver (102) is configured to determine the hopping pattern (140) by considering a first determination constraint and a second determination constraint to determine the time distance between immediately consecutive times (144) of the sequence of times (144), wherein the first determination constraint specifies that the time distance is pseudo-randomly distributed between a predefined minimum time distance (164) and a predefined maximum time distance (166), wherein the second determination constraint specifies that the time distance lies within a corresponding time range (152) defined by a time distance limiting function, and each time range (152) defines the maximum allowable distance of the corresponding time of the hopping pattern (140) towards the corresponding grid position of the periodic grid (160), wherein, in the case where it is determined that the time specified by the first determination constraint is not within the corresponding time range of the time distance limiting function specified by the second determination constraint, the time is mapped to the corresponding time range of the time distance limiting function specified by the second determination constraint.

2. The transceiver (102) according to the preceding claim, Among them, The time range (152) defined by the time distance limiting function is equal to or less than the distance between two immediately succeeding grid positions of the periodic grid (160).

3. The transceiver (102) according to any one of the preceding claims, Among them, The time range (152) defined by the time distance limiting function has at least two different sizes.

4. The transceiver (102) according to any one of the preceding claims, Among them, A proper subset of the time range (152) defined by the time distance limiting function is less than the difference between the predefined maximum time distance and the predefined minimum time distance.

5. The transceiver (102) according to any one of the preceding claims, Among them, The time distance is defined by the time range (152) of the time distance limiting function to meet a synchronization enabling criterion, wherein the synchronization enabling criterion specifies that each i-th time in the sequence of times (144) is located - at the corresponding grid position of the periodic time grid, or - within a predefined time span around the corresponding grid position of the periodic time grid, or - within a predefined time span having a predefined offset towards the corresponding grid position of the periodic time grid, where i is equal to or greater than 5.

6. The transceiver (102) according to claim 5, Among them, The transceiver (102) is configured to synchronize with the hopping pattern (140) based on the synchronization enabling criterion.

7. The transceiver (102) according to any one of claims 5 to 6, Among them, The predefined time span is at least two times smaller than the difference between the predefined maximum time distance and the predefined minimum time distance.

8. The transceiver (102) according to any one of the preceding claims, Among them, The sequence of times (144) is grouped into time (144) blocks (172), Among them, the time ranges (152) defined by the time distance limit function are grouped into time range blocks, and the time range (152) blocks correspond to the corresponding moment (144) blocks (172).

9. The transceiver (102) according to claim 8, Among them, The time range (152) located at the start and / or end of the time range (152) block restricts the position of the corresponding moment to meet the synchronization enabling criteria.

10. The transceiver (102) according to claim 9, Among them, The synchronization enabling criteria specify that the corresponding moment (144) is located - at the corresponding grid position of the periodic time grid, - within a predefined time span around the corresponding grid position of the periodic time grid, or - within a predefined time span with a predefined offset towards the corresponding grid position of the periodic time grid.

11. The transceiver (102) according to any one of claims 8 to 10, Among them, The time range (152) located at the start and / or end of the time range (152) group of the time distance limit function is smaller than the time range (152) located at the center of the time range group.

12. The transceiver (102) according to any one of claims 8 to 11, Among them, The time range (152) located at the start and / or end of the time range (152) group defines a smaller maximum allowable distance for the corresponding moment of the hopping pattern (140) towards the corresponding grid position of the periodic grid (160) than the time range (152) located at the center of the time range group.

13. The transceiver (102) according to any one of claims 8 to 12, Among them, Each moment (144) block (172) includes at least five moments (144).

14. A transceiver (102) of a wireless communication network, Among them, The transceiver (102) is configured to transmit and / or receive data using a hopping pattern (140), and the hopping pattern (140) defines a sequence of moments (144) relative to a periodic grid (160), wherein the transceiver (102) is configured to determine the hopping pattern (140) by determining the time offset between the moment (144) of at least the moment (144) block (172) of the moment (144) sequence and the corresponding grid position of the periodic time grid by using a first determination function and a second determination function, wherein, according to the first determination function, the time offset is pseudo-randomly distributed within the corresponding time offset range (153), and wherein, for the second moment and each subsequent moment of the moment (144) block (172), the time offset range (153) is defined by the corresponding relative minimum time distance and relative maximum time difference relative to the immediately preceding moment, and wherein the relative minimum time distance and relative maximum time distance are defined separately based on the mapping function of the second moment and each subsequent moment of the moment (144) block (172), wherein, according to the second determination function, a window function is applied to the time offset obtained by the first determination function.

15. The transceiver (102) according to claim 14, Among them, The window function restricts the time offset obtained by the first determination function and / or wherein, the window function limits the absolute time difference between the immediately succeeding instances (144) of the instance (144) block (172) within an absolute time difference range defined by an absolute maximum time difference and an absolute minimum time difference.

16. The transceiver (102) according to any one of claims 14 to 15, Among them, The window function reduces the time offset between the instance (144) located at the start and / or end of the time range (152) block (172) and the corresponding grid position to a value greater than the time offset between the instance (144) located at the center of the instance (144) block (172) and the corresponding grid position.

17. The transceiver (102) according to any one of claims 14 to 16, Among them, The window function reduces the time offset between the instance (144) located at the start and / or end of the instance (144) block (172) and the corresponding grid position such that the corresponding instance (144) meets the synchronization enabling criterion.

18. The transceiver (102) according to claim 17, Among them, The synchronization enabling criterion specifies that the corresponding instance (144) is located - at the corresponding grid position of the periodic time grid, or - within a predefined time span around the corresponding grid position of the periodic time grid, or - within a predefined time span having a predefined offset towards the corresponding grid position of the periodic time grid, where i is equal to or greater than 5.

19. The transceiver (102) according to claim 18, Among them, The transceiver (102) is configured to synchronize with the hopping pattern (140) based on the synchronization enabling criterion.

20. The transceiver (102) according to any one of claims 14 to 19, Among them, The mapping function is table-based.

21. The transceiver (102) according to any one of claims 14 to 20, Among them, The window function is table-based.

22. The transceiver (102) according to any one of claims 14 to 21, Among them, The transceiver (102) is configured to further determine the hopping pattern (140) using a third determination function, wherein, according to the third determination function, an offset is applied to at least a continuous portion of the time offset.

23. The transceiver (102) according to any one of claims 1 to 22, Among them, The data is segmented into a plurality of sub-packets, and each sub-packet is transmitted at an instance.

24. The transceiver (102) according to any one of claims 1 to 23, Among them, The transceiver (102) is configured to determine the hopping pattern (140) using a mapping function that takes into account a first determination constraint and a second determination constraint, wherein the mapping function pseudo-randomly determines a time distance based on at least one of the ID of the base station of the wireless communication network and the sequence index or a corresponding partial thereof.

25. The transceiver (102) according to any one of claims 1 to 24, Among them, The transceiver (102) is a node of a wireless communication network.

26. The transceiver (102) according to claims 24 and 25, Among them, When synchronized with the wireless communication network, the transceiver (102) obtains the ID of the base station of the wireless communication network and the block number.

27. The transceiver (102) according to any one of claims 1 to 24, Among them, The transceiver (102) is a base station of a wireless communication network.

28. A transceiver (102) of a wireless communication network, Among them, The transceiver (102) is configured to transmit and / or receive data using a hopping pattern (140), wherein the transceiver (102) is configured to determine the nth moment of the hopping pattern (140) based on the following formula: wherein, R RE (n) describes a pseudo-random time offset corresponding to a respective position relative to a periodic time grid, where R RE ′(n) describes a pseudo-random time offset sequence, where n is a natural number, where m = n modulo 36, where w(m) describes a window function, where R DC (n) describes a pseudo-random offset.

29. The transceiver (102) according to claim 28, Among them, R RE ′(n) where r(n) is a pseudo-random sequence.

30. The transceiver (102) according to claim 29, Among them, The transceiver (102) is configured to determine the pseudo-random sequence r(n) based on the following formula: where BSSHT_CRC(n) is a pseudo-random number depending on the ID of the base station and the nth moment or its corresponding part, and where c(m) is a time pattern step size, where N RE,bea describes the number of elements for which the calculation of BSSHT_CRC(n) must be recalculated after it.

31. The transceiver (102) according to claim 30, Among them, The transceiver (102) is configured to determine the step size c(m) based on m according to the following table:

32. The transceiver (102) according to any one of claims 28 to 31, Among them, The transceiver (102) is configured to determine the window function w(m) based on m according to the following table:

33. The transceiver (102) according to any one of claims 28 to 32, Among them, The transceiver (102) is configured to determine a pseudo-random offset R based on the following formula DC (n): R DC I(n) = CRC32(BSSHE(R E (n))) modulo 2 16 where CRC32 is a 32-bit cyclic redundancy check, Among them, Among them, BSSHE is the combination number obtained by combining R E (n) and the short address of the base station.

34. The transceiver (102) according to any one of claims 28 to 33, Among them, The transceiver (102) is configured to determine the time difference between successive hops of the hopping pattern (140) based on the following formula: Among them, is the symbol duration, where N RE is the total number of times (144).

35. A method for transmitting and / or receiving data, the method comprising: Transmitting and / or receiving data using a hopping pattern (140), the hopping pattern defining a sequence of moments (144) relative to a periodic grid (160), Determining the hopping pattern (140) by considering a first determination constraint and a second determination constraint to determine the time distance between successive moments (144) of the sequence of moments (144), where the first determination constraint specifies that the time distance is pseudo-randomly distributed between a predefined minimum time distance (164) and a predefined maximum time distance (166), where the second determination constraint specifies that the time distance lies within a corresponding time range (152) defined by a time distance limiting function, each time range (152) defining the maximum allowable distance of a corresponding moment of the hopping pattern (140) towards a corresponding grid position of the periodic grid (160), where, in the case where a moment specified by the first determination constraint is not within the corresponding time range of the time distance limiting function specified by the second determination constraint, the moment is mapped to the corresponding time range of the time distance limiting function specified by the second determination constraint.

36. A method for transmitting and / or receiving data, the method comprising: Data is transmitted and / or received using a hopping pattern (140) that defines a sequence of instants (144) relative to a periodic time grid. The hopping pattern (140) is determined by determining a time offset between at least an instant block (172) of the sequence of instants (144) and a corresponding grid position of the periodic time grid using a first determination function and a second determination function. Wherein, according to the first determination function, the time offset is pseudo-randomly distributed within a corresponding time offset range (153), and wherein, for a second instant and each subsequent instant of the instant block (172), the time offset range (153) is defined by a corresponding relative minimum time distance and a relative maximum time difference with respect to the immediately preceding instant, and wherein the relative minimum time distance and the relative maximum time distance are defined individually based on a mapping function of the second instant and each subsequent instant of the instant block (172). Wherein, according to the second determination function, a window function is applied to the time offset obtained by the first determination function.

37. A method for transmitting and / or receiving data, the method comprising: Transmitting and / or receiving data using a hopping pattern (140). Determining the nth instant of the hopping pattern (140) based on the following formula: wherein, R RE (n) describes a pseudo-random time offset corresponding to the respective position relative to the periodic time grid, where R RE ′(n) describes a pseudo-random time offset sequence, Where n is a natural number. Where m = n modulo 36. Where w(m) describes the window function. wherein, R DC (n) describes a pseudo-random offset.

38. A computer program for performing the method according to any one of claims 35 to 37 when the computer program is run on a computer, a microprocessor or a software-defined radio.

Images