EP2095557B1 - Vorwärtsfehlerkorrekturcodierung für mit 64b/66b-verwürfelung kompatible mehrstreckenübertragung - Google Patents

Vorwärtsfehlerkorrekturcodierung für mit 64b/66b-verwürfelung kompatible mehrstreckenübertragung Download PDF

Info

Publication number
EP2095557B1
EP2095557B1 EP07821012A EP07821012A EP2095557B1 EP 2095557 B1 EP2095557 B1 EP 2095557B1 EP 07821012 A EP07821012 A EP 07821012A EP 07821012 A EP07821012 A EP 07821012A EP 2095557 B1 EP2095557 B1 EP 2095557B1
Authority
EP
European Patent Office
Prior art keywords
code
error
scrambling
bit
packet
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.)
Active
Application number
EP07821012A
Other languages
English (en)
French (fr)
Other versions
EP2095557A2 (de
Inventor
Timothy Jay Dell
Rene Glaise
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.)
International Business Machines Corp
Original Assignee
International Business Machines Corp
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 International Business Machines Corp filed Critical International Business Machines Corp
Publication of EP2095557A2 publication Critical patent/EP2095557A2/de
Application granted granted Critical
Publication of EP2095557B1 publication Critical patent/EP2095557B1/de
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • 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/13—Linear codes
    • H03M13/19—Single error correction without using particular properties of the cyclic codes, e.g. Hamming codes, extended or generalised Hamming codes
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L25/00—Baseband systems
    • H04L25/02—Details ; arrangements for supplying electrical power along data transmission lines
    • H04L25/03—Shaping networks in transmitter or receiver, e.g. adaptive shaping networks
    • H04L25/03828—Arrangements for spectral shaping; Arrangements for providing signals with specified spectral properties
    • H04L25/03866—Arrangements for spectral shaping; Arrangements for providing signals with specified spectral properties using scrambling
    • 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
    • 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
    • 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
    • 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
    • H04L1/0042—Encoding specially adapted to other signal generation operation, e.g. in order to reduce transmit distortions, jitter, or to improve signal shape
    • 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
    • H04L25/00—Baseband systems
    • H04L25/02—Details ; arrangements for supplying electrical power along data transmission lines
    • H04L25/03—Shaping networks in transmitter or receiver, e.g. adaptive shaping networks
    • 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

