Unipolar binary sequences with improved aperiodic correlation behavior for unsynchronized TSMA systems

Abstract

Embodiments of the present invention relate to a method for generating a hopping pattern for transmitting a plurality of sub-data packets in a communication system. The method comprises the step of deriving the hopping pattern from a binary sequence, wherein the autocorrelation function of the binary sequence has an autocorrelation side maximum with a predetermined maximum value. The method further comprises the step of determining a maximum sub-data packet length for the plurality of sub-data packets based on a total transmission duration of the plurality of sub-data packets specified by the hopping pattern and a minimum value of a difference sequence of sorted difference sequences derived from the binary sequence.

Description

Technical Field

[0001] Embodiments of the present invention relate to a data transmitter, and more particularly, to a data transmitter that transmits data using a hopping pattern. Further embodiments relate to a data receiver, and more particularly, to a data receiver that receives data transmitted using a hopping pattern. Some embodiments relate to the design of a unipolar binary sequence with improved aperiodic correlation behavior for an asynchronous TSMA (Telegram Division Multiple Access) system. Background Art

[0002] The so-called telegram splitting method is known from [1], in which a coded message (e.g. a data packet (e.g. of the physical layer)) is split into a plurality of sub-data packets (or partial data packets), wherein each of the plurality of sub-data packets comprises only a part of the coded message and wherein the plurality of sub-data packets are transmitted distributed in time and optionally in frequency according to a hopping pattern.

[0003] In [2], an improved coverage of a LPWAN (Low Power Wide Area Network) system based on telegram splitting is described.

[0004] In [3], improved transmission security for LPWAN systems based on telegram splitting is described.

[0005] In [9], a UNB (Ultra Narrow Band) LPWAN system based on the telegram splitting approach is described.

[0006] In non-synchronous (asynchronous) LPWAN systems, such as those defined in [9], a large number of participants (e.g., sensor nodes) typically access the available frequency band simultaneously. This can lead to conflicts between transmissions from different nodes. Summary of the invention

[0007] Therefore, an object of the present invention is to reduce the probability of collision when a large number of users simultaneously access the available frequency band.

[0008] This object is achieved by the independent claims.

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

[0010] An embodiment provides a data transmitter of a communication system, wherein the communication system performs wireless communication in a frequency band used by multiple communication systems for communication, the data transmitter being configured to split a data packet into multiple sub-data packets and transmit the multiple sub-data packets in accordance with a frequency hopping pattern [e.g., a time hopping and / or a frequency hopping pattern], wherein the hopping pattern is derived from a [e.g., a unipolar] binary sequence, wherein the autocorrelation function of the binary sequence includes an autocorrelation side maximum with a predetermined maximum value [e.g., λ=1 or λ=2] [or, for example, wherein the autocorrelation side value of the autocorrelation function of the binary sequence takes a value of at most 1 or 2], wherein a minimum total transmission duration for transmitting the multiple sub-data packets, and / or a maximum length of the sub-data packets, one or both of which depends on the minimum value of a difference sequence of an ordered difference sequence derived from the binary sequence [such that the autocorrelation side maximum value of the transmitted autocorrelation function of the multiple sub-data packets includes the same maximum value as the autocorrelation side maximum value of the autocorrelation function of the binary sequence, for example, or such that the autocorrelation side value of the autocorrelation function of the hopping pattern takes a value of at most 1 or 2, for example].

[0011] In an embodiment, the difference sequence may indicate or specify all distances between all elements [e.g., numbers] of a binary sequence having predetermined logical values ​​[e.g., a first logical value, e.g., like logical one, 1] [in a predetermined order [e.g., in ascending or descending order]], wherein the difference sequence indicates all differences between directly adjacent values ​​of the difference sequence.

[0012] In an embodiment, the binary sequence may map, or at least partially map, a Golomb ruler, a mirrored version of a Golomb ruler, or a Bark sequence.

[0013] In an embodiment, the autocorrelation side maximum value of the autocorrelation function of the transmitted plurality of sub-data packets may include the same maximum value as the autocorrelation side maximum value of the autocorrelation function of the binary sequence.

[0014] In an embodiment, one of the following elements

[0015] - minimum total launch duration, and

[0016] - Maximum length of a sub-data packet

[0017] depending on

[0018] - symbol duration,

[0019] - the number of sub-data groups,

[0020] - the minimum value of the difference sequence of the sorted difference series, and

[0021] Another element of the total transmission duration and the length of the sub-data packets [eg such that the autocorrelation side maximum of the transmitted autocorrelation function of the plurality of sub-data packets comprises the same maximum value as the autocorrelation side maximum of the autocorrelation function of the binary sequence].

[0022] In an embodiment, the maximum length X of a sub-data packet is SP For symbol duration T S , the number of sub-data packets N and the total transmission duration T GSD The dependency is based on the following formula:

[0023]

[0024] in Describes the minimum value of the difference sequence of the sorted difference series.

[0025] In an embodiment, the minimum total transmission duration T GSD For symbol duration T S , the number of sub-data packets N and the maximum length of the sub-data packets X SP The dependency is based on the following formula:

[0026]

[0027] in Describes the minimum value of the difference sequence of the sorted difference series.

[0028] In an embodiment, a first logic value [eg, logic one, 1] of the binary sequence may indicate transmission of a sub-data packet, wherein a second logic value [eg, logic zero, eg, 0] of the binary sequence may indicate a pause in transmission.

[0029] In an embodiment, the labeled integral positions of the Golomb ruler or their mirrored versions may be respectively mapped by a first logical value [e.g., logical one, 1] in a binary sequence, wherein each of the unlabeled integral positions of the Golomb ruler or their mirrored versions may be mapped by a second logical value [e.g., logical zero, 0] in the binary sequence.

[0030] In an embodiment, the number of marked integration positions of the Columbus ruler or its mirrored version may correspond to the number of sub-data packets.

[0031] In an embodiment, a communication system may perform wireless communications in a frequency band used for communications by a plurality of communication systems, wherein a data receiver is configured to receive a plurality of sub-data packets that are distributed and sent in accordance with a hopping pattern, and to combine the plurality of sub-data packets to obtain a data packet split into the plurality of sub-data packets, wherein the hopping pattern is derived from a binary sequence, wherein an autocorrelation function of the binary sequence includes an autocorrelation side maximum value having a predetermined maximum value [e.g., λ=1 or λ=2], wherein a minimum total transmission duration for transmitting the plurality of sub-data packets and / or a maximum length of the sub-data packets depends on a minimum value of a difference sequence of an ordered difference sequence derived from the binary sequence [such that, for example, an autocorrelation side maximum value of an autocorrelation function of the transmission of the plurality of sub-data packets includes a maximum value that is the same as an autocorrelation side maximum value of an autocorrelation function of the binary sequence].

[0032] In an embodiment, the difference sequence may indicate all distances between all elements [e.g., numbers] of a binary sequence comprising predetermined logical values ​​[a first logical value, such as logical one, 1] [in a predetermined order [e.g., in ascending or descending order]], wherein the difference sequence indicates all differences between directly adjacent values ​​of the difference sequence.

[0033] In an embodiment, the binary sequence may map, or at least partially map, a Golomb ruler, a mirrored version of a Golomb ruler, or a Bark sequence.

[0034] In an embodiment, the autocorrelation side maximum value of the autocorrelation function of the transmitted plurality of sub-data packets may include the same maximum value as the autocorrelation side maximum value of the autocorrelation function of the binary sequence.

[0035] In an embodiment, one of the following elements

[0036] - minimum total launch duration, and

[0037] - Maximum length of a sub-data packet

[0038] depending on

[0039] - symbol duration,

[0040] - the number of sub-data groups,

[0041] - the minimum value of the difference sequence of the sorted difference series, and

[0042] - another element of the total transmission duration and the length of the sub-data packets [such that for example the autocorrelation side maximum of the transmitted autocorrelation function of a plurality of sub-data packets comprises the same maximum as the autocorrelation side maximum of the autocorrelation function of the binary sequence].

[0043] In an embodiment, the maximum length X of a sub-data packet is SPFor symbol duration T S , the number of sub-data packets N and the total transmission duration T GSD The dependency is based on the following formula:

[0044]

[0045] in Describes the minimum value of the difference sequence of the sorted difference series.

[0046] In an embodiment, the minimum total transmission duration T GSD For symbol duration T S , the number of sub-data packets N and the maximum length of the sub-data packets X SP The dependency is based on the following formula:

[0047]

[0048] in Describes the minimum value of the difference sequence of the sorted difference series.

[0049] In an embodiment, a first logic value [eg, logic one, 1] of the binary sequence may indicate transmission of a sub-data packet, wherein a second logic value [eg, logic zero, eg, 0] of the binary sequence may indicate a pause in transmission.

[0050] In an embodiment, each of the marked integral positions of the Golomb ruler or its mirrored version can be mapped by a first logical value [logical one, e.g., 1] in a binary sequence, wherein each of the unmarked integral positions of the Golomb ruler or its mirrored version can be mapped by a second logical value [e.g., logical zero, 0] in the binary sequence.

[0051] In an embodiment, the number of marked integration positions of the Columbus ruler or its mirrored version may correspond to the number of sub-data packets.

[0052] A further embodiment provides a method for sending a data packet in a communication system, wherein the communication system communicates wirelessly in a frequency band used by multiple communication systems for communication. The method comprises the step of splitting the data packet into a plurality of sub-data packets. Furthermore, the method comprises the step of transmitting a plurality of sub-data packets in accordance with a hopping pattern [e.g., a time hopping and / or a frequency hopping pattern], wherein the hopping pattern is derived from a binary sequence, wherein the autocorrelation function of the binary sequence comprises an autocorrelation side maximum having a predetermined maximum value [e.g., λ=1 or λ=2], wherein the minimum total transmission duration in which the plurality of sub-data packets are transmitted, and / or the maximum length of the sub-data packets depends on the minimum value of a difference sequence of an ordered difference sequence derived from the binary sequence [such that, for example, the autocorrelation side maximum of the autocorrelation function of the transmission of the plurality of sub-data packets comprises the same maximum value as the autocorrelation side maximum of the autocorrelation function of the binary sequence].

[0053] A further embodiment provides a method for receiving a data packet in a communication system, wherein the communication system performs wireless communication in a frequency band used by multiple communication systems for communication. The method includes the step of receiving a plurality of sub-data packets that are distributed and transmitted in accordance with a hopping pattern. In addition, the method includes the step of combining the plurality of sub-data packets to obtain a data packet split into a plurality of sub-data packets, wherein the hopping pattern is derived from a binary sequence, wherein the autocorrelation function of the binary sequence includes an autocorrelation side maximum with a predetermined maximum value [e.g., λ=1 or λ=2], wherein the minimum total transmission duration in which the plurality of sub-data packets are transmitted, and / or the maximum length of the sub-data packet depends on the minimum value of a difference sequence of an ordered difference sequence derived from the binary sequence [such that, for example, the autocorrelation side maximum of the autocorrelation function of the transmission of the plurality of sub-data packets includes the same maximum value as the autocorrelation side maximum of the autocorrelation function of the binary sequence].

[0054] A further embodiment provides a method for generating a hopping pattern for transmitting a plurality of sub-data packets in a communication system. The method comprises the step of deriving the hopping pattern from a binary sequence, wherein the autocorrelation function of the binary sequence comprises an autocorrelation side maximum having a predetermined maximum value [e.g., λ=1 or λ=2]. In addition, the method comprises the step of determining a maximum sub-data packet length [a time length, e.g., such as the number of symbols] of the plurality of sub-data packets according to the total transmission duration of the plurality of sub-data packets indicated by the hopping pattern, and a minimum value of a difference sequence of an ordered difference sequence derived from the binary sequence [such that, for example, the autocorrelation side maximum of the autocorrelation function of the transmission of the plurality of sub-data packets consistent with the hopping pattern comprises the same maximum value as the autocorrelation side maximum of the autocorrelation function of the binary sequence].

[0055] In an embodiment, the maximum sub-data packet length may be additionally determined based on the symbol duration and the number of sub-data packets.

[0056] In an embodiment, the maximum sub-data packet length X SP Determined by the following formula:

[0057]

[0058] Where T GSD Describes the total transmission duration of multiple sub-data packets, where T S describes the symbol duration, where N describes the number of sub-data packets, where Describes the minimum value of the difference sequence of the sorted difference series.

[0059] In an embodiment, the difference sequence may indicate all distances between all digits of a binary sequence [in a predetermined order [such as ascending or descending order]], which includes a predetermined logical value [a first logical value, for example, similar to logical one, 1], wherein the difference sequence indicates all differences between directly adjacent values ​​of the difference sequence.

