WO2007132656A1 - 誤り訂正符号化方法及び装置 - Google Patents
誤り訂正符号化方法及び装置 Download PDFInfo
- Publication number
- WO2007132656A1 WO2007132656A1 PCT/JP2007/058972 JP2007058972W WO2007132656A1 WO 2007132656 A1 WO2007132656 A1 WO 2007132656A1 JP 2007058972 W JP2007058972 W JP 2007058972W WO 2007132656 A1 WO2007132656 A1 WO 2007132656A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- polynomial
- multiplication
- circuit
- bit
- length
- Prior art date
Links
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/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
-
- 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
- H03M13/1148—Structural properties of the code parity-check or generator matrix
- H03M13/1151—Algebraically constructed LDPC codes, e.g. LDPC codes derived from Euclidean geometries [EG-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/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
- H03M13/1148—Structural properties of the code parity-check or generator matrix
- H03M13/116—Quasi-cyclic LDPC [QC-LDPC] codes, i.e. the parity-check matrix being composed of permutation or circulant sub-matrices
-
- 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
- H03M13/1148—Structural properties of the code parity-check or generator matrix
- H03M13/116—Quasi-cyclic LDPC [QC-LDPC] codes, i.e. the parity-check matrix being composed of permutation or circulant sub-matrices
- H03M13/1162—Array based LDPC codes, e.g. array 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
- H03M13/1148—Structural properties of the code parity-check or generator matrix
- H03M13/116—Quasi-cyclic LDPC [QC-LDPC] codes, i.e. the parity-check matrix being composed of permutation or circulant sub-matrices
- H03M13/1168—Quasi-cyclic LDPC [QC-LDPC] codes, i.e. the parity-check matrix being composed of permutation or circulant sub-matrices wherein the sub-matrices have column and row weights greater than one, e.g. multi-diagonal sub-matrices
-
- 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/61—Aspects and characteristics of methods and arrangements for error correction or error detection, not provided for otherwise
- H03M13/611—Specific encoding aspects, e.g. encoding by means of 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/61—Aspects and characteristics of methods and arrangements for error correction or error detection, not provided for otherwise
- H03M13/615—Use of computational or mathematical techniques
- H03M13/617—Polynomial operations, e.g. operations related to generator polynomials or parity-check polynomials
-
- 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
-
- G—PHYSICS
- G11—INFORMATION STORAGE
- G11B—INFORMATION STORAGE BASED ON RELATIVE MOVEMENT BETWEEN RECORD CARRIER AND TRANSDUCER
- G11B20/00—Signal processing not specific to the method of recording or reproducing; Circuits therefor
- G11B20/10—Digital recording or reproducing
- G11B20/18—Error detection or correction; Testing, e.g. of drop-outs
Definitions
- the present invention relates to a block error correcting code method and an apparatus therefor, in which an information sequence is divided into blocks of a fixed length and a redundant sequence is independently added to each block, and in particular, a low-density nority.
- the present invention relates to an inspection (LDPC) encoding method and apparatus.
- the low-density parity check code scheme is a generic term for error correction codes having a feature that a check matrix is sparse rather than just showing one error correction coding scheme.
- a sparse check matrix means that most of the components (elements) in the check matrix are "0" and the number of components that are "1" is very small.
- the low density note check code is D. J. C. MacKay,
- Non-Patent Document 1 By using an iterative decoding method such as a product duct (sum-product) algorithm, it is possible to construct an error correction code method that has a very large coding gain close to the theoretical limit.
- a technical problem associated with the low-density parity check code is that the coding method, that is, the information bit sequence power, requires a large amount of calculation for the redundant bit sequence calculation method. It is. In the most typical coding device in which the generation of redundant bit sequences is the multiplication power of a matrix by a code generator matrix, the number of times proportional to the square of the code length is excluded in the generation of a low-density parity check code sequence. Logical OR operation is required.
- the code checker When the code checker is configured with a code check matrix, the generation of the low-density parity check code sequence is performed as follows.
- the parity check matrix is fundamentally transformed into the following form, which is realized by the fundamentally modified parity check matrix.
- Equation (2) Each bit p in the corresponding r-bit redundant bit string p 1, p 2,..., P is calculated by Equation (2).
- this r X k matrix A is held in a storage device such as a memory, and the number of exclusions equal to the number of values “1” in each component of the matrix A is excluded. Logical OR operation is required.
- FIG. 1 shows an example of the configuration of a code key apparatus in the related art that performs code keying using a low density parity check code.
- the encoding apparatus shown in the figure performs a code check using a low-density parity check code when an information bit string is given, and outputs a code bit string.
- This encoding device performs the operation of the above equation (2) on the information bit sequence to generate a redundant bit sequence, and holds the matrix A shown in equation (1).
- a matrix information storage memory 72 that supplies each component (element) of the sequence A to the redundant bit sequence calculation device 71 and an information bit sequence and redundant bit sequence calculation device 71 so that a sign bit sequence in which the information bit sequence and the redundant bit sequence are combined is obtained.
- the redundant bit string calculation device 71 includes an exclusive OR operation circuit.
- a check matrix is a matrix that is a block matrix power of a cyclic permutation matrix.
- a method for reducing the amount of memory and simplifying exclusive logical operation processing by limiting each block matrix to a cyclic matrix is disclosed.
- these methods are also called pseudo cyclic codes, and even in these methods, there is a problem that the reduction in the scale of the apparatus and the simplicity of the processing are not compatible with each other! Even with the method using cyclic codes, the equipment scale is reduced.
- there is a problem that complicated control is required, or that it can be applied only to codes that are further limited among pseudo cyclic codes, that is, codes that are further constrained.
- Patent Document 1 Japanese Patent Laid-Open No. 2003-115768
- Patent Document 2 JP 2004-72130 A
- Non-Patent Document 1 DJC MacKav, “Good Error -Correcting Codes Based on very sparse matrices (Always a sparse line [J-based good error ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ),, IEEE Transactions on Information Theory, pp. 39 9-431, March 1999
- Non-Patent Document 2 Thomas Richardson, R. Urbanke (Enocient Noncoding, Efficient Encoding of Low—Density Parity—Check Codes, “IEEE Transactions on” In formation Theory, pp. 619— 656, September 2001
- the code ⁇ ⁇ ⁇ ⁇ related to the low-density parity check code includes a storage device such as a matrix information storage memory that holds the matrix A in the above equation (1), and a redundant bit string that executes the processing of the above equation (2). Since it is implemented using an arithmetic processing unit such as a calculation unit, the scale of the encoding unit becomes very large compared to cyclic encoding such as Reed-Solomon code or convolutional encoding. Has a point. Because of this problem, the error correction coding in the related technology described above is easy to process in the coding process and the scale of the device, particularly when applied to systems such as satellite communication, terrestrial microwave communication, and mobile communication. Therefore, it is difficult to achieve both reduction in coding and improvement in coding gain by code key processing.
- an object of the present invention is an error correction code input method using a low-density NOR check code, and the error correction encoding device can be reduced in scale and simple in configuration.
- the object is to provide a method capable of obtaining a large coding gain by iterative decoding.
- Another object of the present invention is an error correction coding apparatus using low density parity check coding, in which the apparatus scale is small and the apparatus configuration is simple, and a large coding gain is obtained by iterative decoding. It is in providing the apparatus which can obtain.
- the error correction coding method of the present invention is an error correction code method using a low-density parity check code, where K, m, n are positive integers, r is an integer of l ⁇ r ⁇ m, k , k, ..., k to 0 ⁇ k, k
- the error correction code (M ⁇ r) first blocks consisting of bit strings of length n and each of k blocks of length k 1, k 2,.
- the error correction encoding apparatus of the present invention is an error correction encoding apparatus using a low density parity check code, wherein K, m, n are positive integers, r is an integer of l ⁇ r ⁇ m, k, k, ..., k to 0 ⁇ k, k
- the length K of the information bit sequence to be error-corrected code is (m ⁇ r) first blocks each consisting of a bit sequence of length ⁇ , Each of k, k, ..., k
- each first arithmetic unit may include a maximum of (m ⁇ r) polynomial multiplier circuits.
- the second arithmetic unit may be, for example, a maximum of one polynomial division (r 1) for the second block having a length k and the operation results from the r first arithmetic units.
- An output Pth polynomial division 'multiplication unit In this case, assuming that q is an integer of 1 ⁇ q ⁇ r, the r-th polynomial division 'multiplication unit is provided with, for example, at most one polynomial division circuit and at most (r-q) polynomial multiplication circuits. Can do.
- connection logic can be used to set a polynomial to be a divisor in the polynomial division circuit and a polynomial for determining a multiplier in the polynomial multiplication circuit.
- a coding method using a low-density parity check code which has a small device scale and a simple device configuration, and can obtain a high coding gain by an iterative decoding method.
- An apparatus can be provided.
- FIG. 1 is a block diagram showing an example of the configuration of an error correction code encoding device in the related art.
- FIG. 2 is a block diagram showing a configuration of an error correction code encoder according to an embodiment of the present invention.
- FIG. 3 is a block diagram showing an example of a configuration of a polynomial multiplication unit.
- FIG. 4 is a block diagram showing an example of a configuration of a polynomial multiplication circuit.
- FIG. 5 is a block diagram showing an example of the configuration of a polynomial division / multiplication unit.
- FIG. 6 is a block diagram showing an example of a configuration of a polynomial division circuit.
- FIG. 7 is a diagram showing an example of a frame format related to a code bit sequence.
- FIG. 8 is a block diagram showing another configuration example of the polynomial multiplication unit.
- FIG. 9 is a block diagram showing an example of the configuration of a data communication system using a coding device according to the present invention. Explanation of symbols
- the error correction code encoding apparatus generates a code bit string by performing error correction coding using a low density parity check code on an information bit string supplied as an input.
- the error correction code encoder includes r polynomial multiplication units 11 arranged in parallel, r being an integer equal to or greater than 1, r polynomial divisions' multiplication units 12 arranged in series, and an input A switch 13 provided on the output side, and a switch 14 provided on the output side.
- the notation "[l]" to "[r]” is used as described later.
- the switch 13 is used to distribute the information bit string input to the error correction code unit to one of the polynomial multiplication units 11.
- Switch 14 sequentially selects the information bit string and the r outputs of the polynomial division / multiplication unit [1] in the final stage in order to output a sign bit string in which the information bit string and the redundant bit string are combined, as will be described later. Is to do.
- the code method according to the present embodiment receives an information bit sequence having a length of K bits and calculates and outputs a code bit sequence having a length of nm bits.
- the bit length K of the information bit sequence can be expressed by the following equation.
- K bits in a code bit sequence having a bit length of nm completely match an input information bit sequence having a bit length of ⁇ . That is, the encoding method in the present embodiment is a systematic code method. Details of the configuration of the error correction coding apparatus according to this embodiment will be described below. In the following description, the length means a bit length unless otherwise specified.
- the r polynomial multiplication units 11 have the same configuration, and m is an integer greater than or equal to r, and at most (m ⁇ r) polynomial multiplication circuits as shown in FIG. 21, an exclusive OR circuit 22 that is one less than the number of polynomial multiplication circuits 21, and a switch 23.
- the (m ⁇ r) polynomial multiplier circuits 21 are connected in series via exclusive OR circuits 22.
- the switch 23 has one input (m ⁇ r) output, and the input information bit string is the first, ie, the leftmost polynomial multiplier circuit 21 or (m ⁇ r ⁇ 1) exclusive logics. Supply to one of the sum circuits 22. That is, the output of the polynomial multiplication circuit 21 at the right end in the figure is supplied to the subsequent polynomial division / multiplication unit 12 as the output of the polynomial multiplication unit 11.
- Such a polynomial multiplication unit 11 receives n (m -r) bits of the information bits of length K shown in Equation (2) as input, and outputs a bit string of length n. This output bit string is input to the subsequent polynomial division / multiplication unit 12. A bit string of length n (m ⁇ r) is divided every n bits, and is distributed to one of (m ⁇ r) polynomial multiplication circuits 21 by the switch 23.
- the 1st force nth bit is sequentially input to the first, ie, the leftmost polynomial multiplication circuit 21, and the (n + 1) th power 2nth bit is passed through the exclusive OR circuit 22, It is sequentially input to the second polynomial multiplier circuit 21 from the left end of the figure.
- j is an integer of 2 ⁇ j ⁇ m—r—1
- the (jn + 1) th to (j + 1) nth bits are passed through the jth exclusive OR circuit 22.
- (J + 1) th Are sequentially input to the polynomial multiplication circuit 21.
- each polynomial multiplication circuit 21 in the polynomial multiplier unit 11 has the same configuration.
- each polynomial multiplication circuit 21 includes n flip-flops 31 used as registers, n powers of n exclusive OR circuits 32, and exclusive logic.
- a connection element 33 provided for each sum circuit 32 and supplied with an input bit string to the polynomial multiplication circuit 21 and having a connection or non-connection state determined according to a check matrix, and a switch 34 are provided.
- An exclusive OR circuit 32 is provided for each flip-flop 31 on the input side of the flip-flop. In this way, the n flip-flops 31 with the exclusive OR circuit 32 are connected in series via the exclusive OR circuit 32, and the switch 34 is the flip-flop of the final stage.
- the switch 34 supplies the output of the flip-flop 31 of the final stage to the outside as the output of the polynomial multiplier circuit 21 or is supplied to the flip-flop 31 of the first stage, that is, the left end of the figure via the exclusive OR circuit 32 of the first stage. This is for selecting whether to return.
- the polynomial multiplication circuit 21 has an n-bit input and an n-bit output.
- the n-bit input bit string is sequentially input to the multiplicative multiplier 21, and all inputs are completed.
- the switch 34 By switching the switch 34 at the time, the contents of n flip-flops (ie, registers) 31 are sequentially output.
- each of the n connection elements 33 is a predetermined n-bit bit string h 1, h 2,.
- the r polynomial division / multiplication units 12 arranged in series are distinguished from each other by "[l]" to "[r]” in order to distinguish them from each other.
- polynomial division on the input side ie, the polynomial multiplication unit 11 ⁇
- the multiplication unit is polynomial division / multiplication unit [r-1]
- the rightmost polynomial division ⁇ multiplication unit is the polynomial division ⁇ multiplication unit [1].
- Polynomial division like this, where i is an integer of l ⁇ i ⁇ r.
- Polynomial division of multiplication unit 12 Division / multiplication unit [i] is at most one polynomial division as shown in Fig. 5.
- a circuit 41 and at most (i-1) polynomial multiplier circuits 42 are provided.
- the polynomial multiplier circuit 42 the polynomial multiplier circuit shown in FIG. 4 can be used as it is.
- the polynomial division circuit 41 will be described later.
- the r polynomial division / multiplication units 12 arranged in series have different numbers of polynomial multiplication circuits constituting the polynomial division 12 depending on their positions in the series arrangement.
- a unit is distinguished by the number of polynomial multiplication circuits that compose it. In the sign unit shown in Fig.
- the number of polynomial multiplication circuits 42 in the polynomial division / multiplication unit [r] is (r 1) or less, and the polynomial multiplication in the polynomial division / multiplication unit [r 1]
- the number of circuits 42 is (r 2) or less, and as described above, the number of polynomial multiplication circuits 42 in the polynomial division / multiplication unit [i] is (i ⁇ 1) or less. If multiplication with the zero polynomial is taken into account, there is no need to provide a multiplication circuit for multiplication with the zero polynomial, so the number of polynomial multiplication circuits 42 in the polynomial division / multiplication unit [i] is (i — 1 ).
- the polynomial division / multiplication unit [i] is described below.
- Polynomial division ⁇ Multiplication unit [i] has a maximum of one polynomial division circuit 41 and a maximum (i
- the first (i-1) terminals are connected to the input of the polynomial multiplier 42 via the exclusive OR circuit 43, and the output of the polynomial multiplier 42 is , Each connected to terminal 48.
- the exclusive OR circuit 43 is also supplied with the output of the selector 44 in common.
- the output of the selector 44 is also connected to the terminal 47.
- the remaining one terminal 46 is connected to the remaining two exclusive OR circuits 43.
- One of these exclusive OR circuits 43 is also supplied with a bit string from a terminal 45 and is connected to an input of a polynomial division circuit 41.
- the other exclusive OR circuit 43 is supplied with the output bit string of the polynomial divider circuit 41 and is connected to one input terminal of the selector 44.
- the other input terminal of the selector 44 is connected to the terminal 45.
- the r terminals 46 are respectively connected to the outputs of the r polynomial multiplication units 11.
- the polynomial multiplication circuit 42 and the terminal 48 are not provided.
- the polynomial division circuit 41 receives as an input the exclusive OR of the k bits sequentially input from the terminal 45 and the first half k bits of the n bits sequentially input from the terminal 46. (N ⁇ k) bits are output sequentially.
- the exclusive OR of the (n ⁇ k) bits of the output of the polynomial divider circuit 41 and the (n ⁇ k) bits of the latter half of the n bits sequentially input from the terminal 46 is obtained via the selector 44. It is supplied to the input of the polynomial multiplication circuit 42.
- the selector 44 receives k bits sequentially input from the terminal 45 as the first input, and sequentially inputs the output of the polynomial divider circuit and the terminal 46 from the terminal 46.
- the exclusive OR of the n bits of the latter half (n-ki) is received as the second input, and the first and second inputs are switched to output a total of n bits sequentially.
- the n bits output from the selector 44 are output from the terminal 47 as n bits in the nm bits of the code bit sequence.
- the polynomial multiplier circuit 42 receives an exclusive OR of the output from the selector 44 and the n bits sequentially input to the terminal 46 as an input, and sequentially outputs the n bits of the multiplication result from the terminal 48.
- the polynomial divider circuit 41 includes (n—k) flip-flops 51, at most (n—k) exclusive OR circuits 52, where k is an integer of 0 ⁇ k ⁇ n, n ⁇ k + 1) connecting elements 53, switches 54 and 55, and force are also formed.
- Each of the (n—ki + 1) wiring elements 53 is associated with each bit of g (g—g,..., G) having a predetermined length (n—k + 1) bits.
- the switch 54 supplies the output of the flip-flop 51 of the final stage to the outside as the output of this polynomial divider circuit 41, or supplies the remaining one exclusive OR circuit 52, that is, the last exclusive OR circuit 52. It is a switch to do.
- the final exclusive OR circuit 52 is supplied with the input bit string to the polynomial divider circuit 41, and the output of the final exclusive OR circuit 52 passes through the switch 55 (n— The k + 1) th connection element 53, that is, the connection element corresponding to the bit g is supplied. No. 1
- connection element 53 corresponding to bit g is provided.
- the flop 51 corresponds to the bit g via the connection element 53 corresponding to the bits g,..., G to the exclusive OR circuit 52 provided at the input part thereof.
- Such a polynomial divider circuit 41 receives the bit as a sequential input with the switch 54 as the last exclusive OR circuit 52 side, and switches the switch 54 when the input is completed.
- the total (n—ki) bits stored in the flip-flop 51 are sequentially output.
- this polynomial division circuit 41 has a k-bit input bit string and a (n—k + 1) -bit bit string g, g,.
- the parity check matrix of Equation (4) is an r X m block matrix, and each component thereof is an n X n cyclic matrix.
- n x n circulant matrix in the lower right triangular part of equation (4) that is, the part written as “0” in bold letters in the equation is a zero matrix.
- the n X n cyclic matrix is the row vector in the second row that is a one bit right rotation of the row vector in the first row, and k As an integer of 2 ⁇ k ⁇ n, the column vector in the k-th column is the row vector in the first row rotated (k-1) bits to the right.
- the row vector of the first row of the ⁇ ⁇ ⁇ circulant matrix in equation (5) can be expressed as a polynomial of ( ⁇ -1) degree or less, as shown in equation (6).
- i is an integer 1 ⁇ i ⁇ r
- j is an integer 1 ⁇ j ⁇ m—r
- v is an integer 2 ⁇ v ⁇ r
- u is an integer 1 ⁇ u ⁇ t1
- the row vector of the first row of H in (4) is (n 1) th order
- the tuttle expressed as a polynomial of (n 1) degree or lower is denoted as f (u ' v) (X), and the row vector of the first row of G in Equation (4) is (n ⁇ 1) order or lower This is expressed as g (i) (X).
- N_bit bit string h 1, h 2,..., H _ which determines whether the connection element 33 is connected or not connected, is represented by the polynomials h (i ′ j) (x) and f (u , v ) Determined through selection of (x).
- a primitive element ⁇ of a finite field GF (q) with q powers and an integer i satisfying 1 ⁇ i ⁇ r g (i ) (X) is defined as in Eq. (7).
- B is a subset of integers greater than or equal to 0 and less than or equal to q-2, and its coefficient is 0 or 1 when the polynomial of equation (7) is expanded. Therefore, g (i) (X) is a polynomial that is multiplied by the minimum polynomial on the original field (GF (2)) of GF (q) defined by B. Further, B 1, B 2,..., B satisfy the following relationship (equation (8)).
- the polynomial h (i ′ j) (x) is set as a double polynomial of g (i) (x) modulo x n ⁇ 1. That is, the formula As a condition satisfying the condition (9), a polynomial h (" j) (x) of degree (n-1) or less is set.
- i is an integer of l ⁇ i ⁇ r
- j is an integer of l ⁇ j ⁇ m—r
- ⁇ (i ' j) (x) has a coefficient of 0 or 1 for each term
- the polynomial has an order of (n-1) order or less.
- the polynomial f (u ' v) (x) described above is set as a double polynomial of g (i) (x) modulo x n -1, as with the polynomial h (i ' j) (x). To do. That is, a polynomial f (u ′ v) (X) having an order of (n ⁇ 1) or less is set as satisfying the condition of Expression (10).
- v is an integer of 2 ⁇ v ⁇ r
- u is an integer of l ⁇ u ⁇ v—1
- ⁇ ( u , v ) (x) has a coefficient of 0 for each term, It is assumed that the order is a polynomial of degree (n ⁇ 1) or less.
- connection element 33 is connected to the predetermined n-bit bit string h 1, h 2,. Which state of non-connection state is determined. Specifically, if j is an integer of 0 ⁇ j ⁇ n— 1 and h is 1, then the connection element marked "h" is in the connected state, and h is
- connection element marked “h” When it is 0, the connection element marked “h” is in a non-connection state.
- the n-bit bit string that defines this connection is selected as follows.
- each polynomial multiplication unit 11 includes at most (m ⁇ r) polynomial multiplication circuits 21 as shown in FIG. , m—r.
- i is an integer of l ⁇ i ⁇ r
- j is an integer of l ⁇ j ⁇ m—r
- k is an integer of 0 ⁇ k ⁇ n— 1
- the connection of the jth polynomial multiplication circuit in the i-th polynomial multiplication unit N is represented by hh..., H, and h is expressed by equation (9)
- FIG. 6 shows the configuration of the polynomial divider circuit 41.
- whether the connection element 53 is in a connected state or a non-connected state is determined in advance as described above.
- (n— k + 1) bit sequence g, g, ..., g, i is an integer of l ⁇ i ⁇ n
- j is an integer of 0 ⁇ j ⁇ n— k
- V is an integer of 1 ⁇ V ⁇ r
- u is an integer of l ⁇ u ⁇ v—l
- the upper force in the vth polynomial division / multiplication unit 12 is also the uth polynomial (see Fig. 5)
- Each connection element in the multiplier circuit 42 is connected in the same way as in the polynomial multiplier circuit 21 in the polynomial multiplication unit 11 according to the coefficient of each term of ⁇ (u ' v) (X) in Equation (10). Set to one of unconnected states.
- Equation (12) the number of redundant bits in the code method using the matrix H of Equation (4) as a check matrix
- Equation (3) the number of information bits is shown in Equation (3).
- Matches K The bit length of one block that combines the number of information bits and the number of redundant bits is nm.
- FIG. 7 shows an example of a frame format related to a code bit sequence having a length of nm bits encoded by the error correction code encoder of this embodiment.
- the K bits in the sign bit sequence shown in Equation (3) completely match the input information bit sequence to this sign unit.
- the sign key method of the present embodiment is a systematic sign key method.
- Polynomial division ⁇ Multiplication unit [r] is the next-stage polynomial division 'multiplication unit using the above k bits of information and!: Total of nr bits output from the 11 polynomial multiplication units 11 as inputs. It outputs n (r ⁇ l) bits that are input to [r ⁇ 1] and n bits that are output from this encoder. Switch 14 switches to the output terminal of the polynomial division / multiplication unit [r], and outputs n bits. Assuming that i is an integer of 2 ⁇ i ⁇ r—1, switch 1 and 3 in the same manner, so that a k-bit information bit string is supplied to the polynomial division 'multiplication unit [i].
- Polynomial division / multiplication unit [i] processes the ni bits supplied from the polynomial division 'multiplication unit [i + 1] in addition to the information bits of this bit, and outputs n bits that are the output of the encoder and the next stage. N (i-l) bits to be output to the polynomial division and multiplication unit [i-1]. Note that a K-bit information bit string is continuously supplied to the encoding device of this embodiment. Since the processing in each polynomial division / multiplication unit 12 requires n unit time, after inputting k bits in the information bit string, the processing of the polynomial division / multiplication unit [i] is completed and the output is completed. It is necessary to delay the input of the information bit string (k bits) to the polynomial division / multiplication unit [i–l] that operates next until the time until
- switch 13 is switched so that the k-bit information bit string and the n bits that are the output of the polynomial division / multiplication unit [2] are input to the polynomial division / multiplication unit [1].
- n bits are output from the polynomial division / multiplication unit [1].
- This n-bit output becomes the output of this coding device via the switch 14.
- each polynomial multiplication unit 11 is sequentially input with n (m ⁇ r) bits up to the first bit n (m ⁇ r) bit of the information bit string.
- n (m ⁇ r) bits are divided into n bits and distributed to (m ⁇ r) polynomial multiplier circuits 21 in the polynomial multiplier unit 11 by the switch 23 as shown in FIG. .
- the first bit to the nth bit are sequentially input to the first polynomial multiplier, that is, the leftmost polynomial multiplier in FIG.
- switch 23 When the nth bit has been input, switch 23 is switched, and the (n + 1) th bit to the 2nth bit are passed through the exclusive OR circuit 22 to the second polynomial multiplication. Circuit, that is, the leftmost force in FIG. 3 is input to the second polynomial multiplier circuit. That is, the exclusive OR of each of the (n + 1) th bit to the 2nth bit and the output bit of the first polynomial multiplier circuit is sequentially input to the second polynomial multiplier circuit.
- the polynomial division / multiplication unit 12 includes at most one polynomial division circuit 41 and at most (r 1) polynomial multiplication circuits 42.
- the polynomial division / multiplication unit 12 is distinguished by the number of polynomial multiplication circuits 42 constituting it, but the basic operation is the same.
- n (m ⁇ r) bits are already input in the K bits of the information bit string of Equation (3) to the encoding device of the present embodiment.
- the multiplication unit [r] has first the (n (m—r) + 1) th bit force of the information bit string and the (n (m—r) + k) th bit through the force terminal 45 At the same time, an n-bit bit string is sequentially input through the terminal 46 in parallel with each of the r polynomial multiplying units 11. While an information bit string of a total of k bits is being input from terminal 45, the exclusive OR of this information bit string from terminal 45 and the bit string input from! Is input. At this time, the selector 44 is set to select the input from the terminal 45, and the input from the terminal 45 is output as it is to the output terminal 47.
- the output of the selector 44 is output from the output terminal 47 and simultaneously input to the (r ⁇ 1) exclusive OR circuits 43.
- the first output excluding those that are input to the polynomial divider circuit 41 is also the input from the terminal 46 up to the (r-1) th Are respectively input to (r 1) polynomial multiplication circuits 42 through an exclusive OR circuit 43 having the above selector output as the other input.
- the output of the selector 44 is input from the output of the polynomial divider 41 and the!: Th terminal 46. It is set to select exclusive OR with the data to be processed. At this time, the number of bits output from the polynomial divider circuit 41 is (n ⁇ k) bits. The output of selector 44 is output from terminal 47. In addition, the output of the sign unit, that is, the redundant bit string, and the exclusive OR operation with the input from the (r-1) terminals 46 are executed. The result of the exclusive OR operation is the multiplication of each polynomial. Input to circuit 42.
- the first k bits are the information bit string input from the terminal 45, and the second (n ⁇ k) bits are redundant bits.
- k bits from the (n (m ⁇ r) + 1) th to (n (m ⁇ r) + k) of the information bit string and the first k bits of the bit string input from terminal 46! ⁇ Unit time is required, and then unit time is required to process the output (n—k) bits of the polynomial divider circuit and the (n—k) bits in the second half of the bit string input from the terminal 46.
- the processing time required for the polynomial division / multiplication unit [r] is n unit times.
- the data stored in the flip-flop (ie, register) 31 in the (r-1) polynomial multiplier circuit 42 is output from the terminal 48, and the next-stage polynomial division / multiplication unit [r 1] Is input.
- [i] is the output of the sign unit from the k bits input from terminal 45 and the ni bits input from terminal 46 via the terminal 46 using the polynomial division / multiplication unit [i + 1] 47 output as well as data to be input to the next polynomial division / multiplication unit [i-1].
- This generated data is output from the terminal 48 of the polynomial division / multiplication unit [i] during the operation of the next-stage polynomial division / multiplication unit [i 1].
- the first half of the bits is the information bit string input from the terminal 45, and the latter (n ⁇ k) bits are redundant bits.
- Polynomial division 'multiplication unit [1] consists of at most one polynomial division circuit 41.
- This polynomial division circuit 41 is a polynomial division • of the n bits input from the multiplication unit [2] via terminal 46. First k bits and end
- Input from child 45 Inputs an exclusive OR with k bits. N video output from terminal 47
- bit string input via terminal 45 is output as is.
- the (n—k) bits in the latter half are the (n—k) bits that are the output of the polynomial divider circuit 41 and the terminal 4
- the contents of (n ⁇ k) flip-flops (ie, registers) 5 1 are all initialized to zero, and the switch 54 is set to the feedback side, that is, not to the output side. Then, switch 55 is closed.
- the contents of the shift register composed of the flip-flops 51 are sequentially updated.
- switch 55 is opened, switch 54 is set to the output side, and the contents of each flip-flop 51 are output sequentially.
- the error correction coding apparatus assumes that K is a positive integer, and is given this information bit string when a blocked information bit string having a length of K bits is given.
- a code bit sequence of length mn is output in the frame format shown in FIG. M and n are integers of 2 or more, r is an integer of l ⁇ r ⁇ m, and k, k, k, ⁇ , k are each 0
- the r polynomial multiplication units 11 include a total of up to r (m ⁇ r) polynomial multiplication circuits 21, and the maximum r (m ⁇ r) polynomial multiplication circuits 21 are long.
- the r polynomial division / multiplication unit 12 includes a maximum of total !: polynomial division circuits 41 and a total of r (r 1) polynomial multiplication circuits 42, where r polynomials
- the division / multiplication unit 12 uses the polynomial division circuit 41 and the polynomial multiplication circuit 42 to divide the K-bit input information bit string as described above into the lengths k, k, k, ..., k block and polynomial multiplication unit 11 output data
- a maximum of r polynomial divider circuits 41 are provided.
- the minimum number on the original prime field of the finite field as a maximum of r polynomials A series of polynomials related to the polynomial is adopted.
- the polynomial that defines the state of the connecting element in the polynomial multiplier 42 in the polynomial divider / multiplier unit 12 is selected so that the matrix formed by the product polynomial with the polynomial corresponding to the polynomial divider 41 becomes a sparse matrix. Selected.
- W (k) represents the sum of each coefficient as an integer when the integer k with l ⁇ k ⁇ q-2 is expanded in binary.
- g (X) 1.
- i and j are integers satisfying l ⁇ i and j ⁇ r, if i and j, (x) is divisible by g (i) (x), so it is set by equations (13) and (14).
- the polynomial expressions g (1 ) ( X ), g (2) (x), ..., g W (x) satisfy the requirements of Eqs. (7) and (8).
- the polynomial h (i ' j) (x) is selected as follows: where i is an integer of l ⁇ i ⁇ r, j is an integer of l ⁇ j ⁇ m—r, and g ( i) Set to be a multiple polynomial of (X). If V is an integer of 2 ⁇ v ⁇ r and u is an integer of l ⁇ u ⁇ v- 1, the choice of polynomial f (u , v) (x) is the same as for polynomial h (i , j) (x) Similarly, as shown in equation (10), it is set to be a multiple polynomial of g (u) (x).
- the polynomials h (i ' j) (x) and f (u ' v) (x) can be selected freely, but the polynomials g (i) (x) and h (i ' j ) (x), f (u ' ⁇ ) ( ⁇ ) And the parity check matrix shown in Eq. (4) H force
- the polynomial h (i ' j) (so that it matches the matrix obtained by transforming the block matrix H' with the sparse cyclic matrix as the block x), f (u ' v) (x) can be selected. Therefore, the bit string encoded by the encoding method of the present embodiment becomes a low-density parity check code and can be decoded by applying an iterative decoding method such as the Sam 'product decoding method, for example. It becomes possible.
- Equation (17) Equation (13) and Equation (14).
- the polynomial ⁇ (i ' j) (x) and the polynomial ⁇ (u ' ⁇ ) ( ⁇ ) are replaced by the check matrix ⁇ in Eq. (4), the zero matrix and the cyclic permutation matrix. Can be selected to match the matrix obtained by transforming the sparse block matrix H 'with the basic row transformation.
- the number of information bits is 3687 bits.
- Such a selection makes it possible to construct a code device with a code length of 40 95 bits and an information bit length of 3687 bits, which is also highly accurate and efficient by an iterative decoding method such as the Sam 'product decoding method. Decryption processing can be performed automatically.
- the code length is 4095 bits and the number of information bits is By applying a 3687-bit code, a coding gain of 3.5 dB or more can be obtained when the bit error probability after decoding is 0.1%. In this case, the bandwidth expansion rate is about 11%.
- the parameter r corresponding to the number of row blocks in the matrix of Equation (4) is set to 8, but by changing this parameter r, the coding apparatus is greatly improved. It is possible to change the code rate and the bandwidth expansion rate without any change. For example, reset only parameter r from 8 to 4 and leave other settings such as polynomial selection unchanged! /.
- the sparse block matrix H obtained by transforming the block matrix H with the basic row the first row block force is the same as the fourth row block.
- the code length is 4095 bits and the information bit length is 3855 bits, and the bandwidth expansion ratio is about 6.2%.
- the bit error probability after decoding is 0. At 1%, a coding gain of 2.5 dB or more can be obtained.
- m is a positive integer
- r is an integer of l ⁇ r ⁇ m
- (m ⁇ r) polynomial multiplication circuits 21 are provided. Connected in series via exclusive OR circuit 22! These (m ⁇ r) polynomial multiplication circuits connected in series can be arranged in parallel by performing serial-parallel conversion on the input data of the polynomial multiplication unit.
- the exclusive OR of the outputs of (m ⁇ r) polynomial multipliers arranged in parallel is used as the output of the polynomial multiplier unit.
- the advantage of this parallelization is that the number of flip-flops in the polynomial multiplication unit is reduced by sharing the flip-flop between the polynomial multiplication units arranged in parallel.
- FIG. 8 shows a polynomial multiplication unit in which (m ⁇ r) polynomial multiplication circuits are arranged in parallel in this way.
- (m ⁇ r) is set to N for simplicity.
- An exclusive OR circuit 62 is provided on the input side of the flip-flop for each flip-flop 61.
- N flip-flops 61 each having an exclusive OR circuit 62 are connected in series via the exclusive OR circuit 62, and the switch 34 is a flip-flop of the final stage. Connected to flop 61 output.
- the switch 34 supplies the output of the flip-flop 61 of the final stage to the outside as the output of this polynomial multiplication unit or returns to the flip-flop 61 of the first stage, that is, the left end of the figure via the exclusive OR circuit 62 of the first stage. This is for selecting.
- N wiring elements 63 provided for each exclusive OR circuit 62 correspond to the N outputs from the serial / parallel converter 65, respectively. It determines whether or not to supply power. Assuming that i is an integer satisfying l ⁇ i ⁇ n, whether the right force shown in the figure is also applied to the i-th flip'flop 61 is supplied with N outputs from the serial Z parallel variable 65. Determined by whether the corresponding bit of the bit string hh (2) ,..., H (N) is Kano '0 "that is" 1 "i + 1 i + 1 i + 1
- the polynomial multiplication unit in the form of Figure 3 uses n (mr) flip-flops !, whereas the parallelized polynomial multiplication unit in Figure 8 has n flip-flops. . By paralleling in this way, the number of flip-flops is reduced in the one shown in FIG.
- the fan-in number to the exclusive OR circuit 62 arranged between the flip-flops is equal to the fan to the exclusive OR circuit 32 in the polynomial multiplier circuit of FIG. It is larger than the number of ins. If the maximum number of fan-ins in the exclusive OR circuit exceeds the allowable range in the circuit of Fig. 8, the number of fan-ins is within the allowable range by using the parallel connection and the series connection of the polynomial multiplier circuit together. Can be kept within.
- the configuration of the polynomial multiplication unit is such that the circuit shown in FIG. 8 is inserted into the polynomial multiplication circuit 21 in the polynomial multiplication unit of FIG.
- FIG. 9 shows an example of the configuration of a data communication system using the coding apparatus according to the present invention.
- This data communication system includes a data transmission device 81 and a data transmission device 81. And a data receiving device 85 for receiving data transmitted via the communication path 80.
- the data transmission device 81 performs control for frame synchronization with the encoding device 82 according to the present invention to which data to be transmitted is input and the bit string output by the encoding device 82, and is adjusted to the modulator.
- the data receiving device 85 demodulates the information received from the communication path 50, converts the output data of the demodulator 86 into input data to the decoding device, and performs processing for frame synchronization
- the output from the modulator 84 is recorded on the recording medium instead of the communication path 80, and the demodulator 86 reads not only the information from the communication path 80 but also the recording medium force. It is also possible to configure a data storage device by allowing
- the error correction code encoder can select a code length, an information bit length, a coding rate (bandwidth expansion rate) by selecting a parameter m, r, n and a polynomial expression. Wide V, can meet the demands.
- the error correction code generator according to the present invention also has a simple combination power of a polynomial multiplier circuit and a polynomial divider circuit, and thus can be realized with a simple device configuration. It is possible to reduce the amount of calculation required for the process and the scale of the apparatus. Further, by selecting connections in the polynomial multiplier circuit and the polynomial divider circuit, it becomes possible to configure an error correction code generator capable of obtaining a large coding gain by iterative decoding. In this way, the present invention contributes to improvement in reliability and reduction in required power in the communication system.
- the present invention relates to an error correction technique for satisfying system configuration requirements such as reduction of required power and miniaturization of an antenna in a satellite communication system or a mobile communication system, or a storage device such as magnetic recording. It can be applied as an error correction technique for improving reliability.
Abstract
Description
Claims
Priority Applications (4)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
EP07742407.5A EP2031759B1 (en) | 2006-05-12 | 2007-04-25 | Coding method and device for Quasi-Cyclic LDPC codes |
CN2007800263128A CN101490963B (zh) | 2006-05-12 | 2007-04-25 | 纠错编码方法及装置 |
JP2008515479A JP4978625B2 (ja) | 2006-05-12 | 2007-04-25 | 誤り訂正符号化方法及び装置 |
US12/300,412 US8205142B2 (en) | 2006-05-12 | 2007-04-25 | Error correction coding method and device |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
JP2006134092 | 2006-05-12 | ||
JP2006-134092 | 2006-05-12 |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2007132656A1 true WO2007132656A1 (ja) | 2007-11-22 |
Family
ID=38693755
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/JP2007/058972 WO2007132656A1 (ja) | 2006-05-12 | 2007-04-25 | 誤り訂正符号化方法及び装置 |
Country Status (6)
Country | Link |
---|---|
US (1) | US8205142B2 (ja) |
EP (1) | EP2031759B1 (ja) |
JP (1) | JP4978625B2 (ja) |
CN (1) | CN101490963B (ja) |
RU (1) | RU2408979C2 (ja) |
WO (1) | WO2007132656A1 (ja) |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US8713398B2 (en) | 2011-03-22 | 2014-04-29 | Nec Corporation | Error correct coding device, error correct coding method, and error correct coding program |
US11165438B2 (en) | 2017-12-27 | 2021-11-02 | Nec Corporation | Error-correction encoding method and device, and decoding method and device using channel polarization |
Families Citing this family (12)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN103281091B (zh) | 2007-09-28 | 2017-10-27 | 松下电器产业株式会社 | 编码方法、编码器、解码器、发送装置和接收装置 |
CN101821808B (zh) | 2008-07-28 | 2014-03-19 | 艾格瑞系统有限公司 | 用于确定头组件与存储介质之间的飞行高度的系统和方法 |
US9343082B2 (en) | 2010-03-30 | 2016-05-17 | Avago Technologies General Ip (Singapore) Pte. Ltd. | Systems and methods for detecting head contact |
US8526133B2 (en) | 2011-07-19 | 2013-09-03 | Lsi Corporation | Systems and methods for user data based fly height calculation |
WO2014054283A1 (ja) * | 2012-10-05 | 2014-04-10 | パナソニック株式会社 | 符号化方法、復号方法、符号化器、及び、復号器 |
US9293164B2 (en) | 2013-05-10 | 2016-03-22 | Avago Technologies General Ip (Singapore) Pte. Ltd. | Systems and methods for energy based head contact detection |
US8937781B1 (en) | 2013-12-16 | 2015-01-20 | Lsi Corporation | Constant false alarm resonance detector |
US9129632B1 (en) | 2014-10-27 | 2015-09-08 | Avago Technologies General Ip (Singapore) Pte. Ltd. | Loop pulse estimation-based fly height detector |
RU2639661C1 (ru) * | 2016-09-02 | 2017-12-21 | Акционерное общество "Калужский научно-исследовательский институт телемеханических устройств" | Способ умножения и деления элементов конечных полей |
WO2018218466A1 (zh) | 2017-05-28 | 2018-12-06 | 华为技术有限公司 | 信息处理的方法和通信装置 |
EP3624350A4 (en) | 2017-06-03 | 2020-06-17 | Huawei Technologies Co., Ltd. | INFORMATION PROCESSING PROCESS AND COMMUNICATION DEVICE |
RU2659025C1 (ru) * | 2017-06-14 | 2018-06-26 | Общество с ограниченной ответственностью "ЛЭНДИГРАД" | Способы кодирования и декодирования информации |
Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2004072130A (ja) * | 2001-07-18 | 2004-03-04 | Sony Corp | 符号化方法および符号化装置 |
US20040148560A1 (en) | 2003-01-27 | 2004-07-29 | Texas Instruments Incorporated | Efficient encoder for low-density-parity-check codes |
WO2006064659A1 (ja) * | 2004-12-15 | 2006-06-22 | Nec Corporation | 誤り訂正符号化装置及びそれに用いる誤り訂正符号化方法 |
Family Cites Families (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
HU216669B (hu) | 1990-09-19 | 1999-08-30 | Koninklijke Philips Electronics N.V. | Információhordozó fő adatállománnyal és vezérlőállománnyal, eljárás és készülék ezen állományok rögzítésére, valamint készülék azok kiolvasására |
US7865806B2 (en) * | 2006-03-03 | 2011-01-04 | Peter Lablans | Methods and apparatus in finite field polynomial implementations |
WO2006001015A2 (en) * | 2004-06-25 | 2006-01-05 | Runcom Technologies Ltd. | Multi-rate ldpc code system and method |
DE602005007320D1 (de) * | 2005-02-22 | 2008-07-17 | Lucent Technologies Inc | Vorgehensweise und Apparat zur Encodierung von Low-Density Parity-Check (LDPC) Codes |
CN1753315A (zh) * | 2005-11-03 | 2006-03-29 | 华中科技大学 | 一种低密度奇偶校验码的编码方法 |
-
2007
- 2007-04-25 WO PCT/JP2007/058972 patent/WO2007132656A1/ja active Application Filing
- 2007-04-25 US US12/300,412 patent/US8205142B2/en active Active
- 2007-04-25 EP EP07742407.5A patent/EP2031759B1/en active Active
- 2007-04-25 RU RU2008148940/09A patent/RU2408979C2/ru active
- 2007-04-25 JP JP2008515479A patent/JP4978625B2/ja active Active
- 2007-04-25 CN CN2007800263128A patent/CN101490963B/zh active Active
Patent Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2004072130A (ja) * | 2001-07-18 | 2004-03-04 | Sony Corp | 符号化方法および符号化装置 |
US20040148560A1 (en) | 2003-01-27 | 2004-07-29 | Texas Instruments Incorporated | Efficient encoder for low-density-parity-check codes |
WO2006064659A1 (ja) * | 2004-12-15 | 2006-06-22 | Nec Corporation | 誤り訂正符号化装置及びそれに用いる誤り訂正符号化方法 |
Non-Patent Citations (5)
Title |
---|
FUJITA H ET AL.: "IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS, COMMUNICATIONS AND COMPUTER SIENCES", vol. E88-A, 1 December 2005, ENGINEERING SCIENCES SOCIETY, article "SOME CLASSES OF QUASI-CYCLIC LDPC CODES: PROPERTIES AND EFFICIENT ENCODING METHOD", pages: 3627 - 3635 |
HOCEVAR D E: "Efficient encoding for family of quasi-cyclic LDPC codes", PROC., IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE, GLOBECOM 2003, vol. 7, 1 December 2003 (2003-12-01), pages 3996 - 4000 |
See also references of EP2031759A4 |
TANNER R.M. ET AL.: "IEEE TRANSACTIONS ON INFORMATION THEORY", vol. 50, 1 December 2004, IEEE PRESS, article "LDPC Block and Convolutional Codes Based on Circulant Ma- trices", pages: 2966 - 2984 |
ZONGWANG LI ET AL.: "PROC., IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE, GLOBECOM 2005", vol. 3, 28 November 2005, MO, article "Efficient encoding of quasi-cyclic low-density parity-check codes", pages: 1205 - 1210 |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US8713398B2 (en) | 2011-03-22 | 2014-04-29 | Nec Corporation | Error correct coding device, error correct coding method, and error correct coding program |
US11165438B2 (en) | 2017-12-27 | 2021-11-02 | Nec Corporation | Error-correction encoding method and device, and decoding method and device using channel polarization |
Also Published As
Publication number | Publication date |
---|---|
CN101490963A (zh) | 2009-07-22 |
RU2408979C2 (ru) | 2011-01-10 |
US20090187810A1 (en) | 2009-07-23 |
US8205142B2 (en) | 2012-06-19 |
RU2008148940A (ru) | 2010-06-20 |
EP2031759A4 (en) | 2012-07-04 |
EP2031759A1 (en) | 2009-03-04 |
EP2031759B1 (en) | 2014-07-30 |
CN101490963B (zh) | 2013-11-06 |
JP4978625B2 (ja) | 2012-07-18 |
JPWO2007132656A1 (ja) | 2009-09-24 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
JP4978625B2 (ja) | 誤り訂正符号化方法及び装置 | |
US6928602B2 (en) | Encoding method and encoder | |
US7343548B2 (en) | Method and apparatus for encoding and decoding data | |
US8095859B1 (en) | Encoder for low-density parity check codes | |
US6938196B2 (en) | Node processors for use in parity check decoders | |
JP4062435B2 (ja) | 誤り訂正符号復号装置 | |
US7673223B2 (en) | Node processors for use in parity check decoders | |
US7499490B2 (en) | Encoders for block-circulant LDPC codes | |
US8108760B2 (en) | Decoding of linear codes with parity check matrix | |
EP2234275B1 (en) | Encoder and encoding method | |
JP4821613B2 (ja) | 誤り訂正符号化装置及びそれに用いる誤り訂正符号化方法 | |
JP4320418B2 (ja) | 復号装置および受信装置 | |
WO2007088870A1 (ja) | 検査行列生成方法、符号化方法、復号方法、通信装置、符号化器および復号器 | |
WO2011136089A1 (ja) | 符号化装置、誤り訂正符号構成方法およびそのプログラム | |
EP2951925B1 (en) | Ldpc code design and encoding apparatus enabling the adjustment of code rate and codelength | |
JPH07202715A (ja) | 時間定義域代数エンコーダ/デコーダ | |
US8713398B2 (en) | Error correct coding device, error correct coding method, and error correct coding program | |
EP2309650B1 (en) | A systematic encoder with arbitrary parity positions | |
JP5523064B2 (ja) | 復号装置及び方法 | |
US8527851B2 (en) | System and method for using the universal multipole for the implementation of a configurable binary Bose-Chaudhuri-Hocquenghem (BCH) encoder with variable number of errors | |
EP2951926B1 (en) | Ldpc code design and encoding apparatus for their application | |
KR101221062B1 (ko) | 가변 usc 부호를 이용한 부호화 및 복호화 방법 | |
Sukhavasi et al. | A Primitive Polynomial to Define the Finite Field Modules for High-Throughput Interpolator to Encode and Decode Of Non Binary Cyclic Codes | |
Gautam et al. | Study and design of architecture for BCH code encoder and decoder | |
EP2309649A1 (en) | A systematic encoder with arbitrary parity positions |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
WWE | Wipo information: entry into national phase |
Ref document number: 200780026312.8 Country of ref document: CN |
|
121 | Ep: the epo has been informed by wipo that ep was designated in this application |
Ref document number: 07742407 Country of ref document: EP Kind code of ref document: A1 |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2008515479 Country of ref document: JP |
|
WWE | Wipo information: entry into national phase |
Ref document number: 12300412 Country of ref document: US |
|
NENP | Non-entry into the national phase |
Ref country code: DE |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2007742407 Country of ref document: EP |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2008148940 Country of ref document: RU |