EP4049374A2 - Suites binaires unipolaires à comportement de corrélation non périodique amélioré pour systèmes tsma non synchronisés - Google Patents

Suites binaires unipolaires à comportement de corrélation non périodique amélioré pour systèmes tsma non synchronisés

Info

Publication number
EP4049374A2
EP4049374A2 EP20796760.5A EP20796760A EP4049374A2 EP 4049374 A2 EP4049374 A2 EP 4049374A2 EP 20796760 A EP20796760 A EP 20796760A EP 4049374 A2 EP4049374 A2 EP 4049374A2
Authority
EP
European Patent Office
Prior art keywords
pattern
jump
sub
data packets
time
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
EP20796760.5A
Other languages
German (de)
English (en)
Inventor
Gerd Kilian
Josef Bernhard
Johannes WECHSLER
Jakob KNEISSL
Raimund Meyer
Frank Obernosterer
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Fraunhofer Gesellschaft zur Forderung der Angewandten Forschung eV
Diehl Metering GmbH
Original Assignee
Fraunhofer Gesellschaft zur Forderung der Angewandten Forschung eV
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Fraunhofer Gesellschaft zur Forderung der Angewandten Forschung eV filed Critical Fraunhofer Gesellschaft zur Forderung der Angewandten Forschung eV
Publication of EP4049374A2 publication Critical patent/EP4049374A2/fr
Pending legal-status Critical Current

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B1/00—Details of transmission systems, not covered by a single one of groups H04B3/00 - H04B13/00; Details of transmission systems not characterised by the medium used for transmission
    • H04B1/69—Spread spectrum techniques
    • H04B1/713—Spread spectrum techniques using frequency hopping
    • H04B1/7143—Arrangements for generation of hop patterns
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B1/00—Details of transmission systems, not covered by a single one of groups H04B3/00 - H04B13/00; Details of transmission systems not characterised by the medium used for transmission
    • H04B1/69—Spread spectrum techniques
    • H04B1/713—Spread spectrum techniques using frequency hopping
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B1/00—Details of transmission systems, not covered by a single one of groups H04B3/00 - H04B13/00; Details of transmission systems not characterised by the medium used for transmission
    • H04B1/69—Spread spectrum techniques
    • H04B1/713—Spread spectrum techniques using frequency hopping
    • H04B1/7156—Arrangements for sequence synchronisation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00—Arrangements affording multiple use of the transmission path
    • H04L5/003—Arrangements for allocating sub-channels of the transmission path
    • H04L5/0048—Allocation of pilot signals, i.e. of signals known to the receiver
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B1/00—Details of transmission systems, not covered by a single one of groups H04B3/00 - H04B13/00; Details of transmission systems not characterised by the medium used for transmission
    • H04B1/69—Spread spectrum techniques
    • H04B2001/6908—Spread spectrum techniques using time hopping

