Transmission / reception system and transmission / reception method

Abstract

To secure excellent communication quality in data transmission using an LDPC code.SOLUTION: There is decoded an LDPC code obtained by performing LDPC coding on the basis of a check matrix where a code length N is 69120 bits and a coding rate r is a 10 / 16 LDPC code. The LDPC code includes information bits and parity bits, and the check matrix includes an information matrix corresponding to the information bits and a parity matrix corresponding to the parity bits. The information matrix is represented by a check matrix initial value table, and the check matrix initial value table is a table representing a position of one element of the information matrix for every 360 columns that is a predetermined table. The present technique can be applied to, for example, data transmission and the like using an LDPC code.SELECTED DRAWING: Figure 21

Description

[Technical field]

[0001] This technology is Transmission / reception system and transmission / reception method To ensure good communication quality, particularly in data transmission using LDPC codes, Transmission / reception system and transmission / reception method Regarding. [Background technology]

[0002] Low Density Parity Check (LDPC) codes have high error correction capabilities, and in recent years have been widely adopted in transmission methods for digital broadcasting, such as DVB (Digital Video Broadcasting)-S.2, DVB-T.2, and DVB-C.2 in Europe, and ATSC (Advanced Television Systems Committee) 3.0 in the United States (see, for example, Non-Patent Document 1).

[0003] Recent research has shown that LDPC codes, like turbo codes, can achieve performance approaching the Shannon limit as the code length is increased. In addition, LDPC codes have the property that the minimum distance is proportional to the code length, and therefore have good block error probability characteristics. Another advantage is that the so-called error floor phenomenon observed in the decoding characteristics of turbo codes and the like hardly occurs. [Prior art documents] [Non-patent literature]

[0004] [Non-Patent Document 1] ATSC Standard:Physical Layer Protocol(A / 322), 7 September 2016 Summary of the Invention [Problem to be solved by the invention]

[0005] In data transmission using an LDPC code, for example, the LDPC code is made into a symbol (symbolized) for orthogonal modulation (digital modulation) such as QPSK (Quadrature Phase Shift Keying), and the symbol is mapped to a signal point of the orthogonal modulation and transmitted.

[0006] Data transmission using LDPC codes as described above is becoming more widespread worldwide, and there is a demand to ensure good communication (transmission) quality.

[0007] The present technology has been made in view of these circumstances, and makes it possible to ensure good communication quality in data transmission using LDPC codes. [Means for solving the problem]

[0008] A first transmission device / method of the present technology includes a coding unit / step of performing LDPC coding based on a parity check matrix of an LDPC code having a code length N of 69120 bits and a coding rate r of 9 / 16, the LDPC code including information bits and parity bits, the parity check matrix including an information matrix portion corresponding to the information bits and a parity matrix portion corresponding to the parity bits, the information matrix portion being represented by a parity check matrix initial value table, the parity check matrix initial value table being a table representing a position of an element of the information matrix portion for every 360 columns, 110 3064 6740 7801 10228 13445 17599 17891 17979 18044 19923 21848 23262 25585 25968 30124 1578 8914 9141 9731 10605 11690 12824 18127 18458 24648 24950 25150 26323 26514 27385 27460 3054 3640 3923 7332 10770 12215 14455 14849 15619 20870 22033 26427 28067 28560 29777 29780 1348 4248 5479 8902 9101 9356 10581 11614 12813 21554 22985 23701 24099 24575 24786 27370 3266 8358 16544 16689 16693 16823 17565 18543 19229 21121 23799 24981 25423 28997 29808 30202 320 1198 1549 5407 6080 8542 9352 12418 13391 14736 15012 18328 19398 23391 28117 28793 2114 3294 3770 5225 5556 5991 7075 7889 11145 11386 16561 18956 19034 23605 26085 27132 3623 4011 4225 5249 5489 5711 7240 9831 10458 14697 15420 16015 17782 23244 24215 24386 2624 2750 3871 8247 11135 13702 19290 22209 22975 23811 23931 24872 25154 25165 28375 30200 1060 1240 2040 2382 7723 9165 9656 10398 14517 16653 21241 22348 23476 27203 28443 28445 1070 1233 3416 6633 11736 12808 15454 16505 18720 20162 21425 21874 26069 26855 27292 27978 420 5524 10279 11218 12500 12913 15389 15824 19414 19588 21138 23846 26621 27907 28594 28781 151 1356 2323 3289 4501 10573 13667 14642 16127 17040 17475 18055 24061 26204 26567 29277 1410 3656 4080 6963 8834 10527 17490 17584 18065 19234 22211 22338 23746 24662 29863 30227 1924 2694 3285 8761 9693 11005 17592 21259 21322 21546 21555 24044 24173 26988 27640 28506 1069 6483 6554 9027 11655 12453 16595 17877 18350 18995 21304 21442 23836 25468 28820 29453 149 1621 2199 3141 8403 11974 14969 16197 18844 21027 21921 22266 22399 22691 25727 27721 3689 4839 7971 8419 10500 12308 13435 14487 16502 16622 17229 17468 22710 23904 25074 28508 1270 7007 9830 12698 14204 16075 17613 19391 21362 21726 21816 23014 23651 26419 26748 27195 96 1953 2456 2712 2809 3196 5939 10634 21828 24606 26169 26801 27391 28578 29725 30142 832 3394 4145 5375 6199 7122 7405 7706 10136 10792 15058 15860 21881 23908 25174 25837 730 1735 2917 4106 5004 5849 8194 8943 9136 17599 18456 20191 22798 27935 29559 6238 6776 6799 9142 11199 11867 15979 16830 18110 18396 21897 22590 24020 29578 29644 407 2138 4493 7979 8225 9467 11956 12940 15566 15809 16058 18211 22073 28314 28713 957 1552 1869 4388 7642 7904 13408 13453 16431 19327 21444 22188 25719 28511 29192 3617 8663 22378 28704 8598 12647 19278 22416 15176 16377 16644 22732 12463 12711 18341 11079 13446 29071 2446 4068 8542 10838 11660 27428 16403 21750 23199 9181 16572 18381 7227 18770 21858 7379 9316 16247 8923 14861 29618 6531 24652 26817 5564 8875 18025 8019 14642 21169 16683 17257 29298 4078 6023 8853 13942 15217 15501 7484 8302 27199 671 14966 20886 1240 11897 14925 12800 25474 28603 3576 5308 11168 13430 15265 18232 3439 5544 21849 3257 16996 23750 1865 14153 22669 7640 15098 17364 6137 19401 24836 5986 9035 11444 4799 20865 29150 8360 23554 29246 2002 18215 22258 9679 11951 26583 2844 12330 18156 3744 6949 14754 8262 10288 27142 1087 16563 22815 1328 13273 21749 2092 9191 28045 3250 10549 18252 13975 15172 17135 2520 26310 28787 4395 8961 26753 6413 15437 19520 5809 10936 17089 1670 13574 25125 5865 6175 21175 8391 11680 22660 5485 11743 15165 21021 21798 30209 12519 13402 26300 3472 25935 26412 3377 7398 28867 2430 24650 29426 3364 13409 22914 6838 13491 16229 18393 20764 28078 289 20279 24906 4732 6162 13569 8993 17053 29387 2210 5024 24030 21 22976 24053 12359 15499 28251 4640 11480 24391 1083 7965 16573 13116 23916 24421 10129 16284 23855 1758 3843 21163 5626 13543 26708 14918 17713 21718 13556 20450 24679 3911 16778 29952 11735 13710 22611 5347 21681 22906 6912 12045 15866 713 15429 23281 7133 17440 28982 12355 17564 28059 7658 11158 29885 17610 18755 28852 7680 16212 30111 8812 10144 15718 The transmitting device / method is as follows.

[0009] In the first transmission device / method, LDPC coding is performed based on a check matrix of an LDPC code having a code length N of 69120 bits and a coding rate r of 9 / 16. The LDPC code includes information bits and parity bits, the 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 represented by a check matrix initial value table, and the check matrix initial value table is a table representing the position of an element of 1 in the information matrix portion for every 360 columns, 110 3064 6740 7801 10228 13445 17599 17891 17979 18044 19923 21848 23262 25585 25968 30124 1578 8914 9141 9731 10605 11690 12824 18127 18458 24648 24950 25150 26323 26514 27385 27460 3054 3640 3923 7332 10770 12215 14455 14849 15619 20870 22033 26427 28067 28560 29777 29780 1348 4248 5479 8902 9101 9356 10581 11614 12813 21554 22985 23701 24099 24575 24786 27370 3266 8358 16544 16689 16693 16823 17565 18543 19229 21121 23799 24981 25423 28997 29808 30202 320 1198 1549 5407 6080 8542 9352 12418 13391 14736 15012 18328 19398 23391 28117 28793 2114 3294 3770 5225 5556 5991 7075 7889 11145 11386 16561 18956 19034 23605 26085 27132 3623 4011 4225 5249 5489 5711 7240 9831 10458 14697 15420 16015 17782 23244 24215 24386 2624 2750 3871 8247 11135 13702 19290 22209 22975 23811 23931 24872 25154 25165 28375 30200 1060 1240 2040 2382 7723 9165 9656 10398 14517 16653 21241 22348 23476 27203 28443 28445 1070 1233 3416 6633 11736 12808 15454 16505 18720 20162 21425 21874 26069 26855 27292 27978 420 5524 10279 11218 12500 12913 15389 15824 19414 19588 21138 23846 26621 27907 28594 28781 151 1356 2323 3289 4501 10573 13667 14642 16127 17040 17475 18055 24061 26204 26567 29277 1410 3656 4080 6963 8834 10527 17490 17584 18065 19234 22211 22338 23746 24662 29863 30227 1924 2694 3285 8761 9693 11005 17592 21259 21322 21546 21555 24044 24173 26988 27640 28506 1069 6483 6554 9027 11655 12453 16595 17877 18350 18995 21304 21442 23836 25468 28820 29453 149 1621 2199 3141 8403 11974 14969 16197 18844 21027 21921 22266 22399 22691 25727 27721 3689 4839 7971 8419 10500 12308 13435 14487 16502 16622 17229 17468 22710 23904 25074 28508 1270 7007 9830 12698 14204 16075 17613 19391 21362 21726 21816 23014 23651 26419 26748 27195 96 1953 2456 2712 2809 3196 5939 10634 21828 24606 26169 26801 27391 28578 29725 30142 832 3394 4145 5375 6199 7122 7405 7706 10136 10792 15058 15860 21881 23908 25174 25837 730 1735 2917 4106 5004 5849 8194 8943 9136 17599 18456 20191 22798 27935 29559 6238 6776 6799 9142 11199 11867 15979 16830 18110 18396 21897 22590 24020 29578 29644 407 2138 4493 7979 8225 9467 11956 12940 15566 15809 16058 18211 22073 28314 28713 957 1552 1869 4388 7642 7904 13408 13453 16431 19327 21444 22188 25719 28511 29192 3617 8663 22378 28704 8598 12647 19278 22416 15176 16377 16644 22732 12463 12711 18341 11079 13446 29071 2446 4068 8542 10838 11660 27428 16403 21750 23199 9181 16572 18381 7227 18770 21858 7379 9316 16247 8923 14861 29618 6531 24652 26817 5564 8875 18025 8019 14642 21169 16683 17257 29298 4078 6023 8853 13942 15217 15501 7484 8302 27199 671 14966 20886 1240 11897 14925 12800 25474 28603 3576 5308 11168 13430 15265 18232 3439 5544 21849 3257 16996 23750 1865 14153 22669 7640 15098 17364 6137 19401 24836 5986 9035 11444 4799 20865 29150 8360 23554 29246 2002 18215 22258 9679 11951 26583 2844 12330 18156 3744 6949 14754 8262 10288 27142 1087 16563 22815 1328 13273 21749 2092 9191 28045 3250 10549 18252 13975 15172 17135 2520 26310 28787 4395 8961 26753 6413 15437 19520 5809 10936 17089 1670 13574 25125 5865 6175 21175 8391 11680 22660 5485 11743 15165 21021 21798 30209 12519 13402 26300 3472 25935 26412 3377 7398 28867 2430 24650 29426 3364 13409 22914 6838 13491 16229 18393 20764 28078 289 20279 24906 4732 6162 13569 8993 17053 29387 2210 5024 24030 21 22976 24053 12359 15499 28251 4640 11480 24391 1083 7965 16573 13116 23916 24421 10129 16284 23855 1758 3843 21163 5626 13543 26708 14918 17713 21718 13556 20450 24679 3911 16778 29952 11735 13710 22611 5347 21681 22906 6912 12045 15866 713 15429 23281 7133 17440 28982 12355 17564 28059 7658 11158 29885 17610 18755 28852 7680 16212 30111 8812 10144 15718 It has become.

[0010] A first receiving device / method of the present technology includes a coding unit that performs LDPC coding based on a check matrix of an LDPC code having a code length N of 69120 bits and a coding rate r of 9 / 16, the LDPC code including information bits and parity bits, the check matrix including an information matrix portion corresponding to the information bits and a parity matrix portion corresponding to the parity bits, the information matrix portion being represented by a check matrix initial value table, the check matrix initial value table being a table representing a position of one element of the information matrix portion for every 360 columns, 110 3064 6740 7801 10228 13445 17599 17891 17979 18044 19923 21848 23262 25585 25968 30124 1578 8914 9141 9731 10605 11690 12824 18127 18458 24648 24950 25150 26323 26514 27385 27460 3054 3640 3923 7332 10770 12215 14455 14849 15619 20870 22033 26427 28067 28560 29777 29780 1348 4248 5479 8902 9101 9356 10581 11614 12813 21554 22985 23701 24099 24575 24786 27370 3266 8358 16544 16689 16693 16823 17565 18543 19229 21121 23799 24981 25423 28997 29808 30202 320 1198 1549 5407 6080 8542 9352 12418 13391 14736 15012 18328 19398 23391 28117 28793 2114 3294 3770 5225 5556 5991 7075 7889 11145 11386 16561 18956 19034 23605 26085 27132 3623 4011 4225 5249 5489 5711 7240 9831 10458 14697 15420 16015 17782 23244 24215 24386 2624 2750 3871 8247 11135 13702 19290 22209 22975 23811 23931 24872 25154 25165 28375 30200 1060 1240 2040 2382 7723 9165 9656 10398 14517 16653 21241 22348 23476 27203 28443 28445 1070 1233 3416 6633 11736 12808 15454 16505 18720 20162 21425 21874 26069 26855 27292 27978 420 5524 10279 11218 12500 12913 15389 15824 19414 19588 21138 23846 26621 27907 28594 28781 151 1356 2323 3289 4501 10573 13667 14642 16127 17040 17475 18055 24061 26204 26567 29277 1410 3656 4080 6963 8834 10527 17490 17584 18065 19234 22211 22338 23746 24662 29863 30227 1924 2694 3285 8761 9693 11005 17592 21259 21322 21546 21555 24044 24173 26988 27640 28506 1069 6483 6554 9027 11655 12453 16595 17877 18350 18995 21304 21442 23836 25468 28820 29453 149 1621 2199 3141 8403 11974 14969 16197 18844 21027 21921 22266 22399 22691 25727 27721 3689 4839 7971 8419 10500 12308 13435 14487 16502 16622 17229 17468 22710 23904 25074 28508 1270 7007 9830 12698 14204 16075 17613 19391 21362 21726 21816 23014 23651 26419 26748 27195 96 1953 2456 2712 2809 3196 5939 10634 21828 24606 26169 26801 27391 28578 29725 30142 832 3394 4145 5375 6199 7122 7405 7706 10136 10792 15058 15860 21881 23908 25174 25837 730 1735 2917 4106 5004 5849 8194 8943 9136 17599 18456 20191 22798 27935 29559 6238 6776 6799 9142 11199 11867 15979 16830 18110 18396 21897 22590 24020 29578 29644 407 2138 4493 7979 8225 9467 11956 12940 15566 15809 16058 18211 22073 28314 28713 957 1552 1869 4388 7642 7904 13408 13453 16431 19327 21444 22188 25719 28511 29192 3617 8663 22378 28704 8598 12647 19278 22416 15176 16377 16644 22732 12463 12711 18341 11079 13446 29071 2446 4068 8542 10838 11660 27428 16403 21750 23199 9181 16572 18381 7227 18770 21858 7379 9316 16247 8923 14861 29618 6531 24652 26817 5564 8875 18025 8019 14642 21169 16683 17257 29298 4078 6023 8853 13942 15217 15501 7484 8302 27199 671 14966 20886 1240 11897 14925 12800 25474 28603 3576 5308 11168 13430 15265 18232 3439 5544 21849 3257 16996 23750 1865 14153 22669 7640 15098 17364 6137 19401 24836 5986 9035 11444 4799 20865 29150 8360 23554 29246 2002 18215 22258 9679 11951 26583 2844 12330 18156 3744 6949 14754 8262 10288 27142 1087 16563 22815 1328 13273 21749 2092 9191 28045 3250 10549 18252 13975 15172 17135 2520 26310 28787 4395 8961 26753 6413 15437 19520 5809 10936 17089 1670 13574 25125 5865 6175 21175 8391 11680 22660 5485 11743 15165 21021 21798 30209 12519 13402 26300 3472 25935 26412 3377 7398 28867 2430 24650 29426 3364 13409 22914 6838 13491 16229 18393 20764 28078 289 20279 24906 4732 6162 13569 8993 17053 29387 2210 5024 24030 21 22976 24053 12359 15499 28251 4640 11480 24391 1083 7965 16573 13116 23916 24421 10129 16284 23855 1758 3843 21163 5626 13543 26708 14918 17713 21718 13556 20450 24679 3911 16778 29952 11735 13710 22611 5347 21681 22906 6912 12045 15866 713 15429 23281 7133 17440 28982 12355 17564 28059 7658 11158 29885 17610 18755 28852 7680 16212 30111 8812 10144 15718 The receiving device / method includes a decoding unit / step for decoding the LDPC code obtained from data transmitted from a transmitting device.

[0011] In a first receiving device / method, a coding unit is provided that performs LDPC coding based on a check matrix of an LDPC code having a code length N of 69120 bits and a coding rate r of 9 / 16, the LDPC code includes information bits and parity bits, the 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 represented by a check matrix initial value table, and the check matrix initial value table is a table that represents a position of one element of the information matrix portion for every 360 columns, 110 3064 6740 7801 10228 13445 17599 17891 17979 18044 19923 21848 23262 25585 25968 30124 1578 8914 9141 9731 10605 11690 12824 18127 18458 24648 24950 25150 26323 26514 27385 27460 3054 3640 3923 7332 10770 12215 14455 14849 15619 20870 22033 26427 28067 28560 29777 29780 1348 4248 5479 8902 9101 9356 10581 11614 12813 21554 22985 23701 24099 24575 24786 27370 3266 8358 16544 16689 16693 16823 17565 18543 19229 21121 23799 24981 25423 28997 29808 30202 320 1198 1549 5407 6080 8542 9352 12418 13391 14736 15012 18328 19398 23391 28117 28793 2114 3294 3770 5225 5556 5991 7075 7889 11145 11386 16561 18956 19034 23605 26085 27132 3623 4011 4225 5249 5489 5711 7240 9831 10458 14697 15420 16015 17782 23244 24215 24386 2624 2750 3871 8247 11135 13702 19290 22209 22975 23811 23931 24872 25154 25165 28375 30200 1060 1240 2040 2382 7723 9165 9656 10398 14517 16653 21241 22348 23476 27203 28443 28445 1070 1233 3416 6633 11736 12808 15454 16505 18720 20162 21425 21874 26069 26855 27292 27978 420 5524 10279 11218 12500 12913 15389 15824 19414 19588 21138 23846 26621 27907 28594 28781 151 1356 2323 3289 4501 10573 13667 14642 16127 17040 17475 18055 24061 26204 26567 29277 1410 3656 4080 6963 8834 10527 17490 17584 18065 19234 22211 22338 23746 24662 29863 30227 1924 2694 3285 8761 9693 11005 17592 21259 21322 21546 21555 24044 24173 26988 27640 28506 1069 6483 6554 9027 11655 12453 16595 17877 18350 18995 21304 21442 23836 25468 28820 29453 149 1621 2199 3141 8403 11974 14969 16197 18844 21027 21921 22266 22399 22691 25727 27721 3689 4839 7971 8419 10500 12308 13435 14487 16502 16622 17229 17468 22710 23904 25074 28508 1270 7007 9830 12698 14204 16075 17613 19391 21362 21726 21816 23014 23651 26419 26748 27195 96 1953 2456 2712 2809 3196 5939 10634 21828 24606 26169 26801 27391 28578 29725 30142 832 3394 4145 5375 6199 7122 7405 7706 10136 10792 15058 15860 21881 23908 25174 25837 730 1735 2917 4106 5004 5849 8194 8943 9136 17599 18456 20191 22798 27935 29559 6238 6776 6799 9142 11199 11867 15979 16830 18110 18396 21897 22590 24020 29578 29644 407 2138 4493 7979 8225 9467 11956 12940 15566 15809 16058 18211 22073 28314 28713 957 1552 1869 4388 7642 7904 13408 13453 16431 19327 21444 22188 25719 28511 29192 3617 8663 22378 28704 8598 12647 19278 22416 15176 16377 16644 22732 12463 12711 18341 11079 13446 29071 2446 4068 8542 10838 11660 27428 16403 21750 23199 9181 16572 18381 7227 18770 21858 7379 9316 16247 8923 14861 29618 6531 24652 26817 5564 8875 18025 8019 14642 21169 16683 17257 29298 4078 6023 8853 13942 15217 15501 7484 8302 27199 671 14966 20886 1240 11897 14925 12800 25474 28603 3576 5308 11168 13430 15265 18232 3439 5544 21849 3257 16996 23750 1865 14153 22669 7640 15098 17364 6137 19401 24836 5986 9035 11444 4799 20865 29150 8360 23554 29246 2002 18215 22258 9679 11951 26583 2844 12330 18156 3744 6949 14754 8262 10288 27142 1087 16563 22815 1328 13273 21749 2092 9191 28045 3250 10549 18252 13975 15172 17135 2520 26310 28787 4395 8961 26753 6413 15437 19520 5809 10936 17089 1670 13574 25125 5865 6175 21175 8391 11680 22660 5485 11743 15165 21021 21798 30209 12519 13402 26300 3472 25935 26412 3377 7398 28867 2430 24650 29426 3364 13409 22914 6838 13491 16229 18393 20764 28078 289 20279 24906 4732 6162 13569 8993 17053 29387 2210 5024 24030 21 22976 24053 12359 15499 28251 4640 11480 24391 1083 7965 16573 13116 23916 24421 10129 16284 23855 1758 3843 21163 5626 13543 26708 14918 17713 21718 13556 20450 24679 3911 16778 29952 11735 13710 22611 5347 21681 22906 6912 12045 15866 713 15429 23281 7133 17440 28982 12355 17564 28059 7658 11158 29885 17610 18755 28852 7680 16212 30111 8812 10144 15718 The LDPC code obtained from the data transmitted from the transmitting device is decoded.

[0012] A second transmission device / method of the present technology includes a coding unit / step for performing LDPC coding based on a parity check matrix of an LDPC code having a code length N of 69120 bits and a coding rate r of 9 / 16, the LDPC code including information bits and parity bits, the parity check matrix including an information matrix portion corresponding to the information bits and a parity matrix portion corresponding to the parity bits, the information matrix portion being represented by a parity check matrix initial value table, the parity check matrix initial value table being a table representing a position of one element of the information matrix portion for every 360 columns, 344 5260 5449 9663 11572 11933 15244 18579 18949 19398 22175 23672 25646 26228 28656 29695 94 6796 7678 7790 9294 13003 13506 17577 19909 21842 23240 24312 25607 25987 26138 30141 3065 9660 10194 11700 12775 17826 17987 18011 18139 24640 24992 25167 25574 26525 27409 27443 1518 3037 3662 7312 8949 9104 10654 10834 12255 15569 18449 20854 26340 26423 28075 29817 3919 4274 5506 8843 9351 12805 14505 14817 22069 23012 23697 24041 24857 27342 28623 29808 1366 3228 8386 9132 10558 11608 16663 16748 18548 21121 21582 23833 24567 25013 25403 29764 308 1250 6105 8501 13402 14997 16464 16818 17606 18331 19164 19334 23429 28729 29007 30169 1554 3279 5266 5459 5567 5975 7137 7853 9379 12396 14725 16695 19013 26100 27158 28072 2133 3771 4208 5514 5638 7263 9895 10454 11108 11387 15416 15975 18907 23647 24254 24409 2608 3636 3885 4012 5274 8303 11157 13722 14668 17777 22255 22941 23224 23929 24944 30207 1070 1235 2018 2770 7700 9196 10392 16689 19241 21249 23477 23848 25122 25188 28342 28421 2429 9607 14502 15391 18716 20177 21473 21901 22390 26796 27148 27280 28004 28402 998 1213 3439 6597 10328 11231 11688 12840 16477 19477 19575 21107 26074 26599 486 1371 3334 5527 12458 12880 15407 15875 18054 23790 27937 28635 28771 29282 120 2312 4476 10565 13656 14622 16086 17050 17477 17581 24038 26200 26615 29827 1348 3651 4047 6897 8889 10520 17523 18098 19120 22206 22293 23689 24682 30177 2079 2735 3279 8789 11028 17564 21316 21515 21532 24039 24130 26966 27697 28492 6469 6581 9021 9726 11535 12494 16590 17814 18338 19023 21298 21308 21437 28882 151 1046 2232 8476 11980 18863 21898 22338 22363 22712 23817 25461 25734 29400 1668 3131 10514 12275 13430 14485 14992 16193 16508 16629 17274 21073 25068 27722 3687 4793 7964 8450 9907 16051 17443 17599 19361 21676 22751 23868 27209 28484 143 1270 6994 12753 14256 21367 21805 21839 22983 23617 26439 26733 26876 30154 1992 2512 2731 2804 3245 5915 10631 15085 15832 24562 26149 27402 28617 29672 834 3370 4116 5323 6152 7121 7454 7716 10103 10818 21888 23912 25179 25823 741 1684 2871 4082 4984 5870 8192 8918 9090 17613 20205 22816 27968 29511 370 6780 8411 26549 5927 9312 11874 20454 4336 17108 18408 18897 6749 18091 26151 7902 18151 21999 15828 18958 24454 404 14744 15626 8591 14022 28659 2040 5109 11281 942 4875 29186 7636 13511 17003 4387 13433 30206 19971 22197 28180 1903 7945 21440 7599 12181 17498 9627 9781 29214 5913 19534 19715 17181 18814 22441 9332 10906 22747 11759 12446 13494 2153 8541 29548 4064 9514 23731 11472 14128 21164 5437 15964 23258 7653 17635 21840 9305 17248 22322 1217 11497 29585 6530 8964 23600 5541 6473 28616 8027 17996 21190 16475 18933 27974 602 8864 17254 5278 10823 13942 4219 15579 27155 654 8304 14964 11905 20886 22560 12724 20022 25462 5307 11167 28611 3689 13424 15205 2807 16621 18304 5593 17026 23628 1847 3244 22123 7578 15120 17363 5249 15063 24837 5996 6161 11489 4804 9001 20869 23529 29222 29282 5215 8637 18187 11992 22251 26548 2797 9705 18211 3749 12285 14742 7143 8240 10294 16576 20448 27195 1063 1109 21510 2094 9194 13298 10566 18281 27976 3243 13978 15137 2536 17133 28750 4405 8946 26327 6412 10950 26757 5797 17123 19493 1602 10946 25184 5840 13553 21189 6175 8343 11687 5480 15151 22652 16701 21831 25393 12444 26268 30217 13405 25944 26459 3507 7470 28891 2432 3442 29419 3410 22921 24658 13423 13472 16250 6851 18360 20810 270 20303 28071 4759 13533 24922 6206 9012 17085 2197 24065 29373 4958 23009 24076 8 15463 28227 11489 12362 24430 4660 7919 16602 1044 13104 24399 10090 16288 23920 The transmitting device / method is as follows.

[0013] In the second transmission device / method, LDPC coding is performed based on a check matrix of an LDPC code having a code length N of 69120 bits and a coding rate r of 9 / 16. The LDPC code includes information bits and parity bits, the check matrix includes an information matrix part corresponding to the information bits and a parity matrix part corresponding to the parity bits, the information matrix part is represented by a check matrix initial value table, and the check matrix initial value table is a table representing the position of an element of 1 in the information matrix part for every 360 columns, 344 5260 5449 9663 11572 11933 15244 18579 18949 19398 22175 23672 25646 26228 28656 29695 94 6796 7678 7790 9294 13003 13506 17577 19909 21842 23240 24312 25607 25987 26138 30141 3065 9660 10194 11700 12775 17826 17987 18011 18139 24640 24992 25167 25574 26525 27409 27443 1518 3037 3662 7312 8949 9104 10654 10834 12255 15569 18449 20854 26340 26423 28075 29817 3919 4274 5506 8843 9351 12805 14505 14817 22069 23012 23697 24041 24857 27342 28623 29808 1366 3228 8386 9132 10558 11608 16663 16748 18548 21121 21582 23833 24567 25013 25403 29764 308 1250 6105 8501 13402 14997 16464 16818 17606 18331 19164 19334 23429 28729 29007 30169 1554 3279 5266 5459 5567 5975 7137 7853 9379 12396 14725 16695 19013 26100 27158 28072 2133 3771 4208 5514 5638 7263 9895 10454 11108 11387 15416 15975 18907 23647 24254 24409 2608 3636 3885 4012 5274 8303 11157 13722 14668 17777 22255 22941 23224 23929 24944 30207 1070 1235 2018 2770 7700 9196 10392 16689 19241 21249 23477 23848 25122 25188 28342 28421 2429 9607 14502 15391 18716 20177 21473 21901 22390 26796 27148 27280 28004 28402 998 1213 3439 6597 10328 11231 11688 12840 16477 19477 19575 21107 26074 26599 486 1371 3334 5527 12458 12880 15407 15875 18054 23790 27937 28635 28771 29282 120 2312 4476 10565 13656 14622 16086 17050 17477 17581 24038 26200 26615 29827 1348 3651 4047 6897 8889 10520 17523 18098 19120 22206 22293 23689 24682 30177 2079 2735 3279 8789 11028 17564 21316 21515 21532 24039 24130 26966 27697 28492 6469 6581 9021 9726 11535 12494 16590 17814 18338 19023 21298 21308 21437 28882 151 1046 2232 8476 11980 18863 21898 22338 22363 22712 23817 25461 25734 29400 1668 3131 10514 12275 13430 14485 14992 16193 16508 16629 17274 21073 25068 27722 3687 4793 7964 8450 9907 16051 17443 17599 19361 21676 22751 23868 27209 28484 143 1270 6994 12753 14256 21367 21805 21839 22983 23617 26439 26733 26876 30154 1992 2512 2731 2804 3245 5915 10631 15085 15832 24562 26149 27402 28617 29672 834 3370 4116 5323 6152 7121 7454 7716 10103 10818 21888 23912 25179 25823 741 1684 2871 4082 4984 5870 8192 8918 9090 17613 20205 22816 27968 29511 370 6780 8411 26549 5927 9312 11874 20454 4336 17108 18408 18897 6749 18091 26151 7902 18151 21999 15828 18958 24454 404 14744 15626 8591 14022 28659 2040 5109 11281 942 4875 29186 7636 13511 17003 4387 13433 30206 19971 22197 28180 1903 7945 21440 7599 12181 17498 9627 9781 29214 5913 19534 19715 17181 18814 22441 9332 10906 22747 11759 12446 13494 2153 8541 29548 4064 9514 23731 11472 14128 21164 5437 15964 23258 7653 17635 21840 9305 17248 22322 1217 11497 29585 6530 8964 23600 5541 6473 28616 8027 17996 21190 16475 18933 27974 602 8864 17254 5278 10823 13942 4219 15579 27155 654 8304 14964 11905 20886 22560 12724 20022 25462 5307 11167 28611 3689 13424 15205 2807 16621 18304 5593 17026 23628 1847 3244 22123 7578 15120 17363 5249 15063 24837 5996 6161 11489 4804 9001 20869 23529 29222 29282 5215 8637 18187 11992 22251 26548 2797 9705 18211 3749 12285 14742 7143 8240 10294 16576 20448 27195 1063 1109 21510 2094 9194 13298 10566 18281 27976 3243 13978 15137 2536 17133 28750 4405 8946 26327 6412 10950 26757 5797 17123 19493 1602 10946 25184 5840 13553 21189 6175 8343 11687 5480 15151 22652 16701 21831 25393 12444 26268 30217 13405 25944 26459 3507 7470 28891 2432 3442 29419 3410 22921 24658 13423 13472 16250 6851 18360 20810 270 20303 28071 4759 13533 24922 6206 9012 17085 2197 24065 29373 4958 23009 24076 8 15463 28227 11489 12362 24430 4660 7919 16602 1044 13104 24399 10090 16288 23920 It has become.

