EP2769500B1 - Procédé et dispositif pour transporter des bits supplémentaires avec un bloc de données codé dans un système de communication - Google Patents

Procédé et dispositif pour transporter des bits supplémentaires avec un bloc de données codé dans un système de communication Download PDF

Info

Publication number
EP2769500B1
EP2769500B1 EP11785806.8A EP11785806A EP2769500B1 EP 2769500 B1 EP2769500 B1 EP 2769500B1 EP 11785806 A EP11785806 A EP 11785806A EP 2769500 B1 EP2769500 B1 EP 2769500B1
Authority
EP
European Patent Office
Prior art keywords
code
data
additional bits
block
values
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.)
Not-in-force
Application number
EP11785806.8A
Other languages
German (de)
English (en)
Other versions
EP2769500A1 (fr
Inventor
Erik Larsson
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.)
Telefonaktiebolaget LM Ericsson AB
Original Assignee
Telefonaktiebolaget LM Ericsson AB
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 Telefonaktiebolaget LM Ericsson AB filed Critical Telefonaktiebolaget LM Ericsson AB
Publication of EP2769500A1 publication Critical patent/EP2769500A1/fr
Application granted granted Critical
Publication of EP2769500B1 publication Critical patent/EP2769500B1/fr
Not-in-force legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

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/12—Arrangements for detecting or preventing errors in the information received by using return channel
    • H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
    • H04L1/1607—Details of the supervisory signal
    • H04L1/1664—Details of the supervisory signal the supervisory signal being transmitted together with payload signals; piggybacking
    • 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/35—Unequal or adaptive error protection, e.g. by providing a different level of protection according to significance of source information or by adapting the coding according to the change of transmission channel characteristics
    • H03M13/356—Unequal error protection [UEP]
    • 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/47—Error detection, forward error correction or error protection, not provided for in groups H03M13/01 - H03M13/37
    • 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/63—Joint error correction and other techniques
    • H03M13/6306—Error control coding in combination with Automatic Repeat reQuest [ARQ] and diversity transmission, e.g. coding schemes for the multiple transmission of the same information or the transmission of incremental redundancy
    • 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/65—Purpose and implementation aspects
    • H03M13/6508—Flexibility, adaptability, parametrability and configurability of the implementation
    • H03M13/6513—Support of multiple code types, e.g. unified decoder for LDPC and turbo codes
    • 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/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
    • H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
    • H03M13/11—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits using multiple parity bits
    • H03M13/1102—Codes on graphs and decoding on graphs, e.g. low-density parity check [LDPC] codes
    • 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/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
    • H03M13/23—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using convolutional codes, e.g. unit memory codes
    • 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/29—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 combining two or more codes or code structures, e.g. product codes, generalised product codes, concatenated codes, inner and outer codes
    • H03M13/2957—Turbo codes and decoding
    • 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/0057—Block codes
    • 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/0059—Convolutional codes
    • 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/12—Arrangements for detecting or preventing errors in the information received by using return channel
    • H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
    • H04L1/18—Automatic repetition systems, e.g. Van Duuren systems
    • H04L1/1812—Hybrid protocols; Hybrid automatic repeat request [HARQ]