[0060] A further embodiment provides a method for generating (K) hopping patterns having predetermined autocorrelation properties or characteristics [and, for example, predetermined cross-correlation characteristics]. The method comprises the step of providing a unipolar basic binary sequence derived from a Golomb ruler or Barker sequence, the Golomb ruler or Barker sequence comprising a predetermined order (E) [and, for example, a predetermined length L (=E)]. The method additionally comprises the step of deriving a plurality of binary sequences from the basic binary sequence based on different arrangements of distances between successive elements of the basic binary sequence having a predetermined logical value [e.g., a first logical value, such as, for example, a logical one, 1]. Furthermore, the method comprises the step of determining a difference sequence for each of the plurality of binary sequences to obtain a plurality of difference sequences of the plurality of binary sequences, wherein the respective difference sequence represents all distances between all elements [e.g., numbers] of the respective binary sequence comprising a predetermined logical value [e.g., a first logical value, such as, for example, a logical one, 1]. The method additionally comprises the step of determining a difference sequence for each of the plurality of difference sequences to obtain a plurality of difference sequences of the plurality of difference sequences, wherein the respective difference sequence indicates all differences between directly adjacent values ​​of the respective difference sequence. In addition, the method comprises the step of determining a minimum value for each of the plurality of difference sequences to obtain a plurality of minimum values. In addition, the method comprises the step of selecting a predetermined number K of binary sequences from the plurality of binary sequences, wherein those binary sequences whose minimum values ​​are the largest are selected from the plurality of binary sequences. In addition, the method comprises the step of deriving a hopping pattern from each of the K selected binary sequences to obtain K hopping patterns.

[0061] In an embodiment, deriving a plurality of binary sequences from a basic binary sequence may include determining a basic distance sequence based on the basic binary sequence, wherein the basic distance sequence indicates all distances between successive elements of a binary sequence comprising a predetermined logical value [a first logical value, such as, for example, logical one, 1]. Additionally, deriving a plurality of binary sequences from the basic binary sequence may include the step of permuting [e.g., randomly swapping or changing order] elements of the basic distance sequence to obtain a plurality of different distance sequences. Deriving a plurality of binary sequences from the basic binary sequence may include the step of calculating a plurality of binary sequences from a plurality of difference distance sequences, such that respective binary sequences of the plurality of binary sequences include elements having predetermined logical values ​​[a first logical value, such as, for example, logical one, 1] at those positions or numbers indicated by the respective distance sequences.

[0062] In an embodiment, when deriving the K hopping patterns from the K selected binary sequences, elements of corresponding binary sequences of the plurality of binary sequences are provided with a factor that depends on the total transmission duration and the symbol duration.

[0063] In an embodiment, a basic binary sequence may be provided with a factor that depends on the total transmission duration and the symbol duration.

[0064] In an embodiment, when K hopping patterns are derived from K selected binary sequences, the sending time or transmission timing of the corresponding hopping pattern may be derived from the corresponding binary sequence.

[0065] In an embodiment, the method may further include the step of randomly generating at least two transmission frequency sequences from the set of available transmission frequencies for at least two of the K hopping patterns. In addition, the method may include the step of calculating a two-dimensional cross-correlation function between the at least two hopping patterns. In addition, the method may include the step of checking whether the cross-correlation boundary value of the two-dimensional cross-correlation function does not exceed a predetermined maximum value [for example, λ=1 or λ=2]. In addition, the method may include the step of providing at least two hopping patterns in the case where the cross-correlation boundary value does not exceed the predetermined maximum value. In addition, the method may include, in the case where the cross-correlation boundary value exceeds the predetermined maximum value, permuting at least one of the at least two transmission frequency sequences, and performing again the steps of calculating the two-dimensional cross-correlation function and checking whether the cross-correlation boundary value of the two-dimensional cross-correlation function does not exceed the predetermined maximum value, wherein the transmission frequencies indicated by the at least two transmission frequency sequences are [averaged, for example] distributed as evenly as possible over the set of available transmission frequencies.

[0066] In an embodiment, the predetermined maximum value of the cross-correlation margin of the cross-correlation function may be one or two.

[0067] In an embodiment, the maximum length of the sub-data packet that can be sent with the corresponding hopping pattern is selected so that the autocorrelation function of the version of the hopping pattern projected onto the time axis includes [exclusively, for example] an autocorrelation edge value that is less than or equal to one, wherein the predetermined maximum value of the cross-correlation edge value of the two-dimensional cross-correlation function is 1, wherein the number of transmission frequencies required in the transmission frequency set here can be estimated [e.g. determined] based on the following formula:

[0068] C≥floor(1.9·K)

[0069] Where C describes the number of required transmission frequencies, and where K describes the number of different hopping patterns.

[0070] In an embodiment, the maximum length of a sub-data packet may be determined according to the following formula:

[0071]

[0072] Where T GSD Describes the total transmission duration of multiple sub-data packets, where T S describes the symbol duration, where N describes the number of sub-data packets, where Describes the minimum value of the difference sequence of the sorted difference series.

[0073] In an embodiment, the maximum length of a sub-data packet that can be transmitted with a corresponding hopping pattern can be selected so that the autocorrelation function of the version of the hopping pattern projected onto the time axis includes [exclusively, for example] autocorrelation edge values ​​that are less than or equal to a threshold value T [for example two or three], wherein the maximum value of the cross-correlation edge values ​​of the two-dimensional cross-correlation function is less than or equal to the same threshold value T, wherein the number of transmission frequencies required here in the set of transmission frequencies can be determined based on the following formula:

[0074] C≥floor(1.5·T·K)

[0075] where C describes the number of transmission frequencies, and where K describes the number of different hopping patterns, where threshold T [is typically a natural number, and] describes the factor by which the maximum value is greater than one.

[0076] In an embodiment, the maximum length of a sub-data packet may be determined according to the following formula:

[0077]

[0078] Where T GSD Describes the total transmission duration of multiple sub-data packets, where T S describes the symbol duration, where N describes the number of sub-data packets, where Describes the minimum value of the difference sequence of the sorted difference sequence, where T [eg, is a natural number, and] describes the factor whose maximum value is greater than one.

[0079] A further embodiment provides a data transmitter configured to transmit a signal in accordance with a hopping pattern, wherein the hopping pattern is a time hopping pattern, a frequency hopping pattern, or a combination of a time hopping pattern and a frequency hopping pattern, wherein the time hopping pattern is one of the three time hopping patterns mentioned in the following table, each pattern having eight hops:

[0080]

[0081] wherein, in the table, each row is a time hopping pattern, wherein, in the table, each column is a hop of the corresponding time hopping pattern starting from the second hop, such that each time hopping pattern includes eight hops, wherein, in the table, each cell specifies the time distance in symbol duration or multiples of symbol duration from a reference point [e.g., center, start, or end] of the corresponding hop to an equal reference point [e.g., center, start, or end] of the immediately preceding hop, wherein the frequency hopping pattern is one of the three frequency hopping patterns mentioned in the following table, each frequency hopping pattern having eight hops:

[0082]

[0083] In the table, each row is a frequency hopping pattern, in the table, each column is a hopping of a corresponding frequency hopping pattern, and in the table, each cell indicates the number of frequency channels of a corresponding hopping of a corresponding frequency hopping pattern.

[0084] A further embodiment provides a data transmitter configured to transmit a signal in accordance with a hopping pattern, wherein the hopping pattern is a time hopping pattern, a frequency hopping pattern, or a combination of a time hopping pattern and a frequency hopping pattern, wherein the time hopping pattern is one of the three time hopping patterns mentioned in the following table, each pattern having eight hops:

[0085]

[0086] wherein, in the table, each row is a time hopping pattern, wherein, in the table, each column is a hop of the corresponding time hopping pattern starting from the second hop, such that each time hopping pattern includes eight hops, wherein, in the table, each cell specifies the time distance of a reference point [e.g., center, start, or end] of the corresponding hop to an equal reference point [e.g., center, start, or end] of the immediately preceding hop, wherein the frequency hopping pattern is one of the three frequency hopping patterns mentioned in the following table, each frequency hopping pattern having eight hops:

[0087]

[0088] In the table, each row is a frequency hopping pattern, in the table, each column is a hopping of a corresponding frequency hopping pattern, and in the table, each cell indicates the number of frequency channels of a corresponding hopping of a corresponding frequency hopping pattern.

[0089] A further embodiment provides a data transmitter configured to transmit a signal in accordance with a hopping pattern, wherein the hopping pattern is a time hopping pattern, a frequency hopping pattern, or a combination of a time hopping pattern and a frequency hopping pattern, wherein the time hopping pattern is one of the three time hopping patterns mentioned in the following table, each pattern having eight hops:

[0090]

[0091] wherein, in the table, each row is a time hopping pattern, wherein, in the table, each column is a hop of the corresponding time hopping pattern starting from the second hop, such that each time hopping pattern includes eight hops, wherein, in the table, each cell specifies the time distance in symbol duration or multiples of symbol duration of a reference point [e.g., center, start, or end] of the corresponding hop from an equal reference point [e.g., center, start, or end] of the immediately preceding hop, wherein the frequency hopping pattern is one of the three frequency hopping patterns mentioned in the following table, each frequency hopping pattern having eight hops:

[0092]

[0093] In the table, each row is a frequency hopping pattern, in the table, each column is a hopping of a corresponding frequency hopping pattern, and in the table, each cell indicates the number of frequency channels of a corresponding hopping of a corresponding frequency hopping pattern.

[0094] In an embodiment, the data transmitter may be configured to transmit, via the data signal, eight sub-data packets in accordance with the hopping pattern [such that, for example, one of the eight sub-data packets is transmitted with each hopping of the hopping pattern].

[0095] In an embodiment, the data transmitter may be configured to provide at least 24 uplink sub-data packets [e.g., uplink radio pulses] in accordance with the ETSI TS 103 357 standard, wherein the data transmitter is configured to combine 3 of the 24 uplink sub-data packets to form a long sub-data packet to obtain eight long sub-data packets, wherein the data transmitter is configured to transmit the eight long sub-data packets via a data signal in accordance with a hopping pattern [such that, for example, one of the eight long sub-data packets is transmitted with each hop of the hopping pattern].

[0096] In an embodiment, the data transmitter may be configured to provide 24 uplink sub-data packets of a core frame of the ETSI TS 103 357 standard.

[0097] In an embodiment, the data transmitter may be configured to provide 24 uplink sub-data packets of a core frame of the ETSI TS 103 357 standard, and to combine 3 of the 24 uplink sub-data packets of each core frame to form a long sub-data packet to obtain eight long sub-data packets for the core frame, wherein the data transmitter is additionally configured to provide further uplink sub-data packets of an extended frame of the ETSI TS 103 357 standard, and the data transmitter is configured to [not combine them to, for example, form long sub-data packets, but to] transmit the uplink sub-data packets of the extended frame in accordance with the ETSI TS 103 357 standard.

[0098] In an embodiment, the data transmitter may be configured to provide 24 uplink sub-data packets of a core frame of the ETSI TS 103 357 standard, and to combine 3 of the 24 uplink sub-data packets of each core frame to form a long sub-data packet to obtain eight long sub-data packets for the core frame, wherein the data transmitter is configured to provide further uplink sub-data packets of an extended frame of the ETSI TS103 357 standard, wherein the data transmitter is configured to combine every 3 of the uplink sub-data packets of the extended frame to form a long sub-data packet.

[0099] A further embodiment provides a data receiver configured to receive a signal in accordance with a hopping pattern, wherein the hopping pattern is a time hopping pattern, a frequency hopping pattern, or a combination of a time hopping pattern and a frequency hopping pattern, wherein the time hopping pattern is one of the three time hopping patterns mentioned in the following table, each time hopping pattern having eight hops:

[0100]

[0101]

[0102] wherein, in the table, each row is a time hopping pattern, wherein, in the table, each column is a hop of the corresponding time hopping pattern starting from the second hop, such that each time hopping pattern includes eight hops, wherein, in the table, each cell specifies the time distance in symbol duration or multiples of symbol duration of a reference point [e.g., center, start, or end] of the corresponding hop from an equal reference point [e.g., center, start, or end] of the immediately preceding hop, wherein the frequency hopping pattern is one of the three frequency hopping patterns mentioned in the following table, each frequency hopping pattern having eight hops:

[0103]

[0104] In the table, each row is a frequency hopping pattern, in the table, each column is a hopping of a corresponding frequency hopping pattern, and in the table, each cell indicates the number of frequency channels of a corresponding hopping of a corresponding frequency hopping pattern.

[0105] A further embodiment provides a data receiver configured to receive a signal in accordance with a hopping pattern, wherein the hopping pattern is a time hopping pattern, a frequency hopping pattern, or a combination of a time hopping pattern and a frequency hopping pattern, wherein the time hopping pattern is one of the three time hopping patterns mentioned in the following table, each time hopping pattern having eight hops:

[0106]

[0107] wherein, in the table, each row is a time hopping pattern, wherein, in the table, each column is a hop of the corresponding time hopping pattern starting from the second hop, such that each time hopping pattern includes eight hops, wherein, in the table, each cell specifies the time distance in symbol duration or multiples of symbol duration of a reference point [e.g., center, start, or end] of the corresponding hop from an equal reference point [e.g., center, start, or end] of the immediately preceding hop, wherein the frequency hopping pattern is one of the three frequency hopping patterns mentioned in the following table, each frequency hopping pattern having eight hops:

[0108]

[0109] In the table, each row is a frequency hopping pattern, in the table, each column is a hopping of a corresponding frequency hopping pattern, and in the table, each cell indicates the number of frequency channels of a corresponding hopping of a corresponding frequency hopping pattern.