Definitions

  • the field of the invention is related to high speed digital communication systems, and more particularly to improved encoding techniques to enhance reliability of transmitted signals by correcting multiplication of single bit errors caused by bit error spreading due to self-synchronized scrambling.
  • any error correcting checkbits appended to the dataword being protected also need to be considered for their effect on the bit transition density of the physical layer.
  • a long stream of 0's, for example, may cause a receiver to lose track of when to sample the incoming data.
  • an encoded dataword may be processed by one of several known scrambling techniques.
  • a self-synchronized scrambler is often implemented with a Linear Feedback Shift Register (LFSR) that is programmed to multiply the dataword according to a predefined polynomial to cause a mathematically guaranteed minimum number of bit transitions.
  • LFSR Linear Feedback Shift Register
  • the scrambler LFSR can also be preset to a specific value to further enhance the number of bit transitions for an all-zero data payload.
  • the payload must be descrambled, usually by a similar inverse process, where the bitstream is divided by the same predefined polynomial.
  • Data scrambling is used to maintain clock synchronization between the transmitter and receiver.
  • data scrambling algorithms usually limit the maximum number of sequentially transmitted ones or zeros, such that a minimum number of logic transitions may be recognized for successful extraction of the transmitted clock. Limiting the maximum number of bits having the same value enables the receiver to maintain synchronization with the source.
  • any error correcting code (ECC) checkbits appended to the dataword must also be scrambled. This necessitates that scrambling be done after the ECC checkbits are added to the transmitted word.
  • the transmitted dataword is likewise descrambled at the receiver prior to activating whatever ECC scheme is implemented in the receiver. In this manner, the bit transmission density is maintained for the entire packet, and not just the databit portion of the packet.
  • FIG. 1 An exemplar prior art communications system is shown in Fig. 1 , wherein (Physical Coding Sublayer) upper interface 100 represents a 10 gigabit media independent interface (XGMII) that provides an interface for data communications equipment irrespective of the physical mode of transport of data to be forwarded 102 or received 104.
  • the encoder 142 and gear box 146 functions are necessary to map data and control character to the blocks and to adapt formats. They are not necessary to the understanding of the invention and are not further described.
  • Receive path 150 includes the descrambler 154 to recover the original stream of bits.
  • PCS 120 also includes a function 160 to monitor bit error rate over the transmission medium and there is a decode function 152 which is the counterpart of the transmit encoder 142.
  • Data from a logical interface 100 is sent to the physical coding sublayer 120, where first bit is encoded with an appropriate ECC and then scrambled. Finally, if necessary, the speed of the logic circuits performing the encoding and scrambling is matched to the transmission speed of the actual physical medium 115 by gearbox 146. In the case of the 64B/66B code, as the name suggests, two bits arc added by the gearbox for every 64 bits two be transmitted. The two extra bits, used to frame the 64-bit packets, are removed at reception and are not included in the scrambling and correction processing steps. The data is then sent across the interface medium as a packet containing the original dataword plus the encoded checkbits, all of which have been scrambled to provide the required bit transition density.
  • the received packet is first synchronized and the packet boundaries detected.
  • the invention does not assume any particular method for delineating packet boundaries. Often, when fixed size packets are transmitted, packet boundaries are detected on the basis of the added redundant bits and encoding of the data stream. Then, in order to keep the bit error rate (BER) as low as possible, the packet is received using a predefined bit transition density derived from the scrambling step. The received packet is descrambled and then decoded to allow for the correction of any errors in the bit stream.
  • BER bit error rate
  • the descrambling process has the undesirable effect of causing any single-bit errors that were introduced in the channel during transmission to be replicated according to the number of terms and degree of the scrambling polynomial.
  • a single bit error can simply be propagated across the channel, or it may be replicated multiple times depending on the form of the scrambling polynomial. Whether the error remains a single-bit error or is replicated multiple times depends on where in the transmitted payload sequence it occurs. If the error occurs at the beginning of the sequence, then it will be spread as a result of the LFSR and will usually be replicated within the same data packet, provided the highest order of the polynomial is less than the total number of bits in the transmitted sequence.
  • the initial error occurs towards the end of the payload, it will still be spread, however, only the first occurrence may fall in the current packet, leading to only a single bit error. Nonetheless, the replicated manifestations of the error will then fall into the next data packet and cause a double-bit error there.
  • Incident errors in the middle of the word can be spread into various double-bit errors, according to the scrambling polynomial and the position of the incident error.
  • Another aspect of digital communications related to bit transition density or maximum run length is cumulative DC offset, which reflects the sum of the low frequency voltage components of the transmitted data stream experienced at the receiver.
  • cumulative DC offset In binary systems, discrete logic values for zero and one are typically assigned opposite polarity voltages. As a result, without periodic adjustment, the cumulative DC offset experienced at the receiver can migrate toward the positive or negative power supply limit, which may lead to an overload condition at the receiver.
  • the cumulative DC imbalance can be expressed as the number of bit values required to be inverted to produce a balanced bit stream. If the cumulative DC offset experienced at the receiver can be effectively balanced, the DC voltage swing experienced at the receiver can be reduced.
  • a balanced DC offset can be exploited to reduce overall signal to noise ratio (SNR) at the receiver because low frequency noise may be more effectively filtered out. This is accomplished by ensuring the encoded data stream represents a balanced distribution of logic zero and one values over a fixed unit of data bits.
  • Forward error correction is a technique designed to identify and correct errors occurring in the course of transmission that obviates the step of resending the data by the transmitter when errors occur.
  • FEC is implemented by applying an algorithm to a digital data stream to generate redundant bits that are transmitted with the original data.
  • An identical algorithm is performed at the receiver end of the system to compare the transmitted calculation of the encoded data with the received encoding. The result of the comparison is known as the FEC syndrome.
  • a null syndrome is indicative of a received error-free data stream. A non-zero entry in any bit position of the error syndrome must be interpreted to correct one or more errors.
  • bit error spreading is compounded further with the presence of FEC at the receiver because the total number of errors in the descrambled data stream may exceed the capability of the FEC decoder. If the error detection and correction capability of the system is exceeded, the original data is corrupted and unrecoverable, and must be retransmitted, thereby impacting overall system performance.
  • N is the time required to transmit one data payload or packet across a single link
  • b is the number of links. It is further readily seen that the length of the subdivided packet is also N/b.
  • N/b could be a fractional number, but in practice, the number of links is chosen in consideration of the packet size (including payload, header and redundant bits), so it is assumed for this example that b divides N evenly, and therefore each sub-packet will contain the same or similar number of bits.
  • the dataword is split into b sub-datawords, and each sub-dataword is scrambled and descrambled independently.
  • the decrambled sub-datawords are reconstructed to form the original dataword, which is then decoded for possible error correction.
  • Patent Application 2004/0193997 A1 discloses a method for combining a simple FEC code with scrambling and descrambling functions to reduce bit error spreading, but requires transmission of data packets over a single serial link and therefore propagates bit error information over multiple packets. Accordingly, a need exists for a FEC code compatible with 64B/66B scrambling format that may be implemented over a multi-channel communication system while preserving channel bandwidth efficiency.
  • EP-A-0833260 discloses an error correction method in a packet based digital transmission system.
  • the invention discloses a method a claimed in claim 1, and corresponding computer program.
  • a Forward Error Correction (FEC) code compatible with the scrambler used by the 64B/66B encoding standard is disclosed for transmission on Serializer/Deserializer (SerDes) communication links.
  • the 64B/66B standard enables lower overhead in terms of the number of error correction or parity bits required (2/64 or 3%) as compared to 8B/10B standard encoding (2/8 or 25%).
  • the proposed FEC allows encoding and decoding to occur before and after scrambling, respectively, such that the results of the scrambling operation on the transmitted signal are preserved.
  • the code allows the correction of any single transmission error in spite of the multiplication by three of all transmission errors due to the 64B/66B scrambling process.
  • a Hamming code is combined with a Bit Interleaved Parity code of degree n (BIP-n).
  • the degree of the BIP code is chosen to fit with the error spreading pattern of the scrambler so that a unique FEC syndrome can always be obtained.
  • bit errors due to spreading is characterized by predictable patterns or syndromes. All single bit errors, whether multiplied or not, have unique syndromes and are therefore easily correctable by the proposed FEC code.
  • the packet can be transported across several serial links, which is desirable for higher bandwidth applications without degrading the code efficiency.
  • a FEC code is disclosed that is compatible with the scrambler used by the 64B/66B encoding for transmission on SerDes channel links with a lower overhead (2/64 or 3%) than 8B/10B encoding (2/8 or 25%).
  • the FEC code according to a first embodiment requires encoding and decoding to occur before scrambling and after descrambling respectively, so as to preserve the properties of the scrambling operation on the transmitted signal.
  • the proposed code allows the correction of any single transmission error in spite of the multiplication by three of all transmission errors resulting from the 64B/66B descrambling process.
  • Fig. 2 depicts the encoding and decoding processing flow according to a first embodiment.
  • a logical XOR is performed on the dataword to be transmitted to form a 16 bit ECC checkbit sequence 200 in accordance with the equations defined in a systematic H-matrix.
  • the checkbits are appended to the data word to form the encoded dataword 201, which is input to the scrambler.
  • the scrambled dataword is then transmitted across the channel 202 and descrambled at the destination 203.
  • the checkbits are separated from the dataword and stored locally 204.
  • a new set of checkbits is generated from the transmitted dataword and a comparison is performed with the transmitted checkbits 205.
  • the result of the compare step is an error syndrome from which the number and location of errors is determined.
  • the first six bits of the syndrome correspond to the BIP-n portion of the encoding process and reveal the number of errors present in the transmitted dataword 208.
  • the remaining ten bits of the error syndrome will indicate
  • FIG. 3 various error spreading syndromes are illustrated for an individual packet in accordance with the applied scrambling polynomial utilized in the 64B/66B protocol.
  • a single error may occur anywhere within the packet frame, whereas two errors (a single error and one replicated instance) may be spaced at an interval of 0-39 bits anywhere within a packet or an interval of 39-58 bits anywhere within the packet. Three errors in the packet would be spaced at intervals of 0, 39 and 58 bits.
  • the errors therefore span on 59 bits in accordance with the powers of the scrambling polynomial i.e.: 0, 39 and 58. If no assumption is made as to the number of SerDes lanes (or high-speed links) dedicated to transport a frame protected by the FEC code, then a single transmission error on a link may result in the occurrence anywhere in a frame of up to three errors. If three errors are within the same frame they are, however, assumed to be spaced in accordance with the powers of the polynomial: 0-39-58. If two errors are in the same frame they must be spaced within bits 0-39 or bits 39-58 any where in the frame. All these combinations of errors, along with all single errors, have unique syndromes, and are therefore correctable.
  • Fig. 4 shows multiple data packets transmitted over a single serial link and illustrates how a single bit error could produce a multi-bit error depending on its bit location in the word. If the single bit error appears early in the n th packet, then the full effect of the scrambling can be seen. If it occurs late in the incident word, then part of the errors would fall outside the word.
  • the error numbers in Figure 3 refer to the relative bit position within any given packet of the spread errors caused by the scrambling polynomial during the descrambling process
  • Bit Error Spreading 1 shows the initial error occurring in the middle of the n-1 packet and is designated by position 0. After processing by the descrambler, the error is also spread to a bit position 39 bits later in the sequence, as well as 58 bit positions later in the sequence. Accordingly, Bit Error Spreading 1 results in the n-1 packet experiencing a double-bit error, while the nth packet experiences a single bit error. However, if the initial error occurs a little later in the bitstream, as shown in Bit Error Spreading 4, only the initial error will be observed in the n-1 packet, and the nth packet will experience a double-bit error.
  • Bit Error Spreading 2 shows an initial error occurring towards the beginning of the nth packet, and the resulting spread errors also fall within the n th packet, leading to a triple-bit error.
  • Bit Error Spreading 3 is similar to Bit Error Spreading 4, but with the initial error occurring in the n th packet, and the resulting spread errors causing either a single or double-bit error in the n+1 packet, in addition to the single or double-bit errors in the n th packet.
  • Fig. 5 illustrates how a single packet can be decomposed and transported on any number of links and reconstituted at the receiver.
  • Single, double and triple bit errors can occur anywhere in packet and still be corrected because the spacing of replicated errors is a function of the scrambling polynomial. If the BIP-n code exponent is chosen such that there are unique remainders modulo n, then the replicated bit errors can be identified and corrected.
  • the n th packet is decomposed into 4 sub-packets. Each subpacket is scrambled and descrambled individually.
  • the spread error occurring in sub-packet 3 causes two errors in the n th packet, plus an additional error in the n+1 packet.
  • ECC information is not propagated across packet boundaries. Accordingly, the multiplication of a single bit error to the n+1 packet in the same bitlane is not detectable with current methods, and therefore the scheme used in US20040193997A1 will not correct multi-bit errors in a system employing multiple serial links.
  • An ECC scheme is designed to match an error model. Therefore, any error complying with the error model must be correctable.
  • the error model described herein is a single transmission error multiplied by the descrambling process so that replicated errors spaced according to the powers of the scrambling polynomial must be considered.
  • the ability of an ECC code to detect additional errors in this case a double bit error, should be assessed. For example, when two transmission errors occur, up to six errors may be detected after descrambling. Iterative simulation is necessary to assess the level of detection capability of the FEC code. Ideally, the FEC code should achieve a single error correction/double error detection SEC/DED level of robustness, but this may not be realized in practice where a small percentage of double transmission errors are not detected.
  • the 64B/66B standard defines packets of 64 bits to which two bits are added for delineation.
  • the invention implicitly assumes that protection with an ECC will be carried on larger packets or frames so the redundant bits needed to implement ECC, will stay at a reasonable level.
  • frames, including redundant bits are restricted to an entire multiple of those 64-bit packets.
  • the FEC code described herein need not assume any particular method to delineate an ECC protected frame.
  • ECC protected frames including 16 redundant bits
  • up to fifteen 64-bit packets e.g., of the type defined by the 64B/66B standard, may be considered.
  • a code to realize FEC with robust error detection and correction capability is structured as discussed below.
  • the FEC code combines a Hamming code with a Bit Interleaved Parity of degree n (BIP-n) code, which can be generated with the two-term polynomial X n + 1.
  • BIP-n Bit Interleaved Parity of degree n
  • the Hamming code can be generated from any irreducible polynomial, preferably primitive, a list of which can be found, in 'Error-Correcting Codes', Peterson & Weldon, The MIT Press, 1972 , which is incorporated herein by reference.
  • the degree of the Hamming code determines the length of the code, i.e., the maximum packet or code word size, including the ECC bits that can be protected.
  • a degree-10 primitive polynomial which generates a maximum length sequence, can span over 1,023 bits. Thus, it can be used to protect a typical 64-byte packet and any length up to 127-byte packets.
  • the degree of the BIP is chosen to ensure uniform error spacing as defined by the scrambling polynomial terms: 0-39, 39-58 (i.e.: 19 bits apart) and 0-58 do not have the same remainders, modulo n.
  • Fig. 6 depicts a flow chart showing an algorithm for selecting the order of the Hamming code and the BIP-n code, such that the most robust solution is realized for the width and number of channels utilized by the system.
  • the minimum power (n) of a bit interleave parity (BIP-n) code must be determined, such that any single transmission error pattern and its replications return a unique modulo n remainder (601-605).
  • Modulo 6 division of the bit distances is the first value of n to provide unique remainders.
  • the degree of the Hamming code m is calculated as m - n bits 607. Choosing a BIP-6 polynomial allows the maximum number of checkbits to be dedicated for the second part of the code, which ensures that the highest level of robustness for protection against multibit errors.
  • BIP-6 syndrome pattern (and any rotation thereof): 0 1 2 3 4 5 single error 1 0 0 0 0 0 0 0-19 1 1 0 0 0 0 0 0-39 1 0 0 1 0 0 0-39-58 1 1 0 0 1 0 Table 2
  • a simple Hamming code is sufficient to achieve a single error correcting code in spite of the error multiplication introduced by the scrambler anywhere in a frame and potentially transported over several links.
  • all error combinations matching the error model have a unique syndrome which is easily decodable and correctable.
  • the H-matrix form (1,023 columns, 16 rows) of the (1,023/1,007) code generated from the multiplication of the dataword with H(x) and B(x) according to a first embodiment is shown.
  • the matrix shown in Fig. 5 should preferably be transposed to a systematic form which requires a diagonalization of the checkbit matrix. This can be accomplished using standard mathematical methods.
  • the resulting systematic form matrix derived from Fig. 7 is shown in Fig. 8 .
  • the FEC code After checking all combinations of single to triple bit errors, spaced as shown in Figs. 3 and 4 , the FEC code provides a robust single error correction code in spite of the multiplication of errors by the scrambler polynomial.
  • a 1,023-bit packet there are 3,976 combinations of errors, each returning a different syndrome so they all can be unambiguously corrected.
  • the FEC code For a data field shorter than the capacity of the matrix, the FEC code must be depopulated to match the actual application packet size and the discarded bits are not considered. To preserve the property of the matrix the depopulation must occur exhaustively from left to right, down to the size of the packet.
  • Decoding at the destination node is accomplished subsequent to the descrambling operation.
  • the systematic form of the H-matrix which has the same properties as the original matrix, should be used to simplify the regeneration of ECC bits. However, this complicates the decoding of the error syndromes since the simple original matrix structure is modified by the diagonalization operation.
  • a more efficient way to proceed is by using the systematic H-matrix both for generating check bits on the encode side and comparing the transmitted check bits and the recalculated checkbits on the receiver end.
  • a transformation is first applied to the original syndrome, which yields a result identical to the case for the non-systematic form of the matrix. This transformation is easily accomplished by multiplying the raw 16-bit syndrome vector by the square check bit matrix shown in Table 3 below.
  • the first (left-most) 6 bits are the sub-syndrome of the BIP generated component and are indicative of a 2-bit error 19 bits apart as indicated in the BIP-6 syndrome pattern of Table 2.

