WO2014123015A1 - データ処理装置、及びデータ処理方法 - Google Patents
データ処理装置、及びデータ処理方法 Download PDFInfo
- Publication number
- WO2014123015A1 WO2014123015A1 PCT/JP2014/051621 JP2014051621W WO2014123015A1 WO 2014123015 A1 WO2014123015 A1 WO 2014123015A1 JP 2014051621 W JP2014051621 W JP 2014051621W WO 2014123015 A1 WO2014123015 A1 WO 2014123015A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- parity check
- check matrix
- bits
- code
- parity
- Prior art date
Links
Images
Classifications
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
- H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
- H03M13/033—Theoretical methods to calculate these checking codes
- H03M13/036—Heuristic code construction methods, i.e. code construction or code search based on using trial-and-error
-
- 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
- H03M13/1165—QC-LDPC codes as defined for the digital video broadcasting [DVB] specifications, e.g. DVB-Satellite [DVB-S2]
-
- 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/25—Error detection or forward error correction by signal space coding, i.e. adding redundancy in the signal constellation, e.g. Trellis Coded Modulation [TCM]
- H03M13/255—Error detection or forward error correction by signal space coding, i.e. adding redundancy in the signal constellation, e.g. Trellis Coded Modulation [TCM] with Low Density Parity Check [LDPC] codes
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
- H03M13/27—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes using interleaving techniques
- H03M13/2703—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes using interleaving techniques the interleaver involving at least two directions
- H03M13/2707—Simple row-column interleaver, i.e. pure block interleaving
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
- H03M13/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/271—Row-column interleaver with permutations, e.g. block interleaving with inter-row, inter-column, intra-row or intra-column permutations
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
- H03M13/29—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes combining two or more codes or code structures, e.g. product codes, generalised product codes, concatenated codes, inner and outer codes
- H03M13/2906—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 using block 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/35—Unequal or adaptive error protection, e.g. by providing a different level of protection according to significance of source information or by adapting the coding according to the change of transmission channel characteristics
- H03M13/356—Unequal error protection [UEP]
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
- H03M13/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/616—Matrix operations, especially for generator matrices or check matrices, e.g. column or row permutations
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
- H04L1/0056—Systems characterized by the type of code used
- H04L1/0057—Block codes
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
- H04L1/0056—Systems characterized by the type of code used
- H04L1/0071—Use of interleaving
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
- H03M13/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 technology relates to a data processing device and a data processing method, and more particularly, to a data processing device and a data processing method capable of providing, for example, an LDPC code having a good error rate.
- LDPC Low Density Parity Check
- DVB Digital Video Broadcasting
- S.2 Satellite Digital Broadcasting
- LDPC codes are also used in next-generation terrestrial digital broadcasting such as DVB-T.2.
- LDPC codes have been found to have performance close to the Shannon limit as the code length is increased, as is the case with turbo codes and the like.
- the LDPC code has the property that the minimum distance is proportional to the code length, its characteristic is that the block error probability characteristic is good, and furthermore, the so-called error floor phenomenon observed in the decoding characteristic such as turbo code is observed.
- An advantage is that it hardly occurs.
- LDPC code is a linear code and does not necessarily need to be binary, but will be described here as being binary.
- LDPC code is characterized by the fact that the parity check matrix that defines the LDPC code is sparse.
- a sparse matrix is a matrix in which the number of “1” s in the matrix is very small (a matrix in which most elements are 0).
- FIG. 1 shows an example of a parity check matrix H of an LDPC code.
- the weight of each column (column weight) (the number of “1”) (weight) is “3”, and the weight of each row (row weight) is “6”. .
- a generator matrix G is generated based on the check matrix H, and the generator matrix G is multiplied by binary information bits to generate a codeword (LDPC code). ) Is generated.
- the generator matrix G is a K ⁇ N matrix
- the encoding device multiplies the generator matrix G by a bit string (vector u) of information bits made up of K bits to generate a code made up of N bits.
- Generate the word c ( uG).
- the code word (LDPC code) generated by this encoding device is received on the receiving side via a predetermined communication path.
- LDPC code decoding is an algorithm proposed by Gallager called probabilistic decoding (Probabilistic Decoding), consisting of variable nodes (also called message nodes) and check nodes (check nodes). This can be done by a message passing algorithm based on belief propagation on a so-called Tanner graph.
- the variable node and the check node are also simply referred to as nodes as appropriate.
- FIG. 2 shows a procedure for decoding the LDPC code.
- a real value (reception LLR) expressing the “0” likelihood of the value of the i-th code bit of the LDPC code (1 codeword) received on the receiving side as a log likelihood ratio as appropriate. ) Is also referred to as a received value u 0i . Further, a message output from the check node is u j and a message output from the variable node is v i .
- step S11 the LDPC code is received, the message (check node message) u j is initialized to “0”, and the counter of the iterative process is used.
- the variable k taking the integer of is initialized to “0”, and the process proceeds to step S12.
- step S12 a message (variable node message) v i is obtained by performing the calculation (variable node calculation) shown in Expression (1) based on the received value u 0i obtained by receiving the LDPC code.
- the message u j is obtained by performing the calculation (check node calculation) shown in Expression (2).
- Equation (1) and Equation (2) can be arbitrarily selected to indicate the number of “1” s in the vertical direction (column) and horizontal direction (row) of the parity check matrix H, respectively.
- variable node calculation of Expression (1) the message input from the edge (line connecting the variable node and the check node) to which the message is to be output, respectively.
- the computation range is 1 to d v -1 or 1 to d c -1.
- the check node calculation of equation (2) actually creates a table of function R (v 1 , v 2 ) shown in equation (3) defined by one output for two inputs v 1 and v 2 in advance. In addition, this is performed by using it continuously (recursively) as shown in Equation (4).
- step S12 the variable k is further incremented by “1”, and the process proceeds to step S13.
- step S13 it is determined whether or not the variable k is larger than a predetermined iterative decoding count C. If it is determined in step S13 that the variable k is not greater than C, the process returns to step S12, and thereafter the same processing is repeated.
- step S13 determines whether the variable k is larger than C. If it is determined in step S13 that the variable k is larger than C, the process proceeds to step S14, and a message v i as a decoding result to be finally output is obtained by performing the calculation shown in equation (5). And the LDPC code decoding process ends.
- equation (5) is performed using messages u j from all branches connected to the variable node.
- FIG. 3 shows an example of a parity check matrix H of a (3, 6) LDPC code (coding rate 1/2, code length 12).
- the column weight is 3 and the row weight is 6, as in FIG.
- FIG. 4 shows a Tanner graph of the check matrix H in FIG.
- a plus “+” represents a check node
- Check nodes and variable nodes correspond to the rows and columns of the parity check matrix H, respectively.
- the connection between the check node and the variable node is an edge, and corresponds to “1” of the check matrix element.
- the branch represents that the sign bit corresponding to the variable node has a constraint condition corresponding to the check node.
- FIG. 5 shows variable node calculation performed in the variable node.
- the message v i corresponding to the branch to be calculated is the variable node of the formula (1) using the messages u 1 and u 2 from the remaining branches connected to the variable node and the received value u 0i. It is obtained by calculation. Messages corresponding to other branches are obtained in the same manner.
- FIG. 6 shows a check node operation performed at the check node.
- sign (x) is 1 when x ⁇ 0, and ⁇ 1 when x ⁇ 0.
- Equation (6) can be transformed into Equation (7).
- the message u j corresponding to the branch to be calculated is the messages v 1 , v 2 , v 3 , v 4 , v from the remaining branches connected to the check node. It is obtained by the check node calculation of Equation (7) using 5 . Messages corresponding to other branches are obtained in the same manner.
- ⁇ (x) and ⁇ ⁇ 1 (x) are mounted on hardware, they may be mounted using a LUT (Look Up Table), but both are the same LUT.
- DVB-S.2 ETSI EN 302 307 V1.2.1 (2009-08)
- the LDPC code is a symbol of quadrature modulation (digital modulation) such as QPSK (Quadrature Phase Shift Keying). (Symbolized), and the symbol is mapped to a signal point and transmitted.
- quadrature modulation digital modulation
- QPSK Quadrature Phase Shift Keying
- an LDPC code having a coding rate that can easily set a certain number of coding rates (for example, more than the number required for data transmission).
- the error resistance is high (strong), that is, the error rate is good, regardless of the coding rate of the LDPC code.
- the present technology has been made in view of such a situation, and is capable of providing an LDPC code having a good error rate.
- the first data processing apparatus or data processing method of the present technology converts an information bit into an LDPC code having a code length of 64,800 bits and a code rate of 7/30 based on a parity check matrix of an LDPC (Low Density Parity Check) code.
- LDPC Low Density Parity Check
- An encoding unit or encoding step for encoding wherein the LDPC code includes information bits and parity bits, and the parity check matrix includes an information matrix unit corresponding to the information bits and a parity matrix unit corresponding to the parity bits
- the information matrix part is represented by a parity check matrix initial value table, and the parity check matrix initial value table is a table that represents the position of one element of the information matrix part for every 360 columns, 548 9528 12205 12770 22023 22082 25884 27421 33215 36046 43580 43953 47539 919 2623 5098 5514 5645 6348 9666 13795 14555 43224 44048 44948 47964 995 7270 17753 21272 29228 29916 31634 34055 35205 37499 37777 47490 49301 645 3803 8836 9470 11054 20253 29417 31243 31990 36468 38715 39932 43045 14572 18646 21100 26617
- a second data processing apparatus or data processing method includes a decoding unit that decodes an LDPC code having a code length of 64,800 bits and a coding rate of 7/30 based on a parity check matrix of an LDPC (Low Density Parity Check) code Or the decoding step, wherein the LDPC code includes information bits and parity bits, and the parity check matrix includes an information matrix portion corresponding to the information bits and a parity matrix portion corresponding to the parity bits, and the information matrix Part is represented by a parity check matrix initial value table, the parity check matrix initial value table is a table that represents the position of one element of the information matrix part every 360 columns, 548 9528 12205 12770 22023 22082 25884 27421 33215 36046 43580 43953 47539 919 2623 5098 5514 5645 6348 9666 13795 14555 43224 44048 44948 47964 995 7270 17753 21272 29228 29916
- the third data processing apparatus or data processing method of the present technology converts an information bit into an LDPC code having a code length of 64,800 bits and a code rate of 8/30 based on a parity check matrix of an LDPC (Low Density Parity Check) code.
- LDPC Low Density Parity Check
- An encoding unit or encoding step for encoding wherein the LDPC code includes information bits and parity bits, and the parity check matrix includes an information matrix unit corresponding to the information bits and a parity matrix unit corresponding to the parity bits
- the information matrix part is represented by a parity check matrix initial value table
- the parity check matrix initial value table is a table that represents the position of one element of the information matrix part for every 360 columns, 100 3433 4111 9089 13360 24012 26305 30252 31430 31769 34689 34917 36091 40873 41983 42689 43835 44318 47109 3 48 124 2240 7029 21694 24565 29302 39777 42706 43631 43784 46033 47064 47079 47141 47239 47439 47479 2 5675 7056 12715 24128 26596 30571 38210 38586 41138 42272 43336 43444 43917 45812 46840 47245 47286 47510 2
- a fourth data processing apparatus or data processing method of the present technology includes a decoding unit that decodes an LDPC code having a code length of 64,800 bits and a coding rate of 8/30 based on a parity check matrix of an LDPC (Low Density Parity Check) code Or the decoding step, wherein the LDPC code includes information bits and parity bits, and the parity check matrix includes an information matrix portion corresponding to the information bits and a parity matrix portion corresponding to the parity bits, and the information matrix Part is represented by a parity check matrix initial value table, the parity check matrix initial value table is a table that represents the position of one element of the information matrix part every 360 columns, 100 3433 4111 9089 13360 24012 26305 30252 31430 31769 34689 34917 36091 40873 41983 42689 43835 44318 47109 3 48 124 2240 7029 21694 24565 29302 39777 42706 43631 43784 46033 47064
- the fifth data processing apparatus or the data processing method of the present technology converts an information bit into an LDPC code having a code length of 64,800 bits and a code rate of 9/30 based on a parity check matrix of an LDPC (Low Density Parity Check) code.
- LDPC Low Density Parity Check
- An encoding unit or encoding step for encoding wherein the LDPC code includes information bits and parity bits, and the parity check matrix includes an information matrix unit corresponding to the information bits and a parity matrix unit corresponding to the parity bits
- the information matrix part is represented by a parity check matrix initial value table
- the parity check matrix initial value table is a table that represents the position of one element of the information matrix part for every 360 columns, 339 4777 5366 7623 13034 13260 15107 17772 20338 21178 25914 27663 29948 37489 41021 3871 5812 9795 23437 24079 27699 33471 39878 40302 41038 41217 42316 42765 43675 45118 3699 4072 16553 21492 26210 29839 30322 34139 38227 39696 40762 41156 41269 45168 45350 995 12194 12494 16542 20423 21950 23519 26215 26708 305
- a sixth data processing device or a data processing method of the present technology includes a decoding unit that decodes an LDPC code having a code length of 64,800 bits and a coding rate of 9/30 based on a parity check matrix of an LDPC (Low Density Parity Check) code Or the decoding step, wherein the LDPC code includes information bits and parity bits, and the parity check matrix includes an information matrix portion corresponding to the information bits and a parity matrix portion corresponding to the parity bits, and the information matrix Part is represented by a parity check matrix initial value table, the parity check matrix initial value table is a table that represents the position of one element of the information matrix part every 360 columns, 339 4777 5366 7623 13034 13260 15107 17772 20338 21178 25914 27663 29948 37489 41021 3871 5812 9795 23437 24079 27699 33471 39878 40302 41038 41217 42316 42765 43675 45118
- the seventh data processing apparatus or data processing method according to the present technology converts an information bit into an LDPC code having a code length of 64800 bits and a code rate of 10/30 based on a parity check matrix of an LDPC (Low Density Parity Check) code.
- LDPC Low Density Parity Check
- An encoding unit or encoding step for encoding wherein the LDPC code includes information bits and parity bits, and the parity check matrix includes an information matrix unit corresponding to the information bits and a parity matrix unit corresponding to the parity bits
- the information matrix part is represented by a parity check matrix initial value table, and the parity check matrix initial value table is a table that represents the position of one element of the information matrix part for every 360 columns, 867 2733 2978 8947 10214 11810 13566 15922 18838 20543 25845 29179 30055 31284 33447 34330 35081 35605 36268 39563 42331 43174 2765 6017 6394 6769 12351 13567 15195 19900 23094 27077 28626 28914 32219 33106 33662 33905 34878 37861 39749 39862 40976 42690 2343 4231 7603 7789 8396 8783 15636 16221 20591 215
- An eighth data processing apparatus or data processing method includes a decoding unit that decodes an LDPC code having a code length of 64,800 bits and a code rate of 10/30 based on a parity check matrix of an LDPC (Low Density Parity Check) code Or the decoding step, wherein the LDPC code includes information bits and parity bits, and the parity check matrix includes an information matrix portion corresponding to the information bits and a parity matrix portion corresponding to the parity bits, and the information matrix Part is represented by a parity check matrix initial value table, the parity check matrix initial value table is a table that represents the position of one element of the information matrix part every 360 columns, 867 2733 2978 8947 10214 11810 13566 15922 18838 20543 25845 29179 30055 31284 33447 34330 35081 35605 36268 39563 42331 43174 2765 6017 6394 6769 12351 13567 15195 19900 23094 27077
- a ninth data processing apparatus or data processing method of the present technology converts an information bit into an LDPC code having a code length of 64,800 bits and a code rate of 11/30 based on a parity check matrix of an LDPC (Low Density Parity Check) code.
- LDPC Low Density Parity Check
- An encoding unit or encoding step for encoding wherein the LDPC code includes information bits and parity bits, and the parity check matrix includes an information matrix unit corresponding to the information bits and a parity matrix unit corresponding to the parity bits
- the information matrix part is represented by a parity check matrix initial value table, and the parity check matrix initial value table is a table that represents the position of one element of the information matrix part for every 360 columns, 3208 6587 9493 9539 12368 12501 14811 15784 17625 18654 18721 19471 19503 20079 20411 20876 21493 22083 22430 27275 29322 32758 33227 33347 33715 34472 34711 38450 39151 39709 39862 40093 40497 40912 42 1118 3086 5466 6379 8483 9051 9330 13250 13898 14055 15033 18094 21429 22652 25251 28709 29909 30233 30472 30635 31367 3
- a tenth data processing device or a data processing method of the present technology includes a decoding unit that decodes an LDPC code having a code length of 64,800 bits and a code rate of 11/30 based on a parity check matrix of an LDPC (Low Density Parity Check) code Or the decoding step, wherein the LDPC code includes information bits and parity bits, and the parity check matrix includes an information matrix portion corresponding to the information bits and a parity matrix portion corresponding to the parity bits, and the information matrix Part is represented by a parity check matrix initial value table, the parity check matrix initial value table is a table that represents the position of one element of the information matrix part every 360 columns, 3208 6587 9493 9539 12368 12501 14811 15784 17625 18654 18721 19471 19503 20079 20411 20876 21493 22083 22430 27275 29322 32758 33227 33347 33715 34472 34711 38450 39151 39709
- the information bits have a code length of 64,800 bits and a coding rate of 7/30, 8/30, 9/30, 10/30, or And 11/30 LDPC code.
- LDPC Low Density Parity Check
- the code length is 64800 bits and the coding rate is 7/30, 8/30, 9/30, 10/30, or 11
- the / 30 LDPC code is decoded.
- the LDPC code includes information bits and parity bits
- the parity check matrix includes an information matrix portion corresponding to the information bits and a parity matrix portion corresponding to the parity bits
- the information matrix portion is an initial parity check matrix.
- the parity check matrix initial value table is a table that represents the position of one element of the information matrix portion for every 360 columns.
- the parity check matrix initial value table with a coding rate of 7/30 is 548 9528 12205 12770 22023 22082 25884 27421 33215 36046 43580 43953 47539 919 2623 5098 5514 5645 6348 9666 13795 14555 43224 44048 44948 47964 995 7270 17753 21272 29228 29916 31634 34055 35205 37499 37777 47490 49301 645 3803 8836 9470 11054 20253 29417 31243 31990 36468 38715 39932 43045 14572 18646 21100 26617 32033 32410 37195 38586 43833 44577 45584 46453 49515 6004 16982 17829 24616 28056 29646 32944 39051 42517 47086 48585 48772 49247 1306 1447 4898 7781 18587 25724 26672 35062 35202 37080 39781
- the parity check matrix initial value table with a coding rate of 8/30 is 100 3433 4111 9089 13360 24012 26305 30252 31430 31769 34689 34917 36091 40873 41983 42689 43835 44318 47109 3 48 124 2240 7029 21694 24565 29302 39777 42706 43631 43784 46033 47064 47079 47141 47239 47439 47479 2 5675 7056 12715 24128 26596 30571 38210 38586 41138 42272 43336 43444 43917 45812 46840 47245 47286 47510 2103 4285 10068 10702 12693 17619 18711 21309 22191 22999 37432 45646 46275 46338 46777 46860 46963 47432 47472 6827 8209 8606 10412 15670 19469 22205 22215 25425 29565 34843 34985 37686 39277
- the parity check matrix initial value table with a coding rate of 9/30 is 339 4777 5366 7623 13034 13260 15107 17772 20338 21178 25914 27663 29948 37489 41021 3871 5812 9795 23437 24079 27699 33471 39878 40302 41038 41217 42316 42765 43675 45118 3699 4072 16553 21492 26210 29839 30322 34139 38227 39696 40762 41156 41269 45168 45350 995 12194 12494 16542 20423 21950 23519 26215 26708 30587 38352 38840 39729 41645 43210 3963 4315 6832 11354 21042 21084 21108 25595 33109 34029 34448 35129 38018 39012 44791 164 887 2902 9021 9193 16705 17850 19241 25893 33427 37416 41024 41355 443
- the parity check matrix initial value table with a coding rate of 10/30 is 867 2733 2978 8947 10214 11810 13566 15922 18838 20543 25845 29179 30055 31284 33447 34330 35081 35605 36268 39563 42331 43174 2765 6017 6394 6769 12351 13567 15195 19900 23094 27077 28626 28914 32219 33106 33662 33905 34878 37861 39749 39862 40976 42690 2343 4231 7603 7789 8396 8783 15636 16221 20591 21538 24008 25117 25663 26817 29692 30937 31472 32070 33793 39506 41763 43172 8536 10705 10960 11206 12513 15399 17108 17224 17512 20180 25288 27824 28958 30600 36792 36828 38891 39575 39581 42342 42914
- the parity check matrix initial value table with a coding rate of 11/30 is 3208 6587 9493 9539 12368 12501 14811 15784 17625 18654 18721 19471 19503 20079 20411 20876 21493 22083 22430 27275 29322 32758 33227 33347 33715 34472 34711 38450 39151 39709 39862 40093 40497 40912 42 1118 3086 5466 6379 8483 9051 9330 13250 13898 14055 15033 18094 21429 22652 25251 28709 29909 30233 30472 30635 31367 32603 33614 33708 36404 36530 37039 37782 38115 38307 40225 40597 40822 5939 11990 15027 15162 16503 17171 17806 17902 18031 18077 21216 22134 22660 24170 28558 29364 30003 31128 32674 33103 33361 34196 344
- the data processing apparatus may be an independent apparatus or an internal block constituting one apparatus.
- This technology can provide an LDPC code with a good error rate.
- FIG. 3 is a block diagram illustrating a configuration example of a transmission device 11.
- FIG. 3 is a block diagram illustrating a configuration example of a bit interleaver 116.
- FIG. It is a figure which shows a check matrix.
- FIG. 6 is a diagram for explaining processing of a demultiplexer 25.
- FIG. 6 is a diagram for explaining processing of a demultiplexer 25. It is a figure which shows the Tanner graph about decoding of an LDPC code. And the parity matrix H T having a staircase structure, a diagram illustrating a Tanner graph corresponding to the parity matrix H T.
- An error rate obtained by the simulation is a diagram showing the relationship between the Doppler frequency f d of the flutter.
- An error rate obtained by the simulation is a diagram showing the relationship between the Doppler frequency f d of the flutter.
- 3 is a block diagram illustrating a configuration example of an LDPC encoder 115.
- FIG. 5 is a flowchart for explaining processing of an LDPC encoder 115.
- Fig. 38 is a diagram illustrating an example of a parity check matrix initial value table with the code rate 1/4 and the code length 16200. It is a figure explaining the method of calculating
- Fig. 38 is a diagram illustrating an example of a parity check matrix initial value table with the code rate 2/30 and the code length 64800.
- Fig. 38 is a diagram illustrating an example of a parity check matrix initial value table with the code rate 3/30 and the code length 64800.
- Fig. 38] Fig. 38 is a diagram illustrating an example of a parity check matrix initial value table with the code rate 4/30 and the code length 64800.
- FIG. 38 is a diagram illustrating an example of a parity check matrix initial value table with the code rate 5/30 and the code length 64800.
- Fig. 38 is a diagram illustrating an example of a parity check matrix initial value table with the code rate 6/30 and the code length 64800.
- Fig. 38 is a diagram illustrating an example of a parity check matrix initial value table with the code rate 7/30 and the code length 64800.
- Fig. 38] Fig. 38 is a diagram illustrating an example of a parity check matrix initial value table with the code rate 8/30 and the code length 64800.
- FIG. 38 is a diagram illustrating an example of a parity check matrix initial value table with the code rate 8/30 and the code length 64800.
- Fig. 38 is a diagram illustrating an example of a parity check matrix initial value table with the code rate 9/30 and the code length 64800.
- Fig. 38 is a diagram illustrating an example of a parity check matrix initial value table with the code rate 9/30 and the code length 64800.
- Fig. 38] Fig. 38 is a diagram illustrating an example of a parity check matrix initial value table with the code rate 10/30 and the code length 64800.
- FIG. 38 is a diagram illustrating an example of a parity check matrix initial value table with the code rate 10/30 and the code length 64800.
- Fig. 38 is a diagram illustrating an example of a parity check matrix initial value table with the code rate 11/30 and the code length 64800.
- Fig. 38 is a diagram illustrating an example of a parity check matrix initial value table with the code rate 11/30 and the code length 64800.
- Fig. 38] Fig. 38 is a diagram illustrating an example of a parity check matrix initial value table with the code rate 12/30 and the code length 64800.
- FIG. 38 is a diagram illustrating an example of a parity check matrix initial value table with the code rate 12/30 and the code length 64800.
- Fig. 38 is a diagram illustrating an example of a parity check matrix initial value table with the code rate 13/30 and the code length 64800.
- Fig. 38 is a diagram illustrating an example of a parity check matrix initial value table with the code rate 13/30 and the code length 64800.
- Fig. 38] Fig. 38 is a diagram illustrating an example of a parity check matrix initial value table with the code rate 14/30 and the code length 64800.
- FIG. 38 is a diagram illustrating an example of a parity check matrix initial value table with the code rate 14/30 and the code length 64800.
- Fig. 38 is a diagram illustrating an example of a parity check matrix initial value table with the code rate 15/30 and the code length 64800.
- Fig. 38 is a diagram illustrating an example of a parity check matrix initial value table with the code rate 15/30 and the code length 64800.
- Fig. 38] Fig. 38 is a diagram illustrating an example of a parity check matrix initial value table with the code rate 16/30 and the code length 64800.
- FIG. 38 is a diagram illustrating an example of a parity check matrix initial value table with the code rate 16/30 and the code length 64800.
- Fig. 38 is a diagram illustrating an example of a parity check matrix initial value table with the code rate 16/30 and the code length 64800.
- Fig. 38 is a diagram illustrating an example of a parity check matrix initial value table with the code rate 17/30 and the code length 64800.
- Fig. 38] Fig. 38 is a diagram illustrating an example of a parity check matrix initial value table with the code rate 17/30 and the code length 64800.
- Fig. 38] Fig. 38 is a diagram illustrating an example of a parity check matrix initial value table with the code rate 17/30 and the code length 64800.
- FIG. 38 is a diagram illustrating an example of a parity check matrix initial value table with the code rate 17/30 and the code length 64800.
- Fig. 38 is a diagram illustrating an example of a parity check matrix initial value table with the code rate 18/30 and the code length 64800.
- Fig. 38 is a diagram illustrating an example of a parity check matrix initial value table with the code rate 18/30 and the code length 64800.
- Fig. 38] Fig. 38 is a diagram illustrating an example of a parity check matrix initial value table with the code rate 18/30 and the code length 64800.
- Fig. 38] Fig. 38 is a diagram illustrating an example of a parity check matrix initial value table with the code rate 18/30 and the code length 64800.
- FIG. 38 is a diagram illustrating an example of a parity check matrix initial value table with the code rate 19/30 and the code length 64800.
- Fig. 38 is a diagram illustrating an example of a parity check matrix initial value table with the code rate 19/30 and the code length 64800.
- Fig. 38 is a diagram illustrating an example of a parity check matrix initial value table with the code rate 19/30 and the code length 64800.
- Fig. 38] Fig. 38 is a diagram illustrating an example of a parity check matrix initial value table with the code rate 20/30 and the code length 64800.
- FIG. 38 is a diagram illustrating an example of a parity check matrix initial value table with the code rate 20/30 and the code length 64800.
- Fig. 38 is a diagram illustrating an example of a parity check matrix initial value table with the code rate 20/30 and the code length 64800.
- Fig. 38 is a diagram illustrating an example of a parity check matrix initial value table with the code rate 21/30 and the code length 64800.
- Fig. 38] Fig. 38 is a diagram illustrating an example of a parity check matrix initial value table with the code rate 21/30 and the code length 64800.
- Fig. 38] Fig. 38 is a diagram illustrating an example of a parity check matrix initial value table with the code rate 21/30 and the code length 64800.
- FIG. 38 is a diagram illustrating an example of a parity check matrix initial value table with the code rate 21/30 and the code length 64800.
- Fig. 38 is a diagram illustrating an example of a parity check matrix initial value table with the code rate 22/30 and the code length 64800.
- Fig. 38 is a diagram illustrating an example of a parity check matrix initial value table with the code rate 22/30 and the code length 64800.
- Fig. 38] Fig. 38 is a diagram illustrating an example of a parity check matrix initial value table with the code rate 22/30 and the code length 64800.
- Fig. 38] Fig. 38 is a diagram illustrating an example of a parity check matrix initial value table with the code rate 22/30 and the code length 64800.
- FIG. 38 is a diagram illustrating an example of a parity check matrix initial value table with the code rate 23/30 and the code length 64800.
- Fig. 38 is a diagram illustrating an example of a parity check matrix initial value table with the code rate 23/30 and the code length 64800.
- Fig. 38 is a diagram illustrating an example of a parity check matrix initial value table with the code rate 23/30 and the code length 64800.
- Fig. 38] Fig. 38 is a diagram illustrating an example of a parity check matrix initial value table with the code rate 24/30 and the code length 64800.
- FIG. 38 is a diagram illustrating an example of a parity check matrix initial value table with the code rate 24/30 and the code length 64800.
- Fig. 38 is a diagram illustrating an example of a parity check matrix initial value table with the code rate 24/30 and the code length 64800.
- Fig. 38 is a diagram illustrating an example of a parity check matrix initial value table with the code rate 25/30 and the code length 64800.
- Fig. 38] Fig. 38 is a diagram illustrating an example of a parity check matrix initial value table with the code rate 25/30 and the code length 64800.
- Fig. 38] Fig. 38 is a diagram illustrating an example of a parity check matrix initial value table with the code rate 25/30 and the code length 64800.
- FIG. 38 is a diagram illustrating an example of a parity check matrix initial value table with the code rate 25/30 and the code length 64800.
- Fig. 38 is a diagram illustrating an example of a parity check matrix initial value table with the code rate 26/30 and the code length 64800.
- Fig. 38 is a diagram illustrating an example of a parity check matrix initial value table with the code rate 26/30 and the code length 64800.
- Fig. 38] Fig. 38 is a diagram illustrating an example of a parity check matrix initial value table with the code rate 26/30 and the code length 64800.
- Fig. 38] Fig. 38 is a diagram illustrating an example of a parity check matrix initial value table with the code rate 26/30 and the code length 64800.
- FIG. 38 is a diagram illustrating an example of a parity check matrix initial value table with the code rate 27/30 and the code length 64800.
- Fig. 38 is a diagram illustrating an example of a parity check matrix initial value table with the code rate 27/30 and the code length 64800.
- Fig. 38 is a diagram illustrating an example of a parity check matrix initial value table with the code rate 27/30 and the code length 64800.
- Fig. 38] Fig. 38 is a diagram illustrating an example of a parity check matrix initial value table with the code rate 27/30 and the code length 64800.
- Fig. 38] Fig. 38 is a diagram illustrating an example of a parity check matrix initial value table with the code rate 27/30 and the code length 64800.
- FIG. 38 is a diagram illustrating an example of a parity check matrix initial value table with the code rate 28/30 and the code length 64800.
- Fig. 38 is a diagram illustrating an example of a parity check matrix initial value table with the code rate 28/30 and the code length 64800.
- Fig. 38 is a diagram illustrating an example of a parity check matrix initial value table with the code rate 28/30 and the code length 64800.
- Fig. 38] Fig. 38 is a diagram illustrating an example of a parity check matrix initial value table with the code rate 28/30 and the code length 64800.
- Fig. 38] Fig. 38 is a diagram illustrating an example of a parity check matrix initial value table with the code rate 28/30 and the code length 64800.
- FIG. 38 is a diagram illustrating an example of a parity check matrix initial value table with the code rate 29/30 and the code length 64800.
- Fig. 38 is a diagram illustrating an example of a parity check matrix initial value table with the code rate 29/30 and the code length 64800.
- Fig. 38 is a diagram illustrating an example of a parity check matrix initial value table with the code rate 29/30 and the code length 64800.
- Fig. 38] Fig. 38 is a diagram illustrating an example of a parity check matrix initial value table with the code rate 29/30 and the code length 64800. It is a figure which shows the example of the Tanner graph of the ensemble of a degree sequence that column weight is 3 and row weight is 6.
- FIG. 38 shows the example of the Tanner graph of the ensemble of a degree sequence that column weight is 3 and row weight is 6.
- FIG. 12 is a flowchart for describing processing performed by a QAM decoder 164, a bit deinterleaver 165, and an LDPC decoder 166. It is a figure which shows the example of the check matrix of a LDPC code. It is a figure which shows the matrix (conversion test matrix) which performed row substitution and column substitution to the check matrix.
- FIG. 3 is a block diagram illustrating a configuration example of an LDPC decoder 166.
- FIG. It is a figure explaining the process of the multiplexer 54 which comprises the bit deinterleaver 165.
- FIG. It is a figure explaining the process of the column twist deinterleaver.
- FIG. It is a block diagram which shows the 1st structural example of the receiving system which can apply the receiving device.
- FIG. 18 is a block diagram illustrating a configuration example of an embodiment of a computer to which the present technology is applied.
- FIG. 7 shows a transmission system to which the present technology is applied (a system is a logical collection of a plurality of devices, regardless of whether or not each component device is in the same housing). The structural example of embodiment is shown.
- the transmission system includes a transmission device 11 and a reception device 12.
- the transmission device 11 transmits (broadcasts) (transmits) a television broadcast program, for example. That is, the transmission device 11 encodes target data to be transmitted, such as image data and audio data as a program, into an LDPC code, for example, a satellite line, a terrestrial wave, a cable (wired line), or the like. It transmits via the communication path 13.
- target data to be transmitted such as image data and audio data as a program
- an LDPC code for example, a satellite line, a terrestrial wave, a cable (wired line), or the like. It transmits via the communication path 13.
- the receiving device 12 receives the LDPC code transmitted from the transmitting device 11 via the communication path 13, decodes it into the target data, and outputs it.
- the LDPC code used in the transmission system of FIG. 7 exhibits extremely high capability in an AWGN (Additive White Gaussian Noise) channel.
- AWGN Additional White Gaussian Noise
- a burst error or erasure may occur in the communication path 13.
- D / U Desired to Undesired Ratio
- Desired main path power
- a burst error may occur due to the state of the wiring from the receiving unit (not shown) such as an antenna that receives a signal from the transmitting device 11 to the receiving device 12 on the receiving device 12 side or the instability of the power supply of the receiving device 12. May occur.
- the code bit (received value u 0i of the LDPC code) at the variable node corresponding to the column of the parity check matrix H and thus the code bit of the LDPC code. Since the variable node operation of the expression (1) with the addition of) is performed, if an error occurs in the sign bit used for the variable node operation, the accuracy of the required message is reduced.
- the check node performs the check node calculation of Expression (7) using the message obtained by the variable node connected to the check node, so that a plurality of connected variable nodes ( When the number of check nodes in which the error (including erasure) of the code bits of the LDPC code corresponding to) simultaneously increases, the decoding performance deteriorates.
- the check node sends a message with an equal probability of a probability of 0 and a probability of 1 to all the variable nodes. return.
- a check node that returns an equiprobable message does not contribute to one decoding process (one set of variable node calculation and check node calculation), and as a result, requires a large number of repetitions of the decoding process. As a result, the decoding performance deteriorates, and the power consumption of the receiving apparatus 12 that decodes the LDPC code increases.
- FIG. 8 is a block diagram illustrating a configuration example of the transmission device 11 of FIG.
- one or more input streams (Input Streams) as target data are supplied to a Mode Adaptation / Multiplexer 111.
- the mode adaptation / multiplexer 111 performs processing such as mode selection and multiplexing of one or more input streams supplied thereto as necessary, and supplies the resulting data to a padder 112. .
- the padder 112 performs necessary zero padding (Null insertion) on the data from the mode adaptation / multiplexer 111 and supplies the resulting data to the BB scrambler 113.
- the BB scrambler 113 subjects the data from the padder 112 to BB scramble (Base-Band Scrambling), and supplies the resulting data to a BCH encoder (BCH encoder) 114.
- BCH encoder BCH encoder
- the BCH encoder 114 BCH-encodes the data from the BB scrambler 113, and supplies the resulting data to an LDPC encoder 115 as LDPC target data that is an LDPC encoding target.
- the LDPC encoder 115 performs LDPC encoding on the LDPC target data from the BCH encoder 114 according to a parity check matrix in which a parity matrix that is a part corresponding to the parity bits of the LDPC code has a staircase structure. Output LDPC code as information bits.
- the LDPC encoder 115 sets the LDPC target data to the LDPC (corresponding to the check matrix) defined in a predetermined standard such as DVB-S.2, DVB-T.2, or DVB-C.2.
- LDPC encoding is performed to encode a code, a predetermined LDPC code (corresponding to the parity check matrix), and the resulting LDPC code is output.
- the LDPC code defined in the DVB-S.2, DVB-T.2, and DVB-C.2 standards is an IRA (Irregular Repeat Accumulate) code, and the parity in the parity check matrix of the LDPC code
- the matrix has a staircase structure. The parity matrix and the staircase structure will be described later.
- IRA codes for example, “Irregular Repeat-Accumulate Codes,” H. Jin, A. Khandekar, and R. J. McEliece, in Proceedings of 2nd International Symposium on Turbo codes and Related Topics-8 , Sept. 2000.
- the LDPC code output from the LDPC encoder 115 is supplied to the bit interleaver 116.
- the bit interleaver 116 performs bit interleaving described later on the LDPC code from the LDPC encoder 115, and supplies the LDPC code after the bit interleaving to a QAM encoder (QAM encoder) 117.
- QAM encoder QAM encoder
- the QAM encoder 117 maps the LDPC code from the bit interleaver 116 to a signal point representing one symbol of orthogonal modulation in units of one or more code bits (symbol unit) of the LDPC code and performs orthogonal modulation ( Multilevel modulation).
- the QAM encoder 117 converts the LDPC code from the bit interleaver 116 into an IQ plane (IQ constellation) defined by an I axis representing an I component in phase with the carrier and a Q axis representing a Q component orthogonal to the carrier. ) Perform the quadrature modulation by mapping to the signal points determined by the modulation method that performs the quadrature modulation of the LDPC code.
- IQ plane IQ constellation
- a modulation method of quadrature modulation performed by the QAM encoder 117 for example, a modulation method defined in the DVB-S.2, DVB-T.2, DVB-C.2 standard, or the like Modulation method, for example, BPSK (Binary Phase Shift Keying), QPSK (Quadrature Phase Shift Shift Keying), 16APSK (Amplitude Phase Shift-Keying), 32APSK, 16QAM (Quadrature Amplitude Modulation), 64QAM, 256QAM, 1024QAM, 4096QAM, 4PAM (Pulse Amplitude Modulation) etc.
- Which modulation method is used to perform quadrature modulation in the QAM encoder 117 is set in advance in accordance with, for example, the operation of the operator of the transmission apparatus 11.
- Time Interleaver Time Interleaver
- the time interleaver 118 performs time interleaving (interleaving in the time direction) on the data (symbol) from the QAM encoder 117, and obtains the resulting data as a MISO / MIMO encoder (MISO / MIMO encoder) 119. To supply.
- the MISO / MIMO encoder 119 performs space-time coding on the data (symbol) from the time interleaver 118 and supplies it to a frequency interleaver 120.
- the frequency interleaver 120 performs frequency interleaving (interleaving in the frequency direction) on the data (symbol) from the MISO / MIMO encoder 119 and supplies the data to a frame builder / resource allocation unit (Frame Builder & Resource Allocation) 131. To do.
- the BCH encoder 121 is supplied with control data (signalling) for transmission control such as BB signaling (Base Band Signaling) (BB Header).
- BB signaling Basic Band Signaling
- the BCH encoder 121 performs BCH encoding on the control data supplied thereto in the same manner as the BCH encoder 114, and supplies the resulting data to the LDPC encoder 122.
- the LDPC encoder 122 performs LDPC encoding on the data from the BCH encoder 121 as LDPC target data in the same manner as the LDPC encoder 115, and supplies the resulting LDPC code to the QAM encoder 123.
- the QAM encoder 123 converts the LDPC code from the LDPC encoder 122 into a signal point representing one symbol of orthogonal modulation in units of one or more code bits (symbol unit) of the LDPC code.
- the orthogonal modulation is performed by mapping, and data (symbol) obtained as a result is supplied to the frequency interleaver 124.
- the frequency interleaver 124 performs frequency interleaving on the data (symbol) from the QAM encoder 123 in units of symbols and supplies the data to the frame builder / resource allocation unit 131.
- the frame builder / resource allocation unit 131 inserts pilot symbols at necessary positions of the data (symbols) from the frequency interleavers 120 and 124, and from the resulting data (symbols), a predetermined number
- a frame composed of a number of symbols for example, a PL (Physical Layer) frame, a T2 frame, a C2 frame, etc.
- OFDM generation OFDM generation
- the OFDM generation unit 132 generates an OFDM signal corresponding to the frame from the frame from the frame builder / resource allocation unit 131, and transmits the OFDM signal via the communication path 13 (FIG. 7).
- the transmission apparatus 11 is configured without providing some of the blocks illustrated in FIG. 8 such as the time interleaver 118, the MISO / MIMO encoder 119, the frequency interleaver 120, and the frequency interleaver 124, for example. Can do.
- FIG. 9 shows a configuration example of the bit interleaver 116 of FIG.
- the bit interleaver 116 is a data processing device that interleaves data, and includes a parity interleaver 23, a column twist interleaver 24, and a demultiplexer (DEMUX) 25. Note that the bit interleaver 116 can be configured without providing one or both of the parity interleaver 23 and the column twist interleaver 24.
- the parity interleaver 23 performs parity interleaving for interleaving the parity bits of the LDPC code from the LDPC encoder 115 to the positions of other parity bits, and supplies the LDPC code after the parity interleaving to the column twist interleaver 24.
- the column twist interleaver 24 performs column twist interleaving on the LDPC code from the parity interleaver 23 and supplies the LDPC code after the column twist interleaving to the demultiplexer 25.
- the LDPC code is transmitted in the QAM encoder 117 of FIG. 8 by mapping one or more code bits of the LDPC code to a signal point representing one symbol of orthogonal modulation.
- the column twist interleaver 24 uses a parity interleaver 23 so that a plurality of code bits of the LDPC code corresponding to 1 in any one row of the parity check matrix used in the LDPC encoder 115 are not included in one symbol. As rearrangement processing for rearranging the code bits of the LDPC code, for example, column twist interleaving as described later is performed.
- the demultiplexer 25 obtains an LDPC code with enhanced resistance to AWGN by performing an exchange process for exchanging positions of two or more code bits of the LDPC code as a symbol for the LDPC code from the column twist interleaver 24. Then, the demultiplexer 25 supplies two or more code bits of the LDPC code obtained by the replacement process to the QAM encoder 117 (FIG. 8) as a symbol.
- FIG. 10 shows a parity check matrix H used for LDPC encoding by the LDPC encoder 115 of FIG.
- LDGM Low-Density Generation Matrix
- the number of information bits and the number of parity bits in the code bits of one LDPC code are referred to as information length K and parity length M, respectively, and one LDPC.
- the information length K and the parity length M for an LDPC code having a certain code length N are determined by the coding rate.
- the parity check matrix H is an M ⁇ N matrix with rows ⁇ columns. Then, the information matrix H A, becomes the matrix of M ⁇ K, the parity matrix H T is a matrix of M ⁇ M.
- DVB-S.2 shows a parity matrix H T of the parity DVB-T.2, and parity check matrix H of an LDPC code prescribed in DVB-C.2 standards.
- DVB-T.2 like parity matrix H T of the parity check matrix H of an LDPC code of which is specified in the Standard, as shown in FIG. 11, first element is, so to speak a matrix of step structure arranged stepwise (lower bidiagonal matrix).
- the row weight of the parity matrix H T is 1 for the first row and 2 for all the remaining rows.
- the column weight is 1 for the last column and 2 for all the remaining columns.
- LDPC codes of the check matrix H the parity matrix H T has a staircase structure can be using the check matrix H, readily produced.
- an LDPC code (one codeword), together represented by a row vector c, and column vector obtained by transposing the row vector is represented as c T. Further, in the row vector c which is an LDPC code, the information bit portion is represented by the row vector A, and the parity bit portion is represented by the row vector T.
- FIG. 12 is a diagram for explaining a parity check matrix H of an LDPC code defined in a standard such as DVB-T.2.
- the column weight is X, and for the subsequent K3 column, the column weight is 3, and then For the M-1 column, the column weight is 2, and for the last column, the column weight is 1.
- KX + K3 + M-1 + 1 is equal to the code length N.
- FIG. 13 is a diagram showing the number of columns KX, K3, and M, and the column weight X for each coding rate r of the LDPC code defined in the DVB-T.2 standard and the like.
- Standards such as DVB-T.2 specify LDPC codes with code length N of 64800 bits and 16200 bits.
- LDPC code having a code length N of 64,800 bits 11 coding rates (nominal rates) 1/4, 1/3, 2/5, 1/2, 3/5, 2/3, 3 / 4, 4/5, 5/6, 8/9, and 9/10 are defined, and for an LDPC code having a code length N of 16200 bits, 10 coding rates 1/4, 1/3, 2/5, 1/2, 3/5, 2/3, 3/4, 4/5, 5/6, and 8/9 are specified.
- the code length N of 64800 bits is also referred to as 64k bits
- the code length N of 16200 bits is also referred to as 16k bits.
- the column weight on the head side (left side) tends to be large.
- the LDPC code corresponding to H the first code bit tends to be more resistant to errors (tolerant to errors), and the last code bit tends to be weaker to errors.
- FIG. 14 shows an example of arrangement of 16 symbols (corresponding signal points) on the IQ plane when 16QAM is performed by the QAM encoder 117 of FIG.
- a in FIG. 14 shows a 16QAM symbol of DVB-T.2.
- the 16 symbols are arranged so that the I direction ⁇ Q direction is a 4 ⁇ 4 square shape with the origin of the IQ plane as the center.
- bit y i + 1 bit from the most significant bit in the bit string represented by one symbol is represented as bit y i
- the four bits represented by one symbol of 16QAM are bit y 0 in order from the most significant bit. , y 1 , y 2 , y 3 .
- 4 code bits of the LDPC code is (symbolized) into 4-bit y 0 to y 3 symbol (symbol value).
- FIG. 14B shows bit boundaries for each of 4 bits (hereinafter also referred to as symbol bits) y 0 to y 3 represented by a 16QAM symbol.
- the symbol bit y i represented by a symbol is more likely to be erroneous (lower error probability) the more symbols are away from the bit boundary, and more likely to be error (higher error probability) as there are more symbols near the bit boundary.
- strong to errors a bit that is hard to error
- weak to errors a bit that is easy to error
- 4 symbol bits y 0 to y 3 of a 16QAM symbol 4 symbol bits y 0 to y 3 of a 16QAM symbol .
- the most significant symbol bit y 0 and the second symbol bit y 1 are strong bits
- the third symbol bit y 2 and the fourth symbol bit y 3 are weak bits. .
- 15 to 17 show examples of arrangement of 64 symbols (corresponding signal points) on the IQ plane when 64QAM is performed by the QAM encoder 117 of FIG. 8, that is, 16QAM of DVB-T.2. The symbol is shown.
- One symbol bit of 64QAM can be expressed as bits y 0 , y 1 , y 2 , y 3 , y 4 , y 5 in order from the most significant bit.
- the 6 code bits of the LDPC code are the symbol bit y 0 no 6-bit to the symbol y 5.
- FIG. 15 shows bit boundaries for the most significant symbol bit y 0 and the second symbol bit y 1 among the symbol bits y 0 to y 5 of the 64QAM symbol, and FIG. th symbol bit y 2, the bit boundaries for the fourth symbol bit y 3, respectively, FIG. 17, the fifth symbol bit y 4, the bit boundaries for the sixth symbol bit y 5, respectively, each Show.
- the symbol bits y 0 of the uppermost bit boundaries for the second symbol bit y 1, respectively, has at one place. Also, as shown in FIG. 16, there are two bit boundaries for each of the third symbol bit y 2 and the fourth symbol bit y 3 , and as shown in FIG. 17, the fifth symbol bit There are four bit boundaries for bit y 4 and sixth symbol bit y 5 .
- the most significant symbol bit y 0 and the second symbol bit y 1 are strong bits, and the third symbol bits y 2 and 4 th symbol bit y 3 has become a strong bit to the next.
- the fifth symbol bit y 4 and the sixth symbol bit y 5 are weak bits.
- FIG. 18 shows an arrangement of four symbols (corresponding signal points) on the IQ plane when a satellite channel is adopted as the communication path 13 (FIG. 7) and QPSK is performed by the QAM encoder 117 of FIG. It is a figure which shows the example, ie, the symbol of QPSK of DVB-S.2, for example.
- a symbol is mapped to one of four signal points on a circle with a radius ⁇ of 1 centered on the origin on the IQ plane.
- FIG. 19 shows an example of arrangement of 8 symbols on the IQ plane when a satellite channel is employed as the communication path 13 (FIG. 7) and 8PSK is performed by the QAM encoder 117 of FIG. 8, that is, for example, DVB It is a figure which shows the symbol of 8PSK of -S.2.
- DVB-S.2 8PSK a symbol is mapped to one of eight signal points on the circumference of a circle with a radius ⁇ of 1 centered on the origin on the IQ plane.
- FIG. 20 shows an example of arrangement of 16 symbols on the IQ plane when a satellite channel is adopted as the communication path 13 (FIG. 7) and 16 APSK is performed by the QAM encoder 117 of FIG. 8, that is, for example, DVB It is a figure which shows the symbol of 16APSK of -S.2.
- 20A shows the arrangement of 16 APSK signal points in DVB-S.2.
- a symbol has four signal points on the circumference of a circle with a radius of R 1 centered at the origin on the IQ plane, and a radius of R 2 (> R 1 ).
- the 12 signal points on the circumference of the circle are mapped to any one of 16 signal points in total.
- the ratio ⁇ between the radii R 2 and R 1 is different for each coding rate.
- FIG. 21 shows an example of arrangement of 32 symbols on the IQ plane when a satellite channel is employed as the communication path 13 (FIG. 7) and 32APSK is performed by the QAM encoder 117 of FIG. 8, that is, for example, DVB It is a figure which shows the symbol of -32 APSK of -S.2.
- 21A shows the arrangement of the 32APSK signal points of DVB-S.2.
- a symbol consists of four signal points on the circumference of a circle with a radius of R 1 centered at the origin on the IQ plane and a circle with a radius of R 2 (> R 1 ). 12 signal points on the circumference and 16 signal points on the circumference of the circle having a radius of R 3 (> R 2 ) are mapped to any one of 32 signal points in total.
- the ratio gamma 1 and radius R 2 and R 1 and the radius R 3 and the ratio gamma 2 and R 1 are different for each code rate.
- the LDPC code output from the LDPC encoder 115 includes a code bit that is resistant to errors and a code bit that is vulnerable to errors.
- the symbol bits of the orthogonal modulation symbols performed by the QAM encoder 117 include strong bits and weak bits.
- FIG. 22 is a diagram for explaining the processing of the demultiplexer 25 in FIG.
- a in FIG. 22 shows a functional configuration example of the demultiplexer 25.
- the demultiplexer 25 includes a memory 31 and a replacement unit 32.
- the memory 31 is supplied with the LDPC code from the LDPC encoder 115.
- the memory 31 has a storage capacity for storing mb bits in the row (horizontal) direction and N / (mb) bits in the column (vertical) direction, and the LDPC supplied thereto The sign bit of the code is written in the column direction, read in the row direction, and supplied to the switching unit 32.
- N information length K + parity length M
- m represents the number of code bits of an LDPC code that is one symbol
- b is a predetermined positive integer, which is a multiple used to multiply m by an integer.
- the demultiplexer 25 uses the sign bit of the LDPC code as a symbol (symbolizes), and the multiple b represents the number of symbols that the demultiplexer 25 obtains by so-called symbolization.
- FIG. 22A shows a configuration example of the demultiplexer 25 in the case where the modulation scheme is 64QAM or the like that maps symbols to any of 64 signal points. Therefore, the sign bit of the LDPC code that becomes one symbol The number of bits m is 6 bits.
- the multiple b is 1. Therefore, the memory 31 has a storage capacity of N / (6 ⁇ 1) ⁇ (6 ⁇ 1) bits in the column direction ⁇ row direction.
- the storage area of the memory 31 extending in the column direction and having a 1-bit row direction is hereinafter referred to as a column as appropriate.
- the code bits of the LDPC code are written from the top to the bottom (column direction) of the columns constituting the memory 31 from the left to the right columns.
- the sign bit When writing of the sign bit is completed to the bottom of the rightmost column, the sign bit is changed in units of 6 bits (mb bits) in the row direction from the first row of all the columns constituting the memory 31. It is read out and supplied to the replacement unit 32.
- the exchanging unit 32 performs an exchanging process of exchanging the positions of the 6-bit code bits from the memory 31, and the 6 bits obtained as a result are replaced with 6 symbol bits y 0 , y 1 , y 2 , y representing one symbol of 64QAM. 3, and outputs a y 4, y 5.
- mb bits (6 bits in this case) of code bits are read from the memory 31 in the row direction, and the i-th bit from the most significant bit of the mb bits of code bits read from the memory 31 is read out.
- bit b i the 6-bit code bits read out from the memory 31 in the row direction are bits b 0 , It can be expressed as b 1 , b 2 , b 3 , b 4 , b 5 .
- the sign bit in the direction of bit b 0 is a sign bit that is resistant to errors in the relationship of the column weights described in FIGS. 12 and 13, and the sign bit in the direction of bit b 5 is a sign that is vulnerable to errors. It is a bit.
- the 6-bit code bits b 0 to b 5 from the memory 31 are assigned the error-sensitive code bits to the strong bits of the 64QAM 1-symbol symbol bits y 0 to y 5. As shown in the figure, it is possible to perform an exchange process for exchanging the positions of the 6-bit code bits b 0 to b 5 from the memory 31.
- FIG. 22B shows the first replacement method
- FIG. 22C shows the second replacement method
- FIG. 22D shows the third replacement method.
- FIG. 23 shows 64QAM or the like in which the modulation scheme maps a symbol to one of 64 signal points (therefore, the number m of code bits of an LDPC code mapped to one symbol is 6 as in FIG.
- a configuration example of the demultiplexer 25 when the multiple b is 2) and a fourth replacement method are shown.
- FIG. 23A shows the order of writing LDPC codes to the memory 31.
- the code bits of the LDPC code are written from the top to the bottom (column direction) of the columns constituting the memory 31. Is called.
- the sign bit When the writing of the sign bit is completed to the bottom of the rightmost column, the sign bit is set in units of 12 bits (mb bits) in the row direction from the first row of all the columns constituting the memory 31. It is read out and supplied to the replacement unit 32.
- the exchanging unit 32 performs an exchanging process of exchanging the positions of the 12-bit code bits from the memory 31 by the fourth exchanging method, and the 12 bits obtained as a result represent 2 symbols (b symbols) of 64QAM. 12 bits, that is, 6 symbol bit y 0 representing a symbol of 64QAM, y 1, y 2, y 3, y 4, and y 5, 6 symbol bits y 0 representing the next one symbol, y 1, y 2 , y 3 , y 4 , y 5
- B in FIG. 23 shows a fourth replacement method of the replacement processing by the replacement unit 32 in A of FIG.
- mb code bits are allocated to mb symbol bits of b consecutive symbols.
- bit (symbol bit) y i the (i + 1) -th bit from the most significant bit of the mb bit of b consecutive symbols.
- parity interleaving by the parity interleaver 23 in FIG. 9 will be described with reference to FIGS.
- FIG. 24 shows (part of) a Tanner graph of a parity check matrix of an LDPC code.
- variable nodes corresponding code bits
- all of the check nodes connected to the check node are connected.
- a message having a probability that the value is 0 and the probability that the value is 1 is returned to the variable node. For this reason, if a plurality of variable nodes connected to the same check node simultaneously become erasures or the like, the decoding performance deteriorates.
- LDPC encoder 115 of FIG. 8 outputs, LDPC code prescribed in standards such as DVB-S.2 is IRA code, parity matrix H T of the parity check matrix H, as shown in FIG. 11 It has a staircase structure.
- FIG. 25 shows a parity matrix H T having a staircase structure and a Tanner graph corresponding to the parity matrix H T.
- a in FIG. 25 shows a parity matrix H T having a staircase structure
- B in FIG. 25 shows a Tanner graph corresponding to the parity matrix H T in A in FIG.
- parity matrix H T has a staircase structure, in each row (except the first row) first element is adjacent. Therefore, in the Tanner graph of the parity matrix H T, the value of the parity matrix H T corresponding to the columns of two adjacent elements are set to 1, the two variable nodes adjacent, connected to the same check node Yes.
- the parity bits corresponding to the two adjacent variable nodes mentioned above simultaneously become an error due to a burst error, an erasure, or the like, two variable nodes corresponding to the two parity bits in error (using the parity bit). Since the check node connected to the variable node that seeks the message returns the message having the same probability of 0 and 1 to the variable node connected to the check node, the decoding performance is improved. to degrade. When the burst length (the number of parity bits that continuously cause an error) increases, the number of check nodes that return messages with equal probability increases, and the decoding performance further deteriorates.
- the parity interleaver 23 (FIG. 9) performs parity interleaving for interleaving the parity bits of the LDPC code from the LDPC encoder 115 to the positions of other parity bits in order to prevent the above-described degradation in decoding performance. .
- Figure 26 illustrates a parity matrix H T of the parity check matrix H corresponding to the LDPC code after parity interleave to the parity interleaver 23 of FIG. 9 is performed.
- the information matrix H A of the parity check matrix H corresponding to the LDPC code defined in the DVB-S.2 standard and the like output from the LDPC encoder 115 has a cyclic structure.
- a cyclic structure is a structure in which a column matches a cyclic shift of another column.For example, for each P column, the position of 1 in each row of the P column is the first of the P column.
- a structure in which the column is cyclically shifted in the column direction by a value proportional to the value q obtained by dividing the parity length M is also included.
- the P column in the cyclic structure is referred to as the number of columns in the cyclic structure unit as appropriate.
- LDPC codes having a code length N of 64800 bits and 16200 bits as LDPC codes defined in the DVB-S.2 standard.
- N 64800 bits
- 16200 bits 16200 bits
- the number P of columns in the unit of the cyclic structure is defined as 360, which is one of the divisors excluding 1 and M among the divisors of the parity length M.
- the parity interleaver 23 sets the information length to K, sets x to an integer between 0 and less than P, and sets y to an integer between 0 and less than q.
- the K + qx + y + 1-th code bit is interleaved at the position of the K + Py + x + 1-th code bit.
- the K + qx + y + 1-th code bit and the K + Py + x + 1-th code bit are both the K + 1-th code bit and the subsequent parity bits, and are therefore parity bits. According to interleaving, the position of the parity bit of the LDPC code is moved.
- variable nodes connected to the same check node are separated by the number of columns P of the cyclic structure unit, that is, 360 bits here, so the burst length is In the case of less than 360 bits, it is possible to avoid a situation in which a plurality of variable nodes connected to the same check node cause an error at the same time, and as a result, it is possible to improve resistance to burst errors.
- the LDPC code after parity interleaving that interleaves the K + qx + y + 1-th code bit at the position of the K + Py + x + 1-th code bit is K + qx + of the original parity check matrix H.
- the pseudo cyclic structure means a structure in which a part except for a part has a cyclic structure.
- the transform parity check matrix obtained by performing column replacement equivalent to parity interleaving on the parity check matrix of the LDPC code specified in the DVB-S.2 standard, etc. is 360 rows by 360 columns.
- the part the shift matrix described later
- only one element of 1 is present (it is an element of 0), and in this respect, it is not a (complete) cyclic structure but a pseudo cyclic structure.
- the conversion check matrix in FIG. 26 replaces the original check matrix H with column replacement corresponding to parity interleaving, as well as row replacement so that the conversion check matrix is configured with a configuration matrix described later. (Row replacement) is also applied to the matrix.
- LDPC 8 transmits one or more code bits of the LDPC code as one symbol. That is, for example, when 2 bits of code bits are used as one symbol, QPSK is used as a modulation system, for example. When 4 bits of code bits are used as 1 symbol, a modulation system is used. For example, 16APSK or 16QAM is used.
- the information matrix HA has a cyclic structure
- the parity matrix H T Has a staircase structure.
- FIG. 27 shows a conversion check matrix
- a in FIG. 27 shows a conversion parity check matrix of a parity check matrix H of an LDPC code having a code length N of 64,800 bits and a coding rate (r) of 3/4.
- FIG. 27B shows processing performed by the demultiplexer 25 (FIG. 9) for the LDPC code of the conversion check matrix of FIG. 27A, that is, the LDPC code after parity interleaving.
- the modulation method is a method of mapping symbols to any of 16 signal points, such as 16APSK or 16QAM
- the four columns constituting the memory 31 of the demultiplexer 25 are subjected to parity interleaving.
- the sign bit of the LDPC code is written in the column direction.
- the sign bit written in the column direction in the four columns constituting the memory 31 is read out in units of 4 bits in the row direction to become one symbol.
- 4-bit code bits B 0 , B 1 , B 2 , and B 3 that are one symbol are code bits corresponding to 1 in any one row of the conversion check matrix of A in FIG.
- the variable nodes corresponding to the sign bits B 0 , B 1 , B 2 , and B 3 are connected to the same check node.
- the column twist interleaver 24 performs a process after parity interleaving from the parity interleaver 23 so that a plurality of code bits corresponding to 1 in any one row of the conversion check matrix are not included in one symbol. Column twist interleaving is performed to interleave the code bits of the LDPC code.
- FIG. 28 is a diagram for explaining column twist interleaving.
- FIG. 28 shows the memory 31 (FIGS. 22 and 23) of the demultiplexer 25.
- the memory 31 stores N / (mb) bits in the column (vertical) direction and has a storage capacity for storing mb bits in the row (horizontal) direction.
- Consists of The column twist interleaver 24 performs column twist interleaving by controlling the write start position when writing the code bits of the LDPC code in the column direction and reading in the row direction to the memory 31.
- a plurality of code bits, which are read as one symbol, are read out in the row direction by appropriately changing the write start position at which code bit writing is started for each of a plurality of columns.
- the sign bit corresponding to 1 in any one row of the conversion parity check matrix is prevented (a plurality of code bits corresponding to 1 in any one row of the parity check matrix are not included in the same symbol.
- the code bits of the LDPC code are rearranged).
- the column twist interleaver 24 writes the code bits of the LDPC code from the top to the bottom (column direction) of the four columns constituting the memory 31 (instead of the demultiplexer 25 in FIG. 22). Towards the direction column.
- the column twist interleaver 24 starts from the first row of all the columns constituting the memory 31 in the row direction in units of 4 bits (mb bits).
- the code bit is read out and output to the switching unit 32 (FIGS. 22 and 23) of the demultiplexer 25 as an LDPC code after column twist interleaving.
- the address at the top (top) position of each column is 0 and the address at each position in the column direction is expressed as an integer in ascending order
- the starting position of writing is the position where the address is 0, the second column (from the left) is the starting position of writing, the address is the position 2, and the third column is the starting position of writing.
- the address is at position 4, and for the fourth column, the write start position is the position at address 7.
- the writing start position is other than the position where the address is 0
- the writing start position After writing the sign bit to the lowest position, it returns to the beginning (position where the address is 0), and the writing start position. Writing up to the position immediately before is performed. Thereafter, writing to the next (right) column is performed.
- FIG. 29 shows the number of columns of the memory 31 necessary for column twist interleaving and the writing of LDPC codes of 11 coding rates defined in the DVB-T.2 standard and having a code length N of 64800. The address of the starting position is shown for each modulation method.
- the write start position of the first column of the two columns of the memory 31 is the position where the address is 0, and the write start position of the second column is the position where the address is 2.
- the memory 31 is arranged in the row direction according to FIG. It has 4 columns for storing 2 ⁇ 2 bits and stores 64800 / (2 ⁇ 2) bits in the column direction.
- the first column write start position is the address 0 position
- the second column write start position is the address 2 position
- the third column The start position of writing in the column is the position where the address is 4
- the start position of writing in the fourth column is the position where the address is 7.
- the multiple b is 2.
- the memory 31 is arranged in the row direction according to FIG. It has four columns for storing 4 ⁇ 1 bits, and stores 64800 / (4 ⁇ 1) bits in the column direction.
- the first column write start position is the address 0 position
- the second column write start position is the address 2 position
- the write start position of the second column is the position where the address is 4
- the write start position of the fourth column is the position where the address is 7.
- the memory 31 is arranged in the row direction according to FIG. It has 8 columns for storing 4 ⁇ 2 bits and stores 64800 / (4 ⁇ 2) bits in the column direction.
- the first column write start position is the address 0 position
- the second column write start position is the address 0 position
- the start position of the second column is the position where the address is 2
- the start position of the fourth column is the position where the address is 4
- the start position of the fifth column is the position where the address is 4.
- the position and the start position of writing in the sixth column are the position where the address is 5
- the start position of writing in the seventh column is the position where the address is 7, and the starting position of the eighth column is The address is made with 7 positions, respectively.
- the memory 31 is arranged in the row direction according to FIG. It has 6 columns for storing 6 ⁇ 1 bits, and stores 64800 / (6 ⁇ 1) bits in the column direction.
- the first column write start position is the address 0 position
- the second column write start position is the address 2 position
- the first column write position is the address 5 position
- the fourth column write start position is the address 9 position
- the fifth column write start position is the address 10.
- the position and the position at the beginning of writing in the sixth column are the position where the address is 13, respectively.
- the memory 31 is arranged in the row direction according to FIG. It has 12 columns for storing 6 ⁇ 2 bits, and stores 64800 / (6 ⁇ 2) bits in the column direction.
- the first column write start position is the address 0 position
- the second column write start position is the address 0 position
- the start position of the second column is the position where the address is 2
- the start position of the fourth column is the position where the address is 2
- the start position of the fifth column is the position where the address is 3.
- the position and the start position of the 6th column are the position where the address is 4
- the start position of the 7th column is the position where the address is 4
- the start position of the 8th column is
- the position where the address is 5 and the start position of writing in the ninth column are the position where the address is 5,
- the start position of writing in the 10th column is the position where the address is 7 and the start position of writing in the 11th column.
- the position of is the position of address 8 and the 12th color Position of the writing start is set to the position whose address is 9, are respectively.
- the memory 31 is arranged in the row direction according to FIG. It has 8 columns for storing 8 ⁇ 1 bits and stores 64800 / (8 ⁇ 1) bits in the column direction.
- the first column write start position is the address 0 position
- the second column write start position is the address 0 position
- the start position of the second column is the position where the address is 2
- the start position of the fourth column is the position where the address is 4
- the start position of the fifth column is the position where the address is 4.
- the position and the start position of writing in the sixth column are the position where the address is 5
- the start position of writing in the seventh column is the position where the address is 7, and the starting position of the eighth column is The address is made with 7 positions, respectively.
- the memory 31 is arranged in the row direction according to FIG. It has 16 columns for storing 8 ⁇ 2 bits, and stores 64800 / (8 ⁇ 2) bits in the column direction.
- the first column write start position is the address 0 position
- the second column write start position is the address 2 position
- the start position of the second column is the position where the address is 2
- the start position of the fourth column is the position where the address is 2
- the start position of the fifth column is the address where the address is 2.
- the position and the start position of writing the sixth column are the position where the address is 3
- the start position of the seventh column is the position where the address is 7
- the start position of the eighth column is
- the position where the address is 15 and the start position of the 9th column are the position where the address is 16 and the start position where the 10th column is written are the position where the address is 20 and the start position of the 11th column.
- the positions of the address 22 and the 12th The start position of the program is the position where the address is 22, the start position of the 13th column is the position where the address is 27, and the start position of the 14th column is the position where the address is 27.
- the write start position of the 15th column is the position where the address is 28, and the write start position of the 16th column is the position where the address is 32.
- the memory 31 is arranged in the row direction according to FIG. It has 10 columns for storing 10 ⁇ 1 bits, and stores 64800 / (10 ⁇ 1) bits in the column direction.
- the first column write start position is the address 0 position
- the second column write start position is the address 3 position
- the first column write position is the address 6 position
- the fourth column write start position is the address 8 position
- the fifth column start position is the address 11
- the position and the start position of the 6th column are the position of the address 13
- the start position of the 7th column is the position of the address 15
- the start position of the 8th column is The address 17 position, the 9th column write start position, the address 18 position, and the 10th column write start position, the address 20 position, respectively.
- the memory 31 is arranged in the row direction according to FIG. It has 20 columns for storing 10 ⁇ 2 bits and stores 64800 / (10 ⁇ 2) bits in the column direction.
- the first column write start position is the address 0 position
- the second column write start position is the address 1 position
- the start position of the second column is the position where the address is 3
- the start position of the fourth column is the position where the address is 4
- the start position of the fifth column is the position where the address is 5.
- the position and the start position of writing in the sixth column are the position where the address is 6
- the start position of writing in the seventh column is the position where the address is 6
- the starting position of the eighth column is
- the position where the address is 9 and the start position of writing the ninth column are the position where the address is 13, and the start position of writing the tenth column is the position where the address is 14 and the start of writing the eleventh column.
- the position of is the position of address 14 and the 12th
- the start position of the program is the position where the address is 16, the start position of the 13th column is the position where the address is 21, and the start position of the 14th column is the position where the address is 21.
- the 15th column write start position is the address 23
- the 16th column write start position is the address 25 position
- the 17th column write start position is the address
- the 25th position and the 18th column start position are the address 26
- the 19th column start position are the address 28 and the 20th column start position. Is addressed with 30 positions, respectively.
- the memory 31 is arranged in the row direction according to FIG. It has 12 columns for storing 12 ⁇ 1 bits, and stores 64800 / (12 ⁇ 1) bits in the column direction.
- the first column write start position is the address 0 position
- the second column write start position is the address 0 position
- 3 The start position of the second column is the position where the address is 2
- the start position of the fourth column is the position where the address is 2
- the start position of the fifth column is the position where the address is 3.
- the position and the start position of the 6th column are the position where the address is 4, the start position of the 7th column is the position where the address is 4 and the start position of the 8th column is The position where the address is 5 and the start position of writing in the ninth column are the position where the address is 5, and the start position of writing in the 10th column is the position where the address is 7 and the start position of writing in the 11th column The position of is the position of address 8 and the 12th color Position of the writing start is set to the position whose address is 9, are respectively.
- the memory 31 is arranged in the row direction according to FIG. It has 24 columns for storing 12 ⁇ 2 bits, and stores 64800 / (12 ⁇ 2) bits in the column direction.
- the first column write start position is the address 0 position
- the second column write start position is the address 5 position
- the start position of the second column is the position where the address is 8
- the start position of the fourth column is the position where the address is 8
- the start position of the fifth column is the position where the address is 8.
- the position and the writing start position of the sixth column are the position where the address is 8
- the writing start position of the seventh column is the position of the address 10
- the writing start position of the eighth column is
- the position where the address is 10 and the start position of the 9th column are the position where the address is 10 and the start position where the 10th column is written are the position where the address is 12 and the start position of the 11th column.
- the position of is the position of address 13 and the 12th
- the starting position of the ram writing is the position of address 16, the starting position of the 13th column is the position of address 17, the starting position of the 14th column is the position of address 19
- the 15th column write start position is the address 21 position
- the 16th column write start position is the address 22 position
- the 17th column write start position is the address
- the position of 23 and the start position of writing of the 18th column are the position of address 26
- the start position of writing of the 19th column is the position of address 37 and the start position of writing of the 20th column.
- the position of the address 39 and the start position of the 21st column are the position of the address 40 and the start position of the 22nd column is the position of the address 41 and the position of the 23rd column.
- the address at the beginning of writing is 41 Position and, writing starting the 24th column position is set to the position whose address is 41, are respectively.
- FIG. 30 shows the number of columns of the memory 31 necessary for column twist interleaving and the LDPC code for each of the 10 coding rates with a code length N of 16200 defined in the DVB-T.2 standard. The address of the starting position is shown for each modulation method.
- the memory 31 is arranged in the row direction according to FIG. It has two columns that store 2 ⁇ 1 bits and stores 16200 / (2 ⁇ 1) bits in the column direction.
- the first column write start position is the address 0 position
- the second column write start position is the address 0 position. Is done.
- the memory 31 is arranged in the row direction according to FIG. It has four columns for storing 2 ⁇ 2 bits, and stores 16200 / (2 ⁇ 2) bits in the column direction.
- the first column write start position is the address 0 position
- the second column write start position is the address 2 position
- the writing start position of the second column is the position where the address is 3
- the writing start position of the fourth column is the position where the address is 3.
- the memory 31 is arranged in the row direction according to FIG. It has four columns for storing 4 ⁇ 1 bits, and stores 16200 / (4 ⁇ 1) bits in the column direction.
- the first column write start position is the address 0 position
- the second column write start position is the address 2 position
- the writing start position of the second column is the position where the address is 3
- the writing start position of the fourth column is the position where the address is 3.
- the memory 31 is arranged in the row direction according to FIG. It has 8 columns that store 4 ⁇ 2 bits, and stores 16200 / (4 ⁇ 2) bits in the column direction.
- the first column write start position is the address 0 position
- the second column write start position is the address 0 position
- the first column write start position is the address 0
- the fourth column write start position is the address 1 position
- the fifth column write start position is the address 7.
- the position and the start position of writing the sixth column are the position where the address is 20, the start position of the seventh column is the position where the address is 20, and the start position of the eighth column is Addresses are made with 21 positions, respectively.
- the memory 31 is arranged in the row direction according to FIG. It has 6 columns for storing 6 ⁇ 1 bits, and stores 16200 / (6 ⁇ 1) bits in the column direction.
- the first column write start position is the address 0 position
- the second column write start position is the address 0 position
- the start position of the second column is the position where the address is 2
- the start position of the fourth column is the position where the address is 3
- the start position of the fifth column is the position where the address is 7.
- the position and the position at the beginning of writing in the sixth column are set to the position where the address is 7, respectively.
- the memory 31 is arranged in the row direction according to FIG. It has 12 columns for storing 6 ⁇ 2 bits, and stores 16200 / (6 ⁇ 2) bits in the column direction.
- the first column write start position is the address 0 position
- the second column write start position is the address 0 position
- the start position of the second column is the position where the address is 0
- the start position of the fourth column is the position where the address is 2
- the start position of the fifth column is the position where the address is 2.
- the position of the start position of the 6th column is the position where the address is 2
- the start position of the 7th column is the position of the address 3
- the start position of the 8th column is
- the position where the address is 3 and the start position of the 9th column are the position where the address is 3 and the start position of the 10th column is the position where the address is 6 and the start of writing the 11th column.
- the position of is the position of address 7 and the 12th color Position of the writing start is set to the position whose address is 7, are respectively.
- the memory 31 is arranged in the row direction according to FIG. It has 8 columns for storing 8 ⁇ 1 bits, and stores 16200 / (8 ⁇ 1) bits in the column direction.
- the first column write start position is the address 0 position
- the second column write start position is the address 0 position
- the first column write start position is the address 0
- the fourth column write start position is the address 1 position
- the fifth column write start position is the address 7.
- the position and the start position of writing the sixth column are the position where the address is 20, the start position of the seventh column is the position where the address is 20, and the start position of the eighth column is Addresses are made with 21 positions, respectively.
- the memory 31 is arranged in the row direction according to FIG. It has 10 columns for storing 10 ⁇ 1 bits, and stores 16200 / (10 ⁇ 1) bits in the column direction.
- the first column write start position is the address 0 position
- the second column write start position is the address 1 position
- the start position of the second column is the position where the address is 2
- the start position of the fourth column is the position where the address is 2
- the start position of the fifth column is the position where the address is 3.
- the position and the start position of the 6th column are the position where the address is 3
- the start position of the 7th column is the position where the address is 4
- the start position of the 8th column is The address 4 position
- the 9th column write start position are the address 5 position
- the 10th column write start position are the address 7 position.
- the memory 31 is arranged in the row direction according to FIG. It has 20 columns for storing 10 ⁇ 2 bits, and stores 16200 / (10 ⁇ 2) bits in the column direction.
- the first column write start position is the address 0 position
- the second column write start position is the address 0 position
- the start position of the second column is the position where the address is 0
- the start position of the fourth column is the position where the address is 2
- the start position of the fifth column is the position where the address is 2.
- the position and the start position of writing in the sixth column are the position where the address is 2
- the start position of writing in the seventh column is the position of address 2
- the starting position of the eighth column is
- the position where the address is 2 and the start position of writing the ninth column are the position where the address is 5,
- the start position of writing the tenth column is the position where the address is 5 and the start of writing the eleventh column.
- the position of is the position of address 5 and the 12th color
- the writing start position is the position where the address is 5
- the writing start position of the 13th column is the position where the address is 5
- the writing start position of the 14th column is the position where the address is 7
- the write start position of the 15th column is the position where the address is 7
- the write start position of the 16th column is the position of address 7
- the write start position of the 17th column is address 7
- the position of the 18th column and the start position of the 18th column are the position where the address is 8
- the start position of the 19th column is the position of the address 8 and the start position of the 20th column is ,
- the address is 10 positions, respectively.
- the memory 31 is arranged in the row direction according to FIG. It has 12 columns for storing 12 ⁇ 1 bits, and stores 16200 / (12 ⁇ 1) bits in the column direction.
- the first column write start position is the address 0 position
- the second column write start position is the address 0 position
- the start position of the second column is the position where the address is 0
- the start position of the fourth column is the position where the address is 2
- the start position of the fifth column is the position where the address is 2.
- the position of the start position of the 6th column is the position where the address is 2
- the start position of the 7th column is the position of the address 3
- the start position of the 8th column is
- the position where the address is 3 and the start position of the 9th column are the position where the address is 3 and the start position of the 10th column is the position where the address is 6 and the start of writing the 11th column.
- the position of is the position of address 7 and the 12th color Position of the writing start is set to the position whose address is 7, are respectively.
- the memory 31 is arranged in the row direction according to FIG. It has 24 columns for storing 12 ⁇ 2 bits, and stores 16200 / (12 ⁇ 2) bits in the column direction.
- the first column write start position is the address 0 position
- the second column write start position is the address 0 position
- the start position of the second column is the position where the address is 0
- the start position of the fourth column is the position where the address is 0
- the start position of the fifth column is the position where the address is 0.
- the position of the start position of the 6th column is the position where the address is 0
- the start position of the 7th column is the position where the address is 0,
- the start position of the 8th column is
- the position where the address is 1 and the start position of writing the ninth column are the position where the address is 1, and the start position of writing the tenth column is the position where the address is 1 and the start of writing the eleventh column.
- the position of is the position of address 2 and the 12th color
- the write start position is the position where the address is 2
- the write start position of the 13th column is the position where the address is 2
- the write start position of the 14th column is the position where the address is 3
- the write start position of the 15th column is the position where the address is 7
- the write start position of the 16th column is the position of address 9
- the write start position of the 17th column is the address 9
- the 18th column write start position are the address 9 position
- the 19th column write start position are the address 10 position
- the 20th column write start position are
- the first position is the position where the address is 10.
- the writing starting position for the 24th column is set to the position whose address is 11, are respectively.
- FIG. 31 is a flowchart for explaining processing performed by the LDPC encoder 115, the bit interleaver 116, and the QAM encoder 117 of FIG.
- the LDPC encoder 115 waits for the LDPC target data to be supplied from the BCH encoder 114, encodes the LDPC target data into an LDPC code in step S101, and supplies the LDPC code to the bit interleaver 116. The process proceeds to step S102.
- step S102 the bit interleaver 116 performs bit interleaving on the LDPC code from the LDPC encoder 115, supplies a symbol obtained by symbolizing the LDPC code after the bit interleaving to the QAM encoder 117, and performs processing.
- the process proceeds to step S103.
- the parity interleaver 23 performs parity interleaving for the LDPC code from the LDPC encoder 115, and converts the LDPC code after the parity interleaving into the column twist interleave. Supplied to Lever 24.
- the column twist interleaver 24 performs column twist interleaving on the LDPC code from the parity interleaver 23 and supplies it to the demultiplexer 25.
- the demultiplexer 25 replaces the code bits of the LDPC code after the column twist interleaving by the column twist interleaver 24, and performs a replacement process using the replaced code bits as symbol bits (symbol bits) of the symbols.
- the replacement process by the demultiplexer 25 can be performed in accordance with the first to fourth replacement methods shown in FIGS. 22 and 23, and the code bit of the LDPC code is assigned to the symbol bit representing the symbol. This can be done in accordance with a predetermined allocation rule.
- the symbol obtained by the replacement process by the demultiplexer 25 is supplied from the demultiplexer 25 to the QAM encoder 117.
- step S103 the QAM encoder 117 maps the symbol from the demultiplexer 25 to a signal point determined by the modulation method of the orthogonal modulation performed by the QAM encoder 117 and performs orthogonal modulation, and the resulting data is converted into a time interleaver. 118.
- the parity interleaver 23 that is a block that performs parity interleaving and the column twist interleaver 24 that is a block that performs column twist interleaving are configured separately.
- the parity interleaver 23 and the column twist interleaver 24 can be integrally configured.
- both parity interleaving and column twist interleaving can be performed by writing and reading code bits to and from the memory, and an address (write address) for writing code bits is an address for reading code bits. It can be represented by a matrix to be converted into (read address).
- parity interleaving is performed by converting the sign bit by the matrix, and further, the parity.
- the result of column twist interleaving of the interleaved LDPC code can be obtained.
- the demultiplexer 25 can also be configured integrally.
- the replacement process performed by the demultiplexer 25 can also be represented by a matrix that converts the write address of the memory 31 that stores the LDPC code into a read address.
- parity interleaving, column twist interleaving, and replacement processing are performed according to the matrix. Can be performed collectively.
- parity interleaving and column twist interleaving can be performed, or neither can be performed.
- the communication path 13 (FIG. 7) is a satellite line other than AWGN that does not require much consideration of burst errors, flutter, etc.
- parity interleaving and column twisting Interleaving can be avoided.
- the simulation was performed using a communication path with flutter with a D / U of 0 dB.
- FIG. 32 shows a model of the communication path adopted in the simulation.
- a in FIG. 32 shows a flutter model employed in the simulation.
- 32B shows a model of a communication path with flutter represented by the model of A in FIG.
- H represents the flutter model of FIG. 32B
- N represents ICI (Inter Carrier Interference).
- E [N 2 ] of the power is approximated by AWGN.
- FIG. 33 shows the relationship between the error rate and the Doppler frequency f d when the modulation method is 16QAM, the coding rate (r) is (3/4), and the replacement method is the first replacement method.
- FIG. 34 shows the relationship between the error rate and the Doppler frequency f d when the modulation method is 64QAM, the coding rate (r) is (5/6), and the replacement method is the first replacement method. Show.
- the thick line indicates the relationship between the error rate and the Doppler frequency f d when parity interleaving, column twist interleaving, and replacement processing are all performed
- the thin line indicates the parity. interleave, column twist interleave and of the replacement process, in the case of performing only the replacement process, shows the relationship between the error rate and the Doppler frequency f d.
- the error rate is improved (smaller) when all of parity interleaving, column twist interleaving, and replacement processing are performed than when only replacement processing is performed. I understand that.
- FIG. 35 is a block diagram illustrating a configuration example of the LDPC encoder 115 of FIG.
- LDPC encoder 122 of FIG. 8 is similarly configured.
- N LDPC codes 64800 bits and 16200 bits are defined.
- LDPC codes having a code length N of 64,800 bits eleven coding rates 1/4, 1/3, 2/5, 1/2, 3/5, 2/3, 3/4, 4 / 5, 5/6, 8/9, and 9/10 are defined, and for LDPC codes with a code length N of 16200 bits, 10 coding rates 1/4, 1/3, 2/5, 1/2, 3/5, 2/3, 3/4, 4/5, 5/6, and 8/9 are defined (FIGS. 12 and 13).
- the LDPC encoder 115 performs encoding (error correction coding) using an LDPC code having a code length N of 64,800 bits or 16200 bits for each code length N and each code rate. This can be performed according to the prepared check matrix H.
- the LDPC encoder 115 includes an encoding processing unit 601 and a storage unit 602.
- the coding processing unit 601 includes a coding rate setting unit 611, an initial value table reading unit 612, a parity check matrix generation unit 613, an information bit reading unit 614, a coded parity calculation unit 615, and a control unit 616, and includes an LDPC encoder.
- the LDPC encoding of the LDPC target data supplied to 115 is performed, and the resulting LDPC code is supplied to the bit interleaver 116 (FIG. 8).
- the coding rate setting unit 611 sets the code length N and coding rate of the LDPC code in accordance with, for example, an operator's operation.
- the initial value table reading unit 612 reads a parity check matrix initial value table, which will be described later, corresponding to the code length N and the coding rate set by the coding rate setting unit 611 from the storage unit 602.
- the information bit reading unit 614 reads (extracts) information bits for the information length K from the LDPC target data supplied to the LDPC encoder 115.
- the encoded parity calculation unit 615 reads the parity check matrix H generated by the parity check matrix generation unit 613 from the storage unit 602, and uses the parity check matrix H to calculate a parity bit for the information bits read by the information bit reading unit 614, A codeword (LDPC code) is generated by calculating based on the formula.
- LDPC code LDPC code
- the control unit 616 controls each block constituting the encoding processing unit 601.
- the storage unit 602 stores, for example, a plurality of parity check matrix initial value tables corresponding to a plurality of coding rates and the like shown in FIGS. 12 and 13 for code lengths N such as 64800 bits and 16200 bits, respectively. Has been.
- the storage unit 602 temporarily stores data necessary for the processing of the encoding processing unit 601.
- FIG. 36 is a flowchart for explaining processing of the LDPC encoder 115 of FIG.
- step S201 the coding rate setting unit 611 determines (sets) a code length N and a coding rate r for performing LDPC coding.
- step S202 the initial value table reading unit 612 reads, from the storage unit 602, a predetermined parity check matrix initial value table corresponding to the code length N and the coding rate r determined by the coding rate setting unit 611. .
- the parity check matrix generation unit 613 uses the parity check matrix initial value table read from the storage unit 602 by the initial value table reading unit 612, and the code length N and the coding rate determined by the coding rate setting unit 611.
- the parity check matrix H of the LDPC code of r is obtained (generated), supplied to the storage unit 602 and stored.
- step S205 the encoded parity calculation unit 615 sequentially calculates the parity bits of the codeword c satisfying Expression (8) using the information bits from the information bit reading unit 614 and the check matrix H.
- c represents a row vector as a code word (LDPC code), and c T represents transposition of the row vector c.
- the information bit portion is represented by the row vector A and the parity bit portion is represented by the row vector T.
- step S206 the control unit 616 determines whether or not to end LDPC encoding. If it is determined in step S206 that the LDPC encoding is not terminated, that is, for example, if there is still LDPC target data to be LDPC encoded, the process returns to step S201 (or step S204). The processing from S201 (or step S204) to S206 is repeated.
- step S206 If it is determined in step S206 that the LDPC encoding is to be ended, that is, for example, if there is no LDPC target data to be LDPC encoded, the LDPC encoder 115 ends the processing.
- a parity check matrix initial value table corresponding to each code length N and each coding rate r is prepared, and the LDPC encoder 115 has a predetermined code length N and a predetermined coding rate r.
- LDPC encoding is performed using a parity check matrix H generated from a parity check matrix initial value table corresponding to the predetermined code length N and the predetermined coding rate r.
- the parity check matrix initial value table includes an information matrix H A corresponding to the code length N of the LDPC code (LDPC code defined by the parity check matrix H) and the information length K of the parity check matrix H (FIG. 10). ) Is a table that represents the position of one element for each 360 columns (number of columns P of cyclic structure units), and is created in advance for each check matrix H of each code length N and each coding rate r.
- FIG. 37 is a diagram illustrating an example of a parity check matrix initial value table.
- FIG. 37 shows that the code length N is 16200 bits and the coding rate (coding rate in the notation of DVB-T.2) r is 1/4 as defined in the DVB-T.2 standard.
- the parity check matrix initial value table with respect to the parity check matrix H is shown.
- the parity check matrix generator 613 obtains the parity check matrix H using the parity check matrix initial value table as follows.
- FIG. 38 shows a method for obtaining the parity check matrix H from the parity check matrix initial value table.
- parity check matrix initial value table in FIG. 38 is the parity check matrix initial value for the parity check matrix H defined in the DVB-T.2 standard and having a code length N of 16200 bits and a code rate r of 2/3. Shows the table.
- the parity check matrix initial value table indicates the position of one element of the information matrix H A (FIG. 10) corresponding to the information length K corresponding to the code length N of the LDPC code and the coding rate r, as 360 columns.
- This is a table expressed for each (number of columns P of the unit of the cyclic structure), and in the i-th row, the row number of the 1 element of the 1 + 360 ⁇ (i ⁇ 1) -th column of the check matrix H (check matrix H (The row number where the row number of the first row is 0) is arranged by the number of column weights of the 1 + 360 ⁇ (i ⁇ 1) th column.
- parity matrix H T (FIG. 10) corresponding to parity length M of parity check matrix H is determined as shown in FIG. 25, according to parity check matrix initial value table, An information matrix H A (FIG. 10) corresponding to the information length K is obtained.
- the number of rows k + 1 in the parity check matrix initial value table differs depending on the information length K.
- Equation (9) The relationship of Equation (9) is established between the information length K and the number k + 1 of rows in the parity check matrix initial value table.
- 360 in Expression (9) is the number of columns P of the unit of the cyclic structure described in FIG.
- the column weight of the parity check matrix H obtained from the parity check matrix initial value table of FIG. 38 is 13, from the first column to the 1 + 360 ⁇ (3-1) ⁇ 1 column, and 1 + 360 ⁇ (3-1) It is 3 from the column to the Kth column.
- the first row of the parity check matrix initial value table of FIG. 38 is 0,2084,1613,1548,1286,1460,3196,4297,2481,3369,3451,4620,2622, which is the parity check matrix H
- the row number is 0,2084,1613,1548,1286,1460,3196,4297,2481,3369,3451,4620,2622
- the element of the row is 1 (and other elements) Is 0).
- the second row of the parity check matrix initial value table in FIG. 38 is 1,122,1516,3448,2880,1407,1847,3799,3529,373,971,4358,3108, which is 361 of the parity check matrix H.
- the row number is 1,122,1516,3448,2880,1407,1847,3799,3529,373,971,4358,3108, indicating that the element is 1 ing.
- the parity check matrix initial value table represents the position of one element of the information matrix HA of the parity check matrix H for every 360 columns.
- the numerical value of the i-th row (i-th from the top) and j-th column (j-th from the left) of the parity check matrix initial value table is represented as h i, j and j items in the w-th column of the parity check matrix H. If the row number of the first element is represented as H wj , the row number H of the first element in the w column, which is a column other than the 1 + 360 ⁇ (i ⁇ 1) column of the parity check matrix H wj can be obtained by Expression (10).
- mod (x, y) means the remainder of dividing x by y.
- P is the number of columns of the cyclic structure unit described above, and is 360, for example, in the DVB-S.2, DVB-T.2, and DVB-C.2 standards, as described above.
- the parity check matrix generation unit 613 (FIG. 35) specifies the row number of the 1 element in the 1 + 360 ⁇ (i ⁇ 1) column of the parity check matrix H by using the parity check matrix initial value table.
- the parity check matrix generation unit 613 calculates the row number H wj of the first element of the w column that is a column other than the 1 + 360 ⁇ (i ⁇ 1) column of the parity check matrix H by the formula ( 10) to generate a parity check matrix H in which the element of the row number obtained as described above is 1.
- DVB-Sx DVB-S.2
- the second requirement is to prepare 22 ModCods in the 12 dB range from 12 dB to 24 dB
- the third requirement is C / N from -3 dB to 5 dB. It is required to prepare 12 ModCods in the 8 dB range, and as a fourth requirement, to prepare 5 ModCods in the 7 dB range where C / N is from -10 dB to -3 dB. Yes.
- the ModCod FER Fra Error Rate
- the priority of the first request is the highest “1”, but the priority of the second to fourth requests is “2” which is lower than the priority of the first request. It has become.
- an LDPC code (a check matrix) that can satisfy the first requirement having the highest priority at least in CfT is provided as a new LDPC code.
- FIG. 39 shows a BER / FER curve when QPSK is adopted as a modulation method for 11 LDPC codes with a code length N of 64k bits defined in DVB-S.2. .
- the horizontal axis represents E s / N 0 (signal power to noise power ratio per symbol) corresponding to C / N, and the vertical axis represents FER / BER.
- the solid line represents FER and the dotted line represents BER (Bit Error Rate).
- QPSK is adopted as a modulation method for 11 coding rate LDPC codes with a code length N of 64k bits as defined in DVB-S.2 in a range where E s / N 0 is 10 dB. There is a FER (BER) curve.
- the average interval of the FER curves between ModCod (hereinafter also referred to as the average interval) Is about 1 dB ( ⁇ 10 dB / (10-1)).
- the LDPC code with 11 coding rates can obtain ModCod with an average interval of about 1 dB compared to the case of DVB-S.2.
- the number is about three times the coding rate of 11 ( ⁇ 1 dB / 0.3 dB), that is, 30
- An LDPC code with a coding rate of about a level is sufficient.
- this technology is an LDPC code having a coding rate that is easy to set a coding rate of about 30.
- the coding rate is i / 30 (i is a positive integer less than 30) and the code length is 64k.
- the parity matrix of the parity check matrix H is the same as the LDPC code defined in DVB-S.2.
- H T is a stepped structure (FIG. 11).
- the information matrix HA of the check matrix H has a cyclic structure, and the number of columns P of the cyclic structure unit is also 360. To do.
- 40 to 106 are diagrams illustrating examples of the parity check matrix initial value table of the new LDPC code having the code length N of 64k bits and the encoding rate of i / 30 as described above.
- the new LDPC code is an LDPC code whose coding rate is represented by i / 30, the maximum is 1/30, 2/30, 3/30,..., 28/30, and There are 29 coding rate LDPC codes of 29/30.
- LDPC codes with a coding rate of 1/30 may be restricted in terms of efficiency.
- the use of LDPC codes with a coding rate of 29/30 may be restricted in terms of error rate (BER / FER).
- the LDPC code with a coding rate of 1/30 and the LDPC code with a coding rate of 29/30 may not be treated as a new LDPC code.
- LDPC codes with the coding rates 2/30 to 29/30 are referred to as new LDPC codes.
- the parity check matrix initial value table for the parity check matrix H of the LDPC code is shown.
- FIG. 40 shows a parity check matrix initial value table for a parity check matrix H of an LDPC code having a code length N of 64k bits and a code rate r of 2/30.
- FIG. 41 shows a parity check matrix initial value table for a parity check matrix H of an LDPC code having a code length N of 64k bits and an encoding rate r of 3/30.
- FIG. 42 shows a parity check matrix initial value table for a parity check matrix H of an LDPC code having a code length N of 64k bits and a code rate r of 4/30.
- 43 shows a parity check matrix initial value table for a parity check matrix H of an LDPC code having a code length N of 64k bits and a code rate r of 5/30.
- FIG. 45 shows a parity check matrix initial value table for a parity check matrix H of an LDPC code having a code length N of 64k bits and a coding rate r of 7/30.
- 46 and 47 show a parity check matrix initial value table for a parity check matrix H of an LDPC code having a code length N of 64k bits and a code rate r of 8/30.
- 50 and 51 show a parity check matrix initial value table for a parity check matrix H of an LDPC code having a code length N of 64k bits and a code rate r of 10/30.
- 52 and 53 show a parity check matrix initial value table for a parity check matrix H of an LDPC code having a code length N of 64k bits and a code rate r of 11/30.
- 54 and 55 illustrate a parity check matrix initial value table for a parity check matrix H of an LDPC code having a code length N of 64k bits and a code rate r of 12/30.
- 58 and 59 show a parity check matrix initial value table for a parity check matrix H of an LDPC code having a code length N of 64k bits and a code rate r of 14/30.
- 60 and 61 illustrate a parity check matrix initial value table for a parity check matrix H of an LDPC code having a code length N of 64k bits and a code rate r of 15/30.
- 62, 63, and 64 illustrate a parity check matrix initial value table for a parity check matrix H of an LDPC code having a code length N of 64k bits and a code rate r of 16/30.
- 65, 66, and 67 illustrate a parity check matrix initial value table for a parity check matrix H of an LDPC code having a code length N of 64k bits and a code rate r of 17/30.
- 68, 69, and 70 illustrate a parity check matrix initial value table for a parity check matrix H of an LDPC code having a code length N of 64k bits and a code rate r of 18/30.
- 71, 72, and 73 illustrate a parity check matrix initial value table for a parity check matrix H of an LDPC code having a code length N of 64k bits and a code rate r of 19/30.
- 74, 75, and 76 illustrate a parity check matrix initial value table for a parity check matrix H of an LDPC code having a code length N of 64k bits and a code rate r of 20/30.
- 77, 78, and 79 illustrate a parity check matrix initial value table for a parity check matrix H of an LDPC code having a code length N of 64k bits and a code rate r of 21/30.
- 80, 81, and 82 illustrate a parity check matrix initial value table for a parity check matrix H of an LDPC code having a code length N of 64k bits and a code rate r of 22/30.
- 83, 84, and 85 illustrate a parity check matrix initial value table for a parity check matrix H of an LDPC code having a code length N of 64k bits and a code rate r of 23/30.
- 86, 87, and 88 show a parity check matrix initial value table for a parity check matrix H of an LDPC code having a code length N of 64k bits and a code rate r of 24/30.
- 89, 90, and 91 illustrate a parity check matrix initial value table for a parity check matrix H of an LDPC code having a code length N of 64k bits and a code rate r of 25/30.
- 92, 93, and 94 show a parity check matrix initial value table for a parity check matrix H of an LDPC code having a code length N of 64k bits and a code rate r of 26/30.
- 95, 96, 97, and 98 show a parity check matrix initial value table for a parity check matrix H of an LDPC code having a code length N of 64k bits and a code rate r of 27/30.
- 99, 100, 101, and 102 show a parity check matrix initial value table for a parity check matrix H of an LDPC code having a code length N of 64k bits and a code rate r of 28/30.
- 103, 104, 105, and 106 show a parity check matrix initial value table for a parity check matrix H of an LDPC code having a code length N of 64k bits and a coding rate r of 29/30.
- the LDPC encoder 115 uses the parity check matrix H obtained from the parity check matrix initial value tables shown in FIGS. 40 to 106, and has a code length N of 64k bits and an encoding rate r of 2 /. Coding into any (new) LDPC code of 28 types from 30 to 29/30 can be performed.
- the parity check matrix initial value table shown in FIGS. 40 to 106 is stored in the storage unit 602 of the LDPC encoder 115 (FIG. 8).
- all 28 types of LDPC codes with coding rates r of 2/30 to 29/30 need not necessarily be adopted as new LDPCs. Absent. That is, for the 28 types of LDPC codes with coding rates r of 2/30 to 29/30 in FIGS. 40 to 106, LDPC codes with any one or more coding rates are used as new LDPC codes. Can be adopted.
- the LDPC code obtained by using the parity check matrix H obtained from the parity check matrix initial value table in FIG. 40 to FIG. 106 is a high-performance LDPC code.
- a high-performance LDPC code is an LDPC code obtained from an appropriate check matrix H.
- the appropriate check matrix H is that when an LDPC code obtained from the check matrix H is transmitted at a low E s / N 0 or E b / N o (signal power to noise power ratio per bit).
- BER (and FER) is a check matrix that satisfies a predetermined condition.
- An appropriate parity check matrix H can be obtained, for example, by performing a simulation for measuring the BER when LDPC codes obtained from various parity check matrices satisfying a predetermined condition are transmitted at low E s / N o .
- the predetermined conditions that the appropriate check matrix H should satisfy are, for example, that the analysis result obtained by the code performance analysis method called “Density Evolution” is good, There are no loops, etc.
- the predetermined condition to be satisfied by the appropriate parity check matrix H can be determined as appropriate from the viewpoints of improving the decoding performance of the LDPC code, facilitating (simplifying) the decoding process of the LDPC code, and the like.
- FIG. 107 and FIG. 108 are diagrams for explaining density evolution in which an analysis result is obtained as a predetermined condition to be satisfied by an appropriate check matrix H.
- Density evolution is a code analysis method that calculates the expected value of the error probability for the entire LDPC code (ensemble) with a code length N of ⁇ characterized by a degree sequence described later. It is.
- the noise variance when the noise variance is increased from 0, the expected value of the error probability of a certain ensemble is initially 0, but the noise variance is greater than a certain threshold. Then, it is not 0.
- the expected value of the error probability is not zero, and the threshold of noise variance (hereinafter also referred to as performance threshold) is compared to determine whether the ensemble performance (appropriateness of the check matrix) is good or bad. Can be decided.
- performance threshold the threshold of noise variance
- a high-performance LDPC code can be found among the LDPC codes belonging to the ensemble.
- the above-described degree sequence represents the ratio of variable nodes and check nodes having weights of each value to the code length N of the LDPC code.
- a regular (3,6) LDPC code with a coding rate of 1/2 is a degree in which the weights (column weights) of all variable nodes are 3 and the weights (row weights) of all check nodes are 6. Belongs to an ensemble characterized by a sequence.
- FIG. 107 shows a Tanner graph of such an ensemble.
- Each variable node is connected with three edges equal to the column weight, and therefore there are only 3N branches connected to the N variable nodes.
- each check node is connected with 6 branches equal to the row weight, and therefore there are only 3N branches connected to N / 2 check nodes.
- the interleaver randomly reorders 3N branches connected to N variable nodes, and reorders each of the rearranged branches into 3N branches connected to N / 2 check nodes. Connect to one of them.
- the interleaver through which the branch connected to the variable node and the branch connected to the check node pass is divided into multiple (multi edge), which makes it possible to further characterize the ensemble. Strictly done.
- FIG. 108 shows an example of a Tanner graph of a multi-edge type ensemble.
- Tanner graph of FIG. 108 there is one branch connected to the first interleaver, 0 branches connected to the second interleaver, only v1 variable, and one branch connected to the first interleaver.
- the Tanner graph of FIG. 108 there are two branches connected to the first interleaver, c1 check nodes with 0 branches connected to the second interleaver, and two branches connected to the first interleaver.
- the number of branches connected to the second interleaver is c2 check nodes, the number of branches connected to the first interleaver is 0, and the number of branches connected to the second interleaver is c3.
- Exists there are two branches connected to the first interleaver, c1 check nodes with 0 branches connected to the second interleaver, and two branches connected to the first interleaver.
- the BER starts to decrease (becomes smaller) due to multi-edge type density evolution E b / N 0 (Signal power to noise power ratio per bit) LDPC code that finds an ensemble whose performance threshold is less than or equal to a predetermined value and reduces the BER in multiple modulation schemes used in DVB-S.2 etc., such as QPSK, among the LDPC codes belonging to that ensemble was selected as a high-performance LDPC code.
- E b / N 0 Signal to noise power ratio per bit
- the above-mentioned parity check matrix initial value table of the new LDPC code is a parity check matrix initial value table of an LDPC code having a code length N of 64k bits, which is obtained by the above simulation.
- FIG. 109 is a parity check matrix H obtained from the parity check matrix initial value table of 28 new LDPC codes with code length N of 64k bits and code rates of 2/30 to 29/30 in FIGS. It is a figure which shows the minimum cycle length and performance threshold value.
- the minimum cycle length (girth) means the minimum value of the loop length (loop length) composed of 1 elements in the check matrix H.
- Cycle 4 (a loop of one element with a loop length of 4) does not exist in the parity check matrix H obtained from the parity check matrix initial value table of the new LDPC code.
- the performance threshold tends to improve (decrease) as the encoding rate r decreases.
- FIG. 110 is a diagram for explaining a parity check matrix H (which is also referred to as a parity check matrix H of a new LDPC code) (shown from the parity check matrix initial value table) in FIGS. 40 to 106.
- a parity check matrix H which is also referred to as a parity check matrix H of a new LDPC code
- the column weight is X
- the subsequent KY1 column is the column weight Y1
- the subsequent KY2 column is the column weight Y2.
- the subsequent column M-1 has a column weight of 2
- the last column has a column weight of 1.
- FIG. 111 is a diagram showing the number of columns KX, KY1, KY2, and M of FIG. 110 and the column weights X, Y1, and Y2 for each coding rate r of the new LDPC code.
- the column weight on the head side (left side) tends to be larger as in the case of the parity check matrix described in FIG. 12 and FIG.
- the first code bit of the new LDPC code tends to be more resistant to errors (resistant to errors).
- the coding rate is 2/30, 3/30, 4/30, 5/30, 6/30, 7/30, 8/30, 9/30, 10/30, 11/30, 12/30, 13/30, 14/30, 15/30, 16/30, 17/30, 18/30, 19/30, 20/30, 21/30, 22/30, 23/30, 24/30, 25 /
- the shift amounts for the 30, 26/30, 27/30, 28/30, 29/30 new LDPC codes are 168, 162, 156, 150, 144, 138, 132, 126, 120, 114, 108, 102, 96, 90, 84, 78, 72, 66, 60, 54, 48, 42, respectively. 36,30,24,18,12,6.
- FIG. 112, 113, and 114 are diagrams showing BER / FER simulation results of the new LDPC codes of FIGS. 40 to 106.
- FIG. 112, 113, and 114 are diagrams showing BER / FER simulation results of the new LDPC codes of FIGS. 40 to 106.
- FIG. 112, 113, and 114 are diagrams showing BER / FER simulation results of the new LDPC codes of FIGS. 40 to 106.
- the horizontal axis represents E s / N 0 and the vertical axis represents BER / FER.
- the solid line represents BER and the dotted line represents FER.
- the simulation in the 15 dB range from E s / N 0 to -10 dB to 5 dB, it is possible to set 28 ModCods with a FER of 10 -5 or less, so other than BPSK used in the simulation, for example, , QPSK, 8PSK, 16APSK, 32APSK, 16QAM, 32QAM, 64QAM, and other 20 ModCods with a FER of 10-5 or less in a 7dB range from 5dB to 12dB It is fully anticipated that this can be set.
- the FER (BER) curve of the new LDPC code is relatively smaller for each of the low, medium, and high coding rate groups at intervals smaller than 1 dB. They are lined up at intervals. Therefore, for a broadcaster who broadcasts a program using the transmission device 11, the new LDPC code has an advantage that it is easy to select a coding rate used for broadcasting according to the channel (communication channel 13) status and the like.
- the information is BCH encoded and the resulting BCH code is LDPC encoded.
- FIG. 115 is a diagram for explaining the BCH encoding used in the simulation.
- a in FIG. 115 is a diagram illustrating parameters of BCH encoding performed before LDPC encoding to a 64k LDPC code defined in DVB-S.2.
- DVB-S.2 adds 12-bit, 10-bit, or 8-bit error correction by adding 192-bit, 160-bit, or 128-bit redundant bits according to the coding rate of the LDPC code. BCH encoding is possible.
- FIG. 115 is a diagram illustrating parameters of BCH encoding used in the simulation.
- FIG. 116 is a block diagram illustrating a configuration example of the receiving device 12 of FIG.
- An OFDM processor 151 receives an OFDM signal from the transmission device 11 (FIG. 7) and performs signal processing on the OFDM signal. Data (symbols) obtained by performing signal processing by the OFDM processing unit 151 is supplied to a frame management unit 152.
- the frame management unit 152 performs processing (frame interpretation) of a frame including symbols supplied from the OFDM processing unit 151, and converts the symbol of the target data and the control data symbol obtained as a result thereof into a frequency deinterleaver. (Frequency Deinterleaver) 161 and 153, respectively.
- the frequency deinterleaver 153 performs frequency deinterleaving for each symbol from the frame management unit 152 and supplies the symbol to the QAM decoder 154.
- the QAM decoder 154 performs demapping (signal point constellation decoding) on the symbol (symbol arranged at the signal point) from the frequency deinterleaver 153 to perform orthogonal demodulation, and the resulting data (LDPC code) is converted into the LDPC decoder.
- demapping signal point constellation decoding
- LDPC decoder LDPC decoder
- the LDPC decoder 155 performs LDPC decoding of the LDPC code from the QAM decoder 154, and supplies LDPC target data (in this case, BCH code) obtained as a result thereof to a BCH decoder (BCH decoder) 156.
- LDPC target data in this case, BCH code
- the BCH decoder 156 performs BCH decoding of the LDPC target data from the LDPC decoder 155 and outputs control data (signaling) obtained as a result.
- the frequency deinterleaver 161 performs frequency deinterleaving for each symbol from the frame management unit 152 and supplies the symbol to the MISO / MIMO decoder 162.
- the MISO / MIMO decoder 162 performs space-time decoding of data (symbols) from the frequency deinterleaver 161 and supplies it to a time deinterleaver 163.
- the time deinterleaver 163 performs time deinterleaving on the data (symbol) from the MISO / MIMO decoder 162 in units of symbols, and supplies the data to the QAM decoder (QAM decoder) 164.
- QAM decoder QAM decoder
- the QAM decoder 164 performs demapping (signal point arrangement decoding) on the symbol (symbol arranged at the signal point) from the time deinterleaver 163 to perform orthogonal demodulation, and the resulting data (symbol) is subjected to bit deinterlacing. This is supplied to a Lieber (Bit Deinterleaver) 165.
- the bit deinterleaver 165 performs bit deinterleaving on the data (symbol) from the QAM decoder 164 and supplies the resulting LDPC code to the LDPC decoder 166.
- the LDPC decoder 166 performs LDPC decoding of the LDPC code from the bit deinterleaver 165 and supplies the LDPC target data (in this case, BCH code) obtained as a result to the BCH decoder 167.
- the BCH decoder 167 performs BCH decoding of the LDPC target data from the LDPC decoder 155 and supplies data obtained as a result to a BB descrambler BB.
- the BB descrambler 168 performs BB descrambling on the data from the BCH decoder 167 and supplies the data obtained as a result to a null deletion unit (Null Deletion) 169.
- the null deletion unit 169 deletes the null inserted by the padder 112 in FIG. 8 from the data from the BB descrambler 168 and supplies the null to the demultiplexer 170.
- the demultiplexer 170 separates each of one or more streams (target data) multiplexed in the data from the null deletion unit 169, performs necessary processing, and outputs the result as an output stream (Output stream).
- the receiving device 12 can be configured without providing a part of the blocks shown in FIG. That is, for example, when the transmitter 11 (FIG. 8) is configured without the time interleaver 118, the MISO / MIMO encoder 119, the frequency interleaver 120, and the frequency interleaver 124, the receiver 12 A time deinterleaver 163, a MISO / MIMO decoder 162, and a frequency deinterleaver 161, which are blocks corresponding to the time interleaver 118, the MISO / MIMO encoder 119, the frequency interleaver 120, and the frequency interleaver 124 of the transmission apparatus 11, respectively. And it can comprise without providing the frequency deinterleaver 153.
- FIG. 117 is a block diagram showing a configuration example of the bit deinterleaver 165 of FIG.
- the bit deinterleaver 165 includes a multiplexer (MUX) 54 and a column twist deinterleaver 55, and performs symbol bit deinterleaving of symbols from the QAM decoder 164 (FIG. 116).
- MUX multiplexer
- MUX column twist deinterleaver
- the multiplexer 54 replaces the symbol bit of the symbol from the QAM decoder 164 by the reverse replacement process (reverse process of the replacement process) corresponding to the replacement process performed by the demultiplexer 25 of FIG.
- a reverse permutation process is performed to return the position of the code bit (symbol bit) of the LDPC code to the original position, and the resulting LDPC code is supplied to the column twist deinterleaver 55.
- the column twist deinterleaver 55 targets the LDPC code from the multiplexer 54, and corresponds to the column twist deinterleave as the rearrangement process performed by the column twist interleaver 24 in FIG. Processing), that is, column twist deinterleaving, for example, as reverse rearrangement processing for returning the code bits of LDPC codes whose rearrangement has been changed by column twist interleaving as rearrangement processing.
- the column twist deinterleaver 55 writes the code bit of the LDPC code to the memory for deinterleaving configured similarly to the memory 31 shown in FIG. Perform column twist deinterleaving.
- writing of the sign bit is performed in the row direction of the memory for deinterleaving, using the read address when reading the sign bit from the memory 31 as the write address.
- the sign bit is read out in the column direction of the deinterleave memory using the write address at the time of writing the sign bit to the memory 31 as the read address.
- the LDPC code obtained as a result of the column twist deinterleaving is supplied from the column twist deinterleaver 55 to the LDPC decoder 166.
- the bit deinterleaver 165 supports parity interleaving.
- Parity deinterleaving reverse processing of parity interleaving, that is, parity deinterleaving for returning the code bits of the LDPC code whose arrangement has been changed by parity interleaving
- reverse permutation processing corresponding to permutation processing
- column twist All of column twist deinterleaving corresponding to interleaving can be performed.
- bit deinterleaver 165 of FIG. 117 is provided with a multiplexer 54 that performs reverse permutation processing corresponding to the permutation processing, and a column twist deinterleaver 55 that performs column twist deinterleaving corresponding to column twist interleaving.
- a multiplexer 54 that performs reverse permutation processing corresponding to the permutation processing
- a column twist deinterleaver 55 that performs column twist deinterleaving corresponding to column twist interleaving.
- no block for performing parity deinterleaving corresponding to parity interleaving is provided, and parity deinterleaving is not performed.
- bit deinterleaver 165 the column twist deinterleaver 55
- LDPC decoder 166 the reverse permutation process and the column twist deinterleave are performed, and the LDPC code not subjected to the parity deinterleave Is supplied.
- the LDPC decoder 166 performs LDPC decoding of the LDPC code from the bit deinterleaver 165, and at least performs column replacement corresponding to parity interleaving on the parity check matrix H used by the LDPC encoder 115 in FIG. 8 for LDPC encoding.
- the conversion check matrix obtained is used, and the resulting data is output as the decoding result of the LDPC target data.
- 118 is a flowchart for explaining processing performed by the QAM decoder 164, the bit deinterleaver 165, and the LDPC decoder 166 of FIG.
- step S111 the QAM decoder 164 demaps and orthogonally demodulates symbols (symbols mapped to signal points) from the time deinterleaver 163, and supplies them to the bit deinterleaver 165. Proceed to
- step S112 the bit deinterleaver 165 performs deinterleaving (bit deinterleaving) of the symbol bits of the symbols from the QAM decoder 164, and the process proceeds to step S113.
- step S112 in the bit deinterleaver 165, the multiplexer 54 performs a reverse permutation process on the symbol bits of the symbols from the QAM decoder 164, and converts the code bits of the LDPC code obtained as a result of This is supplied to the interleaver 55.
- the column twist deinterleaver 55 performs column twist deinterleaving on the LDPC code from the multiplexer 54 and supplies the resulting LDPC code to the LDPC decoder 166.
- step S113 the LDPC decoder 166 performs LDPC decoding of the LDPC code from the column twist deinterleaver 55 using the parity check matrix H used for LDPC encoding by the LDPC encoder 115 of FIG.
- a conversion check matrix obtained by performing at least column replacement corresponding to parity interleaving is used, and data obtained as a result is output to the BCH decoder 167 as a decoding result of LDPC target data.
- the multiplexer 54 that performs reverse permutation processing and the column twist deinterleaver 55 that performs column twist deinterleaving are configured separately.
- the multiplexer 54 and the column twist deinterleaver 55 can be configured integrally.
- the column twist deinterleaver 55 need not be provided in the bit deinterleaver 165 in FIG.
- Decoding is performed using a transform parity check matrix obtained by performing at least column replacement corresponding to parity interleaving on parity check matrix H for parity check matrix H used by LDPC encoder 115 in FIG.
- FIG. 119 shows an example of a parity check matrix H of an LDPC code having a code length N of 90 and a coding rate of 2/3.
- 0 is represented by a period (.).
- the parity matrix has a staircase structure.
- FIG. 120 shows a parity check matrix H ′ obtained by subjecting the parity check matrix H of FIG. 119 to row replacement of equation (11) and column replacement of equation (12).
- s, t, x, and y are integers in the range of 0 ⁇ s ⁇ 5, 0 ⁇ t ⁇ 6, 0 ⁇ x ⁇ 5, 0 ⁇ t ⁇ 6, respectively. It is.
- the first, seventh, thirteenth, nineteenth and twenty-fifth rows which are divided by six and the remainder is 1
- the second, eighth, eighth, ninth, and tenth lines that are divided by the remainder of 2 are replaced with the sixth, seventh, eighth, ninth, and tenth lines, respectively.
- the 61st column, the 61st column (parity matrix) and the 61st column, the 67th column, the 73rd column, the 79th column, and the 85th column whose remainder is 1 are divided by 61.
- 62, 63, 64, and 65, the 62, 68, 74, 80, and 86 columns, which are divided by 6 and have a remainder of 2 are called 66, 67, 68, 69, and 70 columns, respectively.
- the replacement is performed accordingly.
- a matrix obtained by performing row and column replacement on the parity check matrix H in FIG. 119 is the parity check matrix H ′ in FIG.
- the parity check matrix H ′ in FIG. 120 corresponds to the K + qx + y + 1-th column of the parity check matrix H in FIG. 119 (hereinafter referred to as the original parity check matrix as appropriate) as the K + Py + x + 1-th column.
- This is a conversion check matrix obtained by performing at least column replacement to be replaced with this column.
- the transformed check matrix H ′ in FIG. 120 is multiplied by a zero vector. That is, if the row vector obtained by performing column substitution of Expression (12) on the row vector c as the LDPC code (one codeword) of the original check matrix H is expressed as c ′, the property of the check matrix , Hc T is a 0 vector, and H'c ' T is naturally a 0 vector.
- the conversion parity check matrix H ′ in FIG. 120 is a parity check matrix of the LDPC code c ′ obtained by performing the column replacement of Expression (12) on the LDPC code c of the original parity check matrix H.
- Equation (12) the column replacement of Equation (12) is performed on the LDPC code c of the original parity check matrix H, and the LDPC code c ′ after the column replacement is decoded using the transform parity check matrix H ′ of FIG. 120 (LDPC decoding). Then, the decoding result similar to the case of decoding the LDPC code of the original parity check matrix H using the parity check matrix H is obtained by performing the inverse permutation of the column permutation of the equation (12) on the decoding result. Can do.
- FIG. 121 shows the conversion parity check matrix H ′ of FIG. 120 with an interval in units of 5 ⁇ 5 matrices.
- these 5 ⁇ 5 matrices (unit matrix, quasi-unit matrix, shift matrix, sum matrix, 0 matrix) constituting the conversion check matrix H ′ are hereinafter appropriately referred to as constituent matrices.
- FIG. 122 is a block diagram illustrating a configuration example of a decoding device that performs such decoding.
- FIG. 122 performs decoding of an LDPC code using at least the transformed parity check matrix H ′ of FIG. 121 obtained by performing column replacement of Expression (12) on the original parity check matrix H of FIG. 2 shows a configuration example of a decoding device.
- Decoding device in FIG. 122 six FIFO 300 1 to the edge data storage memory 300 consisting of 300 6, FIFO 300 1 to the selector 301 for selecting 300 6, a check node calculation section 302,2 one cyclic shift circuit 303 and 308, 18 FIFOs 304 1 to 304 18 the edge data storage memory 304 consisting of, FIFOs 304 1 to 304 18 to select the selector 305, the reception data memory 306 for storing received data, a variable node calculation section 307, a decoded word calculation section 309
- the storage area of the first stage of the FIFO 300 1 includes (1, 1) to (5, 5) of the conversion parity check matrix H ′. Data corresponding to the position of 1 in the 5 ⁇ 5 unit matrix is stored.
- the shift check matrix H '(1,21) to (5,25) shift matrix (shift matrix obtained by cyclically shifting three 5 ⁇ 5 unit matrices to the right by 3)
- the data corresponding to the 1 position is stored.
- the third to eighth storage areas store data in association with the conversion parity check matrix H ′.
- 1 in the first row of the 5 ⁇ 5 unit matrix is replaced with 0 in the shift matrix from (1,86) to (5,90) of the conversion check matrix H ′. Data corresponding to one position of the shift matrix that has been shifted by one to the left.
- the storage area of the first stage of the FIFO 300 2 has a sum matrix of (6,1) to (10,5) of the conversion check matrix H ′ (5 ⁇ 5 unit matrix cyclically shifted by one to the right)
- the data corresponding to the position of 1 of the first shift matrix constituting the first shift matrix and the sum matrix which is the sum of the second shift matrix cyclically shifted by two to the right is stored.
- the second storage area stores data corresponding to position 1 of the second shift matrix constituting the sum matrix of (6,1) to (10,5) of the conversion check matrix H ′.
- the constituent matrix is a P ⁇ P unit matrix having a weight of 1, a quasi-unit matrix in which one or more of the elements of the unit matrix are 0, or Data corresponding to the unit matrix, quasi-unit matrix, or 1 position of the shift matrix when the unit matrix or quasi-unit matrix is expressed in the form of a plurality of shift matrices obtained by cyclically shifting the unit matrix or quasi-unit matrix (Messages corresponding to branches belonging to the unit matrix, quasi-unit matrix, or shift matrix) are stored in the same address (the same FIFO among the FIFOs 300 1 to 300 6 ).
- the third to ninth storage areas are also stored in association with the conversion check matrix H ′.
- the FIFOs 300 3 to 300 6 store data in association with the conversion check matrix H ′.
- the branch data storage memory 304 is composed of 18 FIFOs 304 1 to 304 18 obtained by dividing the number of columns 90 of the conversion check matrix H ′ by 5 which is the number of columns of the constituent matrix (the number of columns P of the unit of the cyclic structure). Has been.
- FIFO304 The 1, data (messages u j from the check nodes) corresponding to the first position from the first row of the conversion parity check matrix H of FIG. 121 'to the fifth column, packed vertically in each column both Stored in the form (ignoring 0). That is, data corresponding to the position of 1 in the 5 ⁇ 5 unit matrix of (1, 1) to (5, 5) of the conversion parity check matrix H ′ is stored in the first-stage storage area of the FIFO 304 1 . .
- the sum matrix of (6,1) to (10,5) of the conversion check matrix H ′ (the first shift obtained by cyclically shifting one 5 ⁇ 5 unit matrix to the right by one)
- the data corresponding to the position of 1 of the first shift matrix constituting the matrix and the sum matrix that is the sum of the matrix and the second shift matrix cyclically shifted by two to the right is stored.
- the third storage area stores data corresponding to position 1 of the second shift matrix constituting the sum matrix of (6,1) to (10,5) of the conversion check matrix H ′.
- the constituent matrix is a P ⁇ P unit matrix having a weight of 1, a quasi-unit matrix in which one or more of the elements of the unit matrix are 0, or Data corresponding to the unit matrix, quasi-unit matrix, or 1 position of the shift matrix when the unit matrix or quasi-unit matrix is expressed in the form of a plurality of shift matrices obtained by cyclically shifting the unit matrix or quasi-unit matrix (identity matrix, the message corresponding to the branch belonging to quasi unit matrix or shift matrix) are stored in the same address (same FIFO from among the FIFOs 304 1 to 304 18).
- data is also stored in the storage areas of the fourth and fifth stages in association with the conversion parity check matrix H ′.
- the number of stages in the storage area of the FIFO 304 1 is 5, which is the maximum number of 1s (Hamming weights) in the row direction in the first to fifth columns of the conversion parity check matrix H ′.
- the FIFOs 304 2 and 304 3 store data in association with the conversion parity check matrix H ′, and each has a length (number of stages) of 5.
- the FIFOs 304 4 to 304 12 store data in association with the conversion check matrix H ′, and each has a length of 3.
- the FIFOs 304 13 to 304 18 store data in association with the conversion check matrix H ′, and each has a length of 2.
- the branch data storage memory 300 includes six FIFOs 300 1 to 300 6 , and to which row of the conversion check matrix H ′ of FIG. 121 the five messages D 311 supplied from the preceding cyclic shift circuit 308 belong. according to the information (Matrix data) D312, a FIFO to store the data, select from among the FIFO300 1 to 300 6, will be stored in the order together five messages D311 to the selected FIFO. Also, the edge data storage memory 300, when reading data, sequentially reads five messages D300 1 from FIFO 300 1, supplied to the next stage of the selector 301. The branch data storage memory 300 reads the messages in order from the FIFOs 300 2 to 300 6 after reading the messages from the FIFO 300 1 and supplies them to the selector 301.
- the selector 301 selects five messages from the FIFO from which the current data is read out of the FIFOs 300 1 to 300 6 according to the select signal D301, and supplies the selected message to the check node calculation unit 302 as a message D302.
- Check node calculation section 302, 302 1 five check node calculator to consist 302 5, messages D302 (D302 1 to D302 5) supplied through the selector 301 using (messages v i of the expression (7)), A check node operation is performed according to Equation (7), and five messages D303 (D303 1 to D303 5 ) (message u j in Equation (7)) obtained as a result of the check node operation are supplied to the cyclic shift circuit 303.
- the cyclic shift circuit 303 circulates the five messages D303 1 to D303 5 obtained by the check node calculation unit 302 using unit matrices (or quasi-unit matrices) whose corresponding branches are the original in the conversion check matrix H ′.
- a cyclic shift is performed based on the information (Matrix data) D305 indicating whether the data has been click-shifted, and the result is supplied to the branch data storage memory 304 as a message D304.
- the branch data storage memory 304 includes 18 FIFOs 304 1 to 304 18 , and is in accordance with information D 305 indicating which row of the conversion check matrix H ′ the five messages D 304 supplied from the preceding cyclic shift circuit 303 belong to.
- the FIFO for storing data is selected from the FIFOs 304 1 to 304 18 , and the five messages D 304 are collectively stored in the selected FIFO in order.
- the edge data storage memory 304 when reading data, sequentially reads five messages D306 1 from FIFOs 304 1, supplied to the next stage of the selector 305.
- Edge data storage memory 304 after completion of the data read from the FIFOs 304 1, from FIFOs 304 2 to 304 18, sequentially reads out a message, to the selector 305.
- the selector 305 selects five messages from the FIFO from which the current data is read out of the FIFOs 304 1 to 304 18 in accordance with the select signal D307, and as the message D308, the variable node calculation unit 307 and the decoded word calculation unit 309.
- the received data rearrangement unit 310 rearranges the LDPC code D313 corresponding to the parity check matrix H of FIG. 119 received through the communication path 13 by performing column replacement of Expression (12), and receives the received data D314 as The data is supplied to the reception data memory 306.
- the reception data memory 306 calculates and stores reception LLRs (log likelihood ratios) from the reception data D314 supplied from the reception data rearrangement unit 310, and collects the reception LLRs by five as reception values D309.
- the variable node calculation unit 307 and the decoded word calculation unit 309 are supplied.
- the variable node calculation unit 307 includes five variable node calculators 307 1 to 307 5 , a message D308 (D308 1 to D308 5 ) (message u j in Expression (1)) supplied through the selector 305, and received data. using five reception values supplied from use memory 306 D309 (formula (reception values u 0i 1)), the variable node operation according to equation (1), to the message D310 (D310 1 not obtained as a result of the calculation D310 5 ) (message v i in equation (1)) is supplied to the cyclic shift circuit 308.
- the cyclic shift circuit 308 cyclically shifts the message D310 1 to D310 5 calculated by the variable node calculation unit 307 by a number of unit matrices (or quasi-unit matrices) whose corresponding branches are the original in the transformation check matrix H ′. A cyclic shift is performed based on the information as to whether or not the data has been obtained, and the result is supplied to the branch data storage memory 300 as a message D311.
- the LDPC code can be decoded once (variable node calculation and check node calculation) by performing the above operation once. 122 decodes the LDPC code a predetermined number of times, and then obtains and outputs the final decoding result in the decoded word calculation unit 309 and the decoded data rearrangement unit 311.
- the decoded word calculation unit 309 includes five decoded word calculators 309 1 to 309 5 , and five messages D308 (D308 1 to D308 5 ) (message u j in Expression (5)) output from the selector 305 and Using the five reception values D309 (the reception value u 0i in equation (5)) supplied from the reception data memory 306, the decoding result (decoding) based on equation (5) is used as the final stage of multiple times of decoding. And the decoded data D315 obtained as a result is supplied to the decoded data rearranging unit 311.
- the decoded data rearranging unit 311 rearranges the order of the decoded data D315 supplied from the decoded word calculation unit 309 by performing the column replacement in the formula (12), and obtains the final decoding result. Output as D316.
- one or both of row permutation and column permutation is applied to the parity check matrix (original parity check matrix), and one or more of the P ⁇ P unit matrix and one of its elements is set to 0.
- a quasi-unit matrix, a unit matrix or a shift matrix obtained by cyclically shifting a quasi-unit matrix, a unit matrix, a quasi-unit matrix, a sum matrix that is a sum of shift matrices, or a combination of P ⁇ P 0 matrices By converting to a parity check matrix (conversion parity check matrix) that can be represented by a combination of constituent matrices, decoding of LDPC code, check node operation and variable node operation, P smaller than the number of rows and columns of the parity check matrix It is possible to adopt an architecture that is performed simultaneously.
- the LDPC decoder 166 constituting the receiving device 12 performs LDPC decoding by simultaneously performing P check node operations and P variable node operations, for example, as in the decoding device of FIG.
- the parity check matrix of the LDPC code output from the LDPC encoder 115 that constitutes the transmission apparatus 11 of FIG. 8 is, for example, the parity matrix shown in FIG.
- the parity interleaver 23 of the transmission apparatus 11 interleaves the K + qx + y + 1-th code bit at the position of the K + Py + x + 1-th code bit.
- the information length K is set to 60
- the column number P of the cyclic structure unit is set to 5
- the column twist deinterleaver 55 performs the LDPC code on which the parity deinterleaving is not performed to the LDPC decoder 166, that is, the sequence of Expression (12).
- the LDPC code in a state where the replacement is performed is supplied, and the LDPC decoder 166 performs the same processing as that of the decoding device in FIG. 122 except that the column replacement of Expression (12) is not performed.
- FIG. 123 shows a configuration example of the LDPC decoder 166 of FIG.
- the LDPC decoder 166 is configured in the same manner as the decoding device of FIG. 122 except that the received data rearrangement unit 310 of FIG. 122 is not provided, and the column replacement of Expression (12) is performed. Except for this, the same processing as that of the decoding device of FIG.
- the scale can be reduced as compared with the decoding apparatus of FIG.
- the code length N of the LDPC code is 90
- the information length K is 60
- the number of columns of the unit of the cyclic structure (the number of rows and the number of columns of the constituent matrix).
- P is 5
- the LDPC code is a LDPC code in which the number P is 360 and the divisor q is M / P.
- the LDPC decoder 166 in FIG. 123 performs P check node operations and variable node operations for such LDPC codes. It is applicable when performing LDPC decoding by carrying out simultaneously.
- FIG. 124 is a diagram for explaining the processing of the multiplexer 54 constituting the bit deinterleaver 165 of FIG. 117.
- a in FIG. 124 shows a functional configuration example of the multiplexer 54.
- the multiplexer 54 includes a reverse switching unit 1001 and a memory 1002.
- the multiplexer 54 performs reverse replacement processing (reverse processing of replacement processing) corresponding to the replacement processing performed by the demultiplexer 25 of the transmission device 11 on the symbol bit of the symbol supplied from the preceding stage QAM decoder 164, that is, replacement.
- a reverse replacement process is performed to return the position of the code bit (symbol bit) of the LDPC code replaced by the process to the original position, and the resulting LDPC code is supplied to the subsequent column twist deinterleaver 55.
- the reverse switching unit 1001 includes the symbol bits y 0 , y 1 ,..., Y mb ⁇ 1 of the b symbols in units of (consecutive) b symbols. Is supplied.
- the reverse permutation unit 1001 replaces the mb symbol bits y 0 to y mb ⁇ 1 with the original mb bit code bits b 0 , b 1 ,. Reverse replacement is performed to return to the order of the sign bits b 0 to b mb ⁇ 1 before the replacement in the replacement unit 32 constituting the multiplexer 25, and the resulting mb bit code bits b 0 to b mb ⁇ 1 is output.
- the memory 1002 stores mb bits in the row (horizontal) direction and N / (mb in the column (vertical) direction, similarly to the memory 31 constituting the demultiplexer 25 on the transmission device 11 side. ) It has a storage capacity for storing bits. That is, the memory 1002 includes mb columns that store N / (mb) bits.
- the code bits of the LDPC code output from the reverse switching unit 1001 are written in the direction in which the code bits are read from the memory 31 of the demultiplexer 25 of the transmission device 11.
- the sign bit written in the memory 1002 is read in the direction in which the sign bit is written.
- the multiplexer 54 reads the code bits from the memory 1002 in the column direction and supplies them to the subsequent column twist deinterleaver 55.
- B in FIG. 124 is a diagram illustrating reading of the sign bit from the memory 1002.
- the multiplexer 54 reads the code bits of the LDPC code from the top to the bottom (column direction) of the columns constituting the memory 1002 from the left to the right columns.
- FIG. 125 is a diagram for explaining processing of the column twist deinterleaver 55 configuring the bit deinterleaver 165 of FIG. 117.
- FIG. 125 shows a configuration example of the memory 1002 of the multiplexer 54.
- the memory 1002 stores mb bits in the column (vertical) direction and has a storage capacity for storing N / (mb) bits in the row (horizontal) direction, and includes mb columns.
- the column twist deinterleaver 55 performs column twist deinterleaving by writing the code bit of the LDPC code in the row direction to the memory 1002 and controlling the read start position when reading in the column direction.
- the code bit sequence rearranged by the column twist interleave is appropriately changed by appropriately changing the read start position where the code bit read is started for each of the plurality of columns.
- a reverse rearrangement process for returning the sequence is performed.
- FIG. 125 shows a configuration example of the memory 1002 when the modulation method is 16APSK, 16QAM or the like and the multiple b is 1 as described in FIG.
- the bit number m of one symbol is 4 bits
- the column twist deinterleaver 55 sequentially writes the code bits of the LDPC code output from the reverse switching unit 1001 in the row direction, instead of the multiplexer 54, from the first row to the lower row of the memory 1002.
- the column twist deinterleaver 55 reads the code bits from the top to the bottom (column direction) from the top of the memory 1002 in the column from the left to the right. Do towards.
- the column twist deinterleaver 55 reads the code bit from the memory 1002 with the write start position where the column twist interleaver 24 on the transmission apparatus 11 side writes the code bit as the code bit read start position. .
- the modulation method is 16APSK or 16QAM
- multiple b Is 1 the column twist deinterleaver 55 sets the read start position for the leftmost column to the position where the address is 0, and (from the left) the read start position for the second column.
- the position is the position where the address is 2
- the read start position is the position of the address 4 for the third column
- the read start position is the position of the address 7 for the fourth column.
- FIG. 126 is a block diagram showing another configuration example of the bit deinterleaver 165 of FIG.
- bit deinterleaver 165 in FIG. 126 has the same configuration as that in FIG. 117 except that a parity deinterleaver 1011 is newly provided.
- the bit deinterleaver 165 includes a multiplexer (MUX) 54, a column twist deinterleaver 55, and a parity deinterleaver 1011.
- the bit deinterleaver 165 performs bit deinterleaving of the code bits of the LDPC code from the QAM decoder 164. Do.
- the multiplexer 54 replaces the LDPC code from the QAM decoder 164 by reverse replacement processing (reverse processing of the replacement processing) corresponding to the replacement processing performed by the demultiplexer 25 of the transmission device 11, that is, the replacement processing. Then, a reverse permutation process is performed to return the position of the code bit to the original position, and the resulting LDPC code is supplied to the column twist deinterleaver 55.
- reverse replacement processing reverse processing of the replacement processing
- the column twist deinterleaver 55 performs column twist deinterleave corresponding to the column twist interleave as the rearrangement process performed by the column twist interleaver 24 of the transmission device 11 for the LDPC code from the multiplexer 54.
- the LDPC code obtained as a result of the column twist deinterleave is supplied from the column twist deinterleaver 55 to the parity deinterleaver 1011.
- the parity deinterleaver 1011 targets the code bit after the column twist deinterleave in the column twist deinterleaver 55, and performs parity deinterleave corresponding to the parity interleave performed by the parity interleaver 23 of the transmission device 11 (inverse of parity interleave). In other words, parity deinterleaving is performed to return the code bits of the LDPC code whose arrangement has been changed by parity interleaving to the original order.
- the LDPC code obtained as a result of parity deinterleaving is supplied from the parity deinterleaver 1011 to the LDPC decoder 166.
- the LDPC decoder 166 includes the LDPC code subjected to the reverse permutation process, the column twist deinterleave, and the parity deinterleave, that is, the LDPC encoding according to the check matrix H.
- the LDPC code obtained by is supplied.
- the LDPC decoder 166 performs LDPC decoding of the LDPC code from the bit deinterleaver 165 using the parity check matrix H used by the LDPC encoder 115 of the transmission device 11 for LDPC encoding. That is, the LDPC decoder 166 performs LDPC decoding of the LDPC code from the bit deinterleaver 165 using the parity check matrix H itself used for the LDPC encoding by the LDPC encoder 115 of the transmission device 11 or to the parity check matrix H. On the other hand, the conversion check matrix obtained by performing at least column replacement corresponding to parity interleaving is used.
- the LDPC decoder 166 since the LDPC code obtained by the LDPC encoding according to the check matrix H is supplied from the bit deinterleaver 165 (its parity deinterleaver 1011) to the LDPC decoder 166, the LDPC When the LDPC decoding of the code is performed using the parity check matrix H itself used for the LDPC encoding by the LDPC encoder 115 of the transmission apparatus 11, the LDPC decoder 166, for example, a message (check node message, variable node message) Decoding device that performs LDPC decoding by full serial decoding (full serial decoding) method that sequentially performs operations of one node at a time, and full parallel decoding (full parallel) that performs message operations on all nodes simultaneously (in parallel) A decoding apparatus that performs LDPC decoding by a decoding method can be used.
- LDPC decoder 166 performs LDPC decoding of an LDPC code, and a transform check obtained by performing at least column replacement corresponding to parity interleaving on parity check matrix H used by LDPC encoder 115 of transmitting apparatus 11 for LDPC encoding
- the LDPC decoder 166 is an architecture decoding device that simultaneously performs P (or a divisor other than 1 of P) check node operations and variable node operations.
- the decoding apparatus (FIG. 122) having the received data rearrangement unit 310 that rearranges the code bits of the LDPC code by performing column replacement similar to the column replacement for obtaining the check matrix on the LDPC code. it can.
- a multiplexer 54 that performs reverse permutation processing, a column twist deinterleaver 55 that performs column twist deinterleaving, and a parity deinterleaver 1011 that performs parity deinterleaving are separately illustrated.
- the multiplexer 54, the column twist deinterleaver 55, and the parity deinterleaver 1011 are configured, the parity interleaver 23, the column twist interleaver 24, and the demultiplexer 25 of the transmission device 11 Similarly, it can be configured integrally.
- bit interleaver 116 (FIG. 8) of the transmission apparatus 11 is configured without the parity interleaver 23 and the column twist interleaver 24, the bit deinterleaver 165 in FIG. It is possible to configure without the twist deinterleaver 55 and the parity deinterleaver 1011.
- the LDPC decoder 166 includes a full serial decoding decoding apparatus that performs LDPC decoding using the check matrix H itself, a full parallel decoding decoding apparatus that performs LDPC decoding using the check matrix H itself,
- the transform parity check matrix H ′ can be used to configure the decoding apparatus (FIG. 122) having the received data rearrangement unit 310 that performs LDPC decoding by P simultaneous check node computations and variable node computations.
- FIG. 127 is a block diagram illustrating a first configuration example of a receiving system to which the receiving device 12 can be applied.
- the reception system includes an acquisition unit 1101, a transmission path decoding processing unit 1102, and an information source decoding processing unit 1103.
- the acquisition unit 1101 obtains a signal including an LDPC code obtained by LDPC encoding at least LDPC target data such as program image data and audio data, for example, terrestrial digital broadcasting, satellite digital broadcasting, CATV network, the Internet, and the like. Obtained via a transmission path (communication path) (not shown) such as a network of the network, and supplied to the transmission path decoding processing unit 1102.
- a transmission path communication path
- the acquisition unit 1101 when the signal acquired by the acquisition unit 1101 is broadcast from a broadcasting station via a terrestrial wave, a satellite wave, a CATV (Cable Television) network, or the like, the acquisition unit 1101 includes a tuner, It consists of STB (Set Top Box). Further, when the signal acquired by the acquisition unit 1101 is transmitted from a web server by multicast such as IPTV (Internet Protocol) Television, for example, the acquisition unit 1101 may be a NIC (Network Interface Card) or the like. Network I / F (Inter face).
- NIC Network Interface Card
- the transmission path decoding processing unit 1102 corresponds to the receiving device 12.
- the transmission path decoding processing unit 1102 performs a transmission path decoding process including at least processing for correcting an error occurring in the transmission path on the signal acquired by the acquisition unit 1101 via the transmission path, and obtains a signal obtained as a result thereof.
- the information is supplied to the information source decoding processing unit 1103.
- the signal acquired by the acquisition unit 1101 via the transmission path is a signal obtained by performing at least error correction coding for correcting an error occurring in the transmission path.
- the transmission path decoding processing unit 1102 Such a signal is subjected to transmission path decoding processing such as error correction processing, for example.
- examples of error correction coding include LDPC coding and BCH coding.
- at least LDPC encoding is performed as error correction encoding.
- the transmission path decoding process may include demodulation of the modulation signal.
- the information source decoding processing unit 1103 performs an information source decoding process including at least a process of expanding the compressed information into the original information on the signal subjected to the transmission path decoding process.
- the signal acquired by the acquisition unit 1101 via the transmission path may be subjected to compression coding for compressing information in order to reduce the amount of data such as images and sounds as information.
- the information source decoding processing unit 1103 performs information source decoding processing such as processing (decompression processing) for expanding the compressed information to the original information on the signal subjected to the transmission path decoding processing.
- the information source decoding processing unit 1103 performs a process of expanding the compressed information to the original information. I will not.
- examples of the decompression process include MPEG decoding.
- the transmission path decoding process may include descrambling and the like in addition to the decompression process.
- the acquisition unit 1101 for example, compression coding such as MPEG coding is performed on data such as images and sound, and further error correction codes such as LDPC coding are performed.
- the processed signal is acquired via the transmission path and supplied to the transmission path decoding processing unit 1102.
- the transmission path decoding processing unit 1102 for example, processing similar to that performed by the receiving device 12 is performed on the signal from the acquisition unit 1101 as transmission path decoding processing, and the resulting signal is used as an information source. This is supplied to the decryption processing unit 1103.
- the information source decoding processing unit 1103 performs information source decoding processing such as MPEG decoding on the signal from the transmission path decoding processing unit 1102 and outputs the resulting image or sound.
- the reception system of FIG. 127 as described above can be applied to, for example, a television tuner that receives a television broadcast as a digital broadcast.
- the acquisition unit 1101, the transmission path decoding processing unit 1102, and the information source decoding processing unit 1103 are each configured as one independent device (hardware (IC (Integrated Circuit) or the like)) or software module). Is possible.
- the set of the unit 1103, the acquisition unit 1101, the transmission path decoding processing unit 1102, and the information source decoding processing unit 1103 can be configured as one independent device.
- 128 is a block diagram illustrating a second configuration example of a receiving system to which the receiving device 12 can be applied.
- the reception system of FIG. 128 includes an acquisition unit 1101, a transmission path decoding processing unit 1102, and an information source decoding processing unit 1103, and is common to the case of FIG. 127, in that an output unit 1111 is newly provided. This is different from the case of FIG.
- the output unit 1111 is, for example, a display device that displays an image or a speaker that outputs audio, and outputs an image, audio, or the like as a signal output from the information source decoding processing unit 1103. That is, the output unit 1111 displays an image or outputs sound.
- the reception system of FIG. 128 as described above can be applied to, for example, a TV (television receiver) that receives a television broadcast as a digital broadcast, a radio receiver that receives a radio broadcast, or the like.
- a TV television receiver
- a radio receiver that receives a radio broadcast
- the signal output from the transmission path decoding processing unit 1102 is supplied to the output unit 1111.
- FIG. 129 is a block diagram illustrating a third configuration example of the receiving system to which the receiving device 12 can be applied.
- the reception system of FIG. 129 is common to the case of FIG. 127 in that it includes an acquisition unit 1101 and a transmission path decoding processing unit 1102.
- the receiving system of FIG. 129 is different from the case of FIG. 127 in that the information source decoding processing unit 1103 is not provided and the recording unit 1121 is newly provided.
- the recording unit 1121 records a signal (for example, TS packet of MPEG TS) output from the transmission path decoding processing unit 1102 on a recording (storage) medium such as an optical disk, a hard disk (magnetic disk), or a flash memory (memory). )
- a recording (storage) medium such as an optical disk, a hard disk (magnetic disk), or a flash memory (memory).
- the reception system of FIG. 129 as described above can be applied to a recorder or the like for recording a television broadcast.
- the receiving system is configured by providing an information source decoding processing unit 1103, and the information source decoding processing unit 1103 performs a signal after the information source decoding processing, that is, an image obtained by decoding, Audio can be recorded by the recording unit 1121.
- FIG. 130 shows a configuration example of an embodiment of a computer in which a program for executing the series of processes described above is installed.
- the program can be recorded in advance in a hard disk 705 or a ROM 703 as a recording medium built in the computer.
- the program is stored temporarily on a removable recording medium 711 such as a flexible disk, a CD-ROM (Compact Disc Read Only Memory), an MO (Magneto Optical) disc, a DVD (Digital Versatile Disc), a magnetic disc, or a semiconductor memory. It can be stored (recorded) permanently.
- a removable recording medium 711 can be provided as so-called package software.
- the program is installed in the computer from the removable recording medium 711 as described above, or transferred from the download site to the computer wirelessly via a digital satellite broadcasting artificial satellite, LAN (Local Area Network),
- the program can be transferred to a computer via a network such as the Internet.
- the computer can receive the program transferred in this way by the communication unit 708 and install it in the built-in hard disk 705.
- the computer has a CPU (Central Processing Unit) 702 built-in.
- An input / output interface 710 is connected to the CPU 702 via a bus 701, and the CPU 702 operates an input unit 707 including a keyboard, a mouse, a microphone, and the like by the user via the input / output interface 710.
- a program stored in a ROM (Read Only Memory) 703 is executed accordingly.
- the CPU 702 may be a program stored in the hard disk 705, a program transferred from a satellite or a network, received by the communication unit 708 and installed in the hard disk 705, or a removable recording medium 711 installed in the drive 709.
- the program read and installed in the hard disk 705 is loaded into a RAM (Random Access Memory) 704 and executed.
- the CPU 702 performs processing according to the above-described flowchart or processing performed by the configuration of the above-described block diagram.
- the CPU 702 outputs the processing result from the output unit 706 configured by an LCD (Liquid Crystal Display), a speaker, or the like, for example, via the input / output interface 710 or from the communication unit 708 as necessary. Transmission and further recording on the hard disk 705 are performed.
- processing steps for describing a program for causing a computer to perform various types of processing do not necessarily have to be processed in time series according to the order described in the flowchart, but in parallel or individually. This includes processing to be executed (for example, parallel processing or processing by an object).
- the program may be processed by one computer, or may be processed in a distributed manner by a plurality of computers. Furthermore, the program may be transferred to a remote computer and executed.
- the above-described new LDPC code (the check matrix initial value table) is used regardless of whether the communication path 13 (FIG. 7) is a satellite line, a terrestrial wave, a cable (wired line), or the like. Is possible. Furthermore, the new LDPC code can be used for data transmission other than digital broadcasting.
Landscapes
- Physics & Mathematics (AREA)
- Engineering & Computer Science (AREA)
- Probability & Statistics with Applications (AREA)
- Theoretical Computer Science (AREA)
- Mathematical Physics (AREA)
- General Physics & Mathematics (AREA)
- Signal Processing (AREA)
- Computer Networks & Wireless Communication (AREA)
- Computational Mathematics (AREA)
- Mathematical Analysis (AREA)
- Mathematical Optimization (AREA)
- Pure & Applied Mathematics (AREA)
- Multimedia (AREA)
- Discrete Mathematics (AREA)
- Algebra (AREA)
- Computing Systems (AREA)
- Error Detection And Correction (AREA)
Abstract
Description
548 9528 12205 12770 22023 22082 25884 27421 33215 36046 43580 43953 47539
919 2623 5098 5514 5645 6348 9666 13795 14555 43224 44048 44948 47964
995 7270 17753 21272 29228 29916 31634 34055 35205 37499 37777 47490 49301
645 3803 8836 9470 11054 20253 29417 31243 31990 36468 38715 39932 43045
14572 18646 21100 26617 32033 32410 37195 38586 43833 44577 45584 46453 49515
6004 16982 17829 24616 28056 29646 32944 39051 42517 47086 48585 48772 49247
1306 1447 4898 7781 18587 25724 26672 35062 35202 37080 39781 46111 47595
92 3231 13043 22258 24198 28923 33303 37846 43610 44857 47322 48914 49291
298 12557 13469 14451 21917 23539 26310 29839 37050 38507 41377 46971 48155
12582 13044 21039 30600 34202 34947 37120 39108 39203 43449 46941 48542 49354
871 12218 12680 14152 17171 25797 29021 37783 43728 47519 48794 48898 48980
35 4623 13422 15881 16692 17463 23675 28063 31248 41997 44246 47992 48339
7150 13015 17950 18214 20659 23579 25714 28328 32658 39717 39995 43322 45884
82 11054 11845 19085 24174 26694 41530 45954 46508 46892 48832 49097 49420
5789 13839 18512 25596 26478 26736 29431 32349 33384 41765 46661 49206 49543
13805 17786 17798 29653 30310 34870 40176 40391 43227 45292 46423 46855 49454
12433 27119 34645
32065 34998 44021
5158 16546 34359
44 33285 39929
39032 39296 40317
9885 45251 47640
14383 43446 44478
31280 39945 48472
27961 38221 48391
2927 37404 38716
19461 42462 46162
24909 25915 40636
11029 35538 45381
26880 34179 48775
192 6032 26853
4563 14952 24256
10003 30853 43811
749 36334 41363
100 17006 24982
9507 20228 31214
41691 44310 47083
24070 30411 46982
2727 28251 49289
16689 21167 32590
40813 41198 46175
8336 32714 43075
であるデータ処理装置又はデータ処理方法である。
548 9528 12205 12770 22023 22082 25884 27421 33215 36046 43580 43953 47539
919 2623 5098 5514 5645 6348 9666 13795 14555 43224 44048 44948 47964
995 7270 17753 21272 29228 29916 31634 34055 35205 37499 37777 47490 49301
645 3803 8836 9470 11054 20253 29417 31243 31990 36468 38715 39932 43045
14572 18646 21100 26617 32033 32410 37195 38586 43833 44577 45584 46453 49515
6004 16982 17829 24616 28056 29646 32944 39051 42517 47086 48585 48772 49247
1306 1447 4898 7781 18587 25724 26672 35062 35202 37080 39781 46111 47595
92 3231 13043 22258 24198 28923 33303 37846 43610 44857 47322 48914 49291
298 12557 13469 14451 21917 23539 26310 29839 37050 38507 41377 46971 48155
12582 13044 21039 30600 34202 34947 37120 39108 39203 43449 46941 48542 49354
871 12218 12680 14152 17171 25797 29021 37783 43728 47519 48794 48898 48980
35 4623 13422 15881 16692 17463 23675 28063 31248 41997 44246 47992 48339
7150 13015 17950 18214 20659 23579 25714 28328 32658 39717 39995 43322 45884
82 11054 11845 19085 24174 26694 41530 45954 46508 46892 48832 49097 49420
5789 13839 18512 25596 26478 26736 29431 32349 33384 41765 46661 49206 49543
13805 17786 17798 29653 30310 34870 40176 40391 43227 45292 46423 46855 49454
12433 27119 34645
32065 34998 44021
5158 16546 34359
44 33285 39929
39032 39296 40317
9885 45251 47640
14383 43446 44478
31280 39945 48472
27961 38221 48391
2927 37404 38716
19461 42462 46162
24909 25915 40636
11029 35538 45381
26880 34179 48775
192 6032 26853
4563 14952 24256
10003 30853 43811
749 36334 41363
100 17006 24982
9507 20228 31214
41691 44310 47083
24070 30411 46982
2727 28251 49289
16689 21167 32590
40813 41198 46175
8336 32714 43075
であるデータ処理装置又はデータ処理方法である。
100 3433 4111 9089 13360 24012 26305 30252 31430 31769 34689 34917 36091 40873 41983 42689 43835 44318 47109
3 48 124 2240 7029 21694 24565 29302 39777 42706 43631 43784 46033 47064 47079 47141 47239 47439 47479
2 5675 7056 12715 24128 26596 30571 38210 38586 41138 42272 43336 43444 43917 45812 46840 47245 47286 47510
2103 4285 10068 10702 12693 17619 18711 21309 22191 22999 37432 45646 46275 46338 46777 46860 46963 47432 47472
6827 8209 8606 10412 15670 19469 22205 22215 25425 29565 34843 34985 37686 39277 44625 45016 45623 47069 47250
58 114 1751 7913 24642 26995 40734 41486 43133 44804 45490 45725 46122 46412 47019 47080 47103 47495 47506
96 5952 9078 9786 17738 17888 17986 31657 34430 34763 35450 37276 42395 43223 43283 44261 45648 47014 47276
106 5405 9614 20500 21633 23242 28875 37238 38854 41778 42292 43883 45909 46558 46826 47292 47353 47436 47504
32 11217 12153 26818 27616 38783 39976 40842 43581 43703 44287 44435 44576 44774 46080 46098 46801 46813 47168
65 102 111 3879 11224 11772 23623 27306 28726 34663 34873 36288 39196 42003 45279 45629 46836 47021 47419
77 131 11275 18964 20418 22364 22635 27727 28689 29720 29781 32110 41597 42046 43952 44786 46416 46808 47200
87 8637 10829 23737 24117 26486 29603 34389 35509 35872 38948 40643 42698 45949 46159 46660 47041 47165 47220
2 58 3110 7539 8886 10422 11597 13385 27870 35895 38120 43546 44948 46272 46369 46596 47199 47317 47351
78 16119 27780 32231 38973 39088 40118 40231 43170 44131 44203 44878 45905 46250 47011 47113 47195 47303 47427
2960 6685 8830 11107 11843 12811 30030 36574 36850 36920 37706 38025 41007 43554 44109 44643 45874 46469 46565
125 366 10175 29860
45 17503 44634 45789
6272 19614 34408 37248
14785 41017 44274 46858
19935 22960 44726 44919
15247 17925 33947 37392
34631 39148 43287 45443
8544 26457 30996 38672
11725 31442 42167 45461
22357 41743 46702 47285
13786 26288 41358 43082
7306 21352 43298 47359
77 5188 20988 45572
10334 23790 40878
9304 29379 47450
22048 44762 47300
8529 8825 47443
40831 41328 46415
26715 43038 46498
26925 30797 43181
32434 45624 47460
17989 31811 47215
5624 25501 33016
5024 9037 33642
93 7329 46908
20303 42578 46780
16137 26869 42360
112 3049 46527
23615 29931 47360
23050 24267 44687
60 40754 47114
30217 36283 37445
127 27308 38345
であるデータ処理装置又はデータ処理方法である。
100 3433 4111 9089 13360 24012 26305 30252 31430 31769 34689 34917 36091 40873 41983 42689 43835 44318 47109
3 48 124 2240 7029 21694 24565 29302 39777 42706 43631 43784 46033 47064 47079 47141 47239 47439 47479
2 5675 7056 12715 24128 26596 30571 38210 38586 41138 42272 43336 43444 43917 45812 46840 47245 47286 47510
2103 4285 10068 10702 12693 17619 18711 21309 22191 22999 37432 45646 46275 46338 46777 46860 46963 47432 47472
6827 8209 8606 10412 15670 19469 22205 22215 25425 29565 34843 34985 37686 39277 44625 45016 45623 47069 47250
58 114 1751 7913 24642 26995 40734 41486 43133 44804 45490 45725 46122 46412 47019 47080 47103 47495 47506
96 5952 9078 9786 17738 17888 17986 31657 34430 34763 35450 37276 42395 43223 43283 44261 45648 47014 47276
106 5405 9614 20500 21633 23242 28875 37238 38854 41778 42292 43883 45909 46558 46826 47292 47353 47436 47504
32 11217 12153 26818 27616 38783 39976 40842 43581 43703 44287 44435 44576 44774 46080 46098 46801 46813 47168
65 102 111 3879 11224 11772 23623 27306 28726 34663 34873 36288 39196 42003 45279 45629 46836 47021 47419
77 131 11275 18964 20418 22364 22635 27727 28689 29720 29781 32110 41597 42046 43952 44786 46416 46808 47200
87 8637 10829 23737 24117 26486 29603 34389 35509 35872 38948 40643 42698 45949 46159 46660 47041 47165 47220
2 58 3110 7539 8886 10422 11597 13385 27870 35895 38120 43546 44948 46272 46369 46596 47199 47317 47351
78 16119 27780 32231 38973 39088 40118 40231 43170 44131 44203 44878 45905 46250 47011 47113 47195 47303 47427
2960 6685 8830 11107 11843 12811 30030 36574 36850 36920 37706 38025 41007 43554 44109 44643 45874 46469 46565
125 366 10175 29860
45 17503 44634 45789
6272 19614 34408 37248
14785 41017 44274 46858
19935 22960 44726 44919
15247 17925 33947 37392
34631 39148 43287 45443
8544 26457 30996 38672
11725 31442 42167 45461
22357 41743 46702 47285
13786 26288 41358 43082
7306 21352 43298 47359
77 5188 20988 45572
10334 23790 40878
9304 29379 47450
22048 44762 47300
8529 8825 47443
40831 41328 46415
26715 43038 46498
26925 30797 43181
32434 45624 47460
17989 31811 47215
5624 25501 33016
5024 9037 33642
93 7329 46908
20303 42578 46780
16137 26869 42360
112 3049 46527
23615 29931 47360
23050 24267 44687
60 40754 47114
30217 36283 37445
127 27308 38345
であるデータ処理装置又はデータ処理方法である。
339 4777 5366 7623 13034 13260 15107 17772 20338 21178 25914 27663 29948 37489 41021
3871 5812 9795 23437 24079 27699 33471 39878 40302 41038 41217 42316 42765 43675 45118
3699 4072 16553 21492 26210 29839 30322 34139 38227 39696 40762 41156 41269 45168 45350
995 12194 12494 16542 20423 21950 23519 26215 26708 30587 38352 38840 39729 41645 43210
3963 4315 6832 11354 21042 21084 21108 25595 33109 34029 34448 35129 38018 39012 44791
164 887 2902 9021 9193 16705 17850 19241 25893 33427 37416 41024 41355 44381 45303
1367 1495 5495 14440 18026 18130 18178 21946 24057 25663 29216 31965 38107 43907 44278
10763 13722 13975 18294 20813 23028 23353 24211 37366 38805 40985 41792 42495 43259 43528
1580 12448 21464 31246 33058 34794 35760 36021 36426 37138 37478 38199 42138 42335 45207
83 112 12225 15224 18205 21345 28488 34362 37195 39660 42371 42814 44509 45201 45244
6836 7635 11644 16591 17121 19307 21456 23544 30596 37887 38141 38581 43607 44246 45097
9174 14934 17131 29762 30243 31656 33251 35498 37106 37655 41462 44002 44649 45032 45230
33 5376 13536 17068 18581 23478 32021 32074 33716 38434 39452 42166 44305 44979 45306
6013 7553 10023 19354 23126 25427 27665 30239 32699 34123 36171 38898 38972 41974 45213
41 98 3088 8522 26252 29602 30009 30138 30948 32190 32428 32498 34273 34955 45311
2000 15664 20677 20792 22980 25111 31491 37611 37981 39872 41668 42336 43602 43828 45329
23 67 97 5339 8121 8583 20647 25425 32305 37158 40968 41578 43492 44929 45273
1643 3496 5121 6546 15643 16423 20602 39950 43178 43252 43683 43992 44001 44611 45125
11093 19172 20548 24518 28289 29246 30148 34884 40403 40745 42723 43064 44448 44723 44812
12748 12799 28567 41605
1965 4087 31879
27178 33638 38344
9580 13096 45337
2672 22800 43869
28287 31407 31975
2823 5108 9945
5891 30848 42082
23 41944 44909
909 2311 45162
24998 37829 44704
35339 40087 45019
16928 26505 35256
26462 27297 37766
19656 35067 38586
6958 17172 41412
72 26012 37231
15259 16044 30243
2879 12148 34601
36173 39731 42668
20670 35816 43266
22570 27213 30404
40284 44171 45313
17765 22514 39347
24711 39892 45132
13741 34633 44535
15209 31692 45280
11189 43771 45303
28294 31110 32287
29085 39876 45246
24285 36009 45347
6882 28921 34504
9256 19267 44194
2132 21404 28687
23809 34383 44540
であるデータ処理装置又はデータ処理方法である。
339 4777 5366 7623 13034 13260 15107 17772 20338 21178 25914 27663 29948 37489 41021
3871 5812 9795 23437 24079 27699 33471 39878 40302 41038 41217 42316 42765 43675 45118
3699 4072 16553 21492 26210 29839 30322 34139 38227 39696 40762 41156 41269 45168 45350
995 12194 12494 16542 20423 21950 23519 26215 26708 30587 38352 38840 39729 41645 43210
3963 4315 6832 11354 21042 21084 21108 25595 33109 34029 34448 35129 38018 39012 44791
164 887 2902 9021 9193 16705 17850 19241 25893 33427 37416 41024 41355 44381 45303
1367 1495 5495 14440 18026 18130 18178 21946 24057 25663 29216 31965 38107 43907 44278
10763 13722 13975 18294 20813 23028 23353 24211 37366 38805 40985 41792 42495 43259 43528
1580 12448 21464 31246 33058 34794 35760 36021 36426 37138 37478 38199 42138 42335 45207
83 112 12225 15224 18205 21345 28488 34362 37195 39660 42371 42814 44509 45201 45244
6836 7635 11644 16591 17121 19307 21456 23544 30596 37887 38141 38581 43607 44246 45097
9174 14934 17131 29762 30243 31656 33251 35498 37106 37655 41462 44002 44649 45032 45230
33 5376 13536 17068 18581 23478 32021 32074 33716 38434 39452 42166 44305 44979 45306
6013 7553 10023 19354 23126 25427 27665 30239 32699 34123 36171 38898 38972 41974 45213
41 98 3088 8522 26252 29602 30009 30138 30948 32190 32428 32498 34273 34955 45311
2000 15664 20677 20792 22980 25111 31491 37611 37981 39872 41668 42336 43602 43828 45329
23 67 97 5339 8121 8583 20647 25425 32305 37158 40968 41578 43492 44929 45273
1643 3496 5121 6546 15643 16423 20602 39950 43178 43252 43683 43992 44001 44611 45125
11093 19172 20548 24518 28289 29246 30148 34884 40403 40745 42723 43064 44448 44723 44812
12748 12799 28567 41605
1965 4087 31879
27178 33638 38344
9580 13096 45337
2672 22800 43869
28287 31407 31975
2823 5108 9945
5891 30848 42082
23 41944 44909
909 2311 45162
24998 37829 44704
35339 40087 45019
16928 26505 35256
26462 27297 37766
19656 35067 38586
6958 17172 41412
72 26012 37231
15259 16044 30243
2879 12148 34601
36173 39731 42668
20670 35816 43266
22570 27213 30404
40284 44171 45313
17765 22514 39347
24711 39892 45132
13741 34633 44535
15209 31692 45280
11189 43771 45303
28294 31110 32287
29085 39876 45246
24285 36009 45347
6882 28921 34504
9256 19267 44194
2132 21404 28687
23809 34383 44540
であるデータ処理装置又はデータ処理方法である。
867 2733 2978 8947 10214 11810 13566 15922 18838 20543 25845 29179 30055 31284 33447 34330 35081 35605 36268 39563 42331 43174
2765 6017 6394 6769 12351 13567 15195 19900 23094 27077 28626 28914 32219 33106 33662 33905 34878 37861 39749 39862 40976 42690
2343 4231 7603 7789 8396 8783 15636 16221 20591 21538 24008 25117 25663 26817 29692 30937 31472 32070 33793 39506 41763 43172
8536 10705 10960 11206 12513 15399 17108 17224 17512 20180 25288 27824 28958 30600 36792 36828 38891 39575 39581 42342 42914 42961
9 107 681 1195 9957 14055 21420 23279 26129 32044 35750 37065 37092 37165 37179 40127 40835 41476 41564 41571 42576 42910
86 1760 6842 8119 8904 12644 17603 18189 20018 22259 22654 25620 27606 27833 28002 31053 31814 31848 35573 36133 40698 41370
28 115 4354 9276 11229 11252 13848 21112 22851 29912 32453 34693 37344 37420 40926 40992 41063 41762 41856 42012 42642 43045
1589 7190 7221 7668 11805 14071 14367 14629 17087 19579 19861 25505 35471 35514 37495 38375 40286 40330 40402 41662 42638 43126
76 99 3237 5137 7982 9598 13470 14045 26680 27058 32025 32235 34601 35658 36841 38408 40517 40987 41400 41861 42691 42772
54 2470 2728 3177 3484 8267 9351 17523 18513 21119 22947 23771 26569 27308 31217 35887 36449 38529 40424 41873 42146 42706
39 80 385 1386 3397 5234 14733 16955 17656 23262 23463 25340 31638 31676 32683 37130 37641 39064 41839 42193 42495 43063
62 573 11847 14616 16033 16064 16302 18776 19434 23845 23873 25937 27741 32244 32612 33554 38445 38480 38610 40933 42386 42520
33 183 968 5477 6173 7363 10358 12597 14468 18025 23369 23387 24723 25254 28299 28989 31675 32776 35077 40241 41572 42035
36 2529 2543 3891 7108 9002 9481 16496 19796 26687 27343 33300 35495 37070 39247 40126 41758 41892 42124 42622 42738 43100
91 6897 8794 9581 12922 15711 18539 19227 21592 22906 26449 29804 30895 31538 31930 33392 38006 38294 38705 38952 39005 42120
64 76 709 1155 3162 7099 8740 9670 12678 21126 29239 29844 31248 32001 35243 36814 38008 42050 42149 42631 42705 43119
17670 40897 42359
17471 20895 32101
5458 5508 30504
17291 19627 27186
14600 41106 43103
18059 28398 40623
23776 30190 32880
4676 13593 21791
19 2832 27959
6193 21762 42854
64 16088 42982
29425 35004 42209
14338 31982 41789
21572 42838 42923
5 87 6639
5529 42541 43173
15512 31740 35801
44 86 43183
26027 26995 36455
16485 30090 34537
22276 40174 42367
10781 18230 18766
9984 42877 43027
11108 20618 41626
8496 42994 43171
10581 25803 42606
4989 14002 29020
35032 39378 41455
109 11667 42914
12471 14022 35477
31761 34625 36228
1228 6013 43110
22355 37905 40784
12740 21805 31648
4202 28639 32213
10697 31674 42998
4092 23877 34360
54 9459 16450
1 56 33675
18163 31951 42528
50 5655 35891
47 35033 40356
29097 32786 35931
9532 27004 43009
であるデータ処理装置又はデータ処理方法である。
867 2733 2978 8947 10214 11810 13566 15922 18838 20543 25845 29179 30055 31284 33447 34330 35081 35605 36268 39563 42331 43174
2765 6017 6394 6769 12351 13567 15195 19900 23094 27077 28626 28914 32219 33106 33662 33905 34878 37861 39749 39862 40976 42690
2343 4231 7603 7789 8396 8783 15636 16221 20591 21538 24008 25117 25663 26817 29692 30937 31472 32070 33793 39506 41763 43172
8536 10705 10960 11206 12513 15399 17108 17224 17512 20180 25288 27824 28958 30600 36792 36828 38891 39575 39581 42342 42914 42961
9 107 681 1195 9957 14055 21420 23279 26129 32044 35750 37065 37092 37165 37179 40127 40835 41476 41564 41571 42576 42910
86 1760 6842 8119 8904 12644 17603 18189 20018 22259 22654 25620 27606 27833 28002 31053 31814 31848 35573 36133 40698 41370
28 115 4354 9276 11229 11252 13848 21112 22851 29912 32453 34693 37344 37420 40926 40992 41063 41762 41856 42012 42642 43045
1589 7190 7221 7668 11805 14071 14367 14629 17087 19579 19861 25505 35471 35514 37495 38375 40286 40330 40402 41662 42638 43126
76 99 3237 5137 7982 9598 13470 14045 26680 27058 32025 32235 34601 35658 36841 38408 40517 40987 41400 41861 42691 42772
54 2470 2728 3177 3484 8267 9351 17523 18513 21119 22947 23771 26569 27308 31217 35887 36449 38529 40424 41873 42146 42706
39 80 385 1386 3397 5234 14733 16955 17656 23262 23463 25340 31638 31676 32683 37130 37641 39064 41839 42193 42495 43063
62 573 11847 14616 16033 16064 16302 18776 19434 23845 23873 25937 27741 32244 32612 33554 38445 38480 38610 40933 42386 42520
33 183 968 5477 6173 7363 10358 12597 14468 18025 23369 23387 24723 25254 28299 28989 31675 32776 35077 40241 41572 42035
36 2529 2543 3891 7108 9002 9481 16496 19796 26687 27343 33300 35495 37070 39247 40126 41758 41892 42124 42622 42738 43100
91 6897 8794 9581 12922 15711 18539 19227 21592 22906 26449 29804 30895 31538 31930 33392 38006 38294 38705 38952 39005 42120
64 76 709 1155 3162 7099 8740 9670 12678 21126 29239 29844 31248 32001 35243 36814 38008 42050 42149 42631 42705 43119
17670 40897 42359
17471 20895 32101
5458 5508 30504
17291 19627 27186
14600 41106 43103
18059 28398 40623
23776 30190 32880
4676 13593 21791
19 2832 27959
6193 21762 42854
64 16088 42982
29425 35004 42209
14338 31982 41789
21572 42838 42923
5 87 6639
5529 42541 43173
15512 31740 35801
44 86 43183
26027 26995 36455
16485 30090 34537
22276 40174 42367
10781 18230 18766
9984 42877 43027
11108 20618 41626
8496 42994 43171
10581 25803 42606
4989 14002 29020
35032 39378 41455
109 11667 42914
12471 14022 35477
31761 34625 36228
1228 6013 43110
22355 37905 40784
12740 21805 31648
4202 28639 32213
10697 31674 42998
4092 23877 34360
54 9459 16450
1 56 33675
18163 31951 42528
50 5655 35891
47 35033 40356
29097 32786 35931
9532 27004 43009
であるデータ処理装置又はデータ処理方法である。
3208 6587 9493 9539 12368 12501 14811 15784 17625 18654 18721 19471 19503 20079 20411 20876 21493 22083 22430 27275 29322 32758 33227 33347 33715 34472 34711 38450 39151 39709 39862 40093 40497 40912
42 1118 3086 5466 6379 8483 9051 9330 13250 13898 14055 15033 18094 21429 22652 25251 28709 29909 30233 30472 30635 31367 32603 33614 33708 36404 36530 37039 37782 38115 38307 40225 40597 40822
5939 11990 15027 15162 16503 17171 17806 17902 18031 18077 21216 22134 22660 24170 28558 29364 30003 31128 32674 33103 33361 34196 34435 34626 34991 35974 36022 37459 38170 38709 39774 39960 40571 40858
63 3871 9148 10328 12830 12912 18361 18839 20122 23126 23795 28612 30350 32251 32750 33762 33866 36188 36979 37562 37836 38536 38705 38829 39609 40219 40324 40336 40367 40638 40699 40809 40987 41019
36 70 104 3737 5028 19023 19575 19746 23840 24611 24661 26741 27749 30359 31027 31509 32621 32859 33830 34619 35281 35479 36796 37344 37555 38993 39088 39445 40276 40299 40762 40771 40835 40967
113 2313 4411 5858 9909 10426 18955 21663 21884 24105 24472 26944 27826 28574 28689 29579 30903 32352 33334 36408 36795 36805 37112 37121 38731 39080 39739 40007 40326 40356 40472 40476 40622 40778
54 84 3529 5202 9825 9900 10846 12104 13332 14493 14584 23772 24084 25786 25963 26145 28306 29514 30050 30060 33171 33416 33657 33951 34908 37715 37854 38088 38966 39148 40166 40633 40746 40939
105 8722 10244 12148 13029 16368 18186 19660 19830 21616 22256 22534 23100 23219 25473 26585 29858 32350 33305 34290 34356 34675 35297 37052 37144 37934 38201 39867 40270 40539 40781 40804 40944 40966
53 61 82 96 2665 6552 9517 15693 17214 17588 18347 19039 20679 21962 24255 25861 27117 27919 30691 36195 36379 37031 37309 37535 37793 38198 38212 38595 38808 38911 39474 39677 40135 40935
15 67 723 2962 4991 5285 11583 13398 16301 16338 20996 21510 25697 28214 29143 30539 30573 31108 32500 32506 32727 32755 36134 37226 37655 37799 39219 39626 39980 40093 40105 40628 40634 40816
18854 37884 40104 40772
35209 40379 40447 40508
3049 36078 39403 40402
19118 27981 35730 36649
20465 28570 39076 40910
24047 31275 39790 40126
31041 33526 34162 39092
1152 8976 24071 35698
3 27991 31485 40934
5245 20676 30579 38823
47 11196 38674 38894
14920 15270 16047 40928
23974 30146 39805 40911
8791 16641 25060 31681
1147 4233 34386 37802
58 5354 22265 41018
869 3078 39882 40730
1071 6322 9163 10642
7235 32596 35540 37487
26910 35537 40830 41035
81 11905 16179 19558
29 41 5161 12173
3043 5574 9993 26058
875 36935 39423 40956
3362 19166 20017 39729
12893 16403 33880 37115
9980 27100 28525 36786
3218 12776 40651 40703
7669 25783 32781 34504
25951 34595 39049 40597
11271 35112 35290 40600
5330 38324 40325 40986
58 24777 40560 40835
23895 25427 33552 37472
2811 4731 11601 39912
109 39021 40611 40754
79 15387 30999 40978
31162 34975 38844 39784
34891 37007 39433 40102
42 9072 21526 22610
20243 20499 24418 29056
7951 26469 29729 40956
6 10833 13188 15714
7910 20652 40574 40874
14586 24839 37804 40722
1103 11381 21050 30084
10 9032 20123 28528
19477 29966 37702 37766
131 31352 39069 40971
34 7368 17799 27467
16767 27584 32869 34769
31515 34543 36230 40752
15098 25451 26402 27629
149 10388 24558 40709
6997 7288 23995 29893
346 12245 13843 40402
であるデータ処理装置又はデータ処理方法である。
3208 6587 9493 9539 12368 12501 14811 15784 17625 18654 18721 19471 19503 20079 20411 20876 21493 22083 22430 27275 29322 32758 33227 33347 33715 34472 34711 38450 39151 39709 39862 40093 40497 40912
42 1118 3086 5466 6379 8483 9051 9330 13250 13898 14055 15033 18094 21429 22652 25251 28709 29909 30233 30472 30635 31367 32603 33614 33708 36404 36530 37039 37782 38115 38307 40225 40597 40822
5939 11990 15027 15162 16503 17171 17806 17902 18031 18077 21216 22134 22660 24170 28558 29364 30003 31128 32674 33103 33361 34196 34435 34626 34991 35974 36022 37459 38170 38709 39774 39960 40571 40858
63 3871 9148 10328 12830 12912 18361 18839 20122 23126 23795 28612 30350 32251 32750 33762 33866 36188 36979 37562 37836 38536 38705 38829 39609 40219 40324 40336 40367 40638 40699 40809 40987 41019
36 70 104 3737 5028 19023 19575 19746 23840 24611 24661 26741 27749 30359 31027 31509 32621 32859 33830 34619 35281 35479 36796 37344 37555 38993 39088 39445 40276 40299 40762 40771 40835 40967
113 2313 4411 5858 9909 10426 18955 21663 21884 24105 24472 26944 27826 28574 28689 29579 30903 32352 33334 36408 36795 36805 37112 37121 38731 39080 39739 40007 40326 40356 40472 40476 40622 40778
54 84 3529 5202 9825 9900 10846 12104 13332 14493 14584 23772 24084 25786 25963 26145 28306 29514 30050 30060 33171 33416 33657 33951 34908 37715 37854 38088 38966 39148 40166 40633 40746 40939
105 8722 10244 12148 13029 16368 18186 19660 19830 21616 22256 22534 23100 23219 25473 26585 29858 32350 33305 34290 34356 34675 35297 37052 37144 37934 38201 39867 40270 40539 40781 40804 40944 40966
53 61 82 96 2665 6552 9517 15693 17214 17588 18347 19039 20679 21962 24255 25861 27117 27919 30691 36195 36379 37031 37309 37535 37793 38198 38212 38595 38808 38911 39474 39677 40135 40935
15 67 723 2962 4991 5285 11583 13398 16301 16338 20996 21510 25697 28214 29143 30539 30573 31108 32500 32506 32727 32755 36134 37226 37655 37799 39219 39626 39980 40093 40105 40628 40634 40816
18854 37884 40104 40772
35209 40379 40447 40508
3049 36078 39403 40402
19118 27981 35730 36649
20465 28570 39076 40910
24047 31275 39790 40126
31041 33526 34162 39092
1152 8976 24071 35698
3 27991 31485 40934
5245 20676 30579 38823
47 11196 38674 38894
14920 15270 16047 40928
23974 30146 39805 40911
8791 16641 25060 31681
1147 4233 34386 37802
58 5354 22265 41018
869 3078 39882 40730
1071 6322 9163 10642
7235 32596 35540 37487
26910 35537 40830 41035
81 11905 16179 19558
29 41 5161 12173
3043 5574 9993 26058
875 36935 39423 40956
3362 19166 20017 39729
12893 16403 33880 37115
9980 27100 28525 36786
3218 12776 40651 40703
7669 25783 32781 34504
25951 34595 39049 40597
11271 35112 35290 40600
5330 38324 40325 40986
58 24777 40560 40835
23895 25427 33552 37472
2811 4731 11601 39912
109 39021 40611 40754
79 15387 30999 40978
31162 34975 38844 39784
34891 37007 39433 40102
42 9072 21526 22610
20243 20499 24418 29056
7951 26469 29729 40956
6 10833 13188 15714
7910 20652 40574 40874
14586 24839 37804 40722
1103 11381 21050 30084
10 9032 20123 28528
19477 29966 37702 37766
131 31352 39069 40971
34 7368 17799 27467
16767 27584 32869 34769
31515 34543 36230 40752
15098 25451 26402 27629
149 10388 24558 40709
6997 7288 23995 29893
346 12245 13843 40402
であるデータ処理装置又はデータ処理方法である。
548 9528 12205 12770 22023 22082 25884 27421 33215 36046 43580 43953 47539
919 2623 5098 5514 5645 6348 9666 13795 14555 43224 44048 44948 47964
995 7270 17753 21272 29228 29916 31634 34055 35205 37499 37777 47490 49301
645 3803 8836 9470 11054 20253 29417 31243 31990 36468 38715 39932 43045
14572 18646 21100 26617 32033 32410 37195 38586 43833 44577 45584 46453 49515
6004 16982 17829 24616 28056 29646 32944 39051 42517 47086 48585 48772 49247
1306 1447 4898 7781 18587 25724 26672 35062 35202 37080 39781 46111 47595
92 3231 13043 22258 24198 28923 33303 37846 43610 44857 47322 48914 49291
298 12557 13469 14451 21917 23539 26310 29839 37050 38507 41377 46971 48155
12582 13044 21039 30600 34202 34947 37120 39108 39203 43449 46941 48542 49354
871 12218 12680 14152 17171 25797 29021 37783 43728 47519 48794 48898 48980
35 4623 13422 15881 16692 17463 23675 28063 31248 41997 44246 47992 48339
7150 13015 17950 18214 20659 23579 25714 28328 32658 39717 39995 43322 45884
82 11054 11845 19085 24174 26694 41530 45954 46508 46892 48832 49097 49420
5789 13839 18512 25596 26478 26736 29431 32349 33384 41765 46661 49206 49543
13805 17786 17798 29653 30310 34870 40176 40391 43227 45292 46423 46855 49454
12433 27119 34645
32065 34998 44021
5158 16546 34359
44 33285 39929
39032 39296 40317
9885 45251 47640
14383 43446 44478
31280 39945 48472
27961 38221 48391
2927 37404 38716
19461 42462 46162
24909 25915 40636
11029 35538 45381
26880 34179 48775
192 6032 26853
4563 14952 24256
10003 30853 43811
749 36334 41363
100 17006 24982
9507 20228 31214
41691 44310 47083
24070 30411 46982
2727 28251 49289
16689 21167 32590
40813 41198 46175
8336 32714 43075
になっている。
100 3433 4111 9089 13360 24012 26305 30252 31430 31769 34689 34917 36091 40873 41983 42689 43835 44318 47109
3 48 124 2240 7029 21694 24565 29302 39777 42706 43631 43784 46033 47064 47079 47141 47239 47439 47479
2 5675 7056 12715 24128 26596 30571 38210 38586 41138 42272 43336 43444 43917 45812 46840 47245 47286 47510
2103 4285 10068 10702 12693 17619 18711 21309 22191 22999 37432 45646 46275 46338 46777 46860 46963 47432 47472
6827 8209 8606 10412 15670 19469 22205 22215 25425 29565 34843 34985 37686 39277 44625 45016 45623 47069 47250
58 114 1751 7913 24642 26995 40734 41486 43133 44804 45490 45725 46122 46412 47019 47080 47103 47495 47506
96 5952 9078 9786 17738 17888 17986 31657 34430 34763 35450 37276 42395 43223 43283 44261 45648 47014 47276
106 5405 9614 20500 21633 23242 28875 37238 38854 41778 42292 43883 45909 46558 46826 47292 47353 47436 47504
32 11217 12153 26818 27616 38783 39976 40842 43581 43703 44287 44435 44576 44774 46080 46098 46801 46813 47168
65 102 111 3879 11224 11772 23623 27306 28726 34663 34873 36288 39196 42003 45279 45629 46836 47021 47419
77 131 11275 18964 20418 22364 22635 27727 28689 29720 29781 32110 41597 42046 43952 44786 46416 46808 47200
87 8637 10829 23737 24117 26486 29603 34389 35509 35872 38948 40643 42698 45949 46159 46660 47041 47165 47220
2 58 3110 7539 8886 10422 11597 13385 27870 35895 38120 43546 44948 46272 46369 46596 47199 47317 47351
78 16119 27780 32231 38973 39088 40118 40231 43170 44131 44203 44878 45905 46250 47011 47113 47195 47303 47427
2960 6685 8830 11107 11843 12811 30030 36574 36850 36920 37706 38025 41007 43554 44109 44643 45874 46469 46565
125 366 10175 29860
45 17503 44634 45789
6272 19614 34408 37248
14785 41017 44274 46858
19935 22960 44726 44919
15247 17925 33947 37392
34631 39148 43287 45443
8544 26457 30996 38672
11725 31442 42167 45461
22357 41743 46702 47285
13786 26288 41358 43082
7306 21352 43298 47359
77 5188 20988 45572
10334 23790 40878
9304 29379 47450
22048 44762 47300
8529 8825 47443
40831 41328 46415
26715 43038 46498
26925 30797 43181
32434 45624 47460
17989 31811 47215
5624 25501 33016
5024 9037 33642
93 7329 46908
20303 42578 46780
16137 26869 42360
112 3049 46527
23615 29931 47360
23050 24267 44687
60 40754 47114
30217 36283 37445
127 27308 38345
になっている。
339 4777 5366 7623 13034 13260 15107 17772 20338 21178 25914 27663 29948 37489 41021
3871 5812 9795 23437 24079 27699 33471 39878 40302 41038 41217 42316 42765 43675 45118
3699 4072 16553 21492 26210 29839 30322 34139 38227 39696 40762 41156 41269 45168 45350
995 12194 12494 16542 20423 21950 23519 26215 26708 30587 38352 38840 39729 41645 43210
3963 4315 6832 11354 21042 21084 21108 25595 33109 34029 34448 35129 38018 39012 44791
164 887 2902 9021 9193 16705 17850 19241 25893 33427 37416 41024 41355 44381 45303
1367 1495 5495 14440 18026 18130 18178 21946 24057 25663 29216 31965 38107 43907 44278
10763 13722 13975 18294 20813 23028 23353 24211 37366 38805 40985 41792 42495 43259 43528
1580 12448 21464 31246 33058 34794 35760 36021 36426 37138 37478 38199 42138 42335 45207
83 112 12225 15224 18205 21345 28488 34362 37195 39660 42371 42814 44509 45201 45244
6836 7635 11644 16591 17121 19307 21456 23544 30596 37887 38141 38581 43607 44246 45097
9174 14934 17131 29762 30243 31656 33251 35498 37106 37655 41462 44002 44649 45032 45230
33 5376 13536 17068 18581 23478 32021 32074 33716 38434 39452 42166 44305 44979 45306
6013 7553 10023 19354 23126 25427 27665 30239 32699 34123 36171 38898 38972 41974 45213
41 98 3088 8522 26252 29602 30009 30138 30948 32190 32428 32498 34273 34955 45311
2000 15664 20677 20792 22980 25111 31491 37611 37981 39872 41668 42336 43602 43828 45329
23 67 97 5339 8121 8583 20647 25425 32305 37158 40968 41578 43492 44929 45273
1643 3496 5121 6546 15643 16423 20602 39950 43178 43252 43683 43992 44001 44611 45125
11093 19172 20548 24518 28289 29246 30148 34884 40403 40745 42723 43064 44448 44723 44812
12748 12799 28567 41605
1965 4087 31879
27178 33638 38344
9580 13096 45337
2672 22800 43869
28287 31407 31975
2823 5108 9945
5891 30848 42082
23 41944 44909
909 2311 45162
24998 37829 44704
35339 40087 45019
16928 26505 35256
26462 27297 37766
19656 35067 38586
6958 17172 41412
72 26012 37231
15259 16044 30243
2879 12148 34601
36173 39731 42668
20670 35816 43266
22570 27213 30404
40284 44171 45313
17765 22514 39347
24711 39892 45132
13741 34633 44535
15209 31692 45280
11189 43771 45303
28294 31110 32287
29085 39876 45246
24285 36009 45347
6882 28921 34504
9256 19267 44194
2132 21404 28687
23809 34383 44540
になっている。
867 2733 2978 8947 10214 11810 13566 15922 18838 20543 25845 29179 30055 31284 33447 34330 35081 35605 36268 39563 42331 43174
2765 6017 6394 6769 12351 13567 15195 19900 23094 27077 28626 28914 32219 33106 33662 33905 34878 37861 39749 39862 40976 42690
2343 4231 7603 7789 8396 8783 15636 16221 20591 21538 24008 25117 25663 26817 29692 30937 31472 32070 33793 39506 41763 43172
8536 10705 10960 11206 12513 15399 17108 17224 17512 20180 25288 27824 28958 30600 36792 36828 38891 39575 39581 42342 42914 42961
9 107 681 1195 9957 14055 21420 23279 26129 32044 35750 37065 37092 37165 37179 40127 40835 41476 41564 41571 42576 42910
86 1760 6842 8119 8904 12644 17603 18189 20018 22259 22654 25620 27606 27833 28002 31053 31814 31848 35573 36133 40698 41370
28 115 4354 9276 11229 11252 13848 21112 22851 29912 32453 34693 37344 37420 40926 40992 41063 41762 41856 42012 42642 43045
1589 7190 7221 7668 11805 14071 14367 14629 17087 19579 19861 25505 35471 35514 37495 38375 40286 40330 40402 41662 42638 43126
76 99 3237 5137 7982 9598 13470 14045 26680 27058 32025 32235 34601 35658 36841 38408 40517 40987 41400 41861 42691 42772
54 2470 2728 3177 3484 8267 9351 17523 18513 21119 22947 23771 26569 27308 31217 35887 36449 38529 40424 41873 42146 42706
39 80 385 1386 3397 5234 14733 16955 17656 23262 23463 25340 31638 31676 32683 37130 37641 39064 41839 42193 42495 43063
62 573 11847 14616 16033 16064 16302 18776 19434 23845 23873 25937 27741 32244 32612 33554 38445 38480 38610 40933 42386 42520
33 183 968 5477 6173 7363 10358 12597 14468 18025 23369 23387 24723 25254 28299 28989 31675 32776 35077 40241 41572 42035
36 2529 2543 3891 7108 9002 9481 16496 19796 26687 27343 33300 35495 37070 39247 40126 41758 41892 42124 42622 42738 43100
91 6897 8794 9581 12922 15711 18539 19227 21592 22906 26449 29804 30895 31538 31930 33392 38006 38294 38705 38952 39005 42120
64 76 709 1155 3162 7099 8740 9670 12678 21126 29239 29844 31248 32001 35243 36814 38008 42050 42149 42631 42705 43119
17670 40897 42359
17471 20895 32101
5458 5508 30504
17291 19627 27186
14600 41106 43103
18059 28398 40623
23776 30190 32880
4676 13593 21791
19 2832 27959
6193 21762 42854
64 16088 42982
29425 35004 42209
14338 31982 41789
21572 42838 42923
5 87 6639
5529 42541 43173
15512 31740 35801
44 86 43183
26027 26995 36455
16485 30090 34537
22276 40174 42367
10781 18230 18766
9984 42877 43027
11108 20618 41626
8496 42994 43171
10581 25803 42606
4989 14002 29020
35032 39378 41455
109 11667 42914
12471 14022 35477
31761 34625 36228
1228 6013 43110
22355 37905 40784
12740 21805 31648
4202 28639 32213
10697 31674 42998
4092 23877 34360
54 9459 16450
1 56 33675
18163 31951 42528
50 5655 35891
47 35033 40356
29097 32786 35931
9532 27004 43009
になっている。
3208 6587 9493 9539 12368 12501 14811 15784 17625 18654 18721 19471 19503 20079 20411 20876 21493 22083 22430 27275 29322 32758 33227 33347 33715 34472 34711 38450 39151 39709 39862 40093 40497 40912
42 1118 3086 5466 6379 8483 9051 9330 13250 13898 14055 15033 18094 21429 22652 25251 28709 29909 30233 30472 30635 31367 32603 33614 33708 36404 36530 37039 37782 38115 38307 40225 40597 40822
5939 11990 15027 15162 16503 17171 17806 17902 18031 18077 21216 22134 22660 24170 28558 29364 30003 31128 32674 33103 33361 34196 34435 34626 34991 35974 36022 37459 38170 38709 39774 39960 40571 40858
63 3871 9148 10328 12830 12912 18361 18839 20122 23126 23795 28612 30350 32251 32750 33762 33866 36188 36979 37562 37836 38536 38705 38829 39609 40219 40324 40336 40367 40638 40699 40809 40987 41019
36 70 104 3737 5028 19023 19575 19746 23840 24611 24661 26741 27749 30359 31027 31509 32621 32859 33830 34619 35281 35479 36796 37344 37555 38993 39088 39445 40276 40299 40762 40771 40835 40967
113 2313 4411 5858 9909 10426 18955 21663 21884 24105 24472 26944 27826 28574 28689 29579 30903 32352 33334 36408 36795 36805 37112 37121 38731 39080 39739 40007 40326 40356 40472 40476 40622 40778
54 84 3529 5202 9825 9900 10846 12104 13332 14493 14584 23772 24084 25786 25963 26145 28306 29514 30050 30060 33171 33416 33657 33951 34908 37715 37854 38088 38966 39148 40166 40633 40746 40939
105 8722 10244 12148 13029 16368 18186 19660 19830 21616 22256 22534 23100 23219 25473 26585 29858 32350 33305 34290 34356 34675 35297 37052 37144 37934 38201 39867 40270 40539 40781 40804 40944 40966
53 61 82 96 2665 6552 9517 15693 17214 17588 18347 19039 20679 21962 24255 25861 27117 27919 30691 36195 36379 37031 37309 37535 37793 38198 38212 38595 38808 38911 39474 39677 40135 40935
15 67 723 2962 4991 5285 11583 13398 16301 16338 20996 21510 25697 28214 29143 30539 30573 31108 32500 32506 32727 32755 36134 37226 37655 37799 39219 39626 39980 40093 40105 40628 40634 40816
18854 37884 40104 40772
35209 40379 40447 40508
3049 36078 39403 40402
19118 27981 35730 36649
20465 28570 39076 40910
24047 31275 39790 40126
31041 33526 34162 39092
1152 8976 24071 35698
3 27991 31485 40934
5245 20676 30579 38823
47 11196 38674 38894
14920 15270 16047 40928
23974 30146 39805 40911
8791 16641 25060 31681
1147 4233 34386 37802
58 5354 22265 41018
869 3078 39882 40730
1071 6322 9163 10642
7235 32596 35540 37487
26910 35537 40830 41035
81 11905 16179 19558
29 41 5161 12173
3043 5574 9993 26058
875 36935 39423 40956
3362 19166 20017 39729
12893 16403 33880 37115
9980 27100 28525 36786
3218 12776 40651 40703
7669 25783 32781 34504
25951 34595 39049 40597
11271 35112 35290 40600
5330 38324 40325 40986
58 24777 40560 40835
23895 25427 33552 37472
2811 4731 11601 39912
109 39021 40611 40754
79 15387 30999 40978
31162 34975 38844 39784
34891 37007 39433 40102
42 9072 21526 22610
20243 20499 24418 29056
7951 26469 29729 40956
6 10833 13188 15714
7910 20652 40574 40874
14586 24839 37804 40722
1103 11381 21050 30084
10 9032 20123 28528
19477 29966 37702 37766
131 31352 39069 40971
34 7368 17799 27467
16767 27584 32869 34769
31515 34543 36230 40752
15098 25451 26402 27629
149 10388 24558 40709
6997 7288 23995 29893
346 12245 13843 40402
になっている。
・・・(8)
・・・(9)
・・・(10)
・・・(11)
・・・(12)
Claims (54)
- LDPC(Low Density Parity Check)符号の検査行列に基づき、情報ビットを、符号長が64800ビットで符号化率が7/30のLDPC符号に符号化する符号化部を備え、
前記LDPC符号は、情報ビットとパリティビットを含み、
前記検査行列は、前記情報ビットに対応する情報行列部と前記パリティビットに対応するパリティ行列部とを含み、
前記情報行列部は、検査行列初期値テーブルによって表され、
前記検査行列初期値テーブルは、前記情報行列部の1の要素の位置を360列ごとに表すテーブルであって、
548 9528 12205 12770 22023 22082 25884 27421 33215 36046 43580 43953 47539
919 2623 5098 5514 5645 6348 9666 13795 14555 43224 44048 44948 47964
995 7270 17753 21272 29228 29916 31634 34055 35205 37499 37777 47490 49301
645 3803 8836 9470 11054 20253 29417 31243 31990 36468 38715 39932 43045
14572 18646 21100 26617 32033 32410 37195 38586 43833 44577 45584 46453 49515
6004 16982 17829 24616 28056 29646 32944 39051 42517 47086 48585 48772 49247
1306 1447 4898 7781 18587 25724 26672 35062 35202 37080 39781 46111 47595
92 3231 13043 22258 24198 28923 33303 37846 43610 44857 47322 48914 49291
298 12557 13469 14451 21917 23539 26310 29839 37050 38507 41377 46971 48155
12582 13044 21039 30600 34202 34947 37120 39108 39203 43449 46941 48542 49354
871 12218 12680 14152 17171 25797 29021 37783 43728 47519 48794 48898 48980
35 4623 13422 15881 16692 17463 23675 28063 31248 41997 44246 47992 48339
7150 13015 17950 18214 20659 23579 25714 28328 32658 39717 39995 43322 45884
82 11054 11845 19085 24174 26694 41530 45954 46508 46892 48832 49097 49420
5789 13839 18512 25596 26478 26736 29431 32349 33384 41765 46661 49206 49543
13805 17786 17798 29653 30310 34870 40176 40391 43227 45292 46423 46855 49454
12433 27119 34645
32065 34998 44021
5158 16546 34359
44 33285 39929
39032 39296 40317
9885 45251 47640
14383 43446 44478
31280 39945 48472
27961 38221 48391
2927 37404 38716
19461 42462 46162
24909 25915 40636
11029 35538 45381
26880 34179 48775
192 6032 26853
4563 14952 24256
10003 30853 43811
749 36334 41363
100 17006 24982
9507 20228 31214
41691 44310 47083
24070 30411 46982
2727 28251 49289
16689 21167 32590
40813 41198 46175
8336 32714 43075
である
データ処理装置。 - 前記検査行列初期値テーブルの行をiと表すとともに、前記LDPC符号のパリティ長をMと表すとき、
前記検査行列の2+360×(i-1)列目は、前記検査行列初期値テーブルで1の要素の位置が表される前記検査行列の1+360×(i-1)列目を、q=M/360だけ下方向にサイクリックシフトした列である
請求項1に記載のデータ処理装置。 - 前記検査行列の1+360×(i-1)列については、
前記検査行列初期値テーブルのi行目が、前記検査行列の1+360×(i-1)列目の1の要素の行番号を表し、
前記検査行列の1+360×(i-1)列目以外の列である2+360×(i-1)列目から360×i列目までの各列については、
前記検査行列初期値テーブルのi行目のj列目の数値をhi,jと表すとともに、前記検査行列Hのw列目の、j個目の1の要素の行番号をHw-jと表すとき、
前記検査行列の1+360×(i-1)列目以外の列であるw列目の、1の要素の行番号Hw-jは、式Hw-j=mod{hi,j+mod((w-1),360)×M/360,M)で表される
請求項2に記載のデータ処理装置。 - 前記qは、138である
請求項2に記載のデータ処理装置。 - 前記LDPC符号の符号ビットのパリティビットのみをインターリーブするパリティインターリーブ部をさらに備える
請求項1に記載のデータ処理装置。 - 前記LDPC符号の符号ビットを、カラム方向にずらして記憶することによりカラムツイストインターリーブを行うカラムツイストインターリーブ部をさらに備える
請求項1に記載のデータ処理装置。 - 前記LDPC符号の符号ビットを、所定のディジタル変調方式で定める所定数の信号点のうちのいずれかに対応するシンボルのシンボルビットに入れ替える入れ替え部をさらに備える
請求項1に記載のデータ処理装置。 - 前記入れ替え部は、カラム方向に記憶されてロウ方向に読み出される前記符号ビットを入れ替える
請求項7に記載のデータ処理装置。 - 前記検査行列は、サイクル4が存在しない検査行列である
請求項1に記載のデータ処理装置。 - 前記検査行列は、マルチエッジタイプのデンシティエボリューションによって検出される、BERが落ち始めるEb/N0である性能閾値が所定値以下になるLDPC符号のアンサンブルに属するLDPC符号の検査行列である
請求項1に記載のデータ処理装置。 - LDPC(Low Density Parity Check)符号の検査行列に基づき、情報ビットを、符号長が64800ビットで符号化率が7/30のLDPC符号に符号化する符号化ステップを備え、
前記LDPC符号は、情報ビットとパリティビットを含み、
前記検査行列は、前記情報ビットに対応する情報行列部と前記パリティビットに対応するパリティ行列部とを含み、
前記情報行列部は、検査行列初期値テーブルによって表され、
前記検査行列初期値テーブルは、前記情報行列部の1の要素の位置を360列ごとに表すテーブルであって、
548 9528 12205 12770 22023 22082 25884 27421 33215 36046 43580 43953 47539
919 2623 5098 5514 5645 6348 9666 13795 14555 43224 44048 44948 47964
995 7270 17753 21272 29228 29916 31634 34055 35205 37499 37777 47490 49301
645 3803 8836 9470 11054 20253 29417 31243 31990 36468 38715 39932 43045
14572 18646 21100 26617 32033 32410 37195 38586 43833 44577 45584 46453 49515
6004 16982 17829 24616 28056 29646 32944 39051 42517 47086 48585 48772 49247
1306 1447 4898 7781 18587 25724 26672 35062 35202 37080 39781 46111 47595
92 3231 13043 22258 24198 28923 33303 37846 43610 44857 47322 48914 49291
298 12557 13469 14451 21917 23539 26310 29839 37050 38507 41377 46971 48155
12582 13044 21039 30600 34202 34947 37120 39108 39203 43449 46941 48542 49354
871 12218 12680 14152 17171 25797 29021 37783 43728 47519 48794 48898 48980
35 4623 13422 15881 16692 17463 23675 28063 31248 41997 44246 47992 48339
7150 13015 17950 18214 20659 23579 25714 28328 32658 39717 39995 43322 45884
82 11054 11845 19085 24174 26694 41530 45954 46508 46892 48832 49097 49420
5789 13839 18512 25596 26478 26736 29431 32349 33384 41765 46661 49206 49543
13805 17786 17798 29653 30310 34870 40176 40391 43227 45292 46423 46855 49454
12433 27119 34645
32065 34998 44021
5158 16546 34359
44 33285 39929
39032 39296 40317
9885 45251 47640
14383 43446 44478
31280 39945 48472
27961 38221 48391
2927 37404 38716
19461 42462 46162
24909 25915 40636
11029 35538 45381
26880 34179 48775
192 6032 26853
4563 14952 24256
10003 30853 43811
749 36334 41363
100 17006 24982
9507 20228 31214
41691 44310 47083
24070 30411 46982
2727 28251 49289
16689 21167 32590
40813 41198 46175
8336 32714 43075
である
データ処理方法。 - 前記検査行列初期値テーブルの行をiと表すとともに、前記LDPC符号のパリティ長をMと表すとき、
前記検査行列の2+360×(i-1)列目は、前記検査行列初期値テーブルで1の要素の位置が表される前記検査行列の1+360×(i-1)列目を、q=M/360だけ下方向にサイクリックシフトした列である
請求項11に記載のデータ処理方法。 - 前記検査行列の1+360×(i-1)列については、
前記検査行列初期値テーブルのi行目が、前記検査行列の1+360×(i-1)列目の1の要素の行番号を表し、
前記検査行列の1+360×(i-1)列目以外の列である2+360×(i-1)列目から360×i列目までの各列については、
前記検査行列初期値テーブルのi行目のj列目の数値をhi,jと表すとともに、前記検査行列Hのw列目の、j個目の1の要素の行番号をHw-jと表すとき、
前記検査行列の1+360×(i-1)列目以外の列であるw列目の、1の要素の行番号Hw-jは、式Hw-j=mod{hi,j+mod((w-1),360)×M/360,M)で表される
請求項12に記載のデータ処理方法。 - 前記qは、138である
請求項12に記載のデータ処理方法。 - 前記LDPC符号の符号ビットのパリティビットのみをインターリーブする
請求項11に記載のデータ処理方法。 - 前記LDPC符号の符号ビットを、カラム方向にずらして記憶することによりカラムツイストインターリーブを行う
請求項11に記載のデータ処理方法。 - 前記LDPC符号の符号ビットを、所定のディジタル変調方式で定める所定数の信号点のうちのいずれかに対応するシンボルのシンボルビットに入れ替える
請求項11に記載のデータ処理方法。 - 前記符号ビットの入れ替えでは、カラム方向に記憶されてロウ方向に読み出される前記符号ビットを入れ替える
請求項17に記載のデータ処理方法。 - 前記検査行列は、サイクル4が存在しない検査行列である
請求項11に記載のデータ処理方法。 - 前記検査行列は、マルチエッジタイプのデンシティエボリューションによって検出される、BERが落ち始めるEb/N0である性能閾値が所定値以下になるLDPC符号のアンサンブルに属するLDPC符号の検査行列である
請求項11に記載のデータ処理方法。 - LDPC(Low Density Parity Check)符号の検査行列に基づき、符号長が64800ビットで符号化率が7/30のLDPC符号を復号する復号部を備え、
前記LDPC符号は、情報ビットとパリティビットを含み、
前記検査行列は、前記情報ビットに対応する情報行列部と前記パリティビットに対応するパリティ行列部とを含み、
前記情報行列部は、検査行列初期値テーブルによって表され、
前記検査行列初期値テーブルは、前記情報行列部の1の要素の位置を360列ごとに表すテーブルであって、
548 9528 12205 12770 22023 22082 25884 27421 33215 36046 43580 43953 47539
919 2623 5098 5514 5645 6348 9666 13795 14555 43224 44048 44948 47964
995 7270 17753 21272 29228 29916 31634 34055 35205 37499 37777 47490 49301
645 3803 8836 9470 11054 20253 29417 31243 31990 36468 38715 39932 43045
14572 18646 21100 26617 32033 32410 37195 38586 43833 44577 45584 46453 49515
6004 16982 17829 24616 28056 29646 32944 39051 42517 47086 48585 48772 49247
1306 1447 4898 7781 18587 25724 26672 35062 35202 37080 39781 46111 47595
92 3231 13043 22258 24198 28923 33303 37846 43610 44857 47322 48914 49291
298 12557 13469 14451 21917 23539 26310 29839 37050 38507 41377 46971 48155
12582 13044 21039 30600 34202 34947 37120 39108 39203 43449 46941 48542 49354
871 12218 12680 14152 17171 25797 29021 37783 43728 47519 48794 48898 48980
35 4623 13422 15881 16692 17463 23675 28063 31248 41997 44246 47992 48339
7150 13015 17950 18214 20659 23579 25714 28328 32658 39717 39995 43322 45884
82 11054 11845 19085 24174 26694 41530 45954 46508 46892 48832 49097 49420
5789 13839 18512 25596 26478 26736 29431 32349 33384 41765 46661 49206 49543
13805 17786 17798 29653 30310 34870 40176 40391 43227 45292 46423 46855 49454
12433 27119 34645
32065 34998 44021
5158 16546 34359
44 33285 39929
39032 39296 40317
9885 45251 47640
14383 43446 44478
31280 39945 48472
27961 38221 48391
2927 37404 38716
19461 42462 46162
24909 25915 40636
11029 35538 45381
26880 34179 48775
192 6032 26853
4563 14952 24256
10003 30853 43811
749 36334 41363
100 17006 24982
9507 20228 31214
41691 44310 47083
24070 30411 46982
2727 28251 49289
16689 21167 32590
40813 41198 46175
8336 32714 43075
である
データ処理装置。 - 前記検査行列初期値テーブルの行をiと表すとともに、前記LDPC符号のパリティ長をMと表すとき、
前記検査行列の2+360×(i-1)列目は、前記検査行列初期値テーブルで1の要素の位置が表される前記検査行列の1+360×(i-1)列目を、q=M/360だけ下方向にサイクリックシフトした列である
請求項21に記載のデータ処理装置。 - 前記検査行列の1+360×(i-1)列については、
前記検査行列初期値テーブルのi行目が、前記検査行列の1+360×(i-1)列目の1の要素の行番号を表し、
前記検査行列の1+360×(i-1)列目以外の列である2+360×(i-1)列目から360×i列目までの各列については、
前記検査行列初期値テーブルのi行目のj列目の数値をhi,jと表すとともに、前記検査行列Hのw列目の、j個目の1の要素の行番号をHw-jと表すとき、
前記検査行列の1+360×(i-1)列目以外の列であるw列目の、1の要素の行番号Hw-jは、式Hw-j=mod{hi,j+mod((w-1),360)×M/360,M)で表される
請求項22に記載のデータ処理装置。 - 前記qは、138である
請求項22に記載のデータ処理装置。 - 前記LDPC符号の符号ビットを、カラム方向にずらして記憶することによりカラムツイストインターリーブが行われている場合に、前記LDPC符号の符号ビットを元の並びに戻すカラムツイストデインターリーブを行うカラムツイストデインターリーブ部をさらに備える
請求項21に記載のデータ処理装置。 - 前記LDPC符号の符号ビットを、所定のディジタル変調方式で定める所定数の信号点のうちのいずれかに対応するシンボルのシンボルビットに入れ替える入れ替え処理が行われている場合に、前記シンボルビットとして位置が入れ替えられた前記符号ビットを、元の位置に戻す逆入れ替え処理を行う逆入れ替え部をさらに備える
請求項21に記載のデータ処理装置。 - 前記逆入れ替え部は、ロウ方向に記憶されてカラム方向に読み出される前記符号ビットを元の位置に戻す逆入れ替え処理を行う
請求項26に記載のデータ処理装置。 - 前記検査行列は、サイクル4が存在しない検査行列である
請求項21に記載のデータ処理装置。 - 前記検査行列は、マルチエッジタイプのデンシティエボリューションによって検出される、BERが落ち始めるEb/N0である性能閾値が所定値以下になるLDPC符号のアンサンブルに属するLDPC符号の検査行列である
請求項21に記載のデータ処理装置。 - LDPC(Low Density Parity Check)符号の検査行列に基づき、符号長が64800ビットで符号化率が7/30のLDPC符号を復号する復号ステップを備え、
前記LDPC符号は、情報ビットとパリティビットを含み、
前記検査行列は、前記情報ビットに対応する情報行列部と前記パリティビットに対応するパリティ行列部とを含み、
前記情報行列部は、検査行列初期値テーブルによって表され、
前記検査行列初期値テーブルは、前記情報行列部の1の要素の位置を360列ごとに表すテーブルであって、
548 9528 12205 12770 22023 22082 25884 27421 33215 36046 43580 43953 47539
919 2623 5098 5514 5645 6348 9666 13795 14555 43224 44048 44948 47964
995 7270 17753 21272 29228 29916 31634 34055 35205 37499 37777 47490 49301
645 3803 8836 9470 11054 20253 29417 31243 31990 36468 38715 39932 43045
14572 18646 21100 26617 32033 32410 37195 38586 43833 44577 45584 46453 49515
6004 16982 17829 24616 28056 29646 32944 39051 42517 47086 48585 48772 49247
1306 1447 4898 7781 18587 25724 26672 35062 35202 37080 39781 46111 47595
92 3231 13043 22258 24198 28923 33303 37846 43610 44857 47322 48914 49291
298 12557 13469 14451 21917 23539 26310 29839 37050 38507 41377 46971 48155
12582 13044 21039 30600 34202 34947 37120 39108 39203 43449 46941 48542 49354
871 12218 12680 14152 17171 25797 29021 37783 43728 47519 48794 48898 48980
35 4623 13422 15881 16692 17463 23675 28063 31248 41997 44246 47992 48339
7150 13015 17950 18214 20659 23579 25714 28328 32658 39717 39995 43322 45884
82 11054 11845 19085 24174 26694 41530 45954 46508 46892 48832 49097 49420
5789 13839 18512 25596 26478 26736 29431 32349 33384 41765 46661 49206 49543
13805 17786 17798 29653 30310 34870 40176 40391 43227 45292 46423 46855 49454
12433 27119 34645
32065 34998 44021
5158 16546 34359
44 33285 39929
39032 39296 40317
9885 45251 47640
14383 43446 44478
31280 39945 48472
27961 38221 48391
2927 37404 38716
19461 42462 46162
24909 25915 40636
11029 35538 45381
26880 34179 48775
192 6032 26853
4563 14952 24256
10003 30853 43811
749 36334 41363
100 17006 24982
9507 20228 31214
41691 44310 47083
24070 30411 46982
2727 28251 49289
16689 21167 32590
40813 41198 46175
8336 32714 43075
である
データ処理方法。 - 前記検査行列初期値テーブルの行をiと表すとともに、前記LDPC符号のパリティ長をMと表すとき、
前記検査行列の2+360×(i-1)列目は、前記検査行列初期値テーブルで1の要素の位置が表される前記検査行列の1+360×(i-1)列目を、q=M/360だけ下方向にサイクリックシフトした列である
請求項30に記載のデータ処理方法。 - 前記検査行列の1+360×(i-1)列については、
前記検査行列初期値テーブルのi行目が、前記検査行列の1+360×(i-1)列目の1の要素の行番号を表し、
前記検査行列の1+360×(i-1)列目以外の列である2+360×(i-1)列目から360×i列目までの各列については、
前記検査行列初期値テーブルのi行目のj列目の数値をhi,jと表すとともに、前記検査行列Hのw列目の、j個目の1の要素の行番号をHw-jと表すとき、
前記検査行列の1+360×(i-1)列目以外の列であるw列目の、1の要素の行番号Hw-jは、式Hw-j=mod{hi,j+mod((w-1),360)×M/360,M)で表される
請求項31に記載のデータ処理方法。 - 前記qは、138である
請求項31に記載のデータ処理方法。 - 前記LDPC符号の符号ビットを、カラム方向にずらして記憶することによりカラムツイストインターリーブが行われている場合に、前記LDPC符号の符号ビットを元の並びに戻すカラムツイストデインターリーブを行う
請求項30に記載のデータ処理方法。 - 前記LDPC符号の符号ビットを、所定のディジタル変調方式で定める所定数の信号点のうちのいずれかに対応するシンボルのシンボルビットに入れ替える入れ替え処理が行われている場合に、前記シンボルビットとして位置が入れ替えられた前記符号ビットを、元の位置に戻す逆入れ替え処理を行う
請求項30に記載のデータ処理方法。 - 前記逆入れ替え処理では、ロウ方向に記憶されてカラム方向に読み出される前記符号ビットを元の位置に戻す
請求項35に記載のデータ処理方法。 - 前記検査行列は、サイクル4が存在しない検査行列である
請求項30に記載のデータ処理方法。 - 前記検査行列は、マルチエッジタイプのデンシティエボリューションによって検出される、BERが落ち始めるEb/N0である性能閾値が所定値以下になるLDPC符号のアンサンブルに属するLDPC符号の検査行列である
請求項30に記載のデータ処理方法。 - LDPC(Low Density Parity Check)符号の検査行列に基づき、情報ビットを、符号長が64800ビットで符号化率が8/30のLDPC符号に符号化する符号化部を備え、
前記LDPC符号は、情報ビットとパリティビットを含み、
前記検査行列は、前記情報ビットに対応する情報行列部と前記パリティビットに対応するパリティ行列部とを含み、
前記情報行列部は、検査行列初期値テーブルによって表され、
前記検査行列初期値テーブルは、前記情報行列部の1の要素の位置を360列ごとに表すテーブルであって、
100 3433 4111 9089 13360 24012 26305 30252 31430 31769 34689 34917 36091 40873 41983 42689 43835 44318 47109
3 48 124 2240 7029 21694 24565 29302 39777 42706 43631 43784 46033 47064 47079 47141 47239 47439 47479
2 5675 7056 12715 24128 26596 30571 38210 38586 41138 42272 43336 43444 43917 45812 46840 47245 47286 47510
2103 4285 10068 10702 12693 17619 18711 21309 22191 22999 37432 45646 46275 46338 46777 46860 46963 47432 47472
6827 8209 8606 10412 15670 19469 22205 22215 25425 29565 34843 34985 37686 39277 44625 45016 45623 47069 47250
58 114 1751 7913 24642 26995 40734 41486 43133 44804 45490 45725 46122 46412 47019 47080 47103 47495 47506
96 5952 9078 9786 17738 17888 17986 31657 34430 34763 35450 37276 42395 43223 43283 44261 45648 47014 47276
106 5405 9614 20500 21633 23242 28875 37238 38854 41778 42292 43883 45909 46558 46826 47292 47353 47436 47504
32 11217 12153 26818 27616 38783 39976 40842 43581 43703 44287 44435 44576 44774 46080 46098 46801 46813 47168
65 102 111 3879 11224 11772 23623 27306 28726 34663 34873 36288 39196 42003 45279 45629 46836 47021 47419
77 131 11275 18964 20418 22364 22635 27727 28689 29720 29781 32110 41597 42046 43952 44786 46416 46808 47200
87 8637 10829 23737 24117 26486 29603 34389 35509 35872 38948 40643 42698 45949 46159 46660 47041 47165 47220
2 58 3110 7539 8886 10422 11597 13385 27870 35895 38120 43546 44948 46272 46369 46596 47199 47317 47351
78 16119 27780 32231 38973 39088 40118 40231 43170 44131 44203 44878 45905 46250 47011 47113 47195 47303 47427
2960 6685 8830 11107 11843 12811 30030 36574 36850 36920 37706 38025 41007 43554 44109 44643 45874 46469 46565
125 366 10175 29860
45 17503 44634 45789
6272 19614 34408 37248
14785 41017 44274 46858
19935 22960 44726 44919
15247 17925 33947 37392
34631 39148 43287 45443
8544 26457 30996 38672
11725 31442 42167 45461
22357 41743 46702 47285
13786 26288 41358 43082
7306 21352 43298 47359
77 5188 20988 45572
10334 23790 40878
9304 29379 47450
22048 44762 47300
8529 8825 47443
40831 41328 46415
26715 43038 46498
26925 30797 43181
32434 45624 47460
17989 31811 47215
5624 25501 33016
5024 9037 33642
93 7329 46908
20303 42578 46780
16137 26869 42360
112 3049 46527
23615 29931 47360
23050 24267 44687
60 40754 47114
30217 36283 37445
127 27308 38345
である
データ処理装置。 - LDPC(Low Density Parity Check)符号の検査行列に基づき、情報ビットを、符号長が64800ビットで符号化率が8/30のLDPC符号に符号化する符号化ステップを備え、
前記LDPC符号は、情報ビットとパリティビットを含み、
前記検査行列は、前記情報ビットに対応する情報行列部と前記パリティビットに対応するパリティ行列部とを含み、
前記情報行列部は、検査行列初期値テーブルによって表され、
前記検査行列初期値テーブルは、前記情報行列部の1の要素の位置を360列ごとに表すテーブルであって、
100 3433 4111 9089 13360 24012 26305 30252 31430 31769 34689 34917 36091 40873 41983 42689 43835 44318 47109
3 48 124 2240 7029 21694 24565 29302 39777 42706 43631 43784 46033 47064 47079 47141 47239 47439 47479
2 5675 7056 12715 24128 26596 30571 38210 38586 41138 42272 43336 43444 43917 45812 46840 47245 47286 47510
2103 4285 10068 10702 12693 17619 18711 21309 22191 22999 37432 45646 46275 46338 46777 46860 46963 47432 47472
6827 8209 8606 10412 15670 19469 22205 22215 25425 29565 34843 34985 37686 39277 44625 45016 45623 47069 47250
58 114 1751 7913 24642 26995 40734 41486 43133 44804 45490 45725 46122 46412 47019 47080 47103 47495 47506
96 5952 9078 9786 17738 17888 17986 31657 34430 34763 35450 37276 42395 43223 43283 44261 45648 47014 47276
106 5405 9614 20500 21633 23242 28875 37238 38854 41778 42292 43883 45909 46558 46826 47292 47353 47436 47504
32 11217 12153 26818 27616 38783 39976 40842 43581 43703 44287 44435 44576 44774 46080 46098 46801 46813 47168
65 102 111 3879 11224 11772 23623 27306 28726 34663 34873 36288 39196 42003 45279 45629 46836 47021 47419
77 131 11275 18964 20418 22364 22635 27727 28689 29720 29781 32110 41597 42046 43952 44786 46416 46808 47200
87 8637 10829 23737 24117 26486 29603 34389 35509 35872 38948 40643 42698 45949 46159 46660 47041 47165 47220
2 58 3110 7539 8886 10422 11597 13385 27870 35895 38120 43546 44948 46272 46369 46596 47199 47317 47351
78 16119 27780 32231 38973 39088 40118 40231 43170 44131 44203 44878 45905 46250 47011 47113 47195 47303 47427
2960 6685 8830 11107 11843 12811 30030 36574 36850 36920 37706 38025 41007 43554 44109 44643 45874 46469 46565
125 366 10175 29860
45 17503 44634 45789
6272 19614 34408 37248
14785 41017 44274 46858
19935 22960 44726 44919
15247 17925 33947 37392
34631 39148 43287 45443
8544 26457 30996 38672
11725 31442 42167 45461
22357 41743 46702 47285
13786 26288 41358 43082
7306 21352 43298 47359
77 5188 20988 45572
10334 23790 40878
9304 29379 47450
22048 44762 47300
8529 8825 47443
40831 41328 46415
26715 43038 46498
26925 30797 43181
32434 45624 47460
17989 31811 47215
5624 25501 33016
5024 9037 33642
93 7329 46908
20303 42578 46780
16137 26869 42360
112 3049 46527
23615 29931 47360
23050 24267 44687
60 40754 47114
30217 36283 37445
127 27308 38345
である
データ処理方法。 - LDPC(Low Density Parity Check)符号の検査行列に基づき、符号長が64800ビットで符号化率が8/30のLDPC符号を復号する復号部を備え、
前記LDPC符号は、情報ビットとパリティビットを含み、
前記検査行列は、前記情報ビットに対応する情報行列部と前記パリティビットに対応するパリティ行列部とを含み、
前記情報行列部は、検査行列初期値テーブルによって表され、
前記検査行列初期値テーブルは、前記情報行列部の1の要素の位置を360列ごとに表すテーブルであって、
100 3433 4111 9089 13360 24012 26305 30252 31430 31769 34689 34917 36091 40873 41983 42689 43835 44318 47109
3 48 124 2240 7029 21694 24565 29302 39777 42706 43631 43784 46033 47064 47079 47141 47239 47439 47479
2 5675 7056 12715 24128 26596 30571 38210 38586 41138 42272 43336 43444 43917 45812 46840 47245 47286 47510
2103 4285 10068 10702 12693 17619 18711 21309 22191 22999 37432 45646 46275 46338 46777 46860 46963 47432 47472
6827 8209 8606 10412 15670 19469 22205 22215 25425 29565 34843 34985 37686 39277 44625 45016 45623 47069 47250
58 114 1751 7913 24642 26995 40734 41486 43133 44804 45490 45725 46122 46412 47019 47080 47103 47495 47506
96 5952 9078 9786 17738 17888 17986 31657 34430 34763 35450 37276 42395 43223 43283 44261 45648 47014 47276
106 5405 9614 20500 21633 23242 28875 37238 38854 41778 42292 43883 45909 46558 46826 47292 47353 47436 47504
32 11217 12153 26818 27616 38783 39976 40842 43581 43703 44287 44435 44576 44774 46080 46098 46801 46813 47168
65 102 111 3879 11224 11772 23623 27306 28726 34663 34873 36288 39196 42003 45279 45629 46836 47021 47419
77 131 11275 18964 20418 22364 22635 27727 28689 29720 29781 32110 41597 42046 43952 44786 46416 46808 47200
87 8637 10829 23737 24117 26486 29603 34389 35509 35872 38948 40643 42698 45949 46159 46660 47041 47165 47220
2 58 3110 7539 8886 10422 11597 13385 27870 35895 38120 43546 44948 46272 46369 46596 47199 47317 47351
78 16119 27780 32231 38973 39088 40118 40231 43170 44131 44203 44878 45905 46250 47011 47113 47195 47303 47427
2960 6685 8830 11107 11843 12811 30030 36574 36850 36920 37706 38025 41007 43554 44109 44643 45874 46469 46565
125 366 10175 29860
45 17503 44634 45789
6272 19614 34408 37248
14785 41017 44274 46858
19935 22960 44726 44919
15247 17925 33947 37392
34631 39148 43287 45443
8544 26457 30996 38672
11725 31442 42167 45461
22357 41743 46702 47285
13786 26288 41358 43082
7306 21352 43298 47359
77 5188 20988 45572
10334 23790 40878
9304 29379 47450
22048 44762 47300
8529 8825 47443
40831 41328 46415
26715 43038 46498
26925 30797 43181
32434 45624 47460
17989 31811 47215
5624 25501 33016
5024 9037 33642
93 7329 46908
20303 42578 46780
16137 26869 42360
112 3049 46527
23615 29931 47360
23050 24267 44687
60 40754 47114
30217 36283 37445
127 27308 38345
である
データ処理装置。 - LDPC(Low Density Parity Check)符号の検査行列に基づき、符号長が64800ビットで符号化率が8/30のLDPC符号を復号する復号ステップを備え、
前記LDPC符号は、情報ビットとパリティビットを含み、
前記検査行列は、前記情報ビットに対応する情報行列部と前記パリティビットに対応するパリティ行列部とを含み、
前記情報行列部は、検査行列初期値テーブルによって表され、
前記検査行列初期値テーブルは、前記情報行列部の1の要素の位置を360列ごとに表すテーブルであって、
100 3433 4111 9089 13360 24012 26305 30252 31430 31769 34689 34917 36091 40873 41983 42689 43835 44318 47109
3 48 124 2240 7029 21694 24565 29302 39777 42706 43631 43784 46033 47064 47079 47141 47239 47439 47479
2 5675 7056 12715 24128 26596 30571 38210 38586 41138 42272 43336 43444 43917 45812 46840 47245 47286 47510
2103 4285 10068 10702 12693 17619 18711 21309 22191 22999 37432 45646 46275 46338 46777 46860 46963 47432 47472
6827 8209 8606 10412 15670 19469 22205 22215 25425 29565 34843 34985 37686 39277 44625 45016 45623 47069 47250
58 114 1751 7913 24642 26995 40734 41486 43133 44804 45490 45725 46122 46412 47019 47080 47103 47495 47506
96 5952 9078 9786 17738 17888 17986 31657 34430 34763 35450 37276 42395 43223 43283 44261 45648 47014 47276
106 5405 9614 20500 21633 23242 28875 37238 38854 41778 42292 43883 45909 46558 46826 47292 47353 47436 47504
32 11217 12153 26818 27616 38783 39976 40842 43581 43703 44287 44435 44576 44774 46080 46098 46801 46813 47168
65 102 111 3879 11224 11772 23623 27306 28726 34663 34873 36288 39196 42003 45279 45629 46836 47021 47419
77 131 11275 18964 20418 22364 22635 27727 28689 29720 29781 32110 41597 42046 43952 44786 46416 46808 47200
87 8637 10829 23737 24117 26486 29603 34389 35509 35872 38948 40643 42698 45949 46159 46660 47041 47165 47220
2 58 3110 7539 8886 10422 11597 13385 27870 35895 38120 43546 44948 46272 46369 46596 47199 47317 47351
78 16119 27780 32231 38973 39088 40118 40231 43170 44131 44203 44878 45905 46250 47011 47113 47195 47303 47427
2960 6685 8830 11107 11843 12811 30030 36574 36850 36920 37706 38025 41007 43554 44109 44643 45874 46469 46565
125 366 10175 29860
45 17503 44634 45789
6272 19614 34408 37248
14785 41017 44274 46858
19935 22960 44726 44919
15247 17925 33947 37392
34631 39148 43287 45443
8544 26457 30996 38672
11725 31442 42167 45461
22357 41743 46702 47285
13786 26288 41358 43082
7306 21352 43298 47359
77 5188 20988 45572
10334 23790 40878
9304 29379 47450
22048 44762 47300
8529 8825 47443
40831 41328 46415
26715 43038 46498
26925 30797 43181
32434 45624 47460
17989 31811 47215
5624 25501 33016
5024 9037 33642
93 7329 46908
20303 42578 46780
16137 26869 42360
112 3049 46527
23615 29931 47360
23050 24267 44687
60 40754 47114
30217 36283 37445
127 27308 38345
である
データ処理方法。 - LDPC(Low Density Parity Check)符号の検査行列に基づき、情報ビットを、符号長が64800ビットで符号化率が9/30のLDPC符号に符号化する符号化部を備え、
前記LDPC符号は、情報ビットとパリティビットを含み、
前記検査行列は、前記情報ビットに対応する情報行列部と前記パリティビットに対応するパリティ行列部とを含み、
前記情報行列部は、検査行列初期値テーブルによって表され、
前記検査行列初期値テーブルは、前記情報行列部の1の要素の位置を360列ごとに表すテーブルであって、
339 4777 5366 7623 13034 13260 15107 17772 20338 21178 25914 27663 29948 37489 41021
3871 5812 9795 23437 24079 27699 33471 39878 40302 41038 41217 42316 42765 43675 45118
3699 4072 16553 21492 26210 29839 30322 34139 38227 39696 40762 41156 41269 45168 45350
995 12194 12494 16542 20423 21950 23519 26215 26708 30587 38352 38840 39729 41645 43210
3963 4315 6832 11354 21042 21084 21108 25595 33109 34029 34448 35129 38018 39012 44791
164 887 2902 9021 9193 16705 17850 19241 25893 33427 37416 41024 41355 44381 45303
1367 1495 5495 14440 18026 18130 18178 21946 24057 25663 29216 31965 38107 43907 44278
10763 13722 13975 18294 20813 23028 23353 24211 37366 38805 40985 41792 42495 43259 43528
1580 12448 21464 31246 33058 34794 35760 36021 36426 37138 37478 38199 42138 42335 45207
83 112 12225 15224 18205 21345 28488 34362 37195 39660 42371 42814 44509 45201 45244
6836 7635 11644 16591 17121 19307 21456 23544 30596 37887 38141 38581 43607 44246 45097
9174 14934 17131 29762 30243 31656 33251 35498 37106 37655 41462 44002 44649 45032 45230
33 5376 13536 17068 18581 23478 32021 32074 33716 38434 39452 42166 44305 44979 45306
6013 7553 10023 19354 23126 25427 27665 30239 32699 34123 36171 38898 38972 41974 45213
41 98 3088 8522 26252 29602 30009 30138 30948 32190 32428 32498 34273 34955 45311
2000 15664 20677 20792 22980 25111 31491 37611 37981 39872 41668 42336 43602 43828 45329
23 67 97 5339 8121 8583 20647 25425 32305 37158 40968 41578 43492 44929 45273
1643 3496 5121 6546 15643 16423 20602 39950 43178 43252 43683 43992 44001 44611 45125
11093 19172 20548 24518 28289 29246 30148 34884 40403 40745 42723 43064 44448 44723 44812
12748 12799 28567 41605
1965 4087 31879
27178 33638 38344
9580 13096 45337
2672 22800 43869
28287 31407 31975
2823 5108 9945
5891 30848 42082
23 41944 44909
909 2311 45162
24998 37829 44704
35339 40087 45019
16928 26505 35256
26462 27297 37766
19656 35067 38586
6958 17172 41412
72 26012 37231
15259 16044 30243
2879 12148 34601
36173 39731 42668
20670 35816 43266
22570 27213 30404
40284 44171 45313
17765 22514 39347
24711 39892 45132
13741 34633 44535
15209 31692 45280
11189 43771 45303
28294 31110 32287
29085 39876 45246
24285 36009 45347
6882 28921 34504
9256 19267 44194
2132 21404 28687
23809 34383 44540
である
データ処理装置。 - LDPC(Low Density Parity Check)符号の検査行列に基づき、情報ビットを、符号長が64800ビットで符号化率が9/30のLDPC符号に符号化する符号化ステップを備え、
前記LDPC符号は、情報ビットとパリティビットを含み、
前記検査行列は、前記情報ビットに対応する情報行列部と前記パリティビットに対応するパリティ行列部とを含み、
前記情報行列部は、検査行列初期値テーブルによって表され、
前記検査行列初期値テーブルは、前記情報行列部の1の要素の位置を360列ごとに表すテーブルであって、
339 4777 5366 7623 13034 13260 15107 17772 20338 21178 25914 27663 29948 37489 41021
3871 5812 9795 23437 24079 27699 33471 39878 40302 41038 41217 42316 42765 43675 45118
3699 4072 16553 21492 26210 29839 30322 34139 38227 39696 40762 41156 41269 45168 45350
995 12194 12494 16542 20423 21950 23519 26215 26708 30587 38352 38840 39729 41645 43210
3963 4315 6832 11354 21042 21084 21108 25595 33109 34029 34448 35129 38018 39012 44791
164 887 2902 9021 9193 16705 17850 19241 25893 33427 37416 41024 41355 44381 45303
1367 1495 5495 14440 18026 18130 18178 21946 24057 25663 29216 31965 38107 43907 44278
10763 13722 13975 18294 20813 23028 23353 24211 37366 38805 40985 41792 42495 43259 43528
1580 12448 21464 31246 33058 34794 35760 36021 36426 37138 37478 38199 42138 42335 45207
83 112 12225 15224 18205 21345 28488 34362 37195 39660 42371 42814 44509 45201 45244
6836 7635 11644 16591 17121 19307 21456 23544 30596 37887 38141 38581 43607 44246 45097
9174 14934 17131 29762 30243 31656 33251 35498 37106 37655 41462 44002 44649 45032 45230
33 5376 13536 17068 18581 23478 32021 32074 33716 38434 39452 42166 44305 44979 45306
6013 7553 10023 19354 23126 25427 27665 30239 32699 34123 36171 38898 38972 41974 45213
41 98 3088 8522 26252 29602 30009 30138 30948 32190 32428 32498 34273 34955 45311
2000 15664 20677 20792 22980 25111 31491 37611 37981 39872 41668 42336 43602 43828 45329
23 67 97 5339 8121 8583 20647 25425 32305 37158 40968 41578 43492 44929 45273
1643 3496 5121 6546 15643 16423 20602 39950 43178 43252 43683 43992 44001 44611 45125
11093 19172 20548 24518 28289 29246 30148 34884 40403 40745 42723 43064 44448 44723 44812
12748 12799 28567 41605
1965 4087 31879
27178 33638 38344
9580 13096 45337
2672 22800 43869
28287 31407 31975
2823 5108 9945
5891 30848 42082
23 41944 44909
909 2311 45162
24998 37829 44704
35339 40087 45019
16928 26505 35256
26462 27297 37766
19656 35067 38586
6958 17172 41412
72 26012 37231
15259 16044 30243
2879 12148 34601
36173 39731 42668
20670 35816 43266
22570 27213 30404
40284 44171 45313
17765 22514 39347
24711 39892 45132
13741 34633 44535
15209 31692 45280
11189 43771 45303
28294 31110 32287
29085 39876 45246
24285 36009 45347
6882 28921 34504
9256 19267 44194
2132 21404 28687
23809 34383 44540
である
データ処理方法。 - LDPC(Low Density Parity Check)符号の検査行列に基づき、符号長が64800ビットで符号化率が9/30のLDPC符号を復号する復号部を備え、
前記LDPC符号は、情報ビットとパリティビットを含み、
前記検査行列は、前記情報ビットに対応する情報行列部と前記パリティビットに対応するパリティ行列部とを含み、
前記情報行列部は、検査行列初期値テーブルによって表され、
前記検査行列初期値テーブルは、前記情報行列部の1の要素の位置を360列ごとに表すテーブルであって、
339 4777 5366 7623 13034 13260 15107 17772 20338 21178 25914 27663 29948 37489 41021
3871 5812 9795 23437 24079 27699 33471 39878 40302 41038 41217 42316 42765 43675 45118
3699 4072 16553 21492 26210 29839 30322 34139 38227 39696 40762 41156 41269 45168 45350
995 12194 12494 16542 20423 21950 23519 26215 26708 30587 38352 38840 39729 41645 43210
3963 4315 6832 11354 21042 21084 21108 25595 33109 34029 34448 35129 38018 39012 44791
164 887 2902 9021 9193 16705 17850 19241 25893 33427 37416 41024 41355 44381 45303
1367 1495 5495 14440 18026 18130 18178 21946 24057 25663 29216 31965 38107 43907 44278
10763 13722 13975 18294 20813 23028 23353 24211 37366 38805 40985 41792 42495 43259 43528
1580 12448 21464 31246 33058 34794 35760 36021 36426 37138 37478 38199 42138 42335 45207
83 112 12225 15224 18205 21345 28488 34362 37195 39660 42371 42814 44509 45201 45244
6836 7635 11644 16591 17121 19307 21456 23544 30596 37887 38141 38581 43607 44246 45097
9174 14934 17131 29762 30243 31656 33251 35498 37106 37655 41462 44002 44649 45032 45230
33 5376 13536 17068 18581 23478 32021 32074 33716 38434 39452 42166 44305 44979 45306
6013 7553 10023 19354 23126 25427 27665 30239 32699 34123 36171 38898 38972 41974 45213
41 98 3088 8522 26252 29602 30009 30138 30948 32190 32428 32498 34273 34955 45311
2000 15664 20677 20792 22980 25111 31491 37611 37981 39872 41668 42336 43602 43828 45329
23 67 97 5339 8121 8583 20647 25425 32305 37158 40968 41578 43492 44929 45273
1643 3496 5121 6546 15643 16423 20602 39950 43178 43252 43683 43992 44001 44611 45125
11093 19172 20548 24518 28289 29246 30148 34884 40403 40745 42723 43064 44448 44723 44812
12748 12799 28567 41605
1965 4087 31879
27178 33638 38344
9580 13096 45337
2672 22800 43869
28287 31407 31975
2823 5108 9945
5891 30848 42082
23 41944 44909
909 2311 45162
24998 37829 44704
35339 40087 45019
16928 26505 35256
26462 27297 37766
19656 35067 38586
6958 17172 41412
72 26012 37231
15259 16044 30243
2879 12148 34601
36173 39731 42668
20670 35816 43266
22570 27213 30404
40284 44171 45313
17765 22514 39347
24711 39892 45132
13741 34633 44535
15209 31692 45280
11189 43771 45303
28294 31110 32287
29085 39876 45246
24285 36009 45347
6882 28921 34504
9256 19267 44194
2132 21404 28687
23809 34383 44540
である
データ処理装置。 - LDPC(Low Density Parity Check)符号の検査行列に基づき、符号長が64800ビットで符号化率が9/30のLDPC符号を復号する復号ステップを備え、
前記LDPC符号は、情報ビットとパリティビットを含み、
前記検査行列は、前記情報ビットに対応する情報行列部と前記パリティビットに対応するパリティ行列部とを含み、
前記情報行列部は、検査行列初期値テーブルによって表され、
前記検査行列初期値テーブルは、前記情報行列部の1の要素の位置を360列ごとに表すテーブルであって、
339 4777 5366 7623 13034 13260 15107 17772 20338 21178 25914 27663 29948 37489 41021
3871 5812 9795 23437 24079 27699 33471 39878 40302 41038 41217 42316 42765 43675 45118
3699 4072 16553 21492 26210 29839 30322 34139 38227 39696 40762 41156 41269 45168 45350
995 12194 12494 16542 20423 21950 23519 26215 26708 30587 38352 38840 39729 41645 43210
3963 4315 6832 11354 21042 21084 21108 25595 33109 34029 34448 35129 38018 39012 44791
164 887 2902 9021 9193 16705 17850 19241 25893 33427 37416 41024 41355 44381 45303
1367 1495 5495 14440 18026 18130 18178 21946 24057 25663 29216 31965 38107 43907 44278
10763 13722 13975 18294 20813 23028 23353 24211 37366 38805 40985 41792 42495 43259 43528
1580 12448 21464 31246 33058 34794 35760 36021 36426 37138 37478 38199 42138 42335 45207
83 112 12225 15224 18205 21345 28488 34362 37195 39660 42371 42814 44509 45201 45244
6836 7635 11644 16591 17121 19307 21456 23544 30596 37887 38141 38581 43607 44246 45097
9174 14934 17131 29762 30243 31656 33251 35498 37106 37655 41462 44002 44649 45032 45230
33 5376 13536 17068 18581 23478 32021 32074 33716 38434 39452 42166 44305 44979 45306
6013 7553 10023 19354 23126 25427 27665 30239 32699 34123 36171 38898 38972 41974 45213
41 98 3088 8522 26252 29602 30009 30138 30948 32190 32428 32498 34273 34955 45311
2000 15664 20677 20792 22980 25111 31491 37611 37981 39872 41668 42336 43602 43828 45329
23 67 97 5339 8121 8583 20647 25425 32305 37158 40968 41578 43492 44929 45273
1643 3496 5121 6546 15643 16423 20602 39950 43178 43252 43683 43992 44001 44611 45125
11093 19172 20548 24518 28289 29246 30148 34884 40403 40745 42723 43064 44448 44723 44812
12748 12799 28567 41605
1965 4087 31879
27178 33638 38344
9580 13096 45337
2672 22800 43869
28287 31407 31975
2823 5108 9945
5891 30848 42082
23 41944 44909
909 2311 45162
24998 37829 44704
35339 40087 45019
16928 26505 35256
26462 27297 37766
19656 35067 38586
6958 17172 41412
72 26012 37231
15259 16044 30243
2879 12148 34601
36173 39731 42668
20670 35816 43266
22570 27213 30404
40284 44171 45313
17765 22514 39347
24711 39892 45132
13741 34633 44535
15209 31692 45280
11189 43771 45303
28294 31110 32287
29085 39876 45246
24285 36009 45347
6882 28921 34504
9256 19267 44194
2132 21404 28687
23809 34383 44540
である
データ処理方法。 - LDPC(Low Density Parity Check)符号の検査行列に基づき、情報ビットを、符号長が64800ビットで符号化率が10/30のLDPC符号に符号化する符号化部を備え、
前記LDPC符号は、情報ビットとパリティビットを含み、
前記検査行列は、前記情報ビットに対応する情報行列部と前記パリティビットに対応するパリティ行列部とを含み、
前記情報行列部は、検査行列初期値テーブルによって表され、
前記検査行列初期値テーブルは、前記情報行列部の1の要素の位置を360列ごとに表すテーブルであって、
867 2733 2978 8947 10214 11810 13566 15922 18838 20543 25845 29179 30055 31284 33447 34330 35081 35605 36268 39563 42331 43174
2765 6017 6394 6769 12351 13567 15195 19900 23094 27077 28626 28914 32219 33106 33662 33905 34878 37861 39749 39862 40976 42690
2343 4231 7603 7789 8396 8783 15636 16221 20591 21538 24008 25117 25663 26817 29692 30937 31472 32070 33793 39506 41763 43172
8536 10705 10960 11206 12513 15399 17108 17224 17512 20180 25288 27824 28958 30600 36792 36828 38891 39575 39581 42342 42914 42961
9 107 681 1195 9957 14055 21420 23279 26129 32044 35750 37065 37092 37165 37179 40127 40835 41476 41564 41571 42576 42910
86 1760 6842 8119 8904 12644 17603 18189 20018 22259 22654 25620 27606 27833 28002 31053 31814 31848 35573 36133 40698 41370
28 115 4354 9276 11229 11252 13848 21112 22851 29912 32453 34693 37344 37420 40926 40992 41063 41762 41856 42012 42642 43045
1589 7190 7221 7668 11805 14071 14367 14629 17087 19579 19861 25505 35471 35514 37495 38375 40286 40330 40402 41662 42638 43126
76 99 3237 5137 7982 9598 13470 14045 26680 27058 32025 32235 34601 35658 36841 38408 40517 40987 41400 41861 42691 42772
54 2470 2728 3177 3484 8267 9351 17523 18513 21119 22947 23771 26569 27308 31217 35887 36449 38529 40424 41873 42146 42706
39 80 385 1386 3397 5234 14733 16955 17656 23262 23463 25340 31638 31676 32683 37130 37641 39064 41839 42193 42495 43063
62 573 11847 14616 16033 16064 16302 18776 19434 23845 23873 25937 27741 32244 32612 33554 38445 38480 38610 40933 42386 42520
33 183 968 5477 6173 7363 10358 12597 14468 18025 23369 23387 24723 25254 28299 28989 31675 32776 35077 40241 41572 42035
36 2529 2543 3891 7108 9002 9481 16496 19796 26687 27343 33300 35495 37070 39247 40126 41758 41892 42124 42622 42738 43100
91 6897 8794 9581 12922 15711 18539 19227 21592 22906 26449 29804 30895 31538 31930 33392 38006 38294 38705 38952 39005 42120
64 76 709 1155 3162 7099 8740 9670 12678 21126 29239 29844 31248 32001 35243 36814 38008 42050 42149 42631 42705 43119
17670 40897 42359
17471 20895 32101
5458 5508 30504
17291 19627 27186
14600 41106 43103
18059 28398 40623
23776 30190 32880
4676 13593 21791
19 2832 27959
6193 21762 42854
64 16088 42982
29425 35004 42209
14338 31982 41789
21572 42838 42923
5 87 6639
5529 42541 43173
15512 31740 35801
44 86 43183
26027 26995 36455
16485 30090 34537
22276 40174 42367
10781 18230 18766
9984 42877 43027
11108 20618 41626
8496 42994 43171
10581 25803 42606
4989 14002 29020
35032 39378 41455
109 11667 42914
12471 14022 35477
31761 34625 36228
1228 6013 43110
22355 37905 40784
12740 21805 31648
4202 28639 32213
10697 31674 42998
4092 23877 34360
54 9459 16450
1 56 33675
18163 31951 42528
50 5655 35891
47 35033 40356
29097 32786 35931
9532 27004 43009
である
データ処理装置。 - LDPC(Low Density Parity Check)符号の検査行列に基づき、情報ビットを、符号長が64800ビットで符号化率が10/30のLDPC符号に符号化する符号化ステップを備え、
前記LDPC符号は、情報ビットとパリティビットを含み、
前記検査行列は、前記情報ビットに対応する情報行列部と前記パリティビットに対応するパリティ行列部とを含み、
前記情報行列部は、検査行列初期値テーブルによって表され、
前記検査行列初期値テーブルは、前記情報行列部の1の要素の位置を360列ごとに表すテーブルであって、
867 2733 2978 8947 10214 11810 13566 15922 18838 20543 25845 29179 30055 31284 33447 34330 35081 35605 36268 39563 42331 43174
2765 6017 6394 6769 12351 13567 15195 19900 23094 27077 28626 28914 32219 33106 33662 33905 34878 37861 39749 39862 40976 42690
2343 4231 7603 7789 8396 8783 15636 16221 20591 21538 24008 25117 25663 26817 29692 30937 31472 32070 33793 39506 41763 43172
8536 10705 10960 11206 12513 15399 17108 17224 17512 20180 25288 27824 28958 30600 36792 36828 38891 39575 39581 42342 42914 42961
9 107 681 1195 9957 14055 21420 23279 26129 32044 35750 37065 37092 37165 37179 40127 40835 41476 41564 41571 42576 42910
86 1760 6842 8119 8904 12644 17603 18189 20018 22259 22654 25620 27606 27833 28002 31053 31814 31848 35573 36133 40698 41370
28 115 4354 9276 11229 11252 13848 21112 22851 29912 32453 34693 37344 37420 40926 40992 41063 41762 41856 42012 42642 43045
1589 7190 7221 7668 11805 14071 14367 14629 17087 19579 19861 25505 35471 35514 37495 38375 40286 40330 40402 41662 42638 43126
76 99 3237 5137 7982 9598 13470 14045 26680 27058 32025 32235 34601 35658 36841 38408 40517 40987 41400 41861 42691 42772
54 2470 2728 3177 3484 8267 9351 17523 18513 21119 22947 23771 26569 27308 31217 35887 36449 38529 40424 41873 42146 42706
39 80 385 1386 3397 5234 14733 16955 17656 23262 23463 25340 31638 31676 32683 37130 37641 39064 41839 42193 42495 43063
62 573 11847 14616 16033 16064 16302 18776 19434 23845 23873 25937 27741 32244 32612 33554 38445 38480 38610 40933 42386 42520
33 183 968 5477 6173 7363 10358 12597 14468 18025 23369 23387 24723 25254 28299 28989 31675 32776 35077 40241 41572 42035
36 2529 2543 3891 7108 9002 9481 16496 19796 26687 27343 33300 35495 37070 39247 40126 41758 41892 42124 42622 42738 43100
91 6897 8794 9581 12922 15711 18539 19227 21592 22906 26449 29804 30895 31538 31930 33392 38006 38294 38705 38952 39005 42120
64 76 709 1155 3162 7099 8740 9670 12678 21126 29239 29844 31248 32001 35243 36814 38008 42050 42149 42631 42705 43119
17670 40897 42359
17471 20895 32101
5458 5508 30504
17291 19627 27186
14600 41106 43103
18059 28398 40623
23776 30190 32880
4676 13593 21791
19 2832 27959
6193 21762 42854
64 16088 42982
29425 35004 42209
14338 31982 41789
21572 42838 42923
5 87 6639
5529 42541 43173
15512 31740 35801
44 86 43183
26027 26995 36455
16485 30090 34537
22276 40174 42367
10781 18230 18766
9984 42877 43027
11108 20618 41626
8496 42994 43171
10581 25803 42606
4989 14002 29020
35032 39378 41455
109 11667 42914
12471 14022 35477
31761 34625 36228
1228 6013 43110
22355 37905 40784
12740 21805 31648
4202 28639 32213
10697 31674 42998
4092 23877 34360
54 9459 16450
1 56 33675
18163 31951 42528
50 5655 35891
47 35033 40356
29097 32786 35931
9532 27004 43009
である
データ処理方法。 - LDPC(Low Density Parity Check)符号の検査行列に基づき、符号長が64800ビットで符号化率が10/30のLDPC符号を復号する復号部を備え、
前記LDPC符号は、情報ビットとパリティビットを含み、
前記検査行列は、前記情報ビットに対応する情報行列部と前記パリティビットに対応するパリティ行列部とを含み、
前記情報行列部は、検査行列初期値テーブルによって表され、
前記検査行列初期値テーブルは、前記情報行列部の1の要素の位置を360列ごとに表すテーブルであって、
867 2733 2978 8947 10214 11810 13566 15922 18838 20543 25845 29179 30055 31284 33447 34330 35081 35605 36268 39563 42331 43174
2765 6017 6394 6769 12351 13567 15195 19900 23094 27077 28626 28914 32219 33106 33662 33905 34878 37861 39749 39862 40976 42690
2343 4231 7603 7789 8396 8783 15636 16221 20591 21538 24008 25117 25663 26817 29692 30937 31472 32070 33793 39506 41763 43172
8536 10705 10960 11206 12513 15399 17108 17224 17512 20180 25288 27824 28958 30600 36792 36828 38891 39575 39581 42342 42914 42961
9 107 681 1195 9957 14055 21420 23279 26129 32044 35750 37065 37092 37165 37179 40127 40835 41476 41564 41571 42576 42910
86 1760 6842 8119 8904 12644 17603 18189 20018 22259 22654 25620 27606 27833 28002 31053 31814 31848 35573 36133 40698 41370
28 115 4354 9276 11229 11252 13848 21112 22851 29912 32453 34693 37344 37420 40926 40992 41063 41762 41856 42012 42642 43045
1589 7190 7221 7668 11805 14071 14367 14629 17087 19579 19861 25505 35471 35514 37495 38375 40286 40330 40402 41662 42638 43126
76 99 3237 5137 7982 9598 13470 14045 26680 27058 32025 32235 34601 35658 36841 38408 40517 40987 41400 41861 42691 42772
54 2470 2728 3177 3484 8267 9351 17523 18513 21119 22947 23771 26569 27308 31217 35887 36449 38529 40424 41873 42146 42706
39 80 385 1386 3397 5234 14733 16955 17656 23262 23463 25340 31638 31676 32683 37130 37641 39064 41839 42193 42495 43063
62 573 11847 14616 16033 16064 16302 18776 19434 23845 23873 25937 27741 32244 32612 33554 38445 38480 38610 40933 42386 42520
33 183 968 5477 6173 7363 10358 12597 14468 18025 23369 23387 24723 25254 28299 28989 31675 32776 35077 40241 41572 42035
36 2529 2543 3891 7108 9002 9481 16496 19796 26687 27343 33300 35495 37070 39247 40126 41758 41892 42124 42622 42738 43100
91 6897 8794 9581 12922 15711 18539 19227 21592 22906 26449 29804 30895 31538 31930 33392 38006 38294 38705 38952 39005 42120
64 76 709 1155 3162 7099 8740 9670 12678 21126 29239 29844 31248 32001 35243 36814 38008 42050 42149 42631 42705 43119
17670 40897 42359
17471 20895 32101
5458 5508 30504
17291 19627 27186
14600 41106 43103
18059 28398 40623
23776 30190 32880
4676 13593 21791
19 2832 27959
6193 21762 42854
64 16088 42982
29425 35004 42209
14338 31982 41789
21572 42838 42923
5 87 6639
5529 42541 43173
15512 31740 35801
44 86 43183
26027 26995 36455
16485 30090 34537
22276 40174 42367
10781 18230 18766
9984 42877 43027
11108 20618 41626
8496 42994 43171
10581 25803 42606
4989 14002 29020
35032 39378 41455
109 11667 42914
12471 14022 35477
31761 34625 36228
1228 6013 43110
22355 37905 40784
12740 21805 31648
4202 28639 32213
10697 31674 42998
4092 23877 34360
54 9459 16450
1 56 33675
18163 31951 42528
50 5655 35891
47 35033 40356
29097 32786 35931
9532 27004 43009
である
データ処理装置。 - LDPC(Low Density Parity Check)符号の検査行列に基づき、符号長が64800ビットで符号化率が10/30のLDPC符号を復号する復号ステップを備え、
前記LDPC符号は、情報ビットとパリティビットを含み、
前記検査行列は、前記情報ビットに対応する情報行列部と前記パリティビットに対応するパリティ行列部とを含み、
前記情報行列部は、検査行列初期値テーブルによって表され、
前記検査行列初期値テーブルは、前記情報行列部の1の要素の位置を360列ごとに表すテーブルであって、
867 2733 2978 8947 10214 11810 13566 15922 18838 20543 25845 29179 30055 31284 33447 34330 35081 35605 36268 39563 42331 43174
2765 6017 6394 6769 12351 13567 15195 19900 23094 27077 28626 28914 32219 33106 33662 33905 34878 37861 39749 39862 40976 42690
2343 4231 7603 7789 8396 8783 15636 16221 20591 21538 24008 25117 25663 26817 29692 30937 31472 32070 33793 39506 41763 43172
8536 10705 10960 11206 12513 15399 17108 17224 17512 20180 25288 27824 28958 30600 36792 36828 38891 39575 39581 42342 42914 42961
9 107 681 1195 9957 14055 21420 23279 26129 32044 35750 37065 37092 37165 37179 40127 40835 41476 41564 41571 42576 42910
86 1760 6842 8119 8904 12644 17603 18189 20018 22259 22654 25620 27606 27833 28002 31053 31814 31848 35573 36133 40698 41370
28 115 4354 9276 11229 11252 13848 21112 22851 29912 32453 34693 37344 37420 40926 40992 41063 41762 41856 42012 42642 43045
1589 7190 7221 7668 11805 14071 14367 14629 17087 19579 19861 25505 35471 35514 37495 38375 40286 40330 40402 41662 42638 43126
76 99 3237 5137 7982 9598 13470 14045 26680 27058 32025 32235 34601 35658 36841 38408 40517 40987 41400 41861 42691 42772
54 2470 2728 3177 3484 8267 9351 17523 18513 21119 22947 23771 26569 27308 31217 35887 36449 38529 40424 41873 42146 42706
39 80 385 1386 3397 5234 14733 16955 17656 23262 23463 25340 31638 31676 32683 37130 37641 39064 41839 42193 42495 43063
62 573 11847 14616 16033 16064 16302 18776 19434 23845 23873 25937 27741 32244 32612 33554 38445 38480 38610 40933 42386 42520
33 183 968 5477 6173 7363 10358 12597 14468 18025 23369 23387 24723 25254 28299 28989 31675 32776 35077 40241 41572 42035
36 2529 2543 3891 7108 9002 9481 16496 19796 26687 27343 33300 35495 37070 39247 40126 41758 41892 42124 42622 42738 43100
91 6897 8794 9581 12922 15711 18539 19227 21592 22906 26449 29804 30895 31538 31930 33392 38006 38294 38705 38952 39005 42120
64 76 709 1155 3162 7099 8740 9670 12678 21126 29239 29844 31248 32001 35243 36814 38008 42050 42149 42631 42705 43119
17670 40897 42359
17471 20895 32101
5458 5508 30504
17291 19627 27186
14600 41106 43103
18059 28398 40623
23776 30190 32880
4676 13593 21791
19 2832 27959
6193 21762 42854
64 16088 42982
29425 35004 42209
14338 31982 41789
21572 42838 42923
5 87 6639
5529 42541 43173
15512 31740 35801
44 86 43183
26027 26995 36455
16485 30090 34537
22276 40174 42367
10781 18230 18766
9984 42877 43027
11108 20618 41626
8496 42994 43171
10581 25803 42606
4989 14002 29020
35032 39378 41455
109 11667 42914
12471 14022 35477
31761 34625 36228
1228 6013 43110
22355 37905 40784
12740 21805 31648
4202 28639 32213
10697 31674 42998
4092 23877 34360
54 9459 16450
1 56 33675
18163 31951 42528
50 5655 35891
47 35033 40356
29097 32786 35931
9532 27004 43009
である
データ処理方法。 - LDPC(Low Density Parity Check)符号の検査行列に基づき、情報ビットを、符号長が64800ビットで符号化率が11/30のLDPC符号に符号化する符号化部を備え、
前記LDPC符号は、情報ビットとパリティビットを含み、
前記検査行列は、前記情報ビットに対応する情報行列部と前記パリティビットに対応するパリティ行列部とを含み、
前記情報行列部は、検査行列初期値テーブルによって表され、
前記検査行列初期値テーブルは、前記情報行列部の1の要素の位置を360列ごとに表すテーブルであって、
3208 6587 9493 9539 12368 12501 14811 15784 17625 18654 18721 19471 19503 20079 20411 20876 21493 22083 22430 27275 29322 32758 33227 33347 33715 34472 34711 38450 39151 39709 39862 40093 40497 40912
42 1118 3086 5466 6379 8483 9051 9330 13250 13898 14055 15033 18094 21429 22652 25251 28709 29909 30233 30472 30635 31367 32603 33614 33708 36404 36530 37039 37782 38115 38307 40225 40597 40822
5939 11990 15027 15162 16503 17171 17806 17902 18031 18077 21216 22134 22660 24170 28558 29364 30003 31128 32674 33103 33361 34196 34435 34626 34991 35974 36022 37459 38170 38709 39774 39960 40571 40858
63 3871 9148 10328 12830 12912 18361 18839 20122 23126 23795 28612 30350 32251 32750 33762 33866 36188 36979 37562 37836 38536 38705 38829 39609 40219 40324 40336 40367 40638 40699 40809 40987 41019
36 70 104 3737 5028 19023 19575 19746 23840 24611 24661 26741 27749 30359 31027 31509 32621 32859 33830 34619 35281 35479 36796 37344 37555 38993 39088 39445 40276 40299 40762 40771 40835 40967
113 2313 4411 5858 9909 10426 18955 21663 21884 24105 24472 26944 27826 28574 28689 29579 30903 32352 33334 36408 36795 36805 37112 37121 38731 39080 39739 40007 40326 40356 40472 40476 40622 40778
54 84 3529 5202 9825 9900 10846 12104 13332 14493 14584 23772 24084 25786 25963 26145 28306 29514 30050 30060 33171 33416 33657 33951 34908 37715 37854 38088 38966 39148 40166 40633 40746 40939
105 8722 10244 12148 13029 16368 18186 19660 19830 21616 22256 22534 23100 23219 25473 26585 29858 32350 33305 34290 34356 34675 35297 37052 37144 37934 38201 39867 40270 40539 40781 40804 40944 40966
53 61 82 96 2665 6552 9517 15693 17214 17588 18347 19039 20679 21962 24255 25861 27117 27919 30691 36195 36379 37031 37309 37535 37793 38198 38212 38595 38808 38911 39474 39677 40135 40935
15 67 723 2962 4991 5285 11583 13398 16301 16338 20996 21510 25697 28214 29143 30539 30573 31108 32500 32506 32727 32755 36134 37226 37655 37799 39219 39626 39980 40093 40105 40628 40634 40816
18854 37884 40104 40772
35209 40379 40447 40508
3049 36078 39403 40402
19118 27981 35730 36649
20465 28570 39076 40910
24047 31275 39790 40126
31041 33526 34162 39092
1152 8976 24071 35698
3 27991 31485 40934
5245 20676 30579 38823
47 11196 38674 38894
14920 15270 16047 40928
23974 30146 39805 40911
8791 16641 25060 31681
1147 4233 34386 37802
58 5354 22265 41018
869 3078 39882 40730
1071 6322 9163 10642
7235 32596 35540 37487
26910 35537 40830 41035
81 11905 16179 19558
29 41 5161 12173
3043 5574 9993 26058
875 36935 39423 40956
3362 19166 20017 39729
12893 16403 33880 37115
9980 27100 28525 36786
3218 12776 40651 40703
7669 25783 32781 34504
25951 34595 39049 40597
11271 35112 35290 40600
5330 38324 40325 40986
58 24777 40560 40835
23895 25427 33552 37472
2811 4731 11601 39912
109 39021 40611 40754
79 15387 30999 40978
31162 34975 38844 39784
34891 37007 39433 40102
42 9072 21526 22610
20243 20499 24418 29056
7951 26469 29729 40956
6 10833 13188 15714
7910 20652 40574 40874
14586 24839 37804 40722
1103 11381 21050 30084
10 9032 20123 28528
19477 29966 37702 37766
131 31352 39069 40971
34 7368 17799 27467
16767 27584 32869 34769
31515 34543 36230 40752
15098 25451 26402 27629
149 10388 24558 40709
6997 7288 23995 29893
346 12245 13843 40402
である
データ処理装置。 - LDPC(Low Density Parity Check)符号の検査行列に基づき、情報ビットを、符号長が64800ビットで符号化率が11/30のLDPC符号に符号化する符号化ステップを備え、
前記LDPC符号は、情報ビットとパリティビットを含み、
前記検査行列は、前記情報ビットに対応する情報行列部と前記パリティビットに対応するパリティ行列部とを含み、
前記情報行列部は、検査行列初期値テーブルによって表され、
前記検査行列初期値テーブルは、前記情報行列部の1の要素の位置を360列ごとに表すテーブルであって、
3208 6587 9493 9539 12368 12501 14811 15784 17625 18654 18721 19471 19503 20079 20411 20876 21493 22083 22430 27275 29322 32758 33227 33347 33715 34472 34711 38450 39151 39709 39862 40093 40497 40912
42 1118 3086 5466 6379 8483 9051 9330 13250 13898 14055 15033 18094 21429 22652 25251 28709 29909 30233 30472 30635 31367 32603 33614 33708 36404 36530 37039 37782 38115 38307 40225 40597 40822
5939 11990 15027 15162 16503 17171 17806 17902 18031 18077 21216 22134 22660 24170 28558 29364 30003 31128 32674 33103 33361 34196 34435 34626 34991 35974 36022 37459 38170 38709 39774 39960 40571 40858
63 3871 9148 10328 12830 12912 18361 18839 20122 23126 23795 28612 30350 32251 32750 33762 33866 36188 36979 37562 37836 38536 38705 38829 39609 40219 40324 40336 40367 40638 40699 40809 40987 41019
36 70 104 3737 5028 19023 19575 19746 23840 24611 24661 26741 27749 30359 31027 31509 32621 32859 33830 34619 35281 35479 36796 37344 37555 38993 39088 39445 40276 40299 40762 40771 40835 40967
113 2313 4411 5858 9909 10426 18955 21663 21884 24105 24472 26944 27826 28574 28689 29579 30903 32352 33334 36408 36795 36805 37112 37121 38731 39080 39739 40007 40326 40356 40472 40476 40622 40778
54 84 3529 5202 9825 9900 10846 12104 13332 14493 14584 23772 24084 25786 25963 26145 28306 29514 30050 30060 33171 33416 33657 33951 34908 37715 37854 38088 38966 39148 40166 40633 40746 40939
105 8722 10244 12148 13029 16368 18186 19660 19830 21616 22256 22534 23100 23219 25473 26585 29858 32350 33305 34290 34356 34675 35297 37052 37144 37934 38201 39867 40270 40539 40781 40804 40944 40966
53 61 82 96 2665 6552 9517 15693 17214 17588 18347 19039 20679 21962 24255 25861 27117 27919 30691 36195 36379 37031 37309 37535 37793 38198 38212 38595 38808 38911 39474 39677 40135 40935
15 67 723 2962 4991 5285 11583 13398 16301 16338 20996 21510 25697 28214 29143 30539 30573 31108 32500 32506 32727 32755 36134 37226 37655 37799 39219 39626 39980 40093 40105 40628 40634 40816
18854 37884 40104 40772
35209 40379 40447 40508
3049 36078 39403 40402
19118 27981 35730 36649
20465 28570 39076 40910
24047 31275 39790 40126
31041 33526 34162 39092
1152 8976 24071 35698
3 27991 31485 40934
5245 20676 30579 38823
47 11196 38674 38894
14920 15270 16047 40928
23974 30146 39805 40911
8791 16641 25060 31681
1147 4233 34386 37802
58 5354 22265 41018
869 3078 39882 40730
1071 6322 9163 10642
7235 32596 35540 37487
26910 35537 40830 41035
81 11905 16179 19558
29 41 5161 12173
3043 5574 9993 26058
875 36935 39423 40956
3362 19166 20017 39729
12893 16403 33880 37115
9980 27100 28525 36786
3218 12776 40651 40703
7669 25783 32781 34504
25951 34595 39049 40597
11271 35112 35290 40600
5330 38324 40325 40986
58 24777 40560 40835
23895 25427 33552 37472
2811 4731 11601 39912
109 39021 40611 40754
79 15387 30999 40978
31162 34975 38844 39784
34891 37007 39433 40102
42 9072 21526 22610
20243 20499 24418 29056
7951 26469 29729 40956
6 10833 13188 15714
7910 20652 40574 40874
14586 24839 37804 40722
1103 11381 21050 30084
10 9032 20123 28528
19477 29966 37702 37766
131 31352 39069 40971
34 7368 17799 27467
16767 27584 32869 34769
31515 34543 36230 40752
15098 25451 26402 27629
149 10388 24558 40709
6997 7288 23995 29893
346 12245 13843 40402
である
データ処理方法。 - LDPC(Low Density Parity Check)符号の検査行列に基づき、符号長が64800ビットで符号化率が11/30のLDPC符号を復号する復号部を備え、
前記LDPC符号は、情報ビットとパリティビットを含み、
前記検査行列は、前記情報ビットに対応する情報行列部と前記パリティビットに対応するパリティ行列部とを含み、
前記情報行列部は、検査行列初期値テーブルによって表され、
前記検査行列初期値テーブルは、前記情報行列部の1の要素の位置を360列ごとに表すテーブルであって、
3208 6587 9493 9539 12368 12501 14811 15784 17625 18654 18721 19471 19503 20079 20411 20876 21493 22083 22430 27275 29322 32758 33227 33347 33715 34472 34711 38450 39151 39709 39862 40093 40497 40912
42 1118 3086 5466 6379 8483 9051 9330 13250 13898 14055 15033 18094 21429 22652 25251 28709 29909 30233 30472 30635 31367 32603 33614 33708 36404 36530 37039 37782 38115 38307 40225 40597 40822
5939 11990 15027 15162 16503 17171 17806 17902 18031 18077 21216 22134 22660 24170 28558 29364 30003 31128 32674 33103 33361 34196 34435 34626 34991 35974 36022 37459 38170 38709 39774 39960 40571 40858
63 3871 9148 10328 12830 12912 18361 18839 20122 23126 23795 28612 30350 32251 32750 33762 33866 36188 36979 37562 37836 38536 38705 38829 39609 40219 40324 40336 40367 40638 40699 40809 40987 41019
36 70 104 3737 5028 19023 19575 19746 23840 24611 24661 26741 27749 30359 31027 31509 32621 32859 33830 34619 35281 35479 36796 37344 37555 38993 39088 39445 40276 40299 40762 40771 40835 40967
113 2313 4411 5858 9909 10426 18955 21663 21884 24105 24472 26944 27826 28574 28689 29579 30903 32352 33334 36408 36795 36805 37112 37121 38731 39080 39739 40007 40326 40356 40472 40476 40622 40778
54 84 3529 5202 9825 9900 10846 12104 13332 14493 14584 23772 24084 25786 25963 26145 28306 29514 30050 30060 33171 33416 33657 33951 34908 37715 37854 38088 38966 39148 40166 40633 40746 40939
105 8722 10244 12148 13029 16368 18186 19660 19830 21616 22256 22534 23100 23219 25473 26585 29858 32350 33305 34290 34356 34675 35297 37052 37144 37934 38201 39867 40270 40539 40781 40804 40944 40966
53 61 82 96 2665 6552 9517 15693 17214 17588 18347 19039 20679 21962 24255 25861 27117 27919 30691 36195 36379 37031 37309 37535 37793 38198 38212 38595 38808 38911 39474 39677 40135 40935
15 67 723 2962 4991 5285 11583 13398 16301 16338 20996 21510 25697 28214 29143 30539 30573 31108 32500 32506 32727 32755 36134 37226 37655 37799 39219 39626 39980 40093 40105 40628 40634 40816
18854 37884 40104 40772
35209 40379 40447 40508
3049 36078 39403 40402
19118 27981 35730 36649
20465 28570 39076 40910
24047 31275 39790 40126
31041 33526 34162 39092
1152 8976 24071 35698
3 27991 31485 40934
5245 20676 30579 38823
47 11196 38674 38894
14920 15270 16047 40928
23974 30146 39805 40911
8791 16641 25060 31681
1147 4233 34386 37802
58 5354 22265 41018
869 3078 39882 40730
1071 6322 9163 10642
7235 32596 35540 37487
26910 35537 40830 41035
81 11905 16179 19558
29 41 5161 12173
3043 5574 9993 26058
875 36935 39423 40956
3362 19166 20017 39729
12893 16403 33880 37115
9980 27100 28525 36786
3218 12776 40651 40703
7669 25783 32781 34504
25951 34595 39049 40597
11271 35112 35290 40600
5330 38324 40325 40986
58 24777 40560 40835
23895 25427 33552 37472
2811 4731 11601 39912
109 39021 40611 40754
79 15387 30999 40978
31162 34975 38844 39784
34891 37007 39433 40102
42 9072 21526 22610
20243 20499 24418 29056
7951 26469 29729 40956
6 10833 13188 15714
7910 20652 40574 40874
14586 24839 37804 40722
1103 11381 21050 30084
10 9032 20123 28528
19477 29966 37702 37766
131 31352 39069 40971
34 7368 17799 27467
16767 27584 32869 34769
31515 34543 36230 40752
15098 25451 26402 27629
149 10388 24558 40709
6997 7288 23995 29893
346 12245 13843 40402
である
データ処理装置。 - LDPC(Low Density Parity Check)符号の検査行列に基づき、符号長が64800ビットで符号化率が11/30のLDPC符号を復号する復号ステップを備え、
前記LDPC符号は、情報ビットとパリティビットを含み、
前記検査行列は、前記情報ビットに対応する情報行列部と前記パリティビットに対応するパリティ行列部とを含み、
前記情報行列部は、検査行列初期値テーブルによって表され、
前記検査行列初期値テーブルは、前記情報行列部の1の要素の位置を360列ごとに表すテーブルであって、
3208 6587 9493 9539 12368 12501 14811 15784 17625 18654 18721 19471 19503 20079 20411 20876 21493 22083 22430 27275 29322 32758 33227 33347 33715 34472 34711 38450 39151 39709 39862 40093 40497 40912
42 1118 3086 5466 6379 8483 9051 9330 13250 13898 14055 15033 18094 21429 22652 25251 28709 29909 30233 30472 30635 31367 32603 33614 33708 36404 36530 37039 37782 38115 38307 40225 40597 40822
5939 11990 15027 15162 16503 17171 17806 17902 18031 18077 21216 22134 22660 24170 28558 29364 30003 31128 32674 33103 33361 34196 34435 34626 34991 35974 36022 37459 38170 38709 39774 39960 40571 40858
63 3871 9148 10328 12830 12912 18361 18839 20122 23126 23795 28612 30350 32251 32750 33762 33866 36188 36979 37562 37836 38536 38705 38829 39609 40219 40324 40336 40367 40638 40699 40809 40987 41019
36 70 104 3737 5028 19023 19575 19746 23840 24611 24661 26741 27749 30359 31027 31509 32621 32859 33830 34619 35281 35479 36796 37344 37555 38993 39088 39445 40276 40299 40762 40771 40835 40967
113 2313 4411 5858 9909 10426 18955 21663 21884 24105 24472 26944 27826 28574 28689 29579 30903 32352 33334 36408 36795 36805 37112 37121 38731 39080 39739 40007 40326 40356 40472 40476 40622 40778
54 84 3529 5202 9825 9900 10846 12104 13332 14493 14584 23772 24084 25786 25963 26145 28306 29514 30050 30060 33171 33416 33657 33951 34908 37715 37854 38088 38966 39148 40166 40633 40746 40939
105 8722 10244 12148 13029 16368 18186 19660 19830 21616 22256 22534 23100 23219 25473 26585 29858 32350 33305 34290 34356 34675 35297 37052 37144 37934 38201 39867 40270 40539 40781 40804 40944 40966
53 61 82 96 2665 6552 9517 15693 17214 17588 18347 19039 20679 21962 24255 25861 27117 27919 30691 36195 36379 37031 37309 37535 37793 38198 38212 38595 38808 38911 39474 39677 40135 40935
15 67 723 2962 4991 5285 11583 13398 16301 16338 20996 21510 25697 28214 29143 30539 30573 31108 32500 32506 32727 32755 36134 37226 37655 37799 39219 39626 39980 40093 40105 40628 40634 40816
18854 37884 40104 40772
35209 40379 40447 40508
3049 36078 39403 40402
19118 27981 35730 36649
20465 28570 39076 40910
24047 31275 39790 40126
31041 33526 34162 39092
1152 8976 24071 35698
3 27991 31485 40934
5245 20676 30579 38823
47 11196 38674 38894
14920 15270 16047 40928
23974 30146 39805 40911
8791 16641 25060 31681
1147 4233 34386 37802
58 5354 22265 41018
869 3078 39882 40730
1071 6322 9163 10642
7235 32596 35540 37487
26910 35537 40830 41035
81 11905 16179 19558
29 41 5161 12173
3043 5574 9993 26058
875 36935 39423 40956
3362 19166 20017 39729
12893 16403 33880 37115
9980 27100 28525 36786
3218 12776 40651 40703
7669 25783 32781 34504
25951 34595 39049 40597
11271 35112 35290 40600
5330 38324 40325 40986
58 24777 40560 40835
23895 25427 33552 37472
2811 4731 11601 39912
109 39021 40611 40754
79 15387 30999 40978
31162 34975 38844 39784
34891 37007 39433 40102
42 9072 21526 22610
20243 20499 24418 29056
7951 26469 29729 40956
6 10833 13188 15714
7910 20652 40574 40874
14586 24839 37804 40722
1103 11381 21050 30084
10 9032 20123 28528
19477 29966 37702 37766
131 31352 39069 40971
34 7368 17799 27467
16767 27584 32869 34769
31515 34543 36230 40752
15098 25451 26402 27629
149 10388 24558 40709
6997 7288 23995 29893
346 12245 13843 40402
である
データ処理方法。
Priority Applications (8)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US14/760,622 US20150358032A1 (en) | 2013-02-08 | 2014-01-27 | Data processing device and data processing method |
CN201480007106.2A CN104969478B (zh) | 2013-02-08 | 2014-01-27 | 数据处理装置以及数据处理方法 |
CA2899820A CA2899820C (en) | 2013-02-08 | 2014-01-27 | Data processing device and data processing method |
KR1020157020208A KR102091562B1 (ko) | 2013-02-08 | 2014-01-27 | 데이터 처리 장치, 및 데이터 처리 방법 |
MX2015009838A MX2015009838A (es) | 2013-02-08 | 2014-01-27 | Dispositivo para el procesamiento de datos y metodo para el procesamiento de datos. |
JP2014560719A JPWO2014123015A1 (ja) | 2013-02-08 | 2014-01-27 | データ処理装置、及びデータ処理方法 |
RU2015132106A RU2654132C2 (ru) | 2013-02-08 | 2014-01-27 | Устройство обработки данных и способ обработки данных |
EP14749107.0A EP2955853A4 (en) | 2013-02-08 | 2014-01-27 | DATA PROCESSING DEVICE AND DATA PROCESSING METHOD |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
JP2013-023880 | 2013-02-08 | ||
JP2013023880 | 2013-02-08 |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2014123015A1 true WO2014123015A1 (ja) | 2014-08-14 |
Family
ID=51299612
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/JP2014/051621 WO2014123015A1 (ja) | 2013-02-08 | 2014-01-27 | データ処理装置、及びデータ処理方法 |
Country Status (9)
Country | Link |
---|---|
US (1) | US20150358032A1 (ja) |
EP (1) | EP2955853A4 (ja) |
JP (1) | JPWO2014123015A1 (ja) |
KR (1) | KR102091562B1 (ja) |
CN (1) | CN104969478B (ja) |
CA (1) | CA2899820C (ja) |
MX (1) | MX2015009838A (ja) |
RU (1) | RU2654132C2 (ja) |
WO (1) | WO2014123015A1 (ja) |
Families Citing this family (11)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2014167861A1 (ja) * | 2013-04-12 | 2014-10-16 | パナソニック インテレクチュアル プロパティ コーポレーション オブ アメリカ | 送信方法 |
CN105556853A (zh) * | 2013-09-20 | 2016-05-04 | 索尼公司 | 数据处理装置和数据处理方法 |
JP6885029B2 (ja) | 2016-11-18 | 2021-06-09 | ソニーグループ株式会社 | 送信装置、及び、送信方法 |
JP6885028B2 (ja) * | 2016-11-18 | 2021-06-09 | ソニーグループ株式会社 | 送信装置、及び、送信方法 |
JP6885030B2 (ja) * | 2016-11-18 | 2021-06-09 | ソニーグループ株式会社 | 送信装置、及び、送信方法 |
JP6885027B2 (ja) | 2016-11-18 | 2021-06-09 | ソニーグループ株式会社 | 送信装置、及び、送信方法 |
JP6930376B2 (ja) * | 2017-10-31 | 2021-09-01 | ソニーグループ株式会社 | 送信装置及び送信方法 |
JP6930374B2 (ja) * | 2017-10-31 | 2021-09-01 | ソニーグループ株式会社 | 送信装置及び送信方法 |
JP6930375B2 (ja) * | 2017-10-31 | 2021-09-01 | ソニーグループ株式会社 | 送信装置及び送信方法 |
JP6930377B2 (ja) | 2017-10-31 | 2021-09-01 | ソニーグループ株式会社 | 送信装置及び送信方法 |
CN110830048B (zh) * | 2019-11-14 | 2021-10-12 | 天津大学 | 基于奇偶校验矩阵分解构造全分集ldpc码的纠错方法 |
Citations (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2005136990A (ja) * | 2003-10-27 | 2005-05-26 | Directv Group Inc | 減少されたメモリの低密度パリティチェック(ldpc)コードを提供する方法および装置 |
JP4224777B2 (ja) | 2003-05-13 | 2009-02-18 | ソニー株式会社 | 復号方法および復号装置、並びにプログラム |
WO2009069628A1 (ja) * | 2007-11-26 | 2009-06-04 | Sony Corporation | データ処理装置、データ処理方法、及びプログラム |
WO2011105287A1 (ja) * | 2010-02-26 | 2011-09-01 | ソニー株式会社 | データ処理装置、及びデータ処理方法 |
JP2012517138A (ja) * | 2009-02-02 | 2012-07-26 | テレフオンアクチーボラゲット エル エム エリクソン(パブル) | 削除訂正畳み込み符号および畳み込みターボ符号のための符号化法および復号法 |
JP2012147197A (ja) * | 2011-01-11 | 2012-08-02 | Panasonic Corp | 通信装置、通信方法、及び通信プログラム |
Family Cites Families (11)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
KR20060016059A (ko) * | 2004-08-16 | 2006-02-21 | 삼성전자주식회사 | 가변 블록 길이를 가지는 블록 저밀도 패리티 검사 부호부호화/복호 장치 및 방법 |
EP1800408A1 (en) * | 2004-10-01 | 2007-06-27 | Thomson Licensing | A low density parity check (ldpc) decoder |
US7953047B2 (en) * | 2005-01-24 | 2011-05-31 | Qualcomm Incorporated | Parser for multiple data streams in a communication system |
CN1976238A (zh) * | 2006-12-21 | 2007-06-06 | 复旦大学 | 基于块填充算法的准循环低密度奇偶校验码的构造方法 |
WO2008092040A2 (en) * | 2007-01-24 | 2008-07-31 | Qualcomm Incorporated | Ldpc encoding and decoding of packets of variable sizes |
DK2056510T3 (da) * | 2007-10-30 | 2013-05-21 | Sony Corp | Anordning og fremgangsmåde til databehandling |
TWI497920B (zh) * | 2007-11-26 | 2015-08-21 | Sony Corp | Data processing device and data processing method |
TWI538415B (zh) * | 2007-11-26 | 2016-06-11 | Sony Corp | Data processing device and data processing method |
AU2008330816B2 (en) * | 2007-11-26 | 2013-01-17 | Sony Corporation | Data process device, data process method, coding device, coding method |
PL2093887T3 (pl) * | 2008-02-18 | 2014-01-31 | Samsung Electronics Co Ltd | Urządzenie do kodowania i dekodowania kanału w systemie komunikacyjnym z wykorzystaniem kodów kontroli bitów parzystości o niskiej gęstości |
MX2015009839A (es) * | 2013-02-08 | 2015-12-01 | Sony Corp | Dispositivo de procesamiento de datos y metodo de procesamiento de datos. |
-
2014
- 2014-01-27 JP JP2014560719A patent/JPWO2014123015A1/ja active Pending
- 2014-01-27 MX MX2015009838A patent/MX2015009838A/es not_active Application Discontinuation
- 2014-01-27 EP EP14749107.0A patent/EP2955853A4/en not_active Withdrawn
- 2014-01-27 US US14/760,622 patent/US20150358032A1/en not_active Abandoned
- 2014-01-27 RU RU2015132106A patent/RU2654132C2/ru active
- 2014-01-27 CN CN201480007106.2A patent/CN104969478B/zh active Active
- 2014-01-27 CA CA2899820A patent/CA2899820C/en active Active
- 2014-01-27 WO PCT/JP2014/051621 patent/WO2014123015A1/ja active Application Filing
- 2014-01-27 KR KR1020157020208A patent/KR102091562B1/ko active IP Right Grant
Patent Citations (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP4224777B2 (ja) | 2003-05-13 | 2009-02-18 | ソニー株式会社 | 復号方法および復号装置、並びにプログラム |
JP2005136990A (ja) * | 2003-10-27 | 2005-05-26 | Directv Group Inc | 減少されたメモリの低密度パリティチェック(ldpc)コードを提供する方法および装置 |
WO2009069628A1 (ja) * | 2007-11-26 | 2009-06-04 | Sony Corporation | データ処理装置、データ処理方法、及びプログラム |
JP2012517138A (ja) * | 2009-02-02 | 2012-07-26 | テレフオンアクチーボラゲット エル エム エリクソン(パブル) | 削除訂正畳み込み符号および畳み込みターボ符号のための符号化法および復号法 |
WO2011105287A1 (ja) * | 2010-02-26 | 2011-09-01 | ソニー株式会社 | データ処理装置、及びデータ処理方法 |
JP2012147197A (ja) * | 2011-01-11 | 2012-08-02 | Panasonic Corp | 通信装置、通信方法、及び通信プログラム |
Non-Patent Citations (5)
Title |
---|
DIGITAL VIDEO BROADCASTING (DVB);: "Frame structure channel coding and modulation for a second generation digital terrestrial television broadcasting system (DVB-T2)", ETSI EN 302 755, V1. 3.1, April 2012 (2012-04-01), pages 1,40 - 45,130-138, XP055273203 * |
DVB-S.2: ETSI EN 302 307 V1.2.1, August 2009 (2009-08-01) |
H. JIN; A. KHANDEKAR; R. J. MCELIECE: "Irregular Repeat-Accumulate Codes", PROCEEDINGS OF 2ND INTERNATIONAL SYMPOSIUM ON TURBO CODES AND RELATED TOPICS, September 2000 (2000-09-01), pages 1 - 8, XP002325752 |
S.Y.CHUNG; G.D.FOMEY; T.J.RICHARDSON; R.URBANKE: "On the Design of Low-Density Parity-Check Codes within 0.0045 dB of the Shannon Limit", IEEE COMMUNICATIONS LEGGERS, vol. 5, no. 2, February 2001 (2001-02-01), XP011083973, DOI: doi:10.1109/4234.905935 |
See also references of EP2955853A4 |
Also Published As
Publication number | Publication date |
---|---|
CN104969478B (zh) | 2019-05-07 |
CA2899820A1 (en) | 2014-08-14 |
RU2015132106A (ru) | 2017-02-07 |
RU2654132C2 (ru) | 2018-05-16 |
EP2955853A1 (en) | 2015-12-16 |
MX2015009838A (es) | 2015-10-14 |
KR20150117651A (ko) | 2015-10-20 |
JPWO2014123015A1 (ja) | 2017-02-02 |
US20150358032A1 (en) | 2015-12-10 |
KR102091562B1 (ko) | 2020-04-14 |
CN104969478A (zh) | 2015-10-07 |
EP2955853A4 (en) | 2016-08-24 |
CA2899820C (en) | 2023-01-24 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
JP5630278B2 (ja) | データ処理装置、及びデータ処理方法 | |
JP6267655B2 (ja) | データ処理装置、及びデータ処理方法 | |
JP5601182B2 (ja) | データ処理装置、及びデータ処理方法 | |
JP5664919B2 (ja) | データ処理装置、及び、データ処理方法 | |
JP5648852B2 (ja) | データ処理装置、及び、データ処理方法 | |
WO2014123018A1 (ja) | データ処理装置、及びデータ処理方法 | |
WO2014123017A1 (ja) | データ処理装置、及びデータ処理方法 | |
JP6233667B2 (ja) | データ処理装置、及びデータ処理方法 | |
WO2014123015A1 (ja) | データ処理装置、及びデータ処理方法 | |
WO2014123014A1 (ja) | データ処理装置、及びデータ処理方法 | |
JP6364416B2 (ja) | データ処理装置、データ処理方法、及び、記録媒体 | |
JP6364417B2 (ja) | データ処理装置、データ処理方法、及び、記録媒体 | |
JP6229900B2 (ja) | データ処理装置、及びデータ処理方法 | |
JP6229902B2 (ja) | データ処理装置、及びデータ処理方法 | |
JP6229899B2 (ja) | データ処理装置、及びデータ処理方法 | |
WO2014123016A1 (ja) | データ処理装置、及びデータ処理方法 | |
JP6229901B2 (ja) | データ処理装置、及びデータ処理方法 | |
WO2015041072A1 (ja) | データ処理装置、及びデータ処理方法 | |
WO2015045912A1 (ja) | データ処理装置、及びデータ処理方法 | |
WO2015041075A1 (ja) | データ処理装置、及びデータ処理方法 |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
121 | Ep: the epo has been informed by wipo that ep was designated in this application |
Ref document number: 14749107 Country of ref document: EP Kind code of ref document: A1 |
|
ENP | Entry into the national phase |
Ref document number: 2014560719 Country of ref document: JP Kind code of ref document: A |
|
WWE | Wipo information: entry into national phase |
Ref document number: 14760622 Country of ref document: US |
|
ENP | Entry into the national phase |
Ref document number: 20157020208 Country of ref document: KR Kind code of ref document: A |
|
REEP | Request for entry into the european phase |
Ref document number: 2014749107 Country of ref document: EP |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2014749107 Country of ref document: EP |
|
ENP | Entry into the national phase |
Ref document number: 2899820 Country of ref document: CA |
|
WWE | Wipo information: entry into national phase |
Ref document number: MX/A/2015/009838 Country of ref document: MX |
|
ENP | Entry into the national phase |
Ref document number: 2015132106 Country of ref document: RU Kind code of ref document: A |
|
NENP | Non-entry into the national phase |
Ref country code: DE |