Definitions

  • the invention relates generally to encoding of information to be transmitted in a communication system.
  • a data block could comprise e.g. some hundreds or thousands of bits.
  • Such a block is typically encoded in a transmitting node, by use of a code, which is known to a receiving node. The encoded block is then decoded in a receiving node using the known code.
  • HARQ ACKs which may consist of one bit, are multiplexed with blocks of payload data.
  • An additional lonely bit can be jointly encoded with a data block, and thus also be encoded using e.g. an error correcting code.
  • an additional lonely bit such as the HARQ ACK bit in LTE
  • Delta P, ⁇ P represents the increase in transmit power which is needed to maintain the same spectral efficiency as in an original system, when introducing an additional lonely bit, encoded with a repetition code, which consumes payload resources.
  • 10 ⁇ log 10 ⁇ P 10 ⁇ log 10 ⁇ 2 2 ⁇ ⁇ 1 - K / N - 1 - 10 ⁇ log 10 ⁇ 2 2 ⁇ ⁇ - 1 ⁇ 6.0 ⁇ ⁇ 1 - 2 - 2 ⁇ ⁇ ⁇ K N ⁇ dB
  • Document WO2009/099301 A2 discloses a method for piggy backing ACK/NACK bits on PUSCH.
  • the ACK/NACK bits are encoded and inserted into encoded data scream using punchuning.
  • N is an integer ⁇ 1
  • an additional bit is a binary digit which may assume the values zero or one.
  • a method in a communication system for conveying N additional bits with a block of data to be encoded and transmitted.
  • the method comprises actions both in an encoding node and in a decoding node.
  • the respective value of the N additional bits is determined, and a code is selected based on the N values.
  • the block of data is encoded by use of the selected code.
  • the method comprises determining which code, from a predetermined set comprising 2 N candidate codes associated with different possible combinations of values of the N additional bits, that was used for encoding the block of data.
  • the respective values of the N additional bits are determined based on the determined code.
  • a method in an encoding node in a communication system, for conveying N additional bits with a block of data to be encoded and transmitted.
  • the method comprises determining the respective value of the N additional bits and-selecting a code based on the N values.
  • the method further comprises encoding the block of data by use of the selected code.
  • an encoding node in a communication system for conveying N additional bits with a block of data to be encoded and transmitted.
  • the encoding node comprises a functional unit adapted to determine the respective values of the N additional bits.
  • the encoding node further comprises a functional unit adapted to select a code based on the N values, and a functional unit adapted to encode the block of data by use of the selected code.
  • a method in a decoding node in a communication system, for conveying N additional bits with a block of data to be encoded and transmitted.
  • the method comprises determining which code that was used for encoding the block of data.
  • the determined code is a code from a predetermined set comprising candidate codes associated with different possible combinations of values of the N additional bits.
  • the method further comprises-determining respective values of the N additional bits based on the determined code.
  • the above described methods and nodes may be used for conveying one or more additional bits with a data packet for practically no cost in terms of radio resource consumption or computational complexity, as compared to conventional methods. Further, the data packet does not need to be decoded in order to determine the additional bits which are conveyed with the packet. This is especially advantageous for e.g. control information, such as e.g. HARQ-related information.
  • control information such as e.g. HARQ-related information.
  • the above method and network node may be implemented in different embodiments.
  • the predetermined set may comprise 2 N codes, each associated with a respective combination of values of the N additional bits.
  • one code could be obtained e.g. by permuting the bits of the codewords of another code.
  • the additional bits to be conveyed may be related e.g. to control information, such as acknowledgements in an automatic repeat request procedure.
  • the determining (in the decoding node) of the code used may involve, apart from obtaining a block of data encoded with an unknown code from a predetermined set of codes, also calculating the respective posterior probabilities that a set of syndrome checks are satisfied, given the obtained block of data, said syndrome checks being associated with a code candidate from the set of codes.
  • the posterior probabilities may be combined in different ways. For example, the logarithms of the posterior probabilities for each individual syndrome check may be added.
  • the posterior probabilities may be combined e.g. per code candidate, when posterior probabilities are calculated for syndrome checks associated with one or more further code candidates. It may be determined which one of the code candidates that was used for encoding the obtained data, based on a comparison between the combined posterior probabilities associated with each code candidate. Further, the encoded data block may be decoded in the decoding node.
  • an additional lonely bit such as e.g. a HARQ ACK bit
  • a payload data packet e.g. over a wireless link
  • an additional lonely bit such as e.g. a HARQ ACK bit
  • One possible implementation of the scheme described herein is to augment the original codeword space of a code used for encoding data packets with a permuted version of itself, and thus create a new, nonlinear code, which has the properties that (i) the additional lonely bit can be easily detected and (ii) the payload data can be efficiently decoded.
  • ⁇ be a payload message.
  • C 1 and C 2 be two randomly chosen channel codes of length M.
  • the channel codes could be two random instances of an LDPC code with given degree distributions, or, they could be obtained by permuting the bits of a standard code, e.g. convolutional, turbo or LDPC code, in two different ways.
  • an off-the-shelf LDPC code was selected as C 1
  • C 2 was selected to be the same code as C 1 , but with the bits rearranged so that if ⁇ c(1 :M) ⁇ are the codewords of C 1 , then the codewords of C 2 are ⁇ c(M/2+1: M),c(1 : M/2) ⁇ .
  • to generate the codewords of C 2 take each codeword of C 1 , split it in the middle, and swap the left and right halves.
  • the detection of b amounts to determining, or guessing, which code of C 1 or C 2 , that was used to encode ⁇ .
  • received_data P ( b i 0
  • Hagenauer's Boxplus operator which may be computed or tabulated according to known methods.
  • the number of terms required to compute x i is O(Md), where d is the maximum degree of the code. That is, the complexity of the operation of computing x i scales with M and d as M ⁇ d (M times d). For example, if d is doubled, the complexity is doubled, etc.
  • d is typically less than 10.
  • convolutional codes it is of the same order as the constraint length. Hence the computational complexity of this algorithm is not large.
  • Ci decoder is here meant a decoder using the code Ci. It is very unlikely that both the C 1 and C 2 decoders will return a valid codeword; and hence, the output of the one decoder which returns a valid codeword should be selected.
  • This double decoder solution would double the decoder complexity, as compared to the original system where the code is known to the receiving unit in advance. If a good guess of b, say b ⁇ , is available (such as that provided by step (i) above), an attempt to decode the data block using the decoder associated with b ⁇ , i.e. Cb ⁇ , could be made. If the decoder Cb ⁇ converges, the output of the decoder may be used as the final result, i.e. the decoded block of data. Otherwise, the other decoder is used for decoding the data block.
  • the simulations concerned BPSK (Binary Phase Shift Keying) transmission over an AWGN channel.
  • the choice of LDPC codes may be beneficial, since LDPC codes offer a natural possibility of error checking.
  • error checking may also be achieved for other types of codes, e.g. by including a CRC check for this purpose.
  • the payload blocks had 102 bits when uncoded and 204 bits when encoded.
  • the LDPC decoder was configured to terminate after at most 10 iterations.
  • Figure 1 illustrates the result of the simulations, and shows the following graphs: 1) The payload data BER of the original system, without transmitting the additional lonely bit (line with Xs); 2) The payload data BER of a system, using the proposed coding scheme (selecting C1 or C2 depending on b) with the proposed, associated decoder (line with circles).
  • An important observation, which could be made from figure 1 is that: for BER values below 1%, no payload BER penalty of transmitting the additional lonely bit could be measured. That is, the BER of the blocks of payload data was just as good when the encoding of the blocks was used to convey an additional lonely bit, as when the code used to encode the blocks was known to the receiving node in advance (and not used to convey any additional lonely bit).
  • figure 1 shows the graph: 3) The error probability for the additional lonely bit, with the proposed scheme (solid line). In the simulations, the BER of the additional lonely bit was about half that of the payload BER.
  • the same bit could be encoded with more than one data packet.
  • the same additional bit could be encoded with/piggy-backed on 2-4 different data packets, and the results could be combined at a receiver. This way, a more accurate result could be achieved, having a lower error probability.
  • the set of code candidates is then to be extended to comprise a number of codes which is 2 N , where N is the number of additional bits to be conveyed with one block of data.
  • the number N of bits could be e.g. 1, 2, 3, 4, 5, 6, or even higher.
  • the higher number of additional bits the higher error probability for the additional bits to be conveyed with the data block.
  • the higher error probability is due to that the higher number, N, of additional bits, the higher number, 2 N , of different codes representing the different combinations of values of the N additional bits.
  • the more codes the smaller distance between the different codes, the higher probability of mistaking one code for another, and thus higher error probability for the additional bits. Further, the error probability of the coded bits comprised in the data packet would also increase with an increased number of additional bits, for the same reasons.
  • the decoding scheme described below enables a fast mechanism for determining whether a certain channel code was used to encode a set of data or not.
  • the decoding scheme and procedure is suitable for use where it should be determined which one out of a set of channel code candidates that was used for encoding a set of data, such as for detecting or decoding the value of an additional bit, which is piggy-backed with a block of data.
  • the decoding scheme is further suitable for use e.g. in blind detection.
  • a receiver does not need to receive the entire set or block of data to determine whether a certain code was used to encode the block, which is typically the case e.g. in blind detection. Further, the data need not be decoded in order to determine whether a certain channel code has been used or not.
  • the decoding scheme is valid for all types of channel codes, for which syndrome checks may be formulated, e.g. any linear channel code.
  • b 1 ,b 2 ,...,b M will denote the information bearing bits
  • C 1 ,C 2 ,...,C N will denote the corresponding coded bits obtained from the channel encoder (e.g. in a transmitting node).
  • the coded bits are transmitted to a receiving node through a communication channel.
  • the corresponding observed sequence at a receiver of the coded bits (e.g. in a receiving node) will be denoted y 1 ,y 2 ,...,y N . It is assumed that the channel code which is used by the channel encoder is unknown to the receiver. Thus, it is desired to determine, in the receiver, which channel code that was used by the channel encoder.
  • Equation (6) which is normally used e.g. for Low Density Parity Check (LDPC) decoding, may be applied in order to determine whether a specific code was used to encode a set of observed data or not.
  • LDPC Low Density Parity Check
  • there will be parity check relations of the form: c i 1 ⁇ c i 2 ⁇ , ... ⁇ c i P 0 for some i and P.
  • these relations can be obtained using the syndrome former of the code, and for any block code, these relations may be obtained from the parity check matrix associated with the code.
  • the syndrome former is defined for any convolutional code. It can be tabulated, and there are standard tools available for finding the syndrome former of a code.
  • the decoding scheme will be exemplified using a standard rate-1/2 convolutional code with constraint length 4, depicted in figure 2 .
  • This code will be denoted “the given code” or “the candidate code” in the example below.
  • the syndrome posterior probability: ⁇ i ⁇ ⁇ ⁇ l i - 1 3 + l i - 1 1 + l i 1 + l i + 1 1 + l i + 1 2 + l i + 2 1 + l i + 2 2
  • l i j ⁇ c i j
  • y i j would most probably take on high values.
  • the observed sequence y is labeled as: y 1 1 , y 1 2 , ... , y 1 1 , y 1 2 , ... .. rather than the conventional labeling (that is the sequence y 1 , y 2 , ...), in order to associate the observed sequence to the output of the encoder.
  • ⁇ [ ⁇ 1, ⁇ 2 , ..., ⁇ k ] T it may be decided whether the channel encoder used the given convolutional code, i.e. the evaluated candidate code, to encode the data or not.
  • the syndrome posterior probabilities may be combined in different ways, which will be exemplified below.
  • the decision of which code that was used may be based on a comparison between the combined posterior probabilities of each code candidate.
  • Syndrome checks associated with all the candidate codes could be evaluated, and the results could be compared.
  • the posterior probabilities could be combined e.g. by adding the logarithms of the posterior probabilities for each individual syndrome check
  • the above described decoding scheme facilitates a fast blind detection of which channel code that was used for encoding e.g. a block or set of data.
  • the described decoding scheme is efficient in terms of computational complexity.
  • the described algorithm does not require knowledge of the exact length of a coded block in advance.
  • the procedure could be performed in a transmitting node, such as e.g. a mobile terminal, or other communicating network node in a communication system.
  • N additional bits to be conveyed with the block of data ⁇ .
  • the number N of additional bits is equal to or larger than 1, i.e. (N ⁇ 1).
  • N is much smaller than the size of the block ⁇ , which may be e.g. some hundreds or thousands of bits.
  • Each of the N additional bits is a binary digit, which may assume the value of zero or one.
  • the N additional bits may be related to control signaling, such as e.g. information related to ARQ/HARQ.
  • the codes to be comprised in the set could be any linear codes, such as convolutional or LDPC codes.
  • the codewords of a first code in the set of codes may be obtained by permuting the bits of the codewords of a second code in the set, as previously described.
  • the combination of any two of the codes i.e. a code comprising the codewords of any two codes in the set of codes, would in general constitute a non-linear code
  • the block of data, ⁇ is encoded by use of the selected code, in an action 306.
  • the block may be transmitted to a receiving node according to conventional methods.
  • the additional bits may be conveyed to a receiving node in form of the selected code, which is used to encode the block of data.
  • the encoding node is adapted to enable the performance of the above described procedure of conveying N additional bits with a block of data, which is to be encoded and transmitted.
  • N is an integer ⁇ 1
  • each of the N additional bits is a binary digit, which may assume a value of zero or one.
  • the encoding node 401 may be a transmitting node in a cellular communication system, such as e.g. a base station/eNB, a mobile terminal or other communicating network node.
  • the encoding node 401 is illustrated as to communicate with other entities via a communication unit 402 which may be considered to comprise conventional means for wireless and/or wired communication.
  • the components or units in the encoding node, which are adapted to enable the performance of the above described procedure, are illustrated as to compose an arrangement 400, surrounded by a dashed line.
  • the arrangement may be an encoder.
  • the arrangement or encoding node may further comprise other functional units 412, such as e.g. functional units providing regular mobile terminal/base station functions, and may further comprise one or more storage units, e.g. memories 410.
  • the encoding node comprises a determining unit 404, which is adapted to determine the respective values of N additional bits to be conveyed with a packet of data, ⁇ .
  • the encoding node further comprises a selecting unit 406, which is adapted to select a code based on the determined N values.
  • the encoding node comprises an encoding unit 408, which is adapted to encode the block of data, ⁇ , by use of the selected code.
  • the arrangement 400 could be implemented e.g. by one or more of: a processor or a micro processor and adequate software stored in a memory, to be executed by the processor; a Programmable Logic Device (PLD) or other electronic component(s)/processing circuit(s) configured to perform the actions mentioned above.
  • PLD Programmable Logic Device
  • N is an integer ⁇ 1
  • each of the N additional bits is a binary digit, which may assume a value of zero or one.
  • the decoding node could be a receiving node, such as e.g. a mobile terminal, base station/eNB or other communicating network node, in a communication system.
  • ⁇ Assuming a block of data, ⁇ , is received, e.g. in an action 502, which block ⁇ is encoded by an unknown code, C U .
  • C U an unknown code
  • the predetermined set of candidate codes comprises 2 N codes, associated with different possible combinations of values of the N additional bits. Then, the respective values of the N additional bits are determined based on the determined code, in an action 512.
  • the unknown code, C u is the code C 01 , comprised in the predetermined set, where C 01 is a code associated with the value combination, or values, 01 of the additional bits; it may be determined that the value of the additional bit b1 is 0 and the value of the additional bit b2 is 1.
  • the encoded block of data may then be decoded in an action 514, by use of the determined code.
  • the decoding of the block ⁇ is not mandatory, and further not necessary for determining the values of the N additional bits. There may be situations where it is not desired to decode the block ⁇ .
  • the determining of the code, which was used for encoding the block ⁇ may involve calculating, in an action 504, the respective posterior probabilities that a set of syndrome checks are satisfied, given the obtained block of data.
  • the syndrome checks may be associated with one or more code candidates from the set of codes.
  • the set of syndrome checks may comprise one or more syndrome checks associated with each of the code candidates.
  • the determining may further involve combining the posterior probabilities, in an action 506.
  • the posterior probabilities may be combined e.g. by adding the logarithms of the posterior probabilities for each individual syndrome check.
  • the posterior probabilities may further be combined per code candidate.
  • the code candidates that was used for encoding the block of data may be determined in an action 510, which of the code candidates that was used for encoding the block of data, based on the combined posterior probabilities. This could be determined e.g. by comparing the combined posterior probabilities associated with the different code candidates. Quantities based on or derived from the combined posterior probabilities associated with the different code candidates could also be compared.
  • the candidate code used for encoding the block of data could be identified e.g. by that the value(s) associated with this code stands out in the comparison, e.g. as being the largest value.
  • the combining and determining may involve a statistical test, such as a Generalized Likelihood Ratio Test (GLRT).
  • the GLRT may be obtained under the assumption that the logarithmic posterior probabilities have a Gaussian distribution.
  • a procedure where one candidate code at a time is evaluated is illustrated in figure 6 .
  • the posteriori probabilities that a set of syndrome checks are satisfied, given an obtained block of data, are calculated in an action 604.
  • the set of syndrome checks comprises one or more syndrome checks associated with a code candidate to be evaluated.
  • the posterior probabilities are combined, e.g. by adding the logarithms of the posterior probabilities associated with the code candidate, in an action 606. Further, it may be determined in an action 608, whether the candidate code was used for encoding the block of data or not. This could be determined e.g.
  • the combining and determining may involve a statistical test, such as a Generalized Likelihood Ratio Test (GLRT).
  • GLRT Generalized Likelihood Ratio Test
  • a new candidate code from the set of candidate codes is selected in an action 612, when it is determined in action 608 that an evaluated candidate code was not the used code.
  • the candidate code selected in action 612 may then be evaluated by the actions 604-608, and the procedure ends when the used code has been found.
  • the value of the additional bit or bits is determined e.g. in an action 512 or 610.
  • the values of the additional bits may be determined by that the values are associated with the used code, as previously described.
  • the determining may be described as a de-mapping from a determined code to the value(s) of the additional bit(s).
  • the block of data may be decoded, using the determined code, in an action 514 or 614.
  • the decoding node 701 is adapted to enable the performance of the above described procedure for decoding of N additional bits conveyed with a block of data.
  • N is an integer ⁇ 1
  • each of the N additional bits is a binary digit, which may assume a value of zero or one.
  • the decoding node 701 may be a receiving node in a cellular communication system, such as e.g. a base station/eNB, a mobile terminal or other communicating network node.
  • the decoding node 701 is illustrated as to communicate with other entities via a communication unit 702 which may be considered to comprise conventional means for wireless and/or wired communication.
  • the components or units in the decoding node, which are adapted to enable the performance of the above described procedure, are illustrated as to compose an arrangement 700, surrounded by a dashed line.
  • the arrangement may be a decoder.
  • the arrangement or decoding node may further comprise other functional units 716, such as e.g. functional units providing regular base station or mobile terminal functions, and may further comprise one or more storage units, e.g. memories 714.
  • the decoding node is illustrated as comprising an obtaining unit 704, adapted to receive an encoded block of data, which e.g. has been received over a radio channel by a receiver in the communication unit.
  • the obtaining unit could alternatively be regarded e.g. as a part of the communication unit 702.
  • the decoding node 701 comprises a determining unit 710, which is adapted to determine which code, from a predetermined set of candidate codes associated with different combinations of values of the N additional bits, that was used for encoding the block of data, and to determine the respective values of the N additional bits based on the determined code.
  • the decoding node may further comprise a decoding unit 712, which is adapted to decode the block of data using the determined code.
  • the decoding node may further comprise a calculating unit 706, which is adapted to calculate the respective posterior probabilities that a set of syndrome checks are satisfied, given the obtained block of data.
  • the decoding node may further comprise a combining unit 708, which is adapted to combine the posterior probabilities as described above, to support the determining of which candidate code that was used for encoding the block of data.
  • the calculating unit 706 and the combining unit 708 may be integrated as part of the determining unit.
  • the decoding node is assumed to have been informed of the set of candidate codes and the bit values associated with each code.
  • the decoding node is further assumed to have been provided with, have derived, or in any other way been given or have gained access to syndrome checks associated with the candidate codes.
  • the information on codes and/or syndrome checks may have been provided e.g. by an OaM (Operations and Maintenance) node in the communication system, and may be stored in one or more memories.
  • OaM Operations and Maintenance
  • the arrangement 700 could be implemented e.g. by one or more of: a processor or a micro processor and adequate software, stored in a memory, to be executed by the processor; a Programmable Logic Device (PLD) or other electronic component(s) or processing circuit(s), configured to perform the actions mentioned above.
  • PLD Programmable Logic Device
  • Figure 8 schematically shows an embodiment of an arrangement 8 in a network node, which also can be an alternative way of disclosing an embodiment of the arrangement in an encoding node illustrated in figure 4 .
  • a processing unit 806 e.g. with a DSP (Digital Signal Processor).
  • the processing unit 806 may be a single unit or a plurality of units to perform different actions of procedures described herein.
  • the arrangement 800 may also comprise an input unit 802 for receiving signals from other entities, and an output unit 804 for providing signal(s) to other entities.
  • the input unit 802 and the output unit 804 may be arranged as an integrated entity.
  • the arrangement 800 comprises at least one computer program product 808 in the form of a non-volatile memory, e.g. an EEPROM (Electrically Erasable Programmable Read-Only Memory), a flash memory and a hard drive.
  • the computer program product 808 comprises a computer program 810, which comprises code means, which when executed in the processing unit 806 in the arrangement 800 causes the arrangement and/or the network node to perform the actions e.g. of the procedure described earlier in conjunction with figure 3 .
  • the computer program 810 may be configured as a computer program code structured in computer program modules.
  • the code means in the computer program 810 of the arrangement 800 comprises a determining module 810a for determining the values of N additional bits to be conveyed with a block of data.
  • the computer program further comprises a selecting module 810b for selecting a code based on the N determined values.
  • the computer program 810 further comprises an encoding module 810c for encoding the block of data by use of the selected code.
  • the computer program 810 could further comprise other modules for providing other desired functionality.
  • the modules 810a-c could essentially perform the actions of the flow illustrated in figure 3 , to emulate the arrangement in an encoding node illustrated in figure 4 .
  • the different modules 810a-c when executed in the processing unit 806, they may correspond to the units 404-408 illustrated in figure 4 .
  • code means in the embodiment disclosed above in conjunction with figure 8 are implemented as computer program modules which when executed in the processing unit causes the arrangement and/or encoding node to perform the actions described above in the conjunction with figures mentioned above, at least one of the code means may in alternative embodiments be implemented at least partly as hardware circuits.
  • the processor may be a single CPU (Central processing unit), but could also comprise two or more processing units.
  • the processor may include general purpose microprocessors; instruction set processors and/or related chips sets and/or special purpose microprocessors such as ASICs (Application Specific Integrated Circuit).
  • the processor may also comprise board memory for caching purposes.
  • the computer program may be carried by a computer program product connected to the processor.
  • the computer program product may comprise a computer readable medium on which the computer program is stored.
  • the computer program product may be a flash memory, a RAM (Random-access memory) ROM (Read-Only Memory) or an EEPROM, and the computer program modules described above could in alternative embodiments be distributed on different computer program products in the form of memories within the network node.