Claims (13)

  1. Verfahren für das Erzeugen eines Vorwärtsfehlerkorrektur-Codes (FEC, Forward Error Correction) für ein paketbasiertes digitales Datenübertragungssystem, wobei das Verfahren Folgendes umfasst:
    (a) Erzeugen eines kombinierten Codes, indem ein Hamming-Code H(x) = X10 + X3 + 1 mit einem Bit-verschachtelten Paritätscode des Grades n, BIP-n, B(x) = X6 + 1 verknüpft wird;
    (b) Erzeugen einer ersten Prüfbitfolge (200) durch die Exklusiv-ODER-Verknüpfung von Datenbits eines ersten Datenworts gemäß dem kombinierten Code aus Schritt (a);
    (c) Anhängen (201) der ersten Prüfbitfolge an das erste Datenwort;
    (d) Verwürfeln (202) des Ergebnisses aus Schritt (c) im Quellknoten;
    (e) Übertragen (203) des Ergebnisses aus Schritt (d) über eine Datenübertragungsleitung vom Quellknoten an einen Zielknoten;
    (f) Entwürfeln des übertragenen Datenworts im Zielknoten und Trennen (204) der ersten Prüfbitfolge von dem übertragenen Ergebnis aus Schritt (e) sowie lokales Speichern dieser Folge im Zielknoten;
    (g) Erzeugen einer zweiten Prüfbitfolge auf der Grundlage des übertragenen Datenworts;
    (h) bitweises Vergleichen (205) der in Schritt (f) gespeicherten ersten Prüfbitfolge mit der in Schritt (g) erzeugten zweiten Prüfbitfolge, um ein Syndrom zu erzeugen, wobei das Syndrom in Gestalt eines ersten Codieralgorithmus-Syndroms vorliegt, der mit einem zweiten Codieralgorithmus-Syndrom verkettet ist;
    (i) Ermitteln, ob das empfangene Datenwort einen ersten Bitfehler enthält; und
    (j) Korrigieren (211) des ersten Bitfehlers anhand des ersten Codieralgorithmus-Syndroms und eines ersten und zweiten replizierten Bitfehlers anhand des zweiten Codieralgorithmus-Syndroms.
  2. Verfahren nach Anspruch 1, das des Weiteren das Darstellen einer Vielzahl von codierten Datenwörtern in einer ersten Matrix umfasst, wobei eine Vielzahl von Prüfbitfolgen, die einem jeden aus der Vielzahl von Datenwörtern entsprechen, an die erste Matrix angehängt wird.
  3. Verfahren nach Anspruch 1, das des Weiteren das Anhängen einer Prüfbitfolge an ein jedes aus einer entsprechenden Vielzahl von codierten Datenwörtern umfasst.
  4. Verfahren nach Anspruch 1, das des Weiteren das Verketten einer Vielzahl von Datenwörtern und das Bereitstellen einer einzelnen Prüfbitfolge zur Fehlerkorrektur umfasst.
  5. Verfahren nach Anspruch 1, wobei die Datenübertragungsleitung einen Mehrfachleitungs-Datenübertragungskanal umfasst, der zum inversen Multiplexen in der Lage ist.
  6. Verfahren nach Anspruch 1, wobei der Verwürfelungsschritt weiterhin das Bereitstellen eines 64B/66B-Verwürfelungsprotokolls umfasst.
  7. Verfahren nach Anspruch 1, wobei der Hamming-Code die maximale Länge der Paketgröße einschließlich Fehlerkorrektur- und Paritätsbits bestimmt.
  8. Verfahren nach Anspruch 1, wobei das digitale Datenübertragungssystem einen paketierten Datenstrom in einem ATM-Format sendet und empfängt.
  9. Verfahren nach Anspruch 1, wobei die Datenübertragungsleitung eine einzige Serialisierer-/Deserialisierer-Leitung umfasst.
  10. Verfahren nach Anspruch 3, das des Weiteren das Erzeugen einer H-Matrix in systematischer Form umfasst, um die Prüfbitfolge und ein Fehlersyndrom zu codieren, wobei die Verwendung derselben H-Matrix in nichtsystematischer Form das Decodieren des Fehlersyndroms ermöglicht.
  11. Verfahren nach Anspruch 1, wobei die Reihenfolge des Hamming-Codes m und des BIP-n-Codes so ausgewählt wird, dass das kleinstwertige n eines BIP-n-Codes, das gleichzeitig zu dem Fehlerverbreitungsmuster des Verwürflers passt, ausgewählt wird, was erstmalig eindeutige Restwerte bereitstellt, und wobei auf der Grundlage der Gesamtzahl von Bits, die für die Fehlerkorrekturcode-Prüfbits für eine gegebene Systemkonfiguration vorgesehen sein können, der Grad des Hamming-Codes als m - n berechnet wird.
  12. Verfahren nach Anspruch 1, wobei der BIP-n-Code die Anzahl von Fehlern angibt, die in dem übertragenen Datenwort vorhanden sind, und wobei der Hamming-Code die Position von einem oder mehreren zu korrigierenden Fehlern angibt.
  13. Computerprogrammprodukt, das Befehle für das Ausführen aller Schritte des Verfahrens gemäß einem beliebigen vorangegangenen Verfahrensanspruch umfasst, wenn das Computerprogramm auf einem Computersystem ausgeführt wird.