[0110] A further embodiment provides a data receiver configured to receive a signal in accordance with a hopping pattern, wherein the hopping pattern is a time hopping pattern, a frequency hopping pattern, or a combination of a time hopping pattern and a frequency hopping pattern, wherein the time hopping pattern is one of the three time hopping patterns mentioned in the following table, each time hopping pattern having eight hops:

[0111]

[0112] wherein, in the table, each row is a time hopping pattern, wherein, in the table, each column is a hop of the corresponding time hopping pattern starting from the second hop, such that each time hopping pattern includes eight hops, wherein, in the table, each cell specifies the time distance in symbol duration or multiples of symbol duration of a reference point [e.g., center, start, or end] of the corresponding hop from an equal reference point [e.g., center, start, or end] of the immediately preceding hop, wherein the frequency hopping pattern is one of the three frequency hopping patterns mentioned in the following table, each frequency hopping pattern having eight hops:

[0113]

[0114] In the table, each row is a frequency hopping pattern, in the table, each column is a hopping of a corresponding frequency hopping pattern, and in the table, each cell indicates the number of frequency channels of a corresponding hopping of a corresponding frequency hopping pattern.

[0115] In an embodiment, the data receiver may be configured to receive eight sub-data packets in accordance with the hopping pattern via the data signal [such that, for example, one of the eight sub-data packets is received with each hopping of the hopping pattern].

[0116] In an embodiment, the data receiver may be configured to receive, via a data signal, eight long sub-data packets in accordance with a hopping pattern [such that, for example, one of the eight long sub-data packets is received with each hop of the hopping pattern], wherein each of the eight long sub-data packets includes 3 of 24 uplink sub-data packets [e.g., uplink radio pulses] in accordance with the ETSI TS 103 357 standard, wherein the data receiver is configured to process the eight long sub-data packets to obtain 24 uplink sub-data packets.

[0117] In an embodiment, the 24 uplink sub-data packets may be 24 uplink sub-data packets of a core frame of the ETSI TS 103 357 standard.

[0118] In an embodiment, the data receiver may be additionally configured to receive uplink sub-data packets of an extended frame of the ETSI TS 103 357 standard.

[0119] In an embodiment, the data receiver may be additionally configured to receive further long sub-data packets, wherein each of the further long sub-data packets comprises three uplink sub-data packets [such as uplink radio pulses] of an extended frame consistent with the ETSI TS 103 357 standard, wherein the radio receiver is configured to process the further long sub-data packets to obtain the uplink sub-data packets.

[0120] In an embodiment, the data receiver may be configured to process the corresponding uplink sub-data packets in accordance with the ETSI TS 103 357 standard.

[0121] A further embodiment provides a method for transmitting a signal, the method comprising the step of transmitting a signal in accordance with a hopping pattern, wherein the hopping pattern is a time hopping pattern, a frequency hopping pattern, or a combination of a time hopping pattern and a frequency hopping pattern, wherein the time hopping pattern is one of the three time hopping patterns mentioned in the following table, each time hopping pattern having eight hops:

[0122]

[0123] wherein, in the table, each row is a time hopping pattern, wherein, in the table, each column is a hop of the corresponding time hopping pattern starting from the second hop, such that each time hopping pattern includes eight hops, wherein, in the table, each cell specifies the time distance in symbol duration or multiples of symbol duration of a reference point [e.g., center, start, or end] of the corresponding hop from an equal reference point [e.g., center, start, or end] of the immediately preceding hop, wherein the frequency hopping pattern is one of the three frequency hopping patterns mentioned in the following table, each frequency hopping pattern having eight hops:

[0124]

[0125] In the table, each row is a frequency hopping pattern, in the table, each column is a hopping of a corresponding frequency hopping pattern, and in the table, each cell indicates the number of frequency channels of a corresponding hopping of a corresponding frequency hopping pattern.

[0126] A further embodiment provides a method for transmitting a signal, the method comprising the step of transmitting a signal in accordance 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 three time hopping patterns mentioned in the following table, each time hopping pattern having eight hops:

[0127]

[0128] wherein, in the table, each row is a time hopping pattern, wherein, in the table, each column is a transition of a corresponding time hopping pattern starting from a second transition, such that each time hopping pattern includes eight transitions, wherein in the table, each cell specifies the time distance in symbol duration or multiples of symbol duration of a reference point [e.g., center, start, or end] of a corresponding transition from an equal reference point [e.g., center, start, or end] of the immediately preceding transition,

[0129] The frequency hopping mode is one of the three frequency hopping modes mentioned in the following table, each of which has eight hops:

[0130]

[0131] In the table, each row is a frequency hopping pattern, in the table, each column is a hopping of a corresponding frequency hopping pattern, and in the table, each cell indicates the number of frequency channels of a corresponding hopping of a corresponding frequency hopping pattern.

[0132] A further embodiment provides a method for transmitting a signal, the method comprising the step of transmitting the signal in accordance with a hopping pattern, wherein the hopping pattern is a time hopping pattern, a frequency hopping pattern, or a combination of a time hopping pattern and a frequency hopping pattern,

[0133] The time-hopping mode is one of the three time-hopping modes mentioned in the table below. Each time-hopping mode has eight hopping modes.

[0134]

[0135] wherein, in the table, each row is a time hopping pattern, wherein, in the table, each column is a hop of the corresponding time hopping pattern starting from the second hop, such that each time hopping pattern includes eight hops, wherein, in the table, each cell specifies the time distance in symbol duration or multiples of symbol duration of a reference point [e.g., center, start, or end] of the corresponding hop from an equal reference point [e.g., center, start, or end] of the immediately preceding hop, wherein the frequency hopping pattern is one of the three frequency hopping patterns mentioned in the following table, each frequency hopping pattern having eight hops:

[0136]

[0137] In the table, each row is a frequency hopping pattern, in the table, each column is a hopping of a corresponding frequency hopping pattern, and in the table, each cell indicates the number of frequency channels of a corresponding hopping of a corresponding frequency hopping pattern.

[0138] A further embodiment provides a method for receiving a signal, the method comprising the step of receiving the signal in accordance 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 three time hopping patterns mentioned in the following table, each time hopping pattern having eight hops:

[0139]

[0140]

[0141] wherein, in the table, each row is a time hopping pattern, wherein, in the table, each column is a hop of the corresponding time hopping pattern starting from the second hop, such that each time hopping pattern includes eight hops, wherein, in the table, each cell specifies the time distance in symbol duration or multiples of symbol duration of a reference point [e.g., center, start, or end] of the corresponding hop from an equal reference point [e.g., center, start, or end] of the immediately preceding hop, wherein the frequency hopping pattern is one of the three frequency hopping patterns mentioned in the following table, each frequency hopping pattern having eight hops:

[0142]

[0143] In the table, each row is a frequency hopping pattern, in the table, each column is a hopping of a corresponding frequency hopping pattern, and in the table, each cell indicates the number of frequency channels of a corresponding hopping of a corresponding frequency hopping pattern.

[0144] A further embodiment provides a method for receiving a signal, the method comprising the step of receiving the signal in accordance 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 three time hopping patterns mentioned in the following table, each time hopping pattern having eight hops:

[0145]

[0146] wherein, in the table, each row is a time hopping pattern, wherein, in the table, each column is a hop of the corresponding time hopping pattern starting from the second hop, such that each time hopping pattern includes eight hops, wherein, in the table, each cell specifies the time distance in symbol duration or multiples of symbol duration of a reference point [e.g., center, start, or end] of the corresponding hop from an equal reference point [e.g., center, start, or end] of the immediately preceding hop, wherein the frequency hopping pattern is one of the three frequency hopping patterns mentioned in the following table, each frequency hopping pattern having eight hops:

[0147]

[0148]

[0149] In the table, each row is a frequency hopping pattern, in the table, each column is a hopping of a corresponding frequency hopping pattern, and in the table, each cell indicates the number of frequency channels of a corresponding hopping of a corresponding frequency hopping pattern.

[0150] A further embodiment provides a method for receiving a signal, the method comprising the step of receiving the signal in accordance 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 three time hopping patterns mentioned in the following table, each time hopping pattern having eight hops:

[0151]

[0152] wherein, in the table, each row is a time hopping pattern, wherein, in the table, each column is a hop of the corresponding time hopping pattern starting from the second hop, such that each time hopping pattern includes eight hops, wherein, in the table, each cell specifies the time distance in symbol duration or multiples of symbol duration of a reference point [e.g., center, start, or end] of the corresponding hop from an equal reference point [e.g., center, start, or end] of the immediately preceding hop, wherein the frequency hopping pattern is one of the three frequency hopping patterns mentioned in the following table, each frequency hopping pattern having eight hops:

[0153]

[0154] In the table, each row is a frequency hopping pattern, in the table, each column is a hopping of a corresponding frequency hopping pattern, and in the table, each cell indicates the number of frequency channels of a corresponding hopping of a corresponding frequency hopping pattern. BRIEF DESCRIPTION OF THE DRAWINGS

[0155] Embodiments of the present invention will be described in more detail below with reference to the accompanying drawings, in which:

[0156] Figure 1 A schematic circuit block diagram of a system having one or more data transmitters and data receivers is shown;

[0157] Figure 2 In the figure is shown the occupancy of the transmission channel when a plurality of sub-data packets are transmitted in accordance with the time hopping pattern and the frequency hopping pattern;

[0158] Figure 3 A schematic diagram of a Columbus ruler with E=5 marks and length N=12 is shown;

[0159] Figure 4 shows a graph of the order E or number L of sub-data packets plotted against the length N of different non-periodic unipolar binary sequences or the number of available resource elements;

[0160] Figure 5 ac shows the occupancy of the communication channel when sub-data packets are transmitted by three different subscribers (users);

[0161] Figure 6 ac shows a schematic diagram of the correlation of the Golomb mark of the Golomb ruler considering the symbol and the transmission duration with a transmission frame having L sub-data packets;

[0162] Figure 7 Shows Figure 6 The hopping pattern and sub-data packet length X SP = autocorrelation function for 120 symbols and a frame duration of 1020 ms;

[0163] Figure 8 The Columbus ruler G5(3) is shown with the frequency channel occupancy C5(3) and the sub-data packet length X SP = Schematic diagram of the two-dimensional (thumbnail) autocorrelation function (ACF) of 60 symbols;

[0164] Fig. 9 G5(1) and G5(2) are shown with respect to the frequency channel occupancy C5(1) and C5(2) and X SP = 60 Schematic diagram of the two-dimensional (thumbnail) cross-correlation function (CCF);

[0165] Fig.10 Shown with Figure 7 Compared to the frame duration, the frame duration is halved (T GSD =510ms) of the hopping pattern G3 (Equation (14));

[0166] Fig.11 A flow chart showing a method of sending data packets in a communication system;

[0167] Fig.12 A flow chart showing a method of receiving data packets in a communication system;

[0168] Fig.13 A flow chart showing a method of generating a hopping pattern for transmitting a plurality of sub-data packets in a communication system; and

[0169] Fig.14 A flow chart of a method for generating (K) hopping patterns having predetermined autocorrelation characteristics is shown. DETAILED DESCRIPTION

[0170] In the following description of the embodiments of the present invention, elements having the same or similar functions in the drawings are given the same reference numerals so that their descriptions are interchangeable.

[0171] Figure 1 A schematic circuit block diagram of a communication system having one or more data transmitters 100_1-100_n, n≥1, and a data receiver 110 is shown. Here, the communication system performs wireless communication in a frequency band used for communication by multiple communication systems (eg, an ISM frequency band).

[0172] exist Figure 1 In the communication system shown, a data transmitter, such as data transmitter 100_1, can be configured to split a data packet (e.g., of the physical layer) into multiple sub-data packets 142, and transmit multiple sub-data packets 142 distributed in time and / or frequency according to a hopping pattern 140, such as by a signal 120 including multiple sub-data packets 142.

[0173] The data receiver 110 may be configured to receive multiple sub-data packets 142 distributed in time and / or frequency according to the hopping pattern 140 and combine the multiple sub-data packets 142 to obtain a data packet (e.g., a physical layer data packet) divided into multiple sub-data packets 142.

[0174] like Figure 1 As illustrated in FIG. 1 , a data transmitter, such as data transmitter 100_1, may include a transmitting device (or a transmitting module, or a transmitter) 102 configured to transmit a signal 120 (e.g., having a plurality of sub-data packets 142). The transmitting device 102 may be connected to an antenna 104 (or an antenna array) of the data transmitter 100_1. The data transmitter 100_1 may further include a receiving device (or a receiving module, or a receiver) 106 configured to receive a signal. The receiving device 106 may be connected to the antenna 104 or another (separate) antenna (or antenna array) of the data transmitter 100_1. The data transmitter 100_1 may also include a combined transmitting / receiving device or transceiver.

