Transmission / reception system and transmission / reception method
By using LDPC code with a coding rate of 3/16 in data transmission, combined with inter-group interleaving and 64QAM 2D-NUC signal mapping, the problem of difficult communication quality of LDPC code in data transmission is solved, and more efficient bit error rate control and communication quality improvement is achieved.
Patent Information
- Application Number
- JP2024059948
- Authority / Receiving Office
- JP · JP
- Patent Type
- Patents
- Current Assignee / Owner
- Priority Date
- 2017-02-20
- Filing Date
- 2024-04-03
- Publication Date
- 2025-04-08
- Estimated Expiration
- 2037-03-23
AI Technical Summary
When using LDPC codes in data transmission, it is difficult to ensure communication quality, especially when high error rates and serious errors are performed.
The LDPC encoding method is adopted, and the LDPC code with a coding rate of 3/16 of 69120 bits is encoded, and the transmission quality is improved through inter-group interleaving and 64QAM 2D-NUC signal mapping.
Through interlaced interlacing and efficient signal mapping, the communication quality of data transmission is significantly improved, and the bit error rate and the occurrence of bit error building phenomena are reduced.
Smart Images

Figure 0007658487000008 
Figure 0007658487000009 
Figure 0007658487000010
Abstract
Description
[Technical field]
[0001] The present technology relates to a transmission / reception system and a transmission / reception method, and more particularly to a transmission / reception system and a transmission / reception method that can ensure good communication quality in data transmission using LDPC codes, for example. [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 method / apparatus of the present technology includes an encoding step / 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 3 / 16, a group-wise interleaving step / unit that performs group-wise interleaving of the LDPC code in units of 360-bit bit groups, and a mapping step / unit that maps the LDPC code to any of 64 signal points of a 2D-NUC (Non-Uniform Constellation) of 64QAM in units of 6 bits, and in the group-wise interleaving, the (i+1)th bit group from the beginning of the LDPC code is defined as bit group i, and a sequence of bit groups 0 to 191 of the 69120-bit LDPC code is mapped to bit group i. 36, 180, 61, 100, 163, 168, 14, 24, 105, 104, 131, 56, 40, 73, 165, 157, 126, 47, 160, 181, 166, 161, 1, 81, 58, 182, 189, 177, 85, 17, 13, 46, 171, 149, 91, 79, 109, 133, 164, 125, 52, 77, 118, 186, 107, 150, 135, 33, 130, 87, 167, 158, 23, 83, 152, 114, 68, 12, 132, 178, 106, 184, 176, 72, 31, 53, 21, 110, 76, 146, 4, 18, 113, 65, 34, 179, 111, 185, 84, 144, 27, 39, 151, 50, 69, 30, 169, 175, 9, 42, 54, 43, 90, 22, 139, 129, 170, 115, 45, 140, 67, 25, 155, 82, 102, 29, 188, 108, 15, 80, 128, 48, 0, 64, 141, 93, 191, 190, 174, 32, 35, 119, 159, 41, 55, 162, 49, 59, 88, 156, 123, 136, 28, 60, 26, 16, 89, 147, 92, 98, 38, 20, 173, 71, 44, 94, 5, 7, 99, 75, 122, 120, 66, 121, 112, 62, 8, 137, 142, 103, 116, 117, 37, 63, 70, 86, 10, 74, 95, 11, 134, 154, 51, 101, 127, 183, 57, 97, 78, 148, 6, 172, 3, 138, 145, 153, 143, 19, 2, 96, 187, 124 and interleaving in the order of the above, the parity check matrix includes an A matrix at the top left of the parity check matrix, which has M1 rows and K columns, represented by a predetermined value M1 and an information length K=N×r of the LDPC code, a B matrix of a staircase structure adjacent to the right of the A matrix, which has M1 rows and M1 columns, a Z matrix which is a zero matrix adjacent to the right of the B matrix, which has M1 rows and N-K-M1 columns, a C matrix adjacent below the A matrix and the B matrix, which has N-K-M1 rows and K+M1 columns, and a D matrix which is an identity matrix adjacent to the right of the C matrix, which has N-K-M1 rows and N-K-M1 columns, the predetermined value M1 is 1800, the A matrix and the C matrix are represented by a parity check matrix initial value table, and the parity 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 every 360 columns, 126 1125 1373 4698 5254 17832 23701 31126 33867 46596 46794 48392 49352 51151 52100 55162 794 1435 1552 4483 14668 16919 21871 36755 42132 43323 46650 47676 50412 53484 54886 55333 698 1356 1519 5555 6877 8407 8414 14248 17811 22998 28378 40695 46542 52817 53284 55968 457 493 1080 2261 4637 5314 9670 11171 12679 29201 35980 43792 44337 47131 49880 55301 467 721 1484 5326 8676 11727 15221 17477 21390 22224 27074 28845 37670 38917 40996 43851 305 389 526 9156 11091 12367 13337 14299 22072 25367 29827 30710 37688 44321 48351 54663 23 342 1426 5889 7362 8213 8512 10655 14549 15486 26010 30403 32196 36341 37705 45137 123 429 485 4093 6933 11291 11639 12558 20096 22292 24696 32438 34615 38061 40659 51577 920 1086 1257 8839 10010 13126 14367 18612 23252 23777 32883 32982 35684 40534 53318 55947 579 937 1593 2549 12702 17659 19393 20047 25145 27792 30322 33311 39737 42052 50294 53363 116 883 1067 9847 10660 12052 18157 20519 21191 24139 27132 27643 30745 33852 37692 37724 915 1154 1698 5197 5249 13741 25043 29802 31354 32707 33804 36856 39887 41245 42065 50240 317 1304 1770 12854 14018 14061 16657 24029 24408 34493 35322 35755 38593 47428 53811 55008 163 216 719 5541 13996 18754 19287 24293 38575 39520 43058 43395 45390 46665 50706 55269 42 415 1326 2553 7963 14878 17850 21757 22166 32986 39076 39267 46154 46790 52877 53780 593 1511 1515 13942 14258 14432 24537 38229 38251 40975 41350 43490 44880 45278 46574 51442 219 262 955 1978 10654 13021 16873 23340 27412 32762 40024 42723 45976 46603 47761 54095 632 944 1598 12924 17942 18478 26487 28036 42462 43513 44487 44584 48245 53274 54343 55453 501 912 1656 2009 6339 15581 20597 26886 32241 34471 37497 43009 45977 46587 46821 51187 610 713 1619 5176 6122 6445 8044 12220 14126 32911 38647 40715 45111 47872 50111 55027 258 445 1137 4517 5846 7644 15604 16606 16969 17622 20691 34589 35808 43692 45126 49527 612 854 1521 13045 14525 15821 21096 23774 24274 25855 26266 27296 30033 40847 44681 46072 714 876 1365 5836 10004 15778 17044 22417 26397 31508 32354 37917 42049 50828 50947 54052 1338 1595 1718 4722 4981 12275 13632 15276 15547 17668 21645 26616 29044 39417 39669 53539 687 721 1054 5918 10421 13356 15941 17657 20704 21564 23649 35798 36475 46109 46414 49845 734 1635 1666 9737 23679 24394 24784 26917 27334 28772 29454 35246 35512 37169 39638 44309 469 918 1212 3912 10712 13084 13906 14000 16602 18040 18697 25940 30677 44811 50590 52018 70 332 496 6421 19082 19665 25460 27377 27378 31086 36629 37104 37236 37771 38622 40678 48 142 1668 2102 3421 10462 13086 13671 24889 36914 37586 40166 42935 49052 49205 52170 294 616 840 2360 5386 7278 10202 15133 24149 24629 27338 28672 31892 39559 50438 50453 517 946 1043 2563 3416 6620 8572 10920 31906 32685 36852 40521 46898 48369 48700 49210 1325 1424 1741 11692 11761 19152 19732 28863 30563 34985 42394 44802 49339 54524 55731 664 1340 1437 9442 10378 12176 18760 19872 21648 34682 37784 40545 44808 47558 53061 378 705 1356 16007 16336 19543 21682 28716 30262 34500 40335 44238 48274 50341 52887 999 1202 1328 10688 11514 11724 15674 21039 35182 36272 41441 42542 52517 54945 56157 247 384 1270 6610 10335 24421 25984 27761 38728 41010 46216 46892 47392 48394 51471 10091 10124 12187 13741 18018 20438 21412 24163 35862 36925 37532 46234 7860 8123 8712 17553 20624 29410 29697 29853 43483 43603 53476 53737 11547 11741 19045 20400 23052 28251 32038 44283 50596 53622 55875 55888 3825 11292 11723 13819 26483 28571 33319 33721 34911 37766 47843 48667 10114 10336 14710 15586 19531 22471 27945 28397 45637 46131 47760 52375 The present invention relates to a transmission method / apparatus.
[0009] A first receiving device / method of the present technology includes a coding unit that performs 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 3 / 16, a group-wise interleaving unit that performs group-wise interleaving to interleave the LDPC code in units of 360-bit bit groups, and a mapping unit that maps the LDPC code to one of 64 signal points of a 2D-Non-Uniform Constellation (NUC) of 64QAM in units of 6 bits, and in the group-wise interleaving, a bit group (i+1) from the beginning of the LDPC code is defined as bit group i, and a sequence of bit groups 0 to 191 of the 69120-bit LDPC code is mapped to bit group (i+1) in the group-wise interleaving. 36, 180, 61, 100, 163, 168, 14, 24, 105, 104, 131, 56, 40, 73, 165, 157, 126, 47, 160, 181, 166, 161, 1, 81, 58, 182, 189, 177, 85, 17, 13, 46, 171, 149, 91, 79, 109, 133, 164, 125, 52, 77, 118, 186, 107, 150, 135, 33, 130, 87, 167, 158, 23, 83, 152, 114, 68, 12, 132, 178, 106, 184, 176, 72, 31, 53, 21, 110, 76, 146, 4, 18, 113, 65, 34, 179, 111, 185, 84, 144, 27, 39, 151, 50, 69, 30, 169, 175, 9, 42, 54, 43, 90, 22, 139, 129, 170, 115, 45, 140, 67, 25, 155, 82, 102, 29, 188, 108, 15, 80, 128, 48, 0, 64, 141, 93, 191, 190, 174, 32, 35, 119, 159, 41, 55, 162, 49, 59, 88, 156, 123, 136, 28, 60, 26, 16, 89, 147, 92, 98, 38, 20, 173, 71, 44, 94, 5, 7, 99, 75, 122, 120, 66, 121, 112, 62, 8, 137, 142, 103, 116, 117, 37, 63, 70, 86, 10, 74, 95, 11, 134, 154, 51, 101, 127, 183, 57, 97, 78, 148, 6, 172, 3, 138, 145, 153, 143, 19, 2, 96, 187, 124 and interleaving in the order of the above, the parity check matrix includes an A matrix at the top left of the parity check matrix, which has M1 rows and K columns, represented by a predetermined value M1 and an information length K=N×r of the LDPC code, a B matrix of a staircase structure adjacent to the right of the A matrix, which has M1 rows and M1 columns, a Z matrix which is a zero matrix adjacent to the right of the B matrix, which has M1 rows and N-K-M1 columns, a C matrix adjacent below the A matrix and the B matrix, which has N-K-M1 rows and K+M1 columns, and a D matrix which is an identity matrix adjacent to the right of the C matrix, which has N-K-M1 rows and N-K-M1 columns, the predetermined value M1 is 1800, the A matrix and the C matrix are represented by a parity check matrix initial value table, and the parity 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 every 360 columns, 126 1125 1373 4698 5254 17832 23701 31126 33867 46596 46794 48392 49352 51151 52100 55162 794 1435 1552 4483 14668 16919 21871 36755 42132 43323 46650 47676 50412 53484 54886 55333 698 1356 1519 5555 6877 8407 8414 14248 17811 22998 28378 40695 46542 52817 53284 55968 457 493 1080 2261 4637 5314 9670 11171 12679 29201 35980 43792 44337 47131 49880 55301 467 721 1484 5326 8676 11727 15221 17477 21390 22224 27074 28845 37670 38917 40996 43851 305 389 526 9156 11091 12367 13337 14299 22072 25367 29827 30710 37688 44321 48351 54663 23 342 1426 5889 7362 8213 8512 10655 14549 15486 26010 30403 32196 36341 37705 45137 123 429 485 4093 6933 11291 11639 12558 20096 22292 24696 32438 34615 38061 40659 51577 920 1086 1257 8839 10010 13126 14367 18612 23252 23777 32883 32982 35684 40534 53318 55947 579 937 1593 2549 12702 17659 19393 20047 25145 27792 30322 33311 39737 42052 50294 53363 116 883 1067 9847 10660 12052 18157 20519 21191 24139 27132 27643 30745 33852 37692 37724 915 1154 1698 5197 5249 13741 25043 29802 31354 32707 33804 36856 39887 41245 42065 50240 317 1304 1770 12854 14018 14061 16657 24029 24408 34493 35322 35755 38593 47428 53811 55008 163 216 719 5541 13996 18754 19287 24293 38575 39520 43058 43395 45390 46665 50706 55269 42 415 1326 2553 7963 14878 17850 21757 22166 32986 39076 39267 46154 46790 52877 53780 593 1511 1515 13942 14258 14432 24537 38229 38251 40975 41350 43490 44880 45278 46574 51442 219 262 955 1978 10654 13021 16873 23340 27412 32762 40024 42723 45976 46603 47761 54095 632 944 1598 12924 17942 18478 26487 28036 42462 43513 44487 44584 48245 53274 54343 55453 501 912 1656 2009 6339 15581 20597 26886 32241 34471 37497 43009 45977 46587 46821 51187 610 713 1619 5176 6122 6445 8044 12220 14126 32911 38647 40715 45111 47872 50111 55027 258 445 1137 4517 5846 7644 15604 16606 16969 17622 20691 34589 35808 43692 45126 49527 612 854 1521 13045 14525 15821 21096 23774 24274 25855 26266 27296 30033 40847 44681 46072 714 876 1365 5836 10004 15778 17044 22417 26397 31508 32354 37917 42049 50828 50947 54052 1338 1595 1718 4722 4981 12275 13632 15276 15547 17668 21645 26616 29044 39417 39669 53539 687 721 1054 5918 10421 13356 15941 17657 20704 21564 23649 35798 36475 46109 46414 49845 734 1635 1666 9737 23679 24394 24784 26917 27334 28772 29454 35246 35512 37169 39638 44309 469 918 1212 3912 10712 13084 13906 14000 16602 18040 18697 25940 30677 44811 50590 52018 70 332 496 6421 19082 19665 25460 27377 27378 31086 36629 37104 37236 37771 38622 40678 48 142 1668 2102 3421 10462 13086 13671 24889 36914 37586 40166 42935 49052 49205 52170 294 616 840 2360 5386 7278 10202 15133 24149 24629 27338 28672 31892 39559 50438 50453 517 946 1043 2563 3416 6620 8572 10920 31906 32685 36852 40521 46898 48369 48700 49210 1325 1424 1741 11692 11761 19152 19732 28863 30563 34985 42394 44802 49339 54524 55731 664 1340 1437 9442 10378 12176 18760 19872 21648 34682 37784 40545 44808 47558 53061 378 705 1356 16007 16336 19543 21682 28716 30262 34500 40335 44238 48274 50341 52887 999 1202 1328 10688 11514 11724 15674 21039 35182 36272 41441 42542 52517 54945 56157 247 384 1270 6610 10335 24421 25984 27761 38728 41010 46216 46892 47392 48394 51471 10091 10124 12187 13741 18018 20438 21412 24163 35862 36925 37532 46234 7860 8123 8712 17553 20624 29410 29697 29853 43483 43603 53476 53737 11547 11741 19045 20400 23052 28251 32038 44283 50596 53622 55875 55888 3825 11292 11723 13819 26483 28571 33319 33721 34911 37766 47843 48667 10114 10336 14710 15586 19531 22471 27945 28397 45637 46131 47760 52375 The receiving device / method includes a group-wise deinterleaving unit / step for restoring the arrangement of the LDPC codes after group-wise interleaving, obtained from data transmitted from a transmitting device, to the original arrangement.
[0010] A second transmission method / apparatus of the present technology includes an encoding step / 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 5 / 16, a group-wise interleaving step / unit that performs group-wise interleaving of the LDPC code in units of 360-bit bit groups, and a mapping step / unit that maps the LDPC code to any of 64 signal points of a 2D-NUC (Non-Uniform Constellation) of 64QAM in units of 6 bits, and in the group-wise interleaving, the (i+1)th bit group from the beginning of the LDPC code is defined as bit group i, and a sequence of bit groups 0 to 191 of the 69120-bit LDPC code is mapped to bit group i. 92, 83, 138, 67, 27, 88, 13, 26, 73, 16, 187, 18, 76, 28, 79, 130, 91, 58, 140, 38, 6, 43, 17, 168, 141, 96, 70, 147, 112, 164, 97, 161, 139, 65, 78, 95, 146, 3, 32, 158, 24, 0, 94, 120, 176, 128, 59, 81, 21, 102, 190, 8, 114, 113, 29, 45, 103, 56, 54, 173, 177, 12, 174, 108, 169, 148, 123, 129, 150, 77, 157, 184, 61, 127, 121, 156, 104, 111, 68, 160, 107, 117, 124, 84, 35, 10, 90, 106, 144, 66, 64, 15, 46, 125, 44, 37, 20, 135, 53, 71, 152, 183, 162, 50, 167, 11, 142, 149, 131, 191, 166, 31, 185, 134, 19, 178, 52, 188, 2, 75, 110, 145, 41, 159, 136, 100, 9, 62, 60, 34, 116, 23, 42, 105, 40, 118, 186, 4, 5, 182, 170, 87, 1, 22, 55, 126, 63, 14, 25, 153, 98, 49, 33, 69, 179, 171, 93, 36, 133, 57, 151, 82, 72, 163, 86, 47, 119, 48, 99, 30, 189, 115, 165, 101, 80, 175, 132, 89, 39, 181, 85, 51, 154, 137, 7, 180, 155, 74, 109, 122, 172, 143 and interleaving in the order of the above, the parity check matrix includes an A matrix at the top left of the parity check matrix, which has M1 rows and K columns, represented by a predetermined value M1 and an information length K=N×r of the LDPC code, a B matrix of a staircase structure adjacent to the right of the A matrix, which has M1 rows and M1 columns, a Z matrix which is a zero matrix adjacent to the right of the B matrix, which has M1 rows and N-K-M1 columns, a C matrix adjacent below the A matrix and the B matrix, which has N-K-M1 rows and K+M1 columns, and a D matrix which is an identity matrix adjacent to the right of the C matrix, which has N-K-M1 rows and N-K-M1 columns, the predetermined value M1 is 1800, the A matrix and the C matrix are represented by a parity check matrix initial value table, and the parity 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 every 360 columns, 152 1634 7484 23081 24142 26799 33620 40989 41902 44319 44378 45067 140 701 5137 7313 12672 16929 20359 27052 30236 33846 36254 46973 748 769 2891 7812 9964 15629 19104 20551 25796 28144 31518 34124 542 976 2279 18904 20877 24190 25903 28129 36804 41152 41957 46888 173 960 2926 11682 12304 13284 18037 22702 30255 33718 34073 37152 78 1487 4898 7472 8033 10631 11732 19334 24577 34586 38651 43639 594 1095 1857 2368 8909 17295 17546 21865 23257 31273 37013 41454 72 419 1596 7849 16093 23167 26923 31883 36092 40348 44500 866 1120 1568 1986 3532 20094 21663 26664 26970 33542 42578 868 917 1216 12018 15402 20691 24736 33133 36692 40276 46616 955 1070 1749 7988 10235 19174 22733 24283 27985 38200 44029 613 1729 1787 19542 21227 21376 31057 36104 36874 38078 42445 86 1555 1644 4633 14402 14997 25724 31382 31911 32224 43900 353 1132 1246 5544 7248 17887 25769 27008 28773 33188 44663 600 958 1376 6417 6814 17587 20680 25376 29522 31396 40526 179 528 1472 2481 5589 15696 20148 28040 29690 32370 42163 122 144 681 6613 11230 20862 26396 27737 35928 39396 42713 934 1256 1420 3881 4487 5830 7897 9587 17940 40333 41925 622 1458 1490 16541 18443 19401 24860 26981 28157 32875 38755 1017 1143 1511 2169 17322 24662 25971 29149 31450 31670 34779 935 1084 1534 2918 10596 11534 17476 27269 30344 31104 37975 173 532 1766 8001 10483 17002 19002 26759 31006 43466 47443 221 610 1795 9197 11770 12793 14875 30177 30610 42274 43888 188 439 1332 7030 9246 15150 26060 26541 27190 28259 36763 812 1643 1750 7446 7888 7995 18804 21646 28995 30727 39065 44 481 555 5618 9621 9873 19182 22059 42510 45343 46058 156 532 1799 6258 18733 19988 23237 27657 30835 34738 39503 1128 1553 1790 8372 11543 13764 17062 28627 38502 40796 42461 564 777 1286 3446 5566 12105 16038 18918 21802 25954 28137 1167 1178 1770 4151 11422 11833 16823 17799 19188 22517 29979 576 638 1364 12257 22028 24243 24297 31788 36398 38409 47211 334 592 940 2865 12075 12708 21452 31961 32150 35723 46278 1205 1267 1721 9293 18685 18917 23490 27678 37645 40114 45733 189 628 821 17066 19218 21462 25452 26858 38408 38941 42354 190 951 1019 5572 7135 15647 32613 33863 33981 35670 43727 84 1003 1597 12597 15567 21221 21891 23151 23964 24816 46178 756 1262 1345 6694 6893 9300 9497 17950 19082 35668 38447 848 948 1560 6591 12529 12535 20567 23882 34481 46531 46541 504 631 777 10585 12330 13822 15388 23332 27688 35955 38051 676 1484 1575 2215 5830 6049 13558 25034 33602 35663 41025 1298 1427 1732 13930 15611 19462 20975 23200 30460 30682 34883 1491 1593 1615 4289 7010 10264 21047 26704 27024 29658 46766 969 1730 1748 2217 7181 7623 15860 21332 28133 28998 36077 302 1216 1374 5177 6849 7239 10255 34952 37908 39911 41738 220 362 1491 5235 5439 22708 29228 29481 33272 36831 46487 4 728 1279 4579 8325 8505 27604 31437 33574 41716 45082 472 735 1558 4454 6957 14867 18307 22437 38304 42054 45307 85 466 851 3669 7119 32748 32845 41914 42595 42600 45101 52 553 824 2994 4569 12505 24738 33258 37121 43381 44753 37 495 1553 7684 8908 12412 15563 16461 17872 29292 30619 254 1057 1481 9971 18408 19815 28569 29164 39281 42723 45604 16 1213 1614 4352 8091 8847 10022 24394 35661 43800 44362 395 750 888 2582 3772 4151 26025 36367 42326 42673 47393 862 1379 1441 6413 25621 28378 34869 35491 41774 44165 45411 46 213 1597 2771 4694 4923 17101 17212 19347 22002 43226 1339 1544 1610 13522 14840 15355 29399 30125 33685 36350 37672 251 1162 1260 9766 13137 34769 36646 43313 43736 43828 45151 214 1002 1688 5357 19091 19213 24460 28843 32869 35013 39791 646 733 1735 11175 11336 12043 22962 33892 35646 37116 38655 293 927 1064 4818 5842 10983 12871 17804 33127 41604 46588 10927 15514 22748 34850 37645 40669 41583 44090 3329 7548 8092 11659 16832 35304 46738 46888 3510 5915 9603 30333 37198 42866 44361 46416 2575 5311 9421 13410 15375 34017 37136 43990 12468 14492 24417 26394 38565 38936 41899 45593 The present invention relates to a transmission method / apparatus.
[0011] A second receiving apparatus / 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 5 / 16, a group-wise interleaving unit that performs group-wise interleaving of the LDPC code in units of 360-bit bit groups, and a mapping unit that maps the LDPC code to any of 64 signal points of a 2D-Non-Uniform Constellation (NUC) of 64QAM in units of 6 bits, and in the group-wise interleaving, a bit group (i+1) from the beginning of the LDPC code is defined as bit group i, and a sequence of bit groups 0 to 191 of the 69120-bit LDPC code is mapped to bit group (i+2). 92, 83, 138, 67, 27, 88, 13, 26, 73, 16, 187, 18, 76, 28, 79, 130, 91, 58, 140, 38, 6, 43, 17, 168, 141, 96, 70, 147, 112, 164, 97, 161, 139, 65, 78, 95, 146, 3, 32, 158, 24, 0, 94, 120, 176, 128, 59, 81, 21, 102, 190, 8, 114, 113, 29, 45, 103, 56, 54, 173, 177, 12, 174, 108, 169, 148, 123, 129, 150, 77, 157, 184, 61, 127, 121, 156, 104, 111, 68, 160, 107, 117, 124, 84, 35, 10, 90, 106, 144, 66, 64, 15, 46, 125, 44, 37, 20, 135, 53, 71, 152, 183, 162, 50, 167, 11, 142, 149, 131, 191, 166, 31, 185, 134, 19, 178, 52, 188, 2, 75, 110, 145, 41, 159, 136, 100, 9, 62, 60, 34, 116, 23, 42, 105, 40, 118, 186, 4, 5, 182, 170, 87, 1, 22, 55, 126, 63, 14, 25, 153, 98, 49, 33, 69, 179, 171, 93, 36, 133, 57, 151, 82, 72, 163, 86, 47, 119, 48, 99, 30, 189, 115, 165, 101, 80, 175, 132, 89, 39, 181, 85, 51, 154, 137, 7, 180, 155, 74, 109, 122, 172, 143 and interleaving in the order of the above, the parity check matrix includes an A matrix at the top left of the parity check matrix, which has M1 rows and K columns, represented by a predetermined value M1 and an information length K=N×r of the LDPC code, a B matrix of a staircase structure adjacent to the right of the A matrix, which has M1 rows and M1 columns, a Z matrix which is a zero matrix adjacent to the right of the B matrix, which has M1 rows and N-K-M1 columns, a C matrix adjacent below the A matrix and the B matrix, which has N-K-M1 rows and K+M1 columns, and a D matrix which is an identity matrix adjacent to the right of the C matrix, which has N-K-M1 rows and N-K-M1 columns, the predetermined value M1 is 1800, the A matrix and the C matrix are represented by a parity check matrix initial value table, and the parity 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 every 360 columns, 152 1634 7484 23081 24142 26799 33620 40989 41902 44319 44378 45067 140 701 5137 7313 12672 16929 20359 27052 30236 33846 36254 46973 748 769 2891 7812 9964 15629 19104 20551 25796 28144 31518 34124 542 976 2279 18904 20877 24190 25903 28129 36804 41152 41957 46888 173 960 2926 11682 12304 13284 18037 22702 30255 33718 34073 37152 78 1487 4898 7472 8033 10631 11732 19334 24577 34586 38651 43639 594 1095 1857 2368 8909 17295 17546 21865 23257 31273 37013 41454 72 419 1596 7849 16093 23167 26923 31883 36092 40348 44500 866 1120 1568 1986 3532 20094 21663 26664 26970 33542 42578 868 917 1216 12018 15402 20691 24736 33133 36692 40276 46616 955 1070 1749 7988 10235 19174 22733 24283 27985 38200 44029 613 1729 1787 19542 21227 21376 31057 36104 36874 38078 42445 86 1555 1644 4633 14402 14997 25724 31382 31911 32224 43900 353 1132 1246 5544 7248 17887 25769 27008 28773 33188 44663 600 958 1376 6417 6814 17587 20680 25376 29522 31396 40526 179 528 1472 2481 5589 15696 20148 28040 29690 32370 42163 122 144 681 6613 11230 20862 26396 27737 35928 39396 42713 934 1256 1420 3881 4487 5830 7897 9587 17940 40333 41925 622 1458 1490 16541 18443 19401 24860 26981 28157 32875 38755 1017 1143 1511 2169 17322 24662 25971 29149 31450 31670 34779 935 1084 1534 2918 10596 11534 17476 27269 30344 31104 37975 173 532 1766 8001 10483 17002 19002 26759 31006 43466 47443 221 610 1795 9197 11770 12793 14875 30177 30610 42274 43888 188 439 1332 7030 9246 15150 26060 26541 27190 28259 36763 812 1643 1750 7446 7888 7995 18804 21646 28995 30727 39065 44 481 555 5618 9621 9873 19182 22059 42510 45343 46058 156 532 1799 6258 18733 19988 23237 27657 30835 34738 39503 1128 1553 1790 8372 11543 13764 17062 28627 38502 40796 42461 564 777 1286 3446 5566 12105 16038 18918 21802 25954 28137 1167 1178 1770 4151 11422 11833 16823 17799 19188 22517 29979 576 638 1364 12257 22028 24243 24297 31788 36398 38409 47211 334 592 940 2865 12075 12708 21452 31961 32150 35723 46278 1205 1267 1721 9293 18685 18917 23490 27678 37645 40114 45733 189 628 821 17066 19218 21462 25452 26858 38408 38941 42354 190 951 1019 5572 7135 15647 32613 33863 33981 35670 43727 84 1003 1597 12597 15567 21221 21891 23151 23964 24816 46178 756 1262 1345 6694 6893 9300 9497 17950 19082 35668 38447 848 948 1560 6591 12529 12535 20567 23882 34481 46531 46541 504 631 777 10585 12330 13822 15388 23332 27688 35955 38051 676 1484 1575 2215 5830 6049 13558 25034 33602 35663 41025 1298 1427 1732 13930 15611 19462 20975 23200 30460 30682 34883 1491 1593 1615 4289 7010 10264 21047 26704 27024 29658 46766 969 1730 1748 2217 7181 7623 15860 21332 28133 28998 36077 302 1216 1374 5177 6849 7239 10255 34952 37908 39911 41738 220 362 1491 5235 5439 22708 29228 29481 33272 36831 46487 4 728 1279 4579 8325 8505 27604 31437 33574 41716 45082 472 735 1558 4454 6957 14867 18307 22437 38304 42054 45307 85 466 851 3669 7119 32748 32845 41914 42595 42600 45101 52 553 824 2994 4569 12505 24738 33258 37121 43381 44753 37 495 1553 7684 8908 12412 15563 16461 17872 29292 30619 254 1057 1481 9971 18408 19815 28569 29164 39281 42723 45604 16 1213 1614 4352 8091 8847 10022 24394 35661 43800 44362 395 750 888 2582 3772 4151 26025 36367 42326 42673 47393 862 1379 1441 6413 25621 28378 34869 35491 41774 44165 45411 46 213 1597 2771 4694 4923 17101 17212 19347 22002 43226 1339 1544 1610 13522 14840 15355 29399 30125 33685 36350 37672 251 1162 1260 9766 13137 34769 36646 43313 43736 43828 45151 214 1002 1688 5357 19091 19213 24460 28843 32869 35013 39791 646 733 1735 11175 11336 12043 22962 33892 35646 37116 38655 293 927 1064 4818 5842 10983 12871 17804 33127 41604 46588 10927 15514 22748 34850 37645 40669 41583 44090 3329 7548 8092 11659 16832 35304 46738 46888 3510 5915 9603 30333 37198 42866 44361 46416 2575 5311 9421 13410 15375 34017 37136 43990 12468 14492 24417 26394 38565 38936 41899 45593 The receiving device / method includes a group-wise deinterleaving unit / step for restoring the arrangement of the LDPC codes after group-wise interleaving, obtained from data transmitted from a transmitting device, to the original arrangement.
[0012] A third transmission method / apparatus of the present technology includes an encoding step / 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 7 / 16, a group-wise interleaving step / unit that performs group-wise interleaving of the LDPC code in units of 360-bit bit groups, and a mapping step / unit that maps the LDPC code to any of 64 signal points of a 2D-NUC (Non-Uniform Constellation) of 64QAM in units of 6 bits, and in the group-wise interleaving, the (i+1)th bit group from the beginning of the LDPC code is defined as bit group i, and a sequence of bit groups 0 to 191 of the 69120-bit LDPC code is mapped to bit group i. 52, 117, 42, 131, 45, 120, 44, 63, 91, 0, 33, 176, 95, 36, 134, 170, 148, 32, 130, 20, 124, 51, 152, 96, 92, 90, 184, 103, 53, 14, 110, 80, 107, 145, 181, 137, 61, 149, 114, 126, 136, 161, 58, 162, 88, 8, 171, 178, 174, 94, 118, 19, 35, 1, 191, 115, 23, 10, 150, 67, 46, 56, 172, 129, 109, 98, 89, 68, 101, 121, 78, 182, 12, 173, 128, 77, 168, 156, 186, 165, 39, 187, 5, 158, 104, 2, 49, 154, 59, 82, 65, 30, 127, 17, 113, 164, 179, 34, 69, 189, 123, 147, 183, 21, 163, 143, 57, 100, 28, 185, 25, 140, 13, 66, 141, 62, 47, 54, 169, 106, 38, 86, 116, 151, 41, 4, 75, 108, 85, 153, 72, 125, 22, 135, 50, 70, 74, 11, 76, 138, 132, 55, 167, 40, 144, 31, 142, 37, 29, 99, 83, 26, 119, 64, 27, 9, 15, 97, 73, 133, 79, 190, 111, 43, 48, 102, 7, 139, 84, 24, 112, 177, 16, 180, 175, 81, 3, 60, 18, 188, 93, 105, 157, 87, 166, 159, 155, 122, 146, 6, 160, 71 and interleaving in the order of the above, the parity check matrix includes an A matrix at the top left of the parity check matrix, which has M1 rows and K columns, represented by a predetermined value M1 and an information length K=N×r of the LDPC code, a B matrix of a staircase structure adjacent to the right of the A matrix, which has M1 rows and M1 columns, a Z matrix which is a zero matrix adjacent to the right of the B matrix, which has M1 rows and N-K-M1 columns, a C matrix adjacent below the A matrix and the B matrix, which has N-K-M1 rows and K+M1 columns, and a D matrix which is an identity matrix adjacent to the right of the C matrix, which has N-K-M1 rows and N-K-M1 columns, the predetermined value M1 is 4680, the A matrix and the C matrix are represented by a parity check matrix initial value table, and the parity 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 every 360 columns, 1012 3997 5398 5796 21940 23609 25002 28007 32214 33822 38194 1110 4016 5752 10837 15440 15952 17802 27468 32933 33191 35420 95 1953 6554 11381 12839 12880 22901 26742 26910 27621 37825 1146 2232 5658 13131 13785 16771 17466 20561 29400 32962 36879 2023 3420 5107 10789 12303 13316 14428 24912 35363 36348 38787 3283 3637 12474 14376 20459 22584 23093 28876 31485 31742 34849 1807 3890 4865 7562 9091 13778 18361 21934 24548 34267 38260 1613 3620 10165 11464 14071 20675 20803 26814 27593 29483 36485 849 3946 8585 9208 9939 14676 14990 19276 23459 30577 36838 1890 2583 5951 6003 11943 13641 16319 18379 22957 24644 33430 1936 3939 5267 6314 12665 19626 20457 22010 27958 30238 32976 2153 4318 6782 13048 17730 17923 24137 24741 25594 32852 33209 1869 4262 6616 13522 19266 19384 22769 28883 30389 35102 36019 3037 3116 7478 7841 10627 10908 14060 14163 23772 27946 37835 1668 3125 7485 8525 14659 22834 24080 24838 30890 33391 36788 1623 2836 6776 8549 11448 23281 32033 32729 33650 34069 34607 101 1420 5172 7475 11673 18807 21367 23095 26368 30888 37882 3874 3940 4823 16485 21601 21655 21885 25541 30177 31656 35067 592 643 4847 6870 7671 10412 25081 33412 33478 33495 35976 2578 2677 12592 17140 17185 21962 23206 23838 27624 32594 34828 3058 3443 4959 21179 22411 24033 26004 26489 26775 33816 36694 91 2998 10137 11957 12444 22330 24300 26008 26441 26521 38191 889 1840 8881 10228 12495 18162 22259 23385 25687 35853 38848 1332 3031 13482 14262 15897 23112 25954 28035 34898 36286 36991 2505 2599 10980 15245 20084 20114 24496 26309 31139 34090 37258 599 1778 8935 16154 19546 23537 24938 32059 32406 35564 37175 392 1777 4793 8050 10543 10668 14823 25252 32922 36658 37832 1680 2630 7190 7880 10894 20675 27523 33460 33733 34000 35829 532 3750 5075 10603 12466 19838 24231 24998 27647 35111 38617 1786 3066 11367 12452 13896 15346 24646 25509 26109 30358 37392 1027 1659 6483 16919 17636 18905 19741 30579 35934 36515 37617 2064 2354 14085 16460 21378 21719 22981 23329 31701 32057 32640 2009 4421 7595 8790 12803 17649 18527 24246 27584 28757 31794 364 646 9398 13898 17486 17709 20911 31493 31810 32019 33341 2246 3760 4911 19338 25792 27511 28689 30634 31928 34984 36605 3178 3544 8858 9336 9602 12290 16521 27872 28391 28422 36105 1981 2209 12718 20656 21253 22574 28653 29967 33692 36759 37871 787 1545 7652 8376 9628 9995 10289 16260 17606 22673 34564 795 4580 12749 16670 18727 19131 19449 26152 29165 30820 31678 1577 2980 8659 12301 13813 14838 20782 23068 30185 34308 34676 84 434 13572 21777 24581 28397 28490 32547 33282 34655 37579 2927 4440 8979 14992 19009 20435 23558 26280 31320 35106 37704 1974 2712 6552 8585 10051 14848 15186 22968 24285 25878 36054 585 1990 3457 5010 8808 9 2792 4678 22666 32922 342 507 861 18844 32947 554 3395 4094 8147 34616 356 2061 2801 20330 38214 425 2432 4573 7323 28157 73 1192 2618 7812 17947 842 1053 4088 10818 24053 1234 1249 4171 6645 37350 1498 2113 4175 6432 17014 524 2135 2205 6311 7502 191 954 3166 28938 31869 548 586 4101 12129 25819 127 2352 3215 6791 13523 286 4262 4423 14087 38061 1645 3551 4209 14083 15827 719 1087 2813 32857 34499 651 2752 4548 25139 25514 1702 4186 4478 10785 33263 34 3157 4196 5811 36555 643 649 1524 6587 27246 291 836 1036 18936 19201 78 1099 4174 18305 36119 3083 3173 4667 27349 32057 3449 4090 4339 18334 24596 503 3816 4465 29204 35316 102 1693 1799 17180 35877 288 324 1237 16167 33970 224 2831 3571 17861 28530 1202 2803 2834 4943 31485 1112 2196 3027 29308 37101 4242 4291 4503 16344 28769 1020 1927 3349 9686 33845 3179 3304 3891 8448 37247 1076 2319 4512 17010 18781 987 1391 3781 12318 35710 2268 3467 3619 15764 25608 764 1135 2224 8647 17486 2091 4081 4648 8101 33818 471 3668 4069 14925 36242 932 2140 3428 12523 33270 5840 8959 12039 15972 38496 5960 7759 10493 31160 38054 10380 14835 26024 35399 36517 5260 7306 13419 28804 31112 12747 23075 32458 36239 37437 14096 16976 21598 32228 34672 5024 5769 21798 22675 25316 8617 14189 17874 22776 29780 7628 13623 16676 30019 33213 14090 14254 18987 21720 38550 17306 17709 19135 22995 28597 13137 18028 23943 27468 37156 7704 8171 10815 28138 29526 The present invention relates to a transmission method / apparatus.
[0013] A third receiving apparatus / 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 7 / 16, a group-wise interleaving unit that performs group-wise interleaving of the LDPC code in units of 360-bit bit groups, and a mapping unit that maps the LDPC code to one of 64 signal points of a 2D-Non-Uniform Constellation (NUC) of 64QAM in units of 6 bits, and in the group-wise interleaving, a bit group (i+1) from the beginning of the LDPC code is defined as bit group i, and a sequence of bit groups 0 to 191 of the 69120-bit LDPC code is mapped to bit group (i+1) in the group-wise interleaving. 52, 117, 42, 131, 45, 120, 44, 63, 91, 0, 33, 176, 95, 36, 134, 170, 148, 32, 130, 20, 124, 51, 152, 96, 92, 90, 184, 103, 53, 14, 110, 80, 107, 145, 181, 137, 61, 149, 114, 126, 136, 161, 58, 162, 88, 8, 171, 178, 174, 94, 118, 19, 35, 1, 191, 115, 23, 10, 150, 67, 46, 56, 172, 129, 109, 98, 89, 68, 101, 121, 78, 182, 12, 173, 128, 77, 168, 156, 186, 165, 39, 187, 5, 158, 104, 2, 49, 154, 59, 82, 65, 30, 127, 17, 113, 164, 179, 34, 69, 189, 123, 147, 183, 21, 163, 143, 57, 100, 28, 185, 25, 140, 13, 66, 141, 62, 47, 54, 169, 106, 38, 86, 116, 151, 41, 4, 75, 108, 85, 153, 72, 125, 22, 135, 50, 70, 74, 11, 76, 138, 132, 55, 167, 40, 144, 31, 142, 37, 29, 99, 83, 26, 119, 64, 27, 9, 15, 97, 73, 133, 79, 190, 111, 43, 48, 102, 7, 139, 84, 24, 112, 177, 16, 180, 175, 81, 3, 60, 18, 188, 93, 105, 157, 87, 166, 159, 155, 122, 146, 6, 160, 71 and interleaving in the order of the above, the parity check matrix includes an A matrix at the top left of the parity check matrix, which has M1 rows and K columns, represented by a predetermined value M1 and an information length K=N×r of the LDPC code, a B matrix of a staircase structure adjacent to the right of the A matrix, which has M1 rows and M1 columns, a Z matrix which is a zero matrix adjacent to the right of the B matrix, which has M1 rows and N-K-M1 columns, a C matrix adjacent below the A matrix and the B matrix, which has N-K-M1 rows and K+M1 columns, and a D matrix which is an identity matrix adjacent to the right of the C matrix, which has N-K-M1 rows and N-K-M1 columns, the predetermined value M1 is 4680, the A matrix and the C matrix are represented by a parity check matrix initial value table, and the parity 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 every 360 columns, 1012 3997 5398 5796 21940 23609 25002 28007 32214 33822 38194 1110 4016 5752 10837 15440 15952 17802 27468 32933 33191 35420 95 1953 6554 11381 12839 12880 22901 26742 26910 27621 37825 1146 2232 5658 13131 13785 16771 17466 20561 29400 32962 36879 2023 3420 5107 10789 12303 13316 14428 24912 35363 36348 38787 3283 3637 12474 14376 20459 22584 23093 28876 31485 31742 34849 1807 3890 4865 7562 9091 13778 18361 21934 24548 34267 38260 1613 3620 10165 11464 14071 20675 20803 26814 27593 29483 36485 849 3946 8585 9208 9939 14676 14990 19276 23459 30577 36838 1890 2583 5951 6003 11943 13641 16319 18379 22957 24644 33430 1936 3939 5267 6314 12665 19626 20457 22010 27958 30238 32976 2153 4318 6782 13048 17730 17923 24137 24741 25594 32852 33209 1869 4262 6616 13522 19266 19384 22769 28883 30389 35102 36019 3037 3116 7478 7841 10627 10908 14060 14163 23772 27946 37835 1668 3125 7485 8525 14659 22834 24080 24838 30890 33391 36788 1623 2836 6776 8549 11448 23281 32033 32729 33650 34069 34607 101 1420 5172 7475 11673 18807 21367 23095 26368 30888 37882 3874 3940 4823 16485 21601 21655 21885 25541 30177 31656 35067 592 643 4847 6870 7671 10412 25081 33412 33478 33495 35976 2578 2677 12592 17140 17185 21962 23206 23838 27624 32594 34828 3058 3443 4959 21179 22411 24033 26004 26489 26775 33816 36694 91 2998 10137 11957 12444 22330 24300 26008 26441 26521 38191 889 1840 8881 10228 12495 18162 22259 23385 25687 35853 38848 1332 3031 13482 14262 15897 23112 25954 28035 34898 36286 36991 2505 2599 10980 15245 20084 20114 24496 26309 31139 34090 37258 599 1778 8935 16154 19546 23537 24938 32059 32406 35564 37175 392 1777 4793 8050 10543 10668 14823 25252 32922 36658 37832 1680 2630 7190 7880 10894 20675 27523 33460 33733 34000 35829 532 3750 5075 10603 12466 19838 24231 24998 27647 35111 38617 1786 3066 11367 12452 13896 15346 24646 25509 26109 30358 37392 1027 1659 6483 16919 17636 18905 19741 30579 35934 36515 37617 2064 2354 14085 16460 21378 21719 22981 23329 31701 32057 32640 2009 4421 7595 8790 12803 17649 18527 24246 27584 28757 31794 364 646 9398 13898 17486 17709 20911 31493 31810 32019 33341 2246 3760 4911 19338 25792 27511 28689 30634 31928 34984 36605 3178 3544 8858 9336 9602 12290 16521 27872 28391 28422 36105 1981 2209 12718 20656 21253 22574 28653 29967 33692 36759 37871 787 1545 7652 8376 9628 9995 10289 16260 17606 22673 34564 795 4580 12749 16670 18727 19131 19449 26152 29165 30820 31678 1577 2980 8659 12301 13813 14838 20782 23068 30185 34308 34676 84 434 13572 21777 24581 28397 28490 32547 33282 34655 37579 2927 4440 8979 14992 19009 20435 23558 26280 31320 35106 37704 1974 2712 6552 8585 10051 14848 15186 22968 24285 25878 36054 585 1990 3457 5010 8808 9 2792 4678 22666 32922 342 507 861 18844 32947 554 3395 4094 8147 34616 356 2061 2801 20330 38214 425 2432 4573 7323 28157 73 1192 2618 7812 17947 842 1053 4088 10818 24053 1234 1249 4171 6645 37350 1498 2113 4175 6432 17014 524 2135 2205 6311 7502 191 954 3166 28938 31869 548 586 4101 12129 25819 127 2352 3215 6791 13523 286 4262 4423 14087 38061 1645 3551 4209 14083 15827 719 1087 2813 32857 34499 651 2752 4548 25139 25514 1702 4186 4478 10785 33263 34 3157 4196 5811 36555 643 649 1524 6587 27246 291 836 1036 18936 19201 78 1099 4174 18305 36119 3083 3173 4667 27349 32057 3449 4090 4339 18334 24596 503 3816 4465 29204 35316 102 1693 1799 17180 35877 288 324 1237 16167 33970 224 2831 3571 17861 28530 1202 2803 2834 4943 31485 1112 2196 3027 29308 37101 4242 4291 4503 16344 28769 1020 1927 3349 9686 33845 3179 3304 3891 8448 37247 1076 2319 4512 17010 18781 987 1391 3781 12318 35710 2268 3467 3619 15764 25608 764 1135 2224 8647 17486 2091 4081 4648 8101 33818 471 3668 4069 14925 36242 932 2140 3428 12523 33270 5840 8959 12039 15972 38496 5960 7759 10493 31160 38054 10380 14835 26024 35399 36517 5260 7306 13419 28804 31112 12747 23075 32458 36239 37437 14096 16976 21598 32228 34672 5024 5769 21798 22675 25316 8617 14189 17874 22776 29780 7628 13623 16676 30019 33213 14090 14254 18987 21720 38550 17306 17709 19135 22995 28597 13137 18028 23943 27468 37156 7704 8171 10815 28138 29526 The receiving device / method includes a group-wise deinterleaving unit / step for restoring the arrangement of the LDPC codes after group-wise interleaving, obtained from data transmitted from a transmitting device, to the original arrangement.
[0014] A fourth transmission method / apparatus of the present technology includes an encoding step / unit that performs LDPC encoding 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, a group-wise interleaving step / unit that performs group-wise interleaving of the LDPC code in units of 360-bit bit groups, and a mapping step / unit that maps the LDPC code to any of 64 signal points of a 2D-NUC (Non-Uniform Constellation) of 64QAM in units of 6 bits, and in the group-wise interleaving, a bit group i+1-th bit group from the beginning of the LDPC code is defined as bit group i, and a sequence of bit groups 0 to 191 of the 69120-bit LDPC code is mapped to bit group i+2-th bit group i+3-th bit group i+4-th bit group i+5-th bit group i+6-th bit group i+7-th bit group i+8-th bit group i+9-th bit group i+1-th bit group i+1-th bit group i+2-th bit group i+3-th bit group i+4-th bit group i+5-th bit group i+6-th bit group i+8-th bit group i+9-th bit group i+1-th bit group i+1-th bit group i+2-th bit group i+1-th bit group i+1-th bit group i+2-th bit group i+3-th bit group i+4-th bit group i+5-th bit group i+6 ...1-th bit group i+2- 60, 117, 182, 104, 53, 26, 11, 121, 71, 32, 179, 34, 38, 145, 166, 65, 137, 7, 124, 58, 90, 29, 144, 116, 91, 88, 98, 161, 83, 177, 85, 154, 146, 178, 123, 76, 75, 3, 64, 151, 99, 118, 57, 106, 16, 61, 162, 19, 12, 94, 39, 93, 92, 73, 82, 138, 108, 139, 130, 163, 152, 159, 168, 189, 102, 134, 101, 66, 4, 171, 170, 188, 107, 23, 180, 35, 175, 18, 89, 181, 17, 97, 62, 56, 52, 128, 40, 25, 191, 74, 95, 143, 5, 8, 1, 132, 133, 135, 184, 33, 37, 45, 127, 122, 136, 190, 158, 72, 77, 114, 46, 55, 105, 78, 183, 103, 22, 20, 24, 155, 86, 63, 79, 164, 13, 174, 2, 14, 47, 126, 84, 165, 59, 142, 87, 153, 112, 43, 156, 50, 6, 0, 81, 51, 21, 9, 148, 111, 147, 48, 31, 36, 129, 167, 150, 70, 42, 15, 110, 119, 109, 125, 80, 27, 131, 49, 140, 187, 96, 120, 100, 141, 160, 186, 185, 68, 69, 28, 176, 169, 44, 173, 149, 54, 115, 113, 67, 10, 157, 41, 30, 172 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, the check matrix initial value table is a table representing the 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 present invention relates to a transmission method / apparatus.
[0015] A fourth receiving apparatus / 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, a group-wise interleaving unit that performs group-wise interleaving to interleave the LDPC code in units of 360-bit bit groups, and a mapping unit that maps the LDPC code to one of 64 signal points of a 2D-Non-Uniform Constellation (NUC) of 64QAM in units of 6 bits, and in the group-wise interleaving, a bit group (i+1) from the beginning of the LDPC code is defined as bit group i, and a sequence of bit groups 0 to 191 of the 69120-bit LDPC code is mapped to bit group (i+1) in the group-wise interleaving. 60, 117, 182, 104, 53, 26, 11, 121, 71, 32, 179, 34, 38, 145, 166, 65, 137, 7, 124, 58, 90, 29, 144, 116, 91, 88, 98, 161, 83, 177, 85, 154, 146, 178, 123, 76, 75, 3, 64, 151, 99, 118, 57, 106, 16, 61, 162, 19, 12, 94, 39, 93, 92, 73, 82, 138, 108, 139, 130, 163, 152, 159, 168, 189, 102, 134, 101, 66, 4, 171, 170, 188, 107, 23, 180, 35, 175, 18, 89, 181, 17, 97, 62, 56, 52, 128, 40, 25, 191, 74, 95, 143, 5, 8, 1, 132, 133, 135, 184, 33, 37, 45, 127, 122, 136, 190, 158, 72, 77, 114, 46, 55, 105, 78, 183, 103, 22, 20, 24, 155, 86, 63, 79, 164, 13, 174, 2, 14, 47, 126, 84, 165, 59, 142, 87, 153, 112, 43, 156, 50, 6, 0, 81, 51, 21, 9, 148, 111, 147, 48, 31, 36, 129, 167, 150, 70, 42, 15, 110, 119, 109, 125, 80, 27, 131, 49, 140, 187, 96, 120, 100, 141, 160, 186, 185, 68, 69, 28, 176, 169, 44, 173, 149, 54, 115, 113, 67, 10, 157, 41, 30, 172 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, the check matrix initial value table is a table representing the 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 group-wise deinterleaving unit / step for restoring the arrangement of the LDPC codes after group-wise interleaving, obtained from data transmitted from a transmitting device, to the original arrangement.
[0016] A fifth transmission method / apparatus of the present technology includes an encoding step / 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 11 / 16, a group-wise interleaving step / unit that performs group-wise interleaving of the LDPC code in units of 360-bit bit groups, and a mapping step / unit that maps the LDPC code to any of 64 signal points of a 2D-NUC (Non-Uniform Constellation) of 64QAM in units of 6 bits, and in the group-wise interleaving, a bit group i+1-th bit group from the beginning of the LDPC code is defined as bit group i, and a sequence of bit groups 0 to 191 of the 69120-bit LDPC code is mapped to bit group i+2-th bit group i+3-th bit group i+4-th bit group i+5-th bit group i+6-th bit group i+7-th bit group i+8-th bit group i+9-th bit group i+1-th bit group i+1-th bit group i+2-th bit group i+3-th bit group i+4-th bit group i+5-th bit group i+6-th bit group i+8-th bit group i+9-th bit group i+1-th bit group i+1-th bit group i+2-th bit group i+1-th bit group i+2-th bit group i+3-th bit group i+4-th bit group i+5-th bit group i+6-th bit group i+1 ... 7, 156, 171, 76, 165, 68, 5, 72, 86, 57, 42, 98, 162, 130, 88, 31, 63, 170, 92, 100, 145, 146, 117, 62, 123, 55, 22, 138, 75, 99, 177, 83, 135, 190, 79, 84, 182, 140, 136, 0, 108, 77, 8, 154, 73, 37, 147, 14, 10, 128, 111, 168, 38, 159, 125, 32, 120, 132, 148, 27, 69, 96, 127, 103, 34, 110, 161, 41, 18, 35, 142, 116, 28, 121, 91, 112, 51, 178, 139, 95, 155, 20, 78, 33, 133, 29, 9, 54, 24, 176, 122, 3, 102, 56, 181, 175, 174, 81, 166, 30, 26, 43, 113, 137, 150, 89, 179, 70, 11, 2, 118, 183, 13, 50, 46, 12, 49, 40, 172, 17, 47, 65, 16, 74, 141, 129, 101, 48, 87, 187, 167, 134, 158, 15, 44, 53, 93, 152, 23, 126, 52, 97, 189, 36, 115, 169, 64, 25, 58, 82, 1, 45, 39, 191, 144, 173, 6, 60, 85, 149, 163, 21, 90, 4, 80, 105, 164, 180, 61, 114, 188, 151, 185, 94, 124, 104, 106, 119, 107, 160, 67, 71, 19, 131, 186, 153, 157, 66, 143, 184, 109, 59 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, the check matrix initial value table is a table representing the position of one element of the information matrix portion for every 360 columns, 983 2226 4091 5418 5824 6483 6914 8239 8364 10220 10322 15658 16928 17307 18061 1584 5655 6787 7213 7270 8585 8995 9294 9832 9982 11185 12221 12889 17573 19096 319 1077 1796 2421 6574 11763 13465 14527 15147 15218 16000 18284 20199 21095 21194 767 1018 3780 3826 4288 4855 7169 7431 9151 10097 10919 12050 13261 19816 20932 173 692 3552 5046 6523 6784 9542 10482 14658 14663 15168 16153 16410 17546 20989 2214 2286 2445 2856 3562 3615 3970 6065 7117 7989 8180 15971 20253 21312 21428 532 1361 1905 3577 5147 10409 11348 11660 15230 17283 18724 20190 20542 21159 21282 3242 5061 7587 7677 8614 8834 9130 9135 9331 13480 13544 14263 15438 20548 21174 1507 4159 4946 5215 5653 6385 7131 8049 10198 10499 12215 14105 16118 17016 21371 212 1856 1981 2056 6766 8123 10128 10957 11159 11237 12893 14064 17760 18933 19009 329 5552 5948 6484 10108 10127 10816 13210 14985 15110 15565 15969 17136 18504 20818 4753 5744 6511 7062 7355 8379 8817 13503 13650 14014 15393 15640 18127 18595 20426 1152 1707 4013 5932 8540 9077 11521 11923 11954 12529 13519 15641 16262 17874 19386 858 2355 2511 3125 5531 6472 8146 11423 11558 11760 13556 15194 20782 20988 21261 216 1722 2750 3809 6210 8233 9183 10734 11339 12321 12898 15902 17437 19085 21588 1560 1718 1757 2292 2349 3992 6943 7369 7806 10282 11373 13624 14608 17087 18011 1375 1640 2015 2539 2691 2967 4344 7125 9176 9435 12378 12520 12901 15704 18897 1703 2861 2986 3574 7208 8486 9412 9879 13027 13945 14873 15546 16516 18931 21070 309 1587 3118 5472 10035 13988 15019 15322 16373 17580 17728 18125 18872 19876 20457 984 991 1203 3159 4303 5734 8850 9626 12217 17227 17269 18695 18854 19580 19684 2429 6165 6828 7761 9761 9899 9942 10151 11198 11271 13184 14026 14560 18962 20570 876 1074 5177 5185 6415 6451 10856 11603 14590 14658 16293 17221 19273 19319 20447 557 607 2473 5002 6601 9876 10284 10809 13563 14849 15710 16798 17509 18927 21306 939 1271 3085 5054 5723 5959 7530 10912 13375 16696 18753 19673 20328 21068 21258 2802 3312 5015 6041 6943 7606 9375 12116 12868 12964 13374 13594 14978 16125 18621 3002 6512 6965 6967 8504 10777 11217 11931 12647 12686 12740 12900 12958 13870 17860 151 3874 4228 7837 10244 10589 14530 15323 16462 17711 18995 19363 19376 19540 20641 1249 2946 2959 3330 4264 7797 10652 11845 12987 15974 16536 17520 19851 20150 20172 4769 11033 14937 1431 2870 15158 9416 14905 20800 1708 9944 16952 1116 1179 20743 3665 8987 16223 655 11424 17411 42 2717 11613 2787 9015 15081 3718 7305 11822 18306 18499 18843 1208 4586 10578 9494 12676 13710 10580 15127 20614 4439 15646 19861 5255 12337 14649 2532 7552 10813 1591 7781 13020 7264 8634 17208 7462 10069 17710 1320 3382 6439 4057 9762 11401 1618 7604 19881 3858 16826 17768 6158 11759 19274 3767 11872 15137 2111 5563 16776 1888 15452 17925 2840 15375 16376 3695 11232 16970 10181 16329 17920 9743 13974 17724 29 16450 20509 2393 17877 19591 1827 15175 15366 3771 14716 18363 5585 14762 19813 7186 8104 12067 2554 12025 15873 2208 5739 6150 2816 12745 17143 9363 11582 17976 5834 8178 12517 3546 15667 19511 5211 10685 20833 3399 7774 16435 3767 4542 8775 4404 6349 19426 4812 11088 16761 5761 11289 17985 9989 11488 15986 10200 16710 20899 6970 12774 20558 1304 2495 3507 5236 7678 10437 4493 10472 19880 1883 14768 21100 352 18797 20570 1411 3221 4379 3304 11013 18382 14864 16951 18782 2887 15658 17633 7109 7383 19956 4293 12990 13934 9890 15206 15786 2987 5455 8787 5782 7137 15981 736 1961 10441 2728 11808 21305 4663 4693 13680 1965 3668 9025 818 10532 16332 7006 16717 21102 2955 15500 20140 8274 13451 19436 3604 13158 21154 5519 6531 9995 1629 17919 18532 15199 16690 16884 5177 5869 14843 5 5088 19940 16910 20686 21206 10662 11610 17578 3378 4579 12849 5947 19300 19762 2545 10686 12579 4568 10814 19032 677 18652 18992 190 11377 12987 4183 6801 20025 6944 8321 15868 3311 6049 14757 7155 11435 16353 4778 5674 15973 1889 3361 7563 467 5999 10103 7613 11096 19536 2244 4442 6000 9055 13516 15414 4831 6111 10744 3792 8258 15106 6990 9168 17589 7920 11548 20786 10533 14361 19577 The present invention relates to a transmission method / apparatus.
[0017] A fifth receiving apparatus / method of the present technology includes a coding unit that performs 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 11 / 16, a group-wise interleaving unit that performs group-wise interleaving to interleave the LDPC code in units of 360-bit bit groups, and a mapping unit that maps the LDPC code to one of 64 signal points of a 2D-Non-Uniform Constellation (NUC) of 64QAM in units of 6 bits, and in the group-wise interleaving, a bit group (i+1) from the beginning of the LDPC code is defined as bit group i, and a sequence of bit groups 0 to 191 of the 69120-bit LDPC code is mapped to bit group (i+1) in the group-wise interleaving. 7, 156, 171, 76, 165, 68, 5, 72, 86, 57, 42, 98, 162, 130, 88, 31, 63, 170, 92, 100, 145, 146, 117, 62, 123, 55, 22, 138, 75, 99, 177, 83, 135, 190, 79, 84, 182, 140, 136, 0, 108, 77, 8, 154, 73, 37, 147, 14, 10, 128, 111, 168, 38, 159, 125, 32, 120, 132, 148, 27, 69, 96, 127, 103, 34, 110, 161, 41, 18, 35, 142, 116, 28, 121, 91, 112, 51, 178, 139, 95, 155, 20, 78, 33, 133, 29, 9, 54, 24, 176, 122, 3, 102, 56, 181, 175, 174, 81, 166, 30, 26, 43, 113, 137, 150, 89, 179, 70, 11, 2, 118, 183, 13, 50, 46, 12, 49, 40, 172, 17, 47, 65, 16, 74, 141, 129, 101, 48, 87, 187, 167, 134, 158, 15, 44, 53, 93, 152, 23, 126, 52, 97, 189, 36, 115, 169, 64, 25, 58, 82, 1, 45, 39, 191, 144, 173, 6, 60, 85, 149, 163, 21, 90, 4, 80, 105, 164, 180, 61, 114, 188, 151, 185, 94, 124, 104, 106, 119, 107, 160, 67, 71, 19, 131, 186, 153, 157, 66, 143, 184, 109, 59 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, the check matrix initial value table is a table representing the position of one element of the information matrix portion for every 360 columns, 983 2226 4091 5418 5824 6483 6914 8239 8364 10220 10322 15658 16928 17307 18061 1584 5655 6787 7213 7270 8585 8995 9294 9832 9982 11185 12221 12889 17573 19096 319 1077 1796 2421 6574 11763 13465 14527 15147 15218 16000 18284 20199 21095 21194 767 1018 3780 3826 4288 4855 7169 7431 9151 10097 10919 12050 13261 19816 20932 173 692 3552 5046 6523 6784 9542 10482 14658 14663 15168 16153 16410 17546 20989 2214 2286 2445 2856 3562 3615 3970 6065 7117 7989 8180 15971 20253 21312 21428 532 1361 1905 3577 5147 10409 11348 11660 15230 17283 18724 20190 20542 21159 21282 3242 5061 7587 7677 8614 8834 9130 9135 9331 13480 13544 14263 15438 20548 21174 1507 4159 4946 5215 5653 6385 7131 8049 10198 10499 12215 14105 16118 17016 21371 212 1856 1981 2056 6766 8123 10128 10957 11159 11237 12893 14064 17760 18933 19009 329 5552 5948 6484 10108 10127 10816 13210 14985 15110 15565 15969 17136 18504 20818 4753 5744 6511 7062 7355 8379 8817 13503 13650 14014 15393 15640 18127 18595 20426 1152 1707 4013 5932 8540 9077 11521 11923 11954 12529 13519 15641 16262 17874 19386 858 2355 2511 3125 5531 6472 8146 11423 11558 11760 13556 15194 20782 20988 21261 216 1722 2750 3809 6210 8233 9183 10734 11339 12321 12898 15902 17437 19085 21588 1560 1718 1757 2292 2349 3992 6943 7369 7806 10282 11373 13624 14608 17087 18011 1375 1640 2015 2539 2691 2967 4344 7125 9176 9435 12378 12520 12901 15704 18897 1703 2861 2986 3574 7208 8486 9412 9879 13027 13945 14873 15546 16516 18931 21070 309 1587 3118 5472 10035 13988 15019 15322 16373 17580 17728 18125 18872 19876 20457 984 991 1203 3159 4303 5734 8850 9626 12217 17227 17269 18695 18854 19580 19684 2429 6165 6828 7761 9761 9899 9942 10151 11198 11271 13184 14026 14560 18962 20570 876 1074 5177 5185 6415 6451 10856 11603 14590 14658 16293 17221 19273 19319 20447 557 607 2473 5002 6601 9876 10284 10809 13563 14849 15710 16798 17509 18927 21306 939 1271 3085 5054 5723 5959 7530 10912 13375 16696 18753 19673 20328 21068 21258 2802 3312 5015 6041 6943 7606 9375 12116 12868 12964 13374 13594 14978 16125 18621 3002 6512 6965 6967 8504 10777 11217 11931 12647 12686 12740 12900 12958 13870 17860 151 3874 4228 7837 10244 10589 14530 15323 16462 17711 18995 19363 19376 19540 20641 1249 2946 2959 3330 4264 7797 10652 11845 12987 15974 16536 17520 19851 20150 20172 4769 11033 14937 1431 2870 15158 9416 14905 20800 1708 9944 16952 1116 1179 20743 3665 8987 16223 655 11424 17411 42 2717 11613 2787 9015 15081 3718 7305 11822 18306 18499 18843 1208 4586 10578 9494 12676 13710 10580 15127 20614 4439 15646 19861 5255 12337 14649 2532 7552 10813 1591 7781 13020 7264 8634 17208 7462 10069 17710 1320 3382 6439 4057 9762 11401 1618 7604 19881 3858 16826 17768 6158 11759 19274 3767 11872 15137 2111 5563 16776 1888 15452 17925 2840 15375 16376 3695 11232 16970 10181 16329 17920 9743 13974 17724 29 16450 20509 2393 17877 19591 1827 15175 15366 3771 14716 18363 5585 14762 19813 7186 8104 12067 2554 12025 15873 2208 5739 6150 2816 12745 17143 9363 11582 17976 5834 8178 12517 3546 15667 19511 5211 10685 20833 3399 7774 16435 3767 4542 8775 4404 6349 19426 4812 11088 16761 5761 11289 17985 9989 11488 15986 10200 16710 20899 6970 12774 20558 1304 2495 3507 5236 7678 10437 4493 10472 19880 1883 14768 21100 352 18797 20570 1411 3221 4379 3304 11013 18382 14864 16951 18782 2887 15658 17633 7109 7383 19956 4293 12990 13934 9890 15206 15786 2987 5455 8787 5782 7137 15981 736 1961 10441 2728 11808 21305 4663 4693 13680 1965 3668 9025 818 10532 16332 7006 16717 21102 2955 15500 20140 8274 13451 19436 3604 13158 21154 5519 6531 9995 1629 17919 18532 15199 16690 16884 5177 5869 14843 5 5088 19940 16910 20686 21206 10662 11610 17578 3378 4579 12849 5947 19300 19762 2545 10686 12579 4568 10814 19032 677 18652 18992 190 11377 12987 4183 6801 20025 6944 8321 15868 3311 6049 14757 7155 11435 16353 4778 5674 15973 1889 3361 7563 467 5999 10103 7613 11096 19536 2244 4442 6000 9055 13516 15414 4831 6111 10744 3792 8258 15106 6990 9168 17589 7920 11548 20786 10533 14361 19577 The receiving device / method includes a group-wise deinterleaving unit / step for restoring the arrangement of the LDPC codes after group-wise interleaving, obtained from data transmitted from a transmitting device, to the original arrangement.
[0018] A sixth transmission method / apparatus of the present technology includes an encoding step / unit that performs LDPC encoding based on a parity check matrix of an LDPC code having a code length N of 69120 bits and a coding rate r of 13 / 16, a group-wise interleaving step / unit that performs group-wise interleaving of the LDPC code in units of 360-bit bit groups, and a mapping step / unit that maps the LDPC code to any of 64 signal points of a 2D-Non-Uniform Constellation (NUC) of 64QAM in units of 6 bits, and in the group-wise interleaving, a bit group (i+1) from the beginning of the LDPC code is defined as bit group i, and a sequence of bit groups 0 to 191 of the 69120-bit LDPC code is mapped to bit group (i+2). 134, 124, 102, 133, 161, 34, 18, 17, 119, 172, 43, 25, 130, 84, 46, 167, 23, 100, 31, 121, 30, 15, 99, 127, 62, 20, 143, 103, 139, 171, 13, 42, 1, 26, 76, 159, 27, 82, 48, 146, 22, 156, 188, 69, 86, 177, 129, 160, 33, 67, 176, 148, 168, 158, 169, 0, 155, 118, 154, 110, 96, 191, 4, 36, 39, 56, 112, 14, 145, 182, 3, 88, 126, 91, 105, 174, 128, 157, 125, 74, 116, 61, 52, 187, 117, 98, 73, 95, 92, 181, 111, 65, 63, 152, 163, 147, 66, 178, 87, 179, 64, 93, 144, 83, 140, 8, 78, 2, 131, 115, 123, 47, 94, 186, 28, 68, 21, 135, 37, 151, 11, 104, 77, 81, 35, 71, 162, 97, 41, 58, 190, 101, 153, 85, 166, 7, 173, 44, 29, 10, 49, 54, 150, 32, 50, 51, 45, 183, 107, 113, 137, 80, 79, 175, 142, 141, 138, 40, 122, 75, 120, 53, 59, 60, 184, 5, 38, 6, 164, 189, 24, 16, 72, 19, 109, 106, 114, 108, 185, 165, 149, 9, 57, 170, 12, 90, 180, 89, 132, 136, 55, 70 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, the check matrix initial value table is a table representing the position of one element of the information matrix portion for every 360 columns, 1031 4123 6253 6610 8007 8656 9181 9404 9596 11501 11654 11710 11994 12177 399 553 1442 2820 4402 4823 5011 5493 7070 8340 8500 9054 11201 11387 201 607 1428 2354 5358 5524 6617 6785 7708 10220 11970 12268 12339 12537 36 992 1930 4525 5837 6283 6887 7284 7489 7550 10329 11202 11399 12795 589 1564 1747 2960 3833 4502 7491 7746 8196 9567 9574 10187 10591 12947 804 1177 1414 3765 4745 7594 9126 9230 9251 10299 10336 11563 11844 12209 2774 2830 3918 4148 4963 5356 7125 7645 7868 8137 9119 9189 9206 12363 59 448 947 3622 5139 8115 9364 9548 9609 9750 10212 10937 11044 12668 715 1352 4538 5277 5729 6210 6418 6938 7090 7109 7386 9012 10737 11893 1583 2059 3398 3619 4277 6896 7484 7525 8284 9318 9817 10227 11636 12204 53 549 3010 5441 6090 9175 9336 9358 9839 10117 11307 11467 11507 12902 861 1054 1177 1201 1383 2538 4563 6451 6800 10540 11222 11757 12240 12732 330 1450 1798 2301 2652 3038 3187 3277 4324 4610 9395 10240 10796 11100 316 751 1226 1746 2124 2505 3497 3833 3891 7551 8696 9763 11978 12661 2677 2888 2904 3923 4804 5105 6855 7222 7893 7907 9674 10274 12683 12702 173 3397 3520 5131 5560 6666 6783 6893 7742 7842 9364 9442 12287 421 943 1893 1920 3273 4052 5758 5787 7043 11051 12141 12209 12500 679 792 2543 3243 3385 3576 4190 7501 8233 8302 9212 9522 12286 911 3651 4023 4462 4650 5336 5762 6506 8050 8381 9636 9724 12486 1373 1728 1911 4101 4913 5003 6859 7137 8035 9056 9378 9937 10184 515 2357 2779 2797 3163 3845 3976 6969 7704 9104 10102 11507 12700 270 1744 1804 3432 3782 4643 5946 6279 6549 7064 7393 11659 12002 261 1517 2269 3554 4762 5103 5460 6429 6464 8962 9651 10927 12268 782 1217 1395 2383 5754 6060 6540 7109 7286 7438 7846 9488 10119 2070 2247 2589 2644 3270 3875 4901 6475 8953 10090 10629 12496 12547 863 1190 1609 2971 3564 4148 5123 5262 6301 7797 7804 9517 11408 449 488 865 3549 3939 4410 4500 5700 7120 8778 9223 11660 12021 1107 1408 1883 2752 3818 4714 5979 6485 7314 7821 11290 11472 12325 713 2492 2507 2641 3576 4711 5021 5831 7334 8362 9094 9690 10778 1487 2344 5035 5336 5727 6495 9009 9345 11090 11261 11314 12383 12944 1038 1463 1472 2944 3202 5742 5793 6972 7853 8919 9808 10549 12619 134 957 2018 2140 2629 3884 5821 7319 8676 10305 10670 12031 12588 5294 9842 4396 6648 2863 5308 10467 11711 3412 6909 450 3919 5639 9801 298 4323 397 10223 4424 9051 2038 2376 5889 11321 12500 3590 4081 12684 3485 4016 9826 6 2869 8310 5983 9818 10877 2282 9346 11477 4931 6135 10473 300 2901 9937 3185 5215 7479 472 5845 5915 2476 7687 11934 3279 8782 11527 4350 7138 7144 7454 7818 8253 1391 8717 8844 1940 4736 10556 5471 7344 8089 9157 10640 11919 1343 5402 12724 2581 4118 8142 5165 9328 11386 7222 7262 12955 6711 11224 11737 401 3195 11940 6114 6969 8208 1402 7917 9738 965 7700 10139 3428 5767 12000 3501 7052 8803 1447 10504 10961 1870 1914 7762 613 2063 10520 3561 6480 10466 3389 3887 10110 995 1104 1640 1492 4122 7572 3243 9765 12415 7297 11200 11533 1959 10325 11306 1675 5313 11475 3621 4658 12790 4208 5650 8687 2467 7691 11886 3039 3190 5017 866 1375 2272 4374 6453 8228 2763 4668 4749 640 1346 6924 6588 6983 10075 3389 9260 12508 89 5799 9973 1290 2978 8038 317 742 8017 5378 5618 6586 3369 3827 4536 1000 10436 12288 3762 11384 11897 848 874 8968 1001 4751 12066 1788 6685 12397 5721 8247 9005 649 7547 9837 2263 9415 10862 3954 4111 7767 952 4393 5523 8132 8580 10906 4191 9677 12585 1071 10601 11106 3069 6943 11015 5555 8088 9537 85 2810 3100 1249 8418 8684 2743 12099 12686 2908 3691 9890 10172 10409 11615 8358 10584 12082 4902 6310 8368 4976 10047 11299 7325 8228 11092 4942 6974 8533 5782 9780 9869 15 4728 10395 369 1900 11517 3796 7434 9085 2473 9813 12636 1472 3557 6607 174 3715 4811 6263 6694 8114 4538 6635 9101 3199 8348 10057 6176 7498 7937 1837 3382 5688 8897 11342 11680 455 6465 7428 1900 3666 8968 3481 6308 10199 159 2654 12150 5602 6695 12897 3309 4899 6415 6 99 7615 1722 6386 11112 5090 8873 10718 4164 6731 12121 367 846 7678 222 6050 12711 3154 7149 7557 1556 4667 7990 2536 9712 9932 4104 7040 9983 6365 11604 12457 3393 10323 10743 724 2237 5455 108 1705 6151 The present invention relates to a transmission method / apparatus.
[0019] A sixth receiving apparatus / 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 13 / 16, a group-wise interleaving unit that performs group-wise interleaving to interleave the LDPC code in units of 360-bit bit groups, and a mapping unit that maps the LDPC code to any of 64 signal points of a 2D-Non-Uniform Constellation (NUC) of 64QAM in units of 6 bits, and in the group-wise interleaving, a bit group (i+1) from the beginning of the LDPC code is defined as bit group i, and a sequence of bit groups 0 to 191 of the 69120-bit LDPC code is mapped to bit group (i+2). 134, 124, 102, 133, 161, 34, 18, 17, 119, 172, 43, 25, 130, 84, 46, 167, 23, 100, 31, 121, 30, 15, 99, 127, 62, 20, 143, 103, 139, 171, 13, 42, 1, 26, 76, 159, 27, 82, 48, 146, 22, 156, 188, 69, 86, 177, 129, 160, 33, 67, 176, 148, 168, 158, 169, 0, 155, 118, 154, 110, 96, 191, 4, 36, 39, 56, 112, 14, 145, 182, 3, 88, 126, 91, 105, 174, 128, 157, 125, 74, 116, 61, 52, 187, 117, 98, 73, 95, 92, 181, 111, 65, 63, 152, 163, 147, 66, 178, 87, 179, 64, 93, 144, 83, 140, 8, 78, 2, 131, 115, 123, 47, 94, 186, 28, 68, 21, 135, 37, 151, 11, 104, 77, 81, 35, 71, 162, 97, 41, 58, 190, 101, 153, 85, 166, 7, 173, 44, 29, 10, 49, 54, 150, 32, 50, 51, 45, 183, 107, 113, 137, 80, 79, 175, 142, 141, 138, 40, 122, 75, 120, 53, 59, 60, 184, 5, 38, 6, 164, 189, 24, 16, 72, 19, 109, 106, 114, 108, 185, 165, 149, 9, 57, 170, 12, 90, 180, 89, 132, 136, 55, 70 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, the check matrix initial value table is a table representing the position of one element of the information matrix portion for every 360 columns, 1031 4123 6253 6610 8007 8656 9181 9404 9596 11501 11654 11710 11994 12177 399 553 1442 2820 4402 4823 5011 5493 7070 8340 8500 9054 11201 11387 201 607 1428 2354 5358 5524 6617 6785 7708 10220 11970 12268 12339 12537 36 992 1930 4525 5837 6283 6887 7284 7489 7550 10329 11202 11399 12795 589 1564 1747 2960 3833 4502 7491 7746 8196 9567 9574 10187 10591 12947 804 1177 1414 3765 4745 7594 9126 9230 9251 10299 10336 11563 11844 12209 2774 2830 3918 4148 4963 5356 7125 7645 7868 8137 9119 9189 9206 12363 59 448 947 3622 5139 8115 9364 9548 9609 9750 10212 10937 11044 12668 715 1352 4538 5277 5729 6210 6418 6938 7090 7109 7386 9012 10737 11893 1583 2059 3398 3619 4277 6896 7484 7525 8284 9318 9817 10227 11636 12204 53 549 3010 5441 6090 9175 9336 9358 9839 10117 11307 11467 11507 12902 861 1054 1177 1201 1383 2538 4563 6451 6800 10540 11222 11757 12240 12732 330 1450 1798 2301 2652 3038 3187 3277 4324 4610 9395 10240 10796 11100 316 751 1226 1746 2124 2505 3497 3833 3891 7551 8696 9763 11978 12661 2677 2888 2904 3923 4804 5105 6855 7222 7893 7907 9674 10274 12683 12702 173 3397 3520 5131 5560 6666 6783 6893 7742 7842 9364 9442 12287 421 943 1893 1920 3273 4052 5758 5787 7043 11051 12141 12209 12500 679 792 2543 3243 3385 3576 4190 7501 8233 8302 9212 9522 12286 911 3651 4023 4462 4650 5336 5762 6506 8050 8381 9636 9724 12486 1373 1728 1911 4101 4913 5003 6859 7137 8035 9056 9378 9937 10184 515 2357 2779 2797 3163 3845 3976 6969 7704 9104 10102 11507 12700 270 1744 1804 3432 3782 4643 5946 6279 6549 7064 7393 11659 12002 261 1517 2269 3554 4762 5103 5460 6429 6464 8962 9651 10927 12268 782 1217 1395 2383 5754 6060 6540 7109 7286 7438 7846 9488 10119 2070 2247 2589 2644 3270 3875 4901 6475 8953 10090 10629 12496 12547 863 1190 1609 2971 3564 4148 5123 5262 6301 7797 7804 9517 11408 449 488 865 3549 3939 4410 4500 5700 7120 8778 9223 11660 12021 1107 1408 1883 2752 3818 4714 5979 6485 7314 7821 11290 11472 12325 713 2492 2507 2641 3576 4711 5021 5831 7334 8362 9094 9690 10778 1487 2344 5035 5336 5727 6495 9009 9345 11090 11261 11314 12383 12944 1038 1463 1472 2944 3202 5742 5793 6972 7853 8919 9808 10549 12619 134 957 2018 2140 2629 3884 5821 7319 8676 10305 10670 12031 12588 5294 9842 4396 6648 2863 5308 10467 11711 3412 6909 450 3919 5639 9801 298 4323 397 10223 4424 9051 2038 2376 5889 11321 12500 3590 4081 12684 3485 4016 9826 6 2869 8310 5983 9818 10877 2282 9346 11477 4931 6135 10473 300 2901 9937 3185 5215 7479 472 5845 5915 2476 7687 11934 3279 8782 11527 4350 7138 7144 7454 7818 8253 1391 8717 8844 1940 4736 10556 5471 7344 8089 9157 10640 11919 1343 5402 12724 2581 4118 8142 5165 9328 11386 7222 7262 12955 6711 11224 11737 401 3195 11940 6114 6969 8208 1402 7917 9738 965 7700 10139 3428 5767 12000 3501 7052 8803 1447 10504 10961 1870 1914 7762 613 2063 10520 3561 6480 10466 3389 3887 10110 995 1104 1640 1492 4122 7572 3243 9765 12415 7297 11200 11533 1959 10325 11306 1675 5313 11475 3621 4658 12790 4208 5650 8687 2467 7691 11886 3039 3190 5017 866 1375 2272 4374 6453 8228 2763 4668 4749 640 1346 6924 6588 6983 10075 3389 9260 12508 89 5799 9973 1290 2978 8038 317 742 8017 5378 5618 6586 3369 3827 4536 1000 10436 12288 3762 11384 11897 848 874 8968 1001 4751 12066 1788 6685 12397 5721 8247 9005 649 7547 9837 2263 9415 10862 3954 4111 7767 952 4393 5523 8132 8580 10906 4191 9677 12585 1071 10601 11106 3069 6943 11015 5555 8088 9537 85 2810 3100 1249 8418 8684 2743 12099 12686 2908 3691 9890 10172 10409 11615 8358 10584 12082 4902 6310 8368 4976 10047 11299 7325 8228 11092 4942 6974 8533 5782 9780 9869 15 4728 10395 369 1900 11517 3796 7434 9085 2473 9813 12636 1472 3557 6607 174 3715 4811 6263 6694 8114 4538 6635 9101 3199 8348 10057 6176 7498 7937 1837 3382 5688 8897 11342 11680 455 6465 7428 1900 3666 8968 3481 6308 10199 159 2654 12150 5602 6695 12897 3309 4899 6415 6 99 7615 1722 6386 11112 5090 8873 10718 4164 6731 12121 367 846 7678 222 6050 12711 3154 7149 7557 1556 4667 7990 2536 9712 9932 4104 7040 9983 6365 11604 12457 3393 10323 10743 724 2237 5455 108 1705 6151 The receiving device / method includes a group-wise deinterleaving unit / step for restoring the arrangement of the LDPC codes after group-wise interleaving, obtained from data transmitted from a transmitting device, to the original arrangement.
[0020] In the first transmission method / apparatus of the present technology, LDPC coding is performed based on a check matrix of an LDPC code with a code length N of 69120 bits and a coding rate r of 3 / 16, and group-wise interleaving is performed to interleave the LDPC code in units of 360-bit bit groups. Then, the LDPC code is mapped in units of 6 bits to any of 64 signal points of 64QAM 2D-NUC (Non-Uniform Constellation). In the group-wise interleaving, the (i+1)th bit group from the beginning of the LDPC code is defined as bit group i, and the arrangement of bit groups 0 to 191 of the 69120-bit LDPC code is determined as bit group i. 36, 180, 61, 100, 163, 168, 14, 24, 105, 104, 131, 56, 40, 73, 165, 157, 126, 47, 160, 181, 166, 161, 1, 81, 58, 182, 189, 177, 85, 17, 13, 46, 171, 149, 91, 79, 109, 133, 164, 125, 52, 77, 118, 186, 107, 150, 135, 33, 130, 87, 167, 158, 23, 83, 152, 114, 68, 12, 132, 178, 106, 184, 176, 72, 31, 53, 21, 110, 76, 146, 4, 18, 113, 65, 34, 179, 111, 185, 84, 144, 27, 39, 151, 50, 69, 30, 169, 175, 9, 42, 54, 43, 90, 22, 139, 129, 170, 115, 45, 140, 67, 25, 155, 82, 102, 29, 188, 108, 15, 80, 128, 48, 0, 64, 141, 93, 191, 190, 174, 32, 35, 119, 159, 41, 55, 162, 49, 59, 88, 156, 123, 136, 28, 60, 26, 16, 89, 147, 92, 98, 38, 20, 173, 71, 44, 94, 5, 7, 99, 75, 122, 120, 66, 121, 112, 62, 8, 137, 142, 103, 116, 117, 37, 63, 70, 86, 10, 74, 95, 11, 134, 154, 51, 101, 127, 183, 57, 97, 78, 148, 6, 172, 3, 138, 145, 153, 143, 19, 2, 96, 187, 124 The check matrix initial value table that defines the check matrix is as described above.
[0021] In the first receiving device / method of the present technology, the arrangement of the LDPC codes after group-wise interleaving, obtained from data transmitted from a first transmitting device implementing a first transmitting method, is restored to the original arrangement.
[0022] In a second transmission method / apparatus of the present technology, LDPC coding is performed based on a check matrix of an LDPC code with a code length N of 69120 bits and a coding rate r of 5 / 16, and group-wise interleaving is performed to interleave the LDPC code in units of 360-bit bit groups. Then, the LDPC code is mapped in units of 6 bits to any of 64 signal points of 64QAM 2D-NUC (Non-Uniform Constellation). In the group-wise interleaving, the (i+1)th bit group from the beginning of the LDPC code is defined as bit group i, and the arrangement of bit groups 0 to 191 of the 69120-bit LDPC code is determined as bit group i. 92, 83, 138, 67, 27, 88, 13, 26, 73, 16, 187, 18, 76, 28, 79, 130, 91, 58, 140, 38, 6, 43, 17, 168, 141, 96, 70, 147, 112, 164, 97, 161, 139, 65, 78, 95, 146, 3, 32, 158, 24, 0, 94, 120, 176, 128, 59, 81, 21, 102, 190, 8, 114, 113, 29, 45, 103, 56, 54, 173, 177, 12, 174, 108, 169, 148, 123, 129, 150, 77, 157, 184, 61, 127, 121, 156, 104, 111, 68, 160, 107, 117, 124, 84, 35, 10, 90, 106, 144, 66, 64, 15, 46, 125, 44, 37, 20, 135, 53, 71, 152, 183, 162, 50, 167, 11, 142, 149, 131, 191, 166, 31, 185, 134, 19, 178, 52, 188, 2, 75, 110, 145, 41, 159, 136, 100, 9, 62, 60, 34, 116, 23, 42, 105, 40, 118, 186, 4, 5, 182, 170, 87, 1, 22, 55, 126, 63, 14, 25, 153, 98, 49, 33, 69, 179, 171, 93, 36, 133, 57, 151, 82, 72, 163, 86, 47, 119, 48, 99, 30, 189, 115, 165, 101, 80, 175, 132, 89, 39, 181, 85, 51, 154, 137, 7, 180, 155, 74, 109, 122, 172, 143 The check matrix initial value table that defines the check matrix is as described above.
[0023] In the second receiving device / method of the present technology, the arrangement of the LDPC codes after group-wise interleaving, obtained from data transmitted from a second transmitting device implementing the second transmitting method, is restored to the original arrangement.
[0024] In a third transmission method / apparatus of the present technology, 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 7 / 16, and group-wise interleaving is performed to interleave the LDPC code in units of 360-bit bit groups. Then, the LDPC code is mapped in units of 6 bits to any of 64 signal points of 64QAM 2D-NUC (Non-Uniform Constellation). In the group-wise interleaving, the (i+1)th bit group from the beginning of the LDPC code is defined as bit group i, and the arrangement of bit groups 0 to 191 of the 69120-bit LDPC code is determined as bit group i. 52, 117, 42, 131, 45, 120, 44, 63, 91, 0, 33, 176, 95, 36, 134, 170, 148, 32, 130, 20, 124, 51, 152, 96, 92, 90, 184, 103, 53, 14, 110, 80, 107, 145, 181, 137, 61, 149, 114, 126, 136, 161, 58, 162, 88, 8, 171, 178, 174, 94, 118, 19, 35, 1, 191, 115, 23, 10, 150, 67, 46, 56, 172, 129, 109, 98, 89, 68, 101, 121, 78, 182, 12, 173, 128, 77, 168, 156, 186, 165, 39, 187, 5, 158, 104, 2, 49, 154, 59, 82, 65, 30, 127, 17, 113, 164, 179, 34, 69, 189, 123, 147, 183, 21, 163, 143, 57, 100, 28, 185, 25, 140, 13, 66, 141, 62, 47, 54, 169, 106, 38, 86, 116, 151, 41, 4, 75, 108, 85, 153, 72, 125, 22, 135, 50, 70, 74, 11, 76, 138, 132, 55, 167, 40, 144, 31, 142, 37, 29, 99, 83, 26, 119, 64, 27, 9, 15, 97, 73, 133, 79, 190, 111, 43, 48, 102, 7, 139, 84, 24, 112, 177, 16, 180, 175, 81, 3, 60, 18, 188, 93, 105, 157, 87, 166, 159, 155, 122, 146, 6, 160, 71 The check matrix initial value table that defines the check matrix is as described above.
[0025] In the third receiving device / method of the present technology, the arrangement of the LDPC codes after group-wise interleaving, which is obtained from data transmitted from a third transmitting device implementing the third transmitting method, is restored to the original arrangement.
[0026] In a fourth transmission method / apparatus of the present technology, LDPC coding is performed based on a check matrix of an LDPC code with a code length N of 69120 bits and a coding rate r of 9 / 16, and group-wise interleaving is performed to interleave the LDPC code in units of 360-bit bit groups. Then, the LDPC code is mapped in units of 6 bits to any of 64 signal points of 64QAM 2D-NUC (Non-Uniform Constellation). In the group-wise interleaving, the (i+1)th bit group from the beginning of the LDPC code is defined as bit group i, and the arrangement of bit groups 0 to 191 of the 69120-bit LDPC code is determined as bit group i. 60, 117, 182, 104, 53, 26, 11, 121, 71, 32, 179, 34, 38, 145, 166, 65, 137, 7, 124, 58, 90, 29, 144, 116, 91, 88, 98, 161, 83, 177, 85, 154, 146, 178, 123, 76, 75, 3, 64, 151, 99, 118, 57, 106, 16, 61, 162, 19, 12, 94, 39, 93, 92, 73, 82, 138, 108, 139, 130, 163, 152, 159, 168, 189, 102, 134, 101, 66, 4, 171, 170, 188, 107, 23, 180, 35, 175, 18, 89, 181, 17, 97, 62, 56, 52, 128, 40, 25, 191, 74, 95, 143, 5, 8, 1, 132, 133, 135, 184, 33, 37, 45, 127, 122, 136, 190, 158, 72, 77, 114, 46, 55, 105, 78, 183, 103, 22, 20, 24, 155, 86, 63, 79, 164, 13, 174, 2, 14, 47, 126, 84, 165, 59, 142, 87, 153, 112, 43, 156, 50, 6, 0, 81, 51, 21, 9, 148, 111, 147, 48, 31, 36, 129, 167, 150, 70, 42, 15, 110, 119, 109, 125, 80, 27, 131, 49, 140, 187, 96, 120, 100, 141, 160, 186, 185, 68, 69, 28, 176, 169, 44, 173, 149, 54, 115, 113, 67, 10, 157, 41, 30, 172 The check matrix initial value table that defines the check matrix is as described above.
[0027] In the fourth receiving device / method of the present technology, the arrangement of the LDPC codes after group-wise interleaving, obtained from data transmitted from a fourth transmitting device implementing a fourth transmitting method, is restored to the original arrangement.
[0028] In a fifth transmission method / apparatus of the present technology, 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 11 / 16, and group-wise interleaving is performed to interleave the LDPC code in units of 360-bit bit groups. Then, the LDPC code is mapped in units of 6 bits to any of 64 signal points of 64QAM 2D-NUC (Non-Uniform Constellation). In the group-wise interleaving, the (i+1)th bit group from the beginning of the LDPC code is defined as bit group i, and the arrangement of bit groups 0 to 191 of the 69120-bit LDPC code is determined as bit group i. 7, 156, 171, 76, 165, 68, 5, 72, 86, 57, 42, 98, 162, 130, 88, 31, 63, 170, 92, 100, 145, 146, 117, 62, 123, 55, 22, 138, 75, 99, 177, 83, 135, 190, 79, 84, 182, 140, 136, 0, 108, 77, 8, 154, 73, 37, 147, 14, 10, 128, 111, 168, 38, 159, 125, 32, 120, 132, 148, 27, 69, 96, 127, 103, 34, 110, 161, 41, 18, 35, 142, 116, 28, 121, 91, 112, 51, 178, 139, 95, 155, 20, 78, 33, 133, 29, 9, 54, 24, 176, 122, 3, 102, 56, 181, 175, 174, 81, 166, 30, 26, 43, 113, 137, 150, 89, 179, 70, 11, 2, 118, 183, 13, 50, 46, 12, 49, 40, 172, 17, 47, 65, 16, 74, 141, 129, 101, 48, 87, 187, 167, 134, 158, 15, 44, 53, 93, 152, 23, 126, 52, 97, 189, 36, 115, 169, 64, 25, 58, 82, 1, 45, 39, 191, 144, 173, 6, 60, 85, 149, 163, 21, 90, 4, 80, 105, 164, 180, 61, 114, 188, 151, 185, 94, 124, 104, 106, 119, 107, 160, 67, 71, 19, 131, 186, 153, 157, 66, 143, 184, 109, 59 The check matrix initial value table that defines the check matrix is as described above.
[0029] In the fifth receiving device / method of the present technology, the arrangement of the LDPC codes after group-wise interleaving, obtained from data transmitted from a fifth transmitting device implementing a fifth transmitting method, is restored to the original arrangement.
[0030] In a sixth transmission method / apparatus of the present technology, 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 13 / 16, and group-wise interleaving is performed to interleave the LDPC code in units of 360-bit bit groups. Then, the LDPC code is mapped in units of 6 bits to any of 64 signal points of 2D-NUC (Non-Uniform Constellation) of 64QAM. In the group-wise interleaving, the (i+1)th bit group from the beginning of the LDPC code is defined as bit group i, and the arrangement of bit groups 0 to 191 of the 69120-bit LDPC code is determined as bit group i. 134, 124, 102, 133, 161, 34, 18, 17, 119, 172, 43, 25, 130, 84, 46, 167, 23, 100, 31, 121, 30, 15, 99, 127, 62, 20, 143, 103, 139, 171, 13, 42, 1, 26, 76, 159, 27, 82, 48, 146, 22, 156, 188, 69, 86, 177, 129, 160, 33, 67, 176, 148, 168, 158, 169, 0, 155, 118, 154, 110, 96, 191, 4, 36, 39, 56, 112, 14, 145, 182, 3, 88, 126, 91, 105, 174, 128, 157, 125, 74, 116, 61, 52, 187, 117, 98, 73, 95, 92, 181, 111, 65, 63, 152, 163, 147, 66, 178, 87, 179, 64, 93, 144, 83, 140, 8, 78, 2, 131, 115, 123, 47, 94, 186, 28, 68, 21, 135, 37, 151, 11, 104, 77, 81, 35, 71, 162, 97, 41, 58, 190, 101, 153, 85, 166, 7, 173, 44, 29, 10, 49, 54, 150, 32, 50, 51, 45, 183, 107, 113, 137, 80, 79, 175, 142, 141, 138, 40, 122, 75, 120, 53, 59, 60, 184, 5, 38, 6, 164, 189, 24, 16, 72, 19, 109, 106, 114, 108, 185, 165, 149, 9, 57, 170, 12, 90, 180, 89, 132, 136, 55, 70 The check matrix initial value table that defines the check matrix is as described above.
[0031] In the sixth receiving device / method of the present technology, the arrangement of the LDPC codes after group-wise interleaving, obtained from data transmitted from a sixth transmitting device implementing a sixth transmitting method, is restored to the original arrangement.
[0032] The receiving device and the transmitting device may each be an independent device, or may be an internal block constituting a single device. Effect of the Invention
[0033] According to the present technology, good communication quality can be ensured in data transmission using LDPC codes.
[0034] 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]
[0035] [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 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. [Figure 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. 11 is a diagram illustrating an example of coordinates of a UC signal point when the modulation method is QPSK. [Figure 93] FIG. 11 is a diagram showing an example of the coordinates of signal points of a 2D-NUC when the modulation method is 16QAM. [Figure 94] FIG. 11 is a diagram showing an example of the coordinates of signal points of 1D-NUC when the modulation method is 1024QAM. [Figure 95] FIG. 1 is a diagram showing the relationship between a 1024QAM symbol y and a position vector u. [Figure 96] FIG. 1 is a diagram illustrating an example of coordinates zq of a signal point of QPSK-UC. [Figure 97] FIG. 1 is a diagram illustrating an example of coordinates zq of a signal point of QPSK-UC. [Figure 98] FIG. 11 is a diagram illustrating an example of coordinates zq of a signal point of 16QAM-UC. [Figure 99] FIG. 11 is a diagram illustrating an example of coordinates zq of a signal point of 16QAM-UC. [Figure 100] FIG. 11 is a diagram illustrating an example of coordinates zq of a signal point of 64QAM-UC. [Figure 101] FIG. 11 is a diagram illustrating an example of coordinates zq of a signal point of 64QAM-UC. [Figure 102] FIG. 13 is a diagram illustrating an example of coordinates zq of a signal point of 256QAM-UC. [Figure 103] FIG. 13 is a diagram illustrating an example of coordinates zq of a signal point of 256QAM-UC. [Figure 104] FIG. 11 is a diagram illustrating an example of coordinates zq of a signal point of 1024QAM-UC. [Figure 105] FIG. 11 is a diagram illustrating an example of coordinates zq of a signal point of 1024QAM-UC. [Fig. 106] FIG. 13 is a diagram illustrating an example of coordinates zq of a signal point of 4096QAM-UC. [Figure 107] FIG. 13 is a diagram illustrating an example of coordinates zq of a signal point of 4096QAM-UC. [Figure 108] FIG. 13 is a diagram illustrating an example of coordinates zs of a signal point of 16QAM-2D-NUC. [Fig. 109] FIG. 13 is a diagram illustrating an example of the coordinates zs of a signal point of 64QAM-2D-NUC. [Figure 110] FIG. 13 is a diagram showing an example of the coordinates zs of a signal point of 256QAM-2D-NUC. [Figure 111] FIG. 13 is a diagram showing an example of the coordinates zs of a signal point of 256QAM-2D-NUC. [Figure 112] FIG. 11 is a diagram showing an example of coordinates zs of a signal point of 1024QAM-1D-NUC. [Figure 113] FIG. 1 is a diagram showing the relationship between a 1024QAM symbol y and a position vector u. [Fig. 114] FIG. 11 is a diagram showing an example of the coordinates zs of a signal point of 4096QAM-1D-NUC. [Figure 115] 1 is a diagram showing the relationship between a 4096QAM symbol y and a position vector u. [Fig. 116] 1 is a diagram showing the relationship between a 4096QAM symbol y and a position vector u. [Figure 117] FIG. 2 is a diagram for explaining block interleaving performed by block interleaver 25. [Fig. 118] FIG. 2 is a diagram for explaining block interleaving performed by block interleaver 25. [Figure 119] FIG. 2 is a diagram for explaining group-wise interleaving performed by group-wise interleaver 24. [Figure 120] FIG. 11 is a diagram illustrating a first example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Figure 121] FIG. 11 is a diagram illustrating a second example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Figure 122] FIG. 13 is a diagram illustrating a third example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Figure 123] FIG. 13 is a diagram showing a fourth example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Figure 124] FIG. 13 is a diagram showing a fifth example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Fig. 125] FIG. 13 is a diagram showing a sixth example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Fig. 126] FIG. 13 is a diagram illustrating a seventh example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Figure 127] FIG. 13 is a diagram showing an eighth example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Figure 128] FIG. 13 is a diagram showing a ninth example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Figure 129] FIG. 10 is a diagram showing a tenth example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Fig. 130] FIG. 11 is a diagram showing an eleventh example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Fig. 131] FIG. 12 is a diagram illustrating a twelfth example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Fig. 132] FIG. 13 is a diagram showing a thirteenth example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Fig. 133] FIG. 14 is a diagram showing a fourteenth example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Fig. 134] FIG. 15 is a diagram showing a fifteenth example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Fig. 135] FIG. 16 is a diagram illustrating a 16th example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Fig. 136] FIG. 17 is a diagram showing a 17th example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Fig. 137] FIG. 18 is a diagram showing an 18th example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Figure 138] FIG. 19 is a diagram showing a 19th example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Figure 139] FIG. 20 is a diagram showing a twentieth example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Fig. 140] FIG. 21 is a diagram showing a 21st example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Fig. 141] FIG. 22 is a diagram showing a 22nd example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Fig. 142] FIG. 23 is a diagram showing a 23rd example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Fig. 143] FIG. 24 is a diagram showing a 24th example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Fig. 144] FIG. 25 is a diagram showing a 25th example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Fig. 145] FIG. 26 is a diagram illustrating a 26th example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Fig. 146] FIG. 27 is a diagram illustrating a 27th example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Fig. 147] FIG. 28 is a diagram showing a 28th example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Fig. 148] FIG. 29 is a diagram showing a 29th example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Figure 149] FIG. 30 is a diagram illustrating a 30th example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Fig. 150] FIG. 31 is a diagram showing a 31st example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Fig. 151] FIG. 13 is a diagram showing a 32nd example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Fig. 152] FIG. 11 is a diagram showing a 33rd example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Fig. 153] A figure showing a 34th example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Fig. 154] FIG. 35 is a diagram showing a 35th example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Fig. 155] FIG. 36 is a diagram illustrating a 36th example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Fig. 156] FIG. 37 is a diagram showing a 37th example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Fig. 157]FIG. 13 is a diagram showing a 38th example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Fig. 158] FIG. 13 is a diagram showing a 39th example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Fig. 159] FIG. 40 is a diagram showing a 40th example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Fig. 160] FIG. 41 is a diagram showing a 41st example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Fig. 161] FIG. 42 is a diagram showing a 42nd example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Fig. 162] FIG. 43 is a diagram showing a 43rd example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Fig. 163] FIG. 44 is a diagram showing a 44th example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Fig. 164] FIG. 45 is a diagram showing a 45th example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Fig. 165] FIG. 46 is a diagram showing a 46th example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Fig. 166] FIG. 47 is a diagram showing a 47th example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Fig. 167] FIG. 48 is a diagram showing the 48th example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Fig. 168] FIG. 49 is a diagram showing a 49th example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Fig. 169] FIG. 50 is a diagram showing a 50th example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Fig. 170] FIG. 51 is a diagram showing a 51st example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Fig. 171]FIG. 52 is a diagram showing a 52nd example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Fig. 172] FIG. 53 is a diagram showing a 53rd example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Fig. 173] A figure showing a 54th example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Fig. 174] FIG. 55 is a diagram showing a 55th example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Fig. 175] FIG. 56 is a diagram illustrating a 56th example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Fig. 176] FIG. 57 is a diagram showing a 57th example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Fig. 177] FIG. 58 is a diagram illustrating a 58th example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Fig. 178] FIG. 59 is a diagram showing a 59th example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Fig. 179] FIG. 13 is a diagram showing a 60th example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Fig. 180] FIG. 11 is a diagram showing a 61st example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Fig. 181] FIG. 62 is a diagram illustrating a 62nd example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Fig. 182] FIG. 63 is a diagram showing a 63rd example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Fig. 183] FIG. 11 is a diagram showing a 64th example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Fig. 184] FIG. 11 is a diagram showing the 65th example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Fig. 185]FIG. 66 is a diagram showing a 66th example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Fig. 186] FIG. 13 is a diagram showing the 67th example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Fig. 187] FIG. 68 is a diagram showing the 68th example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Fig. 188] FIG. 13 is a diagram showing a 69th example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Fig. 189] FIG. 13 is a diagram showing a 70th example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Fig. 190] FIG. 11 is a diagram showing a 71st example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Fig. 191] FIG. 72 is a diagram showing a 72nd example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Fig. 192] FIG. 11 is a diagram showing a 73rd example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Fig. 193] FIG. 11 is a diagram showing a 74th example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Fig. 194] FIG. 11 is a diagram showing the 75th example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Fig. 195] FIG. 11 is a diagram showing a 76th example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Fig. 196] FIG. 13 is a diagram showing the 77th example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Figure 197] FIG. 11 is a diagram showing the 78th example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Figure 198] 2 is a block diagram showing an example of the configuration of a receiving device 12. FIG. [Figure 199] 13 is a block diagram showing an example of the configuration of a bit deinterleaver 165. FIG. [Figure 200] It is a flowchart for explaining an example of processing performed by the demapper 164, the bit deinterleaver 165, and the LDPC decoder 166. [Figure 201] It is a diagram showing an example of a check matrix of an LDPC code. [Fig. 202] It is a diagram showing an example of a matrix (transformed check matrix) obtained by performing row permutation and column permutation on the check matrix. [Fig. 203] It is a diagram showing an example of a transformed check matrix divided into 5×5 units. [Fig. 204] It is a block diagram showing a configuration example of a decoding apparatus that performs P node operations collectively. [Fig. 205] It is a block diagram showing a configuration example of the LDPC decoder 166. [Fig. 206] It is a diagram for explaining block deinterleaving performed by the block deinterleaver 54. [Fig. 207] It is a block diagram showing another configuration example of the bit deinterleaver 165. [Fig. 208] It is a block diagram showing a first configuration example of a reception system to which the reception apparatus 12 is applicable. [Fig. 209] It is a block diagram showing a second configuration example of a reception system to which the reception apparatus 12 is applicable. [Fig. 210] It is a block diagram showing a third configuration example of a reception system to which the reception apparatus 12 is applicable. [Fig. 211] It is a block diagram showing a configuration example of one embodiment of a computer to which the present technology is applied.
Embodiments for Carrying Out the Invention
[0036] Hereinafter, embodiments of the present technology will be described. Prior to that, the LDPC code will be described.
[0037] <LDPC Code>
[0038] Note that the LDPC code is a linear code and does not necessarily have to be binary, but here it will be described as being binary.
[0039] The most distinctive feature of LDPC codes is that the parity check matrix that defines the LDPC code is sparse. A sparse matrix is one in which the number of elements that are "1" is very small (most of the elements are 0).
[0040] FIG. 1 is a diagram showing an example of a check matrix H of an LDPC code.
[0041] In the parity check matrix H in FIG. 1, the weight of each column (column weight) (the number of "1") is "3", and the weight of each row (row weight) is "6".
[0042] In coding using LDPC codes (LDPC coding), for example, a generator matrix G is generated based on a check matrix H, and binary information bits are multiplied by this generator matrix G to generate a codeword (LDPC code).
[0043] Specifically, the coding device that performs LDPC coding first generates a transposed matrix H T Between the formula GH T Here, 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.
[0044] 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 simply referred to as nodes as appropriate.
[0045] FIG. 2 is a flowchart showing the procedure for decoding an LDPC code.
[0046] 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.
[0047] 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 u 0i 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.
[0048]
number
[0049]
number
[0050] 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.
[0051] 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 -1. Also, the check node operation in equation (2) is actually a two-input v 1 ,v 2 The function R(v 1 ,v 2 ) table is created in advance and used successively (recursively) as shown in equation (4).
[0052]
number
[0053]
number
[0054] 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.
[0055] Also, in step S13, if it is determined that the variable k is greater than C, the process proceeds to step S14, where the message v i is calculated and output, and the LDPC code decoding process is completed.
[0056]
number
[0057] 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
[0058] 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).
[0059] In the parity check matrix H in FIG. 3, the column weight is 3 and the row weight is 6, similarly to FIG.
[0060] FIG. 4 is a diagram showing a Tanner graph of the parity check matrix H in FIG.
[0061] 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.
[0062] 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.
[0063] In a Sum Product Algorithm, which is a decoding method for LDPC codes, variable node calculations and check node calculations are performed repeatedly.
[0064] FIG. 5 is a diagram showing variable node operations performed at the variable node.
[0065] At the variable node, the message v corresponding to the branch to be calculated is i is the message u from the remaining branches connected to the variable node. 1 and u 2 and the received value u 0i The messages corresponding to the other edges can be calculated in a similar manner.
[0066] FIG. 6 is a diagram illustrating check node operations performed at a check node.
[0067] 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.
[0068]
number
[0069] 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).
[0070]
number
[0071] At the check node, the check node operation of equation (2) is performed according to equation (7).
[0072] That is, at the check node, as shown in Figure 6, the message u corresponding to the branch to be calculated is j is the message v from the remaining edges connected to the check node. 1 ,v 2 ,v 3 ,v 4 ,v 5 The messages corresponding to the other branches are calculated in the same way.
[0073] 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.
[0074] <Example of a transmission system configuration using this technology>
[0075] 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).
[0076] In FIG. 7, the transmission system includes a transmitting device 11 and a receiving device 12 .
[0077] 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).
[0078] 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.
[0079] 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.
[0080] 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).
[0081] 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).
[0082] 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.
[0083] 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.
[0084] 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.
[0085] 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.
[0086] 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).
[0087] <Configuration example of the transmitting device 11>
[0088] FIG. 8 is a block diagram showing an example of the configuration of the transmission device 11 of FIG.
[0089] In the transmitting device 11, one or more input streams as target data are supplied to a mode adaptation / multiplexer 111.
[0090] 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 .
[0091] 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.
[0092] 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 .
[0093] 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.
[0094] 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.
[0095] 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.
[0096] 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.
[0097] The LDPC code output by the LDPC encoder 115 is supplied to a bit interleaver 116 .
[0098] 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 .
[0099] 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.
[0100] 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 a constellation that is an IQ plane 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.
[0101] The number of signal points of the constellation used in 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.
[0102] 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.
[0103] 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 .
[0104] 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.
[0105] 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 .
[0106] 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 .
[0107] 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.
[0108] 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 .
[0109] 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 .
[0110] 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.
[0111] 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 .
[0112] 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.
[0113] 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).
[0114] 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.
[0115] <Example of the configuration of the bit interleaver 116>
[0116] FIG. 9 is a block diagram showing an example of the configuration of the bit interleaver 116 in FIG.
[0117] 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 .
[0118] 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.
[0119] 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 .
[0120] 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.
[0121] 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.
[0122] The block interleaver 25 performs block interleaving to demultiplex the LDPC code from the group-wise interleaver 24, thereby symbolizing, for example, one code's worth of LDPC code into m-bit symbols, which are the unit of mapping, and supplies them to the mapper 117 (FIG. 8).
[0123] 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 by an equal number to the number of bits m of the symbol with respect to a storage area in which columns are arranged. 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.
[0124] <Check matrix of LDPC code>
[0125] FIG. 10 is a diagram showing an example of a check matrix H used for LDPC encoding in the LDPC encoder 115 of FIG. 8.
[0126] The check matrix H has an LDGM (Low-Density Generation Matrix) structure, and an information matrix H of a portion corresponding to information bits among the code bits of the LDPC code A and a parity matrix H corresponding to parity bits T can be expressed by the formula H = [H A | H T (a matrix with the elements of the information matrix H A as the left-side elements and the elements of the parity matrix H T as the right-side elements).
[0127] Here, the number of bits of information bits and the number of bits of 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).
[0128] For an LDPC code with a certain code length N, the information length K and the parity length M are determined by the coding rate. Also, the check matrix H is a matrix with M rows and N columns (an M × N matrix). And the information matrix H A is an M × K matrix, and the parity matrix H T is an M × M matrix.
[0129] 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.
[0130] 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.
[0131] 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.
[0132] 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.
[0133] 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.
[0134] 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.
[0135] 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.
[0136] FIG. 12 is a diagram for explaining a check matrix H of an LDPC code defined in standards such as DVB-T.2.
[0137] 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.
[0138] Here, KX+K3+M-1+1 is equal to the code length N.
[0139] 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.
[0140] Standards such as DVB-T.2 prescribe LDPC codes with code lengths N of 64,800 bits and 16,200 bits.
[0141] 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.
[0142] 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.
[0143] 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.
[0144] 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.
[0145] <Parity interleave>
[0146] 14 to 16, the parity interleaving by the parity interleaver 23 of FIG. 9 will be described.
[0147] FIG. 14 is a diagram showing an example (part of) a Tanner graph of a parity check matrix of an LDPC code.
[0148] 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.
[0149] 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.
[0150] 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
[0151] 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
[0152] The parity matrix H has a step structure. T In the parity matrix H, elements with a value of 1 are adjacent to each other (except 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.
[0153] 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.
[0154] 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.
[0155] 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.
[0156] 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.
[0157] 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.
[0158] 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.
[0159] 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).
[0160] 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.
[0161] 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.
[0162] 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.
[0163] 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.
[0164] 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.
[0165] Here, the pseudo-cyclic structure means a structure in which all but a few parts are cyclic structures.
[0166] 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.
[0167] 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.
[0168] 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.
[0169] FIG. 17 is a flowchart illustrating the processing performed by the LDPC encoder 115, the bit interleaver 116, and the mapper 117 in FIG.
[0170] 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.
[0171] 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.
[0172] 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.
[0173] 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 .
[0174] 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 .
[0175] 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.
[0176] 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.
[0177] 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.
[0178] 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).
[0179] 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.
[0180] In addition to the parity interleaver 23 and the group-wise interleaver 24, the block interleaver 25 can also be configured integrally.
[0181] 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.
[0182] Therefore, if a matrix obtained by multiplying a matrix representing parity interleaving, a matrix representing groupwise interleaving, and a matrix representing block interleaving is obtained, these matrices can perform parity interleaving, groupwise interleaving, and block interleaving all at once.
[0183] Note that one or both of parity interleaving and groupwise interleaving may not be performed.
[0184] <Configuration example of LDPC encoder 115>
[0185] FIG. 18 is a block diagram showing a configuration example of the LDPC encoder 115 of FIG. 8.
[0186] Note that the LDPC encoder 122 of FIG. 8 is also configured in the same manner.
[0187] 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.
[0188] 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).
[0189] The LDPC encoder 115 can perform encoding (error correction encoding) using LDPC codes with each coding rate having a code length N of 64,800 bits or 16,200 bits, for example, according to a check matrix H prepared for each code length N and each coding rate.
[0190] 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.
[0191] The LDPC encoder 115 includes an encoding processing unit 601 and a storage unit 602 .
[0192] 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).
[0193] 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.
[0194] 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 .
[0195] 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.
[0196] 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.
[0197] 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).
[0198] The control unit 616 controls each block constituting the encoding processing unit 601 .
[0199] 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.
[0200] FIG. 19 is a flowchart illustrating an example of the processing of the LDPC encoder 115 in FIG.
[0201] 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.
[0202] 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.
[0203] 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.
[0204] 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.
[0205] 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).
[0206] Hc T =0 (8)
[0207] In equation (8), c represents a row vector as a codeword (LDPC code), and T represents the transpose of the row vector c.
[0208] 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.
[0209] 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.
[0210] 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.
[0211] 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.
[0212] 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.
[0213] 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.
[0214] <Example of check matrix initial value table>
[0215] 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.
[0216] 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).
[0217] 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).
[0218] 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 is 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.
[0219] 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.
[0220] 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.
[0221] In addition, type B coding is adopted in DVB-T.2 and the like.
[0222] FIG. 20 is a diagram showing an example of a parity check matrix initial value table of the Type B method.
[0223] 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.
[0224] 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.
[0225] 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.
[0226] 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.
[0227] 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.
[0228] 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.
[0229] 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.
[0230] 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.
[0231] K = (k + 1) × 360 (9)
[0232] Here, 360 in equation (9) is the unit size P described in FIG.
[0233] 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).
[0234] 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.
[0235] 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).
[0236] 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.
[0237] 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.
[0238] 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.
[0239] 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)).
[0240] 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).
[0241] H w-j =mod{h i,j +mod((w-1),P)×q,M) (10)
[0242] Here, mod(x,y) means the remainder when x is divided by y.
[0243] 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).
[0244] 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.
[0245] 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.
[0246] FIG. 22 is a diagram showing the structure of parity check matrix H of the Type A method.
[0247] 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.
[0248] 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.
[0249] The B matrix is a step structure matrix adjacent to the right of the A matrix, with M1 rows and M1 columns.
[0250] The C matrix is a matrix adjacent below the A matrix and the B matrix, with N-K-M1 rows and K+M1 columns.
[0251] 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.
[0252] The Z matrix is a zero matrix (0 matrix) adjacent to the right of the B matrix, with M1 rows and NK-M1 columns.
[0253] 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.
[0254] 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).
[0255] 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.
[0256] 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.
[0257] 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.
[0258] FIG. 23 is a diagram showing an example of a parity check matrix initial value table of the Type A method.
[0259] 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.
[0260] 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.
[0261] For ease of explanation, it is assumed here that the unit size P is, for example, 5.
[0262] The check matrix H of the Type A system has parameters M1, M2, Q1, and Q2.
[0263] 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.
[0264] M2 (FIG. 22) is the value M-M1 obtained by subtracting M1 from the parity length M.
[0265] 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.
[0266] Q1 is calculated according to the equation Q1=M1 / P, and represents the number of cyclic shifts (number of rows) in the A matrix.
[0267] 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.
[0268] Q2 is calculated according to the equation Q2=M2 / P, and represents the number of cyclic shifts (number of rows) in the C matrix.
[0269] 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.
[0270] Here, Q1 is M1 / P=15 / 5=3, and Q2 is M2 / P=10 / 5=2.
[0271] 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.
[0272] 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).
[0273] 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.
[0274] 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.
[0275] 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.
[0276] 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.
[0277] 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.
[0278] Here, in the 11th (=1+5×(3−1)) column of parity check matrix H, row #22 is a row of the C matrix.
[0279] 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.
[0280] 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.
[0281] 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.
[0282] 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).
[0283] 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).
[0284] FIG. 24 is a diagram showing matrix A generated from the check matrix initial value table of FIG.
[0285] 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.
[0286] 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.
[0287] 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.
[0288] 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.
[0289] FIG. 25 is a diagram showing parity interleaving of a B matrix.
[0290] 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.
[0291] FIG. 25 shows the A and B matrices after parity interleaving of the B matrix of FIG.
[0292] FIG. 26 is a diagram showing a C matrix generated from the parity check matrix initial value table of FIG.
[0293] 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.
[0294] 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.
[0295] 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.
[0296] 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.
[0297] 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).
[0298] 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.
[0299] FIG. 27 is a diagram showing parity interleaving of a D matrix.
[0300] 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.
[0301] FIG. 27 shows the parity check matrix H after performing parity interleaving of the D matrix on the parity check matrix H in FIG.
[0302] 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.
[0303] Here, the LDPC code generated using the parity check matrix H in Fig. 27 is an LDPC code that has been parity interleaved, and therefore, for the LDPC code generated using the parity check matrix H in Fig. 27, there is no need to perform parity interleaving in the parity interleaver 23 (Fig. 9). In other words, since the LDPC code generated using the parity check matrix H after parity interleaving of the D matrix is an LDPC code that has been parity interleaved, the parity interleaving in the parity interleaver 23 is skipped for such an LDPC code.
[0304] 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.
[0305] The LDPC encoder 115 can perform LDPC encoding (generation of an LDPC code) using the parity check matrix H in FIG.
[0306] 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).
[0307] 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.
[0308] 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.
[0309] 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.
[0310] <New LDPC code>
[0311] In data transmission using LDPC codes, one method for ensuring good communication quality is to use LDPC codes with good performance.
[0312] A new LDPC code with good performance (hereinafter, also referred to as a new LDPC code) will be described below.
[0313] 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.
[0314] 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.
[0315] 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).
[0316] 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.
[0317] 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.
[0318] FIG. 32 is a sequel to FIG.
[0319] 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.
[0320] 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.
[0321] FIG. 35 is a sequel to FIG.
[0322] 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.
[0323] FIG. 37 is a sequel to FIG.
[0324] 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.
[0325] It should be noted that FIG. 39 is a sequel to FIG.
[0326] 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.
[0327] FIG. 41 is a sequel to FIG.
[0328] 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.
[0329] It should be noted that FIG. 43 is a sequel to FIG.
[0330] 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.
[0331] 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.
[0332] 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.
[0333] FIG. 47 is a sequel to FIG.
[0334] 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.
[0335] 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.
[0336] 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.
[0337] Note that FIG. 51 is a continuation of FIG. 50, and FIG. 52 is a continuation of FIG. 51.
[0338] 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.
[0339] 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.
[0340] 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.
[0341] Note that FIG. 57 is a continuation of FIG. 56, and FIG. 58 is a continuation of FIG. 57.
[0342] 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.
[0343] 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.
[0344] 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.
[0345] Note that FIG. 63 is a continuation of FIG. 62, and FIG. 64 is a continuation of FIG. 63.
[0346] 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.
[0347] 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.
[0348] 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.
[0349] Note that FIG. 69 is a continuation of FIG. 68, and FIG. 70 is a continuation of FIG.
[0350] 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.
[0351] 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.
[0352] 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.
[0353] Note that FIG. 75 is a continuation of FIG. 74, and FIG. 76 is a continuation of FIG.
[0354] 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.
[0355] 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.
[0356] 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.
[0357] Note that FIG. 81 is a continuation of FIG. 80, and FIG. 82 is a continuation of FIG.
[0358] 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.
[0359] 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.
[0360] The new LDPC code is an LDPC code with good performance.
[0361] Here, an LDPC code with good performance is an LDPC code obtained from an appropriate check matrix H.
[0362] An appropriate check matrix H is, for example, an LDPC code obtained from the check matrix H with low E s / N 0 , 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.
[0363] 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 .
[0364] 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.
[0365] 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.
[0366] 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.
[0367] 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.
[0368] 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.
[0369] Density evolution is a code analysis method that calculates the expected error probability for an ensemble of LDPC codes with a code length N of ∞, characterized by a degree sequence (described later).
[0370] 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.
[0371] 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.
[0372] 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.
[0373] 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.
[0374] 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.
[0375] 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.
[0376] Figure 86 shows the Tanner graph of such an ensemble.
[0377] 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.
[0378] 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.
[0379] 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.
[0380] Furthermore, in the Tanner graph of Figure 86, there is one interleaver.
[0381] 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.
[0382] 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.
[0383] In a simulation to find a high-performance LDPC code (appropriate check matrix), a multi-edge type ensemble was used in density evolution.
[0384] 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.
[0385] Figure 87 shows an example of a Tanner graph for a multi-edge type ensemble.
[0386] In the Tanner graph of FIG. 87, there are two interleavers: a first interleaver and a second interleaver.
[0387] 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.
[0388] 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.
[0389] 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.
[0390] 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 / N 0 We found an ensemble for which the performance threshold, which is the 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.
[0391] 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.
[0392] Therefore, the new LDPC code can ensure good communication quality in data transmission.
[0393] FIG. 88 is a diagram for explaining column weights of a check matrix H of a type-A code as a new LDPC code.
[0394] 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.
[0395] 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.
[0396] 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.
[0397] 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.
[0398] 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.
[0399] 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.
[0400] FIG. 90 is a diagram for explaining column weights of a check matrix H of a type-B code as a new LDPC code.
[0401] 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.
[0402] 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.
[0403] 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.
[0404] 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.
[0405] 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.
[0406] The parameters X1, KX1, X2, KX2, Y1, KY1, Y2, and KY2 are set so as to further improve the performance of the LDPC code.
[0407] The new LDPC code achieves a good BER / FER and a capacity (channel capacity) close to the Shannon limit.
[0408] <Constellation>
[0409] 92 to 116 are diagrams showing examples of constellations that can be used in the transmission system of FIG.
[0410] 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.
[0411] For a MODCOD of 1, one or more constellations can be set.
[0412] 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.
[0413] In addition, there are many types of NUCs, such as 1D-NUC (1-dimensional (M 2 There are constellations called 2D-NUC (2-dimensional (QQAM) non-uniform constellation) and 2D-NUC (2-dimensional (QQAM) non-uniform constellation).
[0414] In general, 1D-NUC provides a better BER than UC, and 2D-NUC provides a better BER than 1D-NUC.
[0415] The constellation for the QPSK modulation method is UC. For example, UC or 2D-NUC can be used as a constellation for 16QAM, 64QAM, 256QAM, etc., and for example, UC or 1D-NUC can be used as a constellation for 1024QAM, 4096QAM, etc.
[0416] In the transmission system of FIG. 7, for example, constellations defined in ATSC3.0, DVB-C.2, and the like, as well as various other constellations that improve the error rate, can be used.
[0417] That is, when the modulation scheme is QPSK, for example, the same UC can be used for each coding rate r of the LDPC code.
[0418] In addition, when the modulation method is 16QAM, 64QAM, or 256QAM, for example, the same UC can be used for each coding rate r of the LDPC code. Furthermore, when the modulation method is 16QAM, 64QAM, or 256QAM, for example, different 2D-NUC can be used for each coding rate r of the LDPC code.
[0419] In addition, when the modulation method is 1024QAM or 4096QAM, for example, the same UC can be used for each coding rate r of the LDPC code. Furthermore, when the modulation method is 1024QAM or 4096QAM, for example, different 1D-NUC can be used for each coding rate r of the LDPC code.
[0420] Here, UC of QPSK is also written as QPSK-UC, and m QAM UC, 2 m Also written as QAM-UC. m QAM 1D-NUC and 2D-NUC are, respectively, m QAM-1D-NUC and 2 m Also written as QAM-2D-NUC.
[0421] Below, we will explain some of the constellations specified in ATSC3.0.
[0422] FIG. 92 is a diagram showing the coordinates of signal points of QPSK-UC used for all coding rates of LDPC codes defined in ATSC3.0 when the modulation scheme is QPSK.
[0423] In FIG. 92, "Input Data cell y" represents a 2-bit symbol to be mapped to QPSK-UC, and "Constellation point z s " is the signal point zs The coordinates of the signal point z s The index s of the signal point z q The index q of each symbol represents the discrete time of the symbols (the time interval between one symbol and the next).
[0424] In Figure 92, signal point z s The coordinates of are expressed in the form of complex numbers, with j representing the imaginary unit (√(-1)).
[0425] FIG. 93 is a diagram showing the coordinates of signal points of 16QAM-2D-NUC used for 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 16QAM.
[0426] In FIG. 93, similar to FIG. 92, signal point z s The coordinates of are expressed in the form of complex numbers, with j representing the imaginary unit.
[0427] In FIG. 93, w#k represents the coordinates of a signal point in the first quadrant of the constellation.
[0428] 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.
[0429] 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.
[0430] An m-bit symbol can be, for example, 0 to 2 mIt 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).
[0431] In FIG. 93, 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 symbols y(0) to y(b-1).
[0432] 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.
[0433] Here, conj(w#k) represents the complex conjugate of w#k.
[0434] For example, when the modulation method is 16QAM, the m=4-bit symbols y(0), y(1), . . . , y(15) are 4 / 4=4, it is classified into four symbols: y(0) through y(3), y(4) through y(7), y(8) through y(11), and y(12) through y(15).
[0435] 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.
[0436] Now, if the coding rate r(CR) of the LDPC code is, for example, 9 / 15, according to FIG. 93, 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).
[0437] FIG. 94 is a diagram showing an example of the coordinates of signal points of 1024QAM-1D-NUC 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.
[0438] In FIG. 94, u#k is the signal point z of 1D-NUC. s The real part of the complex number Re(z s ) and imaginary part Im(z s ) and are the components of a vector u=(u0, u1, ..., u#V-1), called the position vector. The number V of components u#k of a position vector u is given by the formula V=√(2 m ) / 2.
[0439] FIG. 95 is a diagram showing the relationship between the 1024QAM symbol y and the position vector u (its component u#k).
[0440] 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 ,y 3,s ,y 4,s ,y 5,s ,y 6,s ,y 7,s ,y 8,s ,y 9,s Let us express it as follows.
[0441] A in Figure 95 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.
[0442] B in Figure 95 shows the odd-numbered 5 bits of 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.
[0443] 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).
[0444] In FIG. 95A, 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.
[0445] In FIG. 95B, 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.
[0446] On the other hand, if the coding rate r of the LDPC code is, for example, 6 / 15, according to the above-mentioned FIG. 94, for 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.
[0447] 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.
[0448] In addition, the signal points of 1D-NUC are arranged in a grid pattern on lines parallel to the I axis and on lines parallel to the Q axis in the constellation. However, the intervals between signal points are not constant. In addition, when transmitting signal points (data mapped to them), 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 ave Then, 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
[0449] In the transmission system of FIG. 7, the above-mentioned constellations defined in ATSC3.0 can be used.
[0450] 96 to 107 are diagrams showing the coordinates of UC signal points defined in DVB-C.2.
[0451] That is, FIG. 96 shows the coordinates z of the signal point of QPSK-UC (UC of QPSK) specified in DVB-C.2. q The real part of Re(z q ) is a diagram showing the coordinates z q Imaginary Part Im(z q ) is a diagram showing the same.
[0452] Figure 98 shows the coordinates z of the signal point of 16QAM-UC (UC of 16QAM) specified in DVB-C.2. q The real part of Re(z q FIG. 99 shows the coordinates z of the 16QAM-UC signal point defined in DVB-C.2. q Imaginary Part Im(z q ) is a diagram showing the same.
[0453] Figure 100 shows the coordinates z of the signal point of 64QAM-UC (UC of 64QAM) specified in DVB-C.2. q The real part of Re(z q FIG. 101 shows the coordinates z of a 64QAM-UC signal point defined in DVB-C.2. q Imaginary Part Im(z q ) is a diagram showing the same.
[0454] Figure 102 shows the coordinates z of the signal point of 256QAM-UC (UC of 256QAM) specified in DVB-C.2. q The real part of Re(z q ) is a diagram showing the coordinates z q Imaginary Part Im(z q) is a diagram showing the same.
[0455] Figure 104 shows the coordinates z of the signal point of 1024QAM-UC (UC of 1024QAM) specified in DVB-C.2. q The real part of Re(z q ) is a diagram showing the coordinates z q Imaginary Part Im(z q ) is a diagram showing the same.
[0456] Figure 106 shows the coordinates z of the signal point of 4096QAM-UC (UC of 4096QAM) specified in DVB-C.2. q The real part of Re(z q ) is a diagram showing the coordinates z q Imaginary Part Im(z q ) is a diagram showing the same.
[0457] In addition, in FIG. 96 to FIG. 107, y i,q is 2 m It represents the (i+1)th bit from the beginning of the m-bit QAM symbol (for example, 2 bits in QPSK). In addition, when transmitting (the data mapped to) a UC signal point, the average power of the signal points on the constellation can be normalized. Normalization is done by taking the root mean square of the absolute values of all the signal points (coordinates) on the constellation as P ave Then, the mean square P ave Square root of √P ave The reciprocal of 1 / (√P ave ) for each signal point z q This can be done by multiplying
[0458] In the transmission system of FIG. 7, the UC defined in DVB-C.2 as described above can be used.
[0459] That is, for new LDPC codes (corresponding to the parity check matrix initial value tables) in Figures 30 to 85 where the code length N is 69120 bits and the coding rates r are 2 / 16, 3 / 16, 4 / 16, 5 / 16, 6 / 16, 7 / 16, 8 / 16, 9 / 16, 10 / 16, 11 / 16, 12 / 16, 13 / 16, and 14 / 16, the UCs shown in Figures 96 to 107 can be used.
[0460] 108 to 116 are diagrams showing examples of the coordinates of other NUC signal points that can be used for the new LDPC codes in FIGS. 30 to 85, in which the code length N is 69120 bits and the coding rate r is 2 / 16, 3 / 16, 4 / 16, 5 / 16, 6 / 16, 7 / 16, 8 / 16, 9 / 16, 10 / 16, 11 / 16, 12 / 16, 13 / 16, and 14 / 16.
[0461] That is, FIG. 108 is a diagram showing an example of the coordinates of signal points of 16QAM-2D-NUC that can be used for each of the new LDPC codes with the coding rates r(CR) of 2 / 16, 4 / 16, 6 / 16, 8 / 16, 10 / 16, 12 / 16, and 14 / 16 among the new LDPC codes with the code length N of 69120 bits in FIG. 30 to FIG. 85.
[0462] FIG. 109 is a diagram showing an example of the coordinates of signal points of 64QAM-2D-NUC that can be used for each of the new LDPC codes with the coding rate r of 3 / 16, 5 / 16, 7 / 16, 9 / 16, 11 / 16, and 13 / 16 among the new LDPC codes with the code length N of 69120 bits in FIG. 30 to FIG. 85.
[0463] 110 and 111 are diagrams showing examples of the coordinates of signal points of 256QAM-2D-NUC that can be used for each of the new LDPC codes with the coding rate r of 2 / 16, 4 / 16, 6 / 16, 8 / 16, 10 / 16, 12 / 16, and 14 / 16 among the new LDPC codes with the code length N of 69120 bits shown in FIGS. 30 to 85.
[0464] Note that FIG. 111 is a sequel to FIG.
[0465] In Figs. 108 to 111, similarly to Fig. 93, the signal point z s The coordinates of are expressed in the form of complex numbers, with j representing the imaginary unit.
[0466] 108 to 111, w#k represents the coordinates of a signal point in the first quadrant of the constellation, similarly to FIG. 93.
[0467] Here, as explained in FIG. 93, the m-bit symbol is divided into 0 to 2 m Let b be expressed as an integer value of -1, and 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).
[0468] In Figures 108 to 111, as in Figure 93, 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 symbols y(0) to y(b-1).
[0469] Furthermore, in Figures 108 to 111, similar to Figure 93, 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.
[0470] However, in Figure 93, 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), and 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), but in Figures 108 to 111, the sign of conj is reversed.
[0471] That is, in Figures 108 to 111, 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), and 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).
[0472] FIG. 112 is a diagram showing an example of the coordinates of signal points of 1024QAM-1D-NUC that can be used for each of the new LDPC codes with the coding rate r of 3 / 16, 5 / 16, 7 / 16, 9 / 16, 11 / 16, and 13 / 16 among the new LDPC codes with the code length N of 69120 bits in FIG. 30 to FIG. 85.
[0473] That is, FIG. 112 shows the signal point z of 1024QAM-1D-NUC. s The real part of the complex number Re(z s ) and imaginary part Im(z s ) and the position vector u (its component u_k).
[0474] FIG. 113 is a diagram showing the relationship between the 1024QAM symbol y and the position vector u (component u#k) of FIG. 112.
[0475] That is, let us consider a 10-bit symbol y of 1024QAM, starting from its leading bit (most significant bit), as follows: 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 Let us express it as follows.
[0476] A in Figure 113 shows the odd-numbered 5 bits y of the 10-bit 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 ys The real part of (coordinates) Re(z s ) and the position vector u_k.
[0477] B in Figure 113 shows the even-numbered 5 bits y of the 10-bit 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 Imaginary Part Im(z s ) and the position vector u_k.
[0478] The 10-bit symbol y of 1024QAM corresponds to the signal point z of 1024QAM-1D-NUC defined in Figures 112 and 113. s When the signal point z is mapped to s The method of determining the coordinates is the same as that explained with reference to Figures 94 and 95, so the explanation will be omitted.
[0479] FIG. 114 is a diagram showing an example of the coordinates of signal points of 4096QAM-1D-NUC that can be used for each of the new LDPC codes with the coding rate r of 2 / 16, 4 / 16, 6 / 16, 8 / 16, 10 / 16, 12 / 16, and 14 / 16 among the new LDPC codes with the code length N of 69120 bits in FIG. 30 to FIG. 85.
[0480] That is, FIG. 114 shows the signal point z of 4096QAM-1D-NUC. s The real part of the complex number Re(z s ) and imaginary part Im(z s ) and the position vector u(u#k).
[0481] 115 and 116 are diagrams showing the relationship between the symbol y of 4096QAM and the position vector u (component u#k) of FIG. 114.
[0482] That is, let us consider a 12-bit symbol y of 4096QAM, starting from its leading bit (most significant bit), as follows: 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 ,y 10,s ,y 11,s Let us express it as follows.
[0483] Figure 115 shows the odd-numbered 6 bits y of the 12-bit symbol y. 0,s ,y 2,s ,y 4,s ,y 6,s ,y 8,s ,y 10,s and the signal point z corresponding to the symbol y s The real part of Re(z s ) and the position vector u_k.
[0484] Figure 116 shows the even-numbered 6 bits y of the 12-bit symbol y. 1,s ,y 3,s ,y 5,s ,y 7,s ,y 9,s ,y 11,s and the signal point z corresponding to the symbol y s Imaginary Part Im(z s ) and the position vector u_k.
[0485] The 12-bit symbol y of 4096QAM corresponds to the signal point z of 4096QAM-1D-NUC defined in Figures 114 to 116. s When the signal point z is mapped to s The method of determining the coordinates is the same as that explained with reference to Figures 94 and 95, so the explanation will be omitted.
[0486] In addition, when transmitting the signal points (data mapped to) of the NUC in Figures 108 to 116, 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) on the constellation as P ave Then, the mean square P ave Square root of √P ave The reciprocal of 1 / (√P ave ) for each signal point z s In addition, in FIG. 95, odd-numbered bits of symbol y are multiplied by signal point z s Imaginary Part Im(z s ), and the even-numbered bits of the symbol y correspond to the signal point z s The real part of Re(z s ), but in Figures 113, 115 and 116, the odd-numbered bits of the symbol y correspond to the signal point z s The real part of Re(z s ), and the even-numbered bits of the symbol y correspond to the signal point z s Imaginary Part Im(z s ) is associated with a position vector u_k representing the
[0487] <Block Interleaver 25>
[0488] FIG. 117 is a diagram for explaining the block interleaving performed in the block interleaver 25 of FIG.
[0489] Block interleaving is performed by dividing an LDPC code of one codeword, from the beginning, into a portion called part 1 and a portion called part 2.
[0490] If the length (number of bits) of part 1 is represented as Npart1 and the length of part 2 is represented as Npart2, then Npart1+Npart2 is equal to the code length N.
[0491] Conceptually, in block interleaving, columns as storage areas for storing Npart1 / m bits are arranged in a column (vertical) direction as one direction, and the number m, which is equal to the number of bits m of a symbol, is arranged in a row direction perpendicular to the column direction, and each column is divided from the top into small units of 360 bits, which is the unit size P. These small units of columns are also called column units.
[0492] In block interleaving, as shown in FIG. 117, part 1 of an LDPC code of one codeword is written from the top to the bottom (column direction) of the first column unit of a column, from left to right toward the column.
[0493] Then, when writing to the first column unit in the rightmost column is completed, as shown in FIG. 117, the process returns to the leftmost column, and writing is performed from top to bottom of the second column unit in the column, proceeding from left to right columns, and so on until part 1 of the LDPC code for one codeword is written.
[0494] When writing of part 1 of the LDPC code of one codeword is completed, part 1 of the LDPC code is read out in m-bit units in the row direction from the first row of all m columns, as shown in FIG.
[0495] The m-bit units of part 1 are fed as m-bit symbols from the block interleaver 25 to the mapper 117 (FIG. 8).
[0496] Part 1 is read out in m-bit units, sequentially moving down the m columns, and when reading of part 1 is completed, part 2 is divided into m-bit units from the beginning and supplied as m-bit symbols from block interleaver 25 to mapper 117.
[0497] Therefore, part 1 is symbolized while being interleaved, and part 2 is symbolized sequentially, divided into m bits, without being interleaved.
[0498] The length of the column, Npart1 / m, is a multiple of 360, which is the unit size P. In this way, the LDPC code of one codeword is divided into part 1 and part 2 so that Npart1 / m is a multiple of 360.
[0499] FIG. 118 is a diagram showing examples of part 1 and part 2 of an LDPC code with a code length N of 69120 bits when the modulation scheme is QPSK, 16QAM, 64QAM, 256QAM, 1024QAM, and 4096QAM, respectively.
[0500] In Figure 118, when the modulation method is 1024QAM, part 1 is 68,400 bits and part 2 is 720 bits, and when the modulation method is QPSK, 16QAM, 64QAM, 256QAM, or 4096QAM, part 1 is 69,120 bits and part 2 is 0 bit in all cases.
[0501] <Group-wise interleaving>
[0502] FIG. 119 is a diagram for explaining group-wise interleaving performed in group-wise interleaver 24 of FIG.
[0503] In group-wise interleaving, as shown in FIG. 119, 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).
[0504] 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.
[0505] When the unit size P is 360, for example, an LDPC code with a code length N of 1800 bits is partitioned into 5 (=1800 / 360) bit groups, namely, bit groups 0, 1, 2, 3, and 4. Furthermore, for example, an LDPC code with a code length N of 69120 bits is partitioned into 192 (=69120 / 360) bit groups, namely, bit groups 0, 1, . . . , 191.
[0506] In the following, the GW pattern is represented by a sequence of numbers representing the bit group. 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.
[0507] For example, let us consider the i+1-th code bit from the beginning of an LDPC code with a code length of 1800 bits as x i Let us express it as:
[0508] In this case, according to the group-wise interleaving of GW pattern 4,2,0,3,1, the 1800-bit LDPC code {x 0 ,x 1 ,...,x 1799} is {x 1440 ,x 1441 ,...,x 1799},{x 720 ,x 721 ,...,x 1079},{x 0 ,x 1 ,...,x 359},{x 1080 ,x 1081 ,...,x 1439},{x 360 ,x 361 ,...,x 719} sequence.
[0509] The GW pattern can be set for each code length N of the LDPC code, for each coding rate r, for each modulation method, for each constellation, and further for each combination of two or more of the code length N, coding rate r, modulation method, and constellation.
[0510] <Example of GW Pattern for LDPC Code>
[0511] FIG. 120 is a diagram showing a first example of a GW pattern for an LDPC code with a code length N of 69,120 bits.
[0512] According to the GW pattern of FIG. 120, the arrangement of bit groups 0 to 191 of the 69,120-bit LDPC code is the bit group 12, 8, 132, 26, 3, 18, 19, 98, 37, 190, 123, 81, 95, 167, 76, 66, 27, 46, 105, 28, 29, 170, 20, 96, 35, 177, 24, 86, 114, 63, 52, 80, 119, 153, 121, 107, 97, 129, 57, 38, 15, 91, 122, 14, 104, 175, 150, 1, 124, 72, 90, 32, 161, 78, 44, 73, 134, 162, 5, 11, 179, 93, 6, 152, 180, 68, 36, 103, 160, 100, 138, 146, 9, 82, 187, 147, 7, 87, 17, 102, 69, 110, 130, 42, 16, 71, 2, 169, 58, 33, 136, 106, 140, 84, 79, 143, 156, 139, 55, 116, 4, 21, 144, 64, 70, 158, 48, 118, 184, 50, 181, 120, 174, 133, 115, 53, 127, 74, 25, 49, 88, 22, 89, 34, 126, 61, 94, 172, 131, 39, 99, 183, 163, 111, 155, 51, 191, 31, 128, 149, 56, 85, 109, 10, 151, 188, 40, 83, 41, 47, 178, 186, 43, 54, 164, 13, 142, 117, 92, 113, 182, 168, 165, 101, 171, 159, 60, 166, 77, 30, 67, 23, 0, 65, 141, 185, 112, 145, 135, 108, 176, 45, 148, 137, 125, 62, 75, 189, 59, 173, 154, 157 are interleaved in the sequence.
[0513] FIG. 121 is a diagram illustrating a second example of a GW pattern for an LDPC code having a code length N of 69120 bits.
[0514] According to the GW pattern in FIG. 121, the sequence of bit groups 0 to 191 of the 69120-bit LDPC code is 14, 119, 182, 5, 127, 21, 152, 11, 39, 164, 25, 69, 59, 140, 73, 9, 104, 148, 77, 44, 138, 89, 184, 35, 112, 150, 178, 26, 123, 133, 91, 76, 70, 0, 176, 118, 22, 147, 96, 108, 109, 139, 18, 157, 181, 126, 174, 179, 116, 38, 45, 158, 106, 168, 10, 97, 114, 129, 180, 52, 7, 67, 43, 50, 120, 122, 3, 13, 72, 185, 34, 83, 124, 105, 162, 87, 131, 155, 135, 42, 64, 165, 41, 71, 189, 159, 143, 102, 153, 17, 24, 30, 66, 137, 62, 55, 48, 98, 110, 40, 121, 187, 74, 92, 60, 101, 57, 33, 130, 173, 32, 166, 128, 54, 99, 111, 100, 16, 84, 132, 161, 4, 190, 49, 95, 141, 28, 85, 61, 53, 183, 6, 68, 2, 163, 37, 103, 186, 154, 171, 170, 78, 117, 93, 8, 145, 51, 56, 191, 90, 82, 151, 115, 175, 1, 125, 79, 20, 80, 36, 169, 46, 167, 63, 177, 149, 81, 12, 156, 142, 31, 47, 88, 65, 134, 94, 86, 160, 172, 19, 23, 136, 58, 146, 15, 75, 107, 188, 29, 113, 144, 27 are interleaved in the sequence.
[0515] FIG. 122 is a diagram illustrating a third example of a GW pattern for an LDPC code having a code length N of 69120 bits.
[0516] According to the GW pattern in FIG. 122, the sequence of bit groups 0 to 191 of the 69120-bit LDPC code is 121, 28, 49, 4, 21, 191, 90, 101, 188, 126, 8, 131, 81, 150, 141, 152, 17, 82, 61, 119, 125, 145, 153, 45, 108, 22, 94, 48, 29, 12, 59, 140, 75, 169, 183, 157, 142, 158, 113, 79, 89, 186, 112, 80, 56, 120, 166, 15, 43, 2, 62, 115, 38, 123, 73, 179, 155, 171, 185, 5, 168, 172, 190, 106, 174, 96, 116, 91, 30, 147, 19, 149, 37, 175, 124, 156, 14, 144, 86, 110, 40, 68, 162, 66, 130, 74, 165, 180, 13, 177, 122, 23, 109, 95, 42, 117, 65, 3, 111, 18, 32, 52, 97, 184, 54, 46, 167, 136, 1, 134, 189, 187, 16, 36, 84, 132, 170, 34, 57, 24, 137, 100, 39, 127, 6, 102, 10, 25, 114, 146, 53, 99, 85, 35, 78, 148, 9, 143, 139, 92, 173, 27, 11, 26, 104, 176, 98, 129, 51, 103, 160, 71, 154, 118, 67, 33, 181, 87, 77, 47, 159, 178, 83, 70, 164, 44, 69, 88, 63, 161, 182, 133, 20, 41, 64, 76, 31, 50, 128, 105, 0, 135, 55, 72, 93, 151, 107, 163, 60, 138, 7, 58 are interleaved in the sequence.
[0517] FIG. 123 is a diagram illustrating a fourth example of a GW pattern for an LDPC code having a code length N of 69120 bits.
[0518] According to the GW pattern in FIG. 123, the sequence of bit groups 0 to 191 of the 69120-bit LDPC code is 99, 59, 95, 50, 122, 15, 144, 6, 129, 36, 175, 159, 165, 35, 182, 181, 189, 29, 2, 115, 91, 41, 60, 160, 51, 106, 168, 173, 20, 138, 183, 70, 24, 127, 47, 5, 119, 171, 102, 135, 116, 156, 120, 105, 117, 136, 149, 128, 85, 46, 186, 113, 73, 103, 52, 82, 89, 184, 22, 185, 155, 125, 133, 37, 27, 10, 137, 76, 12, 98, 148, 109, 42, 16, 190, 84, 94, 97, 25, 11, 88, 166, 131, 48, 161, 65, 9, 8, 58, 56, 124, 68, 54, 3, 169, 146, 87, 108, 110, 121, 163, 57, 90, 100, 66, 49, 61, 178, 18, 7, 28, 67, 13, 32, 34, 86, 153, 112, 63, 43, 164, 132, 118, 93, 38, 39, 17, 154, 170, 81, 141, 191, 152, 111, 188, 147, 180, 75, 72, 26, 177, 126, 179, 55, 1, 143, 45, 21, 40, 123, 23, 162, 77, 62, 134, 158, 176, 31, 69, 114, 142, 19, 96, 101, 71, 30, 140, 187, 92, 80, 79, 0, 104, 53, 145, 139, 14, 33, 74, 157, 150, 44, 172, 151, 64, 78, 130, 83, 167, 4, 107, 174 are interleaved in the sequence.
[0519] FIG. 124 is a diagram illustrating a fifth example of a GW pattern for an LDPC code having a code length N of 69120 bits.
[0520] According to the GW pattern in FIG. 124, the sequence of bit groups 0 to 191 of the 69120-bit LDPC code is 170, 45, 67, 94, 110, 153, 19, 38, 112, 176, 49, 138, 35, 114, 184, 159, 17, 41, 47, 189, 65, 125, 154, 57, 83, 6, 97, 167, 51, 59, 23, 81, 54, 46, 168, 178, 148, 5, 122, 129, 155, 179, 95, 102, 8, 119, 29, 113, 14, 60, 43, 66, 55, 103, 111, 88, 56, 7, 118, 63, 134, 108, 61, 187, 124, 31, 133, 22, 79, 52, 36, 144, 89, 177, 40, 116, 121, 135, 163, 92, 117, 162, 149, 106, 173, 181, 11, 164, 185, 99, 18, 158, 16, 12, 48, 9, 123, 147, 145, 169, 130, 183, 28, 151, 71, 126, 69, 165, 21, 13, 15, 62, 80, 182, 76, 90, 180, 50, 127, 131, 109, 3, 115, 120, 161, 82, 34, 78, 128, 142, 136, 75, 86, 137, 26, 25, 44, 91, 42, 73, 140, 146, 152, 27, 101, 93, 20, 166, 171, 100, 70, 84, 53, 186, 24, 98, 4, 37, 141, 190, 68, 150, 1, 72, 39, 87, 188, 191, 156, 33, 30, 160, 143, 64, 132, 77, 0, 58, 174, 157, 105, 175, 10, 172, 104, 2, 96, 139, 32, 85, 107, 74 are interleaved in the sequence.
[0521] FIG. 125 is a diagram illustrating a sixth example of a GW pattern for an LDPC code having a code length N of 69120 bits.
[0522] According to the GW pattern in FIG. 125, the sequence of bit groups 0 to 191 of the 69120-bit LDPC code is 111, 156, 189, 11, 132, 114, 100, 154, 77, 79, 95, 161, 47, 142, 36, 98, 3, 125, 159, 120, 40, 160, 29, 153, 16, 39, 101, 58, 191, 46, 76, 4, 183, 176, 62, 60, 74, 7, 37, 127, 19, 186, 71, 50, 139, 27, 188, 113, 38, 130, 124, 26, 146, 131, 102, 110, 105, 147, 86, 150, 94, 162, 175, 88, 104, 55, 89, 181, 34, 69, 22, 92, 133, 1, 25, 0, 158, 10, 24, 116, 164, 165, 112, 72, 106, 129, 81, 66, 54, 49, 136, 118, 83, 41, 2, 56, 145, 28, 177, 168, 117, 9, 157, 173, 115, 149, 42, 103, 14, 84, 155, 187, 99, 6, 43, 70, 140, 73, 32, 78, 75, 167, 148, 48, 134, 178, 59, 15, 63, 91, 82, 33, 135, 166, 190, 152, 96, 137, 12, 182, 61, 107, 128, 119, 179, 45, 184, 65, 172, 138, 31, 57, 174, 17, 180, 5, 30, 170, 23, 85, 185, 35, 44, 123, 90, 20, 122, 8, 64, 141, 169, 121, 97, 108, 80, 171, 18, 13, 87, 163, 109, 52, 51, 21, 93, 67, 126, 68, 53, 143, 144, 151 are interleaved in the sequence.
[0523] FIG. 126 is a diagram illustrating a seventh example of a GW pattern for an LDPC code having a code length N of 69120 bits.
[0524] According to the GW pattern in FIG. 126, the sequence of bit groups 0 to 191 of the 69120-bit LDPC code is 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191 are interleaved in the sequence.
[0525] FIG. 127 is a diagram illustrating an eighth example of a GW pattern for an LDPC code having a code length N of 69120 bits.
[0526] According to the GW pattern in FIG. 127, the sequence of bit groups 0 to 191 of the 69120-bit LDPC code is 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191 are interleaved in the sequence.
[0527] FIG. 128 is a diagram illustrating a ninth example of a GW pattern for an LDPC code having a code length N of 69120 bits.
[0528] According to the GW pattern in FIG. 128, the sequence of bit groups 0 to 191 of the 69120-bit LDPC code is 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191 are interleaved in the sequence.
[0529] FIG. 129 is a diagram illustrating a tenth example of a GW pattern for an LDPC code having a code length N of 69120 bits.
[0530] According to the GW pattern in FIG. 129, the sequence of bit groups 0 to 191 of the 69120-bit LDPC code is 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191 are interleaved in the sequence.
[0531] FIG. 130 is a diagram illustrating an eleventh example of a GW pattern for an LDPC code having a code length N of 69120 bits.
[0532] According to the GW pattern in FIG. 130, the sequence of bit groups 0 to 191 of the 69120-bit LDPC code is 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191 are interleaved in the sequence.
[0533] FIG. 131 is a diagram illustrating a twelfth example of a GW pattern for an LDPC code having a code length N of 69120 bits.
[0534] According to the GW pattern in FIG. 131, the sequence of bit groups 0 to 191 of the 69120-bit LDPC code is 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191 are interleaved in the sequence.
[0535] FIG. 132 is a diagram illustrating a thirteenth example of a GW pattern for an LDPC code having a code length N of 69120 bits.
[0536] According to the GW pattern in FIG. 132, the sequence of bit groups 0 to 191 of the 69120-bit LDPC code is 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191 are interleaved in the sequence.
[0537] FIG. 133 is a diagram illustrating a 14th example of a GW pattern for an LDPC code having a code length N of 69120 bits.
[0538] According to the GW pattern in FIG. 133, the sequence of bit groups 0 to 191 of the 69120-bit LDPC code is 154, 106, 99, 177, 191, 55, 189, 181, 22, 62, 80, 114, 110, 141, 83, 103, 169, 156, 130, 186, 92, 45, 68, 126, 112, 185, 160, 158, 17, 145, 162, 127, 152, 174, 134, 18, 157, 120, 3, 29, 13, 135, 173, 86, 73, 150, 46, 153, 33, 61, 142, 102, 171, 168, 78, 77, 139, 85, 176, 163, 128, 101, 42, 2, 14, 38, 10, 125, 90, 30, 63, 172, 47, 108, 89, 0, 32, 94, 23, 34, 59, 35, 129, 12, 146, 8, 60, 27, 147, 180, 100, 87, 184, 167, 36, 79, 138, 4, 95, 148, 72, 54, 91, 182, 28, 133, 164, 175, 123, 107, 137, 88, 44, 116, 69, 7, 31, 124, 144, 105, 170, 6, 165, 15, 161, 24, 58, 70, 11, 56, 143, 111, 104, 74, 67, 109, 82, 21, 52, 9, 71, 48, 26, 117, 50, 149, 140, 20, 57, 136, 113, 64, 151, 190, 131, 19, 51, 96, 76, 1, 97, 40, 53, 84, 166, 75, 159, 98, 81, 49, 66, 188, 118, 39, 132, 187, 25, 119, 41, 122, 16, 5, 93, 115, 178, 65, 121, 37, 155, 183, 43, 179 are interleaved in the sequence.
[0539] FIG. 134 is a diagram illustrating a fifteenth example of a GW pattern for an LDPC code having a code length N of 69120 bits.
[0540] According to the GW pattern in FIG. 134, the sequence of bit groups 0 to 191 of the 69120-bit LDPC code is 1, 182, 125, 0, 121, 47, 63, 154, 76, 99, 82, 163, 102, 166, 28, 189, 56, 67, 54, 39, 40, 185, 184, 65, 179, 4, 91, 87, 137, 170, 98, 71, 169, 49, 73, 37, 11, 143, 150, 123, 93, 62, 3, 50, 26, 140, 178, 95, 183, 33, 21, 53, 112, 128, 118, 120, 106, 139, 32, 130, 173, 132, 156, 119, 83, 176, 159, 13, 145, 36, 30, 113, 2, 41, 147, 174, 94, 88, 92, 60, 165, 59, 25, 161, 100, 85, 81, 61, 138, 48, 177, 77, 6, 22, 16, 43, 115, 23, 12, 66, 70, 9, 164, 122, 58, 105, 69, 42, 38, 19, 24, 180, 175, 74, 160, 34, 101, 72, 114, 142, 20, 8, 15, 190, 144, 104, 79, 172, 148, 31, 168, 10, 107, 14, 35, 52, 134, 126, 167, 149, 116, 186, 17, 162, 151, 5, 136, 55, 44, 110, 158, 46, 191, 29, 153, 155, 117, 188, 131, 97, 146, 103, 78, 109, 129, 57, 111, 45, 68, 157, 84, 141, 89, 64, 7, 108, 152, 75, 18, 96, 133, 171, 86, 181, 127, 27, 124, 187, 135, 80, 51, 90 are interleaved in the sequence.
[0541] FIG. 135 is a diagram illustrating a 16th example of a GW pattern for an LDPC code having a code length N of 69120 bits.
[0542] According to the GW pattern in FIG. 135, the sequence of bit groups 0 to 191 of the 69120-bit LDPC code is 35, 75, 166, 145, 143, 184, 62, 96, 54, 63, 157, 103, 32, 43, 126, 187, 144, 91, 78, 44, 39, 109, 185, 102, 10, 68, 29, 42, 149, 83, 133, 94, 130, 27, 171, 19, 51, 165, 148, 28, 36, 33, 173, 136, 87, 82, 100, 49, 120, 152, 161, 162, 147, 71, 137, 57, 8, 53, 132, 151, 163, 123, 47, 92, 90, 60, 99, 79, 59, 108, 115, 72, 0, 12, 140, 160, 61, 180, 74, 37, 86, 117, 191, 101, 52, 15, 80, 156, 127, 81, 131, 141, 142, 31, 95, 4, 73, 64, 16, 18, 146, 70, 181, 7, 89, 124, 77, 67, 116, 21, 34, 41, 105, 113, 97, 2, 6, 55, 17, 65, 38, 48, 158, 159, 179, 5, 30, 183, 170, 135, 125, 20, 106, 186, 182, 188, 114, 1, 14, 3, 134, 178, 189, 167, 40, 119, 22, 190, 58, 23, 155, 138, 98, 84, 11, 110, 88, 46, 177, 175, 25, 150, 118, 121, 129, 168, 13, 128, 104, 69, 112, 169, 9, 45, 174, 93, 26, 56, 76, 50, 154, 139, 66, 85, 153, 107, 111, 172, 176, 164, 24, 122 are interleaved in the sequence.
[0543] FIG. 136 is a diagram illustrating a 17th example of a GW pattern for an LDPC code having a code length N of 69120 bits.
[0544] According to the GW pattern in FIG. 136, the sequence of bit groups 0 to 191 of the 69120-bit LDPC code is 155, 188, 123, 132, 15, 79, 59, 119, 66, 68, 41, 175, 184, 78, 142, 32, 54, 111, 139, 134, 95, 34, 161, 150, 58, 141, 74, 112, 121, 99, 178, 179, 57, 90, 80, 21, 11, 29, 67, 104, 52, 87, 38, 81, 181, 160, 176, 16, 71, 13, 186, 171, 9, 170, 2, 177, 0, 88, 149, 190, 69, 33, 183, 146, 61, 117, 113, 6, 96, 120, 162, 23, 53, 140, 91, 128, 46, 93, 174, 126, 159, 133, 8, 152, 103, 102, 151, 143, 100, 4, 180, 166, 55, 164, 18, 49, 62, 20, 83, 7, 187, 153, 64, 37, 144, 185, 19, 114, 25, 116, 12, 173, 122, 127, 89, 115, 75, 101, 189, 124, 157, 108, 28, 165, 163, 65, 168, 77, 82, 27, 137, 86, 22, 110, 63, 148, 158, 97, 31, 105, 135, 98, 44, 70, 182, 191, 17, 156, 129, 39, 136, 169, 3, 145, 154, 109, 76, 5, 10, 106, 35, 94, 172, 45, 51, 60, 42, 50, 72, 85, 40, 118, 36, 14, 130, 131, 138, 43, 48, 125, 84, 24, 26, 1, 56, 107, 92, 147, 47, 30, 73, 167 are interleaved in the sequence.
[0545] FIG. 137 is a diagram illustrating an 18th example of a GW pattern for an LDPC code having a code length N of 69120 bits.
[0546] According to the GW pattern in FIG. 137, the sequence of bit groups 0 to 191 of the 69120-bit LDPC code is 152, 87, 170, 33, 48, 95, 2, 184, 145, 51, 94, 164, 38, 90, 158, 70, 124, 128, 66, 111, 79, 42, 45, 141, 83, 73, 57, 119, 20, 67, 31, 179, 123, 183, 26, 188, 15, 163, 1, 133, 105, 72, 81, 153, 69, 182, 101, 180, 185, 190, 77, 6, 127, 138, 75, 59, 24, 175, 30, 186, 139, 56, 100, 176, 147, 189, 116, 131, 25, 5, 16, 117, 74, 50, 171, 114, 76, 44, 107, 135, 71, 181, 13, 43, 122, 78, 4, 58, 35, 63, 187, 98, 37, 169, 148, 7, 10, 49, 80, 161, 167, 28, 142, 46, 97, 92, 121, 112, 88, 102, 106, 173, 19, 27, 41, 172, 91, 191, 34, 118, 108, 136, 166, 155, 96, 3, 165, 103, 84, 109, 104, 53, 23, 0, 178, 17, 86, 9, 168, 134, 110, 18, 32, 146, 129, 159, 55, 154, 126, 40, 151, 174, 60, 52, 22, 149, 156, 113, 143, 11, 93, 62, 177, 64, 61, 160, 150, 65, 130, 82, 29, 115, 137, 36, 8, 157, 54, 89, 99, 120, 68, 21, 140, 14, 39, 132, 125, 12, 85, 162, 47, 144 are interleaved in the sequence.
[0547] FIG. 138 is a diagram illustrating a 19th example of a GW pattern for an LDPC code having a code length N of 69120 bits.
[0548] According to the GW pattern in FIG. 138, the sequence of bit groups 0 to 191 of the 69120-bit LDPC code is 140, 8, 176, 13, 41, 165, 27, 109, 121, 153, 58, 181, 143, 164, 103, 115, 91, 66, 60, 189, 101, 4, 14, 102, 45, 124, 104, 159, 130, 133, 135, 77, 25, 59, 180, 141, 144, 62, 114, 182, 134, 148, 11, 20, 125, 83, 162, 75, 126, 67, 9, 178, 171, 152, 166, 69, 174, 15, 80, 168, 131, 95, 56, 48, 63, 82, 147, 51, 108, 52, 30, 139, 22, 37, 173, 112, 191, 98, 116, 149, 167, 142, 29, 154, 92, 94, 71, 117, 79, 122, 129, 24, 81, 105, 97, 137, 128, 1, 113, 170, 119, 7, 158, 76, 19, 183, 68, 31, 50, 118, 33, 72, 55, 65, 146, 185, 111, 145, 28, 21, 177, 160, 32, 61, 70, 106, 156, 78, 132, 88, 184, 35, 5, 53, 138, 47, 100, 10, 42, 36, 175, 93, 120, 190, 16, 123, 87, 54, 186, 18, 57, 84, 99, 12, 163, 157, 188, 64, 38, 26, 2, 136, 40, 169, 90, 107, 46, 172, 49, 6, 39, 44, 150, 85, 0, 17, 127, 155, 110, 34, 96, 74, 86, 187, 89, 151, 43, 179, 161, 73, 23, 3 are interleaved in the sequence.
[0549] FIG. 139 is a diagram illustrating a twentieth example of a GW pattern for an LDPC code having a code length N of 69120 bits.
[0550] According to the GW pattern in FIG. 139, the sequence of bit groups 0 to 191 of the 69120-bit LDPC code is 10, 61, 30, 88, 33, 60, 1, 102, 45, 103, 119, 181, 82, 112, 12, 67, 69, 171, 108, 26, 145, 156, 81, 152, 8, 16, 68, 13, 99, 183, 146, 27, 158, 147, 132, 118, 180, 120, 173, 59, 186, 49, 7, 17, 35, 104, 129, 75, 54, 72, 18, 48, 15, 177, 191, 51, 24, 93, 106, 22, 71, 29, 141, 32, 143, 128, 175, 86, 190, 74, 36, 43, 144, 46, 63, 65, 133, 31, 87, 44, 20, 117, 76, 187, 80, 101, 151, 47, 130, 116, 162, 127, 153, 100, 94, 2, 41, 138, 125, 131, 11, 50, 40, 21, 184, 167, 172, 85, 160, 105, 73, 38, 157, 53, 39, 97, 107, 165, 168, 89, 148, 126, 3, 4, 114, 161, 155, 182, 136, 149, 111, 98, 113, 139, 92, 109, 174, 185, 95, 56, 135, 37, 163, 154, 0, 96, 78, 122, 5, 179, 140, 83, 123, 77, 9, 19, 66, 42, 137, 14, 23, 159, 189, 110, 142, 84, 169, 166, 52, 91, 164, 28, 124, 121, 70, 115, 90, 170, 58, 6, 178, 176, 64, 188, 57, 34, 79, 62, 25, 134, 150, 55 are interleaved in the sequence.
[0551] FIG. 140 is a diagram showing a 21st example of a GW pattern for an LDPC code having a code length N of 69120 bits.
[0552] According to the GW pattern in FIG. 140, the sequence of bit groups 0 to 191 of the 69120-bit LDPC code is 8, 165, 180, 182, 189, 61, 7, 140, 105, 78, 86, 75, 15, 28, 82, 1, 136, 130, 35, 24, 70, 152, 121, 11, 36, 66, 83, 57, 164, 111, 137, 128, 175, 156, 151, 48, 44, 147, 18, 64, 184, 42, 159, 3, 6, 162, 170, 98, 101, 29, 102, 21, 188, 79, 138, 45, 124, 118, 155, 125, 34, 27, 5, 97, 109, 145, 54, 56, 126, 187, 16, 149, 160, 178, 23, 141, 30, 117, 25, 69, 116, 131, 94, 65, 191, 99, 181, 185, 115, 67, 93, 106, 38, 71, 76, 113, 132, 172, 103, 95, 92, 107, 4, 163, 139, 72, 157, 0, 12, 52, 68, 88, 161, 183, 39, 14, 32, 49, 19, 77, 174, 47, 154, 17, 134, 133, 51, 120, 74, 177, 41, 108, 142, 143, 13, 26, 59, 100, 123, 55, 158, 62, 104, 148, 135, 9, 179, 53, 176, 33, 169, 129, 186, 43, 167, 87, 119, 84, 90, 150, 20, 10, 122, 114, 80, 50, 146, 144, 96, 171, 40, 73, 81, 168, 112, 190, 37, 173, 46, 110, 60, 85, 153, 2, 63, 91, 127, 89, 31, 58, 22, 166 are interleaved in the sequence.
[0553] FIG. 141 is a diagram illustrating a 22nd example of a GW pattern for an LDPC code having a code length N of 69120 bits.
[0554] According to the GW pattern in FIG. 141, the sequence of bit groups 0 to 191 of the 69120-bit LDPC code is 17, 84, 125, 70, 134, 63, 68, 162, 61, 31, 74, 137, 7, 138, 5, 60, 76, 105, 160, 12, 114, 81, 155, 112, 153, 191, 82, 148, 118, 108, 58, 159, 43, 161, 149, 96, 71, 30, 145, 174, 67, 77, 47, 94, 48, 156, 151, 141, 131, 176, 183, 41, 35, 83, 164, 55, 169, 98, 187, 124, 100, 54, 104, 40, 2, 72, 8, 85, 182, 103, 6, 37, 107, 39, 42, 123, 57, 106, 13, 150, 129, 46, 109, 188, 45, 113, 44, 90, 20, 165, 142, 110, 22, 28, 173, 38, 52, 16, 34, 0, 3, 144, 27, 49, 139, 177, 132, 184, 25, 87, 152, 119, 158, 78, 186, 167, 97, 24, 99, 69, 120, 122, 133, 163, 21, 51, 101, 185, 111, 26, 18, 10, 33, 170, 95, 65, 14, 130, 157, 59, 115, 127, 92, 56, 1, 80, 66, 126, 178, 147, 75, 179, 171, 53, 146, 88, 4, 128, 121, 86, 117, 19, 23, 168, 181, 11, 102, 93, 73, 140, 89, 136, 9, 180, 62, 36, 79, 91, 190, 143, 29, 154, 32, 64, 166, 116, 15, 189, 175, 50, 135, 172 are interleaved in the sequence.
[0555] FIG. 142 is a diagram illustrating a 23rd example of a GW pattern for an LDPC code having a code length N of 69120 bits.
[0556] According to the GW pattern in FIG. 142, the sequence of bit groups 0 to 191 of the 69120-bit LDPC code is 157, 20, 116, 115, 49, 178, 148, 152, 174, 130, 171, 81, 60, 146, 182, 72, 46, 22, 93, 101, 9, 55, 40, 163, 118, 30, 52, 181, 151, 31, 87, 117, 120, 82, 95, 190, 23, 36, 67, 62, 14, 167, 80, 27, 24, 43, 94, 0, 63, 5, 74, 78, 158, 88, 84, 109, 147, 112, 124, 110, 21, 47, 45, 68, 184, 70, 1, 66, 149, 105, 140, 170, 56, 98, 135, 61, 79, 123, 166, 185, 41, 108, 122, 92, 16, 26, 37, 177, 173, 113, 136, 89, 162, 85, 54, 39, 73, 58, 131, 134, 188, 127, 3, 164, 13, 132, 129, 179, 25, 18, 57, 32, 119, 111, 53, 155, 28, 107, 133, 144, 19, 160, 71, 186, 153, 103, 2, 12, 91, 106, 64, 175, 75, 189, 128, 142, 187, 76, 180, 34, 59, 169, 90, 11, 172, 97, 141, 38, 191, 17, 114, 126, 145, 83, 143, 125, 121, 10, 44, 137, 86, 29, 104, 154, 168, 65, 159, 15, 99, 35, 50, 48, 138, 96, 100, 102, 7, 42, 156, 8, 4, 69, 183, 51, 165, 6, 150, 77, 161, 33, 176, 139 are interleaved in the sequence.
[0557] FIG. 143 is a diagram illustrating a 24th example of a GW pattern for an LDPC code having a code length N of 69120 bits.
[0558] According to the GW pattern in FIG. 143, the sequence of bit groups 0 to 191 of the 69120-bit LDPC code is 42, 168, 36, 37, 152, 118, 14, 83, 105, 131, 26, 120, 92, 130, 158, 132, 49, 72, 137, 100, 88, 24, 53, 142, 110, 102, 74, 188, 113, 121, 12, 173, 5, 126, 127, 3, 93, 46, 164, 109, 151, 2, 98, 153, 116, 89, 101, 136, 35, 80, 0, 133, 183, 162, 185, 56, 17, 87, 117, 184, 54, 70, 176, 91, 134, 51, 38, 73, 165, 99, 169, 43, 167, 86, 11, 144, 78, 58, 64, 13, 119, 33, 166, 6, 75, 31, 15, 28, 125, 148, 27, 114, 82, 45, 55, 191, 160, 115, 1, 69, 187, 122, 177, 32, 172, 52, 112, 171, 124, 180, 85, 150, 7, 57, 60, 94, 181, 29, 97, 128, 19, 149, 175, 50, 140, 10, 174, 68, 59, 39, 106, 44, 62, 71, 18, 107, 156, 159, 146, 48, 81, 111, 96, 103, 34, 161, 141, 154, 76, 61, 135, 20, 84, 77, 108, 23, 145, 182, 170, 139, 157, 47, 9, 63, 123, 138, 155, 79, 4, 30, 143, 25, 90, 66, 147, 186, 179, 129, 21, 65, 41, 95, 67, 22, 163, 190, 16, 8, 104, 189, 40, 178 are interleaved in the sequence.
[0559] FIG. 144 is a diagram illustrating a 25th example of a GW pattern for an LDPC code having a code length N of 69120 bits.
[0560] According to the GW pattern in FIG. 144, the sequence of bit groups 0 to 191 of the 69120-bit LDPC code is 92, 132, 39, 44, 190, 21, 70, 146, 48, 13, 17, 187, 119, 43, 94, 157, 150, 98, 96, 47, 86, 63, 152, 158, 84, 170, 81, 7, 62, 191, 174, 99, 116, 10, 85, 113, 135, 28, 53, 122, 83, 141, 77, 23, 131, 4, 40, 168, 129, 109, 51, 130, 188, 147, 29, 50, 26, 78, 148, 164, 167, 103, 36, 134, 2, 177, 20, 123, 27, 90, 176, 5, 33, 133, 189, 138, 76, 41, 89, 35, 72, 139, 32, 73, 68, 67, 101, 166, 93, 54, 52, 42, 110, 59, 8, 179, 34, 171, 143, 137, 9, 126, 155, 108, 142, 120, 163, 12, 3, 75, 159, 107, 65, 128, 87, 6, 22, 57, 100, 24, 64, 106, 117, 19, 58, 95, 74, 180, 125, 136, 186, 154, 121, 161, 88, 37, 114, 102, 105, 160, 80, 185, 82, 124, 184, 15, 16, 18, 118, 173, 151, 11, 91, 79, 46, 140, 127, 1, 169, 0, 61, 66, 45, 162, 149, 115, 144, 30, 25, 175, 153, 183, 60, 38, 31, 111, 182, 49, 55, 145, 56, 181, 104, 14, 71, 178, 112, 172, 165, 69, 97, 156 are interleaved in the sequence.
[0561] FIG. 145 is a diagram illustrating a 26th example of a GW pattern for an LDPC code having a code length N of 69120 bits.
[0562] According to the GW pattern in FIG. 145, the sequence of bit groups 0 to 191 of the 69120-bit LDPC code is 133, 96, 46, 148, 78, 109, 149, 161, 55, 39, 183, 54, 186, 73, 150, 180, 189, 190, 22, 135, 12, 80, 42, 130, 164, 70, 126, 107, 57, 67, 15, 157, 52, 88, 5, 23, 123, 66, 53, 147, 177, 60, 131, 108, 171, 191, 44, 140, 98, 154, 37, 118, 176, 92, 124, 138, 132, 167, 173, 13, 79, 32, 145, 14, 113, 30, 2, 0, 165, 182, 153, 24, 144, 87, 82, 75, 141, 89, 137, 33, 100, 106, 128, 168, 29, 36, 172, 11, 111, 68, 16, 10, 34, 188, 35, 160, 77, 83, 178, 58, 59, 7, 56, 110, 104, 61, 76, 85, 121, 93, 19, 134, 179, 155, 163, 115, 185, 125, 112, 71, 8, 119, 18, 47, 151, 26, 103, 122, 9, 170, 146, 99, 49, 72, 102, 31, 40, 43, 158, 142, 4, 69, 139, 28, 174, 101, 84, 129, 156, 74, 62, 91, 159, 41, 38, 45, 136, 169, 21, 51, 181, 97, 166, 175, 90, 27, 86, 65, 105, 143, 127, 17, 6, 116, 94, 117, 48, 50, 25, 64, 95, 63, 184, 152, 120, 1, 187, 162, 114, 3, 81, 20 are interleaved in the sequence.
[0563] FIG. 146 is a diagram illustrating a 27th example of a GW pattern for an LDPC code having a code length N of 69120 bits.
[0564] According to the GW pattern in FIG. 146, the sequence of bit groups 0 to 191 of the 69120-bit LDPC code is 59, 34, 129, 18, 137, 6, 83, 139, 47, 148, 147, 110, 11, 98, 62, 149, 158, 14, 42, 180, 23, 128, 99, 181, 54, 176, 35, 130, 53, 179, 39, 152, 32, 52, 69, 82, 84, 113, 79, 21, 95, 7, 126, 191, 86, 169, 111, 12, 55, 27, 182, 120, 123, 88, 107, 50, 144, 49, 38, 165, 0, 159, 10, 43, 114, 187, 150, 19, 65, 48, 124, 8, 141, 171, 173, 17, 167, 92, 74, 170, 184, 67, 33, 172, 16, 119, 66, 57, 89, 106, 26, 78, 178, 109, 70, 2, 157, 15, 105, 22, 174, 127, 100, 71, 97, 163, 9, 77, 87, 41, 183, 117, 46, 40, 131, 85, 136, 72, 122, 1, 45, 13, 44, 56, 61, 146, 25, 132, 177, 76, 121, 160, 112, 5, 134, 73, 91, 135, 68, 3, 80, 90, 190, 60, 75, 145, 115, 81, 161, 156, 116, 166, 96, 28, 138, 94, 162, 140, 102, 4, 133, 30, 155, 189, 143, 64, 185, 164, 104, 142, 154, 118, 24, 31, 153, 103, 51, 108, 29, 37, 58, 186, 175, 36, 151, 63, 93, 188, 125, 101, 20, 168 are interleaved in the sequence.
[0565] FIG. 147 is a diagram illustrating a 28th example of a GW pattern for an LDPC code having a code length N of 69120 bits.
[0566] According to the GW pattern in FIG. 147, the sequence of bit groups 0 to 191 of the 69120-bit LDPC code is 61, 110, 123, 127, 148, 162, 131, 71, 176, 22, 157, 0, 151, 155, 112, 189, 36, 181, 10, 46, 133, 75, 80, 88, 6, 165, 97, 54, 31, 174, 49, 139, 98, 4, 170, 26, 50, 16, 141, 187, 13, 109, 106, 120, 72, 32, 63, 59, 79, 172, 83, 100, 92, 24, 56, 130, 167, 81, 103, 111, 158, 159, 153, 175, 8, 41, 136, 70, 33, 45, 84, 150, 39, 166, 164, 99, 126, 190, 134, 40, 87, 64, 154, 140, 116, 184, 115, 183, 30, 35, 7, 42, 146, 86, 58, 12, 14, 149, 89, 179, 128, 160, 95, 171, 74, 25, 29, 119, 143, 178, 28, 21, 23, 90, 188, 96, 173, 93, 147, 191, 18, 62, 2, 132, 20, 11, 17, 135, 152, 67, 73, 108, 76, 91, 156, 104, 48, 121, 94, 125, 38, 65, 177, 68, 37, 124, 78, 118, 186, 34, 185, 113, 169, 9, 69, 82, 163, 114, 145, 168, 44, 52, 105, 51, 137, 1, 161, 3, 55, 182, 101, 57, 43, 77, 5, 47, 144, 180, 66, 53, 19, 117, 60, 138, 142, 107, 122, 85, 27, 129, 15, 102 are interleaved in the sequence.
[0567] FIG. 148 is a diagram illustrating a 29th example of a GW pattern for an LDPC code having a code length N of 69120 bits.
[0568] According to the GW pattern in FIG. 148, the sequence of bit groups 0 to 191 of the 69120-bit LDPC code is 8, 174, 121, 46, 70, 106, 183, 9, 96, 109, 72, 130, 47, 168, 1, 190, 18, 90, 103, 135, 105, 112, 23, 33, 185, 31, 171, 111, 0, 115, 4, 159, 25, 65, 134, 146, 26, 37, 16, 169, 167, 74, 67, 155, 154, 83, 117, 53, 19, 161, 76, 12, 7, 131, 59, 51, 189, 42, 114, 142, 126, 66, 164, 191, 55, 132, 35, 153, 137, 87, 5, 100, 122, 150, 2, 49, 32, 172, 149, 177, 15, 82, 98, 34, 140, 170, 56, 78, 188, 57, 118, 186, 181, 52, 71, 24, 81, 22, 11, 156, 86, 148, 97, 38, 48, 64, 40, 165, 180, 125, 127, 143, 88, 43, 61, 158, 28, 162, 187, 110, 84, 157, 27, 41, 39, 124, 85, 58, 20, 44, 102, 36, 77, 147, 120, 179, 21, 60, 92, 138, 119, 173, 160, 144, 91, 99, 107, 101, 145, 184, 108, 95, 69, 63, 3, 89, 128, 136, 94, 129, 50, 79, 68, 151, 104, 163, 123, 182, 93, 29, 133, 152, 178, 80, 62, 54, 14, 141, 166, 176, 45, 30, 10, 6, 75, 73, 116, 175, 17, 113, 139, 13 are interleaved in the sequence.
[0569] FIG. 149 is a diagram illustrating a 30th example of a GW pattern for an LDPC code having a code length N of 69120 bits.
[0570] According to the GW pattern in FIG. 149, the sequence of bit groups 0 to 191 of the 69120-bit LDPC code is 179, 91, 101, 128, 169, 69, 185, 35, 156, 168, 132, 163, 46, 28, 5, 41, 162, 112, 108, 130, 153, 79, 118, 102, 125, 176, 71, 20, 115, 98, 124, 75, 103, 21, 164, 173, 9, 36, 56, 134, 24, 16, 159, 34, 15, 42, 104, 54, 120, 76, 60, 33, 127, 88, 133, 137, 61, 19, 3, 170, 87, 190, 13, 141, 188, 106, 113, 67, 145, 146, 111, 74, 89, 62, 175, 49, 32, 99, 93, 107, 171, 66, 80, 155, 100, 152, 4, 10, 126, 109, 181, 154, 105, 48, 136, 161, 183, 97, 31, 12, 8, 184, 47, 142, 18, 14, 117, 73, 84, 70, 68, 0, 23, 96, 165, 29, 122, 81, 17, 131, 44, 157, 26, 25, 189, 83, 178, 37, 123, 82, 191, 39, 7, 72, 160, 64, 143, 149, 138, 65, 58, 119, 63, 166, 114, 95, 172, 43, 140, 57, 158, 186, 86, 174, 92, 45, 139, 144, 147, 148, 151, 59, 30, 85, 40, 51, 187, 78, 38, 150, 129, 121, 27, 94, 52, 177, 110, 182, 55, 22, 167, 90, 77, 6, 11, 1, 116, 53, 2, 50, 135, 180 are interleaved in the sequence.
[0571] FIG. 150 is a diagram illustrating a 31st example of a GW pattern for an LDPC code having a code length N of 69120 bits.
[0572] According to the GW pattern in FIG. 150, the sequence of bit groups 0 to 191 of the 69120-bit LDPC code is 99, 59, 95, 50, 122, 15, 144, 6, 129, 36, 175, 159, 165, 35, 182, 181, 189, 29, 2, 115, 91, 41, 60, 160, 51, 106, 168, 173, 20, 138, 183, 70, 24, 127, 47, 5, 119, 171, 102, 135, 116, 156, 120, 105, 117, 136, 149, 128, 85, 46, 186, 113, 73, 103, 52, 82, 89, 184, 22, 185, 155, 125, 133, 37, 27, 10, 137, 76, 12, 98, 148, 109, 42, 16, 190, 84, 94, 97, 25, 11, 88, 166, 131, 48, 161, 65, 9, 8, 58, 56, 124, 68, 54, 3, 169, 146, 87, 108, 110, 121, 163, 57, 90, 100, 66, 49, 61, 178, 18, 7, 28, 67, 13, 32, 34, 86, 153, 112, 63, 43, 164, 132, 118, 93, 38, 39, 17, 154, 170, 81, 141, 191, 152, 111, 188, 147, 180, 75, 72, 26, 177, 126, 179, 55, 1, 143, 45, 21, 40, 123, 23, 162, 77, 62, 134, 158, 176, 31, 69, 114, 142, 19, 96, 101, 71, 30, 140, 187, 92, 80, 79, 0, 104, 53, 145, 139, 14, 33, 74, 157, 150, 44, 172, 151, 64, 78, 130, 83, 167, 4, 107, 174 are interleaved in the sequence.
[0573] FIG. 151 is a diagram illustrating a 32nd example of a GW pattern for an LDPC code having a code length N of 69120 bits.
[0574] According to the GW pattern in FIG. 151, the sequence of bit groups 0 to 191 of the 69120-bit LDPC code is 16, 133, 14, 114, 145, 191, 53, 80, 166, 68, 21, 184, 73, 165, 147, 89, 180, 55, 135, 94, 189, 78, 103, 115, 72, 24, 105, 188, 84, 148, 85, 32, 1, 131, 34, 134, 41, 167, 81, 54, 142, 141, 75, 155, 122, 140, 13, 17, 8, 23, 61, 49, 51, 74, 181, 162, 143, 42, 71, 123, 161, 177, 110, 149, 126, 0, 63, 178, 35, 175, 186, 52, 43, 139, 112, 10, 40, 150, 182, 164, 64, 83, 174, 38, 47, 30, 2, 116, 25, 128, 160, 144, 99, 5, 187, 176, 82, 60, 18, 185, 104, 169, 39, 183, 137, 22, 109, 96, 151, 46, 33, 29, 65, 132, 95, 31, 136, 159, 170, 168, 67, 79, 93, 111, 90, 97, 113, 92, 76, 58, 127, 26, 27, 156, 3, 6, 28, 77, 125, 173, 98, 138, 172, 86, 45, 118, 171, 62, 179, 100, 19, 163, 50, 57, 56, 36, 102, 121, 117, 154, 119, 66, 20, 91, 130, 69, 44, 70, 153, 152, 158, 88, 108, 12, 59, 4, 11, 120, 87, 101, 37, 129, 146, 9, 106, 48, 7, 15, 124, 190, 107, 157 are interleaved in the sequence.
[0575] FIG. 152 is a diagram illustrating a 33rd example of a GW pattern for an LDPC code having a code length N of 69120 bits.
[0576] According to the GW pattern in FIG. 152, the sequence of bit groups 0 to 191 of the 69120-bit LDPC code is 178, 39, 54, 68, 122, 20, 86, 137, 156, 55, 52, 72, 130, 152, 147, 12, 69, 48, 107, 44, 88, 23, 181, 174, 124, 81, 59, 93, 22, 46, 82, 110, 3, 99, 75, 36, 38, 119, 131, 51, 115, 78, 84, 33, 163, 11, 2, 188, 161, 34, 89, 50, 8, 90, 109, 136, 77, 103, 67, 41, 149, 176, 134, 189, 159, 184, 153, 53, 129, 63, 160, 139, 150, 169, 148, 127, 25, 175, 142, 98, 56, 144, 102, 94, 101, 85, 132, 76, 5, 177, 0, 128, 45, 162, 92, 62, 133, 30, 17, 9, 61, 70, 154, 4, 146, 24, 135, 104, 13, 185, 79, 138, 31, 112, 1, 49, 113, 106, 100, 65, 10, 83, 73, 26, 58, 114, 66, 126, 117, 96, 186, 14, 40, 164, 158, 118, 29, 121, 151, 168, 183, 179, 16, 105, 125, 190, 116, 165, 80, 64, 170, 140, 171, 173, 97, 60, 43, 123, 71, 182, 167, 95, 145, 141, 187, 166, 87, 143, 15, 74, 111, 157, 32, 172, 18, 57, 35, 191, 27, 47, 21, 6, 19, 155, 42, 120, 180, 37, 28, 91, 108, 7 are interleaved in the sequence.
[0577] FIG. 153 is a diagram illustrating a 34th example of a GW pattern for an LDPC code having a code length N of 69120 bits.
[0578] According to the GW pattern in FIG. 153, the sequence of bit groups 0 to 191 of the 69120-bit LDPC code is 139, 112, 159, 99, 87, 70, 175, 161, 51, 56, 174, 143, 12, 36, 77, 60, 155, 167, 160, 73, 127, 82, 123, 145, 8, 76, 164, 178, 144, 86, 7, 124, 27, 187, 130, 162, 191, 182, 16, 106, 141, 38, 72, 179, 111, 29, 59, 183, 66, 52, 43, 121, 20, 11, 190, 92, 55, 166, 94, 138, 1, 122, 171, 119, 109, 58, 23, 31, 163, 53, 13, 188, 100, 158, 156, 136, 34, 118, 185, 10, 25, 126, 104, 30, 83, 47, 146, 63, 134, 39, 21, 44, 151, 28, 22, 79, 110, 71, 90, 2, 103, 42, 35, 5, 57, 4, 0, 107, 37, 54, 18, 128, 148, 129, 26, 75, 120, 19, 116, 117, 147, 114, 48, 96, 61, 46, 88, 67, 135, 65, 180, 9, 74, 176, 6, 149, 49, 50, 125, 64, 169, 168, 157, 153, 24, 108, 89, 98, 33, 132, 93, 40, 154, 62, 142, 41, 69, 105, 189, 115, 152, 45, 133, 3, 95, 17, 186, 184, 85, 165, 32, 173, 113, 172, 78, 181, 150, 170, 102, 97, 140, 81, 91, 15, 137, 101, 80, 68, 14, 177, 131, 84 are interleaved in the sequence.
[0579] FIG. 154 is a diagram illustrating a 35th example of a GW pattern for an LDPC code having a code length N of 69120 bits.
[0580] According to the GW pattern in FIG. 154, the sequence of bit groups 0 to 191 of the 69120-bit LDPC code is 21, 20, 172, 86, 178, 25, 104, 133, 17, 106, 191, 68, 80, 190, 129, 29, 125, 108, 147, 23, 94, 167, 27, 61, 12, 166, 131, 120, 159, 28, 7, 62, 134, 59, 78, 0, 121, 149, 6, 5, 143, 171, 153, 161, 186, 35, 92, 113, 55, 163, 16, 54, 93, 79, 37, 44, 75, 182, 127, 148, 179, 95, 169, 141, 38, 168, 128, 56, 31, 57, 175, 140, 164, 24, 177, 88, 51, 112, 49, 185, 170, 87, 32, 60, 65, 77, 89, 3, 18, 116, 184, 45, 109, 53, 160, 9, 100, 8, 111, 69, 189, 36, 173, 33, 72, 144, 183, 115, 137, 98, 90, 142, 30, 154, 180, 122, 155, 130, 83, 138, 14, 41, 150, 132, 70, 152, 117, 11, 4, 124, 15, 42, 181, 58, 10, 22, 145, 99, 126, 107, 66, 174, 39, 13, 97, 63, 123, 84, 85, 67, 76, 158, 71, 46, 118, 81, 162, 146, 135, 2, 73, 50, 114, 82, 103, 188, 74, 101, 157, 151, 91, 119, 102, 48, 1, 40, 43, 64, 156, 34, 110, 52, 96, 136, 139, 165, 19, 176, 187, 47, 26, 105 are interleaved in the sequence.
[0581] FIG. 155 is a diagram illustrating a 36th example of a GW pattern for an LDPC code having a code length N of 69120 bits.
[0582] According to the GW pattern in FIG. 155, the sequence of bit groups 0 to 191 of the 69120-bit LDPC code is 160, 7, 29, 39, 110, 189, 140, 143, 163, 130, 173, 71, 191, 106, 60, 62, 149, 135, 9, 147, 124, 152, 55, 116, 85, 112, 14, 20, 79, 103, 156, 167, 19, 45, 73, 26, 159, 44, 86, 76, 56, 12, 109, 117, 128, 67, 150, 151, 31, 27, 133, 17, 120, 153, 108, 180, 52, 187, 98, 63, 176, 186, 179, 113, 161, 32, 24, 111, 41, 95, 38, 10, 154, 97, 141, 2, 127, 40, 105, 34, 11, 185, 155, 61, 114, 74, 158, 162, 5, 177, 43, 51, 148, 137, 28, 181, 171, 13, 104, 42, 168, 93, 172, 144, 80, 123, 89, 81, 68, 75, 78, 121, 53, 65, 122, 142, 157, 107, 136, 66, 90, 23, 8, 1, 77, 54, 125, 174, 35, 88, 82, 134, 101, 131, 33, 50, 87, 36, 15, 47, 83, 18, 6, 21, 30, 94, 72, 145, 138, 184, 69, 84, 58, 49, 16, 48, 70, 183, 3, 92, 25, 115, 0, 182, 139, 91, 146, 102, 96, 100, 119, 129, 178, 46, 37, 57, 118, 126, 59, 165, 170, 190, 188, 175, 166, 99, 4, 22, 132, 164, 64, 169 are interleaved in the sequence.
[0583] FIG. 156 is a diagram illustrating a 37th example of a GW pattern for an LDPC code having a code length N of 69120 bits.
[0584] According to the GW pattern in FIG. 156, the sequence of bit groups 0 to 191 of the 69120-bit LDPC code is 167, 97, 86, 166, 11, 57, 187, 169, 104, 102, 108, 63, 12, 181, 1, 71, 134, 152, 45, 144, 124, 22, 0, 51, 100, 150, 179, 54, 66, 79, 25, 172, 59, 48, 23, 55, 64, 185, 164, 123, 56, 80, 153, 9, 177, 176, 81, 17, 14, 43, 76, 27, 175, 60, 133, 91, 61, 41, 111, 163, 72, 95, 84, 67, 129, 52, 88, 121, 7, 49, 168, 154, 74, 138, 142, 158, 132, 127, 40, 139, 20, 44, 6, 128, 75, 114, 119, 2, 8, 157, 98, 118, 89, 46, 160, 190, 5, 165, 28, 68, 189, 161, 112, 173, 148, 183, 33, 131, 105, 186, 156, 70, 117, 170, 174, 36, 19, 135, 125, 122, 50, 113, 141, 37, 38, 31, 94, 149, 78, 32, 178, 34, 107, 13, 182, 146, 93, 10, 106, 109, 4, 77, 87, 3, 184, 83, 30, 180, 96, 15, 155, 110, 145, 191, 151, 101, 65, 99, 115, 140, 26, 147, 42, 136, 137, 18, 53, 116, 171, 16, 21, 92, 162, 130, 85, 69, 47, 35, 82, 120, 24, 73, 39, 58, 62, 126, 29, 90, 143, 159, 188, 103 are interleaved in the sequence.
[0585] FIG. 157 is a diagram illustrating a 38th example of a GW pattern for an LDPC code having a code length N of 69120 bits.
[0586] According to the GW pattern in FIG. 157, the sequence of bit groups 0 to 191 of the 69120-bit LDPC code is 74, 151, 79, 49, 174, 180, 133, 106, 116, 16, 163, 62, 164, 45, 187, 128, 176, 2, 126, 136, 63, 28, 118, 173, 19, 46, 93, 121, 162, 88, 0, 147, 131, 54, 117, 138, 69, 182, 68, 143, 78, 15, 7, 59, 109, 32, 10, 179, 165, 90, 73, 71, 171, 135, 123, 125, 31, 22, 70, 185, 155, 60, 120, 113, 41, 154, 177, 85, 64, 55, 26, 129, 84, 38, 166, 44, 30, 183, 189, 191, 124, 77, 80, 98, 190, 167, 140, 52, 153, 43, 25, 188, 103, 152, 137, 76, 149, 34, 172, 122, 40, 168, 141, 96, 142, 58, 110, 65, 9, 36, 42, 50, 184, 105, 156, 127, 8, 61, 146, 169, 181, 5, 87, 150, 91, 17, 18, 24, 112, 81, 170, 95, 29, 100, 130, 48, 159, 72, 75, 160, 27, 108, 148, 66, 144, 97, 57, 115, 114, 1, 132, 4, 21, 92, 11, 107, 175, 67, 145, 14, 186, 20, 51, 39, 3, 86, 89, 47, 53, 102, 82, 139, 23, 104, 157, 99, 158, 12, 161, 35, 178, 37, 134, 83, 94, 101, 111, 119, 6, 33, 13, 56 are interleaved in the sequence.
[0587] FIG. 158 is a diagram showing a 39th example of a GW pattern for an LDPC code having a code length N of 69120 bits.
[0588] According to the GW pattern in FIG. 158, the sequence of bit groups 0 to 191 of the 69120-bit LDPC code is 20, 118, 185, 106, 82, 53, 41, 40, 121, 180, 45, 10, 145, 175, 191, 160, 177, 172, 13, 29, 133, 42, 89, 51, 141, 99, 7, 134, 52, 48, 169, 162, 124, 25, 165, 128, 95, 148, 98, 171, 14, 75, 59, 26, 76, 47, 34, 122, 69, 131, 105, 60, 132, 63, 81, 109, 43, 189, 19, 186, 79, 62, 85, 54, 16, 46, 27, 44, 139, 113, 11, 102, 130, 184, 119, 1, 152, 146, 37, 178, 61, 150, 32, 163, 92, 166, 142, 67, 140, 157, 188, 18, 87, 149, 65, 183, 161, 5, 31, 71, 173, 73, 15, 138, 156, 28, 66, 170, 179, 135, 86, 39, 104, 17, 154, 174, 56, 153, 0, 97, 9, 72, 23, 167, 190, 80, 3, 38, 120, 4, 24, 159, 12, 103, 22, 125, 83, 50, 6, 77, 168, 74, 93, 49, 57, 147, 2, 155, 181, 96, 114, 107, 110, 30, 117, 127, 101, 94, 129, 35, 58, 70, 126, 182, 151, 111, 91, 64, 88, 144, 137, 143, 176, 84, 136, 8, 112, 123, 164, 115, 78, 36, 90, 100, 55, 108, 21, 158, 68, 33, 116, 187 are interleaved in the sequence.
[0589] FIG. 159 is a diagram showing a 40th example of a GW pattern for an LDPC code having a code length N of 69120 bits.
[0590] According to the GW pattern in FIG. 159, the sequence of bit groups 0 to 191 of the 69120-bit LDPC code is 42, 43, 190, 119, 183, 103, 51, 28, 171, 20, 18, 25, 85, 22, 157, 99, 174, 5, 53, 62, 150, 128, 38, 153, 37, 148, 39, 24, 118, 102, 184, 49, 111, 48, 87, 76, 81, 40, 55, 82, 70, 105, 66, 115, 14, 86, 88, 135, 168, 139, 56, 80, 93, 95, 165, 13, 4, 100, 29, 104, 11, 72, 116, 83, 112, 67, 186, 169, 8, 57, 44, 17, 164, 31, 96, 84, 2, 125, 59, 3, 6, 173, 149, 78, 27, 160, 156, 187, 34, 129, 154, 79, 52, 117, 110, 0, 7, 113, 137, 26, 47, 12, 178, 46, 136, 97, 15, 188, 101, 58, 35, 71, 32, 16, 109, 163, 134, 75, 68, 98, 132, 90, 124, 189, 121, 123, 170, 158, 159, 77, 108, 63, 180, 36, 74, 127, 21, 146, 147, 54, 155, 10, 144, 130, 60, 1, 141, 23, 177, 133, 50, 126, 167, 151, 161, 191, 91, 114, 162, 30, 181, 182, 9, 94, 69, 176, 65, 142, 152, 175, 73, 140, 41, 179, 172, 145, 64, 19, 138, 131, 166, 33, 107, 185, 106, 122, 120, 92, 45, 143, 61, 89 are interleaved in the sequence.
[0591] FIG. 160 is a diagram showing a 41st example of a GW pattern for an LDPC code having a code length N of 69120 bits.
[0592] According to the GW pattern in FIG. 160, the sequence of bit groups 0 to 191 of the 69120-bit LDPC code is 111, 33, 21, 133, 18, 30, 73, 139, 125, 35, 77, 105, 122, 91, 41, 86, 11, 8, 55, 71, 151, 107, 45, 12, 168, 51, 50, 59, 7, 132, 144, 16, 190, 31, 108, 89, 124, 110, 94, 67, 159, 46, 140, 87, 54, 142, 185, 85, 84, 120, 178, 101, 180, 20, 174, 47, 28, 145, 70, 24, 131, 4, 83, 56, 79, 37, 27, 109, 92, 52, 96, 177, 141, 188, 155, 38, 156, 169, 136, 81, 137, 112, 95, 93, 106, 149, 138, 15, 39, 170, 146, 103, 184, 43, 5, 9, 189, 34, 19, 63, 90, 36, 23, 78, 100, 75, 162, 42, 161, 119, 64, 65, 152, 62, 173, 104, 88, 118, 48, 44, 40, 60, 102, 61, 74, 99, 53, 10, 6, 172, 186, 163, 134, 14, 148, 3, 26, 1, 157, 150, 25, 123, 115, 116, 57, 175, 127, 82, 117, 114, 160, 164, 153, 176, 76, 13, 181, 68, 128, 0, 183, 49, 22, 166, 17, 191, 135, 165, 72, 158, 130, 154, 167, 66, 2, 147, 69, 58, 98, 97, 143, 32, 29, 179, 113, 80, 182, 129, 126, 171, 121, 187 are interleaved in the sequence.
[0593] FIG. 161 is a diagram showing a 42nd example of a GW pattern for an LDPC code having a code length N of 69120 bits.
[0594] According to the GW pattern in FIG. 161, the sequence of bit groups 0 to 191 of the 69120-bit LDPC code is 148, 32, 94, 31, 146, 15, 41, 7, 79, 58, 52, 167, 154, 4, 161, 38, 64, 127, 131, 78, 34, 125, 171, 173, 133, 122, 50, 95, 129, 57, 71, 37, 137, 69, 82, 107, 26, 10, 140, 156, 47, 178, 163, 117, 139, 174, 143, 138, 111, 11, 166, 43, 141, 114, 45, 39, 177, 103, 96, 123, 63, 23, 18, 20, 187, 27, 66, 130, 65, 142, 5, 135, 113, 90, 121, 54, 190, 134, 153, 147, 92, 157, 3, 97, 102, 106, 172, 91, 46, 89, 56, 184, 115, 99, 62, 93, 100, 88, 152, 109, 124, 182, 70, 74, 159, 165, 60, 183, 185, 164, 175, 108, 176, 2, 118, 72, 151, 0, 51, 33, 28, 80, 14, 128, 179, 84, 77, 42, 55, 160, 119, 110, 86, 22, 101, 13, 170, 36, 104, 189, 191, 169, 112, 12, 29, 30, 162, 136, 24, 68, 9, 81, 120, 145, 180, 144, 73, 21, 44, 1, 16, 67, 19, 158, 188, 181, 61, 35, 8, 53, 168, 150, 105, 59, 87, 6, 126, 75, 85, 17, 83, 98, 48, 132, 40, 76, 49, 25, 149, 186, 155, 116 are interleaved in the sequence.
[0595] FIG. 162 is a diagram showing a 43rd example of a GW pattern for an LDPC code having a code length N of 69120 bits.
[0596] According to the GW pattern in FIG. 162, the sequence of bit groups 0 to 191 of the 69120-bit LDPC code is 161, 38, 41, 138, 20, 24, 14, 35, 32, 179, 68, 97, 94, 142, 43, 53, 22, 28, 44, 81, 148, 187, 169, 89, 115, 144, 75, 40, 31, 152, 30, 124, 80, 135, 160, 8, 129, 147, 60, 112, 171, 0, 133, 100, 156, 180, 77, 110, 151, 69, 95, 25, 117, 127, 154, 64, 146, 143, 29, 168, 177, 183, 126, 10, 26, 3, 50, 92, 164, 163, 11, 109, 21, 37, 84, 122, 49, 71, 52, 15, 88, 149, 86, 61, 90, 155, 162, 9, 153, 67, 119, 189, 82, 131, 190, 4, 46, 118, 47, 178, 59, 150, 186, 123, 18, 79, 57, 120, 70, 62, 137, 23, 185, 167, 175, 16, 134, 73, 139, 166, 55, 165, 116, 76, 99, 182, 78, 93, 141, 33, 176, 101, 130, 58, 12, 17, 132, 45, 102, 7, 19, 145, 54, 91, 113, 36, 27, 114, 174, 39, 83, 140, 191, 74, 56, 87, 48, 158, 121, 159, 136, 63, 181, 34, 173, 103, 42, 125, 104, 107, 96, 65, 1, 13, 157, 184, 170, 105, 188, 108, 6, 2, 98, 72, 5, 66, 128, 106, 172, 111, 85, 51 are interleaved in the sequence.
[0597] FIG. 163 is a diagram showing a 44th example of a GW pattern for an LDPC code having a code length N of 69120 bits.
[0598] According to the GW pattern in FIG. 163, the sequence of bit groups 0 to 191 of the 69120-bit LDPC code is 57, 73, 173, 63, 179, 186, 148, 181, 160, 163, 4, 109, 137, 99, 118, 15, 5, 115, 44, 153, 185, 40, 12, 169, 2, 37, 188, 97, 65, 67, 117, 90, 66, 135, 154, 159, 146, 86, 61, 182, 59, 83, 91, 175, 58, 138, 93, 43, 98, 22, 152, 96, 45, 120, 180, 10, 116, 170, 162, 68, 3, 13, 41, 131, 21, 172, 55, 24, 1, 79, 106, 189, 52, 184, 112, 53, 136, 166, 29, 62, 107, 128, 71, 111, 187, 161, 101, 49, 155, 28, 94, 70, 48, 0, 33, 157, 151, 25, 89, 88, 114, 134, 75, 87, 142, 6, 27, 64, 69, 19, 150, 38, 35, 130, 127, 76, 102, 123, 158, 129, 133, 110, 141, 95, 7, 126, 85, 108, 174, 190, 165, 156, 171, 54, 17, 121, 103, 14, 36, 105, 82, 8, 178, 51, 23, 84, 167, 30, 100, 42, 72, 149, 92, 77, 104, 183, 39, 125, 80, 143, 144, 56, 119, 16, 132, 139, 191, 50, 164, 122, 46, 140, 31, 176, 60, 26, 32, 11, 177, 124, 74, 145, 20, 34, 18, 81, 168, 9, 78, 113, 147, 47 are interleaved in the sequence.
[0599] FIG. 164 is a diagram showing a 45th example of a GW pattern for an LDPC code having a code length N of 69120 bits.
[0600] According to the GW pattern in FIG. 164, the sequence of bit groups 0 to 191 of the 69120-bit LDPC code is 89, 123, 13, 47, 178, 159, 1, 190, 53, 12, 57, 109, 115, 19, 36, 143, 82, 96, 163, 66, 154, 173, 49, 65, 131, 2, 78, 15, 155, 90, 38, 130, 63, 188, 138, 184, 166, 102, 139, 28, 50, 186, 17, 20, 112, 41, 11, 8, 59, 79, 45, 162, 146, 40, 43, 129, 119, 18, 157, 37, 126, 124, 110, 191, 85, 165, 60, 142, 135, 74, 187, 179, 141, 164, 34, 69, 26, 33, 113, 120, 95, 169, 30, 0, 175, 70, 91, 104, 140, 25, 132, 23, 105, 158, 171, 6, 121, 56, 22, 127, 54, 68, 107, 133, 84, 81, 150, 99, 73, 185, 67, 29, 151, 87, 10, 167, 148, 72, 147, 5, 31, 125, 145, 4, 52, 44, 134, 83, 46, 75, 152, 62, 7, 86, 172, 180, 111, 61, 9, 58, 14, 116, 92, 170, 93, 77, 88, 42, 21, 106, 97, 144, 182, 108, 55, 94, 122, 114, 153, 64, 24, 80, 117, 3, 177, 149, 76, 128, 136, 39, 181, 160, 103, 174, 156, 27, 183, 16, 137, 101, 161, 176, 35, 118, 98, 168, 48, 100, 71, 189, 32, 51 are interleaved in the sequence.
[0601] FIG. 165 is a diagram showing a 46th example of a GW pattern for an LDPC code having a code length N of 69120 bits.
[0602] According to the GW pattern in FIG. 165, the sequence of bit groups 0 to 191 of the 69120-bit LDPC code is 116, 157, 105, 191, 110, 149, 0, 186, 88, 165, 141, 179, 160, 121, 35, 170, 97, 7, 181, 31, 130, 123, 184, 34, 101, 167, 68, 135, 18, 91, 159, 81, 53, 36, 164, 139, 61, 162, 79, 4, 176, 127, 42, 148, 147, 150, 55, 109, 132, 124, 9, 66, 14, 128, 134, 27, 29, 59, 153, 22, 120, 13, 187, 112, 69, 163, 11, 70, 58, 15, 25, 102, 188, 182, 156, 20, 17, 10, 32, 76, 5, 28, 46, 166, 140, 143, 65, 63, 107, 119, 87, 145, 62, 108, 189, 114, 71, 78, 122, 93, 37, 12, 137, 118, 56, 67, 98, 113, 173, 169, 39, 51, 177, 1, 84, 40, 158, 2, 144, 73, 43, 82, 92, 16, 133, 129, 99, 86, 57, 47, 183, 171, 131, 33, 26, 168, 155, 178, 175, 64, 52, 100, 142, 90, 8, 106, 45, 19, 24, 80, 146, 136, 125, 95, 172, 104, 154, 138, 6, 85, 94, 74, 151, 44, 174, 115, 185, 89, 23, 190, 111, 72, 180, 54, 77, 75, 117, 126, 49, 103, 48, 60, 83, 3, 21, 50, 161, 30, 96, 152, 41, 38 are interleaved in the sequence.
[0603] FIG. 166 is a diagram illustrating a 47th example of a GW pattern for an LDPC code having a code length N of 69120 bits.
[0604] According to the GW pattern in FIG. 166, the sequence of bit groups 0 to 191 of the 69120-bit LDPC code is 115, 167, 98, 128, 174, 73, 109, 79, 40, 6, 190, 113, 158, 56, 183, 61, 134, 13, 32, 133, 173, 1, 76, 151, 147, 70, 155, 77, 51, 150, 146, 12, 186, 33, 74, 171, 53, 11, 17, 68, 136, 9, 181, 91, 125, 161, 42, 124, 72, 96, 101, 81, 84, 107, 63, 55, 65, 5, 163, 157, 135, 18, 130, 120, 87, 85, 47, 187, 3, 46, 49, 112, 159, 188, 169, 127, 78, 25, 83, 45, 143, 182, 59, 36, 19, 110, 39, 43, 35, 15, 90, 180, 82, 145, 48, 34, 144, 178, 177, 86, 27, 103, 94, 62, 170, 57, 154, 166, 54, 164, 20, 185, 29, 2, 16, 60, 37, 75, 10, 162, 116, 92, 71, 106, 105, 175, 44, 108, 50, 26, 7, 176, 38, 99, 4, 122, 52, 66, 0, 140, 184, 24, 80, 97, 23, 114, 30, 126, 148, 64, 119, 165, 137, 123, 95, 111, 160, 8, 153, 149, 172, 121, 129, 28, 104, 156, 100, 189, 14, 138, 88, 118, 139, 93, 191, 31, 131, 179, 152, 89, 22, 41, 168, 117, 21, 69, 132, 102, 58, 67, 142, 141 are interleaved in the sequence.
[0605] FIG. 167 is a diagram showing a 48th example of a GW pattern for an LDPC code having a code length N of 69120 bits.
[0606] According to the GW pattern in FIG. 167, the sequence of bit groups 0 to 191 of the 69120-bit LDPC code is 31, 178, 143, 125, 159, 168, 34, 127, 158, 157, 21, 124, 153, 162, 59, 156, 165, 40, 108, 43, 98, 119, 33, 13, 175, 166, 117, 25, 63, 111, 74, 1, 38, 169, 131, 100, 164, 0, 171, 101, 151, 113, 20, 185, 17, 86, 146, 11, 12, 19, 145, 85, 3, 80, 133, 93, 10, 72, 152, 172, 140, 45, 115, 79, 161, 39, 99, 5, 37, 110, 155, 170, 123, 70, 52, 81, 65, 160, 132, 103, 9, 88, 15, 130, 71, 129, 177, 128, 121, 150, 36, 35, 163, 83, 142, 105, 48, 64, 82, 46, 148, 138, 147, 149, 27, 56, 47, 50, 42, 54, 182, 23, 97, 89, 167, 141, 75, 32, 118, 44, 96, 66, 73, 190, 181, 191, 92, 53, 87, 176, 102, 144, 28, 134, 77, 184, 189, 67, 187, 174, 49, 94, 68, 18, 186, 26, 120, 62, 136, 24, 4, 16, 61, 179, 106, 95, 135, 41, 173, 154, 78, 2, 22, 139, 76, 58, 90, 137, 114, 126, 51, 84, 14, 91, 183, 180, 112, 122, 30, 29, 69, 107, 116, 55, 8, 104, 6, 60, 57, 7, 109, 188 are interleaved in the sequence.
[0607] FIG. 168 is a diagram showing a 49th example of a GW pattern for an LDPC code having a code length N of 69120 bits.
[0608] According to the GW pattern in FIG. 168, the sequence of bit groups 0 to 191 of the 69120-bit LDPC code is 36, 20, 126, 165, 181, 59, 90, 186, 191, 120, 182, 170, 171, 137, 62, 84, 146, 106, 64, 129, 56, 136, 57, 108, 190, 74, 70, 10, 68, 139, 35, 104, 63, 16, 19, 66, 1, 15, 61, 97, 172, 72, 26, 141, 80, 151, 138, 156, 46, 82, 95, 142, 77, 76, 17, 102, 92, 60, 148, 99, 140, 2, 78, 145, 29, 174, 32, 103, 3, 133, 163, 23, 150, 155, 44, 185, 65, 134, 184, 11, 38, 119, 117, 167, 79, 5, 130, 94, 33, 157, 154, 109, 30, 31, 160, 96, 49, 178, 110, 128, 166, 7, 162, 48, 34, 55, 22, 143, 149, 121, 89, 114, 176, 107, 67, 73, 51, 53, 132, 83, 158, 69, 153, 180, 188, 101, 37, 179, 111, 71, 147, 189, 124, 43, 86, 98, 91, 45, 135, 168, 183, 42, 27, 81, 152, 164, 58, 100, 25, 4, 13, 144, 112, 122, 159, 187, 52, 85, 50, 9, 87, 127, 169, 173, 14, 93, 116, 175, 177, 24, 40, 0, 28, 12, 161, 105, 41, 75, 123, 39, 125, 18, 54, 6, 131, 118, 115, 88, 8, 113, 21, 47 are interleaved in the sequence.
[0609] FIG. 169 is a diagram showing the 50th example of a GW pattern for an LDPC code having a code length N of 69120 bits.
[0610] According to the GW pattern in FIG. 169, the sequence of bit groups 0 to 191 of the 69120-bit LDPC code is 12, 183, 40, 66, 35, 155, 137, 58, 108, 93, 47, 78, 56, 122, 51, 114, 10, 164, 148, 190, 53, 76, 75, 11, 46, 2, 174, 146, 119, 170, 98, 22, 116, 28, 67, 63, 59, 154, 94, 105, 187, 9, 97, 166, 19, 125, 189, 185, 178, 115, 123, 150, 60, 77, 86, 69, 26, 145, 143, 134, 124, 111, 162, 141, 80, 34, 138, 130, 45, 33, 127, 37, 91, 84, 102, 13, 16, 172, 61, 182, 57, 55, 101, 142, 117, 87, 131, 188, 191, 113, 39, 54, 74, 72, 29, 48, 161, 139, 151, 180, 1, 160, 103, 173, 15, 52, 186, 133, 71, 132, 31, 135, 70, 81, 24, 112, 6, 175, 96, 3, 79, 156, 109, 8, 153, 90, 177, 49, 99, 128, 21, 7, 158, 89, 92, 126, 32, 121, 100, 88, 163, 136, 20, 83, 17, 42, 95, 129, 118, 43, 157, 50, 5, 179, 140, 147, 62, 38, 176, 149, 159, 44, 106, 152, 65, 14, 168, 184, 0, 107, 167, 36, 73, 110, 165, 120, 104, 23, 25, 82, 27, 41, 181, 169, 85, 144, 4, 18, 171, 30, 68, 64 are interleaved in the sequence.
[0611] FIG. 170 is a diagram showing a 51st example of a GW pattern for an LDPC code having a code length N of 69120 bits.
[0612] According to the GW pattern in FIG. 170, the sequence of bit groups 0 to 191 of the 69120-bit LDPC code is 140, 166, 22, 87, 107, 121, 66, 80, 85, 109, 45, 13, 144, 63, 0, 52, 131, 122, 135, 173, 105, 98, 117, 168, 8, 123, 157, 93, 129, 37, 119, 143, 40, 59, 162, 21, 79, 102, 34, 36, 32, 41, 177, 48, 83, 94, 191, 78, 101, 155, 160, 189, 77, 57, 11, 148, 124, 65, 187, 110, 100, 114, 67, 150, 82, 156, 43, 5, 1, 126, 46, 167, 149, 72, 31, 161, 23, 113, 137, 132, 35, 76, 26, 61, 141, 15, 4, 25, 17, 182, 92, 29, 27, 73, 170, 53, 64, 127, 112, 171, 56, 106, 186, 183, 95, 165, 10, 103, 74, 84, 116, 20, 185, 6, 133, 147, 75, 62, 14, 142, 44, 181, 146, 164, 128, 9, 60, 50, 91, 88, 97, 145, 28, 7, 118, 99, 115, 39, 125, 136, 180, 179, 96, 175, 3, 47, 158, 172, 154, 138, 176, 33, 81, 134, 120, 174, 151, 49, 30, 108, 68, 38, 153, 2, 69, 111, 54, 130, 71, 24, 58, 178, 19, 42, 51, 190, 89, 16, 90, 169, 70, 18, 86, 184, 12, 188, 163, 55, 139, 104, 152, 159 are interleaved in the sequence.
[0613] FIG. 171 is a diagram illustrating a 52nd example of a GW pattern for an LDPC code having a code length N of 69120 bits.
[0614] According to the GW pattern in FIG. 171, the sequence of bit groups 0 to 191 of the 69120-bit LDPC code is 128, 120, 91, 121, 189, 30, 127, 35, 76, 26, 144, 45, 178, 93, 14, 31, 123, 155, 19, 28, 152, 174, 177, 168, 56, 169, 95, 7, 96, 133, 136, 146, 172, 187, 90, 44, 98, 150, 40, 20, 104, 191, 37, 61, 42, 43, 27, 159, 163, 100, 164, 151, 111, 102, 165, 132, 138, 180, 22, 70, 184, 62, 167, 134, 60, 160, 175, 157, 153, 77, 87, 185, 116, 115, 176, 78, 5, 39, 88, 33, 126, 13, 71, 188, 171, 135, 21, 16, 143, 51, 99, 182, 85, 129, 162, 66, 0, 55, 73, 117, 75, 181, 179, 53, 170, 1, 125, 69, 80, 83, 57, 38, 103, 109, 137, 63, 74, 9, 15, 118, 67, 2, 113, 124, 114, 6, 154, 141, 50, 149, 4, 46, 8, 130, 94, 34, 23, 54, 145, 81, 58, 82, 139, 156, 108, 140, 166, 36, 183, 110, 101, 161, 84, 119, 92, 3, 142, 186, 158, 173, 147, 49, 10, 32, 65, 89, 86, 131, 18, 47, 107, 79, 72, 25, 68, 122, 29, 11, 41, 190, 59, 52, 97, 148, 12, 24, 105, 17, 106, 48, 64, 112 are interleaved in the sequence.
[0615] FIG. 172 is a diagram showing a 53rd example of a GW pattern for an LDPC code having a code length N of 69120 bits.
[0616] According to the GW pattern in FIG. 172, the sequence of bit groups 0 to 191 of the 69120-bit LDPC code is 36, 180, 61, 100, 163, 168, 14, 24, 105, 104, 131, 56, 40, 73, 165, 157, 126, 47, 160, 181, 166, 161, 1, 81, 58, 182, 189, 177, 85, 17, 13, 46, 171, 149, 91, 79, 109, 133, 164, 125, 52, 77, 118, 186, 107, 150, 135, 33, 130, 87, 167, 158, 23, 83, 152, 114, 68, 12, 132, 178, 106, 184, 176, 72, 31, 53, 21, 110, 76, 146, 4, 18, 113, 65, 34, 179, 111, 185, 84, 144, 27, 39, 151, 50, 69, 30, 169, 175, 9, 42, 54, 43, 90, 22, 139, 129, 170, 115, 45, 140, 67, 25, 155, 82, 102, 29, 188, 108, 15, 80, 128, 48, 0, 64, 141, 93, 191, 190, 174, 32, 35, 119, 159, 41, 55, 162, 49, 59, 88, 156, 123, 136, 28, 60, 26, 16, 89, 147, 92, 98, 38, 20, 173, 71, 44, 94, 5, 7, 99, 75, 122, 120, 66, 121, 112, 62, 8, 137, 142, 103, 116, 117, 37, 63, 70, 86, 10, 74, 95, 11, 134, 154, 51, 101, 127, 183, 57, 97, 78, 148, 6, 172, 3, 138, 145, 153, 143, 19, 2, 96, 187, 124 are interleaved in the sequence.
[0617] FIG. 173 is a diagram showing a 54th example of a GW pattern for an LDPC code having a code length N of 69120 bits.
[0618] According to the GW pattern in FIG. 173, the sequence of bit groups 0 to 191 of the 69120-bit LDPC code is 92, 83, 138, 67, 27, 88, 13, 26, 73, 16, 187, 18, 76, 28, 79, 130, 91, 58, 140, 38, 6, 43, 17, 168, 141, 96, 70, 147, 112, 164, 97, 161, 139, 65, 78, 95, 146, 3, 32, 158, 24, 0, 94, 120, 176, 128, 59, 81, 21, 102, 190, 8, 114, 113, 29, 45, 103, 56, 54, 173, 177, 12, 174, 108, 169, 148, 123, 129, 150, 77, 157, 184, 61, 127, 121, 156, 104, 111, 68, 160, 107, 117, 124, 84, 35, 10, 90, 106, 144, 66, 64, 15, 46, 125, 44, 37, 20, 135, 53, 71, 152, 183, 162, 50, 167, 11, 142, 149, 131, 191, 166, 31, 185, 134, 19, 178, 52, 188, 2, 75, 110, 145, 41, 159, 136, 100, 9, 62, 60, 34, 116, 23, 42, 105, 40, 118, 186, 4, 5, 182, 170, 87, 1, 22, 55, 126, 63, 14, 25, 153, 98, 49, 33, 69, 179, 171, 93, 36, 133, 57, 151, 82, 72, 163, 86, 47, 119, 48, 99, 30, 189, 115, 165, 101, 80, 175, 132, 89, 39, 181, 85, 51, 154, 137, 7, 180, 155, 74, 109, 122, 172, 143 are interleaved in the sequence.
[0619] FIG. 174 is a diagram showing the 55th example of a GW pattern for an LDPC code having a code length N of 69120 bits.
[0620] According to the GW pattern in FIG. 174, the sequence of bit groups 0 to 191 of the 69120-bit LDPC code is 52, 117, 42, 131, 45, 120, 44, 63, 91, 0, 33, 176, 95, 36, 134, 170, 148, 32, 130, 20, 124, 51, 152, 96, 92, 90, 184, 103, 53, 14, 110, 80, 107, 145, 181, 137, 61, 149, 114, 126, 136, 161, 58, 162, 88, 8, 171, 178, 174, 94, 118, 19, 35, 1, 191, 115, 23, 10, 150, 67, 46, 56, 172, 129, 109, 98, 89, 68, 101, 121, 78, 182, 12, 173, 128, 77, 168, 156, 186, 165, 39, 187, 5, 158, 104, 2, 49, 154, 59, 82, 65, 30, 127, 17, 113, 164, 179, 34, 69, 189, 123, 147, 183, 21, 163, 143, 57, 100, 28, 185, 25, 140, 13, 66, 141, 62, 47, 54, 169, 106, 38, 86, 116, 151, 41, 4, 75, 108, 85, 153, 72, 125, 22, 135, 50, 70, 74, 11, 76, 138, 132, 55, 167, 40, 144, 31, 142, 37, 29, 99, 83, 26, 119, 64, 27, 9, 15, 97, 73, 133, 79, 190, 111, 43, 48, 102, 7, 139, 84, 24, 112, 177, 16, 180, 175, 81, 3, 60, 18, 188, 93, 105, 157, 87, 166, 159, 155, 122, 146, 6, 160, 71 are interleaved in the sequence.
[0621] FIG. 175 is a diagram showing a 56th example of a GW pattern for an LDPC code having a code length N of 69120 bits.
[0622] According to the GW pattern in FIG. 175, the sequence of bit groups 0 to 191 of the 69120-bit LDPC code is 60, 117, 182, 104, 53, 26, 11, 121, 71, 32, 179, 34, 38, 145, 166, 65, 137, 7, 124, 58, 90, 29, 144, 116, 91, 88, 98, 161, 83, 177, 85, 154, 146, 178, 123, 76, 75, 3, 64, 151, 99, 118, 57, 106, 16, 61, 162, 19, 12, 94, 39, 93, 92, 73, 82, 138, 108, 139, 130, 163, 152, 159, 168, 189, 102, 134, 101, 66, 4, 171, 170, 188, 107, 23, 180, 35, 175, 18, 89, 181, 17, 97, 62, 56, 52, 128, 40, 25, 191, 74, 95, 143, 5, 8, 1, 132, 133, 135, 184, 33, 37, 45, 127, 122, 136, 190, 158, 72, 77, 114, 46, 55, 105, 78, 183, 103, 22, 20, 24, 155, 86, 63, 79, 164, 13, 174, 2, 14, 47, 126, 84, 165, 59, 142, 87, 153, 112, 43, 156, 50, 6, 0, 81, 51, 21, 9, 148, 111, 147, 48, 31, 36, 129, 167, 150, 70, 42, 15, 110, 119, 109, 125, 80, 27, 131, 49, 140, 187, 96, 120, 100, 141, 160, 186, 185, 68, 69, 28, 176, 169, 44, 173, 149, 54, 115, 113, 67, 10, 157, 41, 30, 172 are interleaved in the sequence.
[0623] FIG. 176 is a diagram showing the 57th example of a GW pattern for an LDPC code having a code length N of 69120 bits.
[0624] According to the GW pattern in FIG. 176, the sequence of bit groups 0 to 191 of the 69120-bit LDPC code is 7, 156, 171, 76, 165, 68, 5, 72, 86, 57, 42, 98, 162, 130, 88, 31, 63, 170, 92, 100, 145, 146, 117, 62, 123, 55, 22, 138, 75, 99, 177, 83, 135, 190, 79, 84, 182, 140, 136, 0, 108, 77, 8, 154, 73, 37, 147, 14, 10, 128, 111, 168, 38, 159, 125, 32, 120, 132, 148, 27, 69, 96, 127, 103, 34, 110, 161, 41, 18, 35, 142, 116, 28, 121, 91, 112, 51, 178, 139, 95, 155, 20, 78, 33, 133, 29, 9, 54, 24, 176, 122, 3, 102, 56, 181, 175, 174, 81, 166, 30, 26, 43, 113, 137, 150, 89, 179, 70, 11, 2, 118, 183, 13, 50, 46, 12, 49, 40, 172, 17, 47, 65, 16, 74, 141, 129, 101, 48, 87, 187, 167, 134, 158, 15, 44, 53, 93, 152, 23, 126, 52, 97, 189, 36, 115, 169, 64, 25, 58, 82, 1, 45, 39, 191, 144, 173, 6, 60, 85, 149, 163, 21, 90, 4, 80, 105, 164, 180, 61, 114, 188, 151, 185, 94, 124, 104, 106, 119, 107, 160, 67, 71, 19, 131, 186, 153, 157, 66, 143, 184, 109, 59 are interleaved in the sequence.
[0625] FIG. 177 is a diagram showing the 58th example of a GW pattern for an LDPC code having a code length N of 69120 bits.
[0626] According to the GW pattern in FIG. 177, the sequence of bit groups 0 to 191 of the 69120-bit LDPC code is 134, 124, 102, 133, 161, 34, 18, 17, 119, 172, 43, 25, 130, 84, 46, 167, 23, 100, 31, 121, 30, 15, 99, 127, 62, 20, 143, 103, 139, 171, 13, 42, 1, 26, 76, 159, 27, 82, 48, 146, 22, 156, 188, 69, 86, 177, 129, 160, 33, 67, 176, 148, 168, 158, 169, 0, 155, 118, 154, 110, 96, 191, 4, 36, 39, 56, 112, 14, 145, 182, 3, 88, 126, 91, 105, 174, 128, 157, 125, 74, 116, 61, 52, 187, 117, 98, 73, 95, 92, 181, 111, 65, 63, 152, 163, 147, 66, 178, 87, 179, 64, 93, 144, 83, 140, 8, 78, 2, 131, 115, 123, 47, 94, 186, 28, 68, 21, 135, 37, 151, 11, 104, 77, 81, 35, 71, 162, 97, 41, 58, 190, 101, 153, 85, 166, 7, 173, 44, 29, 10, 49, 54, 150, 32, 50, 51, 45, 183, 107, 113, 137, 80, 79, 175, 142, 141, 138, 40, 122, 75, 120, 53, 59, 60, 184, 5, 38, 6, 164, 189, 24, 16, 72, 19, 109, 106, 114, 108, 185, 165, 149, 9, 57, 170, 12, 90, 180, 89, 132, 136, 55, 70 are interleaved in the sequence.
[0627] FIG. 178 is a diagram showing a 59th example of a GW pattern for an LDPC code having a code length N of 69120 bits.
[0628] According to the GW pattern in FIG. 178, the sequence of bit groups 0 to 191 of the 69120-bit LDPC code is 18, 161, 152, 30, 91, 138, 83, 88, 127, 54, 33, 46, 125, 120, 122, 169, 51, 150, 100, 52, 95, 186, 149, 81, 11, 53, 164, 130, 19, 176, 93, 107, 29, 86, 124, 65, 75, 71, 74, 68, 44, 82, 59, 104, 118, 103, 131, 101, 8, 96, 97, 119, 166, 77, 50, 34, 158, 21, 184, 24, 165, 171, 142, 36, 181, 45, 90, 175, 99, 13, 37, 10, 140, 3, 69, 16, 133, 172, 173, 27, 132, 79, 76, 111, 123, 7, 94, 70, 116, 174, 15, 156, 187, 110, 84, 185, 14, 72, 159, 143, 78, 135, 17, 12, 139, 67, 58, 151, 177, 73, 154, 145, 179, 25, 108, 148, 137, 85, 147, 61, 20, 89, 155, 183, 134, 128, 191, 26, 121, 126, 0, 141, 112, 62, 114, 48, 182, 146, 115, 64, 113, 189, 31, 1, 39, 168, 2, 43, 163, 188, 35, 129, 153, 66, 23, 40, 6, 5, 98, 56, 9, 63, 180, 157, 167, 162, 60, 42, 49, 28, 22, 80, 87, 92, 160, 55, 136, 170, 106, 117, 178, 32, 38, 105, 102, 41, 57, 109, 144, 47, 190, 4 are interleaved in the sequence.
[0629] FIG. 179 is a diagram showing the 60th example of a GW pattern for an LDPC code having a code length N of 69120 bits.
[0630] According to the GW pattern in FIG. 179, the sequence of bit groups 0 to 191 of the 69120-bit LDPC code is 172, 48, 104, 60, 184, 162, 86, 185, 11, 132, 155, 50, 146, 178, 5, 28, 133, 169, 106, 90, 174, 95, 42, 10, 78, 177, 21, 112, 54, 153, 136, 12, 115, 108, 92, 152, 180, 151, 13, 62, 25, 51, 191, 84, 167, 139, 96, 111, 130, 150, 7, 143, 144, 117, 124, 27, 38, 72, 6, 128, 36, 39, 26, 156, 32, 127, 181, 122, 52, 131, 68, 140, 173, 182, 154, 190, 137, 61, 2, 138, 43, 110, 29, 116, 176, 30, 57, 189, 14, 4, 65, 80, 33, 75, 135, 20, 103, 98, 56, 179, ...
Claims
1. 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 5 / 16; A group-wise interleaving unit that performs group-wise interleaving to interleave the LDPC code in units of 360-bit bit groups; a mapping unit that maps the LDPC code to any one of 64 signal points of 2D-NUC (Non-Uniform Constellation) of 64QAM in 6-bit units; A transmitting device comprising: a receiving device including a group-wise deinterleaving unit that returns the arrangement of the LDPC codes after group-wise interleaving, obtained from the mapped data, to the original arrangement; Equipped with In the group-wise interleaving, the (i+1)th bit group from the beginning of the LDPC code is defined as bit group i, and the sequence of bit groups 0 to 191 of the 69120-bit LDPC code is defined as bit group 92, 83, 138, 67, 27, 88, 13, 26, 73, 16, 187, 18, 76, 28, 79, 130, 91, 58, 140, 38, 6, 43, 17, 168, 141, 96, 70, 147, 112, 164, 97, 161, 139, 65, 78, 95, 146, 3, 32, 158, 24, 0, 94, 120, 176, 128, 59, 81, 21, 102, 190, 8, 114, 113, 29, 45, 103, 56, 54, 173, 177, 12, 174, 108, 169, 148, 123, 129, 150, 77, 157, 184, 61, 127, 121, 156, 104, 111, 68, 160, 107, 117, 124, 84, 35, 10, 90, 106, 144, 66, 64, 15, 46, 125, 44, 37, 20, 135, 53, 71, 152, 183, 162, 50, 167, 11, 142, 149, 131, 191, 166, 31, 185, 134, 19, 178, 52, 188, 2, 75, 110, 145, 41, 159, 136, 100, 9, 62, 60, 34, 116, 23, 42, 105, 40, 118, 186, 4, 5, 182, 170, 87, 1, 22, 55, 126, 63, 14, 25, 153, 98, 49, 33, 69, 179, 171, 93, 36, 133, 57, 151, 82, 72, 163, 86, 47, 119, 48, 99, 30, 189, 115, 165, 101, 80, 175, 132, 89, 39, 181, 85, 51, 154, 137, 7, 180, 155, 74, 109, 122, 172, 143 Interleaved in the sequence of The check matrix is A matrix A in the upper left corner of the check matrix, which has M1 rows and K columns and is represented by a predetermined value M1 and an information length K=N×r of the LDPC code; A B matrix having a step structure adjacent to the right of the A matrix, the B matrix having M1 rows and M1 columns; A Z matrix, which is a zero matrix adjacent to the right of the B matrix and has M1 rows and N-K-M1 columns; A matrix C having N-M1 rows and K+M1 columns adjacent below the matrix A and the matrix B; A matrix D, which is an identity matrix adjacent to the right of the matrix C, and has N-K-M1 rows and N-K-M1 columns. Including, The predetermined value M1 is 1800, The A matrix and the C matrix are represented by a check matrix initial value table, The parity check matrix initial value table is a table representing positions of elements of 1 in the A matrix and the C matrix for every 360 columns, 152 1634 7484 23081 24142 26799 33620 40989 41902 44319 44378 45067 140 701 5137 7313 12672 16929 20359 27052 30236 33846 36254 46973 748 769 2891 7812 9964 15629 19104 20551 25796 28144 31518 34124 542 976 2279 18904 20877 24190 25903 28129 36804 41152 41957 46888 173 960 2926 11682 12304 13284 18037 22702 30255 33718 34073 37152 78 1487 4898 7472 8033 10631 11732 19334 24577 34586 38651 43639 594 1095 1857 2368 8909 17295 17546 21865 23257 31273 37013 41454 72 419 1596 7849 16093 23167 26923 31883 36092 40348 44500 866 1120 1568 1986 3532 20094 21663 26664 26970 33542 42578 868 917 1216 12018 15402 20691 24736 33133 36692 40276 46616 955 1070 1749 7988 10235 19174 22733 24283 27985 38200 44029 613 1729 1787 19542 21227 21376 31057 36104 36874 38078 42445 86 1555 1644 4633 14402 14997 25724 31382 31911 32224 43900 353 1132 1246 5544 7248 17887 25769 27008 28773 33188 44663 600 958 1376 6417 6814 17587 20680 25376 29522 31396 40526 179 528 1472 2481 5589 15696 20148 28040 29690 32370 42163 122 144 681 6613 11230 20862 26396 27737 35928 39396 42713 934 1256 1420 3881 4487 5830 7897 9587 17940 40333 41925 622 1458 1490 16541 18443 19401 24860 26981 28157 32875 38755 1017 1143 1511 2169 17322 24662 25971 29149 31450 31670 34779 935 1084 1534 2918 10596 11534 17476 27269 30344 31104 37975 173 532 1766 8001 10483 17002 19002 26759 31006 43466 47443 221 610 1795 9197 11770 12793 14875 30177 30610 42274 43888 188 439 1332 7030 9246 15150 26060 26541 27190 28259 36763 812 1643 1750 7446 7888 7995 18804 21646 28995 30727 39065 44 481 555 5618 9621 9873 19182 22059 42510 45343 46058 156 532 1799 6258 18733 19988 23237 27657 30835 34738 39503 1128 1553 1790 8372 11543 13764 17062 28627 38502 40796 42461 564 777 1286 3446 5566 12105 16038 18918 21802 25954 28137 1167 1178 1770 4151 11422 11833 16823 17799 19188 22517 29979 576 638 1364 12257 22028 24243 24297 31788 36398 38409 47211 334 592 940 2865 12075 12708 21452 31961 32150 35723 46278 1205 1267 1721 9293 18685 18917 23490 27678 37645 40114 45733 189 628 821 17066 19218 21462 25452 26858 38408 38941 42354 190 951 1019 5572 7135 15647 32613 33863 33981 35670 43727 84 1003 1597 12597 15567 21221 21891 23151 23964 24816 46178 756 1262 1345 6694 6893 9300 9497 17950 19082 35668 38447 848 948 1560 6591 12529 12535 20567 23882 34481 46531 46541 504 631 777 10585 12330 13822 15388 23332 27688 35955 38051 676 1484 1575 2215 5830 6049 13558 25034 33602 35663 41025 1298 1427 1732 13930 15611 19462 20975 23200 30460 30682 34883 1491 1593 1615 4289 7010 10264 21047 26704 27024 29658 46766 969 1730 1748 2217 7181 7623 15860 21332 28133 28998 36077 302 1216 1374 5177 6849 7239 10255 34952 37908 39911 41738 220 362 1491 5235 5439 22708 29228 29481 33272 36831 46487 4 728 1279 4579 8325 8505 27604 31437 33574 41716 45082 472 735 1558 4454 6957 14867 18307 22437 38304 42054 45307 85 466 851 3669 7119 32748 32845 41914 42595 42600 45101 52 553 824 2994 4569 12505 24738 33258 37121 43381 44753 37 495 1553 7684 8908 12412 15563 16461 17872 29292 30619 254 1057 1481 9971 18408 19815 28569 29164 39281 42723 45604 16 1213 1614 4352 8091 8847 10022 24394 35661 43800 44362 395 750 888 2582 3772 4151 26025 36367 42326 42673 47393 862 1379 1441 6413 25621 28378 34869 35491 41774 44165 45411 46 213 1597 2771 4694 4923 17101 17212 19347 22002 43226 1339 1544 1610 13522 14840 15355 29399 30125 33685 36350 37672 251 1162 1260 9766 13137 34769 36646 43313 43736 43828 45151 214 1002 1688 5357 19091 19213 24460 28843 32869 35013 39791 646 733 1735 11175 11336 12043 22962 33892 35646 37116 38655 293 927 1064 4818 5842 10983 12871 17804 33127 41604 46588 10927 15514 22748 34850 37645 40669 41583 44090 3329 7548 8092 11659 16832 35304 46738 46888 3510 5915 9603 30333 37198 42866 44361 46416 2575 5311 9421 13410 15375 34017 37136 43990 12468 14492 24417 26394 38565 38936 41899 45593 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 5 / 16; a group-wise interleaving step of performing group-wise interleaving on the LDPC code in units of 360-bit bit groups; A mapping step of mapping the LDPC code to any one of 64 signal points of 2D-NUC (Non-Uniform Constellation) of 64QAM in 6-bit units; A group-wise deinterleaving step for returning the arrangement of the LDPC code after group-wise interleaving obtained from the mapped data to the original arrangement; Equipped with In the group-wise interleaving, the (i+1)th bit group from the beginning of the LDPC code is defined as bit group i, and the sequence of bit groups 0 to 191 of the 69120-bit LDPC code is defined as bit group 92, 83, 138, 67, 27, 88, 13, 26, 73, 16, 187, 18, 76, 28, 79, 130, 91, 58, 140, 38, 6, 43, 17, 168, 141, 96, 70, 147, 112, 164, 97, 161, 139, 65, 78, 95, 146, 3, 32, 158, 24, 0, 94, 120, 176, 128, 59, 81, 21, 102, 190, 8, 114, 113, 29, 45, 103, 56, 54, 173, 177, 12, 174, 108, 169, 148, 123, 129, 150, 77, 157, 184, 61, 127, 121, 156, 104, 111, 68, 160, 107, 117, 124, 84, 35, 10, 90, 106, 144, 66, 64, 15, 46, 125, 44, 37, 20, 135, 53, 71, 152, 183, 162, 50, 167, 11, 142, 149, 131, 191, 166, 31, 185, 134, 19, 178, 52, 188, 2, 75, 110, 145, 41, 159, 136, 100, 9, 62, 60, 34, 116, 23, 42, 105, 40, 118, 186, 4, 5, 182, 170, 87, 1, 22, 55, 126, 63, 14, 25, 153, 98, 49, 33, 69, 179, 171, 93, 36, 133, 57, 151, 82, 72, 163, 86, 47, 119, 48, 99, 30, 189, 115, 165, 101, 80, 175, 132, 89, 39, 181, 85, 51, 154, 137, 7, 180, 155, 74, 109, 122, 172, 143 Interleaved in the sequence of The check matrix is A matrix A in the upper left corner of the check matrix, which has M1 rows and K columns and is represented by a predetermined value M1 and an information length K=N×r of the LDPC code; A B matrix having a step structure adjacent to the right of the A matrix, the B matrix having M1 rows and M1 columns; A Z matrix, which is a zero matrix adjacent to the right of the B matrix and has M1 rows and N-K-M1 columns; A matrix C having N-M1 rows and K+M1 columns adjacent below the matrix A and the matrix B; A matrix D, which is an identity matrix adjacent to the right of the matrix C, and has N-K-M1 rows and N-K-M1 columns. Including, The predetermined value M1 is 1800, The A matrix and the C matrix are represented by a check matrix initial value table, The parity check matrix initial value table is a table representing positions of elements of 1 in the A matrix and the C matrix for every 360 columns, 152 1634 7484 23081 24142 26799 33620 40989 41902 44319 44378 45067 140 701 5137 7313 12672 16929 20359 27052 30236 33846 36254 46973 748 769 2891 7812 9964 15629 19104 20551 25796 28144 31518 34124 542 976 2279 18904 20877 24190 25903 28129 36804 41152 41957 46888 173 960 2926 11682 12304 13284 18037 22702 30255 33718 34073 37152 78 1487 4898 7472 8033 10631 11732 19334 24577 34586 38651 43639 594 1095 1857 2368 8909 17295 17546 21865 23257 31273 37013 41454 72 419 1596 7849 16093 23167 26923 31883 36092 40348 44500 866 1120 1568 1986 3532 20094 21663 26664 26970 33542 42578 868 917 1216 12018 15402 20691 24736 33133 36692 40276 46616 955 1070 1749 7988 10235 19174 22733 24283 27985 38200 44029 613 1729 1787 19542 21227 21376 31057 36104 36874 38078 42445 86 1555 1644 4633 14402 14997 25724 31382 31911 32224 43900 353 1132 1246 5544 7248 17887 25769 27008 28773 33188 44663 600 958 1376 6417 6814 17587 20680 25376 29522 31396 40526 179 528 1472 2481 5589 15696 20148 28040 29690 32370 42163 122 144 681 6613 11230 20862 26396 27737 35928 39396 42713 934 1256 1420 3881 4487 5830 7897 9587 17940 40333 41925 622 1458 1490 16541 18443 19401 24860 26981 28157 32875 38755 1017 1143 1511 2169 17322 24662 25971 29149 31450 31670 34779 935 1084 1534 2918 10596 11534 17476 27269 30344 31104 37975 173 532 1766 8001 10483 17002 19002 26759 31006 43466 47443 221 610 1795 9197 11770 12793 14875 30177 30610 42274 43888 188 439 1332 7030 9246 15150 26060 26541 27190 28259 36763 812 1643 1750 7446 7888 7995 18804 21646 28995 30727 39065 44 481 555 5618 9621 9873 19182 22059 42510 45343 46058 156 532 1799 6258 18733 19988 23237 27657 30835 34738 39503 1128 1553 1790 8372 11543 13764 17062 28627 38502 40796 42461 564 777 1286 3446 5566 12105 16038 18918 21802 25954 28137 1167 1178 1770 4151 11422 11833 16823 17799 19188 22517 29979 576 638 1364 12257 22028 24243 24297 31788 36398 38409 47211 334 592 940 2865 12075 12708 21452 31961 32150 35723 46278 1205 1267 1721 9293 18685 18917 23490 27678 37645 40114 45733 189 628 821 17066 19218 21462 25452 26858 38408 38941 42354 190 951 1019 5572 7135 15647 32613 33863 33981 35670 43727 84 1003 1597 12597 15567 21221 21891 23151 23964 24816 46178 756 1262 1345 6694 6893 9300 9497 17950 19082 35668 38447 848 948 1560 6591 12529 12535 20567 23882 34481 46531 46541 504 631 777 10585 12330 13822 15388 23332 27688 35955 38051 676 1484 1575 2215 5830 6049 13558 25034 33602 35663 41025 1298 1427 1732 13930 15611 19462 20975 23200 30460 30682 34883 1491 1593 1615 4289 7010 10264 21047 26704 27024 29658 46766 969 1730 1748 2217 7181 7623 15860 21332 28133 28998 36077 302 1216 1374 5177 6849 7239 10255 34952 37908 39911 41738 220 362 1491 5235 5439 22708 29228 29481 33272 36831 46487 4 728 1279 4579 8325 8505 27604 31437 33574 41716 45082 472 735 1558 4454 6957 14867 18307 22437 38304 42054 45307 85 466 851 3669 7119 32748 32845 41914 42595 42600 45101 52 553 824 2994 4569 12505 24738 33258 37121 43381 44753 37 495 1553 7684 8908 12412 15563 16461 17872 29292 30619 254 1057 1481 9971 18408 19815 28569 29164 39281 42723 45604 16 1213 1614 4352 8091 8847 10022 24394 35661 43800 44362 395 750 888 2582 3772 4151 26025 36367 42326 42673 47393 862 1379 1441 6413 25621 28378 34869 35491 41774 44165 45411 46 213 1597 2771 4694 4923 17101 17212 19347 22002 43226 1339 1544 1610 13522 14840 15355 29399 30125 33685 36350 37672 251 1162 1260 9766 13137 34769 36646 43313 43736 43828 45151 214 1002 1688 5357 19091 19213 24460 28843 32869 35013 39791 646 733 1735 11175 11336 12043 22962 33892 35646 37116 38655 293 927 1064 4818 5842 10983 12871 17804 33127 41604 46588 10927 15514 22748 34850 37645 40669 41583 44090 3329 7548 8092 11659 16832 35304 46738 46888 3510 5915 9603 30333 37198 42866 44361 46416 2575 5311 9421 13410 15375 34017 37136 43990 12468 14492 24417 26394 38565 38936 41899 45593 is Sending and receiving methods.
Citation Information
Patent Citations
JPP6885026B
JPP6897205B
Transmitter apparatus and interleaving method thereof
US20150236816A1
Data processing device and data processing method
WO2016114156A1