EP07821012A 2006-11-03 2007-10-08 Vorwärtsfehlerkorrekturcodierung für mit 64b/66b-verwürfelung kompatible mehrstreckenübertragung Active EP2095557B1 (de)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US11/556,240 US7996747B2 (en) 2006-11-03 2006-11-03 Forward error correction encoding for multiple link transmission compatible with 64B/66B scrambling
PCT/EP2007/060639 WO2008052858A2 (en) 2006-11-03 2007-10-08 Forward error correction encoding for multiple link transmission compatible with 64b/66b scrambling

Publications (2)

Publication Number Publication Date
EP2095557A2 EP2095557A2 (de) 2009-09-02
EP2095557B1 true EP2095557B1 (de) 2010-08-18

Family

ID=39166655

Family Applications (1)

Application Number Title Priority Date Filing Date
EP07821012A Active EP2095557B1 (de) 2006-11-03 2007-10-08 Vorwärtsfehlerkorrekturcodierung für mit 64b/66b-verwürfelung kompatible mehrstreckenübertragung

Country Status (9)

Country Link
US (1) US7996747B2 (de)
EP (1) EP2095557B1 (de)
JP (1) JP5106538B2 (de)
KR (1) KR101104033B1 (de)
CN (1) CN101529775B (de)
AT (1) ATE478486T1 (de)
DE (1) DE602007008612D1 (de)
TW (1) TW200835213A (de)
WO (1) WO2008052858A2 (de)