[0175] The data receiver 110 may include a receiving device (or receiving module, or receiver) 116 configured to receive a signal 120 (e.g., including a plurality of sub-data packets 142). The receiving device 116 may be connected to an antenna 114 (or an antenna array) of the data receiver 110. Furthermore, the data receiver 110 may include a transmitting device (or transmitting module or transmitter) 112 configured to transmit a signal. The transmitting device 112 may be connected to the antenna 114 or another (separate) antenna (or (separate) antenna array) of the data receiver 110. The data receiver 110 may also include a combined transmitting / receiving device or transceiver.

[0176] For example, the data transmitter 100_1 may be a subscriber of the communication system, such as a terminal or a sensor node (e.g., a heat meter), and the data receiver 110 may be a base station of the communication system. Typically, the communication system includes at least one data receiver 110 (e.g., a base station) and a plurality of data transmitters 100_1-100_n (e.g., participants or subscribers). Of course, the data transmitter 100_1 may also be a base station of the communication system, and the data receiver 110 may be a participant of the communication system. In addition, both the data transmitter 100_1 and the data receiver 110 may be participants of the communication system. In addition, both the data transmitter 100_1 and the data receiver 110 may be base stations of the communication system.

[0177] As described above, the data transmitter 100_1 and the data receiver 110 can be configured to send and receive data using a telegram splitting method. Here, a telegram or data packet (e.g., a physical layer) is divided into a plurality of sub-data packets (or partial data packets, or sub-packets) 142, and the plurality of sub-data packets 142 are sent from the data transmitter 100_1 to the data receiver 110, which are distributed in time and / or frequency in accordance with the hopping pattern 140, wherein the data receiver 110 reassembles (or combines) the sub-data packets 142 to obtain the data packets. Each of the plurality of sub-data packets 142 contains only a portion of the data packet. The data packet can be further channel coded so that only a portion of the sub-data packets 142 are needed to decode the data packet without error, rather than all the sub-data packets 142.

[0178] As described above, the temporal distribution of the plurality of sub-data packets 142 may be distributed in accordance with a time hopping and / or frequency hopping pattern.

[0179] The time hopping mode can specify the transmission time sequence or transmission time interval of the transmission sub-data packets. For example, the first sub-data packet can be sent at a first transmission time (or in a first transmission time slot), and the second sub-data packet can be sent at a second transmission time (or in a second transmission time slot), wherein the first transmission time is different from the second transmission time. The time hopping mode can define (or predetermine or indicate) the first transmission time and the second transmission time. Alternatively, the time hopping mode can indicate the first transmission time and the time interval between the first transmission time and the second transmission time. Of course, the time hopping mode can also specify only the time interval between the first and second transmission times. There may be a transmission pause between the sub-data packets where no transmission occurs.

[0180] The frequency hopping pattern can specify a sequence of transmission frequencies or transmission frequency hopping of the transmission sub-data packets. For example, the first sub-data packet can be transmitted at a first transmission frequency (or in a first frequency channel), and the second sub-data packet can be transmitted 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 thus define (or predetermine or indicate) the first transmission frequency and the second transmission frequency. Alternatively, the frequency hopping pattern can specify the first transmission frequency and the frequency interval between the first transmission frequency and the second transmission frequency (transmission frequency hopping). Of course, the frequency hopping pattern can also only specify the frequency interval between the first transmission frequency and the second transmission frequency (transmission frequency hopping).

[0181] Of course, the plurality of sub-data packets 142 may also be sent from the data transmitter 100_1 to the data receiver 110 in a distributed manner in time and frequency. The distribution of the plurality of sub-data packets in time and frequency may be consistent with a time hopping and frequency hopping pattern. The time hopping and frequency hopping pattern may be a combination of a time hopping pattern and a frequency hopping pattern, i.e. a sequence of transmission times or transmission time intervals of the transmission sub-data packets, wherein the transmission frequency (or transmission frequency hopping) is associated with the transmission time (or transmission time interval).

[0182] Figure 2 The occupancy of a frequency band / transmission channel when a plurality of sub-data packets 142 are transmitted according to a time-hopping and frequency-hopping pattern 140 is shown in the form of a diagram, wherein the ordinate plots the frequency and the abscissa plots the time.

[0183] from Figure 2 As can be seen in FIG. 1 , a data packet can be split into, for example, L=7 sub-data packets 142 and distributed in time and frequency according to a time and frequency hopping pattern 140 and sent from the data transmitter 100_1 to the data receiver 110 .

[0184] like Figure 2 As can be further seen in FIG. 1 , the sub-data packet 142 may include a synchronization symbol 144 and a data symbol 146 .

[0185] Figure 1 and Figure 2 The communication system described in may be a LPWAN (Low Power Wide Area Network) system as specified, for example, in ETSI TS 103 357 [9].

[0186] Embodiments of the data transmitter 100_1 and / or the data receiver 110 described below may be implemented, for example, in an LWPAN system such as specified in ETSI TS 103 357 [9] or in any other communication system, for example, for wireless communication in a frequency band used by multiple communication systems for communication.

[0187] In an embodiment, a so-called "contention-based access method" is used. In this case, the participants 100_1-100_n (e.g. terminals) of the communication system do not have specially allocated resources at their disposal, but several participants 110_1-110_n actively access radio resources of the common range. This can lead to access conflicts, i.e. simultaneous occupation of resource elements by two or more participants. In the case of a "contention-based access method", the following variants can generally be roughly distinguished:

[0188] a) In the case of pure unidirectional data transmission from a participant (e.g. a terminal) to a base station, the participant transmits its messages according to a cyclic clock (duty cycle). Since the base station is not aware of the different transmission times of the individual participants, it receives continuously. Since there is no coordination between the participants, the channel access is asynchronous (no time slots) with any time granularity.

[0189] b) Variant a) can be extended to include a simple bidirectional interface. If the base station successfully receives a data packet from a participant, the base station can send a message to the subscriber immediately after the end of this transmission (immediate feedback, "ACK / NACK"). To receive this feedback channel, the participant only switches on its receiver for short time intervals.

[0190] c) The base station here acts as a coordination instance (master), for example by periodically transmitting a beacon signal or other reference signal. The participants can synchronize with this and then actively access a limited range of radio resources in a contention process (uncoordinated and independently of each other). The clock of the access attempts is synchronized in time slots (so-called resource blocks) ("time slots"), and each participant is only allowed to transmit one of its sub-data packets at the beginning of a time slot.

[0191] In [4], [5] and [6], hopping patterns and hopping pattern designs for the above-mentioned variants a) and b) are described. Since some design specifications in [4], [5] and [6], such as subdividing the hopping pattern (of length L) into L / 3 clusters, each cluster having equal time and frequency spacing between sub-data packets within the cluster, are no longer necessary for newer applications, and since newer applications have different latency and reliability requirements, new hopping patterns and / or new design specifications for hopping patterns are needed.

[0192] Embodiments of the present invention provide a hopping pattern and generation rules (eg, design rules) for the hopping pattern that are specifically tailored for asynchronous ("slotless") data transmission (eg, variant a) and / or variant b)).

[0193] The starting point here is the unipolar Barker sequence, which is identical to the so-called "Golomb ruler" [7, p. 120]. These are binary sequences with elements ∈ {0,1} whose autocorrelation function (ACF) has only minor or marginal values ​​λ∈{0,1}. In the following, the example of a "1" in the binary sequence corresponding to a sub-data packet transmitted by a participant (e.g. a terminal device) is used. Sub-data packets with "0" are not sent. Therefore, two messages using the same basic hopping pattern either do not interfere with each other at all (λ=0) or, in the worst case (λ=1), only two sub-data packets collide with each other.

[0194] Of course, embodiments may also assume an inverse binary sequence, in which case it may be assumed that a "0" in the binary sequence corresponds to the transmission of a sub-data packet by a participant (eg, a terminal device), while a "1" indicates that no sub-data packet is transmitted.

[0195] The theory of the Columbus Ruler and necessary terms such as aperiodic ACF, area of ​​ACF or primary-side (or primary-secondary) maximum ratio (MSR) are briefly introduced below. A detailed description of embodiments based thereon, in particular the application of asynchronous ("non-slotted") transmission, is given in Sections 1 to 3.

[0196] In mathematics, a Golomb ruler (named after Solomon W. Golomb) is a set of non-negative integers or notations such that no pair of numbers has the same difference (distance) from each other. Golomb rulers are classified by their "order" and "length", where the order E is defined by the number of notations and the length N is defined by the maximum number of notations that occur. A Golomb ruler of order E = 5 and length N = 12 is Figure 3 shown.

[0197] like Figure 3 As shown, the Columbus ruler 300 includes E=5 marks 302_1-302_5, the first mark 302_1 is set to integer 1, the second mark 302_2 is set to integer 3, the third mark 302_3 is set to integer 8, the fourth mark 302_4 is set to integer 9, and the fifth mark 302_5 is set to integer 12.

[0198] Considering the distances of the first marker 302_1 to the other four markers 302_2-302_5, four distances {2,7,8,11} are obtained. The second marker 302_2 has three distances {5,6,9} to the remaining three right-hand markers 302_3-302_5, and the difference {1,4} results in the distance of the third marker 302_3. The final distance between the fourth marker 302_4 and the fifth marker 302_5 is {3}. According to E, The order of leads to different distances, that is, ten different distances, for example Figure 3 As shown. In increasing order, this leads to the sequence of differences of all labeled distances {1,2,3,4,5,6,7,8,9,11}. Clearly, no distance appears twice in the sequence of differences.

[0199] Figure 3 The Columbus ruler G1 shown in N＝12It can be interpreted as a binary unipolar non-periodic (or non-periodic) sequence of elements ∈ {0,1}, where the five numbers marked 302_1-302_5 represent the numbers occupied by one in the range of 1≤n≤N (and the other numbers represent the numbers occupied by zero (alternatively, of course, the five marked numbers 302_1-302_5 can also represent the positions occupied by zero in the range of 1≤n≤N, and the other numbers represent the numbers occupied by 1). Here, if the binary sequence consists only of elements ∈ {0,1}, it is called a unipolar sequence, and a binary sequence whose elements are ∈ {-1,1} is called a bipolar sequence. Therefore, for Figure 3 For the example shown in , the result for a sequence s(n) of length N=12 is as follows:

[0200]

[0201] The characteristic of the Columbus arrangement is that their autocorrelation function (ACF) has only edge values ​​λ∈{0,1}. The ACF for s(n) is defined as follows:

[0202]

[0203] The * symbol indicates the conjugate complex operation. In the case of real-valued sequences (assumed here), this operation can be omitted. The expression ∑ n (·) means summing all n where the parameter (·) is not zero. The width of ACF is 2N-1, and the main maximum value of ACF is always For the ACF calculation, it remains to be considered that for binary sequences with elements ∈{0,1}, the multiplication in equation (2) is implemented by the AND operation (commonly known as logical multiplication). This type of ACF is often referred to as the “pushpin ACF” in the English literature [8].

[0204] According to equation (2), the ACF of the sequence s(n) from equation (1) is calculated as follows:

[0205]

[0206] All edge values ​​of the ACF in equation (3) have size "1", except for two positions where m = ±10. The reason is the lack of distance ten in the above difference sequence {1,2,3,4,5,6,7,8,9,11}. Golomb arrangements with ACF edge values ​​containing only one are called perfect Golomb rulers. However, these only exist for order E = 4 and length N = 7 [9]. For longer lengths N, the number of vanishing edge values ​​increases. For the "thumbnail ACF" with binary monopolar and non-periodic sequences of elements ∈ {0,1} according to [7], the following applies to the "area" of the ACF:

[0207]

[0208] For example, 1 comes from equation (3), which means that E 2 =25 is exactly and corresponds to all ACF edge values ​​of λ = 1. Therefore, a "perfect Columbus ruler" of order E = 5, if it exists, can only have a length of N = 11. For such a "perfect Columbus ruler", the following equation applies:

[0209] 2(N-1)=E 2 -E. (5)

[0210] By the corresponding transformation of equation (5) to E, its ACF may only assume the upper limit result of binary unipolar aperiodic sequences with boundary values ​​λ∈{0,1}:

[0211]

[0212] The waveform of equation (6) is as follows Figure 4 However, for larger N, even the best-known sequences satisfy this bound increasingly poorly, as the percentage of vanishing ACF edges with λ = 0 increases. Figure 4 The optimal non-periodic sequence shown in is the so-called "optimal Golomb ruler" (OGR). An OGR, such as Figure 3 The one in , always has the shortest length N at a given order E. The highest known order of the "optimal Columbus ruler" is currently E = 27, with a length of N = 554. The first three Columbus rulers are "perfect Columbus rulers", which apply the equal sign in equation (6).

[0213] Furthermore, according to [7], it is known that unipolar periodic binary sequences whose periodic autocorrelation function (PAKCF) has only boundary values ​​λ ≤ 1 retain this feature even when used as unipolar non-periodic binary sequences for their ACF boundary values. In particular, so-called cyclic difference sets with the same PACF boundary value λ = 1 can advantageously be used as a starting point for the conversion into non-periodic binary sequences. All 35 known difference sets with λ = 1 are described in the table in [8] up to a period length of (E = 98 and λ = 1). Cyclic difference set D1 = {d1, d2, ..., d E} contains E integers whose difference

[0214]

[0215] Take each value Exactly λ times [8]. The second example shows that the The cyclic difference set D2 with E = 5 and λ = 1. And G1 = {1,3,8,9,12}N＝12 Compared with the first example, it can be seen that for the same order E and the same (P)ACF edge value with λ≤1, for the cyclic difference set The period length is significantly longer than the non-periodic length of the "optimal Columbus ruler" with N = 12. However, it is possible to significantly reduce the period length The resulting non-periodic length is N. For this reason, the difference set Periodic sequence written in binary form

[0216]

[0217] According to equation (2), for non-periodic sequences, the zeros on the left and right edges can be omitted. Therefore, the non-periodic sequence from equation (8) can be shortened by four zeros on the right, thus reducing the length to N = 17. However, it is known from [7] that periodic sequences can be cyclically rotated without changing the PACF and thus the side maxima. If the sequence from equation (8) Rotating right or left in such a way that the longest sequence of zeros (nine zeros in the example) is now located at the edge, if these zeros are subsequently truncated, the new non-periodic sequence length N=12 results in:

[0218]

[0219] It turns out that the non-periodic sequence G2 = {1, 4, 5, 10, 12} from equation (9) N＝12 It is exactly the Columbus ruler G2 = {1,4,5,10,12} from equation (1) N＝12 ) is the mirror image of s(-n) of s(n-n0) and thus also represents a Golomb ruler. Parallel shifts (adding or removing zeros at the edge, corresponding to s(n-n0)) as well as mirroring s(-n) are trivial invariant operations that leave the ACF of unipolar aperiodic binary sequences unchanged. In this respect, there is always one mirror pair for each binary sequence, although usually only one is mentioned. Finally, it should be mentioned that unipolar aperiodic binary sequences derived from a set of cyclic differences with ACF edge values ​​λ∈{0,1} usually have a larger length N than a Golomb ruler of the same order E, see also Figure 4 This procedure again yields a Golomb ruler only for relatively short lengths. Such unipolar aperiodic binary sequences generated by cyclic difference sets (λ = 1) are also called Barker sequences according to [7], since their ACF has only edge values ​​∈{0,1}. Therefore, all non-optimal Golomb rulers belong to the family of unipolar Barker sequences.