[0014] A second receiving device / method of the present technology includes a coding unit that performs LDPC coding based on a check matrix of an LDPC code having a code length N of 69120 bits and a coding rate r of 9 / 16, the LDPC code including information bits and parity bits, the check matrix including an information matrix portion corresponding to the information bits and a parity matrix portion corresponding to the parity bits, the information matrix portion being represented by a check matrix initial value table, the check matrix initial value table being a table representing a position of one element of the information matrix portion for every 360 columns, 344 5260 5449 9663 11572 11933 15244 18579 18949 19398 22175 23672 25646 26228 28656 29695 94 6796 7678 7790 9294 13003 13506 17577 19909 21842 23240 24312 25607 25987 26138 30141 3065 9660 10194 11700 12775 17826 17987 18011 18139 24640 24992 25167 25574 26525 27409 27443 1518 3037 3662 7312 8949 9104 10654 10834 12255 15569 18449 20854 26340 26423 28075 29817 3919 4274 5506 8843 9351 12805 14505 14817 22069 23012 23697 24041 24857 27342 28623 29808 1366 3228 8386 9132 10558 11608 16663 16748 18548 21121 21582 23833 24567 25013 25403 29764 308 1250 6105 8501 13402 14997 16464 16818 17606 18331 19164 19334 23429 28729 29007 30169 1554 3279 5266 5459 5567 5975 7137 7853 9379 12396 14725 16695 19013 26100 27158 28072 2133 3771 4208 5514 5638 7263 9895 10454 11108 11387 15416 15975 18907 23647 24254 24409 2608 3636 3885 4012 5274 8303 11157 13722 14668 17777 22255 22941 23224 23929 24944 30207 1070 1235 2018 2770 7700 9196 10392 16689 19241 21249 23477 23848 25122 25188 28342 28421 2429 9607 14502 15391 18716 20177 21473 21901 22390 26796 27148 27280 28004 28402 998 1213 3439 6597 10328 11231 11688 12840 16477 19477 19575 21107 26074 26599 486 1371 3334 5527 12458 12880 15407 15875 18054 23790 27937 28635 28771 29282 120 2312 4476 10565 13656 14622 16086 17050 17477 17581 24038 26200 26615 29827 1348 3651 4047 6897 8889 10520 17523 18098 19120 22206 22293 23689 24682 30177 2079 2735 3279 8789 11028 17564 21316 21515 21532 24039 24130 26966 27697 28492 6469 6581 9021 9726 11535 12494 16590 17814 18338 19023 21298 21308 21437 28882 151 1046 2232 8476 11980 18863 21898 22338 22363 22712 23817 25461 25734 29400 1668 3131 10514 12275 13430 14485 14992 16193 16508 16629 17274 21073 25068 27722 3687 4793 7964 8450 9907 16051 17443 17599 19361 21676 22751 23868 27209 28484 143 1270 6994 12753 14256 21367 21805 21839 22983 23617 26439 26733 26876 30154 1992 2512 2731 2804 3245 5915 10631 15085 15832 24562 26149 27402 28617 29672 834 3370 4116 5323 6152 7121 7454 7716 10103 10818 21888 23912 25179 25823 741 1684 2871 4082 4984 5870 8192 8918 9090 17613 20205 22816 27968 29511 370 6780 8411 26549 5927 9312 11874 20454 4336 17108 18408 18897 6749 18091 26151 7902 18151 21999 15828 18958 24454 404 14744 15626 8591 14022 28659 2040 5109 11281 942 4875 29186 7636 13511 17003 4387 13433 30206 19971 22197 28180 1903 7945 21440 7599 12181 17498 9627 9781 29214 5913 19534 19715 17181 18814 22441 9332 10906 22747 11759 12446 13494 2153 8541 29548 4064 9514 23731 11472 14128 21164 5437 15964 23258 7653 17635 21840 9305 17248 22322 1217 11497 29585 6530 8964 23600 5541 6473 28616 8027 17996 21190 16475 18933 27974 602 8864 17254 5278 10823 13942 4219 15579 27155 654 8304 14964 11905 20886 22560 12724 20022 25462 5307 11167 28611 3689 13424 15205 2807 16621 18304 5593 17026 23628 1847 3244 22123 7578 15120 17363 5249 15063 24837 5996 6161 11489 4804 9001 20869 23529 29222 29282 5215 8637 18187 11992 22251 26548 2797 9705 18211 3749 12285 14742 7143 8240 10294 16576 20448 27195 1063 1109 21510 2094 9194 13298 10566 18281 27976 3243 13978 15137 2536 17133 28750 4405 8946 26327 6412 10950 26757 5797 17123 19493 1602 10946 25184 5840 13553 21189 6175 8343 11687 5480 15151 22652 16701 21831 25393 12444 26268 30217 13405 25944 26459 3507 7470 28891 2432 3442 29419 3410 22921 24658 13423 13472 16250 6851 18360 20810 270 20303 28071 4759 13533 24922 6206 9012 17085 2197 24065 29373 4958 23009 24076 8 15463 28227 11489 12362 24430 4660 7919 16602 1044 13104 24399 10090 16288 23920 The receiving device / method includes a decoding unit / step for decoding the LDPC code obtained from data transmitted from a transmitting device.

[0015] In a second receiving device / method, a coding unit is provided that performs LDPC coding based on a check matrix of an LDPC code having a code length N of 69120 bits and a coding rate r of 9 / 16, the LDPC code including information bits and parity bits, the check matrix including an information matrix portion corresponding to the information bits and a parity matrix portion corresponding to the parity bits, the information matrix portion being represented by a check matrix initial value table, the check matrix initial value table being a table that represents the position of one element of the information matrix portion for every 360 columns, 344 5260 5449 9663 11572 11933 15244 18579 18949 19398 22175 23672 25646 26228 28656 29695 94 6796 7678 7790 9294 13003 13506 17577 19909 21842 23240 24312 25607 25987 26138 30141 3065 9660 10194 11700 12775 17826 17987 18011 18139 24640 24992 25167 25574 26525 27409 27443 1518 3037 3662 7312 8949 9104 10654 10834 12255 15569 18449 20854 26340 26423 28075 29817 3919 4274 5506 8843 9351 12805 14505 14817 22069 23012 23697 24041 24857 27342 28623 29808 1366 3228 8386 9132 10558 11608 16663 16748 18548 21121 21582 23833 24567 25013 25403 29764 308 1250 6105 8501 13402 14997 16464 16818 17606 18331 19164 19334 23429 28729 29007 30169 1554 3279 5266 5459 5567 5975 7137 7853 9379 12396 14725 16695 19013 26100 27158 28072 2133 3771 4208 5514 5638 7263 9895 10454 11108 11387 15416 15975 18907 23647 24254 24409 2608 3636 3885 4012 5274 8303 11157 13722 14668 17777 22255 22941 23224 23929 24944 30207 1070 1235 2018 2770 7700 9196 10392 16689 19241 21249 23477 23848 25122 25188 28342 28421 2429 9607 14502 15391 18716 20177 21473 21901 22390 26796 27148 27280 28004 28402 998 1213 3439 6597 10328 11231 11688 12840 16477 19477 19575 21107 26074 26599 486 1371 3334 5527 12458 12880 15407 15875 18054 23790 27937 28635 28771 29282 120 2312 4476 10565 13656 14622 16086 17050 17477 17581 24038 26200 26615 29827 1348 3651 4047 6897 8889 10520 17523 18098 19120 22206 22293 23689 24682 30177 2079 2735 3279 8789 11028 17564 21316 21515 21532 24039 24130 26966 27697 28492 6469 6581 9021 9726 11535 12494 16590 17814 18338 19023 21298 21308 21437 28882 151 1046 2232 8476 11980 18863 21898 22338 22363 22712 23817 25461 25734 29400 1668 3131 10514 12275 13430 14485 14992 16193 16508 16629 17274 21073 25068 27722 3687 4793 7964 8450 9907 16051 17443 17599 19361 21676 22751 23868 27209 28484 143 1270 6994 12753 14256 21367 21805 21839 22983 23617 26439 26733 26876 30154 1992 2512 2731 2804 3245 5915 10631 15085 15832 24562 26149 27402 28617 29672 834 3370 4116 5323 6152 7121 7454 7716 10103 10818 21888 23912 25179 25823 741 1684 2871 4082 4984 5870 8192 8918 9090 17613 20205 22816 27968 29511 370 6780 8411 26549 5927 9312 11874 20454 4336 17108 18408 18897 6749 18091 26151 7902 18151 21999 15828 18958 24454 404 14744 15626 8591 14022 28659 2040 5109 11281 942 4875 29186 7636 13511 17003 4387 13433 30206 19971 22197 28180 1903 7945 21440 7599 12181 17498 9627 9781 29214 5913 19534 19715 17181 18814 22441 9332 10906 22747 11759 12446 13494 2153 8541 29548 4064 9514 23731 11472 14128 21164 5437 15964 23258 7653 17635 21840 9305 17248 22322 1217 11497 29585 6530 8964 23600 5541 6473 28616 8027 17996 21190 16475 18933 27974 602 8864 17254 5278 10823 13942 4219 15579 27155 654 8304 14964 11905 20886 22560 12724 20022 25462 5307 11167 28611 3689 13424 15205 2807 16621 18304 5593 17026 23628 1847 3244 22123 7578 15120 17363 5249 15063 24837 5996 6161 11489 4804 9001 20869 23529 29222 29282 5215 8637 18187 11992 22251 26548 2797 9705 18211 3749 12285 14742 7143 8240 10294 16576 20448 27195 1063 1109 21510 2094 9194 13298 10566 18281 27976 3243 13978 15137 2536 17133 28750 4405 8946 26327 6412 10950 26757 5797 17123 19493 1602 10946 25184 5840 13553 21189 6175 8343 11687 5480 15151 22652 16701 21831 25393 12444 26268 30217 13405 25944 26459 3507 7470 28891 2432 3442 29419 3410 22921 24658 13423 13472 16250 6851 18360 20810 270 20303 28071 4759 13533 24922 6206 9012 17085 2197 24065 29373 4958 23009 24076 8 15463 28227 11489 12362 24430 4660 7919 16602 1044 13104 24399 10090 16288 23920 The LDPC code obtained from the data transmitted from the transmitting device is decoded.

[0016] A third transmission device / method of the present technology includes a coding unit / step for performing LDPC coding based on a parity check matrix of an LDPC code having a code length N of 69120 bits and a coding rate r of 10 / 16, the LDPC code including information bits and parity bits, the parity check matrix including an information matrix portion corresponding to the information bits and a parity matrix portion corresponding to the parity bits, the information matrix portion being represented by a parity check matrix initial value table, the parity check matrix initial value table being a table representing a position of an element of the information matrix portion for every 360 columns, 200 588 3305 4771 6288 8400 11092 11126 14245 14255 17022 17190 19241 20350 20451 21069 25243 80 2914 4126 5426 6129 7790 9546 12909 14660 17357 18278 19612 21168 22367 23314 24801 24907 1216 2713 4897 6540 7016 7787 8321 9717 9934 12295 18749 20344 21386 21682 21735 24205 24825 6784 8163 8691 8743 10045 10319 10767 11141 11756 12004 12463 13407 14682 15458 20771 21060 22914 463 1260 1897 2128 2908 5157 7851 14177 16187 17463 18212 18221 19212 21864 24198 25318 25450 794 835 1163 4551 4597 5792 6092 7809 8576 8862 10986 12164 13053 14459 15978 23829 25072 144 4258 4342 7326 8165 9627 11432 12552 17582 17621 18145 19201 19372 19718 21036 25147 25774 617 2639 2749 2898 3414 4305 4802 6183 8551 9850 13679 20759 22501 24244 24331 24631 25587 1622 2258 4257 6069 10343 10642 11003 12520 13993 17086 18236 18522 24679 25361 25371 25595 1826 3926 5021 5905 6192 6839 7678 9136 9188 9716 10986 11191 12551 14648 16169 16234 2175 2396 2473 8548 9753 12115 12208 13469 15438 16985 19350 20424 21357 22819 22830 25671 265 397 6675 7152 8074 13030 13161 13336 15843 16917 17930 18014 18660 19218 22236 24940 5744 6883 7780 7839 8485 10016 10548 12131 12158 16211 16793 18749 20570 21757 22255 24489 2082 4768 7025 8803 10237 10932 13885 14266 14370 14982 16411 18443 18773 19570 21420 23311 1040 1376 2823 2998 3789 6636 7755 9819 13705 13868 14176 16202 16247 24943 25196 25489 223 1967 3289 4541 7420 9881 11086 12868 13550 14760 15434 18287 19098 20909 22905 25887 1906 2049 2147 2756 2845 4773 8337 8832 9363 12375 13651 16366 17546 20486 21624 22664 1619 1955 2393 3078 3208 3593 5246 8565 10956 11335 11865 14837 15006 15544 18820 22687 2086 3409 3586 4269 6587 8650 10165 11241 15624 16728 17814 18392 18667 19859 21132 25339 382 1160 1912 3700 3783 12069 14672 16842 18053 19626 20724 21244 21792 22679 23873 24517 1217 1486 5139 6774 7413 10622 11571 11697 13406 13487 20713 22436 22610 22806 23522 23632 1225 2927 6221 6247 8197 9322 11826 11948 12230 13899 15820 16791 17444 23155 24543 24650 1056 2975 6018 7698 7736 7940 11870 12964 17498 17577 19541 20124 20705 22693 23151 25627 658 790 1559 3683 6060 9059 12347 12990 13095 16317 17801 18816 20050 20979 23584 25472 1133 3343 6895 7146 7261 8340 9115 11248 14543 16030 16291 17972 22369 22479 24388 25280 1907 4021 8277 17631 7807 8063 10076 24958 5455 8638 13801 18832 15525 24030 24978 7854 21083 21197 8416 15614 24639 9382 13998 24091 1244 19468 24804 5100 14187 21263 12267 18441 22757 185 23294 23412 5136 24218 25509 6159 12323 19472 7490 9770 19813 1457 2204 4186 14200 15609 18700 4544 6337 17759 3697 13810 14537 10853 16611 23001 504 12709 23116 1338 21523 22880 1098 8530 23846 13699 19776 25783 3299 3629 16222 1821 2402 12416 11177 20793 24292 21580 24038 24094 11769 13819 13950 5388 9428 13527 20320 23996 24752 2923 14906 18768 911 10059 17607 1535 3090 22968 3398 8243 12265 9801 10001 20184 11839 15703 16757 1834 13797 14101 4469 11503 14694 4047 8684 23737 15682 21342 21898 7345 8077 22245 4108 20676 24406 8787 19625 22194 8536 15518 20879 3339 15738 19592 2916 13483 23680 3853 12107 18338 16962 21265 25429 10181 18667 25563 2867 21873 23535 8601 19728 23807 4484 17647 22060 6457 17641 23777 17432 18680 20224 3046 14453 19429 807 2064 12639 17630 20286 21847 13703 13720 24044 8382 9588 10339 18818 23311 24714 5397 13213 24988 4077 9348 21707 10628 15352 21292 1075 7625 18287 5771 20506 20926 13545 18180 21566 12022 19203 25134 86 12306 20066 7797 10752 15305 2986 4186 9128 9099 17285 24986 3530 17904 21836 2283 20216 25272 22562 24667 25143 1673 3837 5198 4188 13181 22061 17800 20341 22591 3466 4433 24958 145 7746 23940 4718 15618 19372 2735 11877 13719 3560 6483 10536 4167 7567 8558 4511 5862 16331 3268 6965 25578 5552 20627 24489 1425 2331 4414 3352 12606 19595 4653 8383 20029 9163 22097 24174 7324 16151 20228 280 4353 25404 5173 7657 25604 6910 13531 22225 18274 19994 21778 The transmitting device / method is as follows.

[0017] In the third transmission device / method, LDPC coding is performed based on a check matrix of an LDPC code having a code length N of 69120 bits and a coding rate r of 10 / 16. The LDPC code includes information bits and parity bits, the 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 represented by a check matrix initial value table, and the check matrix initial value table is a table representing the position of an element of 1 in the information matrix portion for every 360 columns, 200 588 3305 4771 6288 8400 11092 11126 14245 14255 17022 17190 19241 20350 20451 21069 25243 80 2914 4126 5426 6129 7790 9546 12909 14660 17357 18278 19612 21168 22367 23314 24801 24907 1216 2713 4897 6540 7016 7787 8321 9717 9934 12295 18749 20344 21386 21682 21735 24205 24825 6784 8163 8691 8743 10045 10319 10767 11141 11756 12004 12463 13407 14682 15458 20771 21060 22914 463 1260 1897 2128 2908 5157 7851 14177 16187 17463 18212 18221 19212 21864 24198 25318 25450 794 835 1163 4551 4597 5792 6092 7809 8576 8862 10986 12164 13053 14459 15978 23829 25072 144 4258 4342 7326 8165 9627 11432 12552 17582 17621 18145 19201 19372 19718 21036 25147 25774 617 2639 2749 2898 3414 4305 4802 6183 8551 9850 13679 20759 22501 24244 24331 24631 25587 1622 2258 4257 6069 10343 10642 11003 12520 13993 17086 18236 18522 24679 25361 25371 25595 1826 3926 5021 5905 6192 6839 7678 9136 9188 9716 10986 11191 12551 14648 16169 16234 2175 2396 2473 8548 9753 12115 12208 13469 15438 16985 19350 20424 21357 22819 22830 25671 265 397 6675 7152 8074 13030 13161 13336 15843 16917 17930 18014 18660 19218 22236 24940 5744 6883 7780 7839 8485 10016 10548 12131 12158 16211 16793 18749 20570 21757 22255 24489 2082 4768 7025 8803 10237 10932 13885 14266 14370 14982 16411 18443 18773 19570 21420 23311 1040 1376 2823 2998 3789 6636 7755 9819 13705 13868 14176 16202 16247 24943 25196 25489 223 1967 3289 4541 7420 9881 11086 12868 13550 14760 15434 18287 19098 20909 22905 25887 1906 2049 2147 2756 2845 4773 8337 8832 9363 12375 13651 16366 17546 20486 21624 22664 1619 1955 2393 3078 3208 3593 5246 8565 10956 11335 11865 14837 15006 15544 18820 22687 2086 3409 3586 4269 6587 8650 10165 11241 15624 16728 17814 18392 18667 19859 21132 25339 382 1160 1912 3700 3783 12069 14672 16842 18053 19626 20724 21244 21792 22679 23873 24517 1217 1486 5139 6774 7413 10622 11571 11697 13406 13487 20713 22436 22610 22806 23522 23632 1225 2927 6221 6247 8197 9322 11826 11948 12230 13899 15820 16791 17444 23155 24543 24650 1056 2975 6018 7698 7736 7940 11870 12964 17498 17577 19541 20124 20705 22693 23151 25627 658 790 1559 3683 6060 9059 12347 12990 13095 16317 17801 18816 20050 20979 23584 25472 1133 3343 6895 7146 7261 8340 9115 11248 14543 16030 16291 17972 22369 22479 24388 25280 1907 4021 8277 17631 7807 8063 10076 24958 5455 8638 13801 18832 15525 24030 24978 7854 21083 21197 8416 15614 24639 9382 13998 24091 1244 19468 24804 5100 14187 21263 12267 18441 22757 185 23294 23412 5136 24218 25509 6159 12323 19472 7490 9770 19813 1457 2204 4186 14200 15609 18700 4544 6337 17759 3697 13810 14537 10853 16611 23001 504 12709 23116 1338 21523 22880 1098 8530 23846 13699 19776 25783 3299 3629 16222 1821 2402 12416 11177 20793 24292 21580 24038 24094 11769 13819 13950 5388 9428 13527 20320 23996 24752 2923 14906 18768 911 10059 17607 1535 3090 22968 3398 8243 12265 9801 10001 20184 11839 15703 16757 1834 13797 14101 4469 11503 14694 4047 8684 23737 15682 21342 21898 7345 8077 22245 4108 20676 24406 8787 19625 22194 8536 15518 20879 3339 15738 19592 2916 13483 23680 3853 12107 18338 16962 21265 25429 10181 18667 25563 2867 21873 23535 8601 19728 23807 4484 17647 22060 6457 17641 23777 17432 18680 20224 3046 14453 19429 807 2064 12639 17630 20286 21847 13703 13720 24044 8382 9588 10339 18818 23311 24714 5397 13213 24988 4077 9348 21707 10628 15352 21292 1075 7625 18287 5771 20506 20926 13545 18180 21566 12022 19203 25134 86 12306 20066 7797 10752 15305 2986 4186 9128 9099 17285 24986 3530 17904 21836 2283 20216 25272 22562 24667 25143 1673 3837 5198 4188 13181 22061 17800 20341 22591 3466 4433 24958 145 7746 23940 4718 15618 19372 2735 11877 13719 3560 6483 10536 4167 7567 8558 4511 5862 16331 3268 6965 25578 5552 20627 24489 1425 2331 4414 3352 12606 19595 4653 8383 20029 9163 22097 24174 7324 16151 20228 280 4353 25404 5173 7657 25604 6910 13531 22225 18274 19994 21778 It has become.

[0018] A third receiving device / method of the present technology includes a coding unit that performs LDPC coding based on a check matrix of an LDPC code having a code length N of 69120 bits and a coding rate r of 10 / 16, the LDPC code including information bits and parity bits, the check matrix including an information matrix portion corresponding to the information bits and a parity matrix portion corresponding to the parity bits, the information matrix portion being represented by a check matrix initial value table, the check matrix initial value table being a table representing a position of an element of one in the information matrix portion for every 360 columns, 200 588 3305 4771 6288 8400 11092 11126 14245 14255 17022 17190 19241 20350 20451 21069 25243 80 2914 4126 5426 6129 7790 9546 12909 14660 17357 18278 19612 21168 22367 23314 24801 24907 1216 2713 4897 6540 7016 7787 8321 9717 9934 12295 18749 20344 21386 21682 21735 24205 24825 6784 8163 8691 8743 10045 10319 10767 11141 11756 12004 12463 13407 14682 15458 20771 21060 22914 463 1260 1897 2128 2908 5157 7851 14177 16187 17463 18212 18221 19212 21864 24198 25318 25450 794 835 1163 4551 4597 5792 6092 7809 8576 8862 10986 12164 13053 14459 15978 23829 25072 144 4258 4342 7326 8165 9627 11432 12552 17582 17621 18145 19201 19372 19718 21036 25147 25774 617 2639 2749 2898 3414 4305 4802 6183 8551 9850 13679 20759 22501 24244 24331 24631 25587 1622 2258 4257 6069 10343 10642 11003 12520 13993 17086 18236 18522 24679 25361 25371 25595 1826 3926 5021 5905 6192 6839 7678 9136 9188 9716 10986 11191 12551 14648 16169 16234 2175 2396 2473 8548 9753 12115 12208 13469 15438 16985 19350 20424 21357 22819 22830 25671 265 397 6675 7152 8074 13030 13161 13336 15843 16917 17930 18014 18660 19218 22236 24940 5744 6883 7780 7839 8485 10016 10548 12131 12158 16211 16793 18749 20570 21757 22255 24489 2082 4768 7025 8803 10237 10932 13885 14266 14370 14982 16411 18443 18773 19570 21420 23311 1040 1376 2823 2998 3789 6636 7755 9819 13705 13868 14176 16202 16247 24943 25196 25489 223 1967 3289 4541 7420 9881 11086 12868 13550 14760 15434 18287 19098 20909 22905 25887 1906 2049 2147 2756 2845 4773 8337 8832 9363 12375 13651 16366 17546 20486 21624 22664 1619 1955 2393 3078 3208 3593 5246 8565 10956 11335 11865 14837 15006 15544 18820 22687 2086 3409 3586 4269 6587 8650 10165 11241 15624 16728 17814 18392 18667 19859 21132 25339 382 1160 1912 3700 3783 12069 14672 16842 18053 19626 20724 21244 21792 22679 23873 24517 1217 1486 5139 6774 7413 10622 11571 11697 13406 13487 20713 22436 22610 22806 23522 23632 1225 2927 6221 6247 8197 9322 11826 11948 12230 13899 15820 16791 17444 23155 24543 24650 1056 2975 6018 7698 7736 7940 11870 12964 17498 17577 19541 20124 20705 22693 23151 25627 658 790 1559 3683 6060 9059 12347 12990 13095 16317 17801 18816 20050 20979 23584 25472 1133 3343 6895 7146 7261 8340 9115 11248 14543 16030 16291 17972 22369 22479 24388 25280 1907 4021 8277 17631 7807 8063 10076 24958 5455 8638 13801 18832 15525 24030 24978 7854 21083 21197 8416 15614 24639 9382 13998 24091 1244 19468 24804 5100 14187 21263 12267 18441 22757 185 23294 23412 5136 24218 25509 6159 12323 19472 7490 9770 19813 1457 2204 4186 14200 15609 18700 4544 6337 17759 3697 13810 14537 10853 16611 23001 504 12709 23116 1338 21523 22880 1098 8530 23846 13699 19776 25783 3299 3629 16222 1821 2402 12416 11177 20793 24292 21580 24038 24094 11769 13819 13950 5388 9428 13527 20320 23996 24752 2923 14906 18768 911 10059 17607 1535 3090 22968 3398 8243 12265 9801 10001 20184 11839 15703 16757 1834 13797 14101 4469 11503 14694 4047 8684 23737 15682 21342 21898 7345 8077 22245 4108 20676 24406 8787 19625 22194 8536 15518 20879 3339 15738 19592 2916 13483 23680 3853 12107 18338 16962 21265 25429 10181 18667 25563 2867 21873 23535 8601 19728 23807 4484 17647 22060 6457 17641 23777 17432 18680 20224 3046 14453 19429 807 2064 12639 17630 20286 21847 13703 13720 24044 8382 9588 10339 18818 23311 24714 5397 13213 24988 4077 9348 21707 10628 15352 21292 1075 7625 18287 5771 20506 20926 13545 18180 21566 12022 19203 25134 86 12306 20066 7797 10752 15305 2986 4186 9128 9099 17285 24986 3530 17904 21836 2283 20216 25272 22562 24667 25143 1673 3837 5198 4188 13181 22061 17800 20341 22591 3466 4433 24958 145 7746 23940 4718 15618 19372 2735 11877 13719 3560 6483 10536 4167 7567 8558 4511 5862 16331 3268 6965 25578 5552 20627 24489 1425 2331 4414 3352 12606 19595 4653 8383 20029 9163 22097 24174 7324 16151 20228 280 4353 25404 5173 7657 25604 6910 13531 22225 18274 19994 21778 The receiving device / method includes a decoding unit / step for decoding the LDPC code obtained from data transmitted from a transmitting device.

[0019] In a third receiving device / method, a coding unit is provided that performs LDPC coding based on a check matrix of an LDPC code having a code length N of 69120 bits and a coding rate r of 10 / 16, the LDPC code including information bits and parity bits, the check matrix including an information matrix portion corresponding to the information bits and a parity matrix portion corresponding to the parity bits, the information matrix portion being represented by a check matrix initial value table, the check matrix initial value table being a table representing the position of an element of one in the information matrix portion for every 360 columns, 200 588 3305 4771 6288 8400 11092 11126 14245 14255 17022 17190 19241 20350 20451 21069 25243 80 2914 4126 5426 6129 7790 9546 12909 14660 17357 18278 19612 21168 22367 23314 24801 24907 1216 2713 4897 6540 7016 7787 8321 9717 9934 12295 18749 20344 21386 21682 21735 24205 24825 6784 8163 8691 8743 10045 10319 10767 11141 11756 12004 12463 13407 14682 15458 20771 21060 22914 463 1260 1897 2128 2908 5157 7851 14177 16187 17463 18212 18221 19212 21864 24198 25318 25450 794 835 1163 4551 4597 5792 6092 7809 8576 8862 10986 12164 13053 14459 15978 23829 25072 144 4258 4342 7326 8165 9627 11432 12552 17582 17621 18145 19201 19372 19718 21036 25147 25774 617 2639 2749 2898 3414 4305 4802 6183 8551 9850 13679 20759 22501 24244 24331 24631 25587 1622 2258 4257 6069 10343 10642 11003 12520 13993 17086 18236 18522 24679 25361 25371 25595 1826 3926 5021 5905 6192 6839 7678 9136 9188 9716 10986 11191 12551 14648 16169 16234 2175 2396 2473 8548 9753 12115 12208 13469 15438 16985 19350 20424 21357 22819 22830 25671 265 397 6675 7152 8074 13030 13161 13336 15843 16917 17930 18014 18660 19218 22236 24940 5744 6883 7780 7839 8485 10016 10548 12131 12158 16211 16793 18749 20570 21757 22255 24489 2082 4768 7025 8803 10237 10932 13885 14266 14370 14982 16411 18443 18773 19570 21420 23311 1040 1376 2823 2998 3789 6636 7755 9819 13705 13868 14176 16202 16247 24943 25196 25489 223 1967 3289 4541 7420 9881 11086 12868 13550 14760 15434 18287 19098 20909 22905 25887 1906 2049 2147 2756 2845 4773 8337 8832 9363 12375 13651 16366 17546 20486 21624 22664 1619 1955 2393 3078 3208 3593 5246 8565 10956 11335 11865 14837 15006 15544 18820 22687 2086 3409 3586 4269 6587 8650 10165 11241 15624 16728 17814 18392 18667 19859 21132 25339 382 1160 1912 3700 3783 12069 14672 16842 18053 19626 20724 21244 21792 22679 23873 24517 1217 1486 5139 6774 7413 10622 11571 11697 13406 13487 20713 22436 22610 22806 23522 23632 1225 2927 6221 6247 8197 9322 11826 11948 12230 13899 15820 16791 17444 23155 24543 24650 1056 2975 6018 7698 7736 7940 11870 12964 17498 17577 19541 20124 20705 22693 23151 25627 658 790 1559 3683 6060 9059 12347 12990 13095 16317 17801 18816 20050 20979 23584 25472 1133 3343 6895 7146 7261 8340 9115 11248 14543 16030 16291 17972 22369 22479 24388 25280 1907 4021 8277 17631 7807 8063 10076 24958 5455 8638 13801 18832 15525 24030 24978 7854 21083 21197 8416 15614 24639 9382 13998 24091 1244 19468 24804 5100 14187 21263 12267 18441 22757 185 23294 23412 5136 24218 25509 6159 12323 19472 7490 9770 19813 1457 2204 4186 14200 15609 18700 4544 6337 17759 3697 13810 14537 10853 16611 23001 504 12709 23116 1338 21523 22880 1098 8530 23846 13699 19776 25783 3299 3629 16222 1821 2402 12416 11177 20793 24292 21580 24038 24094 11769 13819 13950 5388 9428 13527 20320 23996 24752 2923 14906 18768 911 10059 17607 1535 3090 22968 3398 8243 12265 9801 10001 20184 11839 15703 16757 1834 13797 14101 4469 11503 14694 4047 8684 23737 15682 21342 21898 7345 8077 22245 4108 20676 24406 8787 19625 22194 8536 15518 20879 3339 15738 19592 2916 13483 23680 3853 12107 18338 16962 21265 25429 10181 18667 25563 2867 21873 23535 8601 19728 23807 4484 17647 22060 6457 17641 23777 17432 18680 20224 3046 14453 19429 807 2064 12639 17630 20286 21847 13703 13720 24044 8382 9588 10339 18818 23311 24714 5397 13213 24988 4077 9348 21707 10628 15352 21292 1075 7625 18287 5771 20506 20926 13545 18180 21566 12022 19203 25134 86 12306 20066 7797 10752 15305 2986 4186 9128 9099 17285 24986 3530 17904 21836 2283 20216 25272 22562 24667 25143 1673 3837 5198 4188 13181 22061 17800 20341 22591 3466 4433 24958 145 7746 23940 4718 15618 19372 2735 11877 13719 3560 6483 10536 4167 7567 8558 4511 5862 16331 3268 6965 25578 5552 20627 24489 1425 2331 4414 3352 12606 19595 4653 8383 20029 9163 22097 24174 7324 16151 20228 280 4353 25404 5173 7657 25604 6910 13531 22225 18274 19994 21778 The LDPC code obtained from the data transmitted from the transmitting device is decoded.