Families Citing this family (56)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
TW200812819A (en) * 2006-09-15 2008-03-16 Inventec Appliances Corp Method of converting word codes
US8108759B2 (en) * 2006-12-14 2012-01-31 Regents Of The University Of Minnesota Error detection and correction using error pattern correcting codes
FR2918828B1 (fr) * 2007-07-13 2009-09-18 Wavecom Sa Procede de detection du brouillage d'un reseau de radiocommunication, produit programme d'ordinateur, moyen de stockage et circuit correspondants
US8250450B2 (en) * 2007-08-31 2012-08-21 Ambriel Technologies, LLC. Method and system for using redundancy to exchange data in a multicast or one way environment
US10805840B2 (en) 2008-07-03 2020-10-13 Silver Peak Systems, Inc. Data transmission via a virtual wide area network overlay
US10164861B2 (en) 2015-12-28 2018-12-25 Silver Peak Systems, Inc. Dynamic monitoring and visualization for network health characteristics
US8261165B2 (en) * 2008-11-14 2012-09-04 Silicon Laboratories Inc. Multi-syndrome error correction circuit
JP5256076B2 (ja) * 2009-02-27 2013-08-07 アンリツ株式会社 ６４ｂ／６６ｂ符号化試験装置
TWI467977B (zh) * 2009-11-13 2015-01-01 Panasonic Ip Corp America Encoding method, decoding method, encoder and decoder
US8705633B2 (en) * 2010-07-28 2014-04-22 Omron Management Center Of America, Inc. Method and apparatus for transporting an 8B/10B coded video stream across a 64B/66B coded link
US8539321B2 (en) 2010-11-10 2013-09-17 Infineon Technologies Ag Apparatus and method for correcting at least one bit error within a coded bit sequence
US8751565B1 (en) 2011-02-08 2014-06-10 Google Inc. Components for web-based configurable pipeline media processing
US8681866B1 (en) 2011-04-28 2014-03-25 Google Inc. Method and apparatus for encoding video by downsampling frame resolution
US9106787B1 (en) 2011-05-09 2015-08-11 Google Inc. Apparatus and method for media transmission bandwidth control using bandwidth estimation
US8661323B2 (en) * 2011-05-09 2014-02-25 Google Inc. Method and apparatus for generating packet mask
WO2012166100A1 (en) * 2011-05-27 2012-12-06 Halliburton Energy Services, Inc. Downhole communication applications
US9778389B2 (en) 2011-05-27 2017-10-03 Halliburton Energy Services, Inc. Communication applications
US8856624B1 (en) 2011-10-27 2014-10-07 Google Inc. Method and apparatus for dynamically generating error correction
US9490850B1 (en) 2011-11-28 2016-11-08 Google Inc. Method and apparatus for decoding packetized data
US8914706B2 (en) 2011-12-30 2014-12-16 Streamscale, Inc. Using parity data for concurrent data authentication, correction, compression, and encryption
US8683296B2 (en) 2011-12-30 2014-03-25 Streamscale, Inc. Accelerated erasure coding system and method
CN103199953B (zh) * 2012-01-09 2016-03-30 华为技术有限公司 数据传输方法和装置、通信设备
US9185429B1 (en) 2012-04-30 2015-11-10 Google Inc. Video encoding and decoding using un-equal error protection
US8898526B1 (en) * 2012-07-23 2014-11-25 Google Inc. Using forward error correction coding to diagnose communication links
US10034023B1 (en) 2012-07-30 2018-07-24 Google Llc Extended protection of digital video streams
US9172740B1 (en) 2013-01-15 2015-10-27 Google Inc. Adjustable buffer remote access
US9311692B1 (en) 2013-01-25 2016-04-12 Google Inc. Scalable buffer remote access
US9225979B1 (en) 2013-01-30 2015-12-29 Google Inc. Remote access encoding
US10587437B2 (en) * 2013-06-10 2020-03-10 Texas Instruments Incorporated Link aggregator with universal packet scrambler apparatus and method
US10372527B2 (en) * 2013-07-15 2019-08-06 Intel Corporation Method of encoding data
CN104426631B (zh) * 2013-09-06 2018-03-06 华为技术有限公司 对数据进行处理的方法及装置
KR101595298B1 (ko) * 2014-04-30 2016-02-18 전자부품연구원 이동형 자기장 통신 방법
US9948496B1 (en) 2014-07-30 2018-04-17 Silver Peak Systems, Inc. Determining a transit appliance for data traffic to a software service
US9875344B1 (en) 2014-09-05 2018-01-23 Silver Peak Systems, Inc. Dynamic monitoring and authorization of an optimization device
US9647688B1 (en) * 2014-12-19 2017-05-09 Cadence Design Systems, Inc. System and method of encoding in a serializer/deserializer
TWI589892B (zh) * 2015-04-22 2017-07-01 威盛電子股份有限公司 傳輸介面晶片以及內建式傳輸介面晶片測試方法
US9702933B1 (en) 2015-10-22 2017-07-11 Cadence Design Systems, Inc. System and method for concurrent interconnection diagnostics field
US9697324B1 (en) 2015-11-05 2017-07-04 Cadence Design Systems, Inc. System for concurrent target diagnostics field
CN105516288B (zh) * 2015-12-01 2019-05-21 盛科网络（苏州）有限公司 采用单根Serdes扩展物理接口的装置、其控制方法及控制系统
US9967056B1 (en) * 2016-08-19 2018-05-08 Silver Peak Systems, Inc. Forward packet recovery with constrained overhead
US10771394B2 (en) 2017-02-06 2020-09-08 Silver Peak Systems, Inc. Multi-level learning for classifying traffic flows on a first packet from DNS data
US10892978B2 (en) 2017-02-06 2021-01-12 Silver Peak Systems, Inc. Multi-level learning for classifying traffic flows from first packet data
US11044202B2 (en) 2017-02-06 2021-06-22 Silver Peak Systems, Inc. Multi-level learning for predicting and classifying traffic flows from first packet data
US10552260B2 (en) * 2017-06-12 2020-02-04 Cirrus Logic, Inc. Detection of double bit errors and correction of single bit errors in a multiword array
CN109428674B (zh) * 2017-08-30 2022-04-15 深圳市中兴微电子技术有限公司 数据传输方法、装置和系统、接收端及存储介质
US11212210B2 (en) 2017-09-21 2021-12-28 Silver Peak Systems, Inc. Selective route exporting using source type
DE102017223776A1 (de) * 2017-12-22 2019-06-27 Robert Bosch Gmbh Teilnehmerstation für ein serielles Kommunikationsnetzwerk und Verfahren zur Korrektur von Einzelfehlern in einer Nachricht eines seriellen Kommunikationsnetzwerks
KR102471492B1 (ko) 2017-12-27 2022-11-28 삼성전자 주식회사 디스플레이장치 및 그 제어방법
CN108268417B (zh) * 2018-01-22 2021-03-30 成都天诚慧芯科技有限公司 一种数据加、解扰电路及方法
US10637721B2 (en) 2018-03-12 2020-04-28 Silver Peak Systems, Inc. Detecting path break conditions while minimizing network overhead
CN110519004B (zh) * 2018-05-21 2021-12-14 华为技术有限公司 一种编码方法及相关设备
CN108923884B (zh) * 2018-06-14 2021-02-23 中国科学院上海高等研究院 一种pcs评估系统、方法、可读存储介质及终端
DE112019005685T5 (de) 2018-11-14 2021-09-09 Skywave Networks Llc Kommunikationssystem und verfahren zur verwendung von nachrichten mit variabler länge
CN112543080A (zh) * 2019-09-20 2021-03-23 华为技术有限公司 误码率检测的方法和装置
US11789807B1 (en) 2021-03-30 2023-10-17 Amazon Technologies, Inc. Autonomous management of communication links
US11909850B1 (en) * 2021-06-23 2024-02-20 Amazon Technologies, Inc. Dynamic improvement of a communication channel