[0220] For the following applications, the quality metric of the primary side maximum ratio (MSR) is defined as

[0221]

[0222] is very important. MSR evaluates the intrinsic interference of the pulse through the ACF edge value. For OGR or Barker sequences, MSR=E always applies.

[0223] In order to avoid complete collisions, K different hopping patterns are usually used, which differ from each other in their time and frequency behavior. (If two data transmitters independently transmit the same hopping pattern at the same time and the same frequency position, we call it a complete collision. As a result, all L sub-data packets of the two data transmitters (e.g. participants) collide, which usually leads to the loss of both messages despite the presence of error protection.) If a whole family of K binary sequences (e.g. three binary sequences) is used instead of a single binary sequence, then in addition to the good ACF property of having the lowest possible lateral maximum mentioned so far, these sequences should also have good dependence properties in the aperiodic cross-correlation function (CCF). When generalizing equation (2), the CCF reads as follows

[0224] For |m|=0(1)N-1 (11)

[0225] It is assumed that the sequence s i (n) and s j The length of (n) is always equal to N. If we consider a cluster of K binary sequences, then according to equation (11) for all The CCF is performed for possible hopping pattern combinations, i.e., for all permutations i=0(1)K-1, j=0(1)K-1, where i≠j.

[0226] The embodiments described below provide and / or show how to create unipolar non-periodic binary sequences with improved (e.g., good) correlation properties. The improved (e.g., good) correlation properties are characterized by a maximum main-side maximum ratio. Since the ACF main maximum for a unipolar binary sequence is always equal to the E order, the above requirement corresponds to a minimum ACF side value for λ∈{0,1}. It is these properties that characterize an optimal Golomb ruler or Barker sequence.

[0227] 1. Generation (e.g., design) of a hopping pattern for asynchronous transmission with a maximum sub-packet length

[0228] In an asynchronous TSMA network, a large number of participants (e.g., users) send messages at a given total sending time T. GSD Each transmission has L sub-data packets, and the duration of the sub-data packet is T SPFor simplicity, it is assumed that all participants (eg, users) always have the same total transmission time and the same sub-data packet length. Each of the L sub-data packets contains X SP symbol, and X SP A symbol is composed of pilot symbols and data symbols.

[0229] Figure 5 ac show the occupancy of the communication channel when three different participants (users) send out sub-data packets.

[0230] Figure 5 a shows the occupancy of the communication channel when three sub-data packets 150_1, 150_2 and 150_3 are transmitted by a first participant (eg user 1), wherein the center of the first sub-data packet is at t1=0 and the center of the second sub-data packet is at t2. l and t l+1 The time interval t between the centers of two adjacent sub-data packets l,(l+1) Available in different lengths.

[0231] Figure 5 b shows the occupancy of the communication channel when two sub-data packets 152_1 and 152_2 are transmitted by the second participant (e.g. User 2b), which exhibits asynchronous timing behavior relative to the first participant (e.g. User 1). The second participant transmits its sub-data packets 152_1 and 152_2 at random start times relative to the first subscriber (e.g. User 1) (at t x Here, if the sub-data group center of the sub-data group of the second participant (e.g., user 2) is within the time interval, the sub-data group 152_1 of the second participant (e.g., user 2a) overlaps with the sub-data group 150_2 of the first participant (e.g., user 1).

[0232] t2-T SP <t x <t2+T SP (12)

[0233] The probability that two sub-data packets from two participants overlap is twice as high in an asynchronous TSMA network as in a synchronous network, e.g. Figure 5c. In synchronous transmission, the base station assigns a grid of time slots for channel access. Therefore, in synchronous transmission, there are only two states: either two sub-data packets completely overlap, such as sub-data packet 150_2 of the first participant (e.g., user 1) and sub-data packet 154_1 of the third participant (e.g., user 2c), or there is no overlap, such as in the case of sub-data packet 150_3 of the first participant (e.g., user 1) that the third participant (e.g., user 2c) has not transmitted. Therefore, in a synchronous network, collisions only occur in time intervals

[0234] t2-T SP / 2 <t x <t2+T SP / 2 (13)

[0235] Partial overlap (in Figure 5 b) and a complete conflict (in Figure 5 c) on the detection or LLR calculation is outside the scope of the present invention. The embodiment deals with how the L-1 distances t between the centers (e.g., pulse centers) of all L sub-data packets (e.g., pulses) of the hopping pattern (e.g., hopping sequence) must be selected. l,(l+1) Therefore, if the second asynchronous participant uses the same hopping pattern, then at most only two sub-data packets overlap at a time.

[0236] Since in a synchronous network the sub-data packets either do not overlap at all or overlap completely, a time slot corresponding to the duration of a sub-data packet can be used here as the basic unit. If no sub-data packet is transmitted in a time slot, this corresponds to a zero, "0", in one of the above binary sequences; in the case of a "1", a sub-data packet is transmitted by the participant. Finer resolution is not required.

[0237] Due to the granularity of asynchronous networks, the symbol duration T S Usually used as the minimum unit there. According to equation (12), two subgroups can be SP -1 Different symbol positions meet and overlap. For the definition of collision used here, it does not matter whether two sub-data packets touch only within one symbol interval, or whether they completely overlap. Any type of contact counts as a hit.

[0238] consider Figure 6 The optimal Golomb ruler G3300 of order E=8 and subsequent markings 302_1-302_8 shown in a:

[0239] G3={0,1,4,9,15,22,32,34}. (14)

[0240] according to Figure 6b, each of the eight marks 302_1-302_8 represents the middle of the sub-data packets 142_1-142_8 on the time axis, wherein the mark 302_1 of the first sub-data packet 142_1 is at the timestamp t1=0 and the center of the last sub-data packet 142_8 is at the total sending time t8=T of the complete message. GSD (Strictly speaking, for the total transmission time, the duration of the sub-data packet needs to be added to T GSD ; but for simplicity only the calculation is made from the middle of the sub-data packet to the middle of the sub-data packet used here). Due to the start time at t1=0, it is advantageous to have the first marker 302_1 always start from zero, 0. Since, as described above (where the marker always starts with one, 1), there is no effect on the ACF or CCF, the parallel shift is a trivial operation and can be easily performed. Figure 6 In the last step of c, the symbol duration T is performed S Normalization of .

[0241] To make further calculations more descriptive, but not restrictive in generality, Figure 6 c is the value given in T S = 0.1ms and T GSD = 1020 ms or less is used as an example of symbol duration and total transmission duration. It can be seen that the total duration of transmission of L sub-data packets exceeds Y GSD = 10200 symbols, of which

[0242] Y GSD =T GSD / T S . (15)

[0243] This results in a multiplication factor of, for example, F=300 between the individual marking numbers and the corresponding number of symbols within the transmission duration, for example 34*300=10200.

[0244] To ensure that both participants use Figure 6 The hopping pattern of c overlaps no more than two sub-data packets at the same time, and the process described below can be used according to the embodiment.

[0245] As explained at the beginning, the order E = 8 leads to a total of different marker distances. In increasing order, for the Columbus ruler G3300 from equation (14), this leads to the difference series

[0246]

[0247] The distance for all combinations of markers. Minimum distance 1, 1 (or 300 if based on Figure 6 c Consider T GSD / T S ) between the first and second markers 302_1 and 302_2 (0 and 1), the maximum distance 34 (or 10200) is between the first and last markers 302_1 and 302_8 (0 and 34). Since there are only 28 distances and the maximum distance value is 34, 6 difference values ​​are missing (respectively {16, 20, 24, 26, 27, 29}). If the difference is then calculated again from the values ​​of equation (16), but only the direct neighbors in the descending neighborhood (i.e. 2-1, 3-2, 4-3, etc.), the result is a difference sequence with 27 values ​​of difference:

[0248]

[0249] The difference sequence according to equation (17) corresponds exactly to the distance of the ACF edge value when λ=1, as Figure 7 In detail, Figure 7 The diagram shows Figure 6 The jump pattern of c and X SP =Autocorrelation function diagram of a sub-data group with a length of 120 symbols.

[0250] Due to the lack of six differences in Eq. (16), there are six ACF edge values ​​with λ = 0, and large distance values ​​({2,2,2,3,2}) at these points are visible in Eq. (17). Since the ACF is axisymmetric, Figure 7 Only the right half of the ACF is shown. For the so-called pushpin ACF, the value E 2 Export the entire ACF region. Reduce to the right half (and ) has no main maximum), (E 2 -E) / 2 is derived, and 28 side maxima of λ=1 are derived at E=8.

[0251] In an embodiment, generating (e.g., designing) a hopping pattern and determining a maximum sub-data packet length while satisfying a requirement that at most two sub-data packets from two participants overlap may be performed based on the following steps:

[0252] 1) Choose a binary unipolar non-periodic sequence of L=E and length N as the hopping pattern, whose ACF has only edge values ​​of λ≤1. All distances between all combinations of marks (e.g., as in equation (16)) appear only once. This applies to all (optimal) Golomb ruler and Barker sequences.

[0253] 2) By choosing the symbol duration T S and the total sending duration T GSD ,Y GSD =T GSD / T S The symbol causes a transmission gap, resulting in a factor of

[0254] F=Y GSD / N (18)

[0255] Using this multiplication factor and the minimum distance value in equation (17), the rule for the maximum number of symbols allowed in a single sub-data packet is obtained:

[0256]

[0257] Therefore, λ≤1 applies to ACF boundary values.

[0258] for Figure 6 In the example, F = 300, and according to equation (17), this leads to For the maximum length of the sub-packet, this results in X SP The maximum length of is 150 symbols. For example, in Figure 7 In the SP = 120. Starting from a sub-packet length of 150 symbols, the bars of the side maximum values ​​will overlap each other. The same applies to Figure 6 c. The distance between the first and second markers 302_1 and 302_2 is 300 symbols. Half of the two sub-data packets extend into this area. SP The sub-data packet of the second participant (eg user) with >150 c can hit two sub-data packets of the first participant at the same time, resulting in λ=2.

[0259] The Perfect Golomb Ruler (PGR) has the densest packing density because the ACF property only occurs for edge values ​​of λ = 1. Since these binary sequences have the lowest N at a given order, this leads to GSD The longest possible duration of each sub-packet is given by E. However, these PGRs exist only up to order E=4. For larger orders, the Optimal Golomb Ruler (OGR) takes over this property of the longest possible sub-packet.

[0260] In an embodiment, a (optimal) Golomb ruler or Barker sequence is mapped to a hopping pattern taking into account the symbol and transmission duration. The boundary conditions (Equations (16-19)) are specified with respect to the sub-data packet length so that the one-dimensional ACF of this hopping pattern has only the boundary values ​​λ≤1.

[0261] Therefore, in an embodiment, Figure 1 The data transmitter 100_1 shown in FIG. 1 may be configured to derive a hopping pattern 142 from a unipolar binary sequence (eg, based on a Golomb ruler or a Barker sequence), wherein

[0262] - a minimum total transmission duration during which a plurality of sub-data packets are transmitted, and / or

[0263] - Maximum length of a sub-data packet