[0020] A fourth transmission device / method of the present technology includes a coding unit / step of performing LDPC coding based on a parity check matrix of an LDPC code having a code length N of 69120 bits and a coding rate r of 10 / 16, the LDPC code including information bits and parity bits, the parity check matrix including an information matrix portion corresponding to the information bits and a parity matrix portion corresponding to the parity bits, the information matrix portion being represented by a parity check matrix initial value table, the parity check matrix initial value table being a table representing a position of an element of the information matrix portion for every 360 columns, 271 1020 5185 7275 8003 11480 12855 14175 14467 15086 15696 16443 16565 18130 20056 24630 24862 25892 1339 1853 2850 3222 4490 4644 4818 5174 6072 6698 10681 12635 14197 16281 20247 22338 23417 24076 3129 3405 3651 4498 4751 4876 6253 8473 8938 9552 9761 12593 13222 13694 15200 16230 20806 20887 1055 2296 2308 3380 7113 9524 11765 16519 19064 19672 19895 20421 20498 21381 21565 21587 24283 25908 932 1729 2020 6611 7879 8243 8912 12436 14276 16021 18171 19185 20154 23285 23342 24000 24372 24391 802 1025 2896 5686 9630 10075 10956 13238 14133 16693 16799 17305 18117 18375 18739 22385 22805 23012 365 1160 2879 4714 8810 10702 11054 13219 13599 14592 15414 20406 20592 22774 24045 24529 24666 25074 113 1165 1947 3823 5944 9058 9129 11673 12560 13816 14978 15027 15095 19019 20354 22452 25588 1637 2422 3115 3487 7500 7590 15048 15512 16354 18274 18449 19120 20724 21135 23145 23732 25911 2845 5592 7719 8334 9489 9892 10722 15313 15721 16306 18219 18232 18387 18503 20614 24467 24761 114 903 1910 5652 7270 10269 14202 16169 18835 19131 19208 19475 20389 21871 22037 23766 25226 1391 2688 6776 9001 10533 11495 12445 12868 13853 14176 14195 14764 18050 19508 20450 21465 24422 1118 3116 4245 5978 7207 8450 10891 13765 14966 15115 16605 18300 18630 19680 22654 22905 23307 99 2340 2383 2766 5097 9097 12169 18669 18716 20237 21059 22426 22990 23495 24511 25416 25790 701 1693 2106 2897 4540 5298 6106 6380 6604 8683 9279 12937 13575 18789 20512 21598 22132 608 1473 2459 3522 3593 4295 5008 7004 7699 7786 14450 15096 15830 17286 19571 23907 25288 5399 5791 5815 6785 7837 9632 10181 13688 15504 15594 15783 18758 18900 19305 20550 25385 25404 355 819 1841 3868 6517 7054 8097 10246 11123 11573 13354 13565 13807 14072 24327 24620 25028 1296 1630 3750 5091 6496 6780 7154 8414 11468 15004 16441 16619 18374 19047 22090 24448 24606 1818 3512 7338 7994 8149 8875 9345 9985 10716 11568 13029 16063 16709 19295 19487 20368 24977 1024 2737 3819 5584 6314 7683 7965 9796 13695 13917 14267 16079 18133 18763 19880 20213 25354 509 3489 4746 5544 6877 7607 9237 11923 12548 13078 14148 14809 15479 18172 23026 23320 24011 565 3039 3652 4540 7101 9564 10165 10898 11473 12788 12884 13091 15654 17926 19344 21818 24494 1554 2393 2767 4498 4755 5179 5306 6509 9849 12108 12920 14191 14607 14854 18992 20294 21249 1680 2417 4122 7193 7727 8288 10235 10518 12601 15579 15606 17894 19077 20170 22807 25023 25075 5260 7065 8165 8835 925 1768 14353 17531 946 1215 1772 12359 816 8662 9026 2813 12966 16694 2230 11960 14896 3800 24516 25345 5484 8458 23922 4987 9596 19066 1436 9374 14690 5028 11659 21771 5315 7165 18489 10407 12975 19434 5145 10245 18045 10673 22010 25886 11519 22187 22639 2980 24742 25213 3076 6738 25207 2739 2928 21112 11489 11589 19758 5855 14238 15751 17401 17827 24389 824 11592 21377 5183 5873 7732 1876 14696 25162 4304 20607 20618 10 13313 19688 9836 11073 25026 4018 6771 20919 927 14197 20942 8641 12334 21236 3269 14018 20385 2351 4788 18118 11617 18588 22838 12792 15919 21163 3349 11643 17565 14371 19374 25649 10067 11785 19622 4569 13536 18587 5964 10331 13181 599 19974 24864 6112 14924 15064 6583 10602 24102 9557 24762 25615 6604 15093 16126 8661 14067 25778 7528 13483 14749 2778 5178 17304 9446 14594 20687 4643 9835 10941 9150 16139 21198 2718 10848 25290 7441 8240 16973 11007 18715 22798 14372 14528 25882 12746 22454 23509 460 6355 23769 12219 16424 20964 2807 9851 19461 1927 9166 15241 6383 20232 24804 6897 12660 14081 974 21928 23655 3028 3106 15497 853 1253 16940 7120 13030 17698 4899 7645 13181 3241 17169 25337 818 10204 15188 5719 19557 20043 15487 18016 22407 2235 3953 22675 4744 10340 24145 7241 9321 25600 7221 11284 16819 4930 23831 23960 6080 10021 14223 1735 2786 4567 4388 8739 18918 9298 9450 19150 1233 13832 24372 15796 15975 21750 6155 15182 18451 203 11202 19855 16073 23604 25852 98 19028 20997 7921 11254 12101 6747 7647 8952 2010 19596 24301 7463 19200 24382 1705 17928 25288 2005 9490 17390 3413 11573 17375 9213 13062 14270 1307 15050 20865 The transmitting device / method is as follows.

[0021] In a fourth transmission device / method, LDPC coding is performed based on a check matrix of an LDPC code having a code length N of 69120 bits and a coding rate r of 10 / 16. The LDPC code includes information bits and parity bits, the 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 represented by a check matrix initial value table, and the check matrix initial value table is a table representing the position of an element of 1 in the information matrix portion for every 360 columns, 271 1020 5185 7275 8003 11480 12855 14175 14467 15086 15696 16443 16565 18130 20056 24630 24862 25892 1339 1853 2850 3222 4490 4644 4818 5174 6072 6698 10681 12635 14197 16281 20247 22338 23417 24076 3129 3405 3651 4498 4751 4876 6253 8473 8938 9552 9761 12593 13222 13694 15200 16230 20806 20887 1055 2296 2308 3380 7113 9524 11765 16519 19064 19672 19895 20421 20498 21381 21565 21587 24283 25908 932 1729 2020 6611 7879 8243 8912 12436 14276 16021 18171 19185 20154 23285 23342 24000 24372 24391 802 1025 2896 5686 9630 10075 10956 13238 14133 16693 16799 17305 18117 18375 18739 22385 22805 23012 365 1160 2879 4714 8810 10702 11054 13219 13599 14592 15414 20406 20592 22774 24045 24529 24666 25074 113 1165 1947 3823 5944 9058 9129 11673 12560 13816 14978 15027 15095 19019 20354 22452 25588 1637 2422 3115 3487 7500 7590 15048 15512 16354 18274 18449 19120 20724 21135 23145 23732 25911 2845 5592 7719 8334 9489 9892 10722 15313 15721 16306 18219 18232 18387 18503 20614 24467 24761 114 903 1910 5652 7270 10269 14202 16169 18835 19131 19208 19475 20389 21871 22037 23766 25226 1391 2688 6776 9001 10533 11495 12445 12868 13853 14176 14195 14764 18050 19508 20450 21465 24422 1118 3116 4245 5978 7207 8450 10891 13765 14966 15115 16605 18300 18630 19680 22654 22905 23307 99 2340 2383 2766 5097 9097 12169 18669 18716 20237 21059 22426 22990 23495 24511 25416 25790 701 1693 2106 2897 4540 5298 6106 6380 6604 8683 9279 12937 13575 18789 20512 21598 22132 608 1473 2459 3522 3593 4295 5008 7004 7699 7786 14450 15096 15830 17286 19571 23907 25288 5399 5791 5815 6785 7837 9632 10181 13688 15504 15594 15783 18758 18900 19305 20550 25385 25404 355 819 1841 3868 6517 7054 8097 10246 11123 11573 13354 13565 13807 14072 24327 24620 25028 1296 1630 3750 5091 6496 6780 7154 8414 11468 15004 16441 16619 18374 19047 22090 24448 24606 1818 3512 7338 7994 8149 8875 9345 9985 10716 11568 13029 16063 16709 19295 19487 20368 24977 1024 2737 3819 5584 6314 7683 7965 9796 13695 13917 14267 16079 18133 18763 19880 20213 25354 509 3489 4746 5544 6877 7607 9237 11923 12548 13078 14148 14809 15479 18172 23026 23320 24011 565 3039 3652 4540 7101 9564 10165 10898 11473 12788 12884 13091 15654 17926 19344 21818 24494 1554 2393 2767 4498 4755 5179 5306 6509 9849 12108 12920 14191 14607 14854 18992 20294 21249 1680 2417 4122 7193 7727 8288 10235 10518 12601 15579 15606 17894 19077 20170 22807 25023 25075 5260 7065 8165 8835 925 1768 14353 17531 946 1215 1772 12359 816 8662 9026 2813 12966 16694 2230 11960 14896 3800 24516 25345 5484 8458 23922 4987 9596 19066 1436 9374 14690 5028 11659 21771 5315 7165 18489 10407 12975 19434 5145 10245 18045 10673 22010 25886 11519 22187 22639 2980 24742 25213 3076 6738 25207 2739 2928 21112 11489 11589 19758 5855 14238 15751 17401 17827 24389 824 11592 21377 5183 5873 7732 1876 14696 25162 4304 20607 20618 10 13313 19688 9836 11073 25026 4018 6771 20919 927 14197 20942 8641 12334 21236 3269 14018 20385 2351 4788 18118 11617 18588 22838 12792 15919 21163 3349 11643 17565 14371 19374 25649 10067 11785 19622 4569 13536 18587 5964 10331 13181 599 19974 24864 6112 14924 15064 6583 10602 24102 9557 24762 25615 6604 15093 16126 8661 14067 25778 7528 13483 14749 2778 5178 17304 9446 14594 20687 4643 9835 10941 9150 16139 21198 2718 10848 25290 7441 8240 16973 11007 18715 22798 14372 14528 25882 12746 22454 23509 460 6355 23769 12219 16424 20964 2807 9851 19461 1927 9166 15241 6383 20232 24804 6897 12660 14081 974 21928 23655 3028 3106 15497 853 1253 16940 7120 13030 17698 4899 7645 13181 3241 17169 25337 818 10204 15188 5719 19557 20043 15487 18016 22407 2235 3953 22675 4744 10340 24145 7241 9321 25600 7221 11284 16819 4930 23831 23960 6080 10021 14223 1735 2786 4567 4388 8739 18918 9298 9450 19150 1233 13832 24372 15796 15975 21750 6155 15182 18451 203 11202 19855 16073 23604 25852 98 19028 20997 7921 11254 12101 6747 7647 8952 2010 19596 24301 7463 19200 24382 1705 17928 25288 2005 9490 17390 3413 11573 17375 9213 13062 14270 1307 15050 20865 It has become.

[0022] A fourth receiving device / method of the present technology includes a coding unit that performs LDPC coding based on a check matrix of an LDPC code having a code length N of 69120 bits and a coding rate r of 10 / 16, the LDPC code including information bits and parity bits, the check matrix including an information matrix portion corresponding to the information bits and a parity matrix portion corresponding to the parity bits, the information matrix portion being represented by a check matrix initial value table, the check matrix initial value table being a table representing a position of an element of one in the information matrix portion for every 360 columns, 271 1020 5185 7275 8003 11480 12855 14175 14467 15086 15696 16443 16565 18130 20056 24630 24862 25892 1339 1853 2850 3222 4490 4644 4818 5174 6072 6698 10681 12635 14197 16281 20247 22338 23417 24076 3129 3405 3651 4498 4751 4876 6253 8473 8938 9552 9761 12593 13222 13694 15200 16230 20806 20887 1055 2296 2308 3380 7113 9524 11765 16519 19064 19672 19895 20421 20498 21381 21565 21587 24283 25908 932 1729 2020 6611 7879 8243 8912 12436 14276 16021 18171 19185 20154 23285 23342 24000 24372 24391 802 1025 2896 5686 9630 10075 10956 13238 14133 16693 16799 17305 18117 18375 18739 22385 22805 23012 365 1160 2879 4714 8810 10702 11054 13219 13599 14592 15414 20406 20592 22774 24045 24529 24666 25074 113 1165 1947 3823 5944 9058 9129 11673 12560 13816 14978 15027 15095 19019 20354 22452 25588 1637 2422 3115 3487 7500 7590 15048 15512 16354 18274 18449 19120 20724 21135 23145 23732 25911 2845 5592 7719 8334 9489 9892 10722 15313 15721 16306 18219 18232 18387 18503 20614 24467 24761 114 903 1910 5652 7270 10269 14202 16169 18835 19131 19208 19475 20389 21871 22037 23766 25226 1391 2688 6776 9001 10533 11495 12445 12868 13853 14176 14195 14764 18050 19508 20450 21465 24422 1118 3116 4245 5978 7207 8450 10891 13765 14966 15115 16605 18300 18630 19680 22654 22905 23307 99 2340 2383 2766 5097 9097 12169 18669 18716 20237 21059 22426 22990 23495 24511 25416 25790 701 1693 2106 2897 4540 5298 6106 6380 6604 8683 9279 12937 13575 18789 20512 21598 22132 608 1473 2459 3522 3593 4295 5008 7004 7699 7786 14450 15096 15830 17286 19571 23907 25288 5399 5791 5815 6785 7837 9632 10181 13688 15504 15594 15783 18758 18900 19305 20550 25385 25404 355 819 1841 3868 6517 7054 8097 10246 11123 11573 13354 13565 13807 14072 24327 24620 25028 1296 1630 3750 5091 6496 6780 7154 8414 11468 15004 16441 16619 18374 19047 22090 24448 24606 1818 3512 7338 7994 8149 8875 9345 9985 10716 11568 13029 16063 16709 19295 19487 20368 24977 1024 2737 3819 5584 6314 7683 7965 9796 13695 13917 14267 16079 18133 18763 19880 20213 25354 509 3489 4746 5544 6877 7607 9237 11923 12548 13078 14148 14809 15479 18172 23026 23320 24011 565 3039 3652 4540 7101 9564 10165 10898 11473 12788 12884 13091 15654 17926 19344 21818 24494 1554 2393 2767 4498 4755 5179 5306 6509 9849 12108 12920 14191 14607 14854 18992 20294 21249 1680 2417 4122 7193 7727 8288 10235 10518 12601 15579 15606 17894 19077 20170 22807 25023 25075 5260 7065 8165 8835 925 1768 14353 17531 946 1215 1772 12359 816 8662 9026 2813 12966 16694 2230 11960 14896 3800 24516 25345 5484 8458 23922 4987 9596 19066 1436 9374 14690 5028 11659 21771 5315 7165 18489 10407 12975 19434 5145 10245 18045 10673 22010 25886 11519 22187 22639 2980 24742 25213 3076 6738 25207 2739 2928 21112 11489 11589 19758 5855 14238 15751 17401 17827 24389 824 11592 21377 5183 5873 7732 1876 14696 25162 4304 20607 20618 10 13313 19688 9836 11073 25026 4018 6771 20919 927 14197 20942 8641 12334 21236 3269 14018 20385 2351 4788 18118 11617 18588 22838 12792 15919 21163 3349 11643 17565 14371 19374 25649 10067 11785 19622 4569 13536 18587 5964 10331 13181 599 19974 24864 6112 14924 15064 6583 10602 24102 9557 24762 25615 6604 15093 16126 8661 14067 25778 7528 13483 14749 2778 5178 17304 9446 14594 20687 4643 9835 10941 9150 16139 21198 2718 10848 25290 7441 8240 16973 11007 18715 22798 14372 14528 25882 12746 22454 23509 460 6355 23769 12219 16424 20964 2807 9851 19461 1927 9166 15241 6383 20232 24804 6897 12660 14081 974 21928 23655 3028 3106 15497 853 1253 16940 7120 13030 17698 4899 7645 13181 3241 17169 25337 818 10204 15188 5719 19557 20043 15487 18016 22407 2235 3953 22675 4744 10340 24145 7241 9321 25600 7221 11284 16819 4930 23831 23960 6080 10021 14223 1735 2786 4567 4388 8739 18918 9298 9450 19150 1233 13832 24372 15796 15975 21750 6155 15182 18451 203 11202 19855 16073 23604 25852 98 19028 20997 7921 11254 12101 6747 7647 8952 2010 19596 24301 7463 19200 24382 1705 17928 25288 2005 9490 17390 3413 11573 17375 9213 13062 14270 1307 15050 20865 The receiving device / method includes a decoding unit / step for decoding the LDPC code obtained from data transmitted from a transmitting device.

[0023] In a fourth receiving device / method, a coding unit is provided that performs LDPC coding based on a check matrix of an LDPC code having a code length N of 69120 bits and a coding rate r of 10 / 16, the LDPC code including information bits and parity bits, the check matrix including an information matrix portion corresponding to the information bits and a parity matrix portion corresponding to the parity bits, the information matrix portion being represented by a check matrix initial value table, the check matrix initial value table being a table representing the position of one element of the information matrix portion for every 360 columns, 271 1020 5185 7275 8003 11480 12855 14175 14467 15086 15696 16443 16565 18130 20056 24630 24862 25892 1339 1853 2850 3222 4490 4644 4818 5174 6072 6698 10681 12635 14197 16281 20247 22338 23417 24076 3129 3405 3651 4498 4751 4876 6253 8473 8938 9552 9761 12593 13222 13694 15200 16230 20806 20887 1055 2296 2308 3380 7113 9524 11765 16519 19064 19672 19895 20421 20498 21381 21565 21587 24283 25908 932 1729 2020 6611 7879 8243 8912 12436 14276 16021 18171 19185 20154 23285 23342 24000 24372 24391 802 1025 2896 5686 9630 10075 10956 13238 14133 16693 16799 17305 18117 18375 18739 22385 22805 23012 365 1160 2879 4714 8810 10702 11054 13219 13599 14592 15414 20406 20592 22774 24045 24529 24666 25074 113 1165 1947 3823 5944 9058 9129 11673 12560 13816 14978 15027 15095 19019 20354 22452 25588 1637 2422 3115 3487 7500 7590 15048 15512 16354 18274 18449 19120 20724 21135 23145 23732 25911 2845 5592 7719 8334 9489 9892 10722 15313 15721 16306 18219 18232 18387 18503 20614 24467 24761 114 903 1910 5652 7270 10269 14202 16169 18835 19131 19208 19475 20389 21871 22037 23766 25226 1391 2688 6776 9001 10533 11495 12445 12868 13853 14176 14195 14764 18050 19508 20450 21465 24422 1118 3116 4245 5978 7207 8450 10891 13765 14966 15115 16605 18300 18630 19680 22654 22905 23307 99 2340 2383 2766 5097 9097 12169 18669 18716 20237 21059 22426 22990 23495 24511 25416 25790 701 1693 2106 2897 4540 5298 6106 6380 6604 8683 9279 12937 13575 18789 20512 21598 22132 608 1473 2459 3522 3593 4295 5008 7004 7699 7786 14450 15096 15830 17286 19571 23907 25288 5399 5791 5815 6785 7837 9632 10181 13688 15504 15594 15783 18758 18900 19305 20550 25385 25404 355 819 1841 3868 6517 7054 8097 10246 11123 11573 13354 13565 13807 14072 24327 24620 25028 1296 1630 3750 5091 6496 6780 7154 8414 11468 15004 16441 16619 18374 19047 22090 24448 24606 1818 3512 7338 7994 8149 8875 9345 9985 10716 11568 13029 16063 16709 19295 19487 20368 24977 1024 2737 3819 5584 6314 7683 7965 9796 13695 13917 14267 16079 18133 18763 19880 20213 25354 509 3489 4746 5544 6877 7607 9237 11923 12548 13078 14148 14809 15479 18172 23026 23320 24011 565 3039 3652 4540 7101 9564 10165 10898 11473 12788 12884 13091 15654 17926 19344 21818 24494 1554 2393 2767 4498 4755 5179 5306 6509 9849 12108 12920 14191 14607 14854 18992 20294 21249 1680 2417 4122 7193 7727 8288 10235 10518 12601 15579 15606 17894 19077 20170 22807 25023 25075 5260 7065 8165 8835 925 1768 14353 17531 946 1215 1772 12359 816 8662 9026 2813 12966 16694 2230 11960 14896 3800 24516 25345 5484 8458 23922 4987 9596 19066 1436 9374 14690 5028 11659 21771 5315 7165 18489 10407 12975 19434 5145 10245 18045 10673 22010 25886 11519 22187 22639 2980 24742 25213 3076 6738 25207 2739 2928 21112 11489 11589 19758 5855 14238 15751 17401 17827 24389 824 11592 21377 5183 5873 7732 1876 14696 25162 4304 20607 20618 10 13313 19688 9836 11073 25026 4018 6771 20919 927 14197 20942 8641 12334 21236 3269 14018 20385 2351 4788 18118 11617 18588 22838 12792 15919 21163 3349 11643 17565 14371 19374 25649 10067 11785 19622 4569 13536 18587 5964 10331 13181 599 19974 24864 6112 14924 15064 6583 10602 24102 9557 24762 25615 6604 15093 16126 8661 14067 25778 7528 13483 14749 2778 5178 17304 9446 14594 20687 4643 9835 10941 9150 16139 21198 2718 10848 25290 7441 8240 16973 11007 18715 22798 14372 14528 25882 12746 22454 23509 460 6355 23769 12219 16424 20964 2807 9851 19461 1927 9166 15241 6383 20232 24804 6897 12660 14081 974 21928 23655 3028 3106 15497 853 1253 16940 7120 13030 17698 4899 7645 13181 3241 17169 25337 818 10204 15188 5719 19557 20043 15487 18016 22407 2235 3953 22675 4744 10340 24145 7241 9321 25600 7221 11284 16819 4930 23831 23960 6080 10021 14223 1735 2786 4567 4388 8739 18918 9298 9450 19150 1233 13832 24372 15796 15975 21750 6155 15182 18451 203 11202 19855 16073 23604 25852 98 19028 20997 7921 11254 12101 6747 7647 8952 2010 19596 24301 7463 19200 24382 1705 17928 25288 2005 9490 17390 3413 11573 17375 9213 13062 14270 1307 15050 20865 The LDPC code obtained from the data transmitted from the transmitting device is decoded.

[0024] The transmitting device and the receiving device may be independent devices or may be internal blocks constituting a single device. Effect of the Invention

[0025] According to the present technology, good communication quality can be ensured in data transmission using LDPC codes.

[0026] Note that the effects described herein are not necessarily limited to those described herein, and may be any of the effects described in this disclosure. [Brief description of the drawings]