Family Cites Families (14)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6349138B1 (en) * 1996-06-14 2002-02-19 Lucent Technologies Inc. Method and apparatus for digital transmission incorporating scrambling and forward error correction while preventing bit error spreading associated with descrambling
US6240444B1 (en) 1996-09-27 2001-05-29 International Business Machines Corporation Internet web page sharing
US5983383A (en) * 1997-01-17 1999-11-09 Qualcom Incorporated Method and apparatus for transmitting and receiving concatenated code data
US5923680A (en) * 1997-06-05 1999-07-13 Northern Telecom Limited Error correction in a digital transmission system
US6683855B1 (en) * 1998-08-31 2004-01-27 Lucent Technologies Inc. Forward error correction for high speed optical transmission systems
JP3573988B2 (ja) * 1998-12-28 2004-10-06 富士通株式会社 誤り訂正方法及び伝送装置
US6975694B1 (en) * 1999-12-15 2005-12-13 Paradyne Corporation Digital subscriber line driver
US6738935B1 (en) * 2000-02-07 2004-05-18 3Com Corporation Coding sublayer for multi-channel media with error correction
US6715124B1 (en) * 2000-02-14 2004-03-30 Paradyne Corporation Trellis interleaver and feedback precoder
WO2001061909A1 (en) 2000-02-16 2001-08-23 Sycamore Networks, Inc. Method and apparatus for correcting data using a redundant path
JP3668673B2 (ja) * 2000-06-09 2005-07-06 株式会社日立コミュニケーションテクノロジー エラー訂正符号の構成方法、復号方法、伝送装置、ネットワーク
US7284184B2 (en) * 2003-01-30 2007-10-16 International Business Machines Corporation Forward error correction scheme compatible with the bit error spreading of a scrambler
US7570643B2 (en) * 2003-02-12 2009-08-04 Cisco Technology, Inc. Efficient framing procedure for variable length packets
US7257759B2 (en) * 2004-08-19 2007-08-14 Alcatel Lucent Accounting for error carryover in error correction on M-bit encoded links

