EP3529928A2 - Entrelacement pour la transmission de télégrammes à nombre variable de sous-paquets et décodage successif - Google Patents

Entrelacement pour la transmission de télégrammes à nombre variable de sous-paquets et décodage successif

Info

Publication number
EP3529928A2
EP3529928A2 EP17791038.7A EP17791038A EP3529928A2 EP 3529928 A2 EP3529928 A2 EP 3529928A2 EP 17791038 A EP17791038 A EP 17791038A EP 3529928 A2 EP3529928 A2 EP 3529928A2
Authority
EP
European Patent Office
Prior art keywords
data
core
sub
extension
packets
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
EP17791038.7A
Other languages
German (de)
English (en)
Inventor
Gerd Kilian
Josef Bernhard
Jörg Robert
Jakob KNEISSL
Johannes WECHSLER
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.)
Friedrich Alexander Universitaet Erlangen Nuernberg
Fraunhofer Gesellschaft zur Foerderung der Angewandten Forschung eV
Original Assignee
Friedrich Alexander Universitaet Erlangen Nuernberg
Fraunhofer Gesellschaft zur Foerderung 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 Friedrich Alexander Universitaet Erlangen Nuernberg, Fraunhofer Gesellschaft zur Foerderung der Angewandten Forschung eV filed Critical Friedrich Alexander Universitaet Erlangen Nuernberg
Publication of EP3529928A2 publication Critical patent/EP3529928A2/fr
Pending legal-status Critical Current

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056—Systems characterized by the type of code used
    • H04L1/007—Unequal error protection
    • 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
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/27—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes using interleaving techniques
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/27—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes using interleaving techniques
    • H03M13/2703—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes using interleaving techniques the interleaver involving at least two directions
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/27—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes using interleaving techniques
    • H03M13/2703—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes using interleaving techniques the interleaver involving at least two directions
    • H03M13/2707—Simple row-column interleaver, i.e. pure block interleaving
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/33—Synchronisation based on error coding or decoding
    • H03M13/333—Synchronisation on a multi-bit block basis, e.g. frame synchronisation
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/37—Decoding methods or techniques, not specific to the particular type of coding provided for in groups H03M13/03 - H03M13/35
    • H03M13/3776—Decoding methods or techniques, not specific to the particular type of coding provided for in groups H03M13/03 - H03M13/35 using a re-encoding step during the decoding process
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0041—Arrangements at the transmitter end
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056—Systems characterized by the type of code used
    • H04L1/0071—Use of interleaving
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/0078—Avoidance of errors by organising the transmitted data in a format specifically designed to deal with errors, e.g. location
    • H04L1/0083—Formatting with frames or packets; Protocol or part of protocol for error control
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/0078—Avoidance of errors by organising the transmitted data in a format specifically designed to deal with errors, e.g. location
    • H04L1/0084—Formats for payload data
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/0078—Avoidance of errors by organising the transmitted data in a format specifically designed to deal with errors, e.g. location
    • H04L1/0086—Unequal error protection
    • H04L1/0089—Unequal error protection in payload