[0027] [Figure 1] FIG. 2 is a diagram illustrating a check matrix H of an LDPC code. [Diagram 2] 1 is a flowchart illustrating a procedure for decoding an LDPC code. [Diagram 3] FIG. 2 is a diagram illustrating an example of a check matrix of an LDPC code. [Figure 4] FIG. 13 is a diagram illustrating an example of a Tanner graph of a parity check matrix. [Diagram 5] FIG. 13 is a diagram illustrating an example of a variable node. [Figure 6] FIG. 2 is a diagram illustrating an example of a check node. [Figure 7] 1 is a diagram illustrating an example of the configuration of an embodiment of a transmission system to which the present technology is applied. [Figure 8] 2 is a block diagram showing an example of the configuration of a transmission device 11. FIG. [Figure 9] 13 is a block diagram showing an example of the configuration of a bit interleaver 116. FIG. [Figure 10] FIG. 13 is a diagram illustrating an example of a check matrix. [Figure 11] FIG. 13 is a diagram illustrating an example of a parity matrix. [Figure 12] 1 is a diagram illustrating a check matrix of an LDPC code defined in the DVB-T.2 standard. [Figure 13]1 is a diagram illustrating a check matrix of an LDPC code defined in the DVB-T.2 standard. [Figure 14] FIG. 1 is a diagram illustrating an example of a Tanner graph for decoding an LDPC code. [Figure 15] FIG. 1 is a diagram showing an example of a parity matrix HT having a staircase structure and a Tanner graph corresponding to the parity matrix HT. [Figure 16] 11 is a diagram showing an example of a parity matrix HT of a check matrix H corresponding to an LDPC code after parity interleaving. FIG. [Figure 17] 11 is a flowchart illustrating an example of processing performed by the bit interleaver 116 and the mapper 117. [Figure 18] 2 is a block diagram showing an example of the configuration of an LDPC encoder 115. FIG. [Figure 19] 11 is a flowchart illustrating an example of a process of the LDPC encoder 115. [Figure 20] FIG. 13 is a diagram showing an example of a parity check matrix initial value table with a coding rate of 1 / 4 and a code length of 16200. [Figure 21] 11 is a diagram for explaining a method of obtaining a check matrix H from a check matrix initial value table. FIG. [Figure 22] FIG. 2 is a diagram illustrating a structure of a check matrix. [Figure 23] FIG. 13 is a diagram illustrating an example of a check matrix initial value table. [Figure 24] 13 is a diagram for explaining matrix A generated from the check matrix initial value table. FIG. [Diagram 25] FIG. 1 is a diagram for explaining parity interleaving of a B matrix. [Figure 26] 11 is a diagram illustrating a C matrix generated from a check matrix initial value table. FIG. [Figure 27] FIG. 1 is a diagram for explaining parity interleaving of a D matrix. [Figure 28] FIG. 13 is a diagram showing a parity check matrix obtained by performing column permutation as parity deinterleaving to restore parity interleaving to its original state. [Figure 29]FIG. 13 is a diagram showing a transformed check matrix obtained by performing row permutation on a check matrix. [Diagram 30] FIG. 13 is a diagram illustrating an example of a check matrix initial value table for a type-A code where N=69120 bits and r=2 / 16. [Diagram 31] FIG. 13 is a diagram showing an example of a check matrix initial value table for a type-A code where N=69120 bits and r=3 / 16. [Diagram 32] FIG. 13 is a diagram showing an example of a check matrix initial value table for a type-A code where N=69120 bits and r=3 / 16. [Diagram 33] FIG. 13 is a diagram showing an example of a check matrix initial value table for a type-A code where N=69120 bits and r=4 / 16. [Diagram 34] FIG. 13 is a diagram showing an example of a check matrix initial value table for a type-A code where N=69120 bits and r=5 / 16. [Diagram 35] FIG. 13 is a diagram showing an example of a check matrix initial value table for a type-A code where N=69120 bits and r=5 / 16. [Diagram 36] FIG. 13 is a diagram showing an example of a check matrix initial value table for a type-A code where N=69120 bits and r=6 / 16. [Figure 37] FIG. 13 is a diagram showing an example of a check matrix initial value table for a type-A code where N=69120 bits and r=6 / 16. [Figure 38] FIG. 13 is a diagram showing an example of a check matrix initial value table for a type-A code where N=69120 bits and r=7 / 16. [Figure 39] FIG. 13 is a diagram showing an example of a check matrix initial value table for a type-A code where N=69120 bits and r=7 / 16. [Diagram 40] FIG. 13 is a diagram showing an example of a check matrix initial value table for a type-A code where N=69120 bits and r=8 / 16. [Diagram 41] FIG. 13 is a diagram showing an example of a check matrix initial value table for a type-A code where N=69120 bits and r=8 / 16. [Diagram 42] FIG. 13 is a diagram showing an example of a check matrix initial value table for a Type B code where N=69120 bits and r=7 / 16. [Diagram 43] FIG. 13 is a diagram showing an example of a check matrix initial value table for a Type B code where N=69120 bits and r=7 / 16. [Diagram 44] FIG. 13 is a diagram showing another example of a parity check matrix initial value table for a Type B code with N=69120 bits and r=7 / 16. [Diagram 45] FIG. 13 is a diagram showing another example of a check matrix initial value table for a Type B code with N=69120 bits and r=7 / 16. [Diagram 46] FIG. 13 is a diagram showing an example of a check matrix initial value table for a Type B code where N=69120 bits and r=8 / 16. [Figure 47] FIG. 13 is a diagram showing an example of a check matrix initial value table for a Type B code where N=69120 bits and r=8 / 16. [Figure 48] FIG. 13 is a diagram showing another example of a parity check matrix initial value table for a Type B code with N=69120 bits and r=8 / 16. [Figure 49] FIG. 13 is a diagram showing another example of a parity check matrix initial value table for a Type B code with N=69120 bits and r=8 / 16. [Figure 50] FIG. 13 is a diagram showing an example of a check matrix initial value table for a Type B code where N=69120 bits and r=9 / 16. [Figure 51] FIG. 13 is a diagram showing an example of a check matrix initial value table for a Type B code where N=69120 bits and r=9 / 16. [Figure 52] FIG. 13 is a diagram showing an example of a check matrix initial value table for a Type B code where N=69120 bits and r=9 / 16. [Figure 53] FIG. 13 is a diagram showing another example of a check matrix initial value table for a Type B code with N=69120 bits and r=9 / 16. [Figure 54] FIG. 13 is a diagram showing another example of a check matrix initial value table for a Type B code with N=69120 bits and r=9 / 16. [Figure 55] FIG. 13 is a diagram showing another example of a check matrix initial value table for a Type B code with N=69120 bits and r=9 / 16. [Figure 56]FIG. 13 is a diagram showing an example of a check matrix initial value table for a Type B code where N=69120 bits and r=10 / 16. [Figure 57] FIG. 13 is a diagram showing an example of a check matrix initial value table for a Type B code where N=69120 bits and r=10 / 16. [Figure 58] FIG. 13 is a diagram showing an example of a check matrix initial value table for a Type B code where N=69120 bits and r=10 / 16. [Figure 59] FIG. 13 is a diagram showing another example of a check matrix initial value table for a Type B code with N=69120 bits and r=10 / 16. [Figure 60] FIG. 13 is a diagram showing another example of a check matrix initial value table for a Type B code with N=69120 bits and r=10 / 16. [Figure 61] FIG. 13 is a diagram showing another example of a check matrix initial value table for a Type B code with N=69120 bits and r=10 / 16. [Figure 62] FIG. 13 is a diagram showing an example of a check matrix initial value table for a Type B code where N=69120 bits and r=11 / 16. [Figure 63] FIG. 13 is a diagram showing an example of a check matrix initial value table for a Type B code where N=69120 bits and r=11 / 16. [Figure 64] FIG. 13 is a diagram showing an example of a check matrix initial value table for a Type B code where N=69120 bits and r=11 / 16. [Figure 65] FIG. 13 is a diagram showing another example of a check matrix initial value table for a Type B code with N=69120 bits and r=11 / 16. [Figure 66] FIG. 13 is a diagram showing another example of a check matrix initial value table for a Type B code with N=69120 bits and r=11 / 16. [Figure 67] FIG. 13 is a diagram showing another example of a check matrix initial value table for a Type B code with N=69120 bits and r=11 / 16. [Figure 68] FIG. 13 is a diagram showing an example of a check matrix initial value table for a Type B code where N=69120 bits and r=12 / 16. [Figure 69]FIG. 13 is a diagram showing an example of a check matrix initial value table for a Type B code where N=69120 bits and r=12 / 16. [Figure 70] FIG. 13 is a diagram showing an example of a check matrix initial value table for a Type B code where N=69120 bits and r=12 / 16. [Figure 71] FIG. 13 is a diagram showing another example of a check matrix initial value table for a Type B code with N=69120 bits and r=12 / 16. [Figure 72] FIG. 13 is a diagram showing another example of a check matrix initial value table for a Type B code with N=69120 bits and r=12 / 16. [Figure 73] FIG. 13 is a diagram showing another example of a check matrix initial value table for a Type B code with N=69120 bits and r=12 / 16. [Figure 74] FIG. 13 is a diagram showing an example of a check matrix initial value table for a Type B code with N=69120 bits and r=13 / 16. [Figure 75] FIG. 13 is a diagram showing an example of a check matrix initial value table for a Type B code with N=69120 bits and r=13 / 16. [Figure 76] FIG. 13 is a diagram showing an example of a check matrix initial value table for a Type B code with N=69120 bits and r=13 / 16. [Figure 77] FIG. 13 is a diagram showing another example of a check matrix initial value table for a Type B code with N=69120 bits and r=13 / 16. [Figure 78] FIG. 13 is a diagram showing another example of a check matrix initial value table for a Type B code with N=69120 bits and r=13 / 16. [Figure 79] FIG. 13 is a diagram showing another example of a check matrix initial value table for a Type B code with N=69120 bits and r=13 / 16. [Figure 80] FIG. 13 is a diagram showing an example of a check matrix initial value table for a Type B code where N=69120 bits and r=14 / 16. [Figure 81] FIG. 13 is a diagram showing an example of a check matrix initial value table for a Type B code where N=69120 bits and r=14 / 16. [Figure 82]FIG. 13 is a diagram showing an example of a check matrix initial value table for a Type B code where N=69120 bits and r=14 / 16. [Figure 83] FIG. 13 is a diagram showing another example of a check matrix initial value table for a Type B code with N=69120 bits and r=14 / 16. [Figure 84] FIG. 13 is a diagram showing another example of a check matrix initial value table for a Type B code with N=69120 bits and r=14 / 16. [Figure 85] FIG. 13 is a diagram showing another example of a check matrix initial value table for a Type B code with N=69120 bits and r=14 / 16. [Figure 86] FIG. 13 is a diagram showing an example of a Tanner graph of an ensemble of degree sequences with column weight 3 and row weight 6. [Figure 87] FIG. 13 is a diagram showing an example of a Tanner graph of a multi-edge type ensemble. [Figure 88] FIG. 1 is a diagram illustrating a parity check matrix of the Type A method. [Figure 89] FIG. 1 is a diagram illustrating a parity check matrix of the Type A method. [Figure 90] FIG. 1 is a diagram illustrating a check matrix of the Type B method. [Figure 91] FIG. 1 is a diagram illustrating a check matrix of the Type B method. [Figure 92] FIG. 13 is a diagram showing the results of a simulation performed using a type A code with N=69120 bits and r=2 / 16. [Figure 93] FIG. 13 is a diagram showing the results of a simulation performed using a type A code with N=69120 bits and r=2 / 16. [Figure 94] FIG. 13 is a diagram showing the results of a simulation performed using a type A code with N=69120 bits and r=3 / 16. [Figure 95] FIG. 13 is a diagram showing the results of a simulation performed using a type A code with N=69120 bits and r=3 / 16. [Figure 96]FIG. 13 is a diagram showing the results of a simulation performed using a type A code with N=69120 bits and r=4 / 16. [Figure 97] FIG. 13 is a diagram showing the results of a simulation performed using a type A code with N=69120 bits and r=4 / 16. [Figure 98] FIG. 13 is a diagram showing the results of a simulation performed using a type A code with N=69120 bits and r=5 / 16. [Figure 99] FIG. 13 is a diagram showing the results of a simulation performed using a type A code with N=69120 bits and r=5 / 16. [Figure 100] FIG. 13 is a diagram showing the results of a simulation performed using a type A code with N=69120 bits and r=6 / 16. [Figure 101] FIG. 13 is a diagram showing the results of a simulation performed using a type A code with N=69120 bits and r=6 / 16. [Figure 102] FIG. 13 is a diagram showing the results of a simulation performed using a type A code with N=69120 bits and r=7 / 16. [Figure 103] FIG. 13 is a diagram showing the results of a simulation performed using a type A code with N=69120 bits and r=7 / 16. [Figure 104] FIG. 13 is a diagram showing the results of a simulation performed using a type A code with N=69120 bits and r=8 / 16. [Figure 105] FIG. 13 is a diagram showing the results of a simulation performed using a type A code with N=69120 bits and r=8 / 16. [Figure 106] FIG. 13 shows the results of a simulation performed using a Type B code with N=69120 bits and r=7 / 16. [Figure 107] FIG. 13 shows the results of a simulation performed using a Type B code with N=69120 bits and r=7 / 16. [Figure 108] FIG. 13 shows the simulation results of a simulation performed using another type-B code with N=69120 bits and r=7 / 16. [Fig. 109] FIG. 13 shows the simulation results of a simulation performed using another type-B code with N=69120 bits and r=7 / 16. [Figure 110] FIG. 13 shows the results of a simulation performed using a Type B code with N=69120 bits and r=8 / 16. [Figure 111] FIG. 13 is a diagram showing the simulation results of a simulation performed using a Type B code with N=69120 bits and r=8 / 16. [Figure 112] FIG. 13 shows the simulation results of a simulation performed using another type-B code with N=69120 bits and r=8 / 16. [Figure 113] FIG. 13 shows the simulation results of a simulation performed using another type-B code with N=69120 bits and r=8 / 16. [Fig. 114] FIG. 13 shows the results of a simulation performed using a Type B code with N=69120 bits and r=9 / 16. [Figure 115] FIG. 13 shows the results of a simulation performed using a Type B code with N=69120 bits and r=9 / 16. [Fig. 116] FIG. 13 shows the simulation results of a simulation performed using another type-B code with N=69120 bits and r=9 / 16. [Fig. 117] FIG. 13 shows the simulation results of a simulation performed using another type-B code with N=69120 bits and r=9 / 16. [Figure 118] FIG. 13 shows the results of a simulation performed using a Type B code with N=69120 bits and r=10 / 16. [Figure 119]FIG. 13 shows the results of a simulation performed using a Type B code with N=69120 bits and r=10 / 16. [Figure 120] FIG. 13 shows simulation results of a simulation performed using another type-B code with N=69120 bits and r=10 / 16. [Figure 121] FIG. 13 shows simulation results of a simulation performed using another type-B code with N=69120 bits and r=10 / 16. [Figure 122] FIG. 13 shows the results of a simulation performed using a Type B code with N=69120 bits and r=11 / 16. [Figure 123] FIG. 13 shows the results of a simulation performed using a Type B code with N=69120 bits and r=11 / 16. [Figure 124] FIG. 13 shows the simulation results of a simulation performed using another type-B code with N=69120 bits and r=11 / 16. [Fig. 125] FIG. 13 shows the simulation results of a simulation performed using another type-B code with N=69120 bits and r=11 / 16. [Fig. 126] FIG. 13 shows the results of a simulation performed using a Type B code with N=69120 bits and r=12 / 16. [Figure 127] FIG. 13 shows the results of a simulation performed using a Type B code with N=69120 bits and r=12 / 16. [Figure 128] FIG. 13 shows simulation results of a simulation performed using another type-B code with N=69120 bits and r=12 / 16. [Figure 129] FIG. 13 shows simulation results of a simulation performed using another type-B code with N=69120 bits and r=12 / 16. [Fig. 130]FIG. 13 shows the results of a simulation performed using a Type B code with N=69120 bits and r=13 / 16. [Fig. 131] FIG. 13 shows the results of a simulation performed using a Type B code with N=69120 bits and r=13 / 16. [Fig. 132] FIG. 13 shows simulation results of a simulation performed using another type-B code with N=69120 bits and r=13 / 16. [Fig. 133] FIG. 13 shows simulation results of a simulation performed using another type-B code with N=69120 bits and r=13 / 16. [Fig. 134] FIG. 13 shows the results of a simulation performed using a Type B code with N=69120 bits and r=14 / 16. [Fig. 135] FIG. 13 shows the results of a simulation performed using a Type B code with N=69120 bits and r=14 / 16. [Fig. 136] FIG. 13 shows simulation results of a simulation performed using another type-B code with N=69120 bits and r=14 / 16. [Fig. 137] FIG. 13 shows simulation results of a simulation performed using another type-B code with N=69120 bits and r=14 / 16. [Figure 138] FIG. 11 is a diagram illustrating an example of coordinates of a UC signal point when the modulation method is QPSK. [Figure 139] FIG. 13 is a diagram illustrating an example of the coordinates of signal points of a 2D NUC when the modulation method is 16QAM. [Fig. 140] FIG. 11 is a diagram showing an example of the coordinates of signal points of a 1D NUC when the modulation method is 1024QAM. [Fig. 141] FIG. 13 is a diagram showing the relationship between a 1024QAM symbol y and the real part Re(zs) and imaginary part Im(zs) of a complex number as the coordinates of a 1D NUC signal point zs corresponding to the symbol y. [Fig. 142] 13 is a block diagram showing an example of the configuration of a block interleaver 25. FIG. [Fig. 143] FIG. 2 is a diagram for explaining block interleaving performed by block interleaver 25. [Fig. 144] FIG. 2 is a diagram for explaining group-wise interleaving performed by group-wise interleaver 24. [Fig. 145] 2 is a block diagram showing an example of the configuration of a receiving device 12. FIG. [Fig. 146] FIG. 13 is a block diagram showing an example of the configuration of a bit deinterleaver 165. [Fig. 147] 11 is a flowchart illustrating an example of processing performed by the demapper 164, the bit deinterleaver 165, and the LDPC decoder 166. [Fig. 148] FIG. 2 is a diagram illustrating an example of a check matrix of an LDPC code. [Figure 149] 11 is a diagram showing an example of a matrix (transformed parity check matrix) obtained by performing row permutation and column permutation on a parity check matrix. FIG. [Fig. 150] FIG. 13 is a diagram showing an example of a transformed check matrix divided into 5×5 units. [Fig. 151] FIG. 11 is a block diagram showing an example of the configuration of a decoding device that performs P node operations collectively. [Fig. 152] 2 is a block diagram showing an example of the configuration of an LDPC decoder 166. FIG. [Fig. 153] 13 is a block diagram showing an example of the configuration of a block deinterleaver 54. FIG. [Fig. 154] 13 is a block diagram showing another example configuration of the bit deinterleaver 165. FIG. [Fig. 155] 1 is a block diagram showing a first exemplary configuration of a receiving system to which a receiving device 12 can be applied. [Fig. 156] 13 is a block diagram showing a second exemplary configuration of a receiving system to which the receiving device 12 can be applied. FIG. [Fig. 157] FIG. 13 is a block diagram showing a third exemplary configuration of a receiving system to which the receiving device 12 can be applied. [Fig. 158]It is a block diagram showing a configuration example of an embodiment of a computer to which this technology is applied.

Embodiment for Carrying Out the Invention

[0028] Hereinafter, embodiments of the present technology will be described. Before that, the LDPC code will be described.

[0029] <LDPC Code>

[0030] Note that the LDPC code is a linear code and does not necessarily have to be binary. Here, it will be described as being binary.

[0031] The LDPC code is most characterized in that the parity check matrix defining the LDPC code is sparse. Here, a sparse matrix is a matrix in which the number of "1"s in the elements of the matrix is very small (a matrix in which most elements are 0).

[0032] FIG. 1 is a diagram showing an example of the parity check matrix H of the LDPC code.

[0033] In the parity check matrix H of FIG. 1, the weight of each column (column weight) (the number of "1"s) (weight) is "3", and the weight of each row (row weight) is "6".

[0034] In encoding by the LDPC code (LDPC encoding), for example, a generator matrix G is generated based on the parity check matrix H, and the LDPC code (codeword) is generated by multiplying this generator matrix G by binary information bits.

[0035] Specifically, an encoding device that performs LDPC encoding first calculates the transpose matrix H of the parity check matrix H T and, between them, the equation GH THere, when generator matrix G is a K×N matrix, the encoding device multiplies generator matrix G by a bit string (vector u) of K information bits to generate a codeword c (=uG) of N bits. The codeword (LDPC code) generated by this encoding device is received at the receiving side via a predetermined communication path.

[0036] Decoding of LDPC codes is an algorithm proposed by Gallager called Probabilistic Decoding, and can be performed by a message passing algorithm using belief propagation on a so-called Tanner graph consisting of variable nodes (also called message nodes) and check nodes. Hereinafter, variable nodes and check nodes will be referred to simply as nodes where appropriate.

[0037] FIG. 2 is a flowchart showing the procedure for decoding an LDPC code.

[0038] In the following, the real value (received LLR) that expresses the likelihood of the value being "0" of the i-th code bit of the LDPC code (one codeword) received on the receiving side as a log likelihood ratio is referred to as the received value u 0i Also, the message output from the check node is called u j Let the message output from the variable node be v i Let us assume that.

[0039] First, in decoding an LDPC code, as shown in FIG. 2, in step S11, an LDPC code is received, and a message (check node message) u j is initialized to "0", and a variable k, which is an integer and serves as a counter for repeated processing, is initialized to "0", and the process proceeds to step S12. In step S12, the received value u0i Based on this, the message (variable node message) v is generated by performing the calculation (variable node calculation) shown in Eq. (1). i is required, and this message v i Based on this, the message u is generated by performing the operation (check node operation) shown in equation (2). j is required.

[0040]

number

[0041]

number

[0042] Here, d in Eq. (1) and Eq. (2) v and d c are parameters that can be arbitrarily selected and indicate the number of "1"s in the vertical direction (columns) and horizontal direction (rows) of the check matrix H. For example, in the case of an LDPC code ((3,6) LDPC code) for a check matrix H with a column weight of 3 and a row weight of 6 as shown in FIG. 1, d v =3,d c =6.

[0043] In the variable node operation of formula (1) and the check node operation of formula (2), messages input from edges (lines connecting variable nodes and check nodes) that are trying to output messages are not included in the operation, so the range of operation is 1 to d v -1 or 1 to d c The check node operation of equation (2) is actually performed by creating a table of function R(v1, v2) shown in equation (3), which is defined as one output for two inputs v1 and v2, in advance, and using this table continuously (recursively) as shown in equation (4).

[0044]

number

[0045]

number

[0046] In step S12, the variable k is further incremented by "1", and the process proceeds to step S13. In step S13, it is determined whether or not the variable k is greater than a predetermined number of iterative decoding cycles C. If it is determined in step S13 that the variable k is not greater than C, the process returns to step S12, and the same processes are repeated thereafter.

[0047] Also, in step S13, if it is determined that the variable k is greater than C, the process proceeds to step S14, where the operation shown in equation (5) is performed to obtain the message v i is calculated and output, and the LDPC code decoding process is completed.

[0048]

number

[0049] Here, the calculation of formula (5) is different from the variable node calculation of formula (1) in that it returns messages u from all edges connected to the variable node. j This is done using

[0050] FIG. 3 is a diagram showing an example of a parity check matrix H of a (3,6) LDPC code (coding rate 1 / 2, code length 12).

[0051] In the parity check matrix H in FIG. 3, the column weight is 3 and the row weight is 6, similarly to FIG.

[0052] FIG. 4 is a diagram showing a Tanner graph of the parity check matrix H in FIG.

[0053] Here, in Figure 4, a plus sign "+" indicates a check node, and an equal sign "=" indicates a variable node. The check nodes and variable nodes correspond to the rows and columns of the parity check matrix H, respectively. The connections between the check nodes and variable nodes are edges, which correspond to the elements "1" of the parity check matrix.

[0054] That is, when the element in the j-th row and i-th column of the parity check matrix is ​​1, the i-th variable node from the top (the node marked "=") and the j-th check node from the top (the node marked "+") in Fig. 4 are connected by a branch. The branch indicates that the code bit corresponding to the variable node has a constraint corresponding to the check node.

[0055] In a Sum Product Algorithm, which is a decoding method for LDPC codes, variable node calculations and check node calculations are performed repeatedly.

[0056] FIG. 5 is a diagram showing variable node operations performed at the variable node.

[0057] At the variable node, the message v corresponding to the branch to be calculated is i is the set of messages u1 and u2 from the remaining branches connected to the variable node, and the received value u 0i The messages corresponding to the other edges can be calculated in a similar manner.

[0058] FIG. 6 is a diagram illustrating check node operations performed at a check node.

[0059] Here, the check node operation of formula (2) can be rewritten as formula (6) using the relationship of the formula a×b=exp{ln(|a|)+ln(|b|)}×sign(a)×sign(b), where sign(x) is 1 when x≧0 and −1 when x<0.

[0060]

number

[0061] If we define the function φ(x) as φ(x)=ln(tanh(x / 2)) for x ≧ 0, then the formula φ -1 (x)=2tanh -1 (e -x ) holds, so equation (6) can be transformed into equation (7).

[0062]

number

[0063] At the check node, the check node operation of equation (2) is performed according to equation (7).

[0064] That is, at the check node, as shown in Figure 6, the message u corresponding to the branch to be calculated is j is calculated by the check node calculation of formula (7) using messages v1, v2, v3, v4, and v5 from the remaining branches connected to the check node. Messages corresponding to other branches are calculated in the same way.

[0065] The function φ(x) in equation (7) is expressed as φ(x)=ln((e x +1) / (e x -1), and for x>0, φ(x)=φ -1 (x). The functions φ(x) and φ -1 When (x) is implemented in hardware, it may be implemented using a look-up table (LUT), but both will use the same LUT.

[0066] <Example of a transmission system configuration using this technology>

[0067] FIG. 7 is a diagram showing an example of the configuration of an embodiment of a transmission system to which the present technology is applied (a system refers to a logical collection of multiple devices, and it does not matter whether the devices are located in the same housing or not).

[0068] In FIG. 7, the transmission system includes a transmitting device 11 and a receiving device 12 .

[0069] The transmitting device 11 transmits (broadcasts) (transmits), for example, a television broadcast program, etc. That is, the transmitting device 11 encodes target data to be transmitted, such as image data and audio data as a program, into an LDPC code, and transmits the encoded data via a communication path 13, such as a satellite line, terrestrial wave, or cable (wired line).

[0070] The receiving device 12 receives the LDPC code transmitted from the transmitting device 11 via the communication path 13, decodes it into target data, and outputs it.

[0071] Here, the LDPC code used in the transmission system of FIG. 7 is known to exhibit extremely high performance in an AWGN (Additive White Gaussian Noise) communication channel.

[0072] On the other hand, burst errors and erasures may occur in the communication path 13. For example, in an OFDM (Orthogonal Frequency Division Multiplexing) system, particularly when the communication path 13 is a terrestrial wave, in a multipath environment where the D / U (Desired to Undesired Ratio) is 0 dB (Undesired = echo power is equal to Desired = main path power), the power of a specific symbol may become 0 (erasure) depending on the delay of the echo (path other than the main path).

[0073] Even in the case of flutter (a communication channel with zero delay and where an echo with a Doppler frequency is added), if the D / U is 0 dB, the Doppler frequency can cause the power of the entire OFDM symbol at a specific time to become 0 (erasure).

[0074] Furthermore, burst errors may occur due to the condition of the wiring from a receiving section (not shown) such as an antenna that receives a signal from the transmitting device 11 to the receiving device 12, or due to instability in the power supply of the receiving device 12.

[0075] On the other hand, in decoding the LDPC code, in the variable node corresponding to the column of the check matrix H, and in turn, the code bit of the LDPC code (the received value u 0i Since the variable node calculation of equation (1) involves the addition of (a), if an error occurs in the code bit used in the variable node calculation, the accuracy of the obtained message decreases.

[0076] In decoding an LDPC code, at a check node, the check node calculation of equation (7) is performed using a message obtained at a variable node connected to that check node. Therefore, if there are a large number of check nodes where multiple connected variable nodes (corresponding code bits of the LDPC code) simultaneously have errors (including erasures), the decoding performance deteriorates.

[0077] That is, for example, when two or more variable nodes connected to the check node are simultaneously erased, the check node returns to all the variable nodes a message with equal probability of the value being 0 and the value being 1. In this case, the check node returning the message with equal probability does not contribute to one decoding process (one set of variable node calculation and check node calculation), and as a result, the decoding process needs to be repeated many times, degrading the decoding performance and increasing the power consumption of the receiving device 12 that decodes the LDPC code.

[0078] Therefore, in the transmission system of FIG. 7, it is possible to improve the tolerance to burst errors and erasures while maintaining the performance in an AWGN communication path (AWGN channel).

[0079] <Configuration example of the transmitting device 11>

[0080] FIG. 8 is a block diagram showing an example of the configuration of the transmission device 11 of FIG.

[0081] In the transmitting device 11, one or more input streams as target data are supplied to a mode adaptation / multiplexer 111.

[0082] 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 .

[0083] The padder 112 performs necessary zero padding (insertion of nulls) on the data from the mode adaptation / multiplexer 111 and supplies the resulting data to a BB scrambler 113.

[0084] The BB scrambler 113 performs BB scrambling (Base-Band Scrambling) on ​​the data from the padder 112 and supplies the resulting data to a BCH encoder 114 .

[0085] 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 to be LDPC-encoded.

[0086] The LDPC encoder 115 performs LDPC encoding on the LDPC target data from the BCH encoder 114 in accordance with, for example, a check matrix in which the parity matrix, which is the part corresponding to the parity bits of the LDPC code, has a dual diagonal structure, and outputs an LDPC code in which the LDPC target data is information bits.

[0087] That is, the LDPC encoder 115 performs LDPC encoding on the LDPC target data, for example, into an LDPC code (corresponding to a parity check matrix) defined in a predetermined standard such as DVB-S.2, DVB-T.2, DVB-C.2, ATSC3.0, or another LDPC code, and outputs the resulting LDPC code.

[0088] Here, the LDPC code defined in the DVB-S.2 and ATSC3.0 standards and the LDPC code to be adopted in ATSC3.0 are IRA (Irregular Repeat Accumulate) codes, and the parity matrix (part or all) in the check matrix of the LDPC code has a staircase structure. The parity matrix and the staircase structure will be described later. The IRA code is described, for example, in "Irregular Repeat-Accumulate Codes," H. Jin, A. Khandekar, and RJ McEliece, in Proceedings of 2nd International Symposium on Turbo codes and Related Topics, pp. 1-8, Sept. 2000.

[0089] The LDPC code output by the LDPC encoder 115 is supplied to a bit interleaver 116 .

[0090] The bit interleaver 116 performs bit interleaving, which will be described later, on the LDPC code from the LDPC encoder 115 , and supplies the bit-interleaved LDPC code to a mapper 117 .

[0091] The mapper 117 performs orthogonal modulation (multi-level modulation) by mapping 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 units) of the LDPC code.

[0092] That is, the mapper 117 performs orthogonal modulation by mapping the LDPC code from the bit interleaver 116 to a signal point determined by a modulation method that performs orthogonal modulation of the LDPC code on an IQ plane (IQ constellation) defined by an I axis representing an I component in phase with the carrier wave and a Q axis representing a Q component orthogonal to the carrier wave.

[0093] The number of signal points determined by the modulation method of the quadrature modulation performed by the mapper 117 is 2 m In this case, the m-bit code bits of the LDPC code are treated as a symbol (1 symbol), and the mapper 117 divides the LDPC code from the bit interleaver 116 into 2 m are mapped to a signal point representing a symbol among the signal points.

[0094] Here, the modulation method of the quadrature modulation performed by the mapper 117 includes, for example, modulation methods defined in the standards such as DVB-S.2 and ATSC3.0, and other modulation methods, that is, for example, BPSK (Binary Phase Shift Keying), QPSK (Quadrature Phase Shift Keying), 8PSK (Phase-Shift Keying), 16APSK (Amplitude Phase-Shift Keying), 32APSK, 16QAM (Quadrature Amplitude Modulation), 16QAM, 64QAM, 256QAM, 1024QAM, 4096QAM, 4PAM (Pulse Amplitude Modulation), etc. In the mapper 117, which modulation method is used for the quadrature modulation is set in advance according to, for example, the operation of the operator of the transmission device 11.

[0095] The data obtained by the processing in the mapper 117 (the mapping result of mapping symbols to signal points) is supplied to a time interleaver 118 .

[0096] The time interleaver 118 performs time interleaving (interleaving in the time direction) on a symbol-by-symbol basis on the data from the mapper 117, and supplies the resulting data to a SISO / MISO (Single Input Single Output / Multiple Input Single Output) encoder) 119.

[0097] The SISO / MISO encoder 119 performs space-time coding on the data from the time interleaver 118 and supplies the result to a frequency interleaver 120 .

[0098] The frequency interleaver 120 performs frequency interleaving (interleaving in the frequency direction) on a symbol-by-symbol basis on the data from the SISO / MISO encoder 119 , and supplies the data to a frame builder & resource allocation unit (Frame Builder & Resource Allocation) 131 .

[0099] On the other hand, the BCH encoder 121 is supplied with control data (signalling) for transmission control, such as BB signaling (Base Band Signalling) (BB Header), for example.

[0100] The BCH encoder 121 BCH-encodes the control data supplied thereto in the same manner as the BCH encoder 114 , and supplies the resulting data to the LDPC encoder 122 .

[0101] The LDPC encoder 122 LDPC-encodes 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 mapper 123 .

[0102] Similar to mapper 117, mapper 123 performs orthogonal modulation by mapping the LDPC code from LDPC encoder 122 to a signal point representing one symbol of orthogonal modulation in units of one or more code bits (symbol units) of the LDPC code, and supplies the resulting data to frequency interleaver 124.

[0103] Similar to the frequency interleaver 120 , the frequency interleaver 124 performs frequency interleaving on the data from the mapper 123 in symbol units, and supplies the data to a frame builder / resource allocation unit 131 .

[0104] The frame builder / resource allocation unit 131 inserts pilot symbols into required positions in the data (symbols) from the frequency interleavers 120 and 124, and constructs a frame consisting of a predetermined number of symbols (e.g., a PL (Physical Layer) frame, a T2 frame, a C2 frame, etc.) from the resulting data (symbols), and supplies it to an OFDM generation unit 132.

[0105] The OFDM generating unit 132 generates an OFDM signal corresponding to the frame from the frame supplied from the frame builder / resource allocating unit 131, and transmits the signal via the communication path 13 (FIG. 7).

[0106] The transmitting device 11 can be configured without some of the blocks shown in FIG. 8, such as the time interleaver 118, the SISO / MISO encoder 119, the frequency interleaver 120, and the frequency interleaver 124.

[0107] <Example of the configuration of the bit interleaver 116>

[0108] FIG. 9 is a block diagram showing an example of the configuration of the bit interleaver 116 in FIG.

[0109] The bit interleaver 116 has a function of interleaving data, and is made up of a parity interleaver 23 , a group-wise interleaver 24 , and a block interleaver 25 .

[0110] The parity interleaver 23 performs parity interleaving to interleave the parity bits of the LDPC code from the LDPC encoder 115 at the positions of other parity bits, and supplies the LDPC code after the parity interleaving to the group-wise interleaver 24.

[0111] The group-wise interleaver 24 performs group-wise interleaving on the LDPC code from the parity interleaver 23 , and supplies the LDPC code after the group-wise interleaving to a block interleaver 25 .

[0112] Here, in group-wise interleaving, an LDPC code for one code is divided into 360-bit units, which is equal to a unit size P described later, from the beginning, and the 360 ​​bits of one division are treated as a bit group, and the LDPC code from the parity interleaver 23 is interleaved in bit group units.

[0113] When group-wise interleaving is performed, the error rate can be improved compared to when group-wise interleaving is not performed, and as a result, good communication quality can be ensured in data transmission.

[0114] The block interleaver 25 performs block interleaving to demultiplex the LDPC code from the group-wise interleaver 24. For example, the LDPC code for one codeword is symbolized into m-bit symbols, which are the units of mapping, and supplied to the mapper 117 (Fig. 8).

[0115] Here, in block interleaving, for example, columns as storage areas for storing a predetermined number of bits in the column (vertical) direction are arranged in the row (horizontal) direction in a storage area with a number equal to the number of bits m of the symbol. The LDPC code from the group-wise interleaver 24 is written in the column direction and read in the row direction, so that the LDPC code is symbolized into m-bit symbols.

[0116] <Check matrix of LDPC code>

[0117] Fig. 10 is a diagram showing an example of the check matrix H used for LDPC encoding in the LDPC encoder 115 of Fig. 8.