Landscapes

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

Claims (15)

  1. Procédé mis en oeuvre dans un noeud de codage au sein d'un système de communication, pour acheminer N bits supplémentaires avec un bloc de données à coder et à transmettre, le procédé comprenant les étapes ci-dessous consistant à :
    - déterminer (302) la valeur respective des N bits supplémentaires ;
    - sélectionner (304) un code sur la base des N valeurs, à partir d'un ensemble prédéterminé comprenant des codes candidats associés à différentes combinaisons possibles de valeurs des N bits supplémentaires, dans lequel le code sélectionné est un code linéaire ; et
    - coder (306) le bloc de données en utilisant le code sélectionné ;
    où N est un nombre entier ≥ 1, et où chacun des N bits supplémentaires est un chiffre binaire qui peut adopter une valeur de zéro ou de un.
  2. Procédé selon la revendication 1, dans lequel le code est sélectionné parmi un ensemble prédéterminé comprenant 2N codes, respectivement associés à différentes combinaisons de valeurs des N bits supplémentaires.
  3. Procédé selon la revendication 2, dans lequel l'ensemble prédéterminé de codes comprend au moins une paire de codes, où les mots de code d'un premier code de la paire sont obtenus par la permutation des bits des mots de code du second code de la paire.
  4. Procédé selon l'une quelconque des revendications 1 à 3, dans lequel au moins l'un des N bits supplémentaires est connexe à un ou plusieurs des événements ci-dessous :
    - des accusés de réception dans une procédure de demande de répétition automatique ;
    - une signalisation de commande.
  5. Noeud de codage dans un système de communication, configuré de manière à acheminer N bits supplémentaires avec un bloc de données à coder et à transmettre, le noeud de codage comprenant :
    - une unité de détermination (404), apte à déterminer les valeurs respectives des N bits supplémentaires ;
    - une unité de sélection (406), apte à sélectionner un code sur la base des N valeurs, à partir d'un ensemble prédéterminé comprenant des codes candidats associés à différentes combinaisons possibles de valeurs des N bits supplémentaires, dans lequel le code sélectionné est un code linéaire ; et
    - une unité de codage (408), apte à coder le bloc de données en utilisant le code sélectionné ;
    où N est un nombre entier ≥ 1, et où chacun des N bits supplémentaires est un chiffre binaire qui peut adopter une valeur de zéro ou de un.
  6. Procédé mis en oeuvre dans un noeud de décodage au sein d'un système de communication, pour le décodage de N bits supplémentaires acheminés avec un bloc de données, le procédé comprenant les étapes ci-dessous consistant à :
    - déterminer (510, 608) quel code, parmi un ensemble prédéterminé comprenant des codes candidats associés à différentes combinaisons possibles de valeurs des N bits supplémentaires, a été utilisé pour coder le bloc de données ; et
    - déterminer (512, 610) des valeurs respectives des N bits supplémentaires sur la base du code déterminé ;
    où N est un nombre entier ≥ 1, et où un bit supplémentaire est un chiffre binaire qui peut adopter la valeur de zéro ou de un.
  7. Procédé selon la revendication 6, comprenant en outre l'étape ci-dessous consistant à :
    - décoder (514, 614) le bloc de données en utilisant le code déterminé.
  8. Procédé selon la revendication 7, dans lequel les valeurs respectives des N bits supplémentaires sont déterminées avant de décoder le bloc de données.
  9. Procédé selon l'une quelconque des revendications 6 à 8, dans lequel la détermination consiste à :
    - obtenir (502, 602) un bloc de données codé avec un code inconnu parmi l'ensemble prédéterminé de codes, et :
    - calculer (504, 604) les probabilités postérieures respectives qu'un ensemble de vérifications de syndrome soit satisfait, étant donné le bloc de données obtenu, lesdites vérifications de syndrome étant associées à un code candidat parmi l'ensemble prédéterminé de codes ; et
    - combiner (506, 606) les probabilités postérieures ;
    ce qui permet par conséquent de déterminer si le code candidat a été utilisé ou non en vue de coder le bloc de données obtenu, sur la base des probabilités postérieures combinées.
  10. Procédé selon la revendication 9, dans lequel des probabilités postérieures sont calculées pour un second ensemble de vérifications de syndrome associées à un ou plusieurs codes candidats supplémentaires parmi l'ensemble prédéterminé de codes.
  11. Procédé selon les revendications 9 ou 10, dans lequel les probabilités postérieures respectives sont combinées pour chaque code candidat.
  12. Procédé selon l'une quelconque des revendications 9 à 11, comprenant en outre l'étape ci-dessous consistant à :
    - déterminer quel code, parmi les codes candidats, a été utilisé pour coder les données obtenues, sur la base d'une comparaison entre les probabilités postérieures combinées associées à chaque code candidat.
  13. Procédé selon l'une quelconque des revendications 10 à 12, dans lequel la combinaison de probabilités postérieures implique l'ajout des logarithmes des probabilités postérieures pour chaque vérification de syndrome individuelle.
  14. Noeud de décodage (701) dans un système de communication, configuré de manière à décoder N bits supplémentaires acheminés avec un bloc de données, le noeud de décodage comprenant :
    - une unité de détermination (710), apte à déterminer quel code, parmi un ensemble prédéterminé de codes candidats associés à différentes combinaisons de valeurs des N bits supplémentaires, a été utilisé pour coder le bloc de données, et à déterminer les valeurs respectives des N bits supplémentaires sur la base du code déterminé ;
    où N est un nombre entier ≥ 1, et où chacun des N bits supplémentaires est un chiffre binaire qui peut adopter une valeur de zéro ou de un.
  15. Procédé mis en oeuvre dans un système de communication pour acheminer N bits supplémentaires avec un bloc de données à coder et à transmettre, le procédé comprenant les étapes ci-dessous consistant à :
    dans un noeud de codage :
    - déterminer (302) les valeurs respectives des N bits supplémentaires ;
    - sélectionner (304) un code sur la base des N valeurs à partir d'un ensemble prédéterminé comprenant des codes candidats associés à différentes combinaisons possibles de valeurs des N bits supplémentaires, dans lequel le code sélectionné est un code linéaire ; et
    - coder (306) le bloc de données en utilisant le code sélectionné ; et
    dans un noeud de décodage :
    - déterminer (510, 608) quel code, parmi l'ensemble prédéterminé comprenant 2N codes candidats associés à différentes combinaisons possibles de valeurs des N bits supplémentaires, a été utilisé pour coder le bloc de données ; et
    - déterminer (512, 610) les valeurs respectives des N bits supplémentaires sur la base du code déterminé ;
    où N est un nombre entier ≥ 1, et où un bit supplémentaire est un chiffre binaire qui peut adopter la valeur de zéro ou de un ;
    ce qui permet par conséquent aux valeurs des N bits supplémentaires d'être déterminées dans le noeud de décodage sans décoder le bloc de données et avec une faible complexité de calcul.