[0264] Each / all depends on the minimum value of the difference sequence of the sorted difference number series derived from the binary sequence, for example so that the autocorrelation side maximum value of the transmitted autocorrelation function of multiple sub-data groups has the same maximum value as the autocorrelation side maximum value of the autocorrelation function of the binary sequence, or for example so that the autocorrelation side value of the autocorrelation function of the jump pattern assumes a value of 1 at most.

[0265] Therefore, in an embodiment, Figure 1 The data receiver 110 shown may be configured to derive the hopping pattern 142 from a unipolar binary sequence (eg, based on a Golomb ruler or a Barker sequence), where

[0266] - a minimum total transmission duration during which a plurality of sub-data packets are transmitted, and / or

[0267] - Maximum length of a sub-data packet

[0268] Each / all depends on the minimum value of the difference sequence of the sorted difference number series derived from the binary sequence, for example so that the autocorrelation side maximum value of the transmitted autocorrelation function of multiple sub-data groups has the same maximum value as the autocorrelation side maximum value of the autocorrelation function of the binary sequence, or for example so that the autocorrelation side value of the autocorrelation function of the jump pattern assumes a value of 1 at most.

[0269] 2. Grouping of several hopping patterns with good ACF and CCF properties in asynchronous transmission

[0270] The embodiments described in Section 1 specifically relate to the consideration of a single hopping pattern (e.g. hopping sequence). In order to reduce the probability of a complete collision, multiple (different) hopping patterns can be used. A complete collision occurs when two participants (e.g. users) use the same hopping pattern (e.g. hopping sequence) at the same start time and frequency, independently of each other. Despite the telegram splitting, all L sub-data packets of the two participants overlap and interfere with each other. If K different hopping patterns are used, the probability of a complete collision can be reduced by a factor of 1 / K. Advantageously, not only do all K autocorrelations show good correlation properties, but also all different permutations of all cross-correlation variants show good dependence.

[0271] Purely theoretically, in addition to G3 (see equation (14)), it should be possible to use another Golomb ruler G4 with an AC edge value of λ≤1, in which the CCF of the two sequences should also have only relevant values ​​of λ≤1. For example, the sequences are mirrored relative to G3 with the label

[0272] G4={0,2,12,19,25,30,33,34} (20)

[0273] There should be Figure 7 However, the cross-correlation of G3 and G4 produces many correlation values ​​for λ=2, although a CCF of length 67 labels (width: 2N-1) will have 64 possible CCF edge values ​​for λ=1 (number: E 2 ) to provide enough space. Presumably, different ruler lengths must be allowed (this corresponds to the last mark), and / or different total transmission durations must be allowed, so that all relevant values ​​of the resulting CCF satisfy the value λ ≤ 1. According to [7] or [8], the exact theoretical considerations for this are not yet known.

[0274] However, the second degree of freedom is still available when designing the hopping pattern. In Section 1, only one transmit / receive frequency is assumed as an example. Usually, a whole set of frequency channels is available for use by a data transmitter or a data receiver. For example, consider the three Columbus rule groups given in equation (21):

[0275]

[0276] Exemplarily, a common length N of 9940 (symbols) is selected so that SP (symbol) subpacket length, if the symbol duration is T S =0.1ms, then the total transmission duration T is about 1000ms GSD Therefore, the symbol number factor F in equation (18) is the 3x8 notation in equation (21), F=1. The minimum value of the difference sequence of all 3x27 possible differences (see equations (16), (17) and (19)) is at least 121 symbols, which leads to a maximum length of a sub-data packet of at most 60 symbols of X. SP Since the Columbus ruler given in equation (21) is not the "optimal Columbus ruler", the value X shown in G3 (equation (14)) and G4 (equation (20)) is SP =150, the maximum sub-data packet length here is lower.

[0277] If a single reception frequency is assumed, the three autocorrelation functions always have a boundary value of λ≤1, provided that the maximum sub-data packet length is limited to X according to equation (19). SP ≤ 60 symbols. However, for three cross-correlations, marginal values ​​appear, which are usually maximized to λ = 3.

[0278] Next, assume C = 3 different frequency channels and allocate them according to the association

[0279]

[0280] The frequency channels numbered 0, 1, and 2 should appear equally frequently. All three two-dimensional autocorrelation functions still have 56 edge values, each with λ≤1. Figure 8 The two-dimensional ACF of G5(3)={0,1560,2840,3840,5540,7380,8800,9940} and the frequency occupancy C5(3)={1,0,2,0,0,2,2,1} are exemplarily illustrated in FIG. Figure 8 The diagram shows the frequency channel occupancy C5(3) and X SP Two-dimensional pushpin ACF of Columbus ruler G5(3) with =60.

[0281] Among the three 2D cross-correlations, two cross-correlation functions exhibit ideal correlation behavior, such as Fig. 9 The combination of G5(1) and G5(2) shown in Figure 1. All 64 occurring side maxima have a value of λ=1. Only in the case of the CCFs of G5(2) and G5(3) does only one side maximum have a value of λ=2, all other side maxima have a value of λ=1. Despite extensive simulations, for X SP = 60 symbols, no triple combination of hopping patterns could be found that always shows ideal ACF and CCF behavior when only three frequency channels are given, with a unique edge value of λ = 1. In this example, this should only be possible when four frequency channels are used.

[0282] Another comment on the origin of the different longitude notations of the three Columbus rulers in equation (21).

[0283] Seven directly adjacent labeled differences is always the same, just of different order. These differences can be scrambled in different ways and then added accordingly. Only the differential test according to equation (17) has to be performed, since there are good and bad combinations in this regard.

[0284] In an embodiment, generating (e.g., designing) a set of hopping patterns with improved ACF and / or CCF properties may be performed based on one or more of the following steps:

[0285] 1) A binary unipolar and non-periodic Columbus linear sequence of order L=E and length N is selected as the starting point for determining a hopping pattern (e.g., a channel access pattern). The L-1 distances of directly adjacent labeled and the subsequent permutations of these distances are calculated to obtain a sequence of S>>K different distances. The L markings of a single hopping pattern are generated by the continuous addition (cumulative sum) of different permutation differences. The first marking is always zero, 0.

[0286] 2) According to equation (16), by calculating the complete difference series Diff G To test the S>>K jump mode, and according to equation (16) from the difference series Diff G According to equation (17), the difference For all S hopping patterns, the minimum Determined by the difference sequence according to equation (17). Then from this S minimum value sequence, the minimum value is selected and assumed to be the maximum value: The lowest value among these K maximum values ​​indirectly determines the maximum sub-data packet length K according to equation (19): SP .

[0287] 3) Considering the required symbol duration T S and the total transmission duration T GSD The specification of Y GSD =T GSD / T S , which results in the total number of symbols available in the frame. According to equation (18), this will result in F = Y GSD / N symbol number factor. With the factor F, the initial dimensionless length N of the original Golomb or Barker sequence is applied to the symbol duration and in particular to the total transmission duration. Step 3, taking F into account, can also already take place before step 1 and be considered immediately together with the initial Golomb or Barker sequence. This results in a greater degree of freedom in the definition of the individual labeled ones.

[0288] 4) If steps 1 to 3X SP If the length of the obtained sub-data packet is too small, you can return to step 1 and repeat steps 1 to 3 with another L=E order unipolar and non-periodic sequence and the same length until you reach a sufficiently large X SP The required number of K hopping patterns is K. All K hopping patterns have a one-dimensional ACF with a side value λ≤1 as long as the partial data packet length threshold is not exceeded. Design steps 1 to 3 all occur on a single receive frequency.

[0289] 5) In the fifth step, the number of frequency channels C is included to obtain good cross-correlation properties, where for all cross-correlations permutations, allowing edge values ​​λ ≤ 1. To make this possible, for the frequency number C, the following rule of thumb can be advantageously satisfied:

[0290] C≥floor(1.9*K). (23)

[0291] According to the L sub-data packets for each hopping pattern (e.g., hopping sequence), if it is assumed that the invocation of K hopping patterns (e.g., hopping sequences) is uniformly distributed, then C different frequency channels pass through a total of L*K. There is usually an additional requirement that the frequency channels should be evenly distributed so that (L*K) / C is an integer.

[0292] 6) After determining the value of C, any associated scheme of the corresponding L frequency calls is selected for the first two hopping patterns. In the case of L ≤ C, each frequency should be used only once according to an arbitrary random pattern (see Table 1), while in the case of L>C, the randomly generated multiple calls of the frequencies should also be distributed as evenly as possible over L. The order of the individual frequencies in the call pattern can be permuted until the first CCF of these two hops has the desired properties with edge values ​​λ≤1. The third is then carried out accordingly and each is further carried out to K after the hopping sequence. Since 2 additional CCFs must be optimized for the edge values ​​with the third hopping sequence, many call patterns should be canceled with the first CCF combination in order to use one of these patterns and the second CCF calculation also only has edge values ​​with λ≤1. For the last K-th hopping sequence, things are the most complicated, because all K-1 different CCFs have to be optimized here with one frequency pattern.

[0293] 7) If all If all permutations have edge values ​​of λ≤1, then this set of hopping patterns can be considered ideal in terms of its ACF and CCF properties. If not, the optimization process can be restarted by repeatedly restarting step 5 and different frequency associations. If success is not achieved despite multiple repetitions, then the number of frequency channels should be increased, if possible, or as few edge values ​​with λ=2 as possible should be allowed.

[0294] A specific example of sequence G6 will be described below, assuming the following values.

[0295] Number of sub-data groups: L = E = 8

[0296] Number of hopping patterns: K = 6

[0297] Number of frequencies: C = 24, evenly distributed in three step patterns

[0298] Symbol duration: T S =0,0525128ms

[0299] Frame duration: T GSD ≈1s (corresponding to 19043 symbols)

[0300] Sub-data packet length in symbols: X SP = 108 symbols

[0301] The following is the assumed basic Golomb ruler: G6 = {0, 1904, 4075, 7579, 10816, 13520, 15979, 18950}, where the difference sequence of the 7 directly adjacent markers of G6 (each corresponding to the center of a sub-data group) is Permutations can be made so that six different hopping patterns according to Tables 1a and 1b are obtained. In both tables, the differences in the centers of the sub-packets are always specified, rather than the absolute marker positions. The minimum difference according to equation (17) is 245 symbols, which easily allows the required sub-data packet length to be 108 symbols.

[0302]

[0303] Table 1a: Time positions of the first three hopping patterns of G6 for 1 s frame duration

[0304]

[0305] Table 1b: Time positions of the last three hopping patterns of G6 for 1 s frame duration

[0306] If a single sub-data packet of six hopping patterns is assigned to frequency channels numbered 0 to 23, according to the provisions of Tables 2a and 2b, the unique boundary value λ≤1 is the result of all six two-dimensional autocorrelation functions and 15 different two-dimensional cross-correlation functions.

[0307]

[0308]

[0309] Table 2a: Frequency positions of three different hopping patterns of G6 in Table 1a for a frame duration of 1 s

[0310]

[0311] Table 2b: Frequency positions of three different hopping patterns of G6 in Table 1b for a frame duration of 1 s

[0312] In an embodiment, one of the embodiments described in Section 1 can be extended to K hopping pattern groups whose two-dimensional autocorrelation or cross-correlation sequences all have unique edge values ​​of λ≤ 1. Another degree of freedom added here is the number C of available frequencies.

[0313] In an embodiment, a data transmitter, such as Figure 1The data transmitter shown in can be configured to transmit a signal (e.g., having eight sub-data packets) in accordance with a hopping pattern, wherein the hopping pattern is a time hopping pattern, a frequency hopping pattern, or a combination of a time hopping pattern and a frequency hopping pattern, wherein the time hopping pattern is one of the time hopping patterns shown in Tables 1a and 1b, each time hopping pattern having eight hops, and wherein the frequency hopping pattern is one of the frequency hopping patterns shown in Tables 2a and 2b, each pattern having eight hops.

[0314] In an embodiment, a data transmitter, such as Figure 1 The data receiver 110 shown can be configured to transmit a signal (e.g., having eight sub-data packets) in accordance with a hopping pattern, wherein the hopping pattern is a time hopping pattern, a frequency hopping pattern, or a combination of a time hopping pattern and a frequency hopping pattern, wherein the time hopping pattern is one of the time hopping patterns mentioned in Tables 1a and 1b, each time hopping pattern having eight hops, and wherein the frequency hopping pattern is one of the frequency hopping patterns mentioned in Tables 2a and 2b, each having eight hops.

[0315] 3. Groups of several hopping patterns with ACF and CCF edge values ​​λ≤2 in asynchronous transmission

[0316] The conditions described below ensure that the one-dimensional ACF has only marginal values ​​with λ ≤ 1:

[0317] 1) The larger the number of sub-data packets L (or order E), the more disproportionate the length N is, see equation (6) or Figure 4 .

[0318] For example, for L=8, N=34 is sufficient, while for L=24, N=425 is required.

[0319] 2) For a given symbol duration T S , the total transmission duration required is T GSD The shorter the frame, the more symbols Y can be used in GSD The lower the total.