[0118] The check matrix H has an LDGM (Low-Density Generation Matrix) structure. The information matrix H of the part corresponding to the information bits among the code bits of the LDPC code A and the parity matrix H corresponding to the parity bits T can be expressed by the formula H = [H A | H T (a matrix with the elements of the information matrix H as the left-side elements and the elements of the parity matrix H A as the right-side elements). T Here, the number of bits of the information bits and the number of bits of the parity bits among the code bits of one LDPC code (one codeword) are referred to as the information length K and the parity length M, respectively, and the number of bits of the code bits of one (one codeword) LDPC code is referred to as the code length N (= K + M).

[0119]

[0120] ​The information length K and parity length M for an LDPC code with a certain code length N are determined by the coding rate. Also, the check matrix H is a matrix with M×N rows and N columns (a matrix with M rows and N columns). A is an M × K matrix, and the parity matrix H T is an M × M matrix.

[0121] FIG. 11 shows a parity matrix H of a check matrix H used for LDPC encoding in the LDPC encoder 115 of FIG. T FIG.

[0122] Parity matrix H of check matrix H used for LDPC encoding by LDPC encoder 115 T For example, a parity matrix H similar to the check matrix H of the LDPC code defined in standards such as DVB-T.2 is used. T can be adopted.

[0123] Parity matrix H of the check matrix H of the LDPC code specified in standards such as DVB-T.2 T As shown in FIG. 11, the parity matrix H T The row weight is 1 for the first row and 2 for all remaining rows. The column weight is 1 for the last column and 2 for all remaining columns.

[0124] As mentioned above, the parity matrix H T An LDPC code for a check matrix H having a staircase structure can be easily generated by using the check matrix H.

[0125] That is, the LDPC code (one code word) is represented by a row vector c, and the column vector obtained by transposing the row vector is represented by c. T In addition, the information bit portion of row vector c, which is an LDPC code, is represented by row vector A, and the parity bit portion is represented by row vector T.

[0126] In this case, row vector c can be expressed as c = [A|T] (a row vector with the elements of row vector A as the left elements and the elements of row vector T as the right elements) with row vector A as the information bits and row vector T as the parity bits.

[0127] The check matrix H and the row vector c=[A|T] as the LDPC code are expressed by the formula Hc T = 0, and the formula Hc T = 0, the row vector T as the parity bit that constitutes the row vector c = [A|T] is the check matrix H = [H A |H T ]'s parity matrix H T When the step structure shown in FIG. 11 is used, the formula Hc T = 0 column vector Hc T This can be found sequentially (in order) by setting the elements of each row to 0, starting from the first row.

[0128] FIG. 12 is a diagram for explaining a check matrix H of an LDPC code defined in standards such as DVB-T.2.

[0129] The first KX columns of the check matrix H of an LDPC code defined in standards such as DVB-T.2 have a column weight of X, the next K3 columns have a column weight of 3, the next M-1 columns have a column weight of 2, and the last column has a column weight of 1.

[0130] Here, KX+K3+M-1+1 is equal to the code length N.

[0131] FIG. 13 is a diagram showing the column numbers KX, K3, and M, and the column weight X for each coding rate r of the LDPC code defined in standards such as DVB-T.2.

[0132] Standards such as DVB-T.2 prescribe LDPC codes with code lengths N of 64,800 bits and 16,200 bits.

[0133] For an LDPC code with a code length N of 64,800 bits, eleven 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 specified, and for an LDPC code with a code length N of 16,200 bits, ten nominal rates 1 / 4, 1 / 3, 2 / 5, 1 / 2, 3 / 5, 2 / 3, 3 / 4, 4 / 5, 5 / 6, and 8 / 9 are specified.

[0134] Hereinafter, a code length N of 64,800 bits will also be referred to as 64 kbits, and a code length N of 16,200 bits will also be referred to as 16 kbits.

[0135] Regarding LDPC codes, the code bits corresponding to columns with larger column weights in the parity check matrix H tend to have lower error rates.

[0136] In the check matrix H defined in standards such as DVB-T.2 and shown in Figures 12 and 13, the column weight tends to be larger toward the beginning (left side). Therefore, for the LDPC code corresponding to the check matrix H, the code bits at the beginning tend to be more resistant to errors (more resistant to errors), and the code bits at the end tend to be more vulnerable to errors.

[0137] <Parity interleave>

[0138] 14 to 16, the parity interleaving by the parity interleaver 23 of FIG. 9 will be described.

[0139] FIG. 14 is a diagram showing an example (part of) a Tanner graph of a parity check matrix of an LDPC code.

[0140] As shown in Fig. 14, when two or more of the variable nodes (corresponding code bits) connected to the check node simultaneously become erroneous such as erasure, the check node returns a message to all variable nodes connected to the check node, with equal probability that the value is 0 and that the value is 1. For this reason, when multiple variable nodes connected to the same check node simultaneously become erroneous such as erasure, the decoding performance deteriorates.

[0141] Incidentally, the LDPC code output by the LDPC encoder 115 in FIG. 8 is an IRA code, similar to the LDPC code defined in standards such as DVB-T.2, and the parity matrix H T As shown in Figure 11, it has a staircase structure.

[0142] Figure 15 shows the parity matrix H T and its parity matrix H T FIG. 1 is a diagram showing an example of a Tanner graph corresponding to

[0143] A in Fig. 15 shows the step structure of the parity matrix H T FIG. 15B shows an example of the parity matrix H T The Tanner graph corresponding to

[0144] The parity matrix H has a step structure. T In the parity matrix H, elements with a value of 1 are adjacent (except for the first row). T In the Tanner graph of, the parity matrix H T Two adjacent variable nodes corresponding to a column of two adjacent elements with a value of 1 are connected to the same check node.

[0145] Therefore, when parity bits corresponding to the above-mentioned two adjacent variable nodes become erroneous at the same time due to a burst error, erasure, or the like, the check nodes connected to the two variable nodes (variable nodes that use the parity bits to find a message) corresponding to the two erroneous parity bits return messages with equal probability of being 0 and 1 to the variable nodes connected to those check nodes, degrading the decoding performance.And, when the burst length (the number of consecutive erroneous parity bits) becomes large, the number of check nodes that return messages with equal probability increases, further degrading the decoding performance.

[0146] Therefore, in order to prevent the above-mentioned degradation of decoding performance, the parity interleaver 23 (FIG. 9) performs parity interleaving to interleave the parity bits of the LDPC code from the LDPC encoder 115 at the positions of other parity bits.

[0147] FIG. 16 shows a parity matrix H of a check matrix H corresponding to an LDPC code after parity interleaving performed by the parity interleaver 23 in FIG. T FIG.

[0148] Here, the information matrix H of the check matrix H corresponding to the LDPC code output by the LDPC encoder 115 is A has a cyclic structure, similar to the information matrix of the check matrix H corresponding to the LDPC code defined in standards such as DVB-T.2.

[0149] A cyclic structure refers to a structure in which a column is equal to a cyclic shift of another column, and includes, for example, a structure in which the position of 1 in each row of each of P columns is cyclically shifted in the column direction by a predetermined value, such as a value proportional to the value q obtained by dividing the first column of the P columns by the parity length M. Hereinafter, the P columns in the cyclic structure will be referred to as the unit size as appropriate.

[0150] As described with reference to Figs. 12 and 13, there are two types of LDPC codes defined in standards such as DVB-T.2, with code lengths N of 64,800 bits and 16,200 bits, and for both of these two types of LDPC codes, the unit size P is defined as 360, which is one of the divisors of the parity length M excluding 1 and M.

[0151] Also, the parity length M is a value other than a prime number expressed by the formula M=q×P=q×360, with the value q varying depending on the coding rate. Therefore, like the unit size P, the value q is one of the divisors of the parity length M other than 1 and M, and is obtained by dividing the parity length M by the unit size P (the product of P and q, which are divisors of the parity length M, is the parity length M).

[0152] As described above, the parity interleaver 23 interleaves the K+qx+y+1-th code bit of the code bits of the N-bit LDPC code into the K+Py+x+1-th code bit position, where K is the information length, x is an integer greater than or equal to 0 and less than P, and y is an integer greater than or equal to 0 and less than q, as parity interleaving.

[0153] The K+qx+y+1th code bit and the K+Py+x+1th code bit are both parity bits since they are code bits after the K+1th bit. Therefore, according to parity interleaving, the position of the parity bit of the LDPC code is moved.

[0154] With this type of parity interleaving, variable nodes (corresponding parity bits) connected to the same check node are spaced apart by the unit size P, i.e., 360 bits in this case. Therefore, if the burst length is less than 360 bits, it is possible to avoid a situation in which multiple variable nodes connected to the same check node experience an error at the same time, thereby improving resistance to burst errors.

[0155] In addition, the LDPC code after parity interleaving in which the K+qx+y+1th code bit is interleaved at the K+Py+x+1th code bit position matches the LDPC code of a check matrix (hereinafter also referred to as a transformed check matrix) obtained by performing column permutation in which the K+qx+y+1th column of the original check matrix H is replaced with the K+Py+x+1th column.

[0156] Furthermore, in the parity matrix of the converted check matrix, as shown in FIG. 16, a quasi-cyclic structure appears with P columns (360 columns in FIG. 16) as a unit.

[0157] Here, the pseudo-cyclic structure means a structure in which all but a few parts are cyclic structures.

[0158] The transformed check matrix obtained by performing column permutation equivalent to parity interleaving on the check matrix of the LDPC code defined in standards such as DVB-T.2 has a 360 row by 360 column portion in the upper right corner of the transformed check matrix (the shift matrix described below) that is missing one element of 1 (it becomes an element of 0). In that respect, it is not a (completely) cyclic structure, but rather a quasi-cyclic structure.

[0159] The conversion check matrix for the check matrix of the LDPC code output by the LDPC encoder 115 has a quasi-cyclic structure, similar to the conversion check matrix for the check matrix of the LDPC code defined in standards such as DVB-T.2.

[0160] In addition, the transformed check matrix in Figure 16 is a matrix in which, in addition to column permutation equivalent to parity interleaving, row permutation (row permutation) has also been performed on the original check matrix H so that the transformed check matrix is ​​composed of the constituent matrices described below.

[0161] FIG. 17 is a flowchart illustrating the processing performed by the LDPC encoder 115, the bit interleaver 116, and the mapper 117 in FIG.

[0162] The LDPC encoder 115 waits for the LDPC target data to be supplied from the BCH encoder 114, and in step S101 encodes the LDPC target data into an LDPC code and supplies the LDPC code to the bit interleaver 116, after which the process proceeds to step S102.

[0163] In step S102, the bit interleaver 116 performs bit interleaving on the LDPC code from the LDPC encoder 115, and supplies the symbols obtained by the bit interleaving to the mapper 117, and the process proceeds to step S103.

[0164] That is, in step S102, in the bit interleaver 116 (FIG. 9), the parity interleaver 23 performs parity interleaving on the LDPC code from the LDPC encoder 115, and supplies the LDPC code after the parity interleaving to the group-wise interleaver 24.

[0165] The group-wise interleaver 24 performs group-wise interleaving on the LDPC code from the parity interleaver 23 , and supplies the result to a block interleaver 25 .

[0166] The block interleaver 25 performs block interleaving on the LDPC code after group-wise interleaving by the group-wise interleaver 24 , and supplies the m-bit symbol obtained as a result to the mapper 117 .

[0167] In step S103, the mapper 117 converts the symbols from the block interleaver 25 into binary symbols determined by the modulation method of the quadrature modulation performed by the mapper 117. m signal points and orthogonally modulated, and the resulting data is supplied to a time interleaver 118.

[0168] As described above, by performing parity interleaving or group-wise interleaving, it is possible to improve the error rate when a plurality of code bits of an LDPC code are transmitted as one symbol.

[0169] Here, in FIG. 9, for ease of explanation, parity interleaver 23, which is a block that performs parity interleaving, and groupwise interleaver 24, which is a block that performs groupwise interleaving, are configured separately, but parity interleaver 23 and groupwise interleaver 24 can be configured as an integrated unit.

[0170] In other words, both parity interleaving and group-wise interleaving can be performed by writing and reading code bits to memory, and can be represented by a matrix that converts the address at which the code bits are written (write address) into the address at which the code bits are read (read address).

[0171] Therefore, if a matrix obtained by multiplying a matrix representing parity interleaving by a matrix representing group-wise interleaving is obtained, parity interleaving can be performed by converting the code bits using these matrices, and the result of group-wise interleaving of the LDPC code after the parity interleaving can be obtained.

[0172] In addition to the parity interleaver 23 and the group-wise interleaver 24, the block interleaver 25 can also be configured integrally.

[0173] That is, the block interleaving performed by the block interleaver 25 can also be expressed by a matrix that converts the write addresses of the memory that stores the LDPC code into read addresses.

[0174] Therefore, if a matrix obtained by multiplying a matrix representing a parity interleaving, a matrix representing a group-wise interleaving, and a matrix representing a block interleaving is obtained, these matrices can perform parity interleaving, group-wise interleaving, and block interleaving all at once.

[0175] Note that one or both of the parity interleaving and the group-wise interleaving can be omitted.

[0176] <Configuration Example of LDPC Encoder 115>

[0177] FIG. 18 is a block diagram showing a configuration example of the LDPC encoder 115 in FIG. 8.

[0178] Note that the LDPC encoder 122 in FIG. 8 is also configured in the same manner.

[0179] As described with reference to FIGS. 12 and 13, in standards such as DVB-T.2, LDPC codes with two code lengths N of 64,800 bits and 16,200 bits are defined.

[0180] For the LDPC code with a code length N of 64,800 bits, 11 coding rates of 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. For the LDPC code with a code length N of 16,200 bits, 10 coding rates of 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).

[0181] The LDPC encoder 115 can perform encoding (error correction encoding) using LDPC codes with such coding rates for code lengths N of 64,800 bits and 16,200 bits, respectively, according to a check matrix H prepared for each code length N and each coding rate.

[0182] Additionally, the LDPC encoder 115 can perform LDPC encoding in accordance with a check matrix H of an LDPC code with an arbitrary code length N and an arbitrary coding rate r.

[0183] The LDPC encoder 115 includes an encoding processing unit 601 and a storage unit 602 .

[0184] The encoding processing unit 601 is composed of a coding rate setting unit 611, an initial value table reading unit 612, a check matrix generation unit 613, an information bit reading unit 614, an encoding parity calculation unit 615, and a control unit 616, and performs LDPC encoding of the LDPC target data supplied to the LDPC encoder 115, and supplies the resulting LDPC code to the bit interleaver 116 (FIG. 8).

[0185] That is, the coding rate setting unit 611 sets the code length N and coding rate r of the LDPC code, and other specific information for specifying the LDPC code, in response to, for example, an operation by an operator.

[0186] The initial value table reading unit 612 reads from the storage unit 602 a check matrix initial value table, which will be described later, indicating a check matrix of an LDPC code specified by the specification information set by the coding rate setting unit 611 .

[0187] The check matrix generating unit 613 generates a check matrix H based on the check matrix initial value table read by the initial value table reading unit 612, and stores the check matrix H in the storage unit 602. For example, the check matrix generating unit 613 generates an information matrix H corresponding to an information length K (=code length N-parity length M) according to the code length N and coding rate r set by the coding rate setting unit 611. A The check matrix H is generated by arranging elements of 1 in the column direction at a period of 360 columns (unit size P), and is stored in the storage unit 602.

[0188] The information bit reading unit 614 reads (extracts) information bits of an information length K from the LDPC target data supplied to the LDPC encoder 115.

[0189] The encoded parity calculation unit 615 reads out the check matrix H generated by the check matrix generation unit 613 from the memory unit 602, and uses the check matrix H to calculate parity bits for the information bits read out by the information bit reading unit 614 based on a predetermined formula, thereby generating a codeword (LDPC code).

[0190] The control unit 616 controls each block constituting the encoding processing unit 601 .

[0191] The storage unit 602 stores a plurality of check matrix initial value tables and the like corresponding to a plurality of coding rates and the like shown in Fig. 12 and Fig. 13 for each code length N of, for example, 64800 bits, 16200 bits, etc. Also, the storage unit 602 temporarily stores data necessary for the processing of the encoding processing unit 601.

[0192] FIG. 19 is a flowchart illustrating an example of the processing of the LDPC encoder 115 in FIG.

[0193] In step S201, the coding rate setting unit 611 sets the code length N and coding rate r for performing LDPC coding, and other specific information for specifying the LDPC code.

[0194] In step S202, the initial value table reading unit 612 reads from the storage unit 602 a predetermined check matrix initial value table specified by the code length N, the coding rate r, and the like, which are specified information set by the coding rate setting unit 611.

[0195] In step S203, the check matrix generation unit 613 uses the check matrix initial value table read out from the memory unit 602 by the initial value table reading unit 612 to determine (generate) a check matrix H of the LDPC code having the code length N and coding rate r set by the coding rate setting unit 611, and supplies the check matrix H to the memory unit 602 for storage.

[0196] In step S204, the information bit reading unit 614 reads out information bits of an information length K (=N×r) corresponding to the code length N and coding rate r set by the coding rate setting unit 611 from the LDPC target data supplied to the LDPC encoder 115, and also reads out the check matrix H calculated by the check matrix generation unit 613 from the storage unit 602 and supplies it to the encoding parity calculation unit 615.

[0197] In step S205, the encoded parity calculation unit 615 uses the information bits from the information bit reading unit 614 and the check matrix H to sequentially calculate parity bits of the codeword c that satisfies equation (8).

[0198] Hc T =0 (8)

[0199] In equation (8), c represents a row vector as a codeword (LDPC code), and T represents the transpose of the row vector c.

[0200] Here, as described above, in the row vector c as an LDPC code (one code word), when the information bit portion is represented by row vector A and the parity bit portion is represented by row vector T, the row vector c can be expressed by the equation c = [A|T] with row vector A as the information bit and row vector T as the parity bit.

[0201] The check matrix H and the row vector c=[A|T] as the LDPC code are expressed by the formula Hc T = 0, and the formula Hc T = 0, the row vector T as the parity bit that constitutes the row vector c = [A|T] is the check matrix H = [H A |H T ]'s parity matrix H T When the step structure shown in FIG. 11 is used, the formula Hc T = 0 column vector Hc TThis can be calculated sequentially by setting the elements of each row to 0, starting from the first row.

[0202] The encoded parity calculation unit 615 calculates a parity bit T for the information bit A from the information bit reading unit 614, and outputs a codeword c = [A|T] represented by the information bit A and the parity bit T as the LDPC encoding result of the information bit A.

[0203] After that, in step S206, the control unit 616 judges whether or not to end the LDPC encoding. In step S206, if it is judged that the LDPC encoding is not to end, that is, for example, if there is still LDPC target data to be LDPC encoded, the process returns to step S201 (or step S204), and the processes of steps S201 (or step S204) to S206 are repeated.

[0204] Also, in step S206, if it is determined that the LDPC encoding is to be ended, that is, for example, if there is no LDPC target data to be LDPC encoded, LDPC encoder 115 ends the process.

[0205] For the LDPC encoder 115, a check matrix initial value table (representing a check matrix) of LDPC codes having various code lengths N and coding rates r can be prepared in advance. The LDPC encoder 115 can perform LDPC encoding into LDPC codes having various code lengths N and coding rates r by using a check matrix H generated from the check matrix initial value table prepared in advance.

[0206] <Example of check matrix initial value table>

[0207] The check matrix initial value table is, for example, an information matrix H corresponding to an information length K according to the code length N and the coding rate r of the LDPC code (LDPC code defined by the check matrix H) of the check matrix H. AThis is a table that indicates the position of elements of 1 in (FIG. 10) for every 360 columns (unit size P), and is created in advance for each parity check matrix H of each code length N and each coding rate r.

[0208] That is, the check matrix initial value table includes at least the information matrix H A Represents the position of element 1 for every 360 columns (unit size P).

[0209] In addition, the check matrix H contains a parity matrix H T All of the check matrices have a step structure, and the parity matrix H T There is a parity check matrix in which a part of it has a staircase structure and the remaining part is a diagonal matrix (unit matrix).

[0210] Below, the parity matrix H T The representation method of the parity check matrix initial value table, which represents a parity check matrix in which a part of the matrix has a staircase structure and the remaining part is a diagonal matrix, is also called the Type A method. T The representation method of the check matrix initial value table representing the check matrix in which all of the check matrices have a staircase structure is also called the Type B method.

[0211] An LDPC code for a check matrix represented by a check matrix initial value table of the Type A method is also called a Type A code, and an LDPC code for a check matrix represented by a check matrix initial value table of the Type B method is also called a Type B code.

[0212] The designations "Type A" and "Type B" are based on the ATSC 3.0 standard. For example, ATSC 3.0 uses both Type A and Type B codes.

[0213] In addition, type B coding is adopted in DVB-T.2 and the like.

[0214] FIG. 20 is a diagram showing an example of a parity check matrix initial value table of the Type B method.

[0215] That is, FIG. 20 shows a check matrix initial value table (representing check matrix H) for a type B code having a code length N of 16,200 bits and a coding rate (the notational coding rate in DVB-T.2) r of 1 / 4, as specified in the DVB-T.2 standard.

[0216] The check matrix generating unit 613 (FIG. 18) uses the check matrix initial value table of the Type B method to obtain the check matrix H as follows.

[0217] FIG. 21 is a diagram for explaining a method of obtaining a check matrix H from a check matrix initial value table of the Type B method.

[0218] That is, FIG. 21 shows a check matrix initial value table for a type B code having a code length N of 16200 bits and a coding rate r of 2 / 3, which is defined in the DVB-T.2 standard.

[0219] The check matrix initial value table of the Type B method is an information matrix H corresponding to an information length K according to the code length N and the coding rate r of the LDPC code. A In the i-th row, row numbers of elements that are 1 in the 1+360×(i-1)-th column of the parity check matrix H (row numbers assuming that the row number of the 1st row of the parity check matrix H is 0) are listed as many times as the column weight of the 1+360×(i-1)-th column.

[0220] Here, the parity matrix H corresponding to the parity length M of the check matrix H of the Type B method is T Since (FIG. 10) is determined to have a staircase structure as shown in FIG. 15, the information matrix H corresponding to the information length K is determined by the check matrix initial value table. A If (FIG. 10) can be obtained, the check matrix H can be obtained.

[0221] The number of rows k+1 of the check matrix initial value table of the Type B method varies depending on the information length K.

[0222] The relationship of equation (9) holds between the information length K and the number of rows (k+1) of the parity check matrix initial value table.

[0223] K = (k + 1) × 360 (9)

[0224] Here, 360 in equation (9) is the unit size P described in FIG.

[0225] In the parity check matrix initial value table in FIG. 21, 13 numerical values ​​are arranged in the first to third rows, and 3 numerical values ​​are arranged in the fourth to k+1 rows (the 30th row in FIG. 21).

[0226] Therefore, the column weight of the parity check matrix H obtained from the parity check matrix initial value table in FIG. 21 is 13 from the 1st column to the 1+360×(3−1)−1th column, and is 3 from the 1+360×(3−1)th column to the Kth column.

[0227] The first row of the parity check matrix initial value table in Figure 21 is 0, 2084, 1613, 1548, 1286, 1460, 3196, 4297, 2481, 3369, 3451, 4620, 2622, which indicates that in the first column of parity check matrix H, the elements of the rows with row numbers 0, 2084, 1613, 1548, 1286, 1460, 3196, 4297, 2481, 3369, 3451, 4620, 2622 are 1 (and the other elements are 0).

[0228] In addition, the second row of the parity check matrix initial value table in Figure 21 is 1,122,1516,3448,2880,1407,1847,3799,3529,373,971,4358,3108, which indicates that in the 361st (=1+360×(2-1))th column of parity check matrix H, the elements of the rows with row numbers 1,122,1516,3448,2880,1407,1847,3799,3529,373,971,4358,3108 are 1.

[0229] As described above, the check matrix initial value table is the information matrix H A Represents the position of elements with a value of 1 in every 360 columns.

[0230] Columns other than the 1+360×(i-1)th column of the check matrix H, i.e., each column from the 2+360×(i-1)th column to the 360×ith column, are arranged by periodically cyclically shifting an element of 1 in the 1+360×(i-1)th column, as determined by the check matrix initial value table, downward (downward in the column) according to the parity length M.

[0231] That is, for example, the 2+360×(i-1)th column is the 1+360×(i-1)th column cyclically shifted downward by M / 360(=q), and the next 3+360×(i-1)th column is the 1+360×(i-1)th column cyclically shifted downward by 2×M / 360(=2×q) (the 2+360×(i-1)th column cyclically shifted downward by M / 360(=q)).

[0232] Now, let the value in the i-th row (i-th from the top) and j-th column (j-th from the left) of the check matrix initial value table be h i,j The row number of the j-th element of 1 in the w-th column of the check matrix H is expressed as H w-j Then, the row number H of the element of 1 in the w-th column, which is a column other than the 1+360×(i-1)-th column of the check matrix H, is w-j can be calculated using equation (10).

[0233] H w-j =mod{h i,j +mod((w-1),P)×q,M) (10)

[0234] Here, mod(x,y) means the remainder when x is divided by y.

[0235] Moreover, P is the unit size described above, and in this embodiment, it is 360, similar to the standards such as DVB-T.2 and ATSC3.0. Furthermore, q is a value M / 360 obtained by dividing the parity length M by the unit size P (=360).

[0236] The check matrix generating unit 613 (FIG. 18) identifies the row number of the element equal to 1 in the 1+360×(i−1)th column of the check matrix H, using the check matrix initial value table.

[0237] Furthermore, the check matrix generation unit 613 (FIG. 18) calculates the row number H of the element 1 in the w-th column, which is a column other than the 1+360×(i−1)-th column of the check matrix H. w-j is calculated according to equation (10), and a check matrix H is generated in which the elements of the row numbers obtained above are set to 1.

[0238] FIG. 22 is a diagram showing the structure of parity check matrix H of the Type A method.

[0239] The check matrix of the Type A method is made up of an A matrix, a B matrix, a C matrix, a D matrix, and a Z matrix.

[0240] Matrix A is an upper left matrix of parity check matrix H, with M1 rows and K columns, expressed by a predetermined value M1 and information length K of the LDPC code=code length N×coding rate r.

[0241] The B matrix is ​​a step structure matrix adjacent to the right of the A matrix, with M1 rows and M1 columns.

[0242] The C matrix is ​​a matrix adjacent below the A matrix and the B matrix, with N-K-M1 rows and K+M1 columns.

[0243] The D matrix is ​​an identity matrix adjacent to the right of the C matrix, with N-K-M1 rows and N-K-M1 columns.

[0244] The Z matrix is ​​a zero matrix (0 matrix) adjacent to the right of the B matrix, with M1 rows and NK-M1 columns.

[0245] In the type A check matrix H composed of the above-mentioned A matrices through D matrices and Z matrix, the A matrix and a part of the C matrix constitute an information matrix, and the remaining parts of the B matrix, the C matrix, the D matrix, and the Z matrix constitute a parity matrix.

[0246] Since matrix B is a matrix with a staircase structure and matrix D is a unit matrix, a part of the parity matrix of check matrix H of the Type A method (the part of matrix B) has a staircase structure and the remaining part (the part of matrix D) is a diagonal matrix (unit matrix).

[0247] Like the information matrix of the parity check matrix H of the Type B method, the A matrix and the C matrix have a cyclic structure for each column of unit size P (e.g., 360 columns), and the parity check matrix initial value table of the Type A method represents the positions of elements of 1 in the A matrix and the C matrix for each 360 columns.

[0248] Here, as described above, the A matrix and a part of the C matrix constitute an information matrix, so it can be said that the Type A method check matrix initial value table, which represents the positions of elements of 1 in the A matrix and the C matrix every 360 columns, at least represents the positions of elements of 1 in the information matrix every 360 columns.

[0249] In addition, since the Type A method parity check matrix initial value table represents the positions of elements of 1 in the A matrix and C matrix every 360 columns, it can also be said that it represents the positions of elements of 1 in a part of the parity check matrix (the remaining part of the C matrix) every 360 columns.

[0250] FIG. 23 is a diagram showing an example of a parity check matrix initial value table of the Type A method.

[0251] That is, FIG. 23 shows an example of a parity check matrix initial value table representing a parity check matrix H with a code length N of 35 bits and a coding rate r of 2 / 7.

[0252] The Type A method check matrix initial value table is a table that represents the positions of elements of 1 in the A matrix and the C matrix for each unit size P, and in its i-th row, the row numbers of elements of 1 in the 1+P×(i-1)th column of check matrix H (row numbers assuming that the row number of the 1st row of check matrix H is 0) are listed in the same order as the column weight of the 1+P×(i-1)th column.

[0253] For ease of explanation, it is assumed here that the unit size P is, for example, 5.

[0254] The check matrix H of the Type A system has parameters M1, M2, Q1, and Q2.

[0255] M1 (FIG. 22) is a parameter that determines the size of the B matrix, and takes a value that is a multiple of the unit size P. By adjusting M1, the performance of the LDPC code changes, and it is adjusted to a predetermined value when determining the check matrix H. Here, it is assumed that 15, which is three times the unit size P=5, is adopted as M1.

[0256] M2 (FIG. 22) is the value M-M1 obtained by subtracting M1 from the parity length M.

[0257] Here, the information length K is N×r=35×2 / 7=10, and the parity length M is NK=35-10=25, so M2 is M-M1=25-15=10.

[0258] Q1 is calculated according to the equation Q1=M1 / P, and represents the number of cyclic shifts (number of rows) in the A matrix.

[0259] In other words, the columns other than the 1+P×(i-1)th column of the A matrix of the check matrix H of the Type A method, i.e., each column from the 2+P×(i-1)th column to the P×ith column, are arranged by periodically cyclically shifting an element of 1 in the 1+P×(i-1)th column determined by the check matrix initial value table downward (downward in the column), and Q1 represents the number of cyclic shifts in the A matrix.

[0260] Q2 is calculated according to the equation Q2=M2 / P, and represents the number of cyclic shifts (number of rows) in the C matrix.

[0261] In other words, columns other than the 1+P×(i-1)th column of the C matrix of the check matrix H of the Type A method, i.e., each column from the 2+P×(i-1)th column to the P×ith column, are arranged by periodically cyclically shifting elements of 1 in the 1+P×(i-1)th column determined by the check matrix initial value table downward (downward in the column), and Q2 represents the number of cyclic shifts in the C matrix.

[0262] Here, Q1 is M1 / P=15 / 5=3, and Q2 is M2 / P=10 / 5=2.

[0263] In the parity check matrix initial value table of FIG. 23, three numerical values ​​are listed in the first and second rows, and one numerical value is listed in the third to fifth rows. According to this arrangement of numerical values, the column weights of the A matrix and C matrix portions of the parity check matrix H obtained from the parity check matrix initial value table of FIG. 23 are 3 from the 1=1+5×(1-1)th column to the 10=5×2nd column, and 1 from the 11=1+5×(3-1)th column to the 25=5×5th column.

[0264] That is, the first row of the parity check matrix initial value table in FIG. 23 is 2, 6, 18, which indicates that in the first column of the parity check matrix H, the elements in the rows with row numbers 2, 6, 18 are 1 (and the other elements are 0).

[0265] In this case, the A matrix (Figure 22) is a matrix with 15 rows and 10 columns (M1 rows and K columns), and the C matrix (Figure 22) is a matrix with 10 rows and 25 columns (NK-M1 rows and K+M1 columns), so the rows with row numbers 0 to 14 of the check matrix H are rows of the A matrix, and the rows with row numbers 15 to 24 of the check matrix H are rows of the C matrix.

