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/27—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes using interleaving techniques
  • H03M13/2792—Interleaver wherein interleaving is performed jointly with another technique such as puncturing, multiplexing or routing
• • 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/15—Cyclic codes, i.e. cyclic shifts of codewords produce other codewords, e.g. codes defined by a generator polynomial, Bose-Chaudhuri-Hocquenghem [BCH] 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
  • H03M13/2703—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes using interleaving techniques the interleaver involving at least two directions
  • H03M13/2721—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes using interleaving techniques the interleaver involving at least two directions the interleaver involves a diagonal direction, e.g. by using an interleaving matrix with read-out in a diagonal direction
• • H—ELECTRICITY
  • H03—ELECTRONIC CIRCUITRY
  • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
  • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
  • H03M13/27—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes using interleaving techniques
  • H03M13/2732—Convolutional interleaver; Interleavers using shift-registers or delay lines like, e.g. Ramsey type interleaver
• • H—ELECTRICITY
  • H03—ELECTRONIC CIRCUITRY
  • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
  • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
  • H03M13/27—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes using interleaving techniques
  • H03M13/2757—Interleaver with an interleaving rule not provided for in the subgroups H03M13/2703 - H03M13/2753
• • 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
• • H—ELECTRICITY
  • H03—ELECTRONIC CIRCUITRY
  • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
  • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
  • H03M13/37—Decoding methods or techniques, not specific to the particular type of coding provided for in groups H03M13/03 - H03M13/35
  • H03M13/3746—Decoding methods or techniques, not specific to the particular type of coding provided for in groups H03M13/03 - H03M13/35 with iterative decoding
• • 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/6561—Parallelized implementations
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
  • H04L1/00—Arrangements for detecting or preventing errors in the information received
  • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
  • H04L1/0041—Arrangements at the transmitter end
• • H—ELECTRICITY
  • 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/15—Cyclic codes, i.e. cyclic shifts of codewords produce other codewords, e.g. codes defined by a generator polynomial, Bose-Chaudhuri-Hocquenghem [BCH] codes
  • H03M13/151—Cyclic codes, i.e. cyclic shifts of codewords produce other codewords, e.g. codes defined by a generator polynomial, Bose-Chaudhuri-Hocquenghem [BCH] codes using error location or error correction polynomials
  • H03M13/152—Bose-Chaudhuri-Hocquenghem [BCH] codes

Definitions