[0320] 3) As a result, the symbol number factor F = Y GSD / N becomes smaller and smaller, and the resulting allowed sub-data packet length X SP gets smaller and smaller, so for the 1D-ACF, the side maximum remains at the desired value λ≤1.

[0321] For example, for G6, if the frame duration T GSD From 1s to 0.25s, the maximum possible subpacket length is reduced to 30 symbols. Using the optimal Golomb Ruler G3, it will be only 37 symbols.

[0322] However, if a larger sub-packet length X is required SP, then there will be marginal values ​​of the one-dimensional ACF greater than 1. This is illustrated by the example of the “optimal Columbus ruler” G3 in equation (14). If a shorter total transmission duration T is specified GSD =510, only 5100 symbols are generated for the total duration. For the maximum length of the sub-data packet, this leads to (see equation (19)) SP The maximum is 75 symbols. If a larger sub-data packet length is chosen, for example 120 symbols, then - figuratively speaking - the bars of the maximum value become wider and begin to overlap. Fig.10 As shown, the lateral maxima in these overlapping regions then increase to a value of =2.

[0323] The "(optimal) Columbus ruler" or "Barker sequence" again exhibits optimal behavior with respect to increasing side maxima. Therefore, equation (19) is valid for ACF side values ​​λ≤1 and can be summarized as:

[0324]

[0325] If ACF boundary values ​​for which λ≤λ will generally apply are allowed, then sub-data packet lengths that are exactly this factor T larger than λ≤1 may be allowed.

[0326] In particular, if the boundary values ​​of the one-dimensional ACF have values ​​of λ≧1, this can be achieved by a correspondingly large frequency channel specification in which the boundary values ​​of the two-dimensional ACF have smaller values, again λ≦1.

[0327] The embodiment allows, through equation (24), to depend on the Golomb order E of the influencing variables, the length N, the total transmission duration T GSD Sum symbol duration T S , and by equations (15) to (18), the maximum value of the side maxima that may appear in the one-dimensional ACF is estimated λ≤T. In order to reduce these maxima in the two-dimensional ACF (for example, λ≤1), the number of frequency channels C can be selected so that it does not fall below the following value, if possible:

[0328] C≥dloor(1.5*T*K). (25)

[0329] Next, a specific example of sequence G7 is described, in which the following values ​​are assumed.

[0330] Number of sub-data groups: L = E = 8

[0331] Number of hopping patterns: K = 3

[0332] Number of frequencies: C = 24, evenly distributed in three hopping modes

[0333] Symbol duration: T S =0,0525128ms

[0334] Frame duration: T GSD ≈0.25s (corresponding to 4738 symbols)

[0335] Sub-data packet length in symbols: X SP =108 symbols.

[0336] Edge conditions: Improved (e.g. good) CCF properties using G6

[0337] For this short frame duration, the one-dimensional ACF of the optimal Golomb ruler will have side maxima up to λ=4. If the three hopping patterns are optimized for a given number of 24 frequencies, all correlation changes can be forced to have side values ​​of λ≤1. However, since the 6 hopping patterns of G6 are additionally included in the optimization, new hopping patterns with 9 two-dimensional autocorrelation functions and 36 cross-correlation functions are generated. The joint design produces 42 perfect correlation functions with side values ​​λ≤1 and 3 cross-correlation functions with a total of 5 side values ​​λ=2. The time and frequency positions of the three hopping patterns of G7 are shown in Tables 3 and 4.

[0338]

[0339] Table 3: Time positions of three different hopping patterns for G7 with 0.25s frame duration

[0340]

[0341] Table 4: Frequency positions of three different hopping patterns for G7 with 0.25s frame duration

[0342] In embodiments, any of the embodiments described in Section 2 can be extended to a hopping pattern whose 1D-ACF has boundary values ​​of λ>1. Likewise, the "(optimal) Golomb ruler" or Barker sequence is shown to be optimal. Untangling, i.e. the 2D autocorrelation function and cross-correlation function again exclusively have boundary values ​​of λ≤1, can be done over a larger number of available frequencies.

[0343] In an embodiment, a data transmitter, such as Figure 1 The data transmitter shown can be configured to transmit a signal (e.g., having eight sub-data packets) in accordance with a hopping pattern, wherein the hopping mode is a time hopping mode, a frequency hopping mode, or a combination of a time hopping mode and a frequency hopping mode, wherein the time hopping mode is one of the time hopping modes listed in Table 3, each time hopping mode having eight hops, and wherein the frequency hopping mode is one of the frequency hopping modes listed in Table 4, each frequency hopping mode having eight hops.

[0344] In an embodiment, a data transmitter, such as Figure 1The data receiver 110 shown can be configured to receive a signal (e.g., having eight sub-data packets) sent in accordance with a hopping pattern, wherein the hopping pattern is a time hopping pattern, a frequency hopping pattern, or a combination of a time hopping pattern and a frequency hopping pattern, wherein the time hopping pattern is one of the time hopping patterns shown in Table 4, each time hopping pattern having eight hops, and wherein the frequency hopping pattern is one of the frequency hopping patterns shown in Table 4, each frequency hopping pattern having eight hops.

[0345] 4. Using the hopping pattern according to Sections 2 and 3 using the amendment to ETSI TS 103 357 [9]

[0346] In [9], a communication system using TSMA to transmit data in uplink and downlink is shown.

[0347] However, only a very small data rate of a maximum of 2380.371 symbols / second is specified in [9]. If the data rate is to be increased, the transmission duration of the sub-data packets is reduced, thereby reducing the active time of the (data) transmitter. This can reduce the power consumption of battery-powered transmitters. Likewise, the pauses between the sub-data packets are reduced, since all information is given in symbol duration. This is shown in more detail using the following example:

[0348] Data rate as specified in [9]: 2380.371 symbols / second

[0349] Sub-packet duration according to [9]: 15.1ms

[0350] Telegram duration (core frame) according to [9]: about 3.7s

[0351] New expected data rate: 19042.968 symbols / second (corresponding to 8*2380.371 symbols / second)

[0352] New partial data packet duration: 1.89ms

[0353] Duration of a new telegram (core frame) using the hopping pattern according to [9]: approximately 0.46 seconds

[0354] As can be seen from the examples, when using the hopping pattern defined in [9], the duration of the sub-data packet and therefore the duration of the telegram is reduced by the same factor as the data rate scaling.

[0355] Since a data transmitter (eg, a terminal such as a sensor node) usually enters a sleep mode between sub-data packets to save power consumption, it is necessary to wait for a certain period of time after waking up to allow the crystal to stabilize before starting transmission.

[0356] This time is typically in the range of a few milliseconds, so the overhead from [9] only plays a small role.

[0357] However, if the data rate is increased eightfold, as in the example, this overhead takes up a much larger factor. This reduces the transmission time by a factor of eight, but does not reduce the active time of the sensor node. This means that power consumption can only be reduced to a small extent.

[0358] The embodiments described below allow replacing the hopping pattern in [9] with the higher data rates described in Sections 2 and / or 3.

[0359] In [9], a total of 24 subpackets, each with a size of 36 symbols, are transmitted in a so-called core frame. These 24 subpackets are mapped to 24 frequency channels via the hopping pattern defined there.

[0360] If three sub-data packets are transmitted in such a way that the time between the sub-data packets corresponds exactly to the duration of the sub-data packets, and if the same frequency channel is selected for all three sub-data packets, this corresponds to a continuous transmission, wherein the three sub-data packets then correspond to a new, larger sub-data packet with three times the duration. If this is applied to the 24 sub-data packets of the core frame, the result is eight new sub-data packets, each now comprising 108 symbols. The hopping patterns from Sections 2 and / or 3 can be ideally used for this purpose.

[0361] Since there are now only eight sub-data packets of 3 times duration in the data transmitter instead of 24, the sensor node only has to wake up from sleep mode 8 times instead of 24 times and wait until the crystal is stable, thus reducing the power consumption of each large number of telegrams sent.

[0362] In the data receiver, the signal processing of the original 24 sub-data packets can continue, because the pilot sequences (training sequence, midamble, preamble, synchronization sequence) are still included in all three combined sub-data packets. Therefore, there is also a simple adaptation in the receiver (adaptation of the hopping pattern only during the correlation period).

[0363] In an embodiment, each of the three sub-data packets of the uplink message from the core frame according to [9] may be time-concatenated and transmitted at the same frequency.

[0364] 5. Further Embodiments

[0365] Fig.11A flow chart of a method 500 for transmitting a data packet in a communication system for wireless communication in a frequency band used by a plurality of communication systems for communication is shown. The method 500 comprises a step 510 of splitting a data packet into a plurality of sub-data packets. Furthermore, the method 500 comprises a step of transmitting 520 a plurality of sub-data packets in accordance with a hopping pattern [e.g., a time hopping pattern and / or a frequency hopping pattern], wherein the hopping pattern is derived from a binary sequence, wherein the autocorrelation function of the binary sequence has an autocorrelation side maximum with a predetermined maximum value [e.g., λ=1 or λ=2], wherein the minimum total transmission duration for transmitting the plurality of sub-data packets and / or the maximum length of the sub-data packets depends on the minimum value of a difference sequence of ordered difference sequences obtained from the binary sequence [e.g., such that the autocorrelation side maximum of the autocorrelation function of the transmission of the plurality of sub-data packets has the same maximum value as the autocorrelation side maximum of the autocorrelation function of the binary sequence].

[0366] Fig.12 A flow chart of a method 600 for receiving a data packet in a communication system for wireless communication in a frequency band used by a plurality of communication systems for communication is shown. The method 600 comprises a step 610 of receiving a plurality of sub-data packets that are distributed and transmitted in accordance with a hopping pattern. In addition, the method 600 comprises a step of combining 620 the plurality of sub-data packets to obtain a data packet split into a plurality of sub-data packets, wherein the hopping pattern is derived from a binary sequence, wherein the autocorrelation function of the binary sequence has an autocorrelation side maximum with a predetermined maximum value [e.g., λ=1 or λ=2], wherein the minimum total transmission duration for transmitting the plurality of sub-data packets and / or the maximum length of the sub-data packets depends on the minimum value of a difference sequence of ordered difference sequences obtained from the binary sequence [e.g., such that the autocorrelation side maximum of the autocorrelation function of the transmission of the plurality of sub-data packets has the same maximum value as the autocorrelation side maximum of the autocorrelation function of the binary sequence].

[0367] Fig.13 A flow chart of a method 700 for generating a hopping pattern for transmitting a plurality of sub-data packets in a communication system is shown. The method 700 comprises the step of deriving 710 the hopping pattern from a binary sequence, wherein the autocorrelation function of the binary sequence comprises an autocorrelation side maximum having a predetermined maximum value [e.g., λ=1 or λ=2]. Furthermore, the method 700 comprises the step of determining 720 a maximum sub-data packet length [e.g., a time length, such as a number of symbols] for the plurality of sub-data packets, depending on the total transmission duration of the plurality of sub-data packets indicated by the hopping pattern and the minimum value of the difference sequence of the ordered difference sequence derived from the binary sequence [e.g., such that the autocorrelation side maximum of the autocorrelation function of the transmission of the plurality of sub-data packets corresponds to a hopping pattern having the same maximum value as the autocorrelation side maximum of the autocorrelation function of the binary sequence].

[0368] Fig.14 A flow chart of a method 800 for generating (K) hopping patterns having predetermined autocorrelation properties [e.g., and predetermined cross-correlation properties] is shown. The method 800 includes a step 810 of providing a unipolar basic binary sequence derived from a Golomb ruler or Barker sequence, the Golomb ruler or Barker sequence having a predetermined order (E) [e.g., and a predetermined length L (=E)]. The method 800 further includes a step 820 of deriving a plurality of binary sequences from the basic binary sequence based on different arrangements of distances between successive elements of the basic binary sequence having a predetermined logic value [e.g., a first logic value, such as logic one, 1]. The method 800 further includes a step of determining 830 a difference sequence for each of the plurality of binary sequences to obtain a plurality of difference sequences of the plurality of binary sequences, wherein the respective difference sequence indicates all distances between all elements [e.g., numbers] of the respective binary sequence having a predetermined logic value [e.g., a first logic value, such as logic one, 1]. The method 800 further comprises the step of determining 840 a difference sequence for each of the plurality of difference sequences to obtain a plurality of difference sequences of the plurality of difference sequences, wherein the respective difference sequence indicates all differences between immediately adjacent values ​​of the respective difference sequence. The method 800 further comprises the step of determining 850 a minimum value for each of the plurality of difference sequences to obtain a plurality of minimum values. The method 800 further comprises the step of selecting 860 a predetermined number K of binary sequences from the plurality of binary sequences, wherein the binary sequences are selected from the plurality of binary sequences having the largest minimum values. The method 800 further comprises the step of deriving 870 a hopping pattern from each of the K selected binary sequences to obtain K hopping patterns.

[0369] Embodiments of the present invention provide unipolar non-periodic binary sequences with improved (e.g., good) correlation properties. The improved (e.g., good) correlation properties are characterized by a maximized main side maximum ratio. Since the ACF main maximum in a unipolar binary sequence is always equal to order E, the above requirement corresponds to the minimum ACF side value for λ∈{0,1}. It is these properties that characterize an optimal Golomb ruler or Barker sequence.