Also Published As

Publication number Publication date
CN101529775B (zh) 2013-04-17
WO2008052858B1 (en) 2008-07-31
KR20090085627A (ko) 2009-08-07
CN101529775A (zh) 2009-09-09
TW200835213A (en) 2008-08-16
WO2008052858A3 (en) 2008-06-19
US20080109707A1 (en) 2008-05-08
JP2010508742A (ja) 2010-03-18
JP5106538B2 (ja) 2012-12-26
WO2008052858A2 (en) 2008-05-08
US7996747B2 (en) 2011-08-09
DE602007008612D1 (de) 2010-09-30
ATE478486T1 (de) 2010-09-15
KR101104033B1 (ko) 2012-01-09
EP2095557A2 (de) 2009-09-02

Similar Documents

Publication Publication Date Title
EP2095557B1 (de) Vorwärtsfehlerkorrekturcodierung für mit 64b/66b-verwürfelung kompatible mehrstreckenübertragung
US8055984B2 (en) Forward error correction scheme compatible with the bit error spreading of a scrambler
US7076724B2 (en) System and method for forward error correction
CA3193957C (en) Forward error correction with compression coding
US10721020B2 (en) Parity frame
US20040064782A1 (en) Reduced latency interleaver utilizing shortened first codeword
CN101765977A (zh) 编码装置和解码装置
US20050257113A1 (en) Cyclic redundancy check circuit for use with self-synchronous scramblers
WO2009036549A1 (en) Forward error correction codec using bch (3896, 3824) code and bch (2040, 1952) code
US7289530B1 (en) System and method for coding a digital wrapper frame
US8020077B1 (en) Forward error correction with self-synchronous scramblers
Chaudhary et al. Error control techniques and their applications
JP7199474B2 (ja) 符号化装置、送信機、復号装置および受信機
Di The evaluation and application of forward error coding
Chaudhary Implementation of a Novel Approach of Orthogonal Codes for Error Detection and Correction
Newton et al. Concatenated coding for digital satellite HDTV broadcasting

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