• the present invention relates generally to forward error correction, and more particularly to forward error correction using a continuously interleaved code.
• Communication systems often provide large amounts of information over communication channels.
• the communication channels may, for example, make use of fiber optic links, wires, radio waves, storage mediums.
• Communication channels generally insert noise into signals communicated over the communication channels, that is a signal received by a receiver over a communication channel may not be the same as the signal as transmitted by a transmitter.
• both the transmitter and the receiver may also insert noise into signals being transmitted or received.
• redundant information is often included in transmitted data, with the redundant information allowing a receiver to determine information intended to have been transmitted.
• a number of coding schemes are known for determining the redundant information to be included with transmitted data. Prior to transmission the coding schemes generally convert information symbols or blocks of information symbols into code symbols or blocks of code symbols, and after reception the code symbols or blocks of code symbols are used to recover the information symbols or blocks of information symbols. Selection of a particular coding scheme, and a particular code used in a particular coding scheme, may depend on a variety of factors, including a desired bit error rate (BER), overhead associated with a particular coding scheme and code, ease of encoding and decoding, and other factors.
• BER bit error rate
• the invention provides for use of a continuously interleaved code.
• the invention provides a method of encoding data for transmission over a communication medium, comprising: iteratively forming codewords, each codeword having n symbols and each codeword formed using k symbols, with each codeword formed using at least some symbols of previously formed codewords.
• the invention provides a method of forming codewords with error correction information, comprising: forming a codeword of n bits using k bits, the codeword including n-k parity bits, each of the n bits being in at least one other codeword of n bits, at least some of the k bits being parity bits of other codewords.
• the invention provides a method of decoding received information to correct for errors in communication of the received information, comprising: receiving a stream of information, the information comprised of bits; iteratively decoding codewords of the received stream of information, each bit of each codeword being in at least two codewords, with some of the bits of any particular codeword of the codewords being in a codeword whose last bit was received prior to receipt of the particular codeword, and with others of the bits of any particular codeword received subsequent to receipt of the last bit of the particular codeword.
• the invention provides a method of decoding information arranged in subframes, each subframe including 32640 bits, each subframe including a final 510 bits of 64 codewords of a BCH (1020,988) code, with a first 510 bits of the 64 codewords spread over 8 other subframes, each of which also a final 510 bits of 64 other codewords of a BCH (1020,988) code, comprising decoding codewords which terminate in a particular subframe, correcting bits of the codewords pursuant to the decoding, including bits which are in other subframes and other codewords, and decoding the other codewords.
• FIG. 1 is a block diagram of a communication system in accordance with aspects of the invention.
• FIG. 2 is a diagram showing codewords in a transmission stream in accordance with aspects of the invention.
• FIG. 3 is a further diagram showing codewords in a transmission stream in accordance with aspects of the invention.
• FIG. 4 is a yet a further diagram showing codewords in a transmission stream in accordance with aspects of the invention.
• FIG. 5 is a block diagram including an encoder in accordance with aspects of the invention.
• FIG. 6 is a further block diagram including a plurality of encoders in accordance with aspects of the invention.
• FIG. 7 is a block diagram including a decoder in accordance with aspects of the invention.
• FIG. 8 is a diagram showing a plurality of subframes in accordance with aspects of the invention.
• FIG. 9 is a diagram showing bit mappings of a codeword to subframes in accordance with aspects of the invention.
• FIG. 10 is a diagram showing bit mappings of selected bits of a subframe to codewords in accordance with aspects of the invention.
• FIG. 1 is a block diagram of a communication system in accordance with aspects of the invention.
• a data source 111 provides data intended for transmission.
• the data is received by an encoder 113.
• the encoder encodes the data to form codewords.
• Information of the codewords is transmitted by a transmitter 115 over a communications medium 117.
• the encoder and the transmitter are both provided by circuitry, for example in a single semiconductor device or chip or in multiple semiconductor devices or chips.
• the encoder and/or the transmitter may be provided by a programmable processor, with the processor programmed by instructions to provide encoding and/or transmission functions.
• the communication medium is a fiber optic line. In various embodiments, however, the communication medium may be a wire, a storage medium, or an airwave communication channel.
• a receiver 119 receives information from the communication medium.
• the received information will generally be the transmitted information, potentially altered by noise of the communication medium.
• a decoder decodes codewords of the received information to recover the data intended for transmission, and provides the recovered data to a data sink 123.
• the receiver and the decoder may each be a separate semiconductor device or combined in a single semiconductor device, or may be implemented as part of a programmable processor programmed by instructions.
• the transmitter side and the receiver side as illustrated in FIG. 1 will each be a node in a network and have at least one transmitter and at least one receiver to provide for bidirectional communication between the two nodes, and will have further transmitters and receivers for communicating with further nodes.
• the data intended for transmission is encoded by the encoder to form continuously interleaved codewords.
• the continuously interleaved codewords share symbols with previously formed codewords and subsequently formed codewords.
• the continuously interleaved codewords may each be formed by encoding at least some symbols of previously determined codewords and additional symbols, preferably with each symbol in each codeword being part of at least two codewords.
• a continuously interleaved n bit codeword may be formed of k bits, with at least some of the k bits being data bits of other codewords and at least some of the k bits being parity bits of other codewords.
• an initial first number of codewords may include padded symbols, for example zero symbols, for some of the symbols used in encoding, until a sufficient number of codewords have been formed to provide symbols for use in forming subsequent codewords.
• a codeword may include k symbols, of which k/2 symbols used in forming the codeword are symbols shared with previously formed codewords.
• codewords for example including a number of codewords several orders of magnitude greater than k, after an initial k/2- 1 codewords, codewords share k/2 symbols with previously formed codewords.
• a first number of codewords may only share symbols with subsequent codewords
• a second number of codewords which may be the same number as the first number of codewords, may only share symbols with prior codewords.
• the number of codewords successively communicated by the communication system is many times greater than the first number or the second number, and in many embodiments the number of codewords successively communicated by the communication system is several orders of magnitude, for example 3 or more, or 10 or more, or 100 or more, greater than the first number or the second number.
• two nodes in a long haul telecommunications network particularly two nodes coupled by a submarine cable, often continuously communicate successive codewords for hours or days or longer, and often at gigahertz bit rates. Accordingly, impact on coding and decoding of codewords approximate a beginning and approximate an end of communication of a stream of codewords is generally small and may be discounted.
• FIG. 2 is a diagram providing an example of continuously interleaved codewords in accordance with aspects of the invention.
• a stream of data bits d are provided for encoding, with an encoder determining parity bits p for a codeword of 12 bits.
• the stream of bits are within a longer stream of bits, with the stream of bits forming some contiguous portion of the longer stream of bits.
• the bits are arranged in rows and columns, with each descending row offset to the right by one column.
• each row has the same number of bits and, for the particular example of FIG. 2, each column also has the same number of bits (for the columns with bits completely shown in FIG.
• a particular codeword x includes, in this example of FIG. 2, 2 parity bits, with the encoder determining the 2 parity bits by encoding 2 parity bits from previously determined codewords, 4 data bits which are also part of previously determined codewords, and 4 additional data bits. As shown in FIG. 2, the 2 parity bits from previously determined codewords and the 4 data bits which are also part of previously determined codewords are found in a column adjacent and to the left of a first column of a row including the 4 additional data bits and, after encoding, the 2 parity bits.
• the previously determined codewords are transmitted or are ready for transmission or are in the process of transmission prior to encoding or completing encoding of the particular codeword.
• the row including the 4 additional bits and the 2 parity bits may be considered to be a terminating row for the particular codeword x.
• the bits of the terminating row are provided to a transmitter for transmission, as well as temporarily stored for determination of further codewords.
• a subsequent codeword x+1 which terminates in a row immediately following the row terminating codeword x, also includes 2 parity bits, with the encoder determining the 2 parity bits by encoding 2 parity bits from other previously determined codewords, 4 data bits which are also part of previously determined codewords (with one of the data bits being one of the 4 additional data bits of codeword x), and 4 further additional data bits.
• the encoder determines the parity bits by encoding 2 parity bits from yet further previously determined codewords, 4 data bits which are also part of previously determined codewords (with one of the data bits being one of the 4 additional data bits of codeword x and with one of the data bits being one of the 4 additional data bits of codeword x+1), and 4 additional data bits.
• codeword x may be decoded. It is possible, however, that codeword x may have a greater number of errors than may be corrected by the particular coding scheme used. In such an instance it is possible that codeword x+1 may be successfully decoded and errors in codeword x+1 corrected. Among the corrected errors in codeword x+1 may be the bit shared by codeword x and codeword x+1, and which may therefore allow for correction of codeword x by reducing the number of errors in codeword x to a number correctable by the particular coding scheme.
• correction of codeword x+1 may result in correction of bits of other codewords, which may have been uncorrectable, and which also may share bits with codeword x.
• codeword x+2 which also shares a bit with codeword x.
• correction of codewords which do not share bits with codeword x may allow for correction of codewords which share bits with codeword x, or allows for correction of codewords which share bits with codewords which share bits with codeword x, and so on.
• FIG. 3 is a diagram providing a further example of interleaved codewords in accordance with aspects of the invention.
• the interleaved codewords of FIG. 3 are arranged similarly to the interleaved codewords of FIG. 2.
• the interleaved codewords of FIG. 3 include an unspecified number of data bits and parity bits.
• the interleaved codewords of FIG. 3 may, for example, include 988 bits used to form 32 parity bits (as in for example a BCH (1020,988) code), with some of the 988 bits being data bits and some of the 988 bits being parity pits determined by forming other codewords.
• the interleaved codewords of FIG. 3 may instead include some other number of bits used to form codewords for some other code.
• FIG. 4 is a diagram providing yet a further example of interleaved codewords in accordance with aspects of the invention.
• the interleaved codewords of FIG. 4 are arranged in a manner somewhat similar to the codewords of FIGs. 2 and 3, but in the diagram of FIG. 4 every other descending row is offset to the right by one column.
• each column of bits is included in two codewords, with the result that most bits are in 3 different codewords.
• different coverage of bits by codewords may be obtained.
• FIG. 5 is a block diagram including an encoder in accordance with aspects of the invention.
• an encoder 511 receives information and forms the information into codewords.
• the codewords are provided to further circuitry (not shown) which implements, for example transmission functions.
• the encoder may be implemented, for example, as a programmable processor or as discrete circuitry, for example using a linear feedback shift register implementing encoding for a particular code.
• the encoder performs encoding for a BCH code, for example a BCH (1020,988) code, and in some embodiments encoding is performed using a generator polynomial of (x 10 + x 3 + 1) (x 10 + x 3 + x 2 + x + 1) (x 10 + x 5 + x 3 + x 2 + l)(x 2 + 1).
• the codewords are also provided to a memory 513.
• the memory may be implemented within the encoder 511, but is shown as a separate memory block in FIG. 5.
• the codewords are stored in memory.
• the encoder subsequently forms further codewords using some of the symbols, generally bits, of previously formed codewords, for example as discussed with respect to FIGs. 2-4.
• FIG. 6 is a block diagram including a plurality of encoders 61 la-n in accordance with aspects of the invention.
• a plurality of codewords may be formed in parallel, with a multiplexer 615 or other circuitry combining the parallel codewords or portions of codewords into a single stream, in some embodiments in an interleaved manner.
• a predefined number of bits may be generated each clock cycle, for example 1 bit or some other number of bits may be generated each clock cycle.
• the predefined number of bits may be provided to a memory 613, with the bits thereafter used to form further codewords.
• bits from a first encoder 611a may be provided to the memory, and then fed into encoder 611b, or more generally 611b-n in a round robin manner, along with further bits intended for transmission, to form further codewords or portions of codewords.
• FIG. 7 is a block diagram including a decoder in accordance with aspects of the invention.
• the input data stream comprises received words, which are code words modified by error signals such as provided by noise.
• the received words are provided to memory 711 and the memory stores the received words.
• the received words are provided to a decoder.
• the decoder includes syndrome generator 713, a key equation solver 715, and an error location and magnitude block 717, and an error correction block 719.
• the syndrome generator generates syndrome words that are provided to the key equation solver and the error location and magnitude block.
• the key equation solver generates an error polynomial which is also provided to the error location and magnitude unit.
• the error location and magnitude block generates an error vector, which is provided to the error correction block.
• the error correction block corrects provides corrected data.
• the corrected data is provided back to the memory for further rounds of decoding and, generally upon a fixed number of corrections, outputs corrected words.
• the corrected data may also be provided to the syndrome generator, or memory associated with the syndrome generator, for use in modifying syndromes.
• the corrected data is provided to the memory, and overwrites or otherwise replaces previously stored uncorrected data.
• codeword x may have contained y errors prior to correction.
• the corrected data for codeword x contains fewer than y errors, and so the corrected data is written in place of the uncorrected data.
• other previously uncorrectable codewords sharing bits with codeword x may now have a sufficient number of correct bits such that the previously uncorrectable codewords may be corrected.
• still other previously uncorrectable codewords which share bits with the previously uncorrectable codewords may now be corrected. Accordingly, codewords may be iteratively decoded.
• FIG. 8 shows an example of a series of subframes, numbered 0 to n, in a framed data communication system in accordance with the invention.
• the subframes may be, for example, subframes in compliance with ITU-T Recommendation G.975 or proposals for further revisions of ITU-T Recommendation G.975.
• a subframe is identified by an integer, with a lower integer indicating a more recently transmitted or received subframe. Accordingly, as illustrated in FIG. 8, subframe 0 is the most recently transmitted or received subframe, subframe 1 is the next most recently transmitted or received subframe, and so on.
• the communication system uses continuously interleaved BCH (1020,988) codewords.
• the BCH (1020,988) codeword includes 988 data bits and 32 parity bits, for a total of 1020 bits.
• the communication system organizes information into subframes of 32640 bits. Each subframe includes a final 510 bits of each of 64 codewords.
• the final 510 bits of the 64 codewords include 32 parity bits, for a total 2048 bits for 64 codewords, and the parity bits may therefore be conveniently placed in the 2048 bit locations for parity bits in the subframe.
• bitwise interleaving of bits from the 64 codewords during a transmission process may ease processing of the communication system in arranging for the final 2048 bits of the subframe to include the parity bits of the 64 codewords.
• 8 previously received subframes contain the first 510 bits of each of the 64 codewords, with preferably each of the 8 previously received subframes containing 64 or 63 bits of each of the 64 codewords.
• the previously received subframes also include the final 510 bits of 64 other codewords, thus the first 510 bits of the 64 codewords in the 8 previously received subframes are also in the codewords terminating in these subframes.
• the final 510 bits of the 64 codewords are also part of codewords received in the next 8 subframes, the final 510 bits of each of the 64 codewords are also in codewords terminating in those subframes.
• FIG. 9 is a diagram showing bit mappings of a codeword across subframes.
• a codeword includes 1020 bits.
• a final 510 bits of the codeword are in a subframe 0.
• a first set of 64 bits preceding the final 510 bits are in a subframe 1.
• a second set of 64 bits preceding the first set of 64 bits are in a subframe 2.
• a third set of 64 bits preceding the second set of 64 bits are in a subframe 3.
• a fourth set of 64 bits preceding the third set of 64 bits are in a subframe 4.
• a fifth set of 64 bits preceding the fourth set of 64 bits are in a subframe 5.
• a sixth set of 64 bits preceding the fifth set of 64 bits are in a subframe 6.
• a seventh set of 63 bits preceding the sixth set of 63 bits are in a subframe 7.
• An eighth set of 63 bits preceding the seventh set of 63 bits are in a subframe 8.
• bits of various codewords are also interleaved with another.
• each bit in a transmission may be assigned a unique identifier: ⁇ subframenum, bitloc[14:0]>, where subframenum is an integer which specifies a subframe and bitloc[14:0] specifies a bit position, within a 32640 bit subframe.
• subframenum is an integer which specifies a subframe
• bitloc[14:0] specifies a bit position, within a 32640 bit subframe.
• Lower subframenum integers indicate more recently transmitted subframes and within a subframe, 0 is the last bit transmitted in time, 1 is the next to last bit transmitted in time and so on.
• Each BCH(1020,988) codeword may be assigned a unique identifier: ⁇ subframenum, codenum[5:0]>, where subframenum is an integer which specifies the subframe that contains the last 510 bits of the codeword including the codeword's parity and codenum[5:0] specifies the codeword.
• Each bit within each BCH(1020,988) codeword may be assigned a unique identifier: ⁇ subframenum, codenum[5:0], bitnum[9:0]>, where bitnum[9:0] specifies the bit with the BCH(1020,988) codeword, where bit
• bit 0 is the last bit received in time
• bit 1 is the next to last bit received in time
• the location of codeword bits in a transmission stream may be determined as follows. For bitnum[9:0] between 0 and 509, the location of the codeword bits are in transmission stream ⁇ subframenum,
• Codeword bits 510, 511, 959, and 1023 are not transmitted and are 0 filled.
• Each bit in the transmission stream of the embodiment is in two code words: ⁇ G975num, bitloc[5:0], ⁇ l'bO, bitloc[14:6] ⁇ > and ⁇ G975num - bitloc[8:6] - 1, bitloc[5:0] ⁇ bitloc[14:9], ⁇ l'bl, bitloc[8:6], bitloc[14:9] ⁇ > with l'bO indicating 1 bit of 0 and l'bl indicating
• FIG. 10 is a diagram showing an example of mapping of selected bits in a subframe to codewords in accordance with the foregoing.
• a 32640 bit subframe includes a bit "A" at bit location 31.
• the subframe also includes a bit “B” at bit location 95.
• bit 31 "A” is at bit location 0 of codeword 31 terminating in subframe 7 and also at bit location 512 in codeword 31 terminating in subframe 6.
• bit 95 "B" of subframe 7 is in bit 1 in codeword 31 terminating in subframe 7 and bit 576 in codeword 31 terminating in subframe 5.

Landscapes

• Physics & Mathematics (AREA)
• Engineering & Computer Science (AREA)
• Probability & Statistics with Applications (AREA)
• Theoretical Computer Science (AREA)
• Mathematical Physics (AREA)
• Computer Networks & Wireless Communication (AREA)
• Algebra (AREA)
• General Physics & Mathematics (AREA)
• Pure & Applied Mathematics (AREA)
• Signal Processing (AREA)
• Error Detection And Correction (AREA)

Priority Applications (2)

Applications Claiming Priority (2)

Publications (2)

Family

ID=42166297

Family Applications (1)

Country Status (4)

Cited By (2)

Families Citing this family (13)

Family Cites Families (20)

• 2008
  • 2008-11-13 US US12/270,774 patent/US8276047B2/en active Active
• 2009
  • 2009-11-13 CN CN200980145537.4A patent/CN102308481B/zh active Active
  • 2009-11-13 EP EP09826845.1A patent/EP2351231B1/en active Active
  • 2009-11-13 CN CN201410088803.7A patent/CN103840915B/zh active Active
  • 2009-11-13 WO PCT/US2009/064416 patent/WO2010057011A2/en active Application Filing
• 2012
  • 2012-09-14 US US13/618,380 patent/US8887021B2/en active Active
• 2014
  • 2014-10-28 US US14/526,148 patent/US9130594B2/en active Active

Non-Patent Citations (2)

Also Published As

Similar Documents

Legal Events