[0266] Therefore, of the rows with row numbers 2, 6, and 18 (hereinafter referred to as rows #2, #6, #18, etc.), rows #2 and #6 are rows of the A matrix, and row #18 is a row of the C matrix.

[0267] The second row of the parity check matrix initial value table in FIG. 23 is 2, 10, 19, which indicates that the elements of rows #2, #10, and #19 in the 6th (=1+5×(2−1)) column of parity check matrix H are 1.

[0268] Here, in the 6th (=1+5×(2−1)) column of parity check matrix H, of rows #2, #10, and #19, rows #2 and #10 are rows of the A matrix, and row #19 is a row of the C matrix.

[0269] The third row of the parity check matrix initial value table in FIG. 23 is 22, which indicates that the element of row #22 in the 11th (=1+5×(3−1)) column of parity check matrix H is 1.

[0270] Here, in the 11th (=1+5×(3−1)) column of parity check matrix H, row #22 is a row of the C matrix.

[0271] Similarly, the 19 in the 4th row of the parity check matrix initial value table of FIG. 23 indicates that the element of row #19 in the 16th (=1+5×(4-1)) column of parity check matrix H is 1, and the 15 in the 5th row of the parity check matrix initial value table of FIG. 23 indicates that the element of row #15 in the 21st (=1+5×(5-1)) column of parity check matrix H is 1.

[0272] As described above, the parity check matrix initial value table indicates the positions of elements of 1 in the A matrix and C matrix of the parity check matrix H for each unit size P=5 columns.

[0273] Columns other than the 1+5×(i-1)th column of the A matrix and C matrix of the check matrix H, i.e., each column from the 2+5×(i-1)th column to the 5×ith column, are arranged by periodically cyclically shifting elements of 1 in the 1+5×(i-1)th column determined by the check matrix initial value table downward (downward in the column direction) according to parameters Q1 and Q2.

[0274] That is, for example, the 2+5×(i-1)th column of matrix A is the 1+5×(i-1)th column cyclically shifted downward by Q1 (=3), and the next 3+5×(i-1)th column is the 1+5×(i-1)th column cyclically shifted downward by 2×Q1 (=2×3) (the 2+5×(i-1)th column cyclically shifted downward by Q1).

[0275] For example, the 2+5×(i-1)th column of matrix C is the 1+5×(i-1)th column cyclically shifted downward by Q2 (=2), and the next 3+5×(i-1)th column is the 1+5×(i-1)th column cyclically shifted downward by 2×Q2 (=2×2) (the 2+5×(i-1)th column cyclically shifted downward by Q2).

[0276] FIG. 24 is a diagram showing matrix A generated from the check matrix initial value table of FIG.

[0277] In matrix A in FIG. 24, elements of rows #2 and #6 in the 1st (=1+5×(1−1)) column are 1, in accordance with the first row of the parity check matrix initial value table in FIG.

[0278] Each of the columns from the 2nd (=2+5×(1-1)) to the 5th (=5+5×(1-1)) is a cyclic shift of the previous column downward by Q1=3.

[0279] Furthermore, in matrix A in FIG. 24, elements in rows #2 and #10 of the 6th (=1+5×(2−1)) column are 1, in accordance with the second row of the parity check matrix initial value table in FIG.

[0280] Each column from the 7th (=2+5×(2-1)) column to the 10th (=5+5×(2-1)) column is a cyclic shift of the previous column downward by Q1=3.

[0281] FIG. 25 is a diagram showing parity interleaving of a B matrix.

[0282] The check matrix generating unit 613 (FIG. 18) uses a check matrix initial value table to generate matrix A, and places matrix B of a staircase structure to the immediate right of matrix A. Then, the check matrix generating unit 613 regards matrix B as a parity matrix, and performs parity interleaving so that adjacent elements of 1 in matrix B of the staircase structure are spaced apart by unit size P=5 in the row direction.

[0283] FIG. 25 shows the A and B matrices after parity interleaving of the B matrix of FIG.

[0284] FIG. 26 is a diagram showing a C matrix generated from the parity check matrix initial value table of FIG.

[0285] 26, the element in row #18 of the 1st (=1+5×(1−1))th column of parity check matrix H is 1, in accordance with the first row of the parity check matrix initial value table in FIG.

[0286] Each column from the 2nd (=2+5×(1-1)) to the 5th (=5+5×(1-1)) columns of matrix C is a cyclic shift of the previous column downward by Q2=2.

[0287] Furthermore, in matrix C of FIG. 26, in accordance with the second to fifth rows of the parity check matrix initial value table of FIG. 23, the elements of row #19, the 6th (=1+5×(2-1)) column, row #22, the 11th (=1+5×(3-1)) column, row #19, the 16th (=1+5×(4-1)) column, and row #15, the 21st (=1+5×(5-1)) column of parity check matrix H are 1.

[0288] Furthermore, each of the columns from the 7th (=2+5×(2-1)) to the 10th (=5+5×(2-1)), each of the columns from the 12th (=2+5×(3-1)) to the 15th (=5+5×(3-1)), each of the columns from the 17th (=2+5×(4-1)) to the 20th (=5+5×(4-1)), and each of the columns from the 22nd (=2+5×(5-1)) to the 25th (=5+5×(5-1)) are cyclically shifted downward by Q2=2 from the previous column.

[0289] The check matrix generation unit 613 (FIG. 18) generates matrix C using the check matrix initial value table, and places matrix C below matrix A and matrix B (after parity interleaving).

[0290] Furthermore, parity check matrix generation section 613 places matrix Z to the right of matrix B, and matrix D to the right of matrix C, thereby generating parity check matrix H shown in FIG.

[0291] FIG. 27 is a diagram showing parity interleaving of a D matrix.

[0292] After generating the parity check matrix H of FIG. 26, the parity check matrix generation unit 613 regards the D matrix as a parity matrix and performs parity interleaving (of only the D matrix) so that elements of 1 in an odd row and the next even row of the unit matrix D matrix are separated in the row direction by unit size P=5.

[0293] FIG. 27 shows the parity check matrix H after performing parity interleaving of the D matrix on the parity check matrix H in FIG.

[0294] The LDPC encoder 115 (the encoding parity calculation unit 615 (FIG. 18)) performs LDPC encoding (generation of an LDPC code) using, for example, the check matrix H in FIG.

[0295] Here, the LDPC code generated using the check matrix H of FIG. 27 is an LDPC code that has been parity interleaved. Therefore, for the LDPC code generated using the check matrix H of FIG. 27, there is no need to perform parity interleaving in the parity interleaver 23 (FIG. 9).

[0296] FIG. 28 is a diagram showing a parity check matrix H in which column permutation is performed on the B matrix, part of the C matrix (the part of the C matrix that is placed under the B matrix), and the D matrix of the parity check matrix H in FIG. 27 as parity deinterleaving that restores the parity interleaving.

[0297] The LDPC encoder 115 can perform LDPC encoding (generation of an LDPC code) using the parity check matrix H in FIG.

[0298] When LDPC coding is performed using the check matrix H in Fig. 28, an LDPC code that is not parity interleaved is obtained by the LDPC coding. Therefore, when LDPC coding is performed using the check matrix H in Fig. 28, parity interleaving is performed in the parity interleaver 23 (Fig. 9).

[0299] FIG. 29 is a diagram showing a converted parity check matrix H obtained by performing row permutation on the parity check matrix H in FIG.

[0300] As will be described later, the conversion check matrix is ​​a matrix expressed by a combination of a P×P unit matrix, a quasi-unit matrix in which one or more of the 1s in the unit matrix are changed to 0, a shift matrix obtained by cyclically shifting a unit matrix or a quasi-unit matrix, a sum matrix which is the sum of two or more of a unit matrix, a quasi-unit matrix, or a shift matrix, and a P×P 0 matrix.

[0301] By using the converted parity check matrix for decoding an LDPC code, it is possible to employ an architecture for simultaneously performing P check node operations and variable node operations in decoding the LDPC code, as will be described later.

[0302] <New LDPC code>

[0303] In data transmission using LDPC codes, one method for ensuring good communication quality is to use LDPC codes with good performance.

[0304] A new LDPC code with good performance (hereinafter, also referred to as a new LDPC code) will be described below.

[0305] As the new LDPC code, for example, a type A code or type B code can be adopted in which the unit size P is 360, which is the same as that of DVB-T.2, ATSC3.0, etc., and which corresponds to a check matrix H having a cyclic structure.

[0306] The LDPC encoder 115 (FIGS. 8 and 18) can perform LDPC encoding into a new LDPC code using a check matrix initial value table (a check matrix H obtained from) of a new LDPC code in which the code length N is longer than 64 k bits, for example, 69120 bits, and the coding rate r is, for example, 2 / 16, 3 / 16, 4 / 16, 5 / 16, 6 / 16, 7 / 16, 8 / 16, 9 / 16, 10 / 16, 11 / 16, 12 / 16, 13 / 16, or 14 / 16.

[0307] In this case, a check matrix initial value table for a new LDPC code is stored in the storage unit 602 of the LDPC encoder 115 (FIG. 8).

[0308] FIG. 30 is a diagram showing an example of a check matrix initial value table (for the Type A method) that represents a check matrix H of a Type A code (hereinafter also referred to as a Type A code where r=2 / 16) as a new LDPC code having a code length N of 69120 bits and a coding rate r of 2 / 16.

[0309] 31 and 32 are diagrams showing examples of check matrix initial value tables representing a check matrix H of a type A code (hereinafter also referred to as a type A code where r=3 / 16) as a new LDPC code having a code length N of 69120 bits and a coding rate r of 3 / 16.

[0310] FIG. 32 is a sequel to FIG.

[0311] FIG. 33 is a diagram showing an example of a parity check matrix initial value table indicating a parity check matrix H of a type A code (hereinafter also referred to as a type A code where r=4 / 16) as a new LDPC code having a code length N of 69120 bits and a coding rate r of 4 / 16.

[0312] 34 and 35 are diagrams showing examples of check matrix initial value tables representing check matrix H of a type A code (hereinafter also referred to as type A code where r=5 / 16) as a new LDPC code having a code length N of 69120 bits and a coding rate r of 5 / 16.

[0313] FIG. 35 is a sequel to FIG.

[0314] 36 and 37 are diagrams showing examples of check matrix initial value tables representing check matrix H of a type A code (hereinafter also referred to as type A code where r=6 / 16) as a new LDPC code having a code length N of 69120 bits and a coding rate r of 6 / 16.

[0315] FIG. 37 is a sequel to FIG.

[0316] 38 and 39 are diagrams showing examples of check matrix initial value tables representing check matrix H of a type A code (hereinafter also referred to as type A code where r=7 / 16) as a new LDPC code having a code length N of 69120 bits and a coding rate r of 7 / 16.

[0317] FIG. 39 is a sequel to FIG.

[0318] 40 and 41 are diagrams showing examples of check matrix initial value tables representing check matrix H of a type A code (hereinafter also referred to as type A code where r=8 / 16) as a new LDPC code having a code length N of 69120 bits and a coding rate r of 8 / 16.

[0319] FIG. 41 is a sequel to FIG.

[0320] 42 and 43 are diagrams showing examples of check matrix initial value tables (for the Type B method) representing check matrix H of a Type B code (hereinafter also referred to as a Type B code where r=7 / 16) as a new LDPC code having a code length N of 69120 bits and a coding rate r of 7 / 16.

[0321] It should be noted that FIG. 43 is a sequel to FIG.

[0322] 44 and 45 are diagrams showing other examples of the check matrix initial value table representing the check matrix H of the Type B code where r=7 / 16.

[0323] Fig. 45 is a diagram following Fig. 44. The type B code with r=7 / 16 obtained from (the check matrix H represented by) the check matrix initial value table in Fig. 44 and Fig. 45 is hereinafter also referred to as another type B code with r=7 / 16.

[0324] 46 and 47 are diagrams showing examples of check matrix initial value tables representing check matrix H of a Type B code (hereinafter also referred to as Type B code where r=8 / 16) as a new LDPC code having a code length N of 69120 bits and a coding rate r of 8 / 16.

[0325] FIG. 47 is a sequel to FIG.

[0326] 48 and 49 are diagrams showing other examples of the check matrix initial value table representing the check matrix H of the Type B code where r=8 / 16.

[0327] Note that Fig. 49 is a sequel to Fig. 48. The type B code with r=8 / 16 obtained from the parity check matrix initial value tables in Fig. 48 and Fig. 49 will hereinafter also be referred to as another type B code with r=8 / 16.

[0328] 50, 51, and 52 are diagrams showing examples of check matrix initial value tables representing check matrix H of a Type B code (hereinafter also referred to as Type B code, where r=9 / 16) as a new LDPC code having a code length N of 69120 bits and a coding rate r of 9 / 16.

[0329] Note that FIG. 51 is a continuation of FIG. 50, and FIG. 52 is a continuation of FIG. 51.

[0330] 53, 54, and 55 are diagrams showing other examples of the check matrix initial value table representing the check matrix H of the Type B code where r=9 / 16.

[0331] FIG. 54 is a diagram continuing from FIG. 53, and FIG. 55 is a diagram continuing from FIG. 54. The type B code with r=9 / 16 obtained from the check matrix initial value tables of FIG. 53 to FIG. 55 will hereinafter also be referred to as other type B code with r=9 / 16.

[0332] 56, 57, and 58 are diagrams showing examples of check matrix initial value tables representing check matrix H of a Type B code (hereinafter also referred to as Type B code where r=10 / 16) as a new LDPC code having a code length N of 69120 bits and a coding rate r of 10 / 16.

[0333] Note that FIG. 57 is a continuation of FIG. 56, and FIG. 58 is a continuation of FIG. 57.

[0334] 59, 60, and 61 are diagrams showing other examples of the check matrix initial value table representing the check matrix H of the Type B code where r=10 / 16.

[0335] Fig. 60 is a diagram continuing from Fig. 59, and Fig. 61 is a diagram continuing from Fig. 60. The type B code of r=10 / 16 obtained from the check matrix initial value tables of Figs. 59 to 61 is hereinafter also referred to as other type B code of r=10 / 16.

[0336] 62, 63, and 64 are diagrams showing examples of check matrix initial value tables representing check matrix H of a Type B code (hereinafter also referred to as a Type B code where r=11 / 16) as a new LDPC code having a code length N of 69120 bits and a coding rate r of 11 / 16.

[0337] Note that FIG. 63 is a continuation of FIG. 62, and FIG. 64 is a continuation of FIG. 63.

[0338] 65, 66, and 67 are diagrams showing other examples of the check matrix initial value table representing the check matrix H of the Type B code where r=11 / 16.

[0339] Note that Fig. 66 is a diagram continuing from Fig. 65, and Fig. 67 is a diagram continuing from Fig. 66. The type B code of r=11 / 16 obtained from the check matrix initial value tables of Figs. 65 to 67 is also referred to as other type B code of r=11 / 16 hereinafter.

[0340] 68, 69, and 70 are diagrams showing examples of check matrix initial value tables representing check matrix H of a Type B code (hereinafter also referred to as Type B code with r=12 / 16) as a new LDPC code having a code length N of 69120 bits and a coding rate r of 12 / 16.

[0341] Note that FIG. 69 is a continuation of FIG. 68, and FIG. 70 is a continuation of FIG.

[0342] 71, 72, and 73 are diagrams showing other examples of the check matrix initial value table representing the check matrix H of the Type B code where r=12 / 16.

[0343] Note that Fig. 72 is a diagram continuing from Fig. 71, and Fig. 73 is a diagram continuing from Fig. 72. The type B code of r=12 / 16 obtained from the check matrix initial value tables of Figs. 71 to 73 is hereinafter also referred to as other type B code of r=12 / 16.

[0344] 74, 75, and 76 are diagrams showing examples of check matrix initial value tables representing check matrix H of a Type B code (hereinafter also referred to as a Type B code with r=13 / 16) as a new LDPC code having a code length N of 69120 bits and a coding rate r of 13 / 16.

[0345] Note that FIG. 75 is a continuation of FIG. 74, and FIG. 76 is a continuation of FIG.

[0346] 77, 78, and 79 are diagrams showing other examples of the check matrix initial value table representing the check matrix H of the Type B code where r=13 / 16.

[0347] FIG78 is a diagram following FIG77, and FIG79 is a diagram following FIG78. The type B code of r=13 / 16 obtained from the check matrix initial value tables of FIG77 to FIG79 is hereinafter also referred to as other type B code of r=13 / 16.

[0348] 80, 81, and 82 are diagrams showing examples of check matrix initial value tables representing check matrix H of a Type B code (hereinafter also referred to as a Type B code where r=14 / 16) as a new LDPC code having a code length N of 69120 bits and a coding rate r of 14 / 16.

[0349] Note that FIG. 81 is a continuation of FIG. 80, and FIG. 82 is a continuation of FIG.

[0350] 83, 84, and 85 are diagrams showing other examples of the check matrix initial value table representing the check matrix H of the Type B code where r=14 / 16.

[0351] FIG. 84 is a diagram continuing from FIG. 83, and FIG. 85 is a diagram continuing from FIG. 84. The type B code of r=14 / 16 obtained from the check matrix initial value tables of FIG. 83 to FIG. 85 is also hereinafter referred to as other type B code of r=14 / 16.

[0352] The new LDPC code is an LDPC code with good performance.

[0353] Here, an LDPC code with good performance is an LDPC code obtained from an appropriate check matrix H.

[0354] An appropriate check matrix H is, for example, an LDPC code obtained from the check matrix H with low E s / N0 or E b / N o A check matrix satisfies certain conditions and reduces the bit error rate (BER) (and frame error rate (FER)) when transmitted at a signal power to noise power ratio (SPR) per bit.

[0355] For example, an appropriate check matrix H can be obtained by combining LDPC codes obtained from various check matrices that satisfy a certain condition with a low E s / N o This can be obtained by performing a simulation to measure the BER when transmitting at .

[0356] The predetermined conditions that an appropriate check matrix H should satisfy include, for example, that the analysis results obtained by a code performance analysis method called Density Evolution are good, that there is no loop of elements of 1, called cycle 4, and so on.

[0357] Here, the information matrix H A It is known that if elements of 1 are concentrated, such as in cycle 4, the decoding performance of the LDPC code deteriorates. For this reason, it is desirable that cycle 4 does not exist in the parity check matrix H.

[0358] In the parity check matrix H, the minimum length of a loop formed by elements of 1 is called a girth. The absence of a cycle of 4 means that the girth is greater than 4.

[0359] The predetermined conditions that an appropriate check matrix H should satisfy can be appropriately determined from the viewpoint of improving the decoding performance of the LDPC code, facilitating (simplifying) the decoding process of the LDPC code, and so on.

[0360] 86 and 87 are diagrams for explaining density evolution that obtains analysis results as predetermined conditions that an appropriate parity check matrix H should satisfy.

[0361] Density evolution is a code analysis method that calculates the expected value of the error probability for the entire LDPC code (ensemble) with code length N of ∞, characterized by a degree sequence (described later).

[0362] For example, in an AWGN channel, if the noise variance is increased from 0, the expected error probability of a certain ensemble is initially 0, but once the noise variance exceeds a certain threshold, it is no longer 0.

[0363] According to density evolution, the performance of the ensemble (the appropriateness of the check matrix) can be determined by comparing the noise variance threshold (hereinafter referred to as the performance threshold) at which the expected value of the error probability is no longer zero.

[0364] It should be noted that, for a specific LDPC code, if the ensemble to which that LDPC code belongs is determined and density evolution is performed on that ensemble, the rough performance of that LDPC code can be predicted.

[0365] Therefore, if an ensemble with good performance is found, a good LDPC code can be found from among the LDPC codes that belong to that ensemble.

[0366] Here, the above-mentioned degree sequence indicates the proportion of variable nodes and check nodes having each weight value with respect to the code length N of the LDPC code.

[0367] For example, a regular (3,6) LDPC code with a coding rate of 1 / 2 belongs to an ensemble characterized by a degree sequence in which all variable nodes have a weight (column weight) of 3 and all check nodes have a weight (row weight) of 6.

[0368] Figure 86 shows the Tanner graph of such an ensemble.

[0369] In the Tanner Bluff of Figure 86, there are N variable nodes, indicated by circles (○) in the figure, which is equal to the code length N, and there are N / 2 check nodes, indicated by squares (□) in the figure, which is equal to the code length N multiplied by the coding rate 1 / 2.

[0370] Each variable node has three edges connected to it, equal to the column weight, so there are a total of 3N edges connecting the N variable nodes.

[0371] Also, each check node has 6 edges connected to it, equal to the row weight. Therefore, there are a total of 3N edges connecting to the N / 2 check nodes.

[0372] Furthermore, in the Tanner graph of Figure 86, there is one interleaver.

[0373] The interleaver randomly rearranges the 3N branches connected to the N variable nodes, and then connects each rearranged branch to one of the 3N branches connected to the N / 2 check nodes.

[0374] There are only (3N)! (=(3N)×(3N-1)×···×1) possible permutations of the 3N branches connected to N variable nodes in the interleaver. Therefore, an ensemble characterized by a degree sequence in which all variable nodes have a weight of 3 and all check nodes have a weight of 6 is a set of (3N)! LDPC codes.

[0375] In a simulation to find a high-performance LDPC code (appropriate check matrix), a multi-edge type ensemble was used in density evolution.

[0376] In the multi-edge type, the interleaver through which the branches connected to the variable nodes and the branches connected to the check nodes pass is divided into multiple (multi-edge), which allows for more precise characterization of the ensemble.

[0377] Figure 87 shows an example of a Tanner graph for a multi-edge type ensemble.

[0378] In the Tanner graph of FIG. 87, there are two interleavers: a first interleaver and a second interleaver.

[0379] In addition, in the Tanner graph of Figure 87, there is only v1 variable node with one edge connecting to the first interleaver and zero edges connecting to the second interleaver, there is only v2 variable node with one edge connecting to the first interleaver and two edges connecting to the second interleaver, and there is only v3 variable node with zero edges connecting to the first interleaver and two edges connecting to the second interleaver.

[0380] Furthermore, in the Tanner graph of Figure 87, there are only c1 check nodes with two edges connecting to the first interleaver and zero edges connecting to the second interleaver, there are only c2 check nodes with two edges connecting to the first interleaver and two edges connecting to the second interleaver, and there are only c3 check nodes with zero edges connecting to the first interleaver and three edges connecting to the second interleaver.

[0381] Here, density evolution and its implementation are described, for example, in "On the Design of Low-Density Parity-Check Codes within 0.0045 dB of the Shannon Limit", SY Chung, GD Forney, TJ Richardson, R. Urbanke, IEEE Communications Leggers, VOL. 5, NO. 2, Feb. 2001.

[0382] In a simulation to find a new LDPC code (check matrix), the BER starts to drop (become smaller) due to the multi-edge type density evolution. b We found an ensemble where the performance threshold, i.e., / N0 (signal power to noise power ratio per bit), is below a specified value, and from among the LDPC codes belonging to that ensemble, we selected the LDPC code that reduces the BER when using one or more orthogonal modulations such as QPSK as the LDPC code with good performance.

[0383] The new LDPC code (the check matrix initial value table representing the check matrix of the new LDPC code) was obtained by the above simulation.

[0384] Therefore, the new LDPC code can ensure good communication quality in data transmission.

[0385] FIG. 88 is a diagram for explaining column weights of a check matrix H of a type-A code as a new LDPC code.

[0386] As for the check matrix H of a type-A code, as shown in FIG. 88, the column weight of the first K1 columns of the A matrix is ​​represented as Y1, the column weight of the subsequent K2 columns of the A matrix is ​​represented as Y2, the column weight of the first K1 columns of the C matrix is ​​represented as X1, the column weight of the subsequent K2 columns of the C matrix is ​​represented as X2, and the column weight of the further subsequent M1 columns of the C matrix is ​​represented as X3.

[0387] Note that K1+K2 is equal to the information length K, and M1+M2 is equal to the parity length M. Therefore, K1+K2+M1+M2 is equal to the code length N=69120 bits.

[0388] As for the check matrix H of the type A code, the column weight of the 1st column to the M1-1th column of the B matrix is ​​2, and the column weight of the M1th column (the last column) of the B matrix is ​​1. Furthermore, the column weight of the D matrix is ​​1, and the column weight of the Z matrix is ​​0.

[0389] FIG. 89 is a diagram showing parameters of the check matrix H of the type-A code (represented by the check matrix initial value tables) of FIGS.

[0390] X1, Y1, K1, X2, Y2, K2, X3, M1, M2 as parameters of check matrix H of type A code for r=2 / 16, 3 / 16, 4 / 16, 5 / 16, 6 / 16, 7 / 16, 8 / 16, and performance thresholds are as shown in FIG. 89.

[0391] The parameters X1, Y1, K1 (or K2), X2, Y2, X3, and M1 (or M2) are set so as to further improve the performance (for example, error rate, etc.) of the LDPC code.

[0392] FIG. 90 is a diagram for explaining column weights of a check matrix H of a type-B code as a new LDPC code.

[0393] As for the check matrix H of a Type B code, as shown in FIG. 90, the column weight of the first to KX1 columns is represented as X1, the column weight of the subsequent KX2 columns is represented as X2, the column weight of the subsequent KY1 columns is represented as Y1, and the column weight of the subsequent KY2 columns is represented as Y2.

[0394] Note that KX1+KX2+KY1+KY2 is equal to the information length K, and KX1+KX2+KY1+KY2+M is equal to the code length N=69120 bits.

[0395] Furthermore, in the parity check matrix H of the type B code, of the last M columns, the column weight of M−1 columns excluding the last column is 2, and the column weight of the last column is 1.

[0396] FIG. 91 is a diagram showing parameters of the check matrix H of the type B code (represented by the check matrix initial value tables) of FIGS.

[0397] The parameters X1, KX1, X2, KX2, Y1, KY1, Y2, KY2, M and performance thresholds of the check matrix H of the type B codes for r=7 / 16, 8 / 16, 9 / 16, 10 / 16, 11 / 16, 12 / 16, 13 / 16, 14 / 16 and other type B codes are as shown in Figure 91.

[0398] The parameters X1, KX1, X2, KX2, Y1, KY1, Y2, and KY2 are set so as to further improve the performance of the LDPC code.

[0399] <Simulation results>

[0400] 92 and 93 are diagrams showing the BER / FER curve and capacity, respectively, as the simulation results of transmitting a Type A code with r=2 / 16 by QPSK.

[0401] In the simulation, an AWGN channel was used as the communication path 13 (FIG. 7), and 50 times was used as the number of iterative decoding iterations C(it) of the LDPC code.

[0402] Capacity (communication channel capacity) represents the amount of information that can be transmitted with one symbol. In the simulation, -6 When a BER of s The capacity was calculated at / N0 (signal power to noise power ratio per symbol).

[0403] In the BER / FER curve diagram, the solid line represents the BER and the dotted line represents the FER. In the capacity diagram, the Shannon limit is shown along with the capacity for the LDPC code. The same is true for the following simulation result diagrams.

[0404] 94 and 95 are diagrams showing the BER / FER curve and capacity, respectively, as the simulation results of transmitting a Type A code with r=3 / 16 by QPSK.

[0405] 96 and 97 are diagrams showing the BER / FER curve and capacity, respectively, as the simulation results of transmitting a Type A code with r=4 / 16 by QPSK.

[0406] 98 and 99 are diagrams showing the BER / FER curve and capacity, respectively, as the simulation results of transmitting a Type A code with r=5 / 16 using QPSK.

[0407] 100 and 101 are diagrams respectively showing a BER / FER curve and a capacity as a result of a simulation in which a Type A code with r=6 / 16 is transmitted by QPSK.

[0408] 102 and 103 are diagrams showing the BER / FER curve and capacity, respectively, as the simulation results of transmitting a Type A code with r=7 / 16 using QPSK.

[0409] 104 and 105 are diagrams showing the BER / FER curve and capacity, respectively, as the simulation results of transmitting a Type A code with r=8 / 16 using QPSK.

[0410] 106 and 107 are diagrams showing the BER / FER curve and capacity, respectively, as the simulation results of transmitting a Type B code with r=7 / 16 using QPSK.

[0411] 108 and 109 are diagrams showing the BER / FER curve and capacity, respectively, as the simulation results of transmitting another type B code with r=7 / 16 using QPSK.

[0412] 110 and 111 are diagrams respectively showing a BER / FER curve and a capacity as a result of a simulation in which a Type B code with r=8 / 16 is transmitted by QPSK.

[0413] 112 and 113 are diagrams respectively showing a BER / FER curve and a capacity as a result of a simulation in which another type B code with r=8 / 16 is transmitted by QPSK.

[0414] 114 and 115 are diagrams respectively showing a BER / FER curve and a capacity as a result of a simulation in which a Type B code with r=9 / 16 is transmitted by QPSK.

[0415] 116 and 117 are diagrams respectively showing the BER / FER curve and capacity as the simulation results of transmitting another type B code with r=9 / 16 using QPSK.

[0416] 118 and 119 are diagrams respectively showing a BER / FER curve and capacity as the simulation results of transmitting a Type B code with r=10 / 16 using QPSK.

[0417] 120 and 121 are diagrams respectively showing a BER / FER curve and a capacity as a result of a simulation in which another type B code with r=10 / 16 is transmitted by QPSK.

[0418] 122 and 123 are diagrams showing the BER / FER curve and capacity, respectively, as the simulation results of transmitting a Type B code with r=11 / 16 using QPSK.

[0419] 124 and 125 are diagrams respectively showing a BER / FER curve and a capacity as a result of a simulation in which another type B code with r=11 / 16 is transmitted by QPSK.

[0420] 126 and 127 are diagrams respectively showing a BER / FER curve and a capacity as a result of a simulation in which a Type B code with r=12 / 16 is transmitted by QPSK.

[0421] 128 and 129 are diagrams respectively showing a BER / FER curve and a capacity as a result of a simulation in which another type B code with r=12 / 16 is transmitted by QPSK.

[0422] 130 and 131 are diagrams showing the BER / FER curve and capacity, respectively, as the simulation results of transmitting a Type B code with r=13 / 16 using QPSK.

[0423] 132 and 133 are diagrams respectively showing a BER / FER curve and a capacity as a result of a simulation in which another type B code with r=13 / 16 is transmitted by QPSK.

[0424] 134 and 135 are diagrams respectively showing a BER / FER curve and a capacity as a result of a simulation in which a Type B code with r=14 / 16 is transmitted by QPSK.

[0425] 136 and 137 are diagrams respectively showing a BER / FER curve and a capacity as a result of a simulation in which another type B code with r=14 / 16 is transmitted by QPSK.

[0426] According to the simulation results of FIGS. 92 to 137, it can be confirmed that the new LDPC code realizes a good BER / FER and also realizes a capacity close to the Shannon limit.

[0427] <Constellation>

[0428] 138 to 141 are diagrams showing examples of constellations employed in the transmission system of FIG.

[0429] In the transmission system of FIG. 7, for example, for MODCOD, which is a combination of a modulation method (MODulation) and an LDPC code (CODe), a constellation to be used in that MODCOD can be set.

[0430] For a MODCOD of 1, one or more constellations can be set.

[0431] Constellations include UC (Uniform Constellation), in which the signal points are arranged uniformly, and NUC (Non Uniform Constellation), in which the signal points are not arranged uniformly.

[0432] In addition, there are many types of NUCs, such as 1D NUCs (1-dimensional M 2There are constellations called 2D NUC (2-dimensional QQAM non-uniform constellation), and 2D NUC (2-dimensional QQAM non-uniform constellation).

[0433] In general, 1D NUC improves the BER more than UC, and 2D NUC improves the BER more than 1D NUC.

[0434] The constellation for the modulation method QPSK is UC. For example, 2D NUC can be used as a constellation for modulation methods such as 16QAM, 64QAM, and 256QAM, and for example, 1D NUC can be used as a constellation for modulation methods such as 1024QAM and 4096QAM.

[0435] In the transmission system of FIG. 7, for example, constellations defined in ATSC3.0 or the like can be used.

[0436] That is, when the modulation scheme is QPSK, for example, the same constellation can be used for each coding rate r of the LDPC code.

[0437] Furthermore, when the modulation scheme is 16QAM, 64QAM, or 256QAM, for example, it is possible to use different 2D NUC constellations for each coding rate r of the LDPC code.

[0438] Furthermore, when the modulation method is 1024QAM or 4096QAM, for example, a different 1D NUC constellation can be used for each coding rate r of the LDPC code.

[0439] Below, we will explain some of the constellations specified in ATSC3.0.

[0440] FIG. 138 is a diagram showing the coordinates of signal points of a UC constellation used for all coding rates of LDPC codes defined in ATSC3.0 when the modulation scheme is QPSK.

[0441] In Figure 138, "Input Data cell y" represents a 2-bit symbol to be mapped to UC of QPSK, and "Constellation point z s " is the signal point z s The coordinates of the signal point z s The index s in represents the discrete time of the symbols (the time interval between one symbol and the next).

[0442] In Figure 138, signal point z s The coordinates of are expressed in the form of complex numbers, with j representing the imaginary unit (√(-1)).

[0443] FIG. 139 is a diagram showing the coordinates of signal points of the 2D NUC constellation used for the coding rates r(CR)=2 / 15, 3 / 15, 4 / 15, 5 / 15, 6 / 15, 7 / 15, 8 / 15, 9 / 15, 10 / 15, 11 / 15, 12 / 15, and 13 / 15 of the LDPC code specified in ATSC3.0 when the modulation method is 16QAM.

[0444] In FIG. 139, like FIG. 138, signal point z s The coordinates of are expressed in the form of complex numbers, with j representing the imaginary unit.

[0445] In FIG. 139, w#k represents the coordinates of a signal point in the first quadrant of the constellation.

[0446] In 2D NUC, the signal points in the second quadrant of the constellation are arranged at positions obtained by moving the signal points in the first quadrant symmetrically with respect to the Q axis, the signal points in the third quadrant of the constellation are arranged at positions obtained by moving the signal points in the first quadrant symmetrically with respect to the origin, and the signal points in the fourth quadrant of the constellation are arranged at positions obtained by moving the signal points in the first quadrant symmetrically with respect to the I axis.

[0447] Here, the modulation method is 2 m In the case of QAM, m bits are treated as one symbol, and each symbol is mapped to a signal point corresponding to that symbol.

[0448] An m-bit symbol can be, for example, 0 to 2 m It can be expressed as an integer value of -1, but now, b=2 m / 4 means 0 to 2 m The symbols y(0), y(1), . . . , y(2 m -1) can be classified into four symbols: y(0) through y(b-1), y(b) through y(2b-1), y(2b) through y(3b-1), and y(3b) through y(4b-1).

[0449] In FIG. 139, the suffix k of w#k takes an integer value ranging from 0 to b-1, and w#k represents the coordinates of a signal point corresponding to symbol y(k) ranging from symbol y(0) to y(b-1).

[0450] The coordinates of the signal point corresponding to symbol y(k+b) in the range of symbols y(b) to y(2b-1) are represented by -conj(w#k), the coordinates of the signal point corresponding to symbol y(k+2b) in the range of symbols y(2b) to y(3b-1) are represented by conj(w#k), and the coordinates of the signal point corresponding to symbol y(k+3b) in the range of symbols y(3b) to y(4b-1) are represented by -w#k.

[0451] Here, conj(w#k) represents the complex conjugate of w#k.

[0452] For example, when the modulation method is 16QAM, the m=4-bit symbols y(0), y(1), . . . , y(15) are 4 / 4=4, the symbols are classified into four: y(0) through y(3), y(4) through y(7), y(8) through y(11), and y(12) through y(15).

[0453] Among the symbols y(0) to y(15), for example, the symbol y(12) is a symbol y(k+3b)=y(0+3×4) in the range of symbols y(3b) to y(4b-1), where k=0, and therefore the coordinates of the signal point corresponding to the symbol y(12) are -w#k=-w0.

[0454] Now, if the coding rate r(CR) of the LDPC code is, for example, 9 / 15, according to FIG. 139, when the modulation method is 16QAM and the coding rate r is 9 / 15, w0 is 0.2386+j0.5296, so the coordinate −w0 of the signal point corresponding to the symbol y(12) is −(0.2386+j0.5296).

[0455] Figure 140 is a diagram showing an example of the coordinates of 1D NUC signal points used for the coding rates r(CR) = 2 / 15, 3 / 15, 4 / 15, 5 / 15, 6 / 15, 7 / 15, 8 / 15, 9 / 15, 10 / 15, 11 / 15, 12 / 15, 13 / 15 of the LDPC code specified in ATSC3.0 when the modulation method is 1024QAM.

[0456] In FIG. 140, u#k is the signal point z of the 1D NUC. s The real part of the complex number Re(z s ) and imaginary part Im(z s )

[0457] Figure 141 shows the 1024QAM symbol y and the 1D NUC signal point z corresponding to that symbol y. s The real part of the complex number Re(z s ) and imaginary part Im(z s ) as well as u#k.

[0458] Now, let us consider the 10-bit symbol y of 1024QAM, starting from its leading bit (most significant bit), as y 0,s ,y 1,s ,y 2,s ,y3,s ,y 4,s ,y 5,s ,y 6,s ,y 7,s ,y 8,s ,y 9,s This will be expressed as:

[0459] A in Figure 141 represents the even-numbered 5 bits of symbol y. 1,s ,y 3,s ,y 5,s ,y 7,s ,y 9,s and the signal point z corresponding to the symbol y s The real part of the coordinate system Re(z s ) represents the correspondence with u#k.

[0460] B in Figure 141 shows the odd-numbered 5 bits of the symbol y. 0,s ,y 2,s ,y 4,s ,y 6,s ,y 8,s and the signal point z corresponding to the symbol y s Imaginary Part Im(z s ) represents the correspondence with u#k.

[0461] 1024QAM 10-bit symbol y=(y 0,s ,y 1,s ,y 2,s ,y 3,s ,y 4,s ,y 5,s ,y 6,s ,y 7,s ,y 8,s ,y 9,s ) is, for example, (0,0,1,0,0,1,1,1,0,0), then the odd-numbered 5 bits (y 0,s ,y 2,s ,y 4,s ,y 6,s ,y 8,s ) is (0,1,0,1,0), and the even-numbered 5 bits (y 1,s ,y 3,s ,y 5,s ,y 7,s ,y 9,s ) is (0,0,1,1,0).

[0462] In FIG. 141A, the even-numbered 5 bits (0,0,1,1,0) are associated with u11, and therefore the signal point z corresponding to the symbol y=(0,0,1,0,0,1,1,1,0,0) s The real part of Re(z s ) becomes u11.

[0463] In FIG. 141B, the odd-numbered 5 bits (0,1,0,1,0) are associated with u3, and therefore the signal point z corresponding to the symbol y=(0,0,1,0,0,1,1,1,0,0) s Imaginary Part Im(z s ) becomes u3.

[0464] On the other hand, if the coding rate r of the LDPC code is, for example, 6 / 15, according to the above-mentioned FIG. 140, for a 1D NUC used when the modulation method is 1024QAM and the coding rate of the LDPC code r(CR)=6 / 15, u3 is 0.1295 and u11 is 0.7196.

[0465] Therefore, the signal point z corresponding to the symbol y=(0,0,1,0,0,1,1,1,0,0) s The real part of Re(z s ) becomes u11=0.7196, and the imaginary part Im(z s ) results in u3 = 0.1295. As a result, the signal point z corresponding to the symbol y = (0,0,1,0,0,1,1,1,0,0) s The coordinates of are expressed as 0.7196+j0.1295.

[0466] In the constellation, the signal points of a 1D NUC are arranged in a grid pattern on lines parallel to the I axis or the Q axis. However, the intervals between signal points are not constant. In addition, when transmitting a signal point (the data mapped to the signal point), the average power of the signal points on the constellation can be normalized. Normalization is performed by taking the root mean square of the absolute values ​​of all the signal points (coordinates of the signal points) on the constellation as P aveThen, the mean square P ave Square root of √P ave The reciprocal of 1 / (√P ave ) for each signal point z s This can be done by multiplying

[0467] In the transmission system of FIG. 7, the constellations and the like defined in ATSC3.0 as described above can be used.

[0468] <Block Interleaver 25>

[0469] FIG. 142 is a block diagram showing an example of the configuration of the block interleaver 25 of FIG.

[0470] The block interleaver 25 has a storage area called part 1 and a storage area called part 2.

[0471] Both parts 1 and 2 are composed of columns, which are memory areas that store one bit in the row (horizontal) direction and a predetermined number of bits in the column (vertical) direction, lined up in the row direction, a number C of columns equal to the number of bits m of the symbol.

[0472] If the number of bits stored in the column direction of the column of part 1 (hereinafter also referred to as the part column length) is represented as R1, and the part column length of the column of part 2 is represented as R2, then (R1+R2)×C is equal to the code length N of the LDPC code to be block interleaved.

[0473] In addition, the part column length R1 is equal to a multiple of the unit size P, which is 360 bits, and the part column length R2 is equal to the remainder when the sum of the part column length R1 of part 1 and the part column length R2 of part 2 (hereinafter also referred to as the column length) R1+R2 is divided by the unit size P, which is 360 bits.

[0474] Here, the column length R1+R2 is equal to the value obtained by dividing the code length N of the LDPC code to be block interleaved by the number of bits m of a symbol.

[0475] For example, when 16QAM is adopted as the modulation scheme for an LDPC code with a code length N of 69120 bits, the number of bits m of a symbol is 4 bits, so that the column length R1+R2 is 17280 (=69120 / 4) bits.

[0476] Furthermore, the remainder when the column length R1+R2=17280 is divided by the unit size P of 360 bits is 0, so the part column length R2 of part 2 is 0 bits.

[0477] The part column length R1 of part 1 is R1+R2-R2=17280-0=17280 bits.

[0478] FIG. 143 is a diagram for explaining the block interleaving performed in the block interleaver 25 of FIG.

[0479] The block interleaver 25 performs block interleaving on parts 1 and 2 by writing and reading LDPC codes.

[0480] That is, in block interleaving, as shown in A of FIG. 143, code bits of an LDPC code of one codeword are written from the top of the column of part 1 downward (column direction) toward the column from left to right.

[0481] Then, when the writing of the code bits is completed down to the bottom of the rightmost column (Cth column) of part 1, the remaining code bits are written from top to bottom (column direction) of the columns of part 2, proceeding from left to right columns.

[0482] After that, when the writing of the code bits is completed down to the bottom of the rightmost column (Cth column) of part 2, the code bits are read out in the row direction from the first row of all C columns of part 1 in units of C=m bits, as shown in B of Figure 143.

[0483] Then, the code bits are read out from all C columns of part 1 in sequence, moving down the rows. When reading is completed up to the last row, row R1, the code bits are read out from the first row of all C columns of part 2 in the row direction, in units of C=m bits.

[0484] The reading of the code bits from all C columns of part 2 is done row by row, down to the last row, row R2.

[0485] In this manner, the code bits read out from parts 1 and 2 in units of m bits are supplied as symbols to the mapper 117 (FIG. 8).

[0486] <Group-wise interleaving>

[0487] FIG. 144 is a diagram for explaining group-wise interleaving performed in group-wise interleaver 24 of FIG.

[0488] In group-wise interleaving, the LDPC code of one codeword is divided into 360-bit units, which is equal to the unit size P, from the beginning of the codeword. The 360 ​​bits of each division are treated as a bit group, and the LDPC code of one codeword is interleaved in bit group units according to a predetermined pattern (hereinafter also referred to as a GW pattern).

[0489] Here, when an LDPC code of one codeword is divided into bit groups, the (i+1)th bit group from the beginning will hereinafter also be referred to as bit group i.

[0490] When the unit size P is 360, for example, an LDPC code with a code length N of 1800 bits is divided into 5 (=1800 / 360) bit groups of bit groups 0, 1, 2, 3, and 4. Furthermore, for example, an LDPC code with a code length N of 16200 bits is divided into 45 (=16200 / 360) bit groups of bit groups 0, 1, . . . , 44, and an LDPC code with a code length N of 64800 bits is divided into 180 (=64800 / 360) bit groups of bit groups 0, 1, . . . , 179. Furthermore, for example, an LDPC code with a code length N of 69120 bits is divided into 192 (=69120 / 360) bit groups of bit groups 0, 1, . . . , 191.

[0491] Here, the GW pattern is represented by a sequence of numbers representing bit groups. For example, for an LDPC code with a code length N of 1800 bits, the GW pattern 4,2,0,3,1 represents interleaving (rearranging) the sequence of bit groups 0,1,2,3,4 into the sequence of bit groups 4,2,0,3,1.

[0492] The GW pattern can be set at least for each code length N of the LDPC code.

[0493] For example, as a GW pattern for an LDPC code with a code length N of 64800 bits, the sequence of bit groups 0 to 179 of the LDPC code of 64800 bits is 39, 47, 96, 176, 33, 75, 165, 38, 27, 58, 90, 76, 17, 46, 10, 91, 133, 69, 171, 32, 117, 78, 13, 146, 101, 36, 0, 138, 25, 77, 122, 49, 14, 125, 140, 93, 130, 2, 104, 102, 128, 4, 111, 151, 84, 167 ,35,127,156,55,82,85,66,114,8,147,115,113,5,31,100,106,48,52,67,107,18,126,112,50,9,143,28,160,71,79,43,98,86,94,64,3,166,105,103,118,63,51,139,172,141, 175, 56, 74, 95, 29, 45, 129, 120, 168, 92, 150, 7, 162, 153, 137, 108, 159, 157, 173, 23, 89, 132, 57, 37, 70, 134, 40, 21, 149, 80, 1, 121, 59, 110, 142, 152, 15, 154, 145, 12, 170, 54, 155, 99 ,22,123,72,177,131,116,44,158,73,11,65,164,119,174,34,83,53,24,42,60,26,161,68,178,41,148,109,87,144,135,20,62,81,169,124,6,19,30,163,61,179,136,97,16,88 There are also patterns in which the above are interleaved.

[0494] <Configuration example of receiving device 12>

[0495] FIG. 145 is a block diagram showing an example of the configuration of the receiving device 12 of FIG.

[0496] The OFDM operation unit 151 receives an OFDM signal from the transmitting device 11 (FIG. 7) and performs signal processing on the OFDM signal. Data obtained by the signal processing by the OFDM operation unit 151 is supplied to a frame management unit 152.

[0497] The frame management unit 152 processes (frame interprets) frames composed of data supplied from the OFDM processing unit 151, and supplies the resulting target data signal and control data signal to frequency deinterleavers 161 and 153, respectively.

[0498] The frequency deinterleaver 153 performs frequency deinterleaving on the data from the frame management unit 152 in units of symbols, and supplies the result to a demapper 154 .

[0499] The demapper 154 performs orthogonal demodulation by demapping (signal point arrangement decoding) the data (constellation data) from the frequency deinterleaver 153 based on the signal point arrangement (constellation) determined by the orthogonal modulation performed on the transmitting device 11 side, and supplies the resulting data (LDPC code (likelihood)) to an LDPC decoder 155.

[0500] The LDPC decoder 155 performs LDPC decoding on the LDPC code from the demapper 154, and supplies the resulting LDPC target data (here, a BCH code) to a BCH decoder 156.

[0501] The BCH decoder 156 performs BCH decoding on the LDPC target data from the LDPC decoder 155, and outputs the resulting control data (signaling).

[0502] On the other hand, the frequency deinterleaver 161 performs frequency deinterleaving on the data from the frame management unit 152 in units of symbols, and supplies the result to a SISO / MISO decoder 162 .

[0503] The SISO / MISO decoder 162 performs space-time decoding on the data from the frequency deinterleaver 161 and supplies the decoded data to a time deinterleaver 163 .

[0504] The time deinterleaver 163 performs time deinterleaving on the data from the SISO / MISO decoder 162 on a symbol-by-symbol basis, and supplies the result to a demapper 164 .

[0505] The demapper 164 performs orthogonal demodulation by demapping (signal point arrangement decoding) the data (constellation data) from the time deinterleaver 163 based on the signal point arrangement (constellation) determined by the orthogonal modulation performed on the transmitting device 11 side, and supplies the resulting data to a bit deinterleaver 165.

[0506] The bit deinterleaver 165 performs bit deinterleaving on the data from the demapper 164, and supplies the LDPC code (the likelihood of the LDPC code), which is the bit deinterleaved data, to the LDPC decoder 166.

[0507] The LDPC decoder 166 performs LDPC decoding on the LDPC code from the bit deinterleaver 165, and supplies the resulting LDPC target data (here, a BCH code) to a BCH decoder 167.

[0508] The BCH decoder 167 performs BCH decoding on the LDPC target data from the LDPC decoder 155 , and supplies the resulting data to a BB descrambler 168 .

[0509] The BB descrambler 168 performs BB descrambling on the data from the BCH decoder 167 and supplies the resulting data to a null deletion unit (Null Deletion) 169 .

[0510] The null deletion unit 169 deletes the nulls inserted by the padder 112 in FIG. 8 from the data from the BB descrambler 168 and supplies the data to a demultiplexer 170.

[0511] The demultiplexer 170 separates one or more streams (target data) multiplexed into the data from the null deletion unit 169, performs necessary processing on the separated data, and outputs the separated data as an output stream.

[0512] The receiving device 12 can be configured without some of the blocks shown in Fig. 145. That is, for example, when the transmitting device 11 (Fig. 8) is configured without the time interleaver 118, the SISO / MISO encoder 119, the frequency interleaver 120, and the frequency interleaver 124, the receiving device 12 can be configured without the time deinterleaver 163, the SISO / MISO decoder 162, the frequency deinterleaver 161, and the frequency deinterleaver 153, which are blocks corresponding to the time interleaver 118, the SISO / MISO encoder 119, the frequency interleaver 120, and the frequency interleaver 124 of the transmitting device 11, respectively.

[0513] <Example of the configuration of the bit deinterleaver 165>

[0514] FIG. 146 is a block diagram showing an example of the configuration of the bit deinterleaver 165 of FIG. 145.

[0515] The bit deinterleaver 165 is made up of a block deinterleaver 54 and a group-wise deinterleaver 55, and performs (bit) deinterleaving of the symbol bits of the symbols that are the data from the demapper 164 (FIG. 145).

[0516] That is, the block deinterleaver 54 performs block deinterleaving (the inverse process of block interleaving) corresponding to the block interleaving performed by the block interleaver 25 in FIG. 9 on the symbol bits of the symbols from the demapper 164, that is, block deinterleaving that returns the positions of the code bits (of the likelihoods) of the LDPC code rearranged by the block interleaving to their original positions, and supplies the resulting LDPC code to the group-wise deinterleaver 55.

[0517] The group-wise deinterleaver 55 performs group-wise deinterleaving (the inverse process of group-wise interleaving) on ​​the LDPC code from the block deinterleaver 54, which corresponds to the group-wise interleaving performed by the group-wise interleaver 24 in FIG. 9. In other words, the group-wise deinterleaver 55 performs group-wise deinterleaving to return the code bits of the LDPC code, whose order has been changed on a bit group basis by the group-wise interleaving described in FIG. 144, to their original order by rearranging them on a bit group basis.

[0518] Here, when the LDPC code supplied from the demapper 164 to the bit deinterleaver 165 has been subjected to parity interleaving, group-wise interleaving, and block interleaving, the bit deinterleaver 165 can perform all of the following: parity deinterleaving corresponding to parity interleaving (the inverse process of parity interleaving, i.e., parity deinterleaving that returns the code bits of the LDPC code whose order has been changed by parity interleaving to their original order), block deinterleaving corresponding to block interleaving, and group-wise deinterleaving corresponding to group-wise interleaving.

[0519] However, in bit deinterleaver 165 of FIG. 146, a block deinterleaver 54 that performs block deinterleaving corresponding to block interleaving, and a group-wise deinterleaver 55 that performs group-wise deinterleaving corresponding to group-wise interleaving are provided, but a block that performs parity deinterleaving corresponding to parity interleaving is not provided, and parity deinterleaving is not performed.

[0520] Therefore, the LDPC decoder 166 is supplied with an LDPC code that has been subjected to block deinterleaving and group-wise deinterleaving but not parity deinterleaving from the bit deinterleaver 165 (the group-wise deinterleaver 55 thereof).

[0521] The LDPC decoder 166 performs LDPC decoding of the LDPC code from the bit deinterleaver 165 using a transformed parity check matrix obtained by performing at least column permutation equivalent to parity interleaving on the type B parity check matrix H used for LDPC encoding by the LDPC encoder 115 in FIG. 8, or a transformed parity check matrix (FIG. 29) obtained by performing row permutation on the type A parity check matrix (FIG. 27), and outputs the data obtained as a result of the decoding of the LDPC target data.

[0522] FIG. 147 is a flowchart explaining the processing performed by the demapper 164, the bit deinterleaver 165, and the LDPC decoder 166 in FIG.

[0523] In step S111, the demapper 164 demaps and orthogonally demodulates the data from the time deinterleaver 163 (data on the constellation mapped to signal points), and supplies the data to the bit deinterleaver 165, and the process proceeds to step S112.

[0524] In step S112, the bit deinterleaver 165 deinterleaves (bit deinterleaves) the data from the demapper 164, and the process proceeds to step S113.

[0525] That is, in step S112, in the bit deinterleaver 165, the block deinterleaver 54 performs block deinterleaving on the data (symbols) from the demapper 164, and supplies the resulting code bits of the LDPC code to the group-wise deinterleaver 55.

[0526] The group-wise deinterleaver 55 performs group-wise deinterleaving on the LDPC code from the block deinterleaver 54, and supplies the LDPC code (the likelihood of the LDPC code) obtained as a result to the LDPC decoder 166.

[0527] In step S113, the LDPC decoder 166 performs LDPC decoding of the LDPC code from the group-wise deinterleaver 55 using the check matrix H used for LDPC encoding by the LDPC encoder 115 of FIG. 8, that is, using, for example, a converted check matrix obtained from the check matrix H, and outputs the data obtained as a result to the BCH decoder 167 as the decoded result of the LDPC target data.

[0528] In addition, in FIG. 146, as in the case of FIG. 9, for ease of explanation, the block deinterleaver 54 that performs block deinterleaving and the group-wise deinterleaver 55 that performs group-wise deinterleaving are configured separately, but the block deinterleaver 54 and the group-wise deinterleaver 55 can be configured as an integrated unit.

[0529] Furthermore, in the case where group-wise interleaving is not performed in transmitting device 11, receiving device 12 can be configured without providing group-wise deinterleaver 55 that performs group-wise deinterleaving.

[0530] <LDPC Decoding>

[0531] The LDPC decoding performed by the LDPC decoder 166 in FIG. 145 will be further described.

[0532] In the LDPC decoder 166 of FIG. 145, as described above, block deinterleaving and group-wise deinterleaving are performed on the LDPC code from the group-wise deinterleaver 55, and LDPC decoding of the LDPC code without parity deinterleaving is performed using a transformed check matrix obtained by performing at least column permutation corresponding to parity deinterleaving on the type B check matrix H used by the LDPC encoder 115 in FIG. 8 for LDPC encoding, or a transformed check matrix (FIG. 29) obtained by performing row permutation on the type A check matrix (FIG. 27).

[0533] Here, LDPC decoding using a transformed check matrix has been previously proposed (see, for example, Japanese Patent No. 4224777), which can suppress the circuit scale and keep the operating frequency within a sufficiently achievable range while performing LDPC decoding.

[0534] Therefore, first, with reference to FIGS. 148 to 151, the previously proposed LDPC decoding using a transformed check matrix will be described.

[0535] FIG. 148 is a diagram showing an example of the check matrix H of an LDPC code with a code length N of 90 and a coding rate of 2 / 3.

[0536] In FIG. 148 (similarly in FIGS. 149 and 150 described later), 0 is represented by a period (.).

[0537] In the check matrix H of FIG. 148, the parity matrix has a staircase structure.

[0538] FIG. 149 is a diagram showing the check matrix H' obtained by performing row permutation of Equation (11) and column permutation of Equation (12) on the check matrix H of FIG. 148.

[0539] Line replacement: 6s+t+1st line → 5t+s+1st line (11)

[0540] Column replacement: 6x+y+61st column → 5y+x+61st column (12)

[0541] In formulas (11) and (12), s, t, x, and y are integers in the ranges of 0≦s<5, 0≦t<6, 0≦x<5, and 0≦t<6, respectively.

[0542] According to the row permutation of equation (11), lines 1, 7, 13, 19, and 25, which have a remainder of 1 when divided by 6, are permuted into lines 1, 2, 3, 4, and 5, respectively; lines 2, 8, 14, 20, and 26, which have a remainder of 2 when divided by 6, are permuted into lines 6, 7, 8, 9, and 10, respectively.

[0543] Furthermore, according to the column permutation in equation (12), for columns 61 and onwards (parity matrix), columns 61, 67, 73, 79, and 85, which have a remainder of 1 when divided by 6, are permuted into columns 61, 62, 63, 64, and 65, respectively, and columns 62, 68, 74, 80, and 86, which have a remainder of 2 when divided by 6, are permuted into columns 66, 67, 68, 69, and 70, respectively.

[0544] In this manner, the matrix obtained by permuting rows and columns on the parity check matrix H in FIG. 148 is the parity check matrix H' in FIG.

[0545] Here, even if row permutation is performed on the check matrix H, the arrangement of the code bits of the LDPC code is not affected.

[0546] In addition, the column permutation in equation (12) corresponds to the above-mentioned parity interleaving in which the K+qx+y+1th code bit is interleaved at the K+Py+x+1th code bit position, where the information length K is 60, the unit size P is 5, and the divisor q (=M / P) of the parity length M (here, 30) is 6.

[0547] Therefore, the check matrix H' in Figure 149 is a transformed check matrix obtained by at least performing column permutation to replace the K+qx+y+1th column of the check matrix H in Figure 148 (hereinafter referred to as the original check matrix, as appropriate) with the K+Py+x+1th column.

[0548] For the converted parity check matrix H' in FIG. 149, when the LDPC code of the original parity check matrix H in FIG. 148 is multiplied by the same permutation as in equation (12), a zero vector is output. In other words, if the row vector c obtained by performing the column permutation in equation (12) on the row vector c as the LDPC code (one codeword) of the original parity check matrix H is expressed as c', then, according to the nature of the parity check matrix, Hc T is a 0 vector, so H'c' T Naturally, it is also a zero vector.

[0549] From the above, the converted parity check matrix H' in FIG. 149 is a parity check matrix of an LDPC code c' obtained by performing column permutation of equation (12) on the LDPC code c of the original parity check matrix H.

[0550] Therefore, by performing column permutation of equation (12) on the LDPC code c of the original check matrix H, and then decoding (LDPC decoding) the LDPC code c' after column permutation using the converted check matrix H' in FIG. 149, and then performing the inverse permutation of the column permutation of equation (12) on the decoded result, it is possible to obtain the same decoding result as when the LDPC code of the original check matrix H is decoded using that check matrix H.

[0551] FIG. 150 is a diagram showing the converted parity check matrix H' in FIG. 149, in which intervals are provided in units of a 5×5 matrix.

[0552] In FIG. 150, the conversion check matrix H' is represented as a combination of a 5×5 (=P×P) unit matrix, where P is the unit size, a matrix in which one or more of the 1s in the unit matrix have become 0 (hereinafter referred to as a quasi-unit matrix, as appropriate), a matrix obtained by cyclic shifting a unit matrix or a quasi-unit matrix (hereinafter referred to as a shift matrix, as appropriate), a sum of two or more unit matrices, quasi-unit matrices, or shift matrices (hereinafter referred to as a sum matrix, as appropriate), and a 5×5 0 matrix.

[0553] It can be said that the conversion check matrix H' in Fig. 150 is composed of a 5x5 identity matrix, a quasi-identity matrix, a shift matrix, a sum matrix, and a 0 matrix. Therefore, these 5x5 matrices (identity matrix, quasi-identity matrix, shift matrix, sum matrix, and 0 matrix) constituting the conversion check matrix H' are hereinafter referred to as constituent matrices as appropriate.

[0554] To decode an LDPC code of a parity check matrix represented by a P×P configuration matrix, an architecture that simultaneously performs P check node operations and variable node operations can be used.

[0555] FIG. 151 is a block diagram showing an example of the configuration of a decoding device that performs such decoding.

[0556] That is, FIG. 151 shows an example of the configuration of a decoding device that decodes an LDPC code using a transformed check matrix H′ in FIG. 150 obtained by performing at least the column permutation of equation (12) on the original check matrix H in FIG. 148.

[0557] The decoding device of FIG. 151 includes an edge data storage memory 300 consisting of six FIFOs 3001 to 3006, a selector 301 for selecting one of the FIFOs 3001 to 3006, a check node calculation unit 302, two cyclic shift circuits 303 and 308, and 18 FIFOs 3041 to 3044. 18 The edge data storage memory 304 includes FIFOs 3041 to 3044. 18 a receive data memory 306 for storing receive data, a variable node calculation unit 307, a decoded word calculation unit 309, a receive data rearrangement unit 310, and a decoded data rearrangement unit 311.

[0558] First, a method of storing data in the edge data storage memories 300 and 304 will be described.

[0559] The edge data storage memory 300 is composed of six FIFOs 3001 to 3006, the number of which is obtained by dividing the number of rows of the conversion check matrix H' in FIG. 150 (30) by the number of rows of the constituent matrix (unit size P) (5). FIFO 300 y (y=1,2,...,6) consists of a number of storage areas, and each storage area can simultaneously read and write messages corresponding to five edges, which are the number of rows and columns (unit size P) of the configuration matrix. y The number of stages of the storage area is 9, which is the maximum number of 1s (Hamming weights) in the row direction of the conversion check matrix in FIG.

[0560] The FIFO 3001 stores data corresponding to the positions of 1 from the first row to the fifth row of the conversion check matrix H′ in FIG. 150 (message v from the variable node). i ) are stored in a form in which each row is packed horizontally (ignoring 0). That is, if the j-th row and i-th column are represented as (j,i), the first-stage storage area of ​​the FIFO 3001 stores data corresponding to the positions of 1 in the 5×5 unit matrix from (1,1) to (5,5) of the conversion check matrix H'. The second-stage storage area stores data corresponding to the positions of 1 in the shift matrix from (1,21) to (5,25) of the conversion check matrix H' (a shift matrix in which the 5×5 unit matrix is ​​cyclically shifted by three places to the right). Similarly, the third- to eighth-stage storage areas store data in association with the conversion check matrix H'. The ninth-stage storage area stores data corresponding to the positions of 1 in the shift matrix from (1,86) to (5,90) of the conversion check matrix H' (a shift matrix in which the 1 in the first row of the 5×5 unit matrix is ​​replaced with 0 and cyclically shifted by one place to the left).

[0561] FIFO3002 stores data corresponding to the positions of 1 from the 6th row to the 10th row of the conversion check matrix H' in FIG. 150. That is, the first-stage storage area of ​​FIFO3002 stores data corresponding to the positions of 1 in the first shift matrix constituting the sum matrix from (6,1) to (10,5) of the conversion check matrix H' (the sum matrix being the sum of the first shift matrix obtained by cyclically shifting a 5×5 unit matrix to the right by one place and the second shift matrix obtained by cyclically shifting two places to the right). Also, the second-stage storage area stores data corresponding to the positions of 1 in the second shift matrix constituting the sum matrix from (6,1) to (10,5) of the conversion check matrix H'.

[0562] In other words, for a constituent matrix with a weight of 2 or more, when the constituent matrix is ​​expressed as a sum of a P×P unit matrix with a weight of 1, a quasi-unit matrix in which one or more of the 1 elements of the unit matrix have become 0, or a shift matrix obtained by cyclically shifting a unit matrix or a quasi-unit matrix, data corresponding to the positions of 1 in the unit matrix, quasi-unit matrix, or shift matrix with a weight of 1 (messages corresponding to branches belonging to the unit matrix, quasi-unit matrix, or shift matrix) are stored at the same address (the same FIFO among FIFOs 3001 to 3006).

[0563] Similarly, in the storage areas in the third to ninth stages, data is stored in association with the converted check matrix H'.

[0564] Similarly, FIFOs 3003 to 3006 store data in association with the conversion check matrix H'.

[0565] The edge data storage memory 304 is made up of 18 FIFOs 3041 to 3044, which are obtained by dividing the number of columns of the conversion check matrix H', 90, by the number of columns of the constituent matrix (unit size P), 5. 18 It is composed of FIFO304. x (x=1,2,...,18) consists of memory areas with multiple stages, and the memory areas of each stage can simultaneously read and write messages corresponding to five branches, which are the number of rows and columns of the constituent matrix (unit size P).

[0566] The FIFO 3041 stores data corresponding to the positions of 1 in the first to fifth columns of the conversion check matrix H′ in FIG. 150 (message u from the check node). j ) are stored in a vertically packed manner (ignoring zeros) in each column. That is, the first-stage memory area of ​​FIFO 3041 stores data corresponding to the positions of 1 in the 5×5 unit matrix from (1,1) to (5,5) of the conversion check matrix H'. The second-stage memory area stores data corresponding to the positions of 1 in the first shift matrix constituting the sum matrix from (6,1) to (10,5) of the conversion check matrix H' (the sum matrix being the sum of a first shift matrix obtained by cyclically shifting a 5×5 unit matrix to the right by one position and a second shift matrix obtained by cyclically shifting the 5×5 unit matrix to the right by two positions). The third-stage memory area stores data corresponding to the positions of 1 in the second shift matrix constituting the sum matrix from (6,1) to (10,5) of the conversion check matrix H'.

[0567] That is, for a constituent matrix with a weight of 2 or more, when the constituent matrix is ​​expressed as a sum of a P×P unit matrix with a weight of 1, a quasi-unit matrix in which one or more of the 1 elements of the unit matrix are changed to 0, or a shift matrix obtained by cyclically shifting a unit matrix or a quasi-unit matrix, data corresponding to the position of 1 in the unit matrix, quasi-unit matrix, or shift matrix with a weight of 1 (messages corresponding to branches belonging to the unit matrix, quasi-unit matrix, or shift matrix) is stored at the same address (FIFO 3041 to 3044). 18 The data is stored in the same FIFO.

[0568] Similarly, in the fourth and fifth storage areas, data is stored in association with the transformed check matrix H'. The number of storage areas in the FIFO 3041 is five, which is the maximum number of 1's (Hamming weights) in the row direction in the first to fifth columns of the transformed check matrix H'.

[0569] Similarly, the FIFOs 3042 and 3043 store data in association with the conversion check matrix H', and each has a length (number of stages) of 5.12 Similarly, FIFO 304 stores data in association with the conversion check matrix H′, and each has a length of 3. 13 or 304 18 Similarly, data is stored in association with the converted check matrix H′, and each has a length of 2.

[0570] Next, the operation of the decoding device in FIG. 151 will be described.

[0571] The edge data storage memory 300 is composed of six FIFOs 3001 to 3006, and selects a FIFO from the FIFOs 3001 to 3006 to store data according to information (Matrix data) D312 indicating which row of the conversion check matrix H' in FIG. 150 the five messages D311 supplied from the cyclic shift circuit 308 in the previous stage belong to, and stores the five messages D311 in the selected FIFO in sequence. When reading data, the edge data storage memory 300 reads the five messages D3001 in sequence from the FIFO 3001 and supplies them to the selector 301 in the next stage. After finishing reading the messages from the FIFO 3001, the edge data storage memory 300 also reads messages in sequence from the FIFOs 3002 to 3006 and supplies them to the selector 301.

[0572] The selector 301 selects five messages from the FIFO from which data is currently being read out of the FIFOs 3001 to 3006 in accordance with the select signal D301, and supplies them to the check node calculation unit 302 as message D302.

[0573] The check node calculation unit 302 is composed of five check node calculators 3021 to 3025, and receives a message D302 (D3021 to D3025) (message v in equation (7)) supplied through the selector 301. i ) is used to perform check node calculation according to equation (7), and the five messages D303 (D3031 to D3035) obtained as a result of the check node calculation (message u in equation (7) j) is supplied to the cyclic shift circuit 303.

[0574] The cyclic shift circuit 303 cyclically shifts the five messages D3031 to D3035 calculated by the check node calculation unit 302 based on information (Matrix data) D305 indicating how many cyclic shifts the original unit matrix (or quasi-unit matrix) in the converted parity check matrix H' that corresponds to the corresponding branch is made by, and supplies the result to the branch data storage memory 304 as a message D304.

[0575] The edge data storage memory 304 includes 18 FIFOs 3041 to 3044. 18 The FIFO for storing data is selected from FIFOs 3041 to 3044 according to information D305 indicating which row of the conversion check matrix H' the five messages D304 supplied from the previous stage cyclic shift circuit 303 belong to. 18 Then, the edge data storage memory 304 selects one of the messages D3061 from the FIFO 3041 and sequentially stores the five messages D304 in the selected FIFO. When reading data, the edge data storage memory 304 sequentially reads the five messages D3061 from the FIFO 3041 and supplies them to the next stage selector 305. After finishing reading data from the FIFO 3041, the edge data storage memory 304 sequentially reads the five messages D3061 from the FIFO 3042 to 3044. 18 , and supplies the messages to the selector 305.

[0576] The selector 305 selects one of the FIFOs 3041 to 3044 according to the select signal D307. 18 Among these, the five messages from the FIFO from which data is currently being read are selected and supplied to the variable node calculation unit 307 and the decoded word calculation unit 309 as message D308.

[0577] On the other hand, the received data rearrangement unit 310 rearranges the LDPC code D313 corresponding to the parity check matrix H in FIG. 148 received through the communication path 13 by performing column permutation of equation (12), and supplies the result as received data D314 to the received data memory 306. The received data memory 306 calculates and stores received LLRs (log-likelihood ratios) from the received data D314 supplied from the received data rearrangement unit 310, and supplies the received LLRs in groups of five to the variable node calculation unit 307 and the decoded word calculation unit 309 as received values ​​D309.

[0578] The variable node calculation unit 307 is composed of five variable node calculators 3071 to 3075, and receives a message D308 (D3081 to D3085) (message u in formula (1)) supplied through the selector 305. j ) and five received values ​​D309 (received values ​​u 0i ) to perform a variable node operation according to the formula (1), and the message D310 (D3101 to D3105) obtained as a result of the operation (message v in the formula (1) i ) to the cyclic shift circuit 308.