Definitions

  • Embodiments of the present invention relate to a data transmitter for transmitting data. Further embodiments relate to a data receiver for receiving data. Some embodiments relate to interleaving for the transmission of messages with variable sub-packet number and successive decoding.
  • DE100 201 1 082 098 B4 describes a method for battery-operated transmitters, in which the data packet is subdivided into transmission packets (or sub-data packets) which are smaller than the actual information that is to be transmitted (so-called telegram splitting) )). Telegrams are divided into several subpackets (or subdata packages). Such a subpackage is called a hop, in a hop several information symbols are transmitted. The hops are distributed on one frequency or over several frequencies, so-called frequency hopping. There are pauses between the hops where there is no transmission.
  • channel coding of the data to be transmitted is performed, e.g. by a convolutional encoder, which provides redundancy in the signal so that it can be correctly decoded even with corrupted parts,
  • the performance of this channel coding depends on how many consecutive symbols are disturbed. Since an interferer frequently disturbs successive symbols, the symbols are interlaced after the channel coding in such a way that symbols in the transmitted telegram, in the channel-coded codeword, have the greatest possible distance from one another.
  • the interlaced) of the symbols also called interleaving
  • the information of the telegram can only be recovered as a whole, since the information is scattered over the entire telegram. This makes it impossible to analyze a length field that would allow one to receive a variable number of subpackets. If, for example, the length field is preceded alone, it is not part of the channel coding and a non-receipt of the subpacket with the length information results in the total loss of the dgramm.
  • a base station with a bidirectional data transmission to a node has means for receiving a data packet transmitted by the node at a node transmission frequency, the node transmission frequency being derived from a frequency generator of the node. Furthermore, the base station has a device for determining the node transmission frequency based on the received data packet and for determining a deviation of the frequency generator of the node based on a frequency deviation between the determined node transmission frequency and the node assigned nominal node transmission frequency. Furthermore, the base station comprises means for transmitting a data packet to the node with a base station transmission frequency, wherein the means for transmitting the data packet is adapted to set the base station transmission frequency based on the determined deviation of the frequency generator of the node.
  • WO 2015/128385 A1 describes a data transmission arrangement which has an energy harvesting element as the energy source.
  • the data transmission device is configured to transmit data using the Teiegram splitting method, whereby a sub-packet to be transmitted is either sent, buffered and later transmitted, or discarded, in response to an amount of electrical energy that can be provided by the power supply device.
  • the object of the present invention is therefore to increase transmission reliability in the transmission of data of variable length
  • Embodiments provide a data transmitter configured to encode and nested kernel data onto a plurality of core sub-data packets, the data transmitter configured to encode extension data and nested among a plurality of extension sub-data packets, wherein at least a portion of the data contained in the core sub-data packets Core data is required to receive the extension data or extension data packets.
  • core sub-data packets and sub-sub data packets are used for transmitting variable-length data, wherein coded core data of the variable-length data is interleaved among the core sub-data packets to increase the transmission security of the coded core data and coded extension data of the variable-length data Extension sub-data packets and, optionally, interleaved onto the core sub-data packets to enhance the transmission security of the encoded extension data, the encoded core data containing information about the encoded extension data or extension sub-data packets.
  • the method includes a step of encoding core data to obtain encoded core data. Further, the method includes a step of interleaving and dividing the coded core data into a plurality of core sub-data packets. Further, the method includes a step of encoding of enhancement data to obtain 'ungsrtz encoded extendibility. Further, the method includes a step of interleaving and dividing the encoded extension data into a plurality of extension data packets. Furthermore, the method comprises a step of sending the core sub-data packets and extension data packets.
  • Further embodiments provide a method for receiving core data and extension data.
  • the method comprises a step of receiving core sub-data packets and extension sub-data packets, the core sub-data packets containing core data interleaved over the core sub-data packets, and wherein the expansion sub-data packets include extension data interleaved over the extension sub-data packets.
  • the method includes a step of decoding at least part of the coded core data to obtain information regarding the enhancement data packets, wherein the enhancement data packets are received using the information.
  • the data comprises core data and extension data, the core data being encoded and interleaved among a plurality of core sub-data packets, the extension data being encoded and interleaved among a plurality of extension sub-data packets, at least a portion of which are incorporated in the Core data packages containing core data for a Empfa ' extension data or extension data packets is required.
  • the data transmitter is configured to not split coded core data onto the extension sub-data packets.
  • the extension sub-data packets do not contain encoded core data.
  • the data transmitter can be designed to divide the coded core data onto the core sub-data packets in such a way that even if one or more of the core sub-data packets are lost, a receiver-side decoding of the core data based on the other core sub-data packets is possible.
  • the coded core data may be successively divided among the core sub-data packets so that the loss of one of the core sub-data packets will not result in the total loss of the decoding capability.
  • immediately successive symbols of the core data can be divided into immediately successive core sub-data packets.
  • the 'data transmitter may be configured in such a way to divide the encoded core data to the Kernsub schemese that a time interval of the encoded Kem schemes with respect to a constraint length of the code used for coding the core information (channel codes) increases (or even maximized).
  • the data transmitter can be designed to divide symbols of the coded core data into the core sub-data packets such that a time interval of the symbols with respect to an influence length of a code used for coding the core data (Kana code) is increased (or even maximized).
  • the performance of the channel coding may depend on how many consecutive symbols are disturbed. Since a disturber frequently disturbs successive symbols, the symbols can be interleaved after the channel coding in such a way that they have the greatest possible distance from one another in the transmitted core sub-data packets.
  • the data transmitter may be configured to, if one of the core data is insufficient to fill the core sub-data packets, nested the extension data (or a portion of the extension data) to the core sub-data packets to populate the core sub-data packets.
  • the data transmitter may be configured to divide the extension data (or a portion of the extension data) into the core sub-data packets and extension sub-data packets such that a distance of the encoded extension data with respect to an influence length of a code used for coding the extension data when filling the core sub-data packets (Channel codes) is increased (or even maximized).
  • the data transmitter may be configured to divide symbols of the encoded extension data onto the core sub-data packets such that a time interval of the symbols relative to an influence length of a code (channel code) used for encoding the core data is increased (or even maximized).
  • a code channel code
  • the data transmitter may be configured to divide the extension data into the core sub-data packets and expansion sub-data packets such that the core sub-data packets and extension sub-data packets are equally filled when the core sub-data packets are filled.
  • the data transmitter may be configured to divide the extension data into the core sub-data packets and expansion sub-data packets such that the core sub-data packets and extension sub-data packets are unequally populated when filling the core sub-data packets.
  • the data transmitter may be configured to split the coded core data into a fixed or predetermined number of core sub-data packets.
  • the data transmitter may be configured to adjust a number of expansion sub-data packets depending on a length of the extension data.
  • the data transmitter may be configured to co-encode the core data and the extension data.
  • the core data and the extension data can be coded together in such a way that a decoding of the coded core data supplies at least part of the core data.
  • performance may be increased as the input length of the data increases, so the core data and extension data may be coded together.
  • the core data and the extension data are coded together so that e encoding of the core data or at least a portion of the core data is possible even without the extension data.
  • the data transmitter may be configured to independently code the core data and the extension data.
  • the data transmitter may be configured to fill the uncoded core data with enhancement data so that the enhancement data is timed ahead of the core data and security in decoding the core data is increased.
  • the data transmitter may be configured to provide at least a portion of the core sub-data packets with synchronization data.
  • the data transmitter can be designed to arrange the core data temporally adjacent to the synchronization data in the respective core sub-data packets.
  • the data transmitter can be designed to arrange the core data alternately before and after the synchronization data in temporally (immediately) successive core sub-data packets.
  • the data transmitter can be designed to arrange the synchronization data in the respective core sub-data packets in such a way that they are arranged immediately adjacent to the extension data and immediately adjacent to the core data.
  • the data transmitter may be configured to transmit pure synchronization sub-packets.
  • the data transmitter can be designed to transmit the core sub-data packets and the synchronization sub-data packets in such a way that the core sub-data packets and the synchronization sub-data packets are arranged adjacent to one another in terms of time.
  • the synchronization sub-packets may be sent out between the core sub-packets.
  • the data receiver may know the number of core sub-data packets.
  • the information regarding the extension data packets contained in the core sub-data packets may be a number of extension sub-data packets.
  • the coded core data may be distributed to the core sub-data packets such that even if one or more of the core sub-data packets are lost, receiver-side decoding of the core data based on the other core sub-data packets is possible.
  • the data receiver may be configured to receive and decode at least a portion of the core sub-data packets to obtain the core data.
  • the coded core data may be successively divided among the core sub-data packets so that the loss of one of the core sub-data packets will not result in the total loss of the decoding capability.
  • immediately successive symbols of the core data can be divided into immediately successive core sub-data packets.
  • At least a portion of the core sub-data packets may be provided with synchronization data, wherein the data receiver may be configured to detect the core sub-data packets based on at least a portion of the synchronization data in a receive data stream.
  • the data receiver may be configured to receive pure synchronization sub-packets and to detect the core sub-data packets based on at least a portion of the synchronization sub-packets in a receive data stream. In embodiments, the data receiver may be configured to recode at least a portion of the decoded core data. to obtain reencoded core data and to decode at least part of the encoded extension data using the core reencoded data.
  • the data receiver may be configured to decode and reencode a first portion of the encoded enhancement data to obtain a first portion of reencoded enhancement data and to decode a second portion of the coded enhancement data using the first portion of reencoded enhancement data.
  • FIG. 1 is a schematic block diagram of a system having a data transmitter and a data receiver, according to one embodiment of the present invention
  • Fig. 2 is a schematic view of a channel coding and symbol assignment of
  • Fig. 3 is a diagram showing a division of the core data and extension data in
  • Fig. 4 is a diagram of a division of the nuclear symbols
  • Fig. 5 is a diagram of a division of the nuclear symbols
  • Extension symbols in core sub-data packets and extension sub-data packets after a first padding intermediate result in a diagram, a division of the core symbols and extension symbols into core sub-data packets and extension sub-data packets after a second filling intermediate result; in a diagram e division of the core symbols
  • Fig. 8 is a diagram of a division of the nuclear symbols
  • FIG. 9 is a schematic view of a cyclic shift of the overall word after the channel coding, so that symbols of the extension word are arranged in front of the core word; in a diagram, a division of the core symbols and extension symbols into core sub-data packets and
  • Extension sub-data packets synchronization symbols being preceded in the sub-data packets by the respective core symbols or extension symbols; in a diagram, a division of the core symbols and extension symbols into core sub-data packets and
  • Extension sub-data packets wherein synchronization symbols are present in the middle of the respective sub-data packets between the respective core symbols or extension symbols; in a diagram a division of the core symbols and
  • Expansion sub-data packets wherein synchronization sub-packets with synchronization symbols are arranged between the core sub-data packets;
  • Fig. 13 is a diagram showing a division of the core symbols
  • Extension sub-data packets wherein two in the respective sub-data packets spaced apart (sub) synchronization symbol sequences are present; in a diagram a division of the core symbols and
  • Extension sub-data packets wherein in the respective sub-data packets there are two spaced differently long (partial) sync symbol sequences; in a diagram, a division of the core symbols and extension symbols into core sub-data packets and
  • Expansion sub-data packets with sub-synchronization (synchronization) sequences in the respective sub-data packets; in a diagram, a division of the core symbols and extension symbols into core sub-data packets and
  • Expansion sub-data packets with sub-synchronization (synchronization) sequences in the respective sub-data packets; in a diagram, a division of the core symbols and extension symbols into core sub-data packets and
  • Expansion sub-data packets with sub-synchronization (symbol) sequences arranged in the respective sub-data packets; 9 shows a diagram of a division of the core symbols into core sub-data packets, with (sub) synchronization symbol sequences arranged in the middle in the respective core sub-data packets: a diagram of a division of the core symbols into core sub-data packets, with sub-data packets arranged in the middle in the respective core sub-data packets.
  • Synchronisatlonssymbolsequenzen are present, wherein the core symbols are divided in successive Kernsubals packets alternately before and after the (partial) synchronization symbol sequences;
  • a flowchart of a method for transmitting core data and extension data 21 is a flowchart of a method for receiving core data and
  • Extension data according to an embodiment.
  • the data 120 may include core data and extension data.
  • the data transmitter 100 is configured to encode and interleave the core data to a plurality of core sub-packets 140_1 to 140_n, and to encode and interleave the extension data to a plurality of extension sub-packets 142_1 to 142_m, wherein at least a portion of the data in the sub-packet data 140_1 up to 140_n contained core data for receiving the expansion data packets is required.
  • the data receiver 110 is configured to receive the core sub-data packets 140_1 to 140_n and the extension sub-data packets 142_1 to 142_m, the core sub-data packets 140_1 to 140_n containing the core data interleaved over the core sub-data packets 140_1 to 140_n, and the extension sub-data packets 142_1 to 142_m include expansion data that is nested over the extension sub-packets 142_1 through 142_m.
  • the data receiver 110 is further configured to decode at least a portion of the coded core data to obtain information regarding the enhancement data packets 142_1 to 42__m, and wherein the data receiver 110 is adapted to use the enhancement data packets 142_1 to 142_m using the information receive.
  • the core data may be divided into n core sub-data packets 140_1 through 140_n, where n is a natural number greater than or equal to two. n> 2.
  • the extension data can be divided into sub-sub-packets 142_1 to 142_m.
  • the extension data may be nested between both the core sub-data packets 14Q_1 to 140_n and the extension sub-data packets 142_1 to 1 2_m.
  • the core sub-data packets 140_1 to 1: may thus contain both core data and a portion of the extension data.
  • the core data is not divided among the extension sub-data packets 142_1 through 142_m.
  • the extension sub-data packets 142_1 to 142_m thus contain no core data.
  • the sub-data packets may be transmitted at a time interval, so that transmission pauses exist between the sub-data packets.
  • the sub-data packets may be transmitted using a time-hopping pattern and / or frequency hopping pattern.
  • the frequency hopping pattern may indicate a sequence of transmission frequencies or transmission frequency jumps with which to transmit the sub-data packets. For example, a first sub-data packet having a first transmission frequency (or in a first frequency channel) and a second sub-data packet having a second transmission frequency (or in a second frequency channel) may be transmitted, wherein the first transmission frequency and the second transmission frequency are different.
  • the frequency hopping pattern can define (or specify, or specify) the first transmission frequency and the second transmission frequency.
  • the frequency hopping pattern may 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 may also indicate only the frequency separation (transmission frequency hopping) between the first transmission frequency and the second transmission frequency.
  • the time-hopping pattern may indicate a sequence of transmission times or transmission time intervals with which the sub-data packets are to be transmitted. 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), wherein the first transmission time and the second transmission time are different.
  • the time jump pattern can define (or specify, or specify) the first transmission time and the second transmission time.
  • the jump pattern may indicate the first transmission time and a time interval between the first transmission time and the second transmission time.
  • the time jump pattern may also indicate only the time interval between the first time and the second transmission time.
  • a time and frequency hopping pattern may be the combination of a frequency hopping pattern and a time hopping pattern, i. a sequence of transmission times or transmission time intervals with which the sub-data packets are transmitted, wherein the transmission times (or transmission time intervals) transmission frequencies (or transmission frequency jumps) are assigned.
  • the core sub-data packets 140_1 through 140_n and the extension sub-data packets 142_J through 142_m may be transmitted with separate time-hopping patterns and / or frequency-hopping patterns.
  • the data transmitter 100 may include a transmitter (transmitter) 102 configured to transmit the data 120.
  • the transmitting device 102 may be connected to an antenna 104 of the data transmitter 100.
  • the data transmitter 100 may further include a receiving device (receiver) 106 configured to receive data.
  • the receiving device may be connected to the antenna 104 or to another (separate) antenna of the data transmitter 100.
  • the data transmitter 100 may also include a combined transceiver.
  • the data receiver 110 may include a receiver 16 which is adapted to receive the data 120.
  • the receiving means may be connected to an antenna 14 of the data receiver. Furthermore, the
  • Data receiver 1 10 a transmitter (transmitter) 1 12, which is adapted to transmit data.
  • the transmitting device 1 12 may be connected to the antenna 1 14 or another (separate) antenna of the data receiver 1 10.
  • the data receiver may also have a combined transceiver.
  • the data transmitter 100 may be a sensor node, while the data receiver 110 may be a base station.
  • the data transmitter 100 is a base station while the data receiver 110 is a sensor node.
  • both the data transmitter 00 and the data receiver 1 are serial nodes.
  • both the data transmitter 100 and the data receiver 1 to be isisstations.
  • the data to be sent can be divided into two parts, the so-called core information, which can be processed even before receipt of the entire package and the extension information. If the information is channel coded and assigned (or mapped), they yield the core word, respectively the extension word, as shown in FIG. 2 shows a schematic view of channel coding and symbol assignment of data.
  • the data 120 may include core information (core data) 122 and extension information (extension data) 124.
  • the channel coding and symbol mapping of the core information 122 may yield a kernel 130 with the symbols k0 through kK (kernel symbols 136).
  • the kana coding and symbol mapping of extension information 124 may yield an extension word 132 with symbols eO to eE (extension symbols 138).
  • the core word 130 and the extension word 132 may form a total word 134. In other words, FIG. 2 shows the formation of the total word 134 from core information 122 and extension information 124.
  • the targeted nesting of the core words 130 as described herein is particularly important when disturbances occur in the channel.
  • the overall data packet to be transmitted is subdivided into smaller subpackets, so-called subpackets (see DE 10 201 1 082 098 B4). If the time interval between subpackets is long enough in comparison to the interferers occurring in the channel, then the probability is high that only a single subpacket will be disturbed. If the data is now properly nested, the loss of information in a subpacket does not result in the loss of information.
  • channel coding can be applied to the information before it is divided into subpackets. After the channel coding, the symbols can be switched to the broadcasting alphabet of the
  • the core word or extension word are referred to as the core word or extension word. These words then form a total word 134, which is then subdivided into sub-packages.
  • the core word can now be nested in the transmission word so that it can be evaluated as early as possible at the receiver, as shown in FIG. 3,
  • FIG. 3 shows in a diagram a division of the core data 122 and extension data 124 into core sub-data packets 140_1 to 140_4 and extension sub-data packets 142_1 to 142_5.
  • the abscissa describes a temporal arrangement of the sub-data packets (core sub-data packets 140_1 to 140_4 + extension sub-data packets 142_1 to 142_5)
  • the ordinate describes a temporal arrangement of the symbols (core symbols + extension symbols) in the respective sub-data packets.
  • the core word 130 may be divided into the core data packets 140_1 to 140_4, in detail the symbols 136 of the core word 130 may be nested among the core sub-data packets 140_1 to 140_4.
  • the extension word 132 may be divided into the extension sub-packets 142_1 to 142_5.
  • the symbols 138 of the extension word 132 may be interleaved among the extension sub-data packets 42_1 to 142_5.
  • extension word 132 (or extension symbols 138 in detail) may be distributed to both core data packets 140_1 to 140_4 and extension sub-data packets 142_1 to. This is especially possible if the Kernsub Schemepak 'ete140_1 to 140_4 by the core word 130 (or in detail the core symbols 136) are not completely filled. In this case, the extension word 132 may be divided into both the core data packets 140_1 to 140_4 and the extension sub-data packets 142_1 to 142_5.
  • FIG. 3 shows that core subpackets 140_1 to 140_4 contain kernel symbols 136, extension subpackets 142_1 to 142_5 do not contain kernel symbols 136.
  • the subpackets can therefore be divided into two different categories. First. Core subpackets 140_1 to 140_4. These are subpackets 140_1 to 140_4. contain ribole 138 of the core word 130. Second, expansion sub-packets 142_1 to 142_5. These are subpackets 142_1 to 142_5 that do not contain symbols of the core word 130. A Traditional transmission (ie without subpackets) can be achieved if the subpackets are transmitted without time delay.
  • the core word 132 which is e.g. can contain important side information for reception, can be completely nested here in the so-called Kernsub Schemep 140_1 to 140_n, which can be evaluated by the receiver 1 10 before the completed receipt of the extension sub-142_1 to 142_1 to 142_m.
  • Number n of the core sub-packets 140_1 to 40_n must be known to the receiver 110.
  • the symbols of the core data 122 may be evenly distributed across the kernel subpacket, as the loss of a larger contiguous block in the data for many channel coding techniques results in rapid failure.
  • the simplest procedure for this is to interleave the symbols one after the other into the subpackets of the core sequence (core sub-data packets 140_1 to 140_n). If the number n of the core sub-packets 140_1 to 10_n has been reached, the allocation starts again from the beginning.
  • the number of subpackets in the kernel sequence is identical and given for all variable length telegrams, i. fixed.
  • Fig. 4 is a diagram showing a division of the core symbols k0 to k15 and extension symbols e0 to e19 into core sub-data packets 140_1 to 140_4 and er submission data packets to 142_5.
  • the abscissa describes a temporal
  • the kernel symbols k0 to k5 can be split successively into the kernel data packets 140_1 to 140_4, while the extension symbols eO b,>, ⁇ mf, the extension sub-data packets 142_1 to 142_m are successively nested.
  • the extension symbols eO b,>, ⁇ mf, the extension sub-data packets 142_1 to 142_m are successively nested.
  • the first kernel sub-packet 140_1 may be the kernel symbols k0, k4, k8 and ki2, the second one.
  • the first kernel sub-packet 140_1 may be the kernel symbols k0, k4, k8 and ki2
  • Core sub-packet 140_2 the kernel symbols k1, k5, k9, k13
  • the third kernel sub-packet 140_3 the kernel symbols k2, k6, k10 and k14
  • the third kernel data packet 40_4 containing the kernel symbols k3, k7, k1 and k15
  • the information may be interleaved into subpackets so that the core word can be separated and received before the extension word.
  • the symbols within the kernel extension sub-packets may be interleaved such that the loss of one or more core sequence sub-packets does not result in the total loss of the decode capability.
  • the number of symbols that can be sent out in the core sub-packages 140_1 to 140_n is greater than the number of symbols in the core word 130, so that the core sub-packages 140_1 to 140_n can be populated with symbols from the extension word 132.
  • the core word 130 and the extension word 132 are now divided into the telegram, Thus, the core word is divided into the first free data symbols of Kernsubwovene.
  • the first symbols of the extension word 132 are then written to the kernel subpackets
  • 140_1 to 140_n distributed. This mapping can happen evenly so that two of these symbols are not placed in the same subpacket.
  • the symbols can be placed at a distance V in the kernel subpackets. On the first pass, this process starts at subpacket 0 and advances in V steps. Thus, the second symbol can be placed in subpacket V, etc. Second, the symbols can be placed in V blocks in the core subpackets. The ⁇ ⁇ symbols occupy ⁇ - successive core subpackets, if the kernel subpack index S min exceeds, then kernsubvert 0 is started again.
  • next S - S min extension symbols can then be distributed to the subpackets of the extension sequence, without additional spacing. Start with Subpackage S min and end with Subpackage S.
  • FIG. 5 shows a diagram of a division of the core symbols k0 to k15 and extension symbols e0 to e39 into core sub-data packets 140_1 to 140_4 and extension sub-data packets 142_1 to 142_3 after a first one
  • the abscissa describes a temporal arrangement of the sub-data packets (core sub-packets 140_1 to 140_4 + extension sub-data packets 142_1 to 142_3), while the ordinate describes a temporal arrangement of the symbols (core symbols + extension symbols) in the respective sub-data packets.
  • the kernel symbols k0 to kl5 can be nested to the kernel subpackets 140_1 to 140_4, so that the loss of one or more of the kernel subpackets 140_1 to 140_3 does not lead to the total loss of the decoding capability, in detail, '
  • the first core sub-packet 140_1 may include the core symbols k0, k4, k8 and kl2, the second core sub-packet 140_2, the kernel symbols k1, k5, k9, k13, the third kernel sub-packet 140_3, the kernel symbols k2, k6, ki0 and k14, and the third core data packet 140_4 the core symbols k3, k7.
  • k1 contains 1 and k15.
  • the extension symbols e0 to e39 can be distributed to both the core sub-data packets 140_1 to 140_4 and the extension sub-data packets, so that the core sub-data packets 140_1 to 140_4 and the extension sub-packets 142_1 to 142_3 are filled up evenly, and so that the loss of one of the sub-data packets does not Total loss of the decoding possibility leads.
  • the goal is that the first kernel data packet 140_1 the extension symbols
  • the second core sub-packet 140_2 the extension symbols e5, e15. e25 and e35, the third core sub-packet 140_3 the extension symbols H,; I! e21 and e31, the fourth core sub-packet 140_4 the extension symbols e6, e16. e26 and e36, the first extension sub-packet 142_1 the extension icons e2, 22, e27. e32, and e37, the second extension sub-packet includes extension symbols e3, e23, e28, e33 and e38, and the third extension sub-packet 142_3 the extension symbols e4. e9, e14, e19, e24, e29.
  • the extension symbol eO can be applied to the first core sub-packet 140_1, the extension symbol e1 to the third core sub-packet 140_3, the extension symbol e2 to the first extension sub-packet 142_1, the extension symbol e3 to the second extension sub-packet, and the
  • FIG. 5 shows placing the expansion symbols e0 and ei with
  • Fig. 6 is a diagram showing a division of the core symbols k0 to k15 and extension symbols e0 to e39 into core sub-data packets 140_1 to 140_4 and extension sub-data packets 142_1 to 142_3 after a second intermediate threading result.
  • the abscissa describes a temporal arrangement of the sub-data packets (core sub-packets 140_1 to 140_4 + extension sub-data packets 142_1 to 142_3), while the ordinate describes a temporal arrangement of the symbols (core symbols + extension symbols) in the respective sub-data packets.
  • FIG. 6 is a diagram showing a division of the core symbols k0 to k15 and extension symbols e0 to e39 into core sub-data packets 140_1 to 140_4 and extension sub-data packets 142_1 to 142_3 after a second intermediate threading result.
  • the abscissa describes a temporal arrangement of the sub-data packets (core sub-
  • the extension symbol e5 can now be applied to the second core sub-packet 140_2, the extension symbol e6 to the fourth core sub-packet 140_4, the extension symbol e7 to the first extension sub-packet 142_1, the extension symbol e8 to the second extension sub-packet 142_2, and the Extension symbol e9 to the third extension sub-packet 142_3.
  • Fig. 7 is a diagram showing a division of the core symbols k0 to k15 and extension symbols e0 to e39 into core sub-data packets 140_1 to 140_4 and expansion sub-data packets 142_1 to 1 to a third one
  • the abscissa describes a temporal arrangement of the sub-data packets (core sub-packets 140_1 to 140_4 + extension sub-data packets 142_1 to 142_3), while the ordinate describes a temporal arrangement of the symbols (core symbols + extension symbols) in the respective sub-data packets.
  • Fig. 7 Now the Erweitungssymboi mf the first Kernsubdata package 140_1, the extension symbol e1 1 on the third Kernsub jewever as extension symbol ⁇ s .J the first extension sub-packet 142_1. the extension symbol is split to the second extension sub-packet 142_2, and the extension symbol e14 is divided to the third extension sub-data packet.
  • FIG. 8 is a diagram showing a division of the core symbols k0 to k15 and extension symbols e0 to e39 into core sub-data packets 140_1 to 140_4 and extension sub-data packets 142_1 to 142_3, after a fourth interleaf result.
  • the abscissa describes a temporal arrangement of the sub-data packets (core sub-packets 140_1 to 140_4 + extension sub-data packets 142_1 to 142_3), while the ordinate describes a temporal arrangement of the symbols (core symbols + extension symbols) in the respective sub-data packets.
  • FIG. 8 shows a placing of the expansion symbols ei 5 and e16 with
  • extension symbols may be interleaved into core subpackets so that the total number of subpackets is evenly padded.
  • Embodiments enable or support a variable number of subpackets.
  • channel code can be calculated over the complete information, ie core information and extension information.
  • transmission security of short core or extension information may be increased by common channel coding.
  • FIG. 9 shows a schematic view of a cyclic shift of the overall word after the channel coding, so that mboles of the extension word 132 are arranged in front of the core word 130.
  • the core word 30 comprises symbols eO to eK, wherein the extension word 132 comprises E + 1 symbols eO to eE after the channel coding E + 1.
  • the extension word 132 comprises E + 1 symbols eO to eE after the channel coding E + 1.
  • Z symbols can be extracted and preceded by the K + 1 symbols eO to eK of the core word 130.
  • the last Z symbols e-Z to eE of the extension word 132 may be extracted and preceded by the K + 1 symbols eO to eK of the core word 130.
  • Fig. 9 shows an example of inserting Z extension symbols (light blue) into the region of the core symbol by cyclically shifting after the channel encoding.
  • extension symbols may be used to tune the core symbol decoder to increase the decodability of the core word.
  • a transmission packet are usually known symbols which are used by the receiver to synchronization, so-called.
  • Preamble symbols or a synchronization sequence Symbols that are transmitted directly before or after the synchronization symbols can be decoded by the decoder with the highest reliability, d or frequency offsets between transmitter and receiver have a greater influence, the greater the time interval between a symbol to be decoded and the known symbols.
  • the abscissa describes a temporal arrangement of the sub-data packets (core sub-packets 0_1 to 140_4 + extension sub-data packets 142_1 to 142_3), while the ordinate describes a temporal arrangement of the symbols (core symbols + extension symbols) in the respective sub-data packets.
  • the division of the kernel symbols k0 to k15 and extension symbols e0 to e39 into core sub-data packets 140_1 to 140_4 and extension sub-data packets 142_1 to 142_3 shown in FIG. 10 substantially corresponds to the division explained in FIGS. 5 to 8, wherein in the respective sub-data packets (core sub-data packets 140_1 to 140_4 and extension data packets 142_1 to 142_3) are preceded by the respective core symbols k0 to k15 and extension symbols e0 to e39, respectively, by synchronization symbols 150.
  • FIG. 10 shows kernel symbols k0 to k15 in the kernel subpackets 140_1 to 140_3 at the beginning of the subpackets, since the proximity to synchronization symbols 150 increases the estimation accuracy for the kernel symbols k0 to k15.
  • a synchronization sequence in each subpackage is advantageous.
  • the core symbols in the core sub-packets will then be respectively close to the pre-, fvlid-, or postamble pushed.
  • the arrangement of the core symbols with one another can take place arbitrarily within the sub-data packet.
  • the core symbols should again be arranged so that the distance is maximized.
  • the division into symbols of the core sub-packets or extension sub-packets can then be carried out analogously to the procedure described in exemplary embodiment two.
  • FIG. 11 shows a diagram of a division of the core symbols k0 to k15 and extension symbols e0 to e39 into core sub-data packets 140_1 to 140_4 and extension sub-data packets 142_1 to 42_3, wherein in the middle of the respective sub-data packets between the respective core symbols k0 to kl5 and extension symbols e0 until e39 synchronization symbols 150 are present.
  • the abscissa describes a temporal arrangement of the sub-data packets (core sub-packets 140_1 to 140_4 + extension sub-data packets 142_1 to 142_3), while the ordinate describes a temporal arrangement of the symbols (core symbols + extension symbols) in the respective sub-data packets.
  • the distribution of the kernel symbols k0 to k15 and extension symbols e0 to e39 into core sub-data packets 140_1 to 140_4 and extension sub-data packets 142_1 to 142_3 shown in FIG. 1 essentially corresponds to the division explained in FIGS. 5 to 8, wherein in the respective sub-data packets (core sub-data packets 140_1 to 140_4 and
  • Extension data packets 142_1 to 142_3) in the middle of the respective sub-data packets synchronization symbols 150 are present between the respective core symbols k0 to k15 and extension symbols e0 to e39, respectively.
  • FIG. 11 shows kernel symbols k0 to the core subpackets 140_1 to
  • Core symbols kO increased to k15. If a telegram or a subpacket contains several separate synchronization sequences, then the core symbols should be arranged around them again.
  • FIG. 12 is a diagram showing a division of the core symbols k0 to k15 and extension symbols e0 to e19 into core sub-data packets 140_1 to 140 . 4 and expansion sub-packets 142_1 to 142_5, wherein synchronization sub-packets 152_1 and 152_2 with synchronization symbols 150 are arranged between the core sub-data packets.
  • the absc issa e time arrangement of the respective Subordinate data packets, while the ordinate describes a temporal arrangement of Symboie in the respective sub-data packets.
  • a first synchronization sub-packet 152_1 may be disposed between the first and second core sub-packets 140_1 and 0_2, while a second synchronization sub-packet 152_2 may be located between the third and fourth core sub-packets 140_3 and 140_4.
  • Fig. 12 shows kernel symbols k0 to k15 in core sub-packets 140_1 to 40_4 arranged around two synchronization sub-packets 152_1 and 152_2, followed by extension sub-packets 142_1 to 142_5.
  • FIG. 13 shows a diagram of a division of the core symbols 138 and extension symbols 138 into core sub-data packets 140_1 to 10_4 and extension sub-data packets 142_1 to ' 142_3, wherein two spaced-apart (sub) synchronization symbol sequences are present in the respective sub-data packets.
  • the abscissa here describes a temporal arrangement of the sub-data packets (core sub-packets 140_1 to 140_4 + extension sub-data packets 142_1 to 142_3), while the ordinate describes a chronological arrangement of the symbols ⁇ core symbols + extension symbols + synchronization symbols 150) in the respective sub-data packets.
  • the kernel icons 136 may be located immediately adjacent to the synchronization icons 150, while the extension icons 138 may be located adjacent to the kernel icons 136.
  • FIG. 13 shows kernel symbols 136 evenly spaced around two synchronization sequences 150.
  • symbols 136 of the core words 130 may be set as close as possible to synchronization symbols 150.
  • the reliability of the symbols is different, depending on the quality of the synchronization sequence. This allows more kernel symbols to be placed around the synchronization sequence located at a higher quality than the lower-order sequence to obtain the same error probability.
  • the abscissa describes a temporal arrangement of the sub-data packets (core sub-packets 140_1 to 140_5 + extension sub-packets 142_1 to 142_3), while the ordinate describes a temporal arrangement of the symbols (core symbols + extension symbols + synchronization symbols 150) in the respective sub-data packets.
  • the kernel icons 136 may be located immediately adjacent to the synchronization icons 150, while the extension icons 138 may be located adjacent the kernel icons 136. Further, in kernel sub-packets 1 0_1 to 140_5, more kernel symbols 136 may be located immediately adjacent to the longer (partial) synchronization symbol sequence than to the shorter sub-sync symbol sequence.
  • FIG. 14 shows kernel symbols 136 arranged around two synchronization sequences 150, the number of kernel symbols 136 which may enclose a synchronization sequence 150 based on the quality of the synchronization sequence 150 (here exemplified by the length).
  • symbols 136 of the core words 130 may be set as close as possible to synchronization symbols 150 (see the fifth detailed embodiment).
  • symbols 138 of core sequence 130 may not be evenly distributed around all synchronization symbol blocks 150, but according to the expected security in the subpacket.
  • extension icons 138 for settling the decoder may become the most reliable
  • the information can again be channel coded and mapped at the receiver. By doing so, it is then possible to view the core symbols as sync symbols as well, since their values are now known. With this knowledge, the estimability and decodability of the extension symbols in the core subpackets can be further improved.
  • FIG. 15 shows in a diagram a division of the core symbols 136 and extension symbols 138 into core sub-data packets 140_1 to 140_4 and Extension sub-packets 142_1 to 142_3, with sub-sync symbol sequences 150 arranged in the middle of the respective sub-data packets.
  • the abscissa describes a temporal arrangement of the sub-data packets (core sub-packets 140_1 to i ⁇ '! -Subsequent sub-data packets to 142_3), while the ordinate describes a temporal arrangement of the symbols (core symbols + extension symbols) in the respective sub-data packets.
  • FIG. 15 shows kernel symbol 136 in sub-packet 0 to 3 (140_1 to 140_3), and extension symbols 138 * in sub-packet 4 to 8 (142_1 to 42_3) are well-decoded due to the proximity to the synchronization symbols 150.
  • 16 is a diagram showing a division of the core symbols 138 and extension symbols 138 into core sub-data packets 140_1 to 10_4 and extension sub-data packets 142_1 to 142_3, with sub-synchronization (symbol) sequences 150 arranged in the respective sub-data packets.
  • the abscissa describes a temporal arrangement of the sub-data packets (core sub-data packets 140_1 to 140_4 + extension sub-data packets 142_1 to 42_3).
  • the ordinate describes a temporal arrangement of the symbols (core symbols + extension symbols) in the respective sub-data packets.
  • the kernel symbols 136 may be re-encoded after decoding to obtain reencoded kernel symbols 136 ', which together with the synchronization symbols 150 may be considered as known symbols for decoding the extension symbols 138 can be used, so that now also the extension symbols are to be decoded well because of the proximity to the known symbols (synchronization symbols 150 + reencoded core symbols 138 ').
  • FIG. 15 shows that after reencoding of the kernel symbols 136 ', these can be assumed to be known and the decodability of the neighboring ones
  • Extension symbols 138 in subpackages 0 to; h, s'. increase. 17 is a diagram showing a division of the core symbols 138 and extension symbols 138 into core sub-data packets 140_1 to 140_4 and extension sub-data packets' * ⁇ _ to 142_3, with sub-synchronization sync sequences 150 arranged in the respective sub-data packets.
  • the abscissa describes a temporal arrangement of the sub-data packets (core sub-packets 140_1 to 140_4 + extension sub-data packets 142_1 to 142_3), while the ordinate describes a temporal arrangement of the symbols (core symbols + extension symbols) in the respective sub-data packets.
  • the portion 138 * of the extension symbols 138 may be reencoded after decoding to obtain reencoded portion 138 'of the extension symbols to be used together with the
  • Synchronization symbols 150 can be considered as known symbols that can be used to decode the remaining extension symbols 138 so that now the remaining extension symbols are well decoded due to the proximity to the known symbols (synchronization symbols 150 + reencoded portion 138 'of the extension symbols) ,
  • Figure 17 shows that the reliable extension symbols 138 * are also reencable after the first iterative decoding step and can be assumed to be known 138 'and now extend the reliable range in the subpackets 4 to 6 (142_1 to 142_3).
  • symbols of the extension word may be closer to
  • Kernel symbols or synchronization symbols the earlier they are needed in the iterative decoding.
  • the symbols are arranged in the opposite direction in every second subpacket.
  • subpacket 0 140_1
  • the kernel symbol 0 kO
  • the Kemsymbol 1 k1 in Subb 1 (140_2) under the synchronization sequence (150) to be arranged.
  • FIG. 18 shows a diagram of a division of the core symbols k0 to k15 into core sub-data packets 140_1 to 140_4. wherein central (sub) synchronization symbol sequences 150 are provided in the respective core sub-data packets 140_1 to 140_2 in the middle.
  • the abscissa describes a temporal arrangement of the sub-data packets (core sub-packets 140_1 to 140_4 + extension sub-data packets 142_1 to 142_3), while the ordinate describes a temporal arrangement of the symbols (core symbols + extension symbols) in the respective sub-data packets.
  • the kernel symbols k0 to k15 may be evenly interleaved among the kernel subpackets 140_1 to 140_4, so that the loss of one of the kernel subpackets 140_1 to 140_3 does not result in the total cost of decoding capability.
  • the first kernel sub-packet 140_1 may include the kernel symbols k0, k4, k8 and kl2, the second kernel data packet 140_2, the kernel symbols k1, k5, k9, k13, the third kernel sub-packet 140_3, the kernel symbols k2, k8, k10 and k14, and the third kernel data packet 140_4 the kernel symbols k3, k7, k1 and k15 are included, with the kernel symbols k0 to k3 located in the respective kernel subpackets 140_1 to 140_4 immediately before the sync symbols 150, and the kernel symbols k4 to k7 in the respective kernel subpackets 140_1 to 140_4 immediately after the sync symbols 150 are arranged.
  • Fig. 18 shows a division of the kernel symbols k0 to k15 into core sub-data packets 140_1 to 140_4 without bias avoidance. Successive symbols are on the same page (the synchronization symbols 150).
  • Fig. 19 is a diagram showing a division of the core symbols k0 to k15 into core sub-data packets 140_1 to 140_4, with central (sub) synchronization symbol sequences 150 arranged in the respective core sub-data packets 140_1 to 140_2, the core symbols k0 to k15 being successive Core sub-data packets 140_1 to 140_4 are alternately divided before and after the (sub-) synchronization symbol sequences 150.
  • the abscissa describes a temporal arrangement of the sub-data packets (core sub-packets 140_1 to 140_4 + extension sub-data packets 142_1 to 142_3), while the ordinate describes a temporal arrangement of the symbols (core symbols + extension symbols) in the respective sub-data packets.
  • the kernel symbols k0 to kl 5 can be nested on the
  • Core sub-data packets 140_1 to 140_4 are divided such that the core symbols k0 to k15 are arranged in successive core sub-data packets 140_1 to 140_4 alternately before and after the (sub-) synchronization symbol sequences 150.
  • the first core sub-packet 1 0_1 may contain the core symbols k0, k4. k8 and k12, the second kernel data packet 140_2 the kernel symbols kl, k5, k9. kl 3, the third
  • FIG. 19 shows a division of the kernel symbols k0 to k15 into kernel sub-packets 140_1 to 140_4 with bias avoidance. Successive symbols are alternately placed around the center (the synchronization symbols 150).
  • FIG. 20 shows a flowchart of a method 200 for transmitting core data
  • the method 200 comprises a step 202 of encoding key data, to obtain coded data to core '. Further, the method 200 includes a step 204 of interleaving and partitioning the coded core data onto a plurality of core sub-data packets. Further, the method 200 includes a step 208 of encoding extension data to obtain encoded extension data. Further, the method 200 includes a step 208 of interleaving and splitting the encoded extension data into a plurality of extension data packets. Furthermore, the method 200 includes a step 210 of sending the core sub-data packets and extension data packets.
  • Fig. 21 shows a flowchart of a method 220 for receiving core data and extension data.
  • the method 220 includes a step 222 of receiving core sub-data packets and extension sub-data packets. wherein the core sub-data packets include core data that is nested distributed over the core sub-data packets, and wherein the extension-side packet contains extension data that is nested over the extension-side packet. Furthermore, the method 220 includes a step 224 c Erens at least one 's of the encoded core data to a
  • extension sub-packets are arranged after the core sub-packets, it should be understood that the present invention is not limited to such embodiments. Rather, the extension sub-packets may also be arranged prior to or simultaneously with the core sub-packets, e.g. when a receive buffer is used.
  • Embodiments shuffles the data into subpacket blocks.
  • Embodiments are concerned with a method of distributing information over subpackets such that the loss of one or more subpackets impairs the decodability of the overall packet as little as possible.
  • Embodiments use a core information with length specification.
  • part of the information can be decoded and processed even before receiving the entire packet (core sub-data packets + extension sub-data packets) by the skillful distribution.
  • This also allows, e.g. Send a variable number of sub-packages, if the receiver is informed about this information, the number of sub-packets or the length of the packet to be received.
  • the core / or extension information is well protected even with a short length.
  • Previous systems that have a gore block and an optional extension sequence have problems protecting the extension sequence or core sequence with good error protection, if only very short. It is known [p. Doiinar, D. Divsalar, and F. Pollara, "Code performance as a function of block size. " TMO progress report, vol. 42, p.133, 1998.] that small amounts of data are hard to protect Both parts increase the total length of the data and thus the error protection.
  • Embodiments increase decision reliability of the core information symbols. Previous systems do not make use of the fact that the decision reliability of the symbols in the vicinity of known symbols is improved.
  • This invention disclosure describes a method of interleaving the symbols in such a way that the core symbols receive a higher decision reliability in the reception of their Position within the sub-packages is chosen so that they can be decoded more reliable.
  • Embodiments relate to a method for intelligent interleaving in the symbols in a transmission.
  • the interleaving is based on subpackets via which the symbols are distributed, which allows the loss of individual subpackets in the transmission.
  • the symbols can be arranged such that Embodiments further describe how the arrangement of the symbols can increase the reliability of the transmission of the core information.
  • Embodiments provide a system for transmitting data between different subscribers of a radio network in which the data to be transmitted is divided into core information and extension information.
  • Exemplary embodiments can be applied to traditional transmission methods and to telegram-splitting-based transmission methods, that is to say the division of the transmission into a plurality of sub-data packets transmitted at a later time.
  • Embodiments allow decoding (e.g., by a receiver) of a portion of the information to be transmitted (e.g., the core information) prior to receiving the aggregate data packet (that is, extension information).
  • Embodiments allow for improved (or even optimal) interleaving in the data.
  • the core information is available prior to completed reception. In embodiments, the core information can be well protected even with a short length.
  • Exemplary embodiments make it possible to increase the decision reliability of the core information symbols.
  • aspects have been described in the context of a device, it will be understood that these aspects also constitute a description of the corresponding method, such that a block or component of a device may also be referred to as a corresponding method step or feature of a method step understand is. Similarly, aspects described in connection with or as a method step also represent a description of a corresponding block or feature or feature of a corresponding device.
  • Some or all of the method steps may be performed by a hardware device (or using a hardware device). Apparatus, such as a microprocessor, a programmable computer or an electronic circuit. In some embodiments, some or more of the most important method steps may be performed by such an apparatus. Depending on particular implementation requirements, embodiments of the invention may be implemented in hardware or in software.
  • the implementation may be performed using a digital storage medium, such as a floppy disk, a DVD, a Blu-ray Disc, a CD, a ROM, a PROM, an EPROM, an EEPROM or FLASH memory, a hard disk, or other magnetic disk or optical memory are stored on the electronically readable control signals that can cooperate with a programmable computer system or cooperate such that the respective method is performed. Therefore, the digital storage medium can be computer readable.
  • some embodiments according to the invention include a data carrier having electronically readable control signals capable of interacting with a programmable computer system such that one of the methods described herein is performed.
  • embodiments of the present invention as
  • Program is effective to perform any of the procedures when the computer program product runs on a computer.
  • the program code can also be stored, for example, on a machine-readable carrier.
  • an 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 embodiment of the inventive method 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 representational and / or non-transitory.
  • a further embodiment of the method according to the invention is thus a data stream or a sequence of signals, which represent the computer program for performing one of the methods described herein.
  • the data stream or the sequence of signals may be configured, for example, to be transferred via a data communication connection, for example via the Internet.
  • Another embodiment includes a processing device, such as a computer or programmable logic device, that is configured or adapted to perform one of the methods described herein.
  • Another embodiment includes a computer on which the computer program is installed to perform one of the methods described herein.
  • Another embodiment according to the invention comprises a device or system adapted to transmit a computer program for performing at least one of the methods described herein to a receiver.
  • the transmission can be done for example electronically or optically.
  • the receiver may be, for example, a computer, a mobile device, a storage device or a similar device.
  • the device or system may include a file server for transmitting the computer program to the recipient.
  • a programmable logic device eg, a programmable gate array, an FPGA
  • a field programmable gate array may cooperate with a microprocessor to perform any of the methods described herein.
  • the methods are performed by any hardware device. This may be a universally applicable hardware such as a computer processor (CPU) or a Lukai 'U) or hardware specific to the process, such as an ASIC.
  • the devices described herein may be implemented, for example, using a hardware device, or using a computer, or using a combination of a hardware device and a computer.
  • the devices described herein, or any components of the devices described herein, may be implemented at least in part in hardware and / or software (computer program).
  • 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.
  • the methods described herein, or any components of the methods described herein, may be performed at least in part by hardware and / or by software.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Physics & Mathematics (AREA)
  • Probability & Statistics with Applications (AREA)
  • Theoretical Computer Science (AREA)
  • Detection And Prevention Of Errors In Transmission (AREA)
  • Error Detection And Correction (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

Certains modes de réalisation donnés à titre d'exemple concernent un procédé de transmission de données sans fil dans un système de communication (par ex. un réseau de capteurs ou un système de télémétrie). Les données comprennent des données de base et des données d'extension, les données de base étant réparties sous forme codée et entrelacée entre plusieurs sous-paquets de données de base, les données d'extension étant réparties sous forme codée et entrelacée entre plusieurs sous-paquets de données d'extension, au moins une partie des données de base contenues dans les sous-paquets de données de base étant nécessaire pour la réception des données d'extension ou des paquets de données d'extension.
EP17791038.7A 2016-10-24 2017-10-23 Entrelacement pour la transmission de télégrammes à nombre variable de sous-paquets et décodage successif Pending EP3529928A2 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
DE102016220886.1A DE102016220886B3 (de) 2016-10-24 2016-10-24 Interleaving für die Übertragung von Telegrammen mit variabler Subpaketanzahl und sukzessiver Decodierung
PCT/EP2017/076939 WO2018077771A2 (fr) 2016-10-24 2017-10-23 Entrelacement pour la transmission de télégrammes à nombre variable de sous-paquets et décodage successif

Publications (1)

Publication Number Publication Date
EP3529928A2 true EP3529928A2 (fr) 2019-08-28

Family

ID=60186269

Family Applications (1)

Application Number Title Priority Date Filing Date
EP17791038.7A Pending EP3529928A2 (fr) 2016-10-24 2017-10-23 Entrelacement pour la transmission de télégrammes à nombre variable de sous-paquets et décodage successif

Country Status (11)

Country Link
US (1) US11483028B2 (fr)
EP (1) EP3529928A2 (fr)
JP (1) JP6938631B2 (fr)
KR (1) KR102246080B1 (fr)
CN (1) CN110114993B (fr)
CA (1) CA3041384C (fr)
DE (1) DE102016220886B3 (fr)
MX (1) MX2019004634A (fr)
MY (1) MY202703A (fr)
RU (1) RU2748466C2 (fr)
WO (1) WO2018077771A2 (fr)

Families Citing this family (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
DE102016220884A1 (de) 2016-10-24 2018-04-26 Fraunhofer-Gesellschaft zur Förderung der angewandten Forschung e.V. Variable Teilpaketlängen für Telegram Splitting in Netzwerken mit geringem Stromverbrauch
DE102017206236A1 (de) * 2017-04-11 2018-10-11 Fraunhofer-Gesellschaft zur Förderung der angewandten Forschung e.V. Spezifische hoppingmuster für telegram-splitting
DE102018206132B4 (de) 2018-04-20 2019-11-21 Fraunhofer-Gesellschaft zur Förderung der angewandten Forschung e.V. Decodergestützte iterative Kanalschätzung
DE102018206137A1 (de) 2018-04-20 2019-10-24 Fraunhofer-Gesellschaft zur Förderung der angewandten Forschung e.V. Paket-Korrelator für ein Funkübertragungssystem
DE102018010283B3 (de) 2018-04-20 2019-09-19 Fraunhofer-Gesellschaft zur Förderung der angewandten Forschung e.V. Interferenzdetektion und Unterdrückung in nichtkoordinierten Systemen
DE102018010284B3 (de) 2018-04-20 2019-09-19 Fraunhofer-Gesellschaft zur Förderung der angewandten Forschung e.V. Interferenzdetektion und Unterdrückung in nichtkoordinierten Systemen
DE102018206162B3 (de) 2018-04-20 2019-09-19 Fraunhofer-Gesellschaft zur Förderung der angewandten Forschung e.V. Interferenzdetektion und Unterdrückung in nichtkoordinierten Systemen
DE102019216557A1 (de) * 2019-10-28 2021-04-29 Fraunhofer-Gesellschaft zur Förderung der angewandten Forschung e.V. MAßNAHMEN ZUR ERMÖGLICHUNG EINER KANALNACHFÜHRUNG BEI DIGITALER ÜBERTRAGUNG
CN113314187B (zh) * 2021-05-27 2022-05-10 广州大学 一种数据存储方法、解码方法、系统、装置及存储介质
CN120881116B (zh) * 2025-09-28 2026-01-23 国网浙江省电力有限公司余姚市供电公司 基于输电线缆轴心传感器的压力监测方法及系统

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20060171283A1 (en) * 2005-01-11 2006-08-03 Rajiv Vijayan Method and apparatus for decoding data in a layered modulation system
US20160294598A1 (en) * 2015-04-06 2016-10-06 Lg Electronics Inc. Apparatus and method for sending and receiving broadcast signals

Family Cites Families (36)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5305352A (en) * 1991-10-31 1994-04-19 At&T Bell Laboratories Coded modulation with unequal error protection
JPH098703A (ja) * 1995-06-23 1997-01-10 Japan Radio Co Ltd 周波数ホッピング通信における送信装置及び受信装置並びに周波数ホッピング通信における誤り訂正方法
DE19700303B4 (de) * 1997-01-08 2005-11-03 Deutsches Zentrum für Luft- und Raumfahrt e.V. Funkübertragungsverfahren für digitale Multimediatensignale zwischen Teilnehmerstationen in einem lokalen Netz
US6259744B1 (en) * 1999-06-01 2001-07-10 Motorola, Inc. Method and apparatus for mapping bits to an information burst
US6226616B1 (en) * 1999-06-21 2001-05-01 Digital Theater Systems, Inc. Sound quality of established low bit-rate audio coding systems without loss of decoder compatibility
JP2001101806A (ja) * 1999-09-27 2001-04-13 Hitachi Ltd ディジタル信号記録方法、及びその装置、記録媒体
CN1152511C (zh) * 2001-05-10 2004-06-02 华为技术有限公司 通过合并数据包改变交织长度的信息重传方法
US7158539B2 (en) * 2002-04-16 2007-01-02 Microsoft Corporation Error resilient windows media audio coding
FR2845227B1 (fr) * 2002-10-01 2005-01-14 Telediffusion De France Tdf Procede de reception d'un signal module selon une technique de codage multi-niveaux, procede de decodage, dispositif de reception, systeme de codage-decodage et applications correspondant
EP1595311B1 (fr) 2003-02-21 2006-05-03 Conti Temic microelectronic GmbH Raccordement a fiches
US8526412B2 (en) * 2003-10-24 2013-09-03 Qualcomm Incorporated Frequency division multiplexing of multiple data streams in a wireless multi-carrier communication system
US20050249266A1 (en) * 2004-05-04 2005-11-10 Colin Brown Multi-subband frequency hopping communication system and method
EP1798998B1 (fr) * 2005-12-14 2011-06-15 Research In Motion Limited Procédé et appareil pour la gestion des ressources radio à partir d'un équipement d'abonné dans un réseau UMTS
US8457219B2 (en) * 2005-12-30 2013-06-04 Ikanos Communications, Inc. Self-protection against non-stationary disturbances
US8295250B2 (en) 2006-07-24 2012-10-23 Qualcomm Incorporated Code interleaving for a structured code
KR100987269B1 (ko) * 2006-08-22 2010-10-12 삼성전자주식회사 이동통신 시스템에서 고차 변조 기반의 버스트 매핑 방법및 장치
CN101166273A (zh) * 2006-10-16 2008-04-23 华为技术有限公司 实现视频数据传送的方法、装置及系统
KR100921465B1 (ko) 2007-04-19 2009-10-13 엘지전자 주식회사 디지털 방송 신호 송수신기 및 그 제어 방법
US8121097B2 (en) 2008-11-04 2012-02-21 Qualcomm Incorporated Transmission with hopping for peer-peer communication
WO2010095780A1 (fr) * 2009-02-18 2010-08-26 Lg Electronics Inc. Appareil d'émission et de réception d'un signal et procédé d'émission et de réception d'un signal
US20100260109A1 (en) 2009-04-10 2010-10-14 Qualcomm Incorporated Optimized inter-access point packet routing for ip relay nodes
WO2011041623A1 (fr) * 2009-10-01 2011-04-07 Interdigital Patent Holdings, Inc. Transmission de données de commande en liaison montante
DE102010031411B4 (de) * 2010-07-15 2012-04-26 Fraunhofer-Gesellschaft zur Förderung der angewandten Forschung e.V. Konzept zur Kombination codierter Datenpakete
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
DE102011082100A1 (de) 2011-09-02 2013-03-07 Fraunhofer-Gesellschaft zur Förderung der angewandten Forschung e.V. Konzept zur bidirektionalen datenübertragung zwischen einer basisstation und einem knoten
EP2629444B1 (fr) * 2012-02-20 2014-11-05 LG Electronics, Inc. Procédé et appareil d'émission-réception de signaux de diffusion
US9872052B2 (en) 2013-08-01 2018-01-16 Lg Electronics Inc. Apparatus for transmitting broadcast signals, apparatus for receiving broadcast signals, method for transmitting broadcast signals and method for receiving broadcast signals
EP2914039A1 (fr) 2014-02-26 2015-09-02 Fraunhofer-Gesellschaft zur Förderung der angewandten Forschung e.V. Dispositif d'émission de données, récepteur de données et procédé de fonctionnement associé
WO2016118060A1 (fr) 2015-01-20 2016-07-28 Telefonaktiebolaget Lm Ericsson (Publ) Dispositif de transmission, dispositif de réception et procédés réalisés dans ces derniers
US10313492B2 (en) * 2015-05-29 2019-06-04 Samsung Electronics Co., Ltd. Layer one signaling for physical layer pipes (PLPS)
KR102524210B1 (ko) * 2015-07-01 2023-04-24 한국전자통신연구원 복수의 동작 모드들을 지원하는 타임 인터리버에 상응하는 방송 신호 프레임 생성 장치 및 방송 신호 프레임 생성 방법
EP3125453A1 (fr) 2015-07-30 2017-02-01 Fraunhofer-Gesellschaft zur Förderung der angewandten Forschung e.V. Procede de transmission sans fil pour un recepteur simple
MX377715B (es) * 2015-08-07 2025-03-11 Sony Corp Aparato de recepción y método de procesamiento de datos.
JP6153575B2 (ja) * 2015-08-13 2017-06-28 株式会社Ｎｔｔドコモ ユーザ端末、無線基地局及び無線通信方法
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
JP2020123825A (ja) * 2019-01-30 2020-08-13 ソニーセミコンダクタソリューションズ株式会社 信号処理装置、信号処理方法、受信装置、及び信号処理プログラム

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20060171283A1 (en) * 2005-01-11 2006-08-03 Rajiv Vijayan Method and apparatus for decoding data in a layered modulation system
US20160294598A1 (en) * 2015-04-06 2016-10-06 Lg Electronics Inc. Apparatus and method for sending and receiving broadcast signals

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See also references of WO2018077771A2 *

Also Published As

Publication number Publication date
JP2019536333A (ja) 2019-12-12
RU2019115840A3 (fr) 2020-11-24
WO2018077771A3 (fr) 2018-06-28
DE102016220886B3 (de) 2018-03-08
KR102246080B1 (ko) 2021-04-30
MX2019004634A (es) 2019-09-18
US11483028B2 (en) 2022-10-25
JP6938631B2 (ja) 2021-09-22
CN110114993B (zh) 2022-01-21
MY202703A (en) 2024-05-16
RU2019115840A (ru) 2020-11-24
RU2748466C2 (ru) 2021-05-26
CA3041384A1 (fr) 2018-05-03
CA3041384C (fr) 2023-03-21
WO2018077771A2 (fr) 2018-05-03
CN110114993A (zh) 2019-08-09
KR20190065436A (ko) 2019-06-11
US20190288741A1 (en) 2019-09-19

Similar Documents

Publication Publication Date Title
DE102016220886B3 (de) Interleaving für die Übertragung von Telegrammen mit variabler Subpaketanzahl und sukzessiver Decodierung
EP3530038B1 (fr) Longueurs de sous-paquets variables pour la segmentation de télégrammes dans des réseaux à faible consommation d'énergie
EP3610575B1 (fr) Modèles de saut spécifiques pour segmentation de télégrammes
EP3002560B1 (fr) Système de détection stationnaire fonctionnant avec batterie doté d'une transmission de données unidirectionnelle et sans fil
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
DE102016220883A1 (de) Optimierte Kombination aus Präambel und Datenfeldern für Sensornetzwerke mit geringem Stromverbrauch auf Basis des Telegram Splitting Verfahrens
DE69027018T2 (de) Maximalwahrscheinlichkeitsdekodierung mit Störungsdetektion für Frequenzsprungsysteme mit kodierter Modulation
DE69425400T2 (de) Verfahren und Vorrichtung zur Verschachtelung einer Folge von Datenelementen
WO2019007933A9 (fr) Schéma de saut spécifique pour l'émission et la réception répétées de données et procédé de production correspondant
EP1256242B1 (fr) Procede de transmission d'informations de donnees par paquets dans un systeme de communication radio
EP3694126B1 (fr) Procédé de transmission de la distribution de télégrammes pour réseaux bidirectionnels
EP3707836B1 (fr) Utilisation efficace d'un récepteur monocanal destinée à la réception d'une transmission multicanal
EP3707839A1 (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
DE102016205052A1 (de) Telegrammaufteilungsübertragungsverfahren für bidirektionale netze
DE102018218729B3 (de) Interleaving mit zirkularer Zeilen-Rotation für die Übertragung bei Telegramm-Splitting
EP1169778A1 (fr) Transmission de donnees avec entrelacement puis adaptation de debits par perforation ou repetition
EP1290808B1 (fr) Systeme de transmission de donnees base sur le procede du saut de frequences
DE102018220766B4 (de) Vereinfachte kombination codierter datenpakete
DE102010023352B3 (de) Verfahren zum Übertragen von Daten
DE102013203423B3 (de) Verfahren und Vorrichtung zum Übertragen eines Datenpaketes
EP4683254A1 (fr) Récepteur radio, émetteur radio et système de transmission radio
WO2021083748A2 (fr) Mesures permettant une poursuite de canal lors de transmissions numériques
DE10114834A1 (de) System zur Datenübertragung nach dem Frequenzsprungverfahren
EP1806863A1 (fr) Procédé de codage intercanal temporel pour système de transmission multicanaux
DE10300707A1 (de) Verfahren und Kommunikationssystemvorrichtung zum codemodulierten Übertragen von Informationen

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: 20190423

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

AX Request for extension of the european patent

Extension state: BA ME

DAV Request for validation of the european patent (deleted)
DAX Request for extension of the european patent (deleted)
STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: EXAMINATION IS IN PROGRESS

17Q First examination report despatched

Effective date: 20210928

RAP3 Party data changed (applicant data changed or rights of an application transferred)

Owner name: FRIEDRICH-ALEXANDER-UNIVERSITAET ERLANGEN-NUERNBERG

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