EP11785806.8A 2011-10-18 2011-10-18 Procédé et dispositif pour transporter des bits supplémentaires avec un bloc de données codé dans un système de communication Not-in-force EP2769500B1 (fr)

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/SE2011/051246 WO2013058686A1 (fr) 2011-10-18 2011-10-18 Procédé et dispositif pour transporter des bits supplémentaires avec un bloc de données codé dans un système de communication

Publications (2)

Publication Number Publication Date
EP2769500A1 EP2769500A1 (fr) 2014-08-27
EP2769500B1 true EP2769500B1 (fr) 2015-08-26

Family

ID=48085997

Family Applications (1)

Application Number Title Priority Date Filing Date
EP11785806.8A Not-in-force EP2769500B1 (fr) 2011-10-18 2011-10-18 Procédé et dispositif pour transporter des bits supplémentaires avec un bloc de données codé dans un système de communication

Country Status (3)

Country Link
US (1) US9077530B2 (fr)
EP (1) EP2769500B1 (fr)
WO (1) WO2013058686A1 (fr)

Families Citing this family (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR102007770B1 (ko) * 2012-12-14 2019-08-06 삼성전자주식회사 패킷의 부호화 방법과 그 복호화 장치 및 방법
US9088447B1 (en) * 2014-03-21 2015-07-21 Mitsubishi Electric Research Laboratories, Inc. Non-coherent transmission and equalization in doubly-selective MIMO channels
CN107636757B (zh) * 2015-05-20 2021-04-09 瑞典爱立信有限公司 多声道音频信号的编码
WO2018112983A1 (fr) * 2016-12-24 2018-06-28 Huawei Technologies Co., Ltd. Détection aveugle de débits de code pour des codes avec raccourcissement incrémentiel
CN107425857A (zh) 2017-06-19 2017-12-01 华为技术有限公司 一种极化码编译码方法及装置
CN109309503B (zh) 2017-07-28 2022-05-10 华为技术有限公司 一种Polar码编码方法及装置
CN112106302B (zh) * 2018-03-22 2024-04-23 交互数字专利控股公司 降低复杂度的极化编码和解码
IT201900010797A1 (it) * 2019-07-03 2021-01-03 Univ Bologna Alma Mater Studiorum Procedimento per inviare dati classici in sistemi di elaborazione di informazione quantistica e corrispondente sistema

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5550809A (en) * 1992-04-10 1996-08-27 Ericsson Ge Mobile Communications, Inc. Multiple access coding using bent sequences for mobile radio communications
TWI439064B (zh) * 2007-03-28 2014-05-21 Interdigital Tech Corp 指示搭載確認／非確認欄位被定址臨時塊流之方法及裝置
KR101120237B1 (ko) 2007-06-06 2012-03-16 인터디지탈 테크날러지 코포레이션 피기백 전송된 ａｃｋ／ｎａｃｋ 필드가 어드레싱하는 임시 블록 흐름(ｔｂｆ)을 표시하기 위한 방법 및 장치
KR100949519B1 (ko) * 2007-12-18 2010-03-24 한국전자통신연구원 낮은 복잡도 및 고속 복호를 위한 패리티 검사행렬 생성방법과, 그를 이용한 저밀도 패리티 검사 부호의 부호화장치 및 그 방법
KR101542388B1 (ko) * 2008-02-05 2015-08-07 엘지전자 주식회사 무선 이동 통신 시스템에 있어서 상향링크 제어정보 전송 방법

Also Published As

Publication number Publication date
EP2769500A1 (fr) 2014-08-27
WO2013058686A1 (fr) 2013-04-25
US20130094605A1 (en) 2013-04-18
US9077530B2 (en) 2015-07-07

Similar Documents

Publication Publication Date Title
EP2769500B1 (fr) Procédé et dispositif pour transporter des bits supplémentaires avec un bloc de données codé dans un système de communication
Condo et al. Improved successive cancellation flip decoding of polar codes based on error distribution
CN110089037B (zh) 用于极化码构造的装置和方法
Trifonov et al. Generalized concatenated codes based on polar codes
EP2899911B1 (fr) Procédé générateur et dispositif générateur pour code polaire mixte
US11303300B2 (en) Error detection in communication systems using polar coded data transmission
US10965322B2 (en) Polar code encoding method and apparatus
Williamson et al. Variable-length convolutional coding for short blocklengths with decision feedback
Giard et al. Blind detection of polar codes
US10193568B2 (en) Optical coherent receiver with forward error correction
Wu et al. Partially information coupled polar codes
Coşkun et al. Successive cancellation inactivation decoding for modified Reed-Muller and eBCH codes
Larsson et al. Piggybacking an additional lonely bit on linearly coded payload data
KR102213624B1 (ko) 비이진 ldpc 부호를 위한 복호화 방법, 장치 및 알고리즘
EP2681863B1 (fr) Procédé et agencement concernant la détection aveugle
US12015480B2 (en) Systems and methods for using not perfectly polarized bit channels in parallel polar codes
US20220337269A1 (en) Block code encoding and decoding methods, and apparatus therefor
Donev et al. Polar-coded pulse position modulation for the poisson channel
US20240128988A1 (en) Method and device for polar code encoding and decoding
Liang et al. Rateless transmission of polar codes with information unequal error protection
US20150055736A1 (en) Method and apparatus for decoding received sequence
Shribala et al. Multiple Error Correction binary channel coding scheme
Genç et al. Fast Calculation of Polar Code Bits and Frozen-Bit Locations
Shalin et al. Differential properties of polar codes
CN116491072A (zh) 编码方法、译码方法、以及通信装置

Legal Events

Date Code Title Description
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

17P Request for examination filed

Effective date: 20140326

AK Designated contracting states

Kind code of ref document: A1

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

DAX Request for extension of the european patent (deleted)
GRAP Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOSNIGR1

INTG Intention to grant announced

Effective date: 20150318

GRAS Grant fee paid

Free format text: ORIGINAL CODE: EPIDOSNIGR3

GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

AK Designated contracting states

Kind code of ref document: B1

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

REG Reference to a national code

Ref country code: GB

Ref legal event code: FG4D

REG Reference to a national code

Ref country code: CH

Ref legal event code: EP

REG Reference to a national code

Ref country code: AT

Ref legal event code: REF

Ref document number: 745755

Country of ref document: AT

Kind code of ref document: T

Effective date: 20150915

REG Reference to a national code

Ref country code: IE

Ref legal event code: FG4D

REG Reference to a national code

Ref country code: DE

Ref legal event code: R096

Ref document number: 602011019225

Country of ref document: DE

REG Reference to a national code

Ref country code: AT

Ref legal event code: MK05

Ref document number: 745755

Country of ref document: AT

Kind code of ref document: T

Effective date: 20150826

REG Reference to a national code

Ref country code: LT

Ref legal event code: MG4D

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: GR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20151127

Ref country code: NO

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20151126

Ref country code: LT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20150826

Ref country code: LV

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20150826

Ref country code: FI

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20150826

REG Reference to a national code

Ref country code: NL

Ref legal event code: MP

Effective date: 20150826

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: ES

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20150826

Ref country code: SE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20150826

Ref country code: IS

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20151226

Ref country code: PT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20151228

Ref country code: HR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20150826

Ref country code: RS

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20150826

Ref country code: AT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20150826

Ref country code: PL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20150826

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: NL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20150826

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: EE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20150826

Ref country code: CZ

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20150826

Ref country code: IT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20150826

Ref country code: SK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20150826

Ref country code: DK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20150826

REG Reference to a national code

Ref country code: DE

Ref legal event code: R097

Ref document number: 602011019225

Country of ref document: DE

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: LU

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20151018

Ref country code: RO

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20150826

REG Reference to a national code

Ref country code: CH

Ref legal event code: PL

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: MC

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20150826

PLBE No opposition filed within time limit

Free format text: ORIGINAL CODE: 0009261

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

Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT

GBPC Gb: european patent ceased through non-payment of renewal fee

Effective date: 20151126

REG Reference to a national code

Ref country code: IE

Ref legal event code: MM4A

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: LI

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20151031

Ref country code: CH

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20151031

REG Reference to a national code

Ref country code: FR

Ref legal event code: ST

Effective date: 20160630

26N No opposition filed

Effective date: 20160530

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: SI

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20150826

Ref country code: FR

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20151102

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: IE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20151018

Ref country code: GB

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20151126

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: BE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20150826

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: HU

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT; INVALID AB INITIO

Effective date: 20111018

Ref country code: BG

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20150826

Ref country code: SM

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20150826

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: CY

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20150826

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: MT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20150826

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: MK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20150826

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: AL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20150826

Ref country code: TR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20150826

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: DE

Payment date: 20181029

Year of fee payment: 8

REG Reference to a national code

Ref country code: DE

Ref legal event code: R119

Ref document number: 602011019225

Country of ref document: DE

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: DE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20200501