AK Designated contracting states

Kind code of ref document: A2

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

17Q First examination report despatched

Effective date: 20091127

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

GRAC Information related to communication of intention to grant a patent modified

Free format text: ORIGINAL CODE: EPIDOSCIGR1

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): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IS IT LI LT LU LV MC MT NL PL PT RO SE SI SK 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: NV

Representative=s name: IBM RESEARCH GMBH ZURICH RESEARCH LABORATORY INTEL

Ref country code: CH

Ref legal event code: EP

REG Reference to a national code

Ref country code: IE

Ref legal event code: FG4D

REG Reference to a national code

Ref country code: GB

Ref legal event code: 746

Effective date: 20100906

REF Corresponds to:

Ref document number: 602007008612

Country of ref document: DE

Date of ref document: 20100930

Kind code of ref document: P

REG Reference to a national code

Ref country code: NL

Ref legal event code: VDEP

Effective date: 20100818

LTIE Lt: invalidation of european patent or patent extension

Effective date: 20100818

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Ref country code: MC

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

Effective date: 20101031

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

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

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

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

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

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

26N No opposition filed

Effective date: 20110519

REG Reference to a national code

Ref country code: DE

Ref legal event code: R097

Ref document number: 602007008612

Country of ref document: DE

Effective date: 20110519

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

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

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

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

Effective date: 20111031

Ref country code: LI

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

Effective date: 20111031

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 NON-PAYMENT OF DUE FEES

Effective date: 20101008

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

Effective date: 20110219

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

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

REG Reference to a national code

Ref country code: FR

Ref legal event code: PLFP

Year of fee payment: 9

REG Reference to a national code

Ref country code: FR

Ref legal event code: PLFP

Year of fee payment: 10

REG Reference to a national code

Ref country code: FR

Ref legal event code: PLFP

Year of fee payment: 11

REG Reference to a national code

Ref country code: FR

Ref legal event code: PLFP

Year of fee payment: 12

REG Reference to a national code

Ref country code: DE

Ref legal event code: R082

Ref document number: 602007008612

Country of ref document: DE

Representative=s name: KUISMA, SIRPA, FI

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

Ref country code: DE

Payment date: 20220928

Year of fee payment: 16

P01 Opt-out of the competence of the unified patent court (upc) registered

Effective date: 20230423

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

Ref country code: GB

Payment date: 20231027

Year of fee payment: 17

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

Ref country code: FR

Payment date: 20231009

Year of fee payment: 17