[0579] The cyclic shift circuit 308 cyclically shifts the messages D3101 to D3105 calculated by the variable node calculation unit 307 based on information indicating how many cyclic shifts the original unit matrix (or quasi-unit matrix) in the conversion check matrix H' that the corresponding edge is obtained by, and supplies the result to the edge data storage memory 300 as message D311.

[0580] By performing the above operations once, one decoding (variable node calculation and check node calculation) of the LDPC code can be performed. After the decoding device in Fig. 151 decodes the LDPC code a predetermined number of times, the decoded word calculation unit 309 and the decoded data rearrangement unit 311 obtain and output the final decoding result.

[0581] That is, the decoded word calculation unit 309 is composed of five decoded word calculators 3091 to 3095, and the five messages D308 (D3081 to D3085) (message u in formula (5)) output by the selector 305 are j ) and five received values ​​D309 (received values ​​u 0i ), and in the final stage of multiple decoding operations, calculates a decoding result (decoded word) based on equation (5), and supplies the resulting decoded data D315 to the decoded data rearrangement unit 311.

[0582] The decoded data rearrangement unit 311 performs the inverse permutation of the column permutation in equation (12) on the decoded data D315 supplied from the decoded word calculation unit 309, thereby rearranging the order, and outputs the result as the final decoded result D316.