[0370] In an embodiment, starting from such a sequence (i.e., an optimal Golomb ruler or Barker sequence), a mapping to a hopping pattern can be performed taking into account the symbol and transmission duration. An embodiment describes boundary conditions that allow for certain subpacket lengths such that the one-dimensional ACF of the hopping pattern has only edges with λ≤1.

[0371] If the number C of available frequencies is added as a further degree of freedom, the embodiment can be extended to a set of K hopping patterns whose two-dimensional autocorrelation or cross-correlation sequences all exclusively have a boundary value of λ≤1.

[0372] In an embodiment, also (optimal) Golomb rulers or Barker sequences may be used for hopping patterns whose 1D-ACF has boundary values ​​of λ>1. Untangling of the two-dimensional autocorrelation function and cross-correlation function, again exclusively having boundary values ​​of λ≤1, is done over a larger number of available frequencies.

[0373] Embodiments of the present invention are applied in systems for radio transmission of data from many terminals to base stations and / or from one or more base stations to terminals. Depending on the application, this may involve unidirectional or bidirectional data transmission. Embodiments can be particularly advantageously used in such systems, wherein a coded message (data packet) is transmitted in several sub-data packets (or partial data packets), which are smaller than the actual information (i.e., the coded message (data packet)) to be transmitted (the so-called telegram splitting multiple access (TSMA) method, see, for example, [1], [2], [3]). A telegram (i.e., the coded message (data packet)) is split into several sub-data packets. In the telegram splitting method, L sub-data packets are transmitted on one frequency or distributed on multiple frequencies. Between the L sub-data packets, there is a time pause in which no transmission occurs, wherein the time length of the pause can differ in multiples of the symbol duration. The transmission sequence of the sub-data packets in time and frequency is called a channel access mode or a hopping mode.

[0374] The telegram splitting method provides a particularly high robustness against interference from other data transmitters (e.g. sensor nodes), whether they come from the user's own system or from third-party systems. In particular, the robustness against interference from the own data transmitter (e.g. sensor node) is achieved by distributing the different sub-data packets as evenly as possible in the time and frequency domain. This quasi-random distribution is achieved by different pulse arrangements of different data transmitters (e.g. sensor nodes) with different hopping patterns.

[0375] Embodiments of the present invention relate to the design and optimization of such hopping patterns in a network with asynchronous transmission.

[0376] Although some aspects have been described in the context of an apparatus, it should be understood that these aspects also represent a description of a corresponding method, and therefore the blocks or components of the apparatus should also be understood as corresponding method steps or features of method steps. Similarly, aspects described in conjunction with or as method steps also represent descriptions of corresponding blocks or details or features of corresponding apparatuses. Some or all of the method steps can be performed by (or using) hardware devices, such as microprocessors, programmable computers, or electronic circuits. In some embodiments, some or more of the most important method steps can be performed by such devices.

[0377] Depending on the specific implementation requirements, embodiments of the present invention may be implemented in hardware or software. The implementation may be performed using a digital storage medium, such as a floppy disk, DVD, Blu-ray disc, CD, ROM, PROM, EPROM, EEPROM or flash memory, hard disk or any other magnetic or optical memory having stored thereon electronically readable control signals which may or do interact with a programmable computer system to perform the corresponding method. Thus, the digital storage medium may be computer readable.

[0378] Therefore, some embodiments according to the invention comprise a data carrier having electronically readable control signals, which are capable of cooperating with a programmable computer system, such that any of the methods described herein is performed.

[0379] Generally, embodiments of the present invention can be implemented as a computer program product with a program code, the program code being operative to perform any method when the computer program product runs on a computer.

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

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

[0382] In other words, an embodiment of the inventive method is, therefore, a computer program comprising a program code for performing any of the methods described herein, when the computer program runs on a computer.

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

[0384] Therefore, a further embodiment of the inventive method is a data stream or a sequence of signals constituting the computer program for performing any of the methods described herein.For example, the data stream or the sequence of signals may be configured to be transmitted via a data communication link, for example via the Internet.

[0385] A further embodiment comprises a processing means, such as a computer or a programmable logic device, configured or adapted to perform any of the methods described herein.

[0386] Another embodiment comprises a computer having installed thereon the computer program for performing any of the methods described herein.

[0387] Another embodiment according to the invention includes an apparatus or system configured to send a computer program for performing at least one of the methods described herein to a receiver. For example, the transmission may be electronic or optical. The receiver may be, for example, a computer, a mobile device, a storage device, or the like. The apparatus or system may include, for example, a file server for sending the computer program to the receiver.

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

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

[0390] The apparatus described herein or any component of an apparatus described herein may be implemented at least partly in hardware and / or software (computer program).

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

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

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

[0394] Abbreviations

[0395] λ: possible ACF or CCF edge value λ≤λ max

[0396] ACF: Aperiodic Autocorrelation Function

[0397] BS: Base Station

[0398] CRE: Common Resource Element

[0399] E: (a) The order (corresponding to the number of one token) of the periodic unipolar binary sequence (usually corresponding to L).

[0400] F: Signed number factor: the quotient of the signed number divided by the length of the Columbus ruler.

[0401] MSR: Maximum Side Ratio (see equation (5)).

[0402] K: the number of all available hopping patterns

[0403] CCF: Aperiodic Cross Correlation Function Where i≠j.

[0404] L: The number of partial data packets (subpackets) into which the message is segmented, or the number of resource elements of the hopping pattern required for this purpose

[0405] LPWAN: Low Power Wide Area Network

[0406] M: size of resource frame, M = T*C, where C is the element in the frequency direction and T is the time slot in the time direction

[0407] N: length of the Columbus ruler (corresponding to the last mark)

[0408] Period length of a periodic unipolar binary sequence

[0409] OGR: Optimal Golomb ruler, a non-periodic binary sequence with elements ∈{0,1} whose ACF has only edge values ​​∈{0,1}. They are called "optimal" if there is no shorter length N in the same order E. Otherwise, they are called "non-optimal Golomb ruler" or "Barker sequence".

[0410] PACF: Periodic Autocorrelation Function

[0411] PER: Packet Error Rate

[0412] TSMA: Telegraph Split Multiple Access

[0413] T S : Symbol duration

[0414] T GSD : Send split to Y GSD The total duration of L subpackets of a symbol (including all pauses), : T GSD =Y GSD *T S (T GSD refers to the pulse center of the first and last subgroup).

[0415] T SP : By X SP Duration of a subgroup of symbols: T SP =X SP *T S

[0416] T T : Duration of a "compact" telegram; corresponds to the duration of L subpackets

[0417] X SP : Length of the subgroup in the symbol

[0418] Y GSD : Total duration in symbols

[0419] References

[0420] [1]DE 10 2011 082 098 B4

[0421] [2] G. Kilian, H. Petkov, R. Psiuk, H. Lieske, F. Beer, J. Robert, and A. Heuberger, "Improved coverage for low-power telemetry systems using telegramsplitting," in Proceedings of 2013 European Conference on Smart Objects, Systems and Technologies (SmartSysTech), 2013.

[0422] [3] G.Kilian, M.Breiling, HHPetkov, H.Lieske, F.Beer, J.Robert, andA.Heuberger, "Increasing Transmission Reliability for Telemetry Systems Using Telegram Splitting," IEEE Transactions on Communications, vol.63, No. 3, pp.949-961, Mar.2015.

[0423] [4]DE 10 2016 220 882 A1

[0424] [5]DE 10 2017 206 236 A1

[0425] [6]DE 10 2017 211 375 A1

[0426] [7]Hans Dieter Lücke: “Correlation signal” (Correlation signal), Springer-Verlag Berlin Heidelberg New York, 1992.

[0427] [8]Leonard D. Baumert, "Cyclic difference sets", Springer-Verlag Berlin-Heidelberg, 1971.

[0428] [9]ETSI TS 103 357,Low Throughput Networks,v.1.1.1,June 2018.

Claims

1. A data transmitter (100_1), The data transmitter (100_1) is configured to transmit a signal (120) in accordance with a hopping pattern (140), in, The hopping mode (140) is a time hopping mode, a frequency hopping mode, or a combination of a time hopping mode and a frequency hopping mode, The time hopping mode is one of the nine time hopping modes mentioned in the following table, and each time hopping mode has eight transitions: wherein, in the table, each row is a time hopping pattern, wherein, in the table, each column is a transition of the corresponding time hopping pattern starting from the second transition, so that each time hopping pattern includes eight transitions, wherein in the table, each cell specifies the time distance in symbol duration or multiples of symbol duration from a reference point of the corresponding transition to an equal reference point of the immediately preceding transition, The frequency hopping mode is one of the nine frequency hopping modes mentioned in the following table, each frequency hopping mode having eight hops: In the table, each row is a frequency hopping pattern, in the table, each column is a hopping of a corresponding frequency hopping pattern, and in the table, each cell indicates the number of frequency channels of a corresponding hopping of a corresponding frequency hopping pattern.

2. The data transmitter (100_1) according to claim 1, The data transmitter (100_1) is configured to transmit eight sub-data packets in accordance with a hopping pattern via a data signal (120).

3. The data transmitter (100_1) according to claim 1, The data transmitter (100_1) is configured to provide at least 24 uplink sub-data packets in accordance with the ETSI TS103 357 standard, The data transmitter (100_1) is configured to combine three of the 24 uplink sub-data packets to form a long sub-data packet to obtain eight long sub-data packets, The data transmitter (100_1) is configured to transmit the eight long sub-data packets in accordance with a hopping pattern through a data signal.

4. A data receiver (110), The data receiver (110) is configured to receive a signal (120) in accordance with a hopping pattern (140), in, The hopping mode (140) is a time hopping mode, a frequency hopping mode, or a combination of a time hopping mode and a frequency hopping mode, The time hopping mode is one of the nine time hopping modes mentioned in the following table, and each time hopping mode has eight transitions: wherein, in the table, each row is a time hopping pattern, wherein, in the table, each column is a transition of the corresponding time hopping pattern starting from the second transition, so that each time hopping pattern includes eight transitions, wherein in the table, each cell specifies the time distance in symbol duration or multiples of symbol duration from a reference point of the corresponding transition to an equal reference point of the immediately preceding transition, The frequency hopping mode is one of the nine frequency hopping modes mentioned in the following table, each frequency hopping mode having eight hops: In the table, each row is a frequency hopping pattern, in the table, each column is a hopping of a corresponding frequency hopping pattern, and in the table, each cell indicates the number of frequency channels of a corresponding hopping of a corresponding frequency hopping pattern.

5. The data receiver (110) according to claim 4, The data receiver is configured to receive eight sub-data packets in accordance with the hopping pattern via the data signal.

6. The data receiver (110) according to claim 4, The data receiver is configured to receive eight long sub-data packets in accordance with the hopping pattern via the data signal, wherein each of the eight long sub-data packets includes three of the 24 uplink sub-data packets consistent with the ETSI TS103 357 standard, in, The data receiver is configured to process the eight long sub-data packets to obtain 24 uplink sub-data packets.

7. A method for transmitting a signal, comprising: To transmit a signal consistent with the hopping pattern, The hopping mode is a time hopping mode, a frequency hopping mode, or a combination of a time hopping mode and a frequency hopping mode. The time hopping mode is one of the nine time hopping modes mentioned in the following table, and each time hopping mode has eight transitions: wherein, in the table, each row is a time hopping pattern, wherein, in the table, each column is a transition of the corresponding time hopping pattern starting from the second transition, so that each time hopping pattern includes eight transitions, wherein in the table, each cell specifies the time distance in symbol duration or multiples of symbol duration from a reference point of the corresponding transition to an equal reference point of the immediately preceding transition, The frequency hopping mode is one of the nine frequency hopping modes mentioned in the following table, each frequency hopping mode having eight hops: In the table, each row is a frequency hopping pattern, in the table, each column is a hopping of a corresponding frequency hopping pattern, and in the table, each cell indicates the number of frequency channels of a corresponding hopping of a corresponding frequency hopping pattern.

8. A method for receiving a signal, comprising: Receive a signal consistent with the hopping pattern, The hopping mode is a time hopping mode, a frequency hopping mode, or a combination of a time hopping mode and a frequency hopping mode. The time hopping mode is one of the nine time hopping modes mentioned in the following table, and each time hopping mode has eight transitions: wherein, in the table, each row is a time hopping pattern, wherein, in the table, each column is a transition of the corresponding time hopping pattern starting from the second transition, so that each time hopping pattern includes eight transitions, wherein in the table, each cell specifies the time distance in symbol duration or multiples of symbol duration from a reference point of the corresponding transition to an equal reference point of the immediately preceding transition, The frequency hopping mode is one of the nine frequency hopping modes mentioned in the following table, each frequency hopping mode having eight hops: In the table, each row is a frequency hopping pattern, in the table, each column is a hopping of a corresponding frequency hopping pattern, and in the table, each cell indicates the number of frequency channels of a corresponding hopping of a corresponding frequency hopping pattern.

9. A computer program product having a computer program thereon which, when run, causes the method according to claim 7 or 8 to be performed.

Images