Definitions

  • a coded message e.g. a data packet (e.g. the physical layer)
  • a plurality of sub-data packets or partial data packets
  • the plurality of sub-data packets each have only a part of the coded message
  • the plurality of sub-data packets are transmitted according to a hopping pattern in the time and optionally in the frequency distributed.
  • UNB Ultra Narrow Band, dt. Ultra Narrow Band
  • non-synchronized (asynchronous) LPWAN systems as defined in [9]
  • a large number of participants eg sensor nodes
  • the present invention is therefore based on the object of reducing the probability of a collision when a large number of users access the available frequency band at the same time.
  • Autocorrelation function of the binary sequence can assume values of at most one or two], with a minimum total transmission time within which the plurality of sub-data packets are transmitted and / or a maximum length of the sub-data packets from a minimum value of a difference sequence of a sequence derived from the binary sequence , sorted difference number series is dependent [eg so that secondary autocorrelation maxima of an autocorrelation function of the transmission of the plurality of sub-data packets have the same maximum value as the secondary autocorrelation maxima of the autocorrelation function of the binary sequence or e.g. so that secondary autocorrelation values of an autocorrelation function of the jump pattern assume at most values of one or two].
  • the difference series of numbers [in a predetermined order [e.g. in ascending or descending order]] all spaces between all elements [e.g. Digits] of the binary sequence which have a predetermined logical value [e.g. have a first logical value, such as logical one, 1], the difference sequence indicating all differences between immediate neighboring values of the difference number series.
  • the binary sequence can depict or at least partially depict a Golomb ruler, a mirrored version of a Golomb ruler, or a Barker sequence.
  • secondary autocorrelation maxima of an autocorrelation function of the transmission of the plurality of sub-data packets can have the same maximum value as the secondary autocorrelation maxima of the autocorrelation function of the binary sequence.
  • one of the minimum total transmission duration and the maximum length of the sub-data packets can be of a symbol duration, a number of sub-data packets, the minimum value of the difference sequence of the sorted difference number series, and the other of the total transmission duration and the length the sub-data packets be dependent [e.g. so that autocorrelation secondary maxima of an autocorrelation function of the transmission of the plurality of sub-data packets has the same maximum values as the autocorrelation secondary maxima of the autocorrelation function of the binary sequence].
  • the dependency of the maximum length X SP of the sub-data packets on the symbol duration T s , the number N of sub-data packets and the total transmission duration T GSD can be based on the following formula: where min is the minimum value of the difference sequence of the sorted difference Number series describes.
  • T GSD of the symbol duration T s the number N of sub-data packets and the maximum length X SP of the sub-data packets are based on the following formula: where min is the minimum value of the difference sequence of the sorted difference Number series describes.
  • a first logical value [for example, logical one, 1] of the binary sequence can indicate the transmission of a sub-data packet, a second logical value [for example, logical zero, 0] of the binary sequence indicating a pause in transmission.
  • marked integer positions of the Golomb ruler or the mirrored version thereof can each be represented by a first logical value [e.g. logical one, 1] in the binary sequence, with unmarked integer positions of the Golomb ruler or the mirrored version of the same in each case by a second logical value [e.g. logical zero, 0] can be mapped in the binary sequence.
  • first logical value e.g. logical one, 1
  • second logical value e.g. logical zero, 0
  • a number of marked integer positions of the Golomb ruler or the mirrored version thereof can correspond to a number of sub-data packets.
  • the communication system can communicate wirelessly in a frequency band which is used by a plurality of communication systems for communication, the data receiver being configured to receive a plurality of sub-data packets that are transmitted in a distributed manner according to a hopping pattern, and to receive the Combine a plurality of sub-data packets in order to obtain a data packet which is divided into the plurality of sub-data packets, the jump pattern being derived from a binary sequence, an autocorrelation function of the binary sequence autocorrelation secondary maxima with a predetermined maximum value [e.g.
  • a minimum total transmission time within which the plurality of sub-data packets are transmitted and / or a maximum length of the sub-data packets of a minimum value of a difference sequence of one of the binary sequence derived, sorted difference number series is dependent [e.g. so that autocorrelation secondary maxima of an autocorrelation function of the transmission of the plurality of sub-data packets have the same maximum value as the autocorrelation secondary maxima of the autocorrelation function of the binary sequence].
  • the difference series of numbers [in a predetermined order [e.g. in ascending or descending order]] can indicate all distances between all elements [e.g. positions] of the binary sequence which have a predetermined logical value [e.g. a first logical value, such as logical one, 1], the difference sequence indicating all differences between immediate neighboring values of the difference number series.
  • the binary sequence can map or at least partially map a Golomb ruler, a mirrored version of a Golomb ruler, or a Barker sequence.
  • secondary autocorrelation maxima of an autocorrelation function of the transmission of the plurality of sub-data packets can have the same maximum value as the secondary autocorrelation maxima of the autocorrelation function of the binary sequence.
  • one of the minimum total transmission duration and the maximum length of the sub-data packets can be of a symbol duration, a number of sub-data packets, the minimum value of the difference sequence of the sorted difference number series, and the other of the total transmission duration and the length the sub-data packets be dependent [e.g. so that autocorrelation secondary maxima of an autocorrelation function of the transmission of the plurality of sub-data packets has the same maximum values as the autocorrelation secondary maxima of the autocorrelation function of the binary sequence].
  • the dependency of the maximum length X SP of the sub-data packets on the symbol duration T s , the number N of sub-data packets and the total transmission duration T GSD can be based on the following formula: where min describes the minimum value of the difference sequence of the sorted difference number series.
  • the dependence of the minimum total transmission duration T G SD on the symbol duration T s , the number N of sub-data packets and the maximum length X Sp of the sub-data packets can be based on the following formula: where min is the minimum value of the difference sequence of the sorted difference Number series describes.
  • a first logical value [e.g. logical one, 1] of the binary sequence indicate the transmission of a sub-data packet, with a second logical value [e.g. logic zero, 0] of the binary sequence indicates a pause in transmission.
  • marked integer positions of the Golomb ruler or the mirrored version thereof can each be represented by a first logical value [e.g. logical one, 1] in the binary sequence, with unmarked integer positions of the Golomb ruler or the mirrored version of the same in each case by a second logical value [e.g. logical zero, 0] can be mapped in the binary sequence.
  • first logical value e.g. logical one, 1
  • second logical value e.g. logical zero, 0
  • a number of marked integer positions of the Golomb ruler or the mirrored version thereof can correspond to a number of sub-data packets.
  • FIG. 1 For exemplary embodiments, create a method for sending a data packet in a communication system, the communication system communicating wirelessly in a frequency band which is used by a plurality of communication systems for communication.
  • the method comprises a step of dividing a data packet into a plurality of sub-data packets.
  • the method further comprises a step of sending out the plurality of sub-data packets according to a hop pattern [e.g. Time and / or frequency hopping pattern], the hopping pattern being derived from a binary sequence, wherein an autocorrelation function of the binary sequence is autocorrelation secondary maxima with a predetermined maximum value [e.g.
  • a minimum total transmission time within which the plurality of sub-data packets are transmitted and / or a maximum length of the sub-data packets of a minimum value of a difference sequence from one of the binary sequence derived, sorted difference number series is dependent [eg so that autocorrelation secondary maxima of an autocorrelation function of the transmission of the plurality of sub-data packets have the same maximum value as the autocorrelation secondary maxima of the autocorrelation function of the binary sequence].
  • the maximum sub-data packet length can also be determined as a function of a symbol duration and a number of sub-data packets.
  • the maximum sub-data packet length X SP can be determined based on the following formula: where T GSD describes the total duration of the transmission of the plurality of sub-data packets, where T s describes the symbol duration, where N describes the number of sub-data packets, and where min is the minimum value of the difference sequence of the sorted difference Number series describes.
  • the difference series of numbers [in a predetermined order [e.g. in ascending or descending order]] specify all distances between all digits of the binary sequence which have a predetermined logical value [e.g. have a first logical value, such as logical one, 1], the difference sequence indicating all differences between immediate neighboring values of the difference number series.
  • the method further comprises a step of deriving a plurality of binary sequences from the basic binary sequence based on a different arrangement of distances between successive elements of the basic binary sequence which have a predetermined logical value [e.g. a first logical value, such as logical one, 1 ] exhibit.
  • the method further comprises a step of determining, for each of the plurality of binary sequences, a difference number series in order to obtain a plurality of difference number series for the plurality of binary sequences, wherein a respective difference number series all distances between all elements [eg places ] of the respective binary sequence which has a predetermined logical value [for example a first logical value such as logical one, 1].
  • the method further comprises a step of determining, for each of the plurality of difference series of numbers, a difference sequence in order to obtain a plurality of difference sequences for the plurality of difference series of numbers, a respective difference sequence all differences between immediate ones Indicates neighboring values of the respective difference series of numbers.
  • the method further comprises a step of determining a minimum value for each of the plurality of difference sequences in order to obtain a plurality of minimum values.
  • the method further comprises a step of selecting a predetermined number K of binary sequences from the plurality of binary sequences, those binary sequences being selected from the plurality of binary sequences whose minimum values are greatest.
  • the method further comprises a step of deriving a hop pattern from each of the K selected binary sequences to obtain K hop patterns.
  • the derivation of the plurality of binary sequences from the basic binary sequence can include a step of determining a basic distance sequence based on the basic binary sequence, the basic distance sequence all distances between successive elements of the binary sequence which have a predetermined logical Value [eg a first logical value, such as logical one, 1] have, indicates.
  • a predetermined logical Value eg a first logical value, such as logical one, 1
  • the deriving of the plurality of binary sequences from the basic binary sequence can comprise a step of permuting [eg random interchanging or changing an order] of the elements of the basic distance sequence in order to obtain a plurality of different distance sequences, the derivation the plurality of binary sequences from the basic binary sequence a step of calculating the plurality of binary sequences from the plurality of different distance sequences, so that a respective binary sequence of the plurality of binary sequences elements with a predetermined logical value [eg a first logical value, such as logic one, 1] at those points which are indicated by a respective distance sequence.
  • a predetermined logical value eg a first logical value, such as logic one, 1
  • the elements of a respective binary sequence of the plurality of binary sequences can be subjected to a factor that is dependent on a total transmission duration and a symbol duration.
  • the basic binary sequence can have a factor applied to it that is dependent on a total transmission duration and a symbol duration.
  • transmission times or transmission time jumps of a respective jump pattern can be derived from the respective binary sequence.
  • the method can have a step of permuting at least one of the at least two transmission frequency sequences and repeating the steps of calculating a two-dimensional cross-correlation function and checking whether secondary cross-correlation values of the two-dimensional cross-correlation function do not exceed a predetermined maximum value if the secondary cross-correlation values exceed the predetermined maximum value, wherein the transmission frequencies indicated by the at least two transmission frequency sequences are as evenly distributed as possible [eg on average] over the set of available transmission frequencies.
  • the predetermined maximum value for the predetermined maximum value for the predetermined maximum value
  • Cross-correlation minor values of the cross-correlation function can be one or two.
  • a maximum length of the sub-data packets that can be transmitted with the respective jump pattern can be selected so that an autocorrelation function of a version of the jump pattern projected onto a time axis [e.g. exclusively] has autocorrelation secondary values that are less than or equal to one, the predetermined maximum value for the cross-correlation secondary values of the two-dimensional cross-correlation function being one, a number of transmission frequencies of the set of transmission frequencies required for this being able to be estimated based on the following formula [e.g. can be determined] is:
  • a maximum length of the sub-data packets can be determined based on the following formula: where T GSD describes the total duration of the transmission of the plurality of sub-data packets, where T s describes the symbol duration, where N describes the number of sub-data packets, and where min is the minimum value of the difference sequence of the sorted difference Number series describes.
  • a maximum length of the sub-data packets that can be transmitted with the respective jump pattern can be selected so that an autocorrelation function of a version of the jump pattern projected onto a time axis [e.g. exclusively] has secondary autocorrelation values that are less than or equal to a threshold value T [e.g.
  • the maximum value for the secondary cross-correlation values of the two-dimensional cross-correlation function being less than or equal to the same threshold value T, with a required number of transmission frequencies of the set of transmission frequencies being able to be determined based on the following formula:
  • a maximum length of the sub-data packets can be determined based on the following formula: where T GSD describes the total duration of the transmission of the plurality of sub-data packets, where T s describes the symbol duration, where N describes the number of sub-data packets, and where min is the minimum value of the difference sequence of the sorted difference Describes a series of numbers, where T [eg is a natural number and] describes a factor by which the maximum value is greater than one.
  • a data transmitter which is configured to transmit a signal in accordance with a hop pattern, the hop pattern being a time hop pattern, a frequency hop pattern or a combination of the time hop pattern and the frequency hop pattern, the time hop pattern being one of the three time hop patterns mentioned in the table below with eight jumps each is:
  • Each row in the table is a time jump pattern
  • each column in the table is a jump of the respective time jump pattern starting from a second jump, so that each time jump pattern has eight jumps, each cell in the table having a time interval from a reference point [e.g. Middle, beginning or end] of the respective jump to the same reference point [e.g.
  • the frequency hopping pattern being one of the three frequency hopping patterns named in the following table, each with eight hops is: each row in the table being a frequency hopping pattern, each column being a hop of the respective frequency hopping pattern in the table, each cell in the table indicating a frequency channel number of the respective hop of the respective frequency hopping pattern.
  • a data transmitter which is configured to transmit a signal in accordance with a hop pattern, the hop pattern being a time hop pattern, a frequency hop pattern or a combination of the time hop pattern and the frequency hop pattern, the time hop pattern being one of the three time hop patterns mentioned in the table below with eight jumps each is:
  • Each row in the table is a time jump pattern
  • each column in the table is a jump of the respective time jump pattern starting from a second jump, so that each time jump pattern has eight jumps, with each cell in the table showing a time interval from a reference point [e.g.
  • the frequency hopping pattern is one of the three frequency hopping patterns listed in the following table, each with eight hops: each row in the table being a frequency hopping pattern, each column being a hop of the respective frequency hopping pattern in the table, each cell in the table indicating a frequency channel number of the respective hop of the respective frequency hopping pattern.
  • a data transmitter which is configured to transmit a signal in accordance with a hop pattern, the hop pattern being a time hop pattern, a frequency hop pattern or a combination of the time hop pattern and the frequency hop pattern, the time hop pattern being one of the three time hop patterns mentioned in the table below with eight jumps each is:
  • Each row in the table is a time jump pattern
  • each column in the table is a jump of the respective time jump pattern starting from a second jump, so that each time jump pattern has eight jumps, with each cell in the table showing a time interval from a reference point [e.g. center , Beginning or end] of the respective jump to the same reference point [e.g.
  • the frequency hopping pattern being one of the three frequency hopping patterns given in the following table, each with eight hops : each row in the table being a frequency hopping pattern, each column being a hop of the respective frequency hopping pattern in the table, each cell in the table indicating a frequency channel number of the respective hop of the respective frequency hopping pattern.
  • the data transmitter can be configured to transmit eight sub-data packets according to the jump pattern by means of the data signal [e.g. so that with each jump of the jump pattern one of the eight sub-data packets is sent].
  • the data transmitter can be configured to transmit at least 24 uplink sub-data packets [e.g. Uplink radio bursts] according to the ETSI TS 103 357 standard, the data transmitter being configured to combine three of the 24 uplink sub-data packets into one long sub-data packet in order to receive eight long sub-data packets, the data transmitter being configured is to use the data signal to send out the eight long sub-data packets according to the jump pattern [e.g. so that with each jump of the jump pattern one of the eight long sub-data packets is sent].
  • uplink sub-data packets e.g. Uplink radio bursts
  • the data transmitter can be configured to provide 24 uplink sub-data packets of the core frame of the ETSI TS 103 357 standard.
  • the data transmitter can be configured to provide 24 uplink sub-data packets of the core frame of the ETSI TS 103357 standard, and to combine three of the 24 uplink sub-data packets of the core frame into one long sub-data packet to form eight long sub-data packets -To receive data packets for the core frame, wherein the data transmitter is further configured to provide further uplink sub-data packets of the extension frame of the ETSI TS 103 357 standard, the data transmitter being configured to transmit the uplink sub-data packets of the extension frame [e.g. not to be combined into long sub-data packets, but] to be sent out in accordance with the ETSI TS 103357 standard.
  • the data transmitter can be configured to provide 24 uplink sub-data packets of the core frame of the ETSI TS 103357 standard, and to combine three of the 24 uplink sub-data packets of the core frame into one long sub-data packet to form eight long sub-data packets -To receive data packets for the core frame, wherein the data transmitter is further configured to provide further uplink sub-data packets of the extension frame of the ETSI TS 103 357 standard, wherein the data transmitter is configured to combine three of the uplink sub-data packets of the extension frame into one long sub-data packet.
  • a data receiver which is configured to receive a signal corresponding to a hop pattern, the hop pattern being a time hop pattern, a frequency hop pattern or a combination of the time hop pattern and the frequency hop pattern, the time hop pattern being one of the three named in the following table
  • Time jump pattern with eight jumps each is: Each row in the table is a time jump pattern, each column in the table is a jump of the respective time jump pattern starting from a second jump, so that each time jump pattern has eight jumps, with each cell in the table showing a time interval from a reference point [e.g. center , Beginning or end] of the respective jump to the same reference point [e.g.
  • the frequency hopping pattern being one of the three frequency hopping patterns given in the following table, each with eight hops : each row in the table being a frequency hopping pattern, each column being a hop of the respective frequency hopping pattern in the table, each cell in the table indicating a frequency channel number of the respective hop of the respective frequency hopping pattern.
  • a data receiver which is configured to receive a signal corresponding to a hopping pattern, the hopping pattern being a time hopping pattern, a frequency hopping pattern or a combination of the Time hopping pattern and the frequency hopping pattern, the time hopping pattern being one of the three time hopping patterns named in the following table, each with eight hops:
  • Each row in the table is a time jump pattern
  • each column in the table is a jump of the respective time jump pattern starting from a second jump, so that each time jump pattern has eight jumps, each cell in the table having a time interval from a reference point [e.g. Middle, beginning or end] of the respective jump to the same reference point [e.g.
  • the frequency hopping pattern being one of the three frequency hopping patterns named in the following table, each with eight hops is: each row in the table being a frequency hopping pattern, each column being a hop of the respective frequency hopping pattern in the table, each cell in the table indicating a frequency channel number of the respective hop of the respective frequency hopping pattern.
  • a data receiver which is configured to receive a signal corresponding to a hop pattern, the hop pattern being a time hop pattern, a frequency hop pattern or a combination of the time hop pattern and the frequency hop pattern, the time hop pattern being one of the three named in the following table
  • Time jump pattern with eight jumps each is: Each row in the table is a time jump pattern, each column in the table is a jump of the respective time jump pattern starting from a second jump, so that each time jump pattern has eight jumps, with each cell in the table showing a time interval from a reference point [e.g. center , Beginning or end] of the respective jump to the same reference point [e.g.
  • the frequency hopping pattern being one of the three frequency hopping patterns given in the following table, each with eight hops : each row in the table being a frequency hopping pattern, each column being a hop of the respective frequency hopping pattern in the table, each cell in the table indicating a frequency channel number of the respective hop of the respective frequency hopping pattern.
  • the data receiver can be configured to receive eight sub-data packets according to the jump pattern by means of the data signal [e.g. so that with each jump of the jump pattern one of the eight sub-data packets is received].
  • the data receiver can be configured to receive eight long sub-data packets according to the jump pattern by means of the data signal [e.g. so that with each jump of the jump pattern one of the eight long sub-data packets is received], with each of the eight long sub-data packets receiving three of 24 uplink sub-data packets [e.g. Uplink Radio Bursts] according to the ETSI TS 103 357 standard, the data receiver being configured to process the eight long sub-data packets in order to receive the 24 uplink sub-data packets.
  • the data signal e.g. so that with each jump of the jump pattern one of the eight long sub-data packets is received
  • each of the eight long sub-data packets receiving three of 24 uplink sub-data packets [e.g. Uplink Radio Bursts] according to the ETSI TS 103 357 standard
  • the data receiver being configured to process the eight long sub-data packets in order to receive the 24 uplink sub-data packets.
  • the 24 uplink sub-data packets can be the 24 uplink sub-data packets of the core frame of the ETSI TS 103 357 standard.
  • the data receiver can also be configured to receive uplink sub-data packets of the extension frame of the ETSI TS 103 357 standard.
  • the data receiver can further be configured to receive further long sub-data packets, each of the further long sub-data packets having three uplink sub-data packets [e.g. Uplink radio bursts] of the extension frame in accordance with the ETSI TS 103 357 standard, the data receiver being configured to process the further long sub-data packets in order to receive the uplink sub-data packets.
  • the data receiver can be configured to process the respective uplink sub-data packets in accordance with the ETSI TS 103 357 standard.
  • the frequency hopping pattern being one of the three frequency hopping patterns named in the following table, each with eight hops: each row in the table being a frequency hopping pattern, each column being a hop of the respective frequency hopping pattern in the table, each cell in the table indicating a frequency channel number of the respective hop of the respective frequency hopping pattern.
  • the frequency hopping pattern being one of the three frequency hopping patterns named in the following table, each with eight hops is: each row in the table being a frequency hopping pattern, each column being a hop of the respective frequency hopping pattern in the table, each cell in the table indicating a frequency channel number of the respective hop of the respective frequency hopping pattern.
  • Each row in the table is a time jump pattern
  • each column in the table is a jump of the respective time jump pattern starting from a second jump, so that each time jump pattern has eight jumps, with each cell in the table showing a time interval from a reference point [e.g. center , Beginning or end] of the respective jump to the same reference point [e.g.
  • the frequency hopping pattern being one of the three frequency hopping patterns given in the following table, each with eight hops : each row in the table being a frequency hopping pattern, each column being a hop of the respective frequency hopping pattern in the table, each cell in the table indicating a frequency channel number of the respective hop of the respective frequency hopping pattern.
  • the frequency hopping pattern being one of the three frequency hopping patterns given in the following table, each with eight hops : each row in the table being a frequency hopping pattern, each column being a hop of the respective frequency hopping pattern in the table, each cell in the table indicating a frequency channel number of the respective hop of the respective frequency hopping pattern.
  • the frequency hopping pattern being one of the three frequency hopping patterns given in the following table, each with eight hops : each row in the table being a frequency hopping pattern, each column being a hop of the respective frequency hopping pattern in the table, each cell in the table indicating a frequency channel number of the respective hop of the respective frequency hopping pattern.
  • Frequency hopping patterns with eight hops each is: where in the table each row is a frequency hopping pattern, where in the table each column is a hop of the respective frequency hopping pattern, where in the table each cell indicates a frequency channel number of the respective hop of the respective frequency hopping pattern,
  • FIG. 1 shows a schematic block diagram of a system with one or more
  • Fig. 2 in a diagram an occupancy of the transmission channel in the
  • Fig. 8 in a diagram a two-dimensional (thumbtack)
  • FIG. 11 shows a flow diagram of a method for sending a data packet in a communication system
  • FIG. 12 shows a flow diagram of a method for receiving a data packet in a communication system
  • FIG. 13 shows a flow diagram of a method for generating a jump pattern for the transmission of a plurality of sub-data packets in a communication system
  • FIG. 14 shows a flow diagram of a method for generating (K) jump patterns with predetermined autocorrelation properties.
  • a data transmitter for example the data transmitter 100_1
  • a data transmitter 100_1 can be designed to split a data packet (e.g. of the physical layer) into a plurality of sub-data packets 142 and to divide the plurality of sub-data packets 142 according to a jump pattern 140 distributed in time and / or frequency, for example by means of a signal 120 which has the plurality of sub-data packets 142.
  • a data packet e.g. of the physical layer
  • a jump pattern 140 distributed in time and / or frequency
  • the data transmitter 100_1 and the data receiver 110 can be designed to send and receive data using the telegram splitting method.
  • a telegram or data packet (e.g. of the physical layer) is divided into a plurality of sub-data packets (or partial data packets, or partial packets) 142 and the plurality of sub-data packets 142 according to the jump pattern 140 in time and / or in frequency distributed from the data transmitter 100_ 1 to the data receiver 110, the data receiver 110 reassembling (or combining) the sub-data packets 142 in order to receive the data packet.
  • Each of the plurality of sub-data packets 142 contains only part of the data packet.
  • the data packet can also be channel-coded, so that not all sub-data packets 142 but only some of the sub-data packets 142 are required for error-free decoding of the data packet.
  • the time distribution of the plurality of sub-data packets 142 can, as already mentioned, take place in accordance with a time and / or frequency hopping pattern.
  • a time jump pattern can specify a sequence of transmission times or transmission time intervals with which the sub-data packets are sent. For example, a first sub-data packet can be sent at a first transmission time (or in a first transmission time slot) and a second sub-data packet at a second transmission time (or in a second transmission time slot), the first transmission time and the second The sending time are different.
  • the time jump pattern can define (or specify, or specify) the first transmission time and the second transmission time.
  • the time jump pattern can indicate the first transmission time and a time interval between the first transmission time and the second transmission time.
  • the time jump pattern can also only specify the time interval between the first point in time and the second transmission point in time. There may be pauses in transmission between the sub-data packets during which there is no transmission.
  • a frequency hopping pattern can specify a sequence of transmission frequencies or transmission frequency hops with which the sub-data packets are sent. For example, a first sub-data packet can be sent with a first transmission frequency (or in a first frequency channel) and a second sub-data packet with a second transmission frequency (or in a second frequency channel), the first transmission frequency and the second transmission frequency being different.
  • the frequency hopping pattern can define (or specify, or specify) the first transmission frequency and the second transmission frequency.
  • the frequency hopping pattern can indicate the first transmission frequency and a frequency spacing (transmission frequency hopping) between the first transmission frequency and the second transmission frequency.
  • the frequency hopping pattern can also only indicate the frequency spacing (transmission frequency hopping) between the first transmission frequency and the second transmission frequency.
  • the plurality of sub-data packets 142 can also be transmitted from the data transmitter 100_1 to the data receiver 110, both in terms of time and frequency.
  • the distribution of the plurality of sub-data packets in terms of time and frequency can take place in accordance with a time and frequency hopping pattern.
  • a time and frequency hopping pattern can be the combination of a time hopping pattern and a frequency hopping pattern, i.e. a sequence of transmission times or transmission time intervals with which the sub-data packets are transmitted, with transmission times (or transmission time intervals) being assigned transmission frequencies (or transmission frequency hops).
  • time and frequency hopping pattern 140 are transmitted from the data transmitter 100_1 to the data receiver 110 in accordance with a time and frequency hopping pattern 140, distributed in time and frequency.
  • LPWAN Low Power Wide Area Network, dt. Low energy telemetry system
  • the exemplary embodiment of the data transmitter 100_1 and / or the data receiver 110 described below can be implemented, for example, in an LWPAN system, as specified, for example, in ETSI TS 103357 [9], or in any other communication system, e.g. Frequency band communicates wirelessly, which is used by a plurality of communication systems for communication.
  • a so-called “contention-based access method” is used.
  • the subscribers 100_1-100_n for example terminals
  • the subscribers 110_1-110__n access a common range of radio resources on their own initiative. This can lead to access conflicts, ie to the simultaneous occupancy of resource elements by two or more participants.
  • the "competition-based access method” a rough distinction can generally be made between the following variants: a) In the case of a purely unidirectional data transmission from the subscriber (e.g. end point) to the base station, the latter sends its message according to a cyclical cycle (the duty cycle).
  • Variant a) can be expanded to include a simple bidirectional interface. If the base station successfully receives a data packet from a subscriber, the base station can send a to the subscriber immediately after the end of this transmission Send message ("immediate feedback", "ACK / NACK"). To receive this return channel, the subscriber only switches his receiver on for a very short time interval.
  • the base station acts here as a coordinating entity (master), for example by periodically sending out a beacon signal or other reference signals.
  • the participants can synchronize with it and then access a time-limited range of radio resources on their own initiative in a competitive process (uncoordinated and independent of one another).
  • the clocking of the access attempts is synchronized (“slotted”) in time slots (so-called resource blocks) and each participant is only allowed to send out one of its sub-data packets at the beginning of a time slot.
  • Embodiments of the present invention create jump patterns and generation rules (e.g. draft rules) for jump patterns which are specially tailored to asynchronous ("unslotted") data transmission (e.g. variant a) and / or variant b)).
  • draft rules e.g. draft rules
  • the result is the four distances ⁇ 2,7,8,11 ⁇ .
  • the second marking 302_2 has the three distances ⁇ 5,6,9 ⁇ to the remaining three right markings 302_3-302_5 and the differences ⁇ 1,4 ⁇ result as distances for the third marking 302_3.
  • the last distance between the fourth marking 302_4 and the fifth marking 302_5 is ⁇ 3 ⁇ .
  • there are different distances in which in FIG The example shown is ten different distances. In increasing order this results in the difference series of numbers ⁇ 1, 2, 3, 4, 5, 6, 7, 8, 9, 11 ⁇ for all marking distances. It becomes clear that no spaces occur twice in the difference series of numbers.
  • Golomb arrangements are characterized by the fact that their autocorrelation function (AKF) only have secondary values ⁇ ⁇ ⁇ 0.1 ⁇ .
  • the AKF is defined for sin) as where the * character characterizes the conjugate complex operation. In the case of real-valued sequences (which are assumed here) this operation can be omitted.
  • ⁇ n ( ⁇ ) means that the summation takes place over all n for which the argument ( ⁇ ) does not vanish.
  • Parallel shifts (adding or deleting zeros at the edges, corresponding to s (n - n 0 )) and a mirroring s (-n) are trivial invariance operations that leave the AKF of unipolar non-periodic binary sequences unchanged. In this respect, there is always a pair of mirrors for every binary sequence, whereby normally only one is ever mentioned.
  • K different jump patterns are used, which differ from one another in terms of their time and frequency behavior.
  • a full collision is when 2 data transmitters transmit an identical jump pattern independently of one another at the same time and with the same frequency position.
  • all L sub-data packets of the two data transmitters e.g. participants
  • collide and, despite the presence of error protection, this usually leads to a loss of the two telegrams.
  • K binary sequences e.g. three binary sequences
  • these sequences should also have good correlation properties with one another in the aperiodic cross-correlation function (KKF) exhibit.
  • the exemplary embodiments described below create unipolar aperiodic binary sequences with improved (for example good) correlation behavior and / or show how unipolar aperiodic binary sequences with improved (for example good) correlation behavior can be generated.
  • Improved (eg good) correlation properties are characterized by a maximum main / secondary maximum ratio. Since the main AKF maximum in unipolar binary sequences is always the same as order E, the above requirement corresponds to minimum secondary AKF values of ⁇ ⁇ ⁇ 0,1 ⁇ .
  • Optimal Golomb sequences or also Barker sequences are characterized by precisely these properties. 1 Generation (e.g. draft) of jump patterns for asynchronous transmission with maximum sub-data packet length
  • a large number of subscribers each send L sub-data packets with a sub-data packet duration of T SP within a predetermined total transmission duration T GSD .
  • T GSD total transmission duration
  • all subscribers eg users
  • Each of the L sub-data packets contains XSP symbols, which in turn are composed of pilot and data symbols.
  • 5a-c show an occupancy of a communication channel when sub-data packets are sent out by three different participants (users).
  • the time intervals t l (I + 1) which each characterize the distance between two adjacent sub-data packet centers at t l and t l + 1 , each have a different length.
  • the Base station provides a grid of time slots for the channel accesses. There are therefore only two states in the case of synchronous transmission: there is either a complete overlap of two sub-data packets, such as sub-data packet 150_2 of the first
  • a time slot which corresponds to the duration of a sub-data packet, can be viewed here as a basic unit. If no sub-data packet is sent in a time slot, this corresponds to a zero, “0”, in one of the binary sequences described above, with a one, “1”, a subscriber sends a sub-data packet. A finer resolution is not necessary.
  • the symbol duration T s is typically grooved there as the smallest unit. According to Eq. (12) meet and superimpose in 2X SP - 1 different symbol positions. For the definition of a collision used here, it does not matter whether the two sub-data packets only touch each other in a symbol interval or whether they completely overlap. Any type of touch is counted as a hit.
  • FIG. 7 only shows the right half of the AKF.
  • a mapping is carried out on a jump pattern, taking into account the duration of the symbols and the transmission.
  • the boundary conditions (Eq. (16-19)) with regard to the sub-data packet length are listed so that the one-dimensional AKF of this jump pattern only has secondary values ⁇ ⁇ 1.
  • the data transmitter 100_ 1 shown in Fig. 1 can accordingly be configured to derive the jump pattern 142 from a unipolar binary sequence (e.g. based on a Golomb ruler or a Barker sequence), wherein
  • the data receiver 110 shown in FIG. 1 can thus be configured to derive the jump pattern 142 from a unipolar binary sequence (e.g. based on a Golomb ruler or a Barker sequence), where
  • a maximum length of the sub-data packets is dependent on a minimum value of a difference sequence of a sorted differential number series derived from the binary sequence, e.g. so that autocorrelation secondary maxima of an autocorrelation function of the transmission of the plurality of sub-data packets have the same maximum value as the autocorrelation secondary maxima the autocorrelation function of the binary sequence, or, for example, so that autocorrelation secondary values of an autocorrelation function of the jump pattern assume at most values of one.
  • the exemplary embodiments described in section 1 relate exclusively to the consideration of a single jump pattern (e.g. hopping sequence).
  • a single jump pattern e.g. hopping sequence
  • several (different) jump patterns can be used.
  • a full collision occurs when two participants (e.g. users) at the same start time and on the same frequency, independently of each other, use the same jump pattern (e.g. hopping sequence).
  • all L sub data packets of the two participants would overlap and interfere with one another.
  • K different jump patterns the probability of full collisions can be reduced by a factor of 1 / K.
  • K autocorrelations have good correlation properties, but also all different permutations of all cross-correlation variants.
  • the data sender or data recipient has a whole group of
  • the generation e.g. the design
  • a group of jump patterns with improved AKF and / or KKF properties can be carried out based on one or more of the following steps:
  • F YGSD / N according to Eq. (18).
  • the initial dimensionless length N of the original Golomb or Barker sequences is adapted to the symbol duration and in particular to the total transmission duration.
  • Step 3 taking F into account, can also take place before step 1 and be taken into account in the initial Golomb or Barker sequences. There are then greater degrees of freedom in defining the individual markings.
  • the number of frequency channels C is included in order to obtain good cross-correlation properties with permitted secondary values of ⁇ 1 for all permutations of the cross-correlations.
  • the following rule of thumb can advantageously be fulfilled for the number of frequencies C:
  • the C different frequency channels run through a total of L * K. Often there is the additional requirement that the frequency channels should be occupied evenly on average, such that (L * K) / C results in an integer.
  • Table 1a Time slot of the first three jump patterns of G 6 for a frame duration of 1 s
  • Table 1b Time slot of the second three jump patterns of G 6 for a frame duration of 1 s
  • Table 2b Frequency position of the three different jump patterns of G 6 from Table 1b for a frame duration of 1 s
  • one of the exemplary embodiments described in section 1 can be extended to a group of K jump patterns whose two-dimensional autocorrelation or cross-correlation sequences are all exclusively secondary values of ⁇ 1 exhibit.
  • the number C of available frequencies is added as a further degree of freedom.
  • a data transmitter e.g. the data transmitter shown in FIG. 1, can be configured to transmit a signal (e.g. comprising eight sub-data packets) corresponding to a jump pattern, the jump pattern being a time jump pattern, a frequency jump pattern or a combination of the time jump pattern and the Is frequency hopping pattern, the time hopping pattern being one of the time hopping patterns named in Tables 1a and 1b with eight hops each, and the frequency hopping pattern being one of the frequency hopping patterns named in Tables 2a and 2b with eight hops each.
  • a signal e.g. comprising eight sub-data packets
  • the number of symbols factor F Y GSD / N becomes smaller and smaller and the result is that the permitted sub-data packet length X SP becomes smaller and smaller so that the secondary maxima of the 1 D-AKF adhere to the required values ⁇ ⁇ 1 . If, for example, the frame duration T GSD were shortened from 1 s to 0.25 s with G 6 , then the maximum possible sub-data packet length would be reduced to 30 symbols, with the optimal Golomb ruler G 3 it would only be 37 symbols .
  • Eq. (24) as a function of the influencing variables order E of the Golomb ruler, its length N, the total transmission duration T GSD and the symbol duration T s together with Eq. (15) to (18) an estimate for the maximum values ⁇ ⁇ T of the secondary maxima that can occur in the one-dimensional AKF.
  • the number of frequency channels C can be selected so that they do not fall below the following value, if possible:
  • Table 4 Frequency position of the three different jump patterns of G 1 for a frame duration of 0.25 s
  • one of the exemplary embodiments described in section 2 can be expanded to include jump patterns whose 1D AKF has secondary values with ⁇ > 1.
  • the “(optimal) Golomb rulers” or Barker Fofgen prove to be optimal.
  • the unbundling, that here too the 2D autocorrelation functions and cross-correlation functions again exclusively have secondary values of ⁇ ⁇ 1, can take place over a larger number of available frequencies.
  • a data transmitter for example the data receiver 110 shown in FIG. 1, can be configured to receive a signal (for example having eight sub-data packets) which is transmitted in accordance with a hopping pattern, the hopping pattern being a time hopping pattern, a frequency hopping pattern or is a combination of the time hopping pattern and the frequency hopping pattern, the time hopping pattern being one of the time hopping patterns named in Table 4, each with eight hops, and the frequency hopping pattern being one of the frequency hopping patterns named in Table 4, each with eight hops.
  • a signal for example having eight sub-data packets
  • New partial data packet duration 1.89 ms
  • the data sender e.g. end point, such as sensor node
  • the data sender typically switches to sleep mode between the sub-data packets in order to save power, it is necessary for it to wait a certain time before the transmission begins until the crystal after the
  • This time is typically in the range of a few milliseconds, so that the overhead in the system from [9] only has a slight impact.
  • the sensor node Since there are now only eight sub-data packets with three times the duration in the data transmitter instead of 24 sub-data packets, the sensor node only has to wake up from sleep mode eight instead of 24 May and wait until the quartz has settled, which significantly reduces the power consumption per telegram sent .
  • the signal processing can continue to be carried out on the original 24 sub-data packets, since the pilot sequences (training sequence, midamble, preamble, synchronization sequence) are still contained in all three combined sub-data packets.
  • a simple adaptation (only adaptation of the jump pattern in the correlation) is thus also given in the receiver.
  • three sub-data packets of an uplink message from the core frame according to [9] can be linked in time and transmitted on the same frequency.
  • FIG. 12 shows a flow diagram of a method 600 for receiving a data packet in a communication system, the communication system communicating wirelessly in a frequency band which is used by a plurality of communication systems for communication.
  • the method 600 comprises a step 610 of receiving a plurality of sub-data packets, which are transmitted in a distributed manner in accordance with a jump pattern.
  • the method 600 further comprises a step of combining 620 the plurality of sub-data packets in order to obtain the data packet which is divided into the plurality of sub-data packets, the jump pattern being derived from a binary sequence, an autocorrelation function of the binary sequence having autocorrelation secondary maxima a given maximum value [e.g.
  • a minimum total transmission duration within which the plurality of sub-data packets are transmitted and / or a maximum length of the sub-data packets of a minimum value of a differential sequence of a sorted sequence derived from the binary sequence Difference number series is dependent [e.g. so that secondary autocorrelation maxima of an autocorrelation function of the transmission of the plurality of sub-data packets have the same maximum value as the secondary autocorrelation maxima of the autocorrelation function of the binary sequence].
  • the method 800 further comprises a step 820 of deriving a plurality of binary sequences from the basic binary sequence based on a different arrangement of distances between successive elements of the basic binary sequence which have a predetermined logical value [e.g. a first logical value, such as logical one , 1].
  • the method 800 further comprises a step of determining 830, for each of the plurality of binary sequences, a difference series of numbers in order to obtain a plurality of difference series of numbers for the plurality of binary sequences, wherein a respective difference series of numbers all distances between all elements [ eg digits] of the respective binary sequence which have a predetermined logical value [eg a first logical value, such as logical one, 1].
  • the method 800 further comprises a step of determining 840, for each of the plurality of difference series of numbers, a difference sequence in order to obtain a plurality of difference sequences for the plurality of difference series of numbers, a respective difference sequence of all differences between immediate neighboring values of the respective difference series of numbers.
  • the method 800 further comprises a step of determining 850 a minimum value for each of the plurality of difference sequences in order to obtain a plurality of minimum values.
  • the method 800 further comprises a step of selecting 860 a predetermined number K of binary sequences from the plurality of binary sequences, those binary sequences being selected from the plurality of binary sequences whose minimum values are greatest.
  • the method 800 further includes a step 870 of deriving a hop pattern from each of the K selected binary sequences to obtain K hop patterns.
  • Embodiments of the present invention create unipolar aperiodic binary sequences with improved (eg good) correlation behavior. Improved (eg good) correlation properties are characterized by a maximum main / secondary maximum ratio.
  • mapping to a jump pattern can take place, taking into account the symbol and transmission duration.
  • Embodiments describe boundary conditions that enable a certain partial packet length so that the one-dimensional AKF of the jump pattern only has secondary values of ⁇ 1.
  • Embodiments of the present invention are used in systems for radio transmission of data from many terminals to a base station and / or from one or more base stations to terminals. Depending on the application, this can be a unidirectional or a bidirectional data transmission. Embodiments can be used particularly advantageously in systems in which a coded message (data packet) is transmitted in several sub-data packets (or partial data packets) that are smaller than the actual information (ie the coded message (data packet)) that are transmitted should (the so-called Telegram Splitting Multiple Access, TSMA), see eg [1], [2], [3]). A telegram (ie the coded message (data packet)) is divided into several sub-data packets.
  • TSMA Telegram Splitting Multiple Access
  • the L sub data packets are sent on one frequency or distributed over several frequencies. Between the L sub data packets there are Temporal pauses in which there is no transmission, whereby the pauses can differ in their length in multiples of the symbol duration.
  • the sequence of transmissions of the sub-data packets in time and frequency is referred to as the channel access pattern or hopping pattern.
  • the approach of the telegram splitting process provides a particularly high level of robustness against interference from other data transmitters (e.g. sensor nodes), regardless of whether they come from your own or external systems.
  • the immunity to interference in the own data transmitters (e.g. sensor nodes) is achieved in particular by distributing the various sub-data packets as evenly as possible over both the time and the frequency range. This random distribution is achieved through a different burst arrangement of the different data transmitters (e.g. sensor nodes) to different jump patterns or hopping patterns.
  • aspects have been described in connection with a device, it goes without saying that these aspects also represent a description of the corresponding method, so that a block or a component of a device is also to be understood as a corresponding method step or as a feature of a method step. Analogously, aspects that have been described in connection with or as a method step also represent a description of a corresponding block or details or features of a corresponding device.
  • Some or all of the method steps can be carried out by a hardware apparatus (or using a hardware Apparatus), such as a microprocessor, a programmable computer or an electronic circuit. In some embodiments, some or more of the most important process steps can be performed by such an apparatus.
  • embodiments of the invention can be implemented in hardware or in software.
  • the implementation can be carried out using a digital storage medium such as a floppy disk, a DVD, a Blu-ray disk, a CD, a ROM, a PROM, an EPROM, an EEPROM or a FLASH memory, a hard disk or other magnetic memory or optical memory on which electronically readable control signals are stored, which can interact in this way with a programmable computer system or
  • the digital storage medium can be computer readable.
  • Some exemplary embodiments according to the invention thus include a data carrier which has electronically readable control signals which are capable of interacting with a programmable computer system in such a way that one of the methods described herein is carried out.
  • exemplary embodiments of the present invention can be implemented as a computer program product with a program code, the program code being effective to carry out one of the methods when the computer program product runs on a computer.
  • exemplary embodiments include the computer program for performing one of the methods described herein, the computer program being stored on a machine-readable carrier.
  • an exemplary embodiment of the method according to the invention is thus a computer program which has a program code for performing one of the methods described herein when the computer program runs on a computer.
  • a further exemplary embodiment of the method according to the invention is thus a data carrier (or a digital storage medium or a computer-readable medium) on which the computer program for performing one of the methods described herein is recorded.
  • the data carrier, the digital storage medium or the computer-readable medium are typically tangible and / or non-perishable or non-transitory.
  • a further exemplary embodiment of the method according to the invention is thus a data stream or a sequence of signals which represents or represents the computer program for performing one of the methods described herein.
  • the data stream or the sequence of signals can or can, for example, to that effect be configured to be transferred over a data communication link, for example over the Internet.
  • Another exemplary embodiment comprises a processing device, for example a computer or a programmable logic component, which is configured or adapted to carry out one of the methods described herein.
  • a processing device for example a computer or a programmable logic component, which is configured or adapted to carry out one of the methods described herein.
  • a further exemplary embodiment according to the invention comprises a device or a system which is designed to transmit a computer program for carrying out at least one of the methods described herein to a receiver.
  • the transmission can take place electronically or optically, for example.
  • the receiver can be, for example, a computer, a mobile device, a storage device or a similar device.
  • the device or the system can, for example, comprise a file server for transmitting the computer program to the recipient.
  • a programmable logic component for example a field-programmable gate array, an FPGA
  • a field-programmable gate array can interact with a microprocessor in order to carry out one of the methods described herein.
  • the methods are performed by any hardware device. This can be universally applicable hardware such as a computer processor (CPU) or hardware specific to the method such as an ASIC.
  • the devices described herein, or any components of the devices described herein can be implemented at least partially in hardware and / or in software (computer program).
  • the methods described herein can be implemented using hardware apparatus, or using a computer, or using a combination of hardware apparatus and a computer.
  • the methods described herein, or any components of the methods described herein can be carried out at least in part by hardware and / or by software.
  • HNV main / secondary maximum ratio (see Eq. (5))
  • N length of a Golomb ruler (corresponding to the last ones marking)
  • T T duration of the “compact” telegram; corresponds to the duration of L subpackets
  • XSP length of a subpacket in symbols

Landscapes

  • Engineering & Computer Science (AREA)
  • Signal Processing (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

Dans des modes de réalisation cités à titre d'exemple, l'invention concerne un procédé pour produire un modèle de saut pour transmettre une pluralité de sous-paquets de données dans un système de communication. Le procédé comprend une étape consistant à dériver un modèle de saut d'une suite binaire, une fonction d'autocorrélation de la suite binaire présentant des maxima secondaires d'autocorrélation avec une valeur maximale prédéterminée. Le procédé comprend par ailleurs une étape consistant à déterminer une longueur de sous-paquet de données maximale pour la pluralité de sous-paquets de données en fonction d'une durée d'émission globale indiquée par le modèle de saut, de la pluralité de sous-paquets de données, et d'une valeur minimale d'une suite différentielle d'une série de nombre différentiels ordonnée, dérivée de la suite binaire.
EP20796760.5A 2019-10-23 2020-10-21 Suites binaires unipolaires à comportement de corrélation non périodique amélioré pour systèmes tsma non synchronisés Pending EP4049374A2 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
DE102019216347.5A DE102019216347A1 (de) 2019-10-23 2019-10-23 Unipolare Binärfolgen mit verbessertem nichtperiodischen Korrelationsverhalten für unsynchronisierte TSMA-Systeme
PCT/EP2020/079662 WO2021078816A2 (fr) 2019-10-23 2020-10-21 Suites binaires unipolaires à comportement de corrélation non périodique amélioré pour systèmes tsma non synchronisés

Publications (1)

Publication Number Publication Date
EP4049374A2 true EP4049374A2 (fr) 2022-08-31

Family

ID=73013415

Family Applications (1)

Application Number Title Priority Date Filing Date
EP20796760.5A Pending EP4049374A2 (fr) 2019-10-23 2020-10-21 Suites binaires unipolaires à comportement de corrélation non périodique amélioré pour systèmes tsma non synchronisés

Country Status (5)

Country Link
US (1) US11881889B2 (fr)
EP (1) EP4049374A2 (fr)
CN (1) CN114846745A (fr)
DE (1) DE102019216347A1 (fr)
WO (1) WO2021078816A2 (fr)

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
DE102017206236A1 (de) * 2017-04-11 2018-10-11 Fraunhofer-Gesellschaft zur Förderung der angewandten Forschung e.V. Spezifische hoppingmuster für telegram-splitting
DE102017220061A1 (de) * 2017-11-10 2019-05-16 Fraunhofer-Gesellschaft zur Förderung der angewandten Forschung e.V. Datensender und Datenempfänger mit geringer Latenz für das Telegram-Splitting-Übertragungsverfahren
DE102022101405A1 (de) 2021-09-03 2023-03-09 Diehl Metering Systems Gmbh Verfahren zum Betrieb eines Knotens in einem Funknetzwerk
CA3228088A1 (fr) * 2021-09-03 2023-03-09 Diehl Metering Systems Gmbh Procede de fonctionnement d'un nƒud dans un reseau radio

Family Cites Families (15)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6959032B1 (en) * 2000-06-12 2005-10-25 Time Domain Corporation Method and apparatus for positioning pulses in time
US7068703B2 (en) * 2003-02-18 2006-06-27 Qualcomm, Incorporated Frequency hop sequences for multi-band communication systems
US7930331B2 (en) * 2005-09-26 2011-04-19 Temarylogic Llc Encipherment of digital sequences by reversible transposition methods
CN101964694B (zh) * 2010-09-27 2013-01-30 北京航空航天大学 高吞吐量、延时敏感无线网络的低截获信号传输系统及方法
DE102011082098B4 (de) 2011-09-02 2014-04-10 Fraunhofer-Gesellschaft zur Förderung der angewandten Forschung e.V. Batteriebetriebene stationäre Sensoranordnung mit unidirektionaler Datenübertragung
US10334633B2 (en) * 2016-01-07 2019-06-25 Qualcomm Incorporated Narrow band physical random access channel frequency hopping patterns and detection schemes
DE102016220882A1 (de) * 2016-10-24 2018-04-26 Fraunhofer-Gesellschaft zur Förderung der angewandten Forschung e.V. Optimierte Sprungmuster für verschiedene Sensorknoten und variable Datenlängen auf Basis des Telegram Splitting Übertragungsverfahrens
WO2018162756A1 (fr) * 2017-03-10 2018-09-13 Thales Alenia Space Italia S.P.A. Con Unico Socio Système de localisation innovant, transpondeur régénérateur associé à faible consommation d'énergie, et procédé et service de localisation associés
DE102017206236A1 (de) 2017-04-11 2018-10-11 Fraunhofer-Gesellschaft zur Förderung der angewandten Forschung e.V. Spezifische hoppingmuster für telegram-splitting
US11431464B2 (en) * 2017-05-05 2022-08-30 Samsung Electronics Co., Ltd. Method and apparatus for uplink transmission in wireless communication system
DE102017211375B3 (de) 2017-07-04 2018-12-13 Fraunhofer-Gesellschaft zur Förderung der angewandten Forschung e.V. Spezifische Sprungmuster für wiederholtes Senden und Empfangen von Daten und Verfahren zum Erzeugen derselben
DE102018215191A1 (de) 2018-09-06 2020-03-12 Fraunhofer-Gesellschaft zur Förderung der angewandten Forschung e.V. Zirkulare Sprungmuster
DE102018222859A1 (de) 2018-12-21 2020-06-25 Fraunhofer-Gesellschaft zur Förderung der angewandten Forschung e.V. Einsatz von zyklisch geschobenen Grundmustern zur Detektionsratenoptimierung
DE102019212704A1 (de) 2019-08-23 2021-02-25 Fraunhofer-Gesellschaft zur Förderung der angewandten Forschung e.V. Unipolare binärfolgen mit gutem periodischen korrelationsverhalten
BR102022009032A2 (pt) * 2021-07-02 2023-01-10 Semtech Corporation Rede de comunicação sem fio e transceptor

Also Published As

Publication number Publication date
WO2021078816A2 (fr) 2021-04-29
US20220345177A1 (en) 2022-10-27
DE102019216347A1 (de) 2021-04-29
CN114846745A (zh) 2022-08-02
US11881889B2 (en) 2024-01-23
WO2021078816A3 (fr) 2021-06-24

Similar Documents

Publication Publication Date Title
EP4049374A2 (fr) Suites binaires unipolaires à comportement de corrélation non périodique amélioré pour systèmes tsma non synchronisés
EP3649758B1 (fr) Schéma de saut spécifique pour l'émission et la réception répétées de données
EP3529938B1 (fr) Modèles de saute optimisés pour des noeuds de capteurs differents et données de durée variable basé sur un procédé de transmission de type telegram splitting
WO2018188814A2 (fr) Modèles de saut spécifiques pour segmentation de télégrammes
WO2019092184A1 (fr) Émetteur de données et récepteur de données à faible latence pour le procédé de transmission par division de télégramme
WO2018077814A1 (fr) Combinaison optimisée de préambules et de champs de données pour des réseaux de capteurs à faible consommation d'énergie sur la base du procédé de segmentation de télégrammes
EP3811704B1 (fr) Accès au canal par modèle d'accès au canal organisé de manière hiérarchique
DE2625038A1 (de) Konverter zur konvertierung einer folge von informationssignalen in eine folge von mehrphasigen traegerimpulse bzw. umgekehrt
WO2019243466A1 (fr) Génération de modèles d'accès canal pour des réseaux non coordonnés entre eux
EP3847758A1 (fr) Balise de synchronisation
EP3900247B1 (fr) Utilisation de modèles de base à décalage cyclique permettant d'optimiser les taux de détection
WO2021037849A1 (fr) Détection des signaux d'abonnés radio dans un système synchronisé
EP2015465A2 (fr) Procédé de production de séquences de sauts de fréquences
WO2021037737A1 (fr) Séquences binaires unipolaires présentant de bonnes caractéristiques de corrélation périodique
WO2020048869A1 (fr) Schémas de saut circulaires
DE102015217954B4 (de) Verfahren zur Übertragung von Daten
DE102018218730A1 (de) Detektion einer Pilotsequenz auf einfachen Rechnern
DE102019209528A1 (de) Effiziente signalisierung von sprungmustern in zugewiesenen ressourcen
DE102008005816A1 (de) Verfahren zur Erzeugung von Frequency-Hopping-Frequenzfolgen

Legal Events

Date Code Title Description
STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: UNKNOWN

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE INTERNATIONAL PUBLICATION HAS BEEN MADE

PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: REQUEST FOR EXAMINATION WAS MADE

17P Request for examination filed

Effective date: 20220420

AK Designated contracting states

Kind code of ref document: A2

Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR

DAV Request for validation of the european patent (deleted)
DAX Request for extension of the european patent (deleted)
RAP1 Party data changed (applicant data changed or rights of an application transferred)

Owner name: DIEHL METERING GMBH

Owner name: FRAUNHOFER-GESELLSCHAFT ZUR FOERDERUNG DER ANGEWANDTEN FORSCHUNG E.V.

RIN1 Information on inventor provided before grant (corrected)

Inventor name: PETKOV, HRISTO

Inventor name: KAUPPERT, THOMAS

Inventor name: OBERNOSTERER, FRANK

Inventor name: MEYER, RAIMUND

Inventor name: KNEISSL, JAKOB

Inventor name: WECHSLER, JOHANNES

Inventor name: BERNHARD, JOSEF

Inventor name: KILIAN, GERD