[0583] As described above, by performing row permutation and / or column permutation on the parity check matrix (original parity check matrix), a P×P identity matrix, a quasi-identity matrix with one or more of its elements changed to 0, a shift matrix obtained by cyclically shifting an identity matrix or a quasi-identity matrix, a unit matrix, a quasi-identity matrix, or a sum matrix which is a sum of a plurality of shift matrices, and a combination of P×P 0 matrices, that is, a parity check matrix (transformed parity check matrix) that can be expressed by a combination of constituent matrices, it becomes possible to adopt an architecture for simultaneously performing P check node operations and variable node operations, which is a number smaller than the number of rows and columns of the parity check matrix, for decoding LDPC codes.When adopting an architecture for simultaneously performing P node operations (check node operations and variable node operations), which is a number smaller than the number of rows and columns of the parity check matrix, it is possible to suppress the operating frequency to a feasible range and perform a large number of repeated decodings, compared to the case where node operations are performed simultaneously for a number equal to the number of rows and columns of the parity check matrix.

[0584] The LDPC decoder 166 constituting the receiving device 12 in FIG. 145 performs LDPC decoding by simultaneously performing P check node operations and variable node operations, similar to the decoding device in FIG. 151, for example.

[0585] That is, for the sake of simplicity, if the parity check matrix of the LDPC code output by the LDPC encoder 115 constituting the transmitting device 11 in FIG. 8 is, for example, the parity check matrix H shown in FIG. 148 in which the parity matrix has a staircase structure, then in the parity interleaver 23 of the transmitting device 11, parity interleaving is performed to interleave the K+qx+y+1-th code bit at the K+Py+x+1-th code bit position, with the information length K set to 60, the unit size P set to 5, and the divisor q (=M / P) of the parity length M set to 6, respectively.

[0586] As described above, this parity interleaving corresponds to the column permutation in equation (12), and therefore LDPC decoder 166 does not need to perform the column permutation in equation (12).

[0587] For this reason, in the receiving device 12 of FIG. 145, as described above, an LDPC code that has not been subjected to parity deinterleaving, that is, an LDPC code in a state in which the column permutation of equation (12) has been performed, is supplied from the group-wise deinterleaver 55 to the LDPC decoder 166, and the LDPC decoder 166 performs processing similar to that of the decoding device of FIG. 151, except that the column permutation of equation (12) is not performed.

[0588] 152 is a diagram showing an example of the configuration of the LDPC decoder 166 in FIG.

[0589] In FIG. 152, LDPC decoder 166 is configured in the same manner as the decoding device in FIG. 151, except that received data rearrangement unit 310 in FIG. 151 is not provided, and performs the same processing as the decoding device in FIG. 151, except that the column permutation of equation (12) is not performed, so a description thereof will be omitted.

[0590] As described above, the LDPC decoder 166 can be configured without providing the received data rearrangement section 310, and therefore the size can be reduced compared to the decoding device in FIG.

[0591] In addition, in FIG. 148 to FIG. 152, for the sake of simplicity, the code length N of the LDPC code is set to 90, the information length K is set to 60, the unit size (number of rows and columns of the constituent matrix) P is set to 5, and the divisor q (=M / P) of the parity length M is set to 6, but each of the code length N, information length K, unit size P, and divisor q (=M / P) is not limited to the above-mentioned values.

[0592] That is, in the transmitting device 11 of FIG. 8, the LDPC encoder 115 outputs an LDPC code having, for example, a code length N of 64800, 16200, 69120, etc., an information length K of N-Pq (=NM), a unit size P of 360, and a divisor q of M / P. The LDPC decoder 166 of FIG. 152 is applicable to the case where LDPC decoding is performed by simultaneously performing P check node operations and variable node operations on such an LDPC code.

[0593] Furthermore, if after LDPC decoder 166 decodes the LDPC code, the parity portion of the decoded result is not necessary and only the information bits of the decoded result are output, LDPC decoder 166 can be configured without decoded data rearrangement unit 311.

[0594] <Example of the configuration of the block deinterleaver 54>

[0595] FIG. 153 is a block diagram showing an example of the configuration of the block deinterleaver 54 shown in FIG.

[0596] The block deinterleaver 54 is configured in the same manner as the block interleaver 25 described in FIG.

[0597] Therefore, the block deinterleaver 54 has a memory area called part 1 and a memory area called part 2, and both parts 1 and 2 are configured with columns arranged in the row direction as memory areas each storing 1 bit in the row direction and storing a predetermined number of bits in the column direction, the number C being equal to the number of bits m of a symbol.

[0598] The block deinterleaver 54 performs block deinterleaving on parts 1 and 2 by writing and reading LDPC codes.

[0599] However, in block deinterleaving, the LDPC codes (which are symbols) are written in the order in which the block interleaver 25 in FIG. 142 reads the LDPC codes.

[0600] Furthermore, in block deinterleaving, the LDPC codes are read out in the order in which the block interleaver 25 in FIG. 142 writes the LDPC codes.

[0601] That is, in the block interleaving by the block interleaver 25 in FIG. 142, the LDPC code is written in the column direction for parts 1 and 2 and read out in the row direction, whereas in the block deinterleaving by the block deinterleaver 54 in FIG. 153, the LDPC code is written in the row direction for parts 1 and 2 and read out in the column direction.

[0602] <Another configuration example of the bit deinterleaver 165>

[0603] FIG. 154 is a block diagram showing another example of the configuration of the bit deinterleaver 165 of FIG.

[0604] In the figure, parts corresponding to those in FIG. 146 are given the same reference numerals, and their explanation will be omitted below as appropriate.

[0605] That is, the bit deinterleaver 165 in FIG. 154 has the same configuration as that in FIG. 146, except that a parity deinterleaver 1011 is newly provided.

[0606] 154, the bit deinterleaver 165 is composed of a block deinterleaver 54, a group-wise deinterleaver 55, and a parity deinterleaver 1011, and performs bit deinterleaving of the code bits of the LDPC code from the demapper 164.

[0607] That is, the block deinterleaver 54 performs block deinterleaving (the inverse process of block interleaving) on ​​the LDPC code from the demapper 164, which corresponds to the block interleaving performed by the block interleaver 25 of the transmitting device 11, i.e., block deinterleaving that returns the positions of the code bits swapped by the block interleaving to their original positions, and supplies the resulting LDPC code to the group-wise deinterleaver 55.

[0608] The group-wise deinterleaver 55 performs group-wise deinterleaving on the LDPC code from the block deinterleaver 54, which corresponds to the group-wise interleaving as rearrangement processing performed by the group-wise interleaver 24 of the transmission device 11.

[0609] The LDPC code resulting from the group-wise deinterleaving is supplied from the group-wise deinterleaver 55 to a parity deinterleaver 1011 .

[0610] The parity deinterleaver 1011 performs parity deinterleaving (the inverse process of parity interleaving) on ​​the code bits after group-wise deinterleaving in the group-wise deinterleaver 55, which corresponds to the parity interleaving performed by the parity interleaver 23 of the transmitting device 11, i.e., parity deinterleaving that returns the code bits of the LDPC code whose order has been changed by the parity interleaving to their original order.

[0611] The LDPC code obtained as a result of the parity deinterleaving is supplied from the parity deinterleaver 1011 to the LDPC decoder 166 .

[0612] Therefore, in the bit deinterleaver 165 of FIG. 154, an LDPC code that has been block deinterleaved, group-wise deinterleaved, and parity deinterleaved, that is, an LDPC code obtained by LDPC encoding in accordance with the parity check matrix H, is supplied to the LDPC decoder 166.

[0613] The LDPC decoder 166 performs LDPC decoding of the LDPC code from the bit deinterleaver 165 by using the parity check matrix H used by the LDPC encoder 115 of the transmission device 11 for LDPC encoding.

[0614] That is, for the Type B method, the LDPC decoder 166 performs LDPC decoding of the LDPC code from the bit deinterleaver 165 using the parity check matrix H (of the Type B method) that the LDPC encoder 115 of the transmitting device 11 used for LDPC encoding, or using a transformed parity check matrix obtained by performing at least column permutation equivalent to parity interleaving on the parity check matrix H. Also, for the Type A method, the LDPC decoder 166 performs LDPC decoding of the LDPC code from the bit deinterleaver 165 using a parity check matrix (FIG. 28) obtained by performing column permutation on the parity check matrix (FIG. 27) (of the Type A method) that the LDPC encoder 115 of the transmitting device 11 used for LDPC encoding, or a transformed parity check matrix (FIG. 29) obtained by performing row permutation on the parity check matrix (FIG. 27) used for LDPC encoding.

[0615] Here, in FIG. 154, an LDPC code obtained by LDPC encoding according to check matrix H is supplied from (parity deinterleaver 1011 of) bit deinterleaver 165 to LDPC decoder 166. In the case where LDPC decoding of the LDPC code is performed using check matrix H of the type B method itself used for LDPC encoding by LDPC encoder 115 of transmitting device 11, or a check matrix (FIG. 28) obtained by applying column permutation to the check matrix of the type A method (FIG. 27) used for LDPC encoding, LDPC decoder 166 can be configured, for example, as a decoding device that performs LDPC decoding by a full serial decoding method in which calculations of messages (check node messages, variable node messages) are performed sequentially for each node, or as a decoding device that performs LDPC decoding by a full parallel decoding method in which calculations of messages are performed simultaneously (in parallel) for all nodes.

[0616] Furthermore, in the LDPC decoder 166, when LDPC decoding of the LDPC code is performed using a transformed check matrix obtained by performing at least column permutation equivalent to parity interleaving on the check matrix H of the Type B method used for LDPC encoding by the LDPC encoder 115 of the transmitting device 11, or a transformed check matrix (FIG. 29) obtained by performing row permutation on the check matrix H of the Type A method used for LDPC encoding (FIG. 27), the LDPC decoder 166 is a decoding device with an architecture that simultaneously performs P (or a divisor of P other than 1) check node operations and variable node operations, and can be configured as a decoding device (FIG. 151) having a received data rearrangement unit 310 that rearranges the code bits of the LDPC code by performing column permutation similar to the column permutation (parity interleaving) for obtaining the transformed check matrix on the LDPC code.

[0617] In FIG. 154, for ease of explanation, the block deinterleaver 54 that performs block deinterleaving, the group-wise deinterleaver 55 that performs group-wise deinterleaving, and the parity deinterleaver 1011 that performs parity deinterleaving are each configured separately, but two or more of the block deinterleaver 54, group-wise deinterleaver 55, and parity deinterleaver 1011 can be configured integrally, similar to the parity interleaver 23, group-wise interleaver 24, and block interleaver 25 of the transmitting device 11.

[0618] <Example of receiving system configuration>

[0619] FIG. 155 is a block diagram showing a first example configuration of a receiving system to which the receiving device 12 can be applied.

[0620] In FIG. 155, the receiving system includes an acquisition unit 1101, a transmission path decoding unit 1102, and an information source decoding unit 1103.

[0621] The acquisition unit 1101 acquires a signal including an LDPC code obtained by LDPC encoding at least LDPC target data such as image data and audio data of a program via a transmission path (communication path) not shown, such as terrestrial digital broadcasting, satellite digital broadcasting, a CATV network, the Internet, or other networks, and supplies the signal to a transmission path decoding processing unit 1102.

[0622] Here, when the signal acquired by the acquisition unit 1101 is broadcast from a broadcast station via terrestrial waves, satellite waves, a CATV (Cable Television) network, etc., the acquisition unit 1101 is configured with a tuner, an STB (Set Top Box), etc. When the signal acquired by the acquisition unit 1101 is transmitted by multicast from a web server, such as IPTV (Internet Protocol Television), the acquisition unit 1101 is configured with a network I / F (Interface) such as a NIC (Network Interface Card).

[0623] 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 a process of correcting an error occurring in the transmission path on the signal acquired by the acquisition unit 1101 via the transmission path, and supplies the resulting signal to the information source decoding processing unit 1103.

[0624] In other words, the signal acquired by the acquisition unit 1101 via the transmission path is a signal obtained by at least performing error correction coding to correct errors that occur on the transmission path, and the transmission path decoding processing unit 1102 performs transmission path decoding processing such as error correction processing on such a signal.

[0625] Here, examples of error correction coding include LDPC coding, BCH coding, etc. Here, at least LDPC coding is performed as the error correction coding.

[0626] Furthermore, the transmission path decoding process may include demodulation of a modulated signal.

[0627] The information source decoding unit 1103 performs information source decoding on the signal that has been subjected to the transmission channel decoding process, which includes at least a process of expanding compressed information to the original information.

[0628] In other words, the signal acquired by the acquisition unit 1101 via the transmission path may have been subjected to compression encoding, which compresses the information in order to reduce the amount of data such as images and audio.In this case, the information source decoding processing unit 1103 performs information source decoding processing, such as a process of expanding the compressed information to the original information (decompression processing), on the signal that has been subjected to transmission path decoding processing.

[0629] In addition, if the signal acquired by the acquisition unit 1101 via the transmission path has not been compression-encoded, the information source decoding processing unit 1103 does not perform processing to expand the compressed information to the original information.

[0630] Here, the decompression process includes, for example, MPEG decoding, etc. In addition, the transmission path decoding process may include descrambling and the like in addition to the decompression process.

[0631] In the receiving system configured as described above, in the acquisition unit 1101, for example, data such as images and audio are subjected to compression encoding such as MPEG encoding, and the signal that has been further subjected to error correction encoding such as LDPC encoding is acquired via the transmission path and supplied to the transmission path decoding processing unit 1102.

[0632] In the transmission path decoding processing unit 1102, the signal from the acquisition unit 1101 is subjected to transmission path decoding processing, such as processing similar to that performed by the receiving device 12, and the resulting signal is supplied to the information source decoding processing unit 1103.

[0633] The information source decoding processor 1103 performs information source decoding such as MPEG decoding on the signal from the transmission path decoding processor 1102, and outputs the resulting image or sound.

[0634] The receiving system of FIG. 155 as described above can be applied to, for example, a television tuner that receives television broadcasts as digital broadcasts.

[0635] In addition, the acquisition unit 1101, the transmission path decoding processing unit 1102, and the information source decoding processing unit 1103 can each be configured as a single independent device (hardware (IC (Integrated Circuit) etc.) or software module).

[0636] In addition, with regard to the acquisition unit 1101, the transmission path decoding processing unit 1102, and the information source decoding processing unit 1103, it is possible to configure a set of the acquisition unit 1101 and the transmission path decoding processing unit 1102, a set of the transmission path decoding processing unit 1102 and the information source decoding processing unit 1103, or a set of the acquisition unit 1101, the transmission path decoding processing unit 1102, and the information source decoding processing unit 1103 as a single independent device.

[0637] FIG. 156 is a block diagram showing a second example configuration of a receiving system to which the receiving device 12 can be applied.

[0638] In the figure, parts corresponding to those in FIG. 155 are given the same symbols, and their explanations will be omitted below as appropriate.

[0639] The receiving system in Figure 156 is similar to that in Figure 155 in that it has an acquisition unit 1101, a transmission path decoding processing unit 1102, and an information source decoding processing unit 1103, but differs from that in Figure 155 in that an output unit 1111 is newly provided.

[0640] The output unit 1111 is, for example, a display device that displays an image or a speaker that outputs sound, and outputs images, sound, and the like as signals output from the information source decoding processing unit 1103. That is, the output unit 1111 displays an image or outputs sound.

[0641] The receiving system in FIG. 156 as described above can be applied to, for example, a TV (television receiver) that receives television broadcasts as digital broadcasts, a radio receiver that receives radio broadcasts, and the like.

[0642] If the signal acquired by the acquisition unit 1101 has not been subjected to compression encoding, the signal output by the transmission path decoding processing unit 1102 is supplied to the output unit 1111 .

[0643] FIG. 157 is a block diagram showing a third example configuration of a receiving system to which the receiving device 12 can be applied.

[0644] In the figure, parts corresponding to those in FIG. 155 are given the same symbols, and their explanations will be omitted below as appropriate.

[0645] The receiving system in FIG. 157 is common to the case in FIG. 155 in that it includes an acquisition unit 1101 and a transmission path decoding processing unit 1102.

[0646] However, the receiving system in FIG. 157 differs from that in FIG. 155 in that the information source decoding processing unit 1103 is not provided and a recording unit 1121 is newly provided.

[0647] The recording unit 1121 records (stores) the signal (for example, TS packets of MPEG TS) output by the transmission path decoding processing unit 1102 in a recording (storage) medium such as an optical disk, a hard disk (magnetic disk), or a flash memory.

[0648] The receiving system of FIG. 157 as described above can be applied to a recorder for recording television broadcasts.

[0649] In addition, in FIG. 157, the receiving system is configured to include an information source decoding processing unit 1103, and the signal after information source decoding processing has been performed by the information source decoding processing unit 1103, i.e., the image and audio obtained by decoding, can be recorded in a recording unit 1121.

[0650] <An embodiment of the computer>

[0651] Next, the above-mentioned series of processes can be performed by hardware or software. When the series of processes is performed by software, a program constituting the software is installed in a general-purpose computer or the like.

[0652] FIG. 158 shows an example of the configuration of an embodiment of a computer in which a program for executing the series of processes described above is installed.

[0653] The program can be recorded in advance on the hard disk 705 or ROM 703 as a recording medium built into the computer.

[0654] Alternatively, the program can be temporarily or permanently stored (recorded) in a removable recording medium 711 such as a flexible disk, a CD-ROM (Compact Disc Read Only Memory), an MO (Magneto Optical) disk, a DVD (Digital Versatile Disc), a magnetic disk, a semiconductor memory, etc. Such a removable recording medium 711 can be provided as a so-called package software.

[0655] In addition to being installed in a computer from the removable recording medium 711 as described above, the program can also be transferred wirelessly to a computer from a download site via an artificial satellite for digital satellite broadcasting, or transferred to a computer by wire via a network such as a LAN (Local Area Network) or the Internet, and the computer can receive the program transferred in this manner via communication unit 708 and install it in its built-in hard disk 705.

[0656] The computer includes a CPU (Central Processing Unit) 702. An input / output interface 710 is connected to the CPU 702 via a bus 701. When a command is input to the CPU 702 via the input / output interface 710 by a user operating an input unit 707 including a keyboard, a mouse, a microphone, etc., the CPU 702 executes a program stored in a ROM (Read Only Memory) 703 in accordance with the command. Alternatively, the CPU 702 loads into a RAM (Random Access Memory) 704 a program stored in a hard disk 705, a program transferred from a satellite or a network, received by a communication unit 708, and installed in the hard disk 705, or a program read from a removable recording medium 711 mounted on a drive 709 and installed in the hard disk 705. As a result, the CPU 702 executes the process according to the above-mentioned flowchart or the process performed by the configuration of the above-mentioned block diagram. Then, the CPU 702 outputs the processing results from an output unit 706 consisting of an LCD (Liquid Crystal Display) and a speaker, etc., via an input / output interface 710, or transmits the results from a communication unit 708, or even records the results on a hard disk 705, as necessary.

[0657] Here, in this specification, the processing steps that describe a program for causing a computer to perform various processes do not necessarily have to be processed chronologically in the order described in the flowchart, but also include processes that are executed in parallel or individually (for example, parallel processing or processing by objects).

[0658] The program may be processed by one computer, or may be distributed among multiple computers, and may be transferred to a remote computer for execution.

[0659] The embodiments of the present technology are not limited to the above-described embodiments, and various modifications are possible without departing from the gist of the present technology.

[0660] For example, the above-mentioned new LDPC code (its check matrix initial value table) can be used for the communication channel 13 (FIG. 7) whether it is a satellite line, a terrestrial wave, a cable (wired line), or any other. Furthermore, the new LDPC code can be used for data transmission other than digital broadcasting.

[0661] It should be noted that the effects described in this specification are merely examples and are not limiting, and other effects may also be obtained. [Explanation of symbols]

[0662] 11 transmitter, 12 receiver, 23 parity interleaver, 24 group-wise interleaver, 25 block interleaver, 54 block deinterleaver, 55 group-wise deinterleaver, 111 mode adaptation / multiplexer, 112 padder, 113 BB scrambler, 114 BCH encoder, 115 LDPC encoder, 116 bit interleaver, 117 mapper, 118 time interleaver, 119 SISO / MISO encoder, 120 frequency interleaver, 121 BCH encoder, 122 LDPC encoder, 123 mapper, 124 frequency interleaver, 131 frame builder / resource allocation unit, 132 OFDM generator, 151 OFDM processor, 152 frame manager, 153 frequency deinterleaver, 154 Demapper, 155 LDPC decoder, 156 BCH decoder, 161 Frequency deinterleaver, 162 SISO / MISO decoder, 163 Time deinterleaver, 164 Demapper, 165 Bit deinterleaver, 166 LDPC decoder, 167 BCH decoder, 168 BB descrambler, 169 Null deletion unit, 170 Demultiplexer, 300 Edge data storage memory, 301 Selector, 302 Check node calculation unit, 303 Cyclic shift circuit, 304 Edge data storage memory, 305 Selector, 306 Received data memory, 307 Variable node calculation unit, 308 Cyclic shift circuit, 309 Decoded word calculation unit, 310 Received data rearrangement unit, 311 Decoded data rearrangement unit, 601 Encoding unit, 602 storage unit, 611 coding rate setting unit, 612 initial value table reading unit, 613 check matrix generation unit, 614 information bit reading unit, 615 coding parity calculation unit, 616 control unit, 701 bus, 702 CPU, 703 ROM, 704 RAM, 705 hard disk, 706 output unit, 707 input unit, 708 communication unit, 709 drive, 710 input / output interface, 711, removable recording medium, 1001 reverse exchange unit, 1002 memory,1011 parity deinterleaver, 1101 acquisition unit, 1101 transmission path decoding processing unit, 1103 information source decoding processing unit, 1111 output unit, 1121 recording unit,

Claims

1. A transmitting device including an encoding unit that performs LDPC encoding based on a check matrix of an LDPC code having a code length N of 69120 bits and a coding rate r of 9 / 16; a receiving device including a decoding unit that decodes the LDPC code; Equipped with The LDPC code includes information bits and parity bits, the 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 section is represented by a parity check matrix initial value table; The parity check matrix initial value table is a table representing the position of an element of 1 in the information matrix section for every 360 columns, 110 3064 6740 7801 10228 13445 17599 17891 17979 18044 19923 21848 23262 25585 25968 30124 1578 8914 9141 9731 10605 11690 12824 18127 18458 24648 24950 25150 26323 26514 27385 27460 3054 3640 3923 7332 10770 12215 14455 14849 15619 20870 22033 26427 28067 28560 29777 29780 1348 4248 5479 8902 9101 9356 10581 11614 12813 21554 22985 23701 24099 24575 24786 27370 3266 8358 16544 16689 16693 16823 17565 18543 19229 21121 23799 24981 25423 28997 29808 30202 320 1198 1549 5407 6080 8542 9352 12418 13391 14736 15012 18328 19398 23391 28117 28793 2114 3294 3770 5225 5556 5991 7075 7889 11145 11386 16561 18956 19034 23605 26085 27132 3623 4011 4225 5249 5489 5711 7240 9831 10458 14697 15420 16015 17782 23244 24215 24386 2624 2750 3871 8247 11135 13702 19290 22209 22975 23811 23931 24872 25154 25165 28375 30200 1060 1240 2040 2382 7723 9165 9656 10398 14517 16653 21241 22348 23476 27203 28443 28445 1070 1233 3416 6633 11736 12808 15454 16505 18720 20162 21425 21874 26069 26855 27292 27978 420 5524 10279 11218 12500 12913 15389 15824 19414 19588 21138 23846 26621 27907 28594 28781 151 1356 2323 3289 4501 10573 13667 14642 16127 17040 17475 18055 24061 26204 26567 29277 1410 3656 4080 6963 8834 10527 17490 17584 18065 19234 22211 22338 23746 24662 29863 30227 1924 2694 3285 8761 9693 11005 17592 21259 21322 21546 21555 24044 24173 26988 27640 28506 1069 6483 6554 9027 11655 12453 16595 17877 18350 18995 21304 21442 23836 25468 28820 29453 149 1621 2199 3141 8403 11974 14969 16197 18844 21027 21921 22266 22399 22691 25727 27721 3689 4839 7971 8419 10500 12308 13435 14487 16502 16622 17229 17468 22710 23904 25074 28508 1270 7007 9830 12698 14204 16075 17613 19391 21362 21726 21816 23014 23651 26419 26748 27195 96 1953 2456 2712 2809 3196 5939 10634 21828 24606 26169 26801 27391 28578 29725 30142 832 3394 4145 5375 6199 7122 7405 7706 10136 10792 15058 15860 21881 23908 25174 25837 730 1735 2917 4106 5004 5849 8194 8943 9136 17599 18456 20191 22798 27935 29559 6238 6776 6799 9142 11199 11867 15979 16830 18110 18396 21897 22590 24020 29578 29644 407 2138 4493 7979 8225 9467 11956 12940 15566 15809 16058 18211 22073 28314 28713 957 1552 1869 4388 7642 7904 13408 13453 16431 19327 21444 22188 25719 28511 29192 3617 8663 22378 28704 8598 12647 19278 22416 15176 16377 16644 22732 12463 12711 18341 11079 13446 29071 2446 4068 8542 10838 11660 27428 16403 21750 23199 9181 16572 18381 7227 18770 21858 7379 9316 16247 8923 14861 29618 6531 24652 26817 5564 8875 18025 8019 14642 21169 16683 17257 29298 4078 6023 8853 13942 15217 15501 7484 8302 27199 671 14966 20886 1240 11897 14925 12800 25474 28603 3576 5308 11168 13430 15265 18232 3439 5544 21849 3257 16996 23750 1865 14153 22669 7640 15098 17364 6137 19401 24836 5986 9035 11444 4799 20865 29150 8360 23554 29246 2002 18215 22258 9679 11951 26583 2844 12330 18156 3744 6949 14754 8262 10288 27142 1087 16563 22815 1328 13273 21749 2092 9191 28045 3250 10549 18252 13975 15172 17135 2520 26310 28787 4395 8961 26753 6413 15437 19520 5809 10936 17089 1670 13574 25125 5865 6175 21175 8391 11680 22660 5485 11743 15165 21021 21798 30209 12519 13402 26300 3472 25935 26412 3377 7398 28867 2430 24650 29426 3364 13409 22914 6838 13491 16229 18393 20764 28078 289 20279 24906 4732 6162 13569 8993 17053 29387 2210 5024 24030 21 22976 24053 12359 15499 28251 4640 11480 24391 1083 7965 16573 13116 23916 24421 10129 16284 23855 1758 3843 21163 5626 13543 26708 14918 17713 21718 13556 20450 24679 3911 16778 29952 11735 13710 22611 5347 21681 22906 6912 12045 15866 713 15429 23281 7133 17440 28982 12355 17564 28059 7658 11158 29885 17610 18755 28852 7680 16212 30111 8812 10144 15718 is Transmitting and receiving system.

2. A coding step of performing LDPC coding based on a check matrix of an LDPC code having a code length N of 69120 bits and a coding rate r of 9 / 16; a decoding step of decoding the LDPC code; Equipped with The LDPC code includes information bits and parity bits, the 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 section is represented by a parity check matrix initial value table; The parity check matrix initial value table is a table representing the position of an element of 1 in the information matrix section for every 360 columns, 110 3064 6740 7801 10228 13445 17599 17891 17979 18044 19923 21848 23262 25585 25968 30124 1578 8914 9141 9731 10605 11690 12824 18127 18458 24648 24950 25150 26323 26514 27385 27460 3054 3640 3923 7332 10770 12215 14455 14849 15619 20870 22033 26427 28067 28560 29777 29780 1348 4248 5479 8902 9101 9356 10581 11614 12813 21554 22985 23701 24099 24575 24786 27370 3266 8358 16544 16689 16693 16823 17565 18543 19229 21121 23799 24981 25423 28997 29808 30202 320 1198 1549 5407 6080 8542 9352 12418 13391 14736 15012 18328 19398 23391 28117 28793 2114 3294 3770 5225 5556 5991 7075 7889 11145 11386 16561 18956 19034 23605 26085 27132 3623 4011 4225 5249 5489 5711 7240 9831 10458 14697 15420 16015 17782 23244 24215 24386 2624 2750 3871 8247 11135 13702 19290 22209 22975 23811 23931 24872 25154 25165 28375 30200 1060 1240 2040 2382 7723 9165 9656 10398 14517 16653 21241 22348 23476 27203 28443 28445 1070 1233 3416 6633 11736 12808 15454 16505 18720 20162 21425 21874 26069 26855 27292 27978 420 5524 10279 11218 12500 12913 15389 15824 19414 19588 21138 23846 26621 27907 28594 28781 151 1356 2323 3289 4501 10573 13667 14642 16127 17040 17475 18055 24061 26204 26567 29277 1410 3656 4080 6963 8834 10527 17490 17584 18065 19234 22211 22338 23746 24662 29863 30227 1924 2694 3285 8761 9693 11005 17592 21259 21322 21546 21555 24044 24173 26988 27640 28506 1069 6483 6554 9027 11655 12453 16595 17877 18350 18995 21304 21442 23836 25468 28820 29453 149 1621 2199 3141 8403 11974 14969 16197 18844 21027 21921 22266 22399 22691 25727 27721 3689 4839 7971 8419 10500 12308 13435 14487 16502 16622 17229 17468 22710 23904 25074 28508 1270 7007 9830 12698 14204 16075 17613 19391 21362 21726 21816 23014 23651 26419 26748 27195 96 1953 2456 2712 2809 3196 5939 10634 21828 24606 26169 26801 27391 28578 29725 30142 832 3394 4145 5375 6199 7122 7405 7706 10136 10792 15058 15860 21881 23908 25174 25837 730 1735 2917 4106 5004 5849 8194 8943 9136 17599 18456 20191 22798 27935 29559 6238 6776 6799 9142 11199 11867 15979 16830 18110 18396 21897 22590 24020 29578 29644 407 2138 4493 7979 8225 9467 11956 12940 15566 15809 16058 18211 22073 28314 28713 957 1552 1869 4388 7642 7904 13408 13453 16431 19327 21444 22188 25719 28511 29192 3617 8663 22378 28704 8598 12647 19278 22416 15176 16377 16644 22732 12463 12711 18341 11079 13446 29071 2446 4068 8542 10838 11660 27428 16403 21750 23199 9181 16572 18381 7227 18770 21858 7379 9316 16247 8923 14861 29618 6531 24652 26817 5564 8875 18025 8019 14642 21169 16683 17257 29298 4078 6023 8853 13942 15217 15501 7484 8302 27199 671 14966 20886 1240 11897 14925 12800 25474 28603 3576 5308 11168 13430 15265 18232 3439 5544 21849 3257 16996 23750 1865 14153 22669 7640 15098 17364 6137 19401 24836 5986 9035 11444 4799 20865 29150 8360 23554 29246 2002 18215 22258 9679 11951 26583 2844 12330 18156 3744 6949 14754 8262 10288 27142 1087 16563 22815 1328 13273 21749 2092 9191 28045 3250 10549 18252 13975 15172 17135 2520 26310 28787 4395 8961 26753 6413 15437 19520 5809 10936 17089 1670 13574 25125 5865 6175 21175 8391 11680 22660 5485 11743 15165 21021 21798 30209 12519 13402 26300 3472 25935 26412 3377 7398 28867 2430 24650 29426 3364 13409 22914 6838 13491 16229 18393 20764 28078 289 20279 24906 4732 6162 13569 8993 17053 29387 2210 5024 24030 21 22976 24053 12359 15499 28251 4640 11480 24391 1083 7965 16573 13116 23916 24421 10129 16284 23855 1758 3843 21163 5626 13543 26708 14918 17713 21718 13556 20450 24679 3911 16778 29952 11735 13710 22611 5347 21681 22906 6912 12045 15866 713 15429 23281 7133 17440 28982 12355 17564 28059 7658 11158 29885 17610 18755 28852 7680 16212 30111 8812 10144 15718 is How to send and receive.

Images