Transmission / Reception System and Transmission / Reception Method
The system addresses the challenge of maintaining good communication quality in LDPC code-based data transmission by employing specific encoding, interleaving, and mapping techniques, resulting in improved performance and reduced error probabilities.
Patent Information
- Application Number
- JP2024004997
- Authority / Receiving Office
- JP · JP
- Patent Type
- Patents
- Current Assignee / Owner
- Filing Date
- 2024-01-17
- Publication Date
- 2025-06-03
- Estimated Expiration
- 2037-02-06
AI Technical Summary
Existing data transmission systems using LDPC codes face challenges in maintaining good communication quality, particularly as the code length increases, leading to performance limitations near the Shannon limit and potential error floor issues.
The proposed transmission and reception system employs LDPC encoding with a specific check matrix, group-wise interleaving, and mapping to 4096QAM signal points, ensuring effective data transmission by restoring the original order of the LDPC code through group-wise deinterleaving.
This approach ensures high communication quality by optimizing LDPC code performance, reducing error probabilities, and minimizing the error floor phenomenon, thereby achieving performance close to the Shannon limit.
Smart Images

Figure 0007687459000008 
Figure 0007687459000009 
Figure 0007687459000010
Abstract
Description
Technical Field
[0001] The present technology relates to a transmission and reception system and a transmission and reception method, and particularly relates to a transmission and reception system and a transmission and reception method that can ensure good communication quality, for example, in data transmission using an LDPC code.
Background Art
[0002] The LDPC (Low Density Parity Check) code has high error correction ability, and in recent years, for example, it has been widely adopted in transmission systems such as DVB (Digital Video Broadcasting)-S.2 in Europe, DVB-T.2, DVB-C.2, 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, like turbo codes and the like, as the code length of the LDPC code is increased, performance approaching the Shannon limit can be obtained. In addition, since the LDPC code has the property that the minimum distance is proportional to the code length, as a feature, it has good block error probability characteristics, and furthermore, it can be cited as an advantage 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 Documents
[0004]
Non-Patent Document 1
Summary of the Invention
Problems to be Solved by the Invention
[0005] In data transmission using LDPC codes, for example, the LDPC code is symbolized as a symbol of quadrature modulation (digital modulation) such as QPSK (Quadrature Phase Shift Keying), and the symbol is mapped to a signal point of the quadrature modulation and transmitted.
[0006] Data transmission using LDPC codes as described above is spreading globally, and there is a demand to ensure good communication (transmission) quality.
[0007] This technology has been made in view of such a situation, and it enables ensuring good communication quality in data transmission using LDPC codes.
Means for Solving the Problem
[0008] The 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 with a code length N of 69,120 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 in units of 12 bits to any one of 4,096 signal points of UC (Uniform Constellation) of 4,096QAM. In the group-wise interleaving, the (i + 1)-th bit group from the head of the LDPC code is used as the bit group i, and the order of bit groups 0 to 191 of the 69,120-bit LDPC code is changed to bit group 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 Interleave the order and the interleaving, and the check matrix is composed of a predetermined value M1, the information length K = N×r of the LDPC code, an A matrix of M1 rows and K columns at the upper left of the check matrix, a B matrix of M1 rows and M1 columns with a staircase structure adjacent to the right of the A matrix, a Z matrix of M1 rows and N - K - M1 columns which is a zero matrix adjacent to the right of the B matrix, a C matrix of N - K - M1 rows and K + M1 columns adjacent to the bottom of the A matrix and the B matrix, and a D matrix of N - K - M1 rows and N - K - M1 columns which is an identity matrix adjacent to the right of the C matrix. The predetermined value M1 is 1800. The A matrix and the C matrix are represented by a check matrix initial value table. The check matrix initial value table is a table that represents the positions of the 1 elements of the A matrix and the C matrix 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 is the transmission method / apparatus.
[0009] The first receiving apparatus / method of the present technology has an encoding unit that performs LDPC encoding 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, 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 in units of 12 bits to any one of 4096 signal points of UC (Uniform Constellation) of 4096QAM. In the group-wise interleaving, the (i + 1)-th bit group from the head of the LDPC code is used as the bit group i, and the order of the bit groups 0 to 191 of the 69120-bit LDPC code is changed to the bit group 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 Interleave the order and the interleaving, and the check matrix is composed of a predetermined value M1, an information length K = N×r of the LDPC code, an A matrix of M1 rows and K columns at the upper left of the check matrix, a B matrix of M1 rows and M1 columns with a staircase structure adjacent to the right of the A matrix, a Z matrix of M1 rows and N - K - M1 columns which is a zero matrix adjacent to the right of the B matrix, a C matrix of N - K - M1 rows and K + M1 columns adjacent to the bottom of the A matrix and the B matrix, and a D matrix of N - K - M1 rows and N - K - M1 columns which is an identity matrix adjacent to the right of the C matrix. The predetermined value M1 is 1800, the A matrix and the C matrix are represented by a check matrix initial value table, and the check matrix initial value table is a table representing the positions of the 1 elements of the A matrix and the C matrix 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 A receiving device / method comprising a group-wise deinterleaving unit / step for restoring the order of the LDPC code after group-wise interleaving to the original order from the data transmitted from a transmitting device which is as described above.
[0010] The second transmission method / apparatus of the present technology includes an encoding step / section that performs LDPC encoding based on a check matrix of an LDPC code with a code length N of 69,120 bits and a coding rate r of 5 / 16, a group-wise interleaving step / section that performs group-wise interleaving by interleaving the LDPC code in units of 360-bit bit groups, and a mapping step / section that maps the LDPC code in units of 12 bits to any one of 4,096 signal points of UC (Uniform Constellation) of 4,096QAM. In the group-wise interleaving, the (i + 1)-th bit group from the head of the LDPC code is used as the bit group i, and the order of the bit groups 0 to 191 of the 69,120-bit LDPC code is changed to the bit group 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 Interleave the order and include the following in the parity-check matrix: an A matrix of M1 rows and K columns, where M1 is a predetermined value and K is the information length of the LDPC code K = N×r, located in the upper left of the parity-check matrix; a B matrix of M1 rows and M1 columns with a staircase structure adjacent to the right of the A matrix; a Z matrix of M1 rows and N - K - M1 columns, which is a zero matrix adjacent to the right of the B matrix; a C matrix of N - K - M1 rows and K + M1 columns, adjacent to the bottom of the A matrix and the B matrix; and a D matrix of N - K - M1 rows and N - K - M1 columns, which is an identity matrix adjacent to the right of the C matrix. The predetermined value M1 is 1800. The A matrix and the C matrix are represented by a parity-check matrix initial value table, which is a table representing the positions of the 1 elements of the A matrix and the C matrix 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 It is a transmission method / apparatus.
[0011] The second receiving apparatus / method of the present technology includes an encoding unit that performs LDPC encoding 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, a group-wise interleaving unit that performs group-wise interleaving by interleaving the LDPC code in units of 360-bit bit groups, and a mapping unit that maps the LDPC code in units of 12 bits to any one of 4096 signal points of UC (Uniform Constellation) of 4096QAM. In the group-wise interleaving, the (i + 1)-th bit group from the head of the LDPC code is used as the bit group i, and the order of the bit groups 0 to 191 of the 69120-bit LDPC code is changed to the bit group 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 Interleave the order and the interleaving, and the check matrix is composed of a predetermined value M1, and an A matrix of M1 rows and K columns represented by the information length K = N×r of the LDPC code, which is located in the upper left of the check matrix, a B matrix of M1 rows and M1 columns with a staircase structure adjacent to the right of the A matrix, a Z matrix of M1 rows and N - K - M1 columns which is a zero matrix adjacent to the right of the B matrix, a C matrix of N - K - M1 rows and K + M1 columns adjacent to the bottom of the A matrix and the B matrix, and a D matrix of N - K - M1 rows and N - K - M1 columns which is an identity matrix adjacent to the right of the C matrix. The predetermined value M1 is 1800, the A matrix and the C matrix are represented by a check matrix initial value table, and the check matrix initial value table is a table that represents the positions of the 1 elements of the A matrix and the C matrix 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 A receiving apparatus / method comprising a group-wise deinterleaving unit / step that restores the order of the LDPC code after group-wise interleaving to the original order from data transmitted from a transmitting apparatus that is as described above.
[0012] The third transmitting method / apparatus of the present technology includes an encoding step / unit that performs LDPC encoding based on a check matrix of an LDPC code with 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 in units of 12 bits to any one of 4096 signal points of UC (Uniform Constellation) of 4096QAM. In the group-wise interleaving, the (i + 1)-th bit group from the head of the LDPC code is used as the bit group i, and the order of the bit groups 0 to 191 of the 69120-bit LDPC code is changed to the bit group 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 Interleave the order and, the check matrix is composed of a predetermined value M1, an A matrix of M1 rows and K columns in the upper left of the check matrix, where the information length K of the LDPC code is N×r, a B matrix of M1 rows and M1 columns with a staircase structure adjacent to the right of the A matrix, a Z matrix of M1 rows and N-K-M1 columns which is a zero matrix adjacent to the right of the B matrix, a C matrix of N-K-M1 rows and K+M1 columns adjacent to the bottom of the A matrix and the B matrix, and a D matrix of N-K-M1 rows and N-K-M1 columns which is an identity matrix adjacent to the right of the C matrix. The predetermined value M1 is 4680. The A matrix and the C matrix are represented by a check matrix initial value table. The check matrix initial value table is a table that represents the positions of the 1 elements of the A matrix and the C matrix 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 is the transmission method / apparatus.
[0013] The third receiving apparatus / method of the present technology includes an encoding unit that performs LDPC encoding based on a check matrix of an LDPC code with a code length N of 69,120 bits and a coding rate r of 7 / 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 in units of 12 bits to any one of 4,096 signal points of UC (Uniform Constellation) of 4,096QAM. In the group-wise interleaving, the (i + 1)-th bit group from the head of the LDPC code is set as the bit group i, and the order of the bit groups 0 to 191 of the 69,120-bit LDPC code is the bit group 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 Interleave the order and include: the inspection matrix is an M1-row K-column matrix represented by a predetermined value M1 and the information length K = N×r of the LDPC code, including the upper-left A matrix of the inspection matrix, a staircase-structured B matrix adjacent to the right of the A matrix with M1 rows and M1 columns, a zero matrix Z matrix adjacent to the right of the B matrix with M1 rows and N-K-M1 columns, a C matrix adjacent to the bottom of the A matrix and the B matrix with N-K-M1 rows and K+M1 columns, and a unit matrix D matrix adjacent to the right of the C matrix with 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 an inspection matrix initial value table, and the inspection matrix initial value table is a table that represents the positions of the 1 elements of the A matrix and the C matrix 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 A receiving apparatus / method comprising a group-wise deinterleaving unit / step for restoring the order of the LDPC code after group-wise interleaving to the original order from the data transmitted from a transmitting apparatus.
[0014] The fourth 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 with a code length N of 69,120 bits and a coding rate r of 9 / 16, a group-wise interleaving step / unit that performs group-wise interleaving by interleaving the LDPC code in units of 360-bit bit groups, and a mapping step / unit that maps the LDPC code in units of 12 bits to any one of 4,096 signal points of a UC (Uniform Constellation) of 4,096QAM. In the group-wise interleaving, the (i + 1)-th bit group from the head of the LDPC code is used as the bit group i, and the order of the bit groups 0 to 191 of the 69,120-bit LDPC code is changed to the bit group 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 Interleave the order and include the LDPC code, which includes information bits and parity bits. The check matrix includes an information matrix part corresponding to the information bits and a parity matrix part corresponding to the parity bits. The information matrix part is represented by a check matrix initial value table, and the check matrix initial value table is a table that represents the positions of the elements of 1 in the information matrix part every 360 columns, 110 3064 6740 7801 10228 13445 17599 17891 17979 18044 19923 21848 23262 25585 25968 30124 1578 8914 9141 9731 10605 11690 12824 18127 18458 24648 24950 25150 26323 26514 27385 27460 3054 3640 3923 7332 10770 12215 14455 14849 15619 20870 22033 26427 28067 28560 29777 29780 1348 4248 5479 8902 9101 9356 10581 11614 12813 21554 22985 23701 24099 24575 24786 27370 3266 8358 16544 16689 16693 16823 17565 18543 19229 21121 23799 24981 25423 28997 29808 30202 320 1198 1549 5407 6080 8542 9352 12418 13391 14736 15012 18328 19398 23391 28117 28793 2114 3294 3770 5225 5556 5991 7075 7889 11145 11386 16561 18956 19034 23605 26085 27132 3623 4011 4225 5249 5489 5711 7240 9831 10458 14697 15420 16015 17782 23244 24215 24386 2624 2750 3871 8247 11135 13702 19290 22209 22975 23811 23931 24872 25154 25165 28375 30200 1060 1240 2040 2382 7723 9165 9656 10398 14517 16653 21241 22348 23476 27203 28443 28445 1070 1233 3416 6633 11736 12808 15454 16505 18720 20162 21425 21874 26069 26855 27292 27978 420 5524 10279 11218 12500 12913 15389 15824 19414 19588 21138 23846 26621 27907 28594 28781 151 1356 2323 3289 4501 10573 13667 14642 16127 17040 17475 18055 24061 26204 26567 29277 1410 3656 4080 6963 8834 10527 17490 17584 18065 19234 22211 22338 23746 24662 29863 30227 1924 2694 3285 8761 9693 11005 17592 21259 21322 21546 21555 24044 24173 26988 27640 28506 1069 6483 6554 9027 11655 12453 16595 17877 18350 18995 21304 21442 23836 25468 28820 29453 149 1621 2199 3141 8403 11974 14969 16197 18844 21027 21921 22266 22399 22691 25727 27721 3689 4839 7971 8419 10500 12308 13435 14487 16502 16622 17229 17468 22710 23904 25074 28508 1270 7007 9830 12698 14204 16075 17613 19391 21362 21726 21816 23014 23651 26419 26748 27195 96 1953 2456 2712 2809 3196 5939 10634 21828 24606 26169 26801 27391 28578 29725 30142 832 3394 4145 5375 6199 7122 7405 7706 10136 10792 15058 15860 21881 23908 25174 25837 730 1735 2917 4106 5004 5849 8194 8943 9136 17599 18456 20191 22798 27935 29559 6238 6776 6799 9142 11199 11867 15979 16830 18110 18396 21897 22590 24020 29578 29644 407 2138 4493 7979 8225 9467 11956 12940 15566 15809 16058 18211 22073 28314 28713 957 1552 1869 4388 7642 7904 13408 13453 16431 19327 21444 22188 25719 28511 29192 3617 8663 22378 28704 8598 12647 19278 22416 15176 16377 16644 22732 12463 12711 18341 11079 13446 29071 2446 4068 8542 10838 11660 27428 16403 21750 23199 9181 16572 18381 7227 18770 21858 7379 9316 16247 8923 14861 29618 6531 24652 26817 5564 8875 18025 8019 14642 21169 16683 17257 29298 4078 6023 8853 13942 15217 15501 7484 8302 27199 671 14966 20886 1240 11897 14925 12800 25474 28603 3576 5308 11168 13430 15265 18232 3439 5544 21849 3257 16996 23750 1865 14153 22669 7640 15098 17364 6137 19401 24836 5986 9035 11444 4799 20865 29150 8360 23554 29246 2002 18215 22258 9679 11951 26583 2844 12330 18156 3744 6949 14754 8262 10288 27142 1087 16563 22815 1328 13273 21749 2092 9191 28045 3250 10549 18252 13975 15172 17135 2520 26310 28787 4395 8961 26753 6413 15437 19520 5809 10936 17089 1670 13574 25125 5865 6175 21175 8391 11680 22660 5485 11743 15165 21021 21798 30209 12519 13402 26300 3472 25935 26412 3377 7398 28867 2430 24650 29426 3364 13409 22914 6838 13491 16229 18393 20764 28078 289 20279 24906 4732 6162 13569 8993 17053 29387 2210 5024 24030 21 22976 24053 12359 15499 28251 4640 11480 24391 1083 7965 16573 13116 23916 24421 10129 16284 23855 1758 3843 21163 5626 13543 26708 14918 17713 21718 13556 20450 24679 3911 16778 29952 11735 13710 22611 5347 21681 22906 6912 12045 15866 713 15429 23281 7133 17440 28982 12355 17564 28059 7658 11158 29885 17610 18755 28852 7680 16212 30111 8812 10144 15718 is a transmission method / apparatus.
[0015] The fourth receiving apparatus / method of the present technology includes an encoding unit that performs LDPC encoding based on a check matrix of an LDPC code with a code length N of 69,120 bits and a coding rate r of 9 / 16, a group-wise interleaving unit that performs group-wise interleaving by interleaving the LDPC code in units of 360-bit bit groups, and a mapping unit that maps the LDPC code in units of 12 bits to any one of 4,096 signal points of UC (Uniform Constellation) of 4096QAM. In the group-wise interleaving, the (i + 1)-th bit group from the head of the LDPC code is used as the bit group i, and the order of the bit groups 0 to 191 of the 69,120-bit LDPC code is changed to the bit group 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 Interleave the order and include the LDPC code with information bits and parity bits. The check matrix includes an information matrix part corresponding to the information bits and a parity matrix part corresponding to the parity bits. The information matrix part is represented by a check matrix initial value table, and the check matrix initial value table is a table that represents the positions of the 1 elements of the information matrix part 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 A receiving apparatus / method comprising a group-wise de-interleaving unit / step that restores the order of the LDPC code after group-wise interleaving to the original order from the data transmitted from a transmitting apparatus.
[0016] The fifth transmitting 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 with a code length N of 69,120 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 in units of 12 bits to any one of 4,096 signal points of UC (Uniform Constellation) of 4,096QAM. In the group-wise interleaving, the (i + 1)-th bit group from the head of the LDPC code is used as the bit group i, and the order of the bit groups 0 to 191 of the 69,120-bit LDPC code is changed to the bit group 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 Interleave the order and include the LDPC code, which includes information bits and parity bits. The check matrix includes an information matrix part corresponding to the information bits and a parity matrix part corresponding to the parity bits. The information matrix part is represented by a check matrix initial value table, and the check matrix initial value table is a table that represents the positions of the 1 elements of the information matrix part 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 is the transmission method / apparatus.
[0017] The fifth receiving device / method of the present technology includes an encoding unit that performs LDPC encoding based on a check matrix of an LDPC code with a code length N of 69,120 bits and a coding rate r of 11 / 16, a group-wise interleaving unit that performs group-wise interleaving by interleaving the LDPC code in units of 360-bit bit groups, and a mapping unit that maps the LDPC code in units of 12 bits to any one of 4,096 signal points of UC (Uniform Constellation) of 4,096QAM. In the group-wise interleaving, the (i + 1)-th bit group from the beginning of the LDPC code is used as the bit group i, and the order of the bit groups 0 to 191 of the 69,120-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 Interleave the sequences, the LDPC code includes information bits and parity bits, the check matrix includes an information matrix part corresponding to the information bits and a parity matrix part corresponding to the parity bits, the information matrix part is represented by a check matrix initial value table, and the check matrix initial value table is a table that represents the positions of the 1 elements of the information matrix part 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 A receiving apparatus / method includes a group-wise de-interleaving unit / step that restores the order of the LDPC code after group-wise interleaving to the original order, which is obtained from data transmitted from a transmitting apparatus.
[0018] The sixth transmitting method / apparatus of the present technology includes an encoding step / unit that performs LDPC encoding based on a check matrix of an LDPC code with a code length N of 69,120 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 in units of 12 bits to any one of 4,096 signal points of UC (Uniform Constellation) of 4,096QAM. In the group-wise interleaving, the (i + 1)-th bit group from the head of the LDPC code is used as the bit group i, and the order of the bit groups 0 to 191 of the 69,120-bit LDPC code is changed to the bit group 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 Interleave the order and include the LDPC code with information bits and parity bits. The check matrix includes an information matrix part corresponding to the information bits and a parity matrix part corresponding to the parity bits. The information matrix part is represented by a check matrix initial value table, and the check matrix initial value table is a table that represents the positions of the 1 elements of the information matrix part 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 is a transmission method / apparatus.
[0019] The sixth receiving apparatus / method of the present technology includes an encoding unit that performs LDPC encoding based on a check matrix of an LDPC code with 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 by interleaving the LDPC code in units of 360-bit bit groups, and a mapping unit that maps the LDPC code in units of 12 bits to any one of 4096 signal points of UC (Uniform Constellation) of 4096QAM. In the group-wise interleaving, the (i + 1)-th bit group from the head of the LDPC code is set as bit group i, and the order of bit groups 0 to 191 of the 69120-bit LDPC code is changed to bit group 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 Interleave the order and include the LDPC code with information bits and parity bits. The check matrix includes an information matrix part corresponding to the information bits and a parity matrix part corresponding to the parity bits. The information matrix part is represented by a check matrix initial value table, and the check matrix initial value table is a table that represents the positions of the 1 elements of the information matrix part 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 A receiving apparatus / method comprising a group-wise deinterleaving unit / step for restoring the order of the LDPC code after group-wise interleaving to the original order from data transmitted from a transmitting apparatus.
[0020] In the first transmitting 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 on the LDPC code in units of 360-bit bit groups. Then, the LDPC code is mapped to any one of 4096 signal points of UC (Uniform Constellation) of 4096QAM in units of 12 bits. In the group-wise interleaving, the (i + 1)-th bit group from the head of the LDPC code is used as the bit group i, and the order of the bit groups 0 to 191 of the 69120-bit LDPC code is the bit group 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 with the order of . The check matrix initial value table that defines the check matrix is as described above.
[0021] In the first receiving apparatus / method of the present technology, the order of the LDPC codes after group-wise interleaving obtained from the data transmitted from the first transmitting apparatus that implements the first transmission method is restored to the original order.
[0022] In the second transmission method / apparatus of the present technology, LDPC coding is performed based on a parity-check matrix of an LDPC code with a code length N of 69,120 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 to any one of 4,096 signal points of a 4096QAM UC (Uniform Constellation) in units of 12 bits. In the group-wise interleaving, the (i + 1)-th bit group from the head of the LDPC code is used as the bit group i, and the order of the bit groups 0 to 191 of the 69,120-bit LDPC code is the bit group 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 with the order of. The check matrix initial value table that defines the check matrix is as described above.
[0023] In the second receiving apparatus / method of the present technology, the order of the LDPC code after groupwise interleaving, which is obtained from data transmitted from a second transmitting apparatus that implements a second transmission method, is restored to the original order.
[0024] In the third 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 69,120 bits and a coding rate r of 7 / 16, and groupwise interleaving is performed in which the LDPC code is interleaved in units of 360-bit bit groups. Then, the LDPC code is mapped to any one of 4,096 signal points of UC (Uniform Constellation) of 4,096QAM in units of 12 bits. In the groupwise interleaving, the (i + 1)-th bit group from the head of the LDPC code is used as the bit group i, and the order of the bit groups 0 to 191 of the 69,120-bit LDPC code is the bit group 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 with the order of . The inspection matrix initial value table that defines the inspection matrix is as described above.
[0025] In the third receiving apparatus / method of the present technology, the order of the LDPC code after groupwise interleaving, which is obtained from data transmitted from a third transmitting apparatus that implements a third transmission method, is restored to the original order.
[0026] In the fourth transmission method / apparatus of the present technology, LDPC coding is performed based on a parity-check matrix of an LDPC code with a code length N of 69,120 bits and a coding rate r of 9 / 16, and groupwise interleaving is performed to interleave the LDPC code in units of 360-bit bit groups. Then, the LDPC code is mapped to any one of 4,096 signal points of UC (Uniform Constellation) of 4,096QAM in units of 12 bits. In the groupwise interleaving, the (i + 1)-th bit group from the head of the LDPC code is used as the bit group i, and the order of the bit groups 0 to 191 of the 69,120-bit LDPC code is the bit group 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 with the order of . The check matrix initial value table that defines the check matrix is as described above.
[0027] In the fourth receiving apparatus / method of the present technology, the order of the LDPC code after group-wise interleaving obtained from the data transmitted from the fourth transmitting apparatus that implements the fourth transmission method is restored to the original order.
[0028] In the fifth transmission method / apparatus of the present technology, LDPC coding is performed based on a parity-check matrix of an LDPC code with a code length N of 69,120 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 to any one of 4,096 signal points of a 4096QAM UC (Uniform Constellation) in units of 12 bits. In the group-wise interleaving, the (i + 1)-th bit group from the head of the LDPC code is set as the bit group i, and the order of the bit groups 0 to 191 of the 69,120-bit LDPC code is the bit group 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 with the sequence of . The check matrix initial value table that defines the check matrix is as described above.
[0029] In the fifth receiving apparatus / method of the present technology, the order of the LDPC code after groupwise interleaving obtained from the data transmitted from the fifth transmitting apparatus that implements the fifth transmitting method is restored to the original order.
[0030] In the sixth transmitting 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 69,120 bits and a coding rate r of 13 / 16, and groupwise interleaving is performed to interleave the LDPC code in units of 360-bit bit groups. Then, the LDPC code is mapped to any one of 4,096 signal points of UC (Uniform Constellation) of 4,096QAM in units of 12 bits. In the groupwise interleaving, the (i + 1)-th bit group from the head of the LDPC code is used as the bit group i, and the order of the bit groups 0 to 191 of the 69,120-bit LDPC code is the bit group 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 is interleaved with the order. The check matrix initial value table that defines the check matrix is as described above.
[0031] In the sixth receiving apparatus / method of the present technology, the order of the LDPC code after group-wise interleaving obtained from the data transmitted from the sixth transmitting apparatus that implements the sixth transmission method is restored to the original order.
[0032] Note that each of the transmitting apparatus and the receiving apparatus may be an independent apparatus or an internal block constituting one apparatus.
Advantages of the Invention
[0033] According to the present technology, in data transmission using an LDPC code, good communication quality can be ensured.
[0034] Note that the effects described here are not necessarily limited, and any of the effects described in the present disclosure may be applicable.
Brief Description of the Drawings
[0035]
Figure 1
Figure 2
Figure 3
Figure 4
Figure 5
Figure 6
Figure 7
Figure 8
Figure 9
Figure 10
Figure 11
Figure 12
Figure 13
Figure 14
Figure 15
Figure 16
Figure 17
Figure 18
Figure 19
Figure 20
Figure 21
Figure 22
Figure 23
Figure 24
Figure 25
Figure 26
Figure 27
Figure 28
Figure 29
Figure 30
Figure 31
Figure 32
Figure 33
Figure 34
Figure 35
Figure 36
Figure 37
Figure 38
Figure 39
Figure 40
Figure 41
Figure 42
Figure 43
Figure 44
Figure 45
Figure 46
Figure 47
Figure 48
Figure 49
Figure 50
Figure 51
Figure 52
Figure 53
Figure 54
Figure 55
Figure 56
Figure 57
Figure 58
Figure 59
Figure 60
Figure 61
Figure 62
Figure 63
Figure 64
Figure 65
Figure 66
Figure 67
Figure 68
Figure 69
Figure 70
Figure 71
Figure 72
Figure 73
Figure 74
Figure 75
Figure 76
Figure 77
Figure 78
Figure 79
Figure 80
Figure 81
Figure 82
Figure 83
Figure 84
Figure 85
Figure 86
Figure 87
Figure 88
Figure 89
Figure 90
Figure 91
Figure 92
Figure 93
Figure 94
Figure 95
Figure 96
Figure 97
Figure 98
Figure 99
Figure 100
Figure 101
Figure 102
Figure 103
Figure 104
Figure 105
Figure 106
Figure 107
Figure 108
Figure 109
Figure 110
Figure 111
Figure 112
Figure 113
Figure 114
Figure 115
Figure 116
Figure 117
Figure 118
Figure 119
Figure 120
Figure 121
Figure 122
Figure 123
Figure 124
Figure 125
Figure 126
Figure 127
Figure 128
Figure 129
Figure 130
Figure 131
Figure 132
Figure 133
Figure 134
Figure 135
Figure 136
Figure 137
Figure 138
Figure 139
Figure 140
Figure 141
Figure 142
Figure 143
Figure 144
Figure 145
Figure 146
Figure 147
Figure 148
Figure 149
Figure 150
Figure 151
Figure 152
Figure 153
Figure 154
Figure 155
Figure 156
Figure 157
Figure 158
Figure 159
Figure 160
Figure 161
Figure 162
Figure 163
Figure 164
Figure 165
Figure 166
Figure 167
Figure 168
Figure 169
Embodiment 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 LDPC code is characterized in that the parity check matrix defining the LDPC code is sparse. Here, a sparse matrix is a matrix in which the number of "1"s in the elements of the matrix is very small (a matrix in which most elements are 0).
[0040] FIG. 1 is a diagram showing an example of the parity check matrix H of the LDPC code.
[0041] In the parity check matrix H of FIG. 1, the weight of each column (column weight) (the number of "1"s) (weight) is "3", and the weight of each row (row weight) is "6".
[0042] In encoding by the LDPC code (LDPC encoding), for example, a generator matrix G is generated based on the parity check matrix H, and the generator matrix G is multiplied by binary information bits to generate a codeword (LDPC code).
[0043] Specifically, an encoding device that performs LDPC encoding first calculates the transpose matrix H of the parity check matrix H T and between them, the equation GH TCalculate a generator matrix G for which =0 holds. Here, when the generator matrix G is a K×N matrix, the encoding device multiplies a bit sequence (vector u) of information bits consisting of K bits by the generator matrix G to generate a codeword c (= uG) consisting of N bits. The codeword (LDPC code) generated by this encoding device is received on the receiving side via a predetermined communication channel.
[0044] The decoding of the LDPC code is an algorithm proposed by Gallager under the name of Probabilistic Decoding, and can be performed by a message-passing algorithm based on probability propagation (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] Figure 2 is a flowchart showing the procedure for decoding the LDPC code.
[0046] Incidentally, hereinafter, as appropriate, a real value (received LLR) obtained by expressing the "0-likeness" of the value of the i-th code bit of the LDPC code (one codeword) received on the receiving side in terms of the log likelihood ratio will be referred to as the received value u 0i as well. Also, the message output from the check node is denoted as u j and the message output from the variable node is denoted as v i Let it be.
[0047] First, in the decoding of the LDPC code, as shown in Figure 2, in step S11, the LDPC code is received, the message (check node message) u j is initialized to "0", and a variable k that takes an integer as a counter for the iterative process is initialized to "0", and the process proceeds to step S12. In step S12, the received value u obtained by receiving the LDPC code0i Based on this, by performing the operation (variable node operation) shown in Equation (1), a message (variable node message) v i is obtained. Furthermore, based on this message v i by performing the operation (check node operation) shown in Equation (2), a message u j is obtained.
[0048]
Number
[0049]
Number
[0050] Here, d v and d c in Equation (1) and Equation (2) are respectively parameters that can be arbitrarily selected and indicate the number of "1"s in the vertical direction (columns) and horizontal direction (rows) of the parity-check matrix H. For example, in the case of an LDPC code ((3,6) LDPC code) for a parity-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] Note that in the variable node operation of Equation (1) and the check node operation of (2), in each case, since the message input from the branch (edge) (the line connecting the variable node and the check node) from which the message is to be output is not the object of the operation, the range of the operation is from 1 to d v - 1 or from 1 to d c - 1. Also, the check node operation of Equation (2) is actually performed by creating in advance a table of the function R(v 1 , v 2 ) shown in Equation (3) defined for 1 output with respect to 2 inputs v 1 , v 2 ) and using this continuously (recursively) as shown in Equation (4).
[0052]
Number
[0053]
Number
[0054] In step S12, further, the variable k is incremented by only "1" and proceeds to step S13. In step S13, it is determined whether the variable k is greater than a predetermined number of decoding repetitions C. In step S13, if it is determined that the variable k is not greater than C, the process returns to step S12, and the following similar processing is repeated.
[0055] Also, in step S13, if it is determined that the variable k is greater than C, the process proceeds to step S14, and the message v i as the decoding result finally output by performing the operation shown in Equation (5) is obtained and output, and the decoding process of the LDPC code ends.
[0056]
Number
[0057] Here, the operation of Equation (5) is performed using all the messages u j from all the branches connected to the variable node, which is different from the variable node operation of Equation (1).
[0058] Figure 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 of Figure 3, as in Figure 1, the column weight is 3 and the row weight is 6, respectively.
[0060] Figure 4 is a diagram showing the Tanner graph of the parity-check matrix H of Figure 3.
[0061] Here, in FIG. 4, the check nodes are represented by plus signs "+", and the variable nodes are represented by equal signs "=". The check nodes and the variable nodes correspond to the rows and columns of the check matrix H, respectively. The connection lines between the check nodes and the variable nodes are edges, which correspond to the "1"s of the elements of the check matrix.
[0062] That is, when the element in the j-th row and the i-th column of the check matrix is 1, in FIG. 4, the i-th variable node (the node of "=") from the top and the j-th check node (the node of "+") from the top are connected by an edge. The edge represents that the code bit corresponding to the variable node has the constraint condition corresponding to the check node.
[0063] In the sum product algorithm, which is a decoding method for LDPC codes, variable node operations and check node operations are repeatedly performed.
[0064] FIG. 5 is a diagram showing the variable node operation performed at the variable node.
[0065] At the variable node, the message v corresponding to the edge to be calculated i is obtained by the variable node operation of Equation (1) using the messages u 1 and u 2 from the remaining edges connected to the variable node, and the received value u 0i Messages corresponding to other edges are obtained in the same way.
[0066] FIG. 6 is a diagram showing the check node operation performed at the check node.
[0067] Here, the check node operation of Equation (2) can be rewritten as Equation (6) by using the relationship of the equation \(a\times b = \exp\{\ln(|a|)+\ln(|b|)\}\times\mathrm{sign}(a)\times\mathrm{sign}(b)\). However, \(\mathrm{sign}(x)\) is 1 when \(x\geq0\) and -1 when \(x < 0\).
[0068]
Number
[0069] When \(x\geq0\), if the function \(\varphi(x)\) is defined as the equation \(\varphi(x)=\ln(\tanh(x / 2))\), then the equation \(\varphi\) -1 (x)=2\tanh -1 (e -x ) holds. Therefore, 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\) j corresponding to the branch to be calculated is obtained by the check node operation of Equation (7) using the messages \(v\) 1 , \(v\) 2 , \(v\) 3 , \(v\) 4 , \(v\) 5 from the remaining branches connected to the check node. The messages corresponding to the other branches are obtained in the same way.
[0073] Note that the function \(\varphi(x)\) of Equation (7) can be expressed as \(\varphi(x)=\ln((e x + 1) / (e x - 1)) and when \(x>0\), \(\varphi(x)=\varphi\) -1 (x)\). The functions \(\varphi(x)\) and \(\varphi\) -1When implementing (x) in hardware, it may be implemented using a LUT (Look Up Table), and both will use the same LUT.
[0074] <Configuration example of a transmission system to which this technology is applied>
[0075] FIG. 7 is a diagram showing a configuration example of an embodiment of a transmission system (a system refers to a logically aggregated entity of a plurality of devices, and whether the devices of each configuration are in the same housing is not relevant) to which this technology is applied.
[0076] In FIG. 7, the transmission system is composed of a transmission device 11 and a reception device 12.
[0077] The transmission device 11 performs transmission (broadcasting) (transmission) of, for example, a program of a television broadcast. That is, the transmission device 11 encodes target data to be transmitted, such as image data and audio data as a program, into an LDPC code, and transmits it via a communication path 13 such as a satellite line, a terrestrial wave, or a cable (wired line).
[0078] The reception device 12 receives the LDPC code transmitted from the transmission device 11 via the communication path 13, decodes it into the 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 path.
[0080] On the other hand, in communication path 13, burst errors and erasures may occur. For example, particularly when communication path 13 is a terrestrial wave, in an OFDM (Orthogonal Frequency Division Multiplexing) system, in a multipath environment where D / U (Desired to Undesired Ratio) is 0 dB (Undesired = the power of echo is equal to the power of the main path), depending on the delay of the echo (a path other than the main path), the power of a specific symbol may become zero (erasure).
[0081] Also, in the case of flutter (a communication path where an echo with a Doppler frequency applied and a delay of 0 is added), when D / U is 0 dB, there may be a case where the power of the entire OFDM symbol at a specific time becomes zero (erasure) due to the Doppler frequency.
[0082] Furthermore, burst errors may occur due to the wiring situation from the receiving section (not shown), such as an antenna that receives the signal from the transmitting device 11, to the receiving device 12 on the receiving device 12 side, and the instability of the power supply of the receiving device 12.
[0083] On the other hand, in the decoding of the LDPC code, in the columns of the check matrix H, and thus in the variable nodes corresponding to the code bits of the LDPC code, as shown in FIG. 5, since the variable node operation of equation (1) involving the addition of the received values u 0i ) of the code bits of the LDPC code is performed, if an error occurs in the code bits used for the variable node operation, the accuracy of the required message decreases.
[0084] In the decoding of LDPC codes, at the check nodes, the check node operation of Equation (7) is performed using the messages obtained from the variable nodes connected to the check node. Therefore, when the number of check nodes where a plurality of connected variable nodes (the code bits of the LDPC code corresponding thereto) simultaneously have errors (including erasures) increases, the decoding performance deteriorates.
[0085] That is, for example, when two or more of the variable nodes connected to a check node simultaneously become erased, the check node returns messages with equal probabilities of 0 and 1 to all the variable nodes. In this case, the check nodes that return messages with equal probabilities do not contribute to one decoding process (one set of variable node operations and check node operations). As a result, a larger number of repetitions of the decoding process are required, the decoding performance deteriorates, and furthermore, the power consumption of the receiving device 12 that decodes the LDPC code increases.
[0086] Therefore, in the transmission system of FIG. 7, it is possible to improve the resistance to burst errors and erasures while maintaining the performance in an AWGN communication channel (AWGN channel).
[0087] <Configuration Example of Transmitting Device 11>
[0088] FIG. 8 is a block diagram showing a configuration example of the transmitting device 11 of FIG. 7.
[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 padding unit 112 performs necessary zero-padding (insertion of Null) on the data from the mode adaptation / multiplexer 111, and supplies the resulting data to the BB scrambler 113.
[0092] The BB scrambler 113 performs BB scrambling on the data from the padding unit 112, and supplies the resulting data to the BCH encoder 114.
[0093] The BCH encoder 114 BCH-encodes the data from the BB scrambler 113, and supplies the resulting data to the LDPC encoder 115 as LDPC target data to be LDPC-encoded.
[0094] The LDPC encoder 115 performs LDPC encoding on the LDPC target data from the BCH encoder 114 according to, for example, a check matrix in which the parity matrix corresponding to the parity bits of the LDPC code has a staircase (dual diagonal) structure, and outputs an LDPC code using the LDPC target data as information bits.
[0095] That is, the LDPC encoder 115 performs LDPC encoding to encode the LDPC target data into an LDPC code defined by a predetermined standard such as DVB-S.2, DVB-T.2, DVB-C.2, ATSC 3.0, etc. (corresponding to the check matrix) or other LDPC codes, and outputs the resulting LDPC code.
[0096] Here, the LDPC codes defined in the DVB-S.2 and ATSC3.0 standards, and the LDPC codes planned 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. Also, for IRA codes, for example, they are described in "Irregular Repeat-Accumulate Codes," H. Jin, A. Khandekar, and R. J. 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 the 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 LDPC code after the bit interleaving to the Mapper 117.
[0099] The Mapper 117 maps the LDPC code from the Bit Interleaver 116 to a signal point representing one symbol of quadrature modulation in units of one or more code bits (symbol units) of the LDPC code, and performs quadrature modulation (multi-value modulation).
[0100] That is, the Mapper 117 maps the LDPC code from the Bit Interleaver 116 to a signal point determined by the modulation method for performing quadrature modulation of the LDPC code on a constellation that is the IQ plane defined by the I-axis representing the I component in phase with the carrier and the Q-axis representing the Q component orthogonal to the carrier, and performs quadrature modulation.
[0101] When the number of signal points of the constellation used in the modulation method of the orthogonal modulation performed by the mapper 117 is 2 m pieces, the m-bit code bits of the LDPC code are used as a symbol (one symbol). In the mapper 117, the LDPC code from the bit interleaver 116 is mapped to the signal point representing the symbol among the 2 m signal points per symbol.
[0102] Here, as the modulation method of the orthogonal modulation performed by the mapper 117, for example, the 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. are available. In the mapper 117, which modulation method is used for the orthogonal 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 the time interleaver 118.
[0104] The time interleaver 118 performs time interleaving (interleaving in the time direction) on the data from the mapper 117 in units of symbols, and supplies the resulting data to the SISO / MISO encoder (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 it to the 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 it to the Frame Builder & Resource Allocation 131.
[0107] On the other hand, control data (signalling) for transmission control such as, for example, BB Signalling (BB Header) is supplied to the BCH encoder 121.
[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] The mapper 123, in the same manner as the mapper 117, maps the LDPC code from the LDPC encoder 122 to a signal point representing one symbol of quadrature modulation in units of one or more code bits of the LDPC code (symbol units) to perform quadrature modulation, and supplies the resulting data to the frequency interleaver 124.
[0111] The frequency interleaver 124 performs frequency interleaving on a symbol-by-symbol basis on the data from the mapper 123 in the same manner as the frequency interleaver 120, and supplies it to the Frame Builder & Resource Allocation 131.
[0112] The frame builder / resource allocation unit 131 inserts pilot symbols at the necessary positions of the data (symbols) from the frequency interleaver 120 and 124, and constructs a frame (for example, a PL (Physical Layer) frame, a T2 frame, a C2 frame, etc.) composed of a predetermined number of symbols from the resulting data (symbols), and supplies it to the OFDM generation unit 132.
[0113] The OFDM generation unit 132 generates an OFDM signal corresponding to the frame from the frame from the frame builder / resource allocation unit 131, and transmits it via the communication path 13 (FIG. 7).
[0114] Note that the transmission device 11 can be configured without providing some of the blocks illustrated in FIG. 8, such as the time interleaver 118, the SISO / MISO encoder 119, the frequency interleaver 120, and the frequency interleaver 124.
[0115] <Configuration example of the bit interleaver 116>
[0116] FIG. 9 is a block diagram showing a configuration example of the bit interleaver 116 in FIG. 8.
[0117] The bit interleaver 116 has a function of interleaving data, and is composed of a parity interleaver 23, a group-wise interleaver 24, and a block interleaver 25.
[0118] The parity interleaver 23 performs a parity interleaving that interleaves the parity bits of the LDPC code from the LDPC encoder 115 to the positions of other parity bits, and supplies the LDPC code after the parity interleaving to the 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 the block interleaver 25.
[0120] Here, in the group-wise interleaving, the LDPC code for one code is divided into 360-bit units equal to the unit size P described later from the beginning, and the 360 bits of one division are interleaved in bit group units from the LDPC code from the parity interleaver 23 as bit groups.
[0121] When performing group-wise interleaving, the error rate can be improved compared to the case where group-wise interleaving is not performed. As a result, good communication quality can be ensured in data transmission.
[0122] The block interleaver 25 performs block interleaving for demultiplexing the LDPC code from the group-wise interleaver 24. For example, the LDPC code for one code is symbolized into m-bit symbols that are the units of mapping, and supplied to the mapper 117 (FIG. 8).
[0123] Here, in the 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 a number equal to the number of bits m of the symbol. The LDPC code from the group-wise interleaver 24 is written in the column direction and read in the row direction, so that the LDPC code is symbolized into m-bit symbols.
[0124] <Check Matrix of LDPC Code>
[0125] FIG. 10 is a diagram showing an example of the check matrix H used for LDPC encoding in the LDPC encoder 115 of FIG. 8.
[0126] The check matrix H has an LDGM (Low-Density Generation Matrix) structure, and for the code bits of the LDPC code, the information matrix H corresponding to the information bits A and the parity matrix H corresponding to the parity bits T are used to represent the equation H = [H A | H T (where the elements of the information matrix H A are the left elements and the elements of the parity matrix H T are the right elements).
[0127] Here, the number of information bits and the number of parity bits among the code bits of an LDPC code of one codeword are referred to as the information length K and the parity length M, respectively, and the number of code bits of an LDPC code of one codeword 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 is a diagram showing an example of the parity matrix H of the check matrix H used for LDPC encoding in the LDPC encoder 115 of FIG. 8. T
[0130] As the parity matrix H of the check matrix H used for LDPC encoding in the 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 can be adopted. T
[0131] The parity matrix H of the check matrix H of the LDPC code defined in standards such as DVB-T.2 T As shown in FIG. 11, the elements of 1 form a staircase-structured matrix (lower bidiagonal matrix) in which the elements are arranged in a staircase pattern. The parity matrix H T has a row weight of 1 for the first row and 2 for all the remaining rows. Also, the column weight is 1 for the last column and 2 for all the remaining columns.
[0132] As described above, for the LDPC code with the parity matrix H T having a staircase structure, the inspection matrix H, it can be easily generated using the inspection matrix H.
[0133] That is, the LDPC code (one codeword) is represented by the row vector c, and the column vector obtained by transposing the row vector is denoted as c T Also, let the information bit part of the row vector c, which is the LDPC code, be represented by the row vector A, and the parity bit part be represented by the row vector T.
[0134] In this case, the row vector c can be expressed by the equation c = [A|T] (a row vector with the elements of the row vector A on the left side and the elements of the row vector T on the right side) using the row vector A as the information bits and the row vector T as the parity bits.
[0135] The inspection matrix H and the row vector c = [A|T] as the LDPC code must satisfy the equation Hc T = 0. For the row vector T as the parity bits that constitutes the row vector c = [A|T] satisfying the equation Hc T = 0, when the parity matrix H A |H T of the inspection matrix H T has the staircase structure shown in FIG. 11, it can be sequentially obtained by setting the elements of each row to 0 in order from the element in the first row of the column vector Hc T in the equation Hc T = 0.
[0136] FIG. 12 is a diagram for explaining a check matrix H of an LDPC code defined in a standard such as DVB-T.2.
[0137] For the KX columns starting from the first column of the check matrix H of the LDPC code defined in a standard such as DVB-T.2, the column weight is X, for the subsequent K3 columns, the column weight is 3, for the subsequent M - 1 columns, the column weight is 2, and for the last 1 column, the column weight is 1, respectively.
[0138] Here, KX + K3 + M - 1 + 1 is equal to the code length N.
[0139] FIG. 13 is a diagram showing the number of columns KX, K3, and M, and the column weight X for each coding rate r of the LDPC code defined in a standard such as DVB-T.2.
[0140] In a standard such as DVB-T.2, LDPC codes with code lengths N of 64800 bits and 16200 bits are defined.
[0141] For the LDPC code with a code length N of 64800 bits, 11 coding rates (nominal rate) 1 / 4, 1 / 3, 2 / 5, 1 / 2, 3 / 5, 2 / 3, 3 / 4, 4 / 5, 5 / 6, 8 / 9, and 9 / 10 are defined, and for the LDPC code with a code length N of 16200 bits, 10 coding rates 1 / 4, 1 / 3, 2 / 5, 1 / 2, 3 / 5, 2 / 3, 3 / 4, 4 / 5, 5 / 6, and 8 / 9 are defined.
[0142] Hereinafter, the code length N of 64800 bits is also referred to as 64k bits, and the code length N of 16200 bits is also referred to as 16k bits.
[0143] For an LDPC code, the error rate tends to be lower for the code bits corresponding to the columns with a larger column weight in the check matrix H.
[0144] In the check matrix H defined in standards such as DVB-T.2, as shown in FIGS. 12 and 13, the column weight tends to be larger for the columns on the leading side (left side). Therefore, for the LDPC code corresponding to the check matrix H, the leading code bits are more resistant to errors (have higher error tolerance), and the trailing code bits tend to be more vulnerable to errors.
[0145] <Parity interleaving>
[0146] Referring to FIGS. 14 to 16, the parity interleaving by the parity interleaver 23 in FIG. 9 will be described.
[0147] FIG. 14 is a diagram showing an example of a Tanner graph (a part) of a check matrix of an LDPC code.
[0148] As shown in FIG. 14, when a plurality of variable nodes (corresponding code bits) connected to a check node simultaneously become errors such as erasures, the check node returns messages with equal probabilities of 0 and 1 to all variable nodes connected to the check node. For this reason, when a plurality of variable nodes connected to the same check node simultaneously become erasures or the like, the decoding performance deteriorates.
[0149] Incidentally, the LDPC code output by the LDPC encoder 115 in FIG. 8 is, for example, an IRA code like the LDPC code defined in standards such as DVB-T.2, and the parity matrix H of the check matrix H T has a staircase structure as shown in FIG. 11.
[0150] FIG. 15 shows the parity matrix H having a staircase structure as shown in FIG. 11 T and an example of a Tanner graph corresponding to the parity matrix H T is a diagram showing an example of a Tanner graph corresponding to the parity matrix H
[0151] A in FIG. 15 is the parity matrix H having a staircase structure Tshows an example, and B in FIG. 15 shows the Tanner graph corresponding to the parity matrix H of A in FIG. 15 T Here, the parity matrix H
[0152] with a staircase structure T is such that in each row, the elements of 1 are adjacent (except for the first row). Therefore, in the Tanner graph of the parity matrix H T for the two adjacent variable nodes corresponding to the columns of two adjacent elements where the value of the parity matrix H T is 1, the two adjacent variable nodes are connected to the same check node.
[0153] Therefore, when the parity bits corresponding to the above two adjacent variable nodes simultaneously become errors due to burst errors, erasures, etc., the check nodes connected to the two variable nodes (variable nodes for obtaining a message using the parity bits) corresponding to the two parity bits that have become errors return messages with equal probabilities of 0 and 1 to the variable nodes connected to that check node, resulting in degraded decoding performance. And as the burst length (the number of bits of parity bits that consecutively become errors) increases, the number of check nodes that return messages with equal probabilities increases, and the decoding performance further degrades.
[0154] Therefore, in order to prevent the above-described degradation of decoding performance, the parity interleaver 23 (FIG. 9) performs a parity interleaving that interleaves the parity bits of the LDPC code from the LDPC encoder 115 to the positions of other parity bits.
[0155] FIG. 16 is a diagram showing the parity matrix H of the check matrix H corresponding to the LDPC code after the parity interleaving performed by the parity interleaver 23 in FIG. 9 T Here, the information matrix H of the check matrix H corresponding to the LDPC code output by the LDPC encoder 115
[0156] A Similar to the information matrix of the check matrix H corresponding to the LDPC code defined in standards such as DVB-T.2, it has a cyclic structure.
[0157] The cyclic structure refers to a structure where a certain column coincides with a column obtained by cyclically shifting another column. For example, for each P column, the positions of 1s in each row of the P column are at positions 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 column by the parity length M. Hereinafter, the P column in the cyclic structure is appropriately referred to as the unit size.
[0158] As the LDPC codes defined in standards such as DVB-T.2, as described in FIGS. 12 and 13, there are two types of LDPC codes with code lengths N of 64800 bits and 16200 bits. 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 has a value other than a prime number represented by the formula M = q×P = q×360 using different values q depending on the coding rate. Therefore, the value q is also, like the unit size P, another one of the divisors of the parity length M, excluding 1 and M. The parity length M 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, for the parity interleaver 23, assuming the information length is K, an integer x satisfying 0 ≤ x < P, and an integer y satisfying 0 ≤ y < q, as the parity interleaving, the (K + qx + y + 1)-th code bit among the code bits of the N-bit LDPC code is interleaved to the position of the (K + Py + x + 1)-th code bit.
[0161] Since the (K + qx + y + 1)-th parity bit and the (K + Py + x + 1)-th parity bit are both parity bits after the (K + 1)-th bit, according to the parity interleaving, the positions of the parity bits of the LDPC code are shifted.
[0162] According to such parity interleaving, the variable nodes (corresponding parity bits) connected to the same check node are separated by a unit size P, that is, 360 bits here. Therefore, when the burst length is less than 360 bits, it is possible to avoid a situation where a plurality of variable nodes connected to the same check node simultaneously have errors. As a result, the tolerance to burst errors can be improved.
[0163] Note that the LDPC code after the parity interleaving that interleaves the (K + qx + y + 1)-th parity bit to the position of the (K + Py + x + 1)-th parity bit matches the LDPC code of the check matrix (hereinafter also referred to as the transformed check matrix) obtained by performing a column replacement that replaces the (K + qx + y + 1)-th column of the original check matrix H with the (K + Py + x + 1)-th column.
[0164] Also, in the parity matrix of the transformed check matrix, as shown in FIG. 16, a pseudo-cyclic structure with P columns (360 columns in FIG. 16) as a unit appears.
[0165] Here, the pseudo-cyclic structure means a structure in which a part except for a part is a cyclic structure.
[0166] For the check matrix of the LDPC code defined in standards such as DVB-T.2, the transformed check matrix obtained by performing a column replacement corresponding to the parity interleaving has only one less 1 element (it becomes a 0 element) in the upper right corner part of the transformed check matrix, which is a 360-row × 360-column part (a shift matrix described later). In this regard, it is not a (complete) cyclic structure but a pseudo-cyclic structure.
[0167] The conversion check matrix for the LDPC code output by the LDPC encoder 115 has a pseudo-cyclic structure, for example, similar to the conversion check matrix for the LDPC code defined in standards such as DVB-T.2.
[0168] Note that the conversion check matrix in FIG. 16 is a matrix obtained by performing column permutation corresponding to parity interleaving on the original check matrix H, and also performing row permutation (row permutation) to make the conversion check matrix composed of the configuration matrices described later.
[0169] FIG. 17 is a flowchart for explaining the processes performed by the LDPC encoder 115, the bit interleaver 116, and the mapper 117 in FIG. 8.
[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, supplies the LDPC code to the bit interleaver 116, and the process proceeds to step S102.
[0171] The bit interleaver 116 performs bit interleaving on the LDPC code from the LDPC encoder 115 in step S102, supplies the symbol 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 it to the block interleaver 25.
[0174] Block interleaver 25 performs block interleaving on the LDPC code after group-wise interleaving by group-wise interleaver 24, and supplies the resulting m-bit symbols to mapper 117.
[0175] In step S103, mapper 117 maps the symbols from block interleaver 25 to any one of 2 m signal points determined by the modulation method of quadrature modulation performed by mapper 117, performs quadrature modulation, and supplies the resulting data to time interleaver 118.
[0176] As described above, by performing parity interleaving and group-wise interleaving, the error rate when transmitting a plurality of code bits of an LDPC code as one symbol can be improved.
[0177] Here, in FIG. 9, for the sake of convenience of explanation, parity interleaver 23 which is a block performing parity interleaving and group-wise interleaver 24 which is a block performing group-wise interleaving are separately configured. However, parity interleaver 23 and group-wise interleaver 24 can be integrally configured.
[0178] That is, both parity interleaving and group-wise interleaving can be performed by writing and reading code bits to / from a memory, and can be represented by a matrix that converts the address (write address) for writing code bits into the address (read address) for reading code bits.
[0179] Therefore, if a matrix obtained by multiplying a matrix representing a parity interleaving and a matrix representing a group-wise interleaving is obtained, by those matrices, by converting code bits, parity interleaving can be performed, and further, a result of group-wise interleaving 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 integrally configured.
[0181] That is, the block interleaving performed by the block interleaver 25 can also be represented by a matrix that converts the write address of the memory storing the LDPC code into the read address.
[0182] Therefore, if a matrix obtained by multiplying a matrix representing a parity interleaving, a matrix representing a group-wise interleaving, and a matrix representing a block interleaving is obtained, by those matrices, parity interleaving, group-wise interleaving, and block interleaving can be performed collectively.
[0183] Note that one or both of the parity interleaving and the group-wise interleaving can be not 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 64800 bits and 16200 bits are defined.
[0188] For LDPC codes 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 LDPC codes 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 various coding rates and code lengths N such as 64,800 bits and 16,200 bits according to a check matrix H prepared for each code length N and each coding rate.
[0190] In addition, the LDPC encoder 115 can perform LDPC encoding according to 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 is composed of 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. It performs LDPC encoding on 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, for example, the code length N and coding rate r of the LDPC code, as well as other specific information for specifying the LDPC code, according to the operation of the operator or the like.
[0194] The initial value table reading unit 612 reads out a check matrix initial value table, which will be described later and represents the check matrix of the LDPC code specified by the specific information set by the coding rate setting unit 611, from the storage unit 602.
[0195] Based on the check matrix initial value table read by the initial value table reading unit 612, the check matrix generation unit 613 generates a check matrix H and stores it in the storage unit 602. For example, the check matrix generation unit 613 corresponds to an information matrix H for an information length K (= code length N - parity length M) corresponding 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 the elements of 1 in the column direction at a period of 360 columns (unit size P) each and stored in the storage unit 602.
[0196] The information bit reading unit 614 reads out (extracts) the information bits of the information length K from the LDPC target data supplied to the LDPC encoder 115.
[0197] The encoding parity calculation unit 615 reads out the check matrix H generated by the check matrix generation unit 613 from the storage unit 602, and uses the check matrix H to calculate the parity bits for the information bits read 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] Stored in the storage unit 602 are, for example, a plurality of check matrix initial value tables corresponding to each of a plurality of coding rates and the like shown in FIGS. 12 and 13 for each code length N of 64800 bits, 16200 bits, etc. Further, the storage unit 602 temporarily stores the data necessary for the processing of the encoding processing unit 601.
[0200] FIG. 19 is a flowchart for explaining an example of the processing of the LDPC encoder 115 in FIG. 18.
[0201] In step S201, the coding rate setting unit 611 sets the code length N for performing LDPC coding, the coding rate r, and specific information for specifying other LDPC codes.
[0202] In step S202, the initial value table reading unit 612 reads out a predetermined check matrix initial value table specified by the code length N and the coding rate r, etc. as the specific information set by the coding rate setting unit 611, from the storage unit 602.
[0203] In step S203, the check matrix generation unit 613 obtains (generates) the check matrix H of the LDPC code with the code length N and the coding rate r set by the coding rate setting unit 611, using the check matrix initial value table read out by the initial value table reading unit 612 from the storage unit 602, and supplies it to the storage unit 602 for storage.
[0204] In step S204, the information bit reading unit 614 reads out information bits with an information length K (= N × r) corresponding to the code length N and the coding rate r set by the coding rate setting unit 611, from the LDPC target data supplied to the LDPC encoder 115, and reads out the check matrix H obtained by the check matrix generation unit 613 from the storage unit 602, and supplies it to the coding parity calculation unit 615.
[0205] In step S205, the coding parity calculation unit 615 sequentially calculates the parity bits of the codeword c that satisfies equation (8), using the information bits from the information bit reading unit 614 and the check matrix H.
[0206] Hc T =0 ···(8)
[0207] In equation (8), c represents a row vector as the codeword (LDPC code), and c T represents the transpose of the row vector c.
[0208] Here, as described above, when the information bit portion of the row vector c as the LDPC code (one codeword) is represented by the row vector A and the parity bit portion is represented by the row vector T, the row vector c can be represented by the formula c = [A|T] using the row vector A as the information bit and the row vector T as the parity bit.
[0209] The check matrix H and the row vector c = [A|T] as the LDPC code satisfy the formula Hc T = 0, and the row vector T as the parity bit that constitutes the row vector c = [A|T] satisfying the formula Hc T = 0, when the parity matrix H of the check matrix H = [H A |H T has the staircase structure shown in FIG. 11, the column vector Hc in the formula Hc T = 0 can be sequentially obtained by setting the elements of each row to 0 in order from the element in the first row of the column vector Hc. T = 0. T = 0.
[0210] The encoding parity calculation unit 615 obtains the parity bit T for the information bit A from the information bit reading unit 614, and outputs the 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] Thereafter, in step S206, the control unit 616 determines whether to end the LDPC encoding. If it is determined in step S206 that the LDPC encoding is not ended, 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 hereinafter, the processes of steps S201 (or step S204) to S206 are repeated.
[0212] Also, in step S206, when it is determined that the LDPC encoding is completed, that is, for example, when there is no LDPC target data to be LDPC-encoded, the LDPC encoder 115 ends the process.
[0213] Regarding the LDPC encoder 115, it is possible to prepare in advance a check matrix initial value table (representing a check matrix) for LDPC codes with various code lengths N and coding rates r. The LDPC encoder 115 can perform LDPC encoding for LDPC codes with various code lengths N and coding rates r using the 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 the information length K according to the code length N and coding rate r of the LDPC code (LDPC code defined by the check matrix H) of the check matrix H A (FIG. 10) It is a table representing the position of the element 1 every 360 columns (unit size P), and is created in advance for each 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 the element 1 every 360 columns (unit size P).
[0217] Also, for the check matrix H, there is a check matrix in which all of the parity matrix H T has a staircase structure, and a check matrix in which a part of the parity matrix H T has a staircase structure and the remaining part is a diagonal matrix (identity matrix).
[0218] Hereinafter, the expression method of the check matrix initial value table representing a check matrix in which a part of the parity matrix H T has a staircase structure and the remaining part is a diagonal matrix is also referred to as the type A method. Also, the parity matrix H TThe expression method of the inspection matrix initial value table representing the inspection matrix whose entirety has a staircase structure is also called the Type B method.
[0219] Also, the LDPC code for the inspection matrix represented by the inspection matrix initial value table of the Type A method is also called the Type A code, and the LDPC code for the inspection matrix represented by the inspection matrix initial value table of the Type B method is also called the Type B code.
[0220] The designations "Type A" and "Type B" are designations conforming to the ATSC 3.0 standard. For example, in ATSC 3.0, both the Type A code and the Type B code are adopted.
[0221] Note that in DVB-T.2 etc., the Type B code is adopted.
[0222] FIG. 20 is a diagram showing an example of the inspection matrix initial value table of the Type B method.
[0223] That is, FIG. 20 shows the inspection matrix initial value table (representing the inspection matrix H) of the Type B code with a code length N of 16,200 bits and a coding rate r (coding rate in the notation of DVB-T.2) of 1 / 4 as defined in the DVB-T.2 standard.
[0224] The inspection matrix generation unit 613 (FIG. 18) obtains the inspection matrix H as follows using the inspection matrix initial value table of the Type B method.
[0225] FIG. 21 is a diagram for explaining a method of obtaining the inspection matrix H from the inspection matrix initial value table of the Type B method.
[0226] That is, FIG. 21 shows the inspection matrix initial value table of the Type B code with a code length N of 16,200 bits and a coding rate r of 2 / 3 as defined in the DVB-T.2 standard.
[0227] The inspection matrix initial value table of the Type B method is the information matrix H corresponding to the information length K corresponding to the code length N and the coding rate r of the LDPC code AIt is a table representing the positions of the 1 elements of the entire 1 in units of 360 columns (unit size P). In the i-th row, the row numbers of the 1 elements in the (1 + 360×(i - 1))-th column of the check matrix H (the row numbers with the row number of the first row of the check matrix H being 0) are arranged as many as the column weight of the column in the (1 + 360×(i - 1))-th column.
[0228] Here, for the check matrix H of the type B method, the parity matrix H corresponding to the parity length M T (Fig. 10) is determined to have a staircase structure as shown in Fig. 15. Therefore, if the information matrix H A (Fig. 10) corresponding to the information length K can be obtained from the check matrix initial value table, 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 check matrix initial value table.
[0231] K=(k + 1)×360 ···(9)
[0232] Here, 360 in Equation (9) is the unit size P explained in Fig. 16.
[0233] In the check matrix initial value table of Fig. 21, 13 numerical values are arranged from the first row to the third row, and 3 numerical values are arranged from the fourth row to the (k + 1)-th row (the 30th row in Fig. 21).
[0234] Therefore, the column weights of the check matrix H obtained from the check matrix initial value table of Fig. 21 are 13 from the first column to the (1 + 360×(3 - 1) - 1)-th column, and 3 from the (1 + 360×(3 - 1))-th column to the K-th column.
[0235] The first row of the inspection matrix initial value table in Fig. 21 is 0, 2084, 1613, 1548, 1286, 1460, 3196, 4297, 2481, 3369, 3451, 4620, 2622, which indicates that in the first column of the inspection 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] Also, the second row of the inspection matrix initial value table in Fig. 21 is 1, 122, 1516, 3448, 2880, 1407, 1847, 3799, 3529, 373, 971, 4358, 3108, which indicates that in the 361(=1 + 360×(2 - 1))-th column of the inspection 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 inspection matrix initial value table represents the positions of the 1 elements of the information matrix H A of the inspection matrix H every 360 columns.
[0238] For columns other than the 1 + 360×(i - 1)-th column of the inspection matrix H, that is, for each column from the 2 + 360×(i - 1)-th column to the 360×i-th column, the 1 element of the 1 + 360×(i - 1)-th column determined by the inspection matrix initial value table is cyclically shifted downward (in the downward direction of 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 at the j-th column (the j-th from the left) of the i-th row (the i-th from the top) of the check matrix initial value table be h i,j and at the same time, let the row number of the j-th 1 element in the w-th column of the check matrix H be H w-j Then, for the w-th column other than the 1 + 360×(i - 1)-th column of the check matrix H, the row number H of the 1 element w-j can be obtained by 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] Also, P is the unit size described above, and in this embodiment, for example, like the standards of DVB-T.2 or ATSC 3.0, it is 360. Further, q is the value M / 360 obtained by dividing the parity length M by the unit size P (= 360).
[0244] The check matrix generation unit 613 (FIG. 18) specifies the row number of the 1 element in the 1 + 360×(i - 1)-th column of the check matrix H according to the check matrix initial value table.
[0245] Furthermore, the check matrix generation unit 613 (FIG. 18) obtains the row number H of the 1 element in the w-th column, which is a column other than the 1 + 360×(i - 1)-th column of the check matrix H, according to Equation (10), and generates a check matrix H in which the elements of the obtained row numbers are 1. w-j
[0246] FIG. 22 is a diagram showing the structure of the check matrix H of the type A method.
[0247] The check matrix of the type A method is composed of an A matrix, a B matrix, a C matrix, a D matrix, and a Z matrix.
[0248] The A matrix is the upper left matrix of the check matrix H, which is an M1-row K-column matrix represented by a predetermined value M1 and the information length K of the LDPC code = code length N × coding rate r.
[0249] The B matrix is a staircase-structured matrix with M1 rows and M1 columns, adjacent to the right of the A matrix.
[0250] The C matrix is a matrix with N - K - M1 rows and K + M1 columns, adjacent to the bottom of the A matrix and the B matrix.
[0251] The D matrix is an identity matrix with N - K - M1 rows and N - K - M1 columns, adjacent to the right of the C matrix.
[0252] The Z matrix is a zero matrix (0 matrix) with M1 rows and N - K - M1 columns, adjacent to the right of the B matrix.
[0253] In the type A check matrix H composed of the above A matrix to D matrix and Z matrix, a part of the A matrix and the C matrix constitutes the information matrix, and the B matrix, the remaining part of the C matrix, the D matrix, and the Z matrix constitute the parity matrix.
[0254] Since the B matrix is a staircase-structured matrix and the D matrix is an identity matrix, the parity matrix of the type A check matrix H has a part (the part of the B matrix) with a staircase structure and the remaining part (the part of the D matrix) is a diagonal matrix (identity matrix).
[0255] The A matrix and the C matrix have a cyclic structure for each column of unit size P (for example, 360 columns), similar to the information matrix of the type B check matrix H. The type A check matrix initial value table represents the positions of the 1 elements of the A matrix and the C matrix every 360 columns.
[0256] Here, as described above, since a part of the A matrix and the C matrix constitutes the information matrix, it can be said that the type A check matrix initial value table representing the positions of the 1 elements of the A matrix and the C matrix every 360 columns represents at least the positions of the 1 elements of the information matrix every 360 columns.
[0257] Note that since the initial value table of the type A check matrix represents the positions of the 1 elements of the A matrix and the C matrix every 360 columns, it can also be said that it represents the positions of the 1 elements of a part of the check matrix (the remaining part of the C matrix) every 360 columns.
[0258] FIG. 23 is a diagram showing an example of the initial value table of the type A check matrix.
[0259] That is, FIG. 23 shows an example of the initial value table of the check matrix representing the check matrix H with a code length N of 35 bits and a coding rate r of 2 / 7.
[0260] The initial value table of the type A check matrix is a table that represents the positions of the 1 elements of the A matrix and the C matrix for each unit size P. In the i-th row, the row numbers of the 1 elements in the (1 + P×(i - 1))-th column of the check matrix H (the row number with the row number of the first row of the check matrix H being 0) are arranged as many as the column weight of the column in the (1 + P×(i - 1))-th column.
[0261] Here, for simplicity of explanation, it is assumed that the unit size P is, for example, 5.
[0262] For the type A check matrix H, there are 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 is adjusted to a predetermined value when determining the check matrix H. Here, it is assumed that 15, which is 3 times the unit size P = 5, is adopted as M1.
[0264] M2 (FIG. 22) takes 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 N - K = 35 - 10 = 25. Therefore, M2 is M - M1 = 25 - 15 = 10.
[0266] Q1 is obtained according to the formula Q1 = M1 / P and represents the number of shifts (number of rows) of the cyclic shift in the A matrix.
[0267] That is, for columns other than the (1 + P×(i - 1))-th column of the A matrix in the check matrix H of the type A method, namely, columns from the (2 + P×(i - 1))-th column to the (P×i)-th column, each column is obtained by cyclically shifting the 1 element of the (1 + P×(i - 1))-th column determined by the check matrix initial value table downward (downward in the column) periodically. Q1 represents the number of shifts of such a cyclic shift in the A matrix.
[0268] Q2 is obtained according to the formula Q2 = M2 / P and represents the number of shifts (number of rows) of the cyclic shift in the C matrix.
[0269] That is, for columns other than the (1 + P×(i - 1))-th column of the C matrix in the check matrix H of the type A method, namely, columns from the (2 + P×(i - 1))-th column to the (P×i)-th column, each column is obtained by cyclically shifting the 1 element of the (1 + P×(i - 1))-th column determined by the check matrix initial value table downward (downward in the column) periodically. Q2 represents the number of shifts of such a cyclic shift in the C matrix.
[0270] Here, Q1 is M1 / P = 15 / 5 = 3, and Q2 is M2 / P = 10 / 5 = 2.
[0271] In the check matrix initial value table of FIG. 23, three numerical values are arranged in the first and second rows, and one numerical value is arranged from the third row to the fifth row. According to such an arrangement of numerical values, the column weights of the A matrix and the C matrix parts of the check matrix H obtained from the check matrix initial value table of FIG. 23 are 3 from the (1 = 1 + 5×(1 - 1))-th column to the (10 = 5×2)-th column, and 1 from the (11 = 1 + 5×(3 - 1))-th column to the (25 = 5×5)-th column.
[0272] That is, the first row of the initial value table of the check matrix in FIG. 23 is 2, 6, 18, which indicates that in the first column of the check matrix H, the elements in the rows with row numbers 2, 6, and 18 are 1 (and the other elements are 0).
[0273] Here, in the present case, since the A matrix (FIG. 22) is a 15-row and 10-column (M1-row and K-column) matrix, and the C matrix (FIG. 22) is a 10-row and 25-column ((N - K - M1)-row and (K + M1)-column) matrix, the rows with row numbers 0 to 14 of the check matrix H are the rows of the A matrix, and the rows with row numbers 15 to 24 of the check matrix H are the rows of the C matrix.
[0274] Therefore, among the rows with row numbers 2, 6, 18 (hereinafter described as row #2, #6, #18), row #2 and #6 are the rows of the A matrix, and row #18 is the row of the C matrix.
[0275] The second row of the initial value table of the check matrix in FIG. 23 is 2, 10, 19, which indicates that in the 6 (= 1 + 5×(2 - 1))-th column of the check matrix H, the elements of row #2, #10, #19 are 1.
[0276] Here, in the 6 (= 1 + 5×(2 - 1))-th column of the check matrix H, among row #2, #10, #19, row #2 and #10 are the rows of the A matrix, and row #19 is the row of the C matrix.
[0277] The third row of the initial value table of the check matrix in FIG. 23 is 22, which indicates that in the 11 (= 1 + 5×(3 - 1))-th column of the check matrix H, the element of row #22 is 1.
[0278] Here, in the 11 (= 1 + 5×(3 - 1))-th column of the check matrix H, row #22 is the row of the C matrix.
[0279] Similarly, the 19 in the fourth row of the check matrix initial value table in FIG. 23 indicates that the element in row #19 is 1 in the 16(=1 + 5×(4 - 1))-th column of the check matrix H. The 15 in the fifth row of the check matrix initial value table in FIG. 23 indicates that the element in row #15 is 1 in the 21(=1 + 5×(5 - 1))-th column of the check matrix H.
[0280] As described above, the check matrix initial value table represents the positions of the 1 elements in the A matrix and the C matrix of the check matrix H every P = 5 columns.
[0281] For columns other than the 1 + 5×(i - 1)-th column in the A matrix and the C matrix of the check matrix H, that is, for each column from the 2 + 5×(i - 1)-th column to the 5×i-th column, the 1 element in the 1 + 5×(i - 1)-th column determined by the check matrix initial value table is cyclically shifted downward (in the downward direction of the column) periodically according to the parameters Q1 and Q2.
[0282] That is, for example, the 2 + 5×(i - 1)-th column in the A matrix is obtained by cyclically shifting the 1 + 5×(i - 1)-th column downward by Q1(=3). The next 3 + 5×(i - 1)-th column is obtained by cyclically shifting the 1 + 5×(i - 1)-th column downward by 2×Q1(=2×3) (the 2 + 5×(i - 1)-th column shifted downward by Q1).
[0283] Also, for example, the 2 + 5×(i - 1)-th column in the C matrix is obtained by cyclically shifting the 1 + 5×(i - 1)-th column downward by Q2(=2). The next 3 + 5×(i - 1)-th column is obtained by cyclically shifting the 1 + 5×(i - 1)-th column downward by 2×Q2(=2×2) (the 2 + 5×(i - 1)-th column shifted downward by Q2).
[0284] FIG. 24 is a diagram showing the A matrix generated from the check matrix initial value table in FIG. 23.
[0285] In the A matrix of FIG. 24, according to the first row of the initial value table of the check matrix in FIG. 23, the elements of row #2 and #6 in the 1st (=1 + 5×(1 - 1)) column are 1.
[0286] And for each column from the 2nd (=2 + 5×(1 - 1)) column to the 5th (=5 + 5×(1 - 1)) column, each column is obtained by cyclically shifting the previous column downward by Q1 = 3.
[0287] Furthermore, in the A matrix of FIG. 24, according to the second row of the initial value table of the check matrix in FIG. 23, the elements of row #2 and #10 in the 6th (=1 + 5×(2 - 1)) column are 1.
[0288] And for each column from the 7th (=2 + 5×(2 - 1)) column to the 10th (=5 + 5×(2 - 1)) column, each column is obtained by cyclically shifting the previous column downward by Q1 = 3.
[0289] FIG. 25 is a diagram showing the parity interleaving of the B matrix.
[0290] The check matrix generation unit 613 (FIG. 18) generates the A matrix using the initial value table of the check matrix, and arranges the B matrix with a staircase structure to the right adjacent to the A matrix. Then, the check matrix generation unit 613 regards the B matrix as a parity matrix and performs parity interleaving so that the adjacent 1 elements of the B matrix with a staircase structure are separated by the unit size P = 5 in the row direction.
[0291] FIG. 25 shows the A matrix and the B matrix after the parity interleaving of the B matrix in FIG. 24.
[0292] FIG. 26 is a diagram showing the C matrix generated from the initial value table of the check matrix in FIG. 23.
[0293] In the C matrix of FIG. 26, according to the first row of the initial value table of the check matrix in FIG. 23, the element of row #18 in the 1st (=1 + 5×(1 - 1)) column of the check matrix H is 1.
[0294] And, each column from the second column to the fifth column of the C matrix is obtained by cyclically shifting the immediately preceding column downward by Q2 = 2.
[0295] Furthermore, in the C matrix of FIG. 26, according to the second row to the fifth row of the inspection matrix initial value table of FIG. 23, the elements of row #19 in the sixth (= 1 + 5×(2 - 1)) column, row #22 in the eleventh (= 1 + 5×(3 - 1)) column, row #19 in the sixteenth (= 1 + 5×(4 - 1)) column, and row #15 in the twenty - first (= 1 + 5×(5 - 1)) column of the inspection matrix H are 1.
[0296] And, each column from the seventh (= 2 + 5×(2 - 1)) column to the tenth (= 5 + 5×(2 - 1)) column, each column from the twelfth (= 2 + 5×(3 - 1)) column to the fifteenth (= 5 + 5×(3 - 1)) column, each column from the seventeenth (= 2 + 5×(4 - 1)) column to the twentieth (= 5 + 5×(4 - 1)) column, and each column from the twenty - second (= 2 + 5×(5 - 1)) column to the twenty - fifth (= 5 + 5×(5 - 1)) column is obtained by cyclically shifting the immediately preceding column downward by Q2 = 2.
[0297] The inspection matrix generation unit 613 (FIG. 18) generates a C matrix using the inspection matrix initial value table, and arranges the C matrix below the A matrix and the B matrix (after parity interleaving).
[0298] Furthermore, the inspection matrix generation unit 613 arranges a Z matrix to the right of the B matrix and arranges a D matrix to the right of the C matrix to generate the inspection matrix H shown in FIG. 26.
[0299] FIG. 27 is a diagram showing the parity interleaving of the D matrix.
[0300] After generating the inspection matrix H of FIG. 26, the inspection matrix generation unit 613 regards the D matrix as a parity matrix and performs (parity interleaving of only the D matrix) such that the 1 elements of the odd - numbered rows and the next even - numbered rows of the unit - matrix D matrix are separated by a unit size P = 5 in the row direction.
[0301] FIG. 27 shows a check matrix H after performing parity interleaving of the D matrix for the check matrix H of FIG. 26.
[0302] The LDPC encoder 115 (the encoding parity operation unit 615 (FIG. 18) thereof) performs LDPC encoding (generation of an LDPC code), for example, using the check matrix H of FIG. 27.
[0303] Here, the LDPC code generated using the check matrix H of FIG. 27 is an LDPC code that has undergone parity interleaving. Therefore, for the LDPC code generated using the check matrix H of FIG. 27, it is not necessary to perform parity interleaving in the parity interleaver 23 (FIG. 9). That is, since the LDPC code generated using the check matrix H after performing parity interleaving of the D matrix is an LDPC code that has undergone parity interleaving, for such an LDPC code, the parity interleaving in the parity interleaver 23 is skipped.
[0304] FIG. 28 is a diagram showing a check matrix H obtained by performing column permutation as parity deinterleaving to restore the parity interleaving for the B matrix, a part of the C matrix (the part of the C matrix arranged below the B matrix), and the D matrix of the check matrix H of FIG. 27.
[0305] The LDPC encoder 115 can perform LDPC encoding (generation of an LDPC code) using the check matrix H of FIG. 28.
[0306] When performing LDPC encoding using the check matrix H of FIG. 28, according to the LDPC encoding, an LDPC code that has not undergone parity interleaving is obtained. Therefore, when performing LDPC encoding using the check matrix H of FIG. 28, parity interleaving is performed in the parity interleaver 23 (FIG. 9).
[0307] FIG. 29 is a diagram showing a transformed check matrix H obtained by performing a row permutation on the check matrix H of FIG. 27.
[0308] As will be described later, the transformed check matrix is a matrix represented by a combination of a P×P identity matrix, a sub-identity matrix in which one or more of the 1s of the identity matrix have become 0, a shift matrix obtained by cyclically shifting the identity matrix or the sub-identity matrix, a sum matrix that is a sum of two or more of the identity matrix, the sub-identity matrix, or the shift matrix, and a P×P zero matrix.
[0309] By using the transformed check matrix for decoding an LDPC code, in the decoding of the LDPC code, as will be described later, an architecture can be adopted in which check node operations and variable node operations are performed simultaneously for P at a time.
[0310] <New LDPC code>
[0311] In data transmission using an LDPC code, as one method for ensuring good communication quality, there is a method of using an LDPC code with good performance.
[0312] Hereinafter, a new LDPC code with good performance (hereinafter also referred to as the new LDPC code) will be described.
[0313] As the new LDPC code, for example, a type A code or a type B code corresponding to a check matrix H with a cyclic structure can be adopted in which the unit size P is 360, similar to DVB-T.2 or ATSC 3.0.
[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 (from which a check matrix H is obtained) of a new LDPC code with a code length N longer than 64 k bits, for example, 69,120 bits, and an encoding rate r of, for example, any one of 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 of a new LDPC code is stored in the storage unit 602 of the LDPC encoder 115 (Fig. 8).
[0316] Fig. 30 shows an example of a check matrix initial value table (of the type A method) representing a check matrix H of a type A code as a new LDPC code with a code length N of 69,120 bits and an encoding rate r of 2 / 16 (hereinafter also referred to as a type A code with r = 2 / 16).
[0317] Figs. 31 and 32 show examples of check matrix initial value tables representing a check matrix H of a type A code as a new LDPC code with a code length N of 69,120 bits and an encoding rate r of 3 / 16 (hereinafter also referred to as a type A code with r = 3 / 16).
[0318] Note that Fig. 32 is a figure following Fig. 31.
[0319] Fig. 33 shows an example of a check matrix initial value table representing a check matrix H of a type A code as a new LDPC code with a code length N of 69,120 bits and an encoding rate r of 4 / 16 (hereinafter also referred to as a type A code with r = 4 / 16).
[0320] Figs. 34 and 35 show examples of check matrix initial value tables representing a check matrix H of a type A code as a new LDPC code with a code length N of 69,120 bits and an encoding rate r of 5 / 16 (hereinafter also referred to as a type A code with r = 5 / 16).
[0321] Note that FIG. 35 is a figure following FIG. 34.
[0322] FIGS. 36 and 37 are diagrams showing examples of a check matrix initial value table representing a check matrix H of a type A code (hereinafter also referred to as a type A code with r = 6 / 16) as a new LDPC code with a code length N of 69,120 bits and a coding rate r of 6 / 16.
[0323] Note that FIG. 37 is a figure following FIG. 36.
[0324] FIGS. 38 and 39 are diagrams showing examples of a check matrix initial value table representing a check matrix H of a type A code (hereinafter also referred to as a type A code with r = 7 / 16) as a new LDPC code with a code length N of 69,120 bits and a coding rate r of 7 / 16.
[0325] Note that FIG. 39 is a figure following FIG. 38.
[0326] FIGS. 40 and 41 are diagrams showing examples of a check matrix initial value table representing a check matrix H of a type A code (hereinafter also referred to as a type A code with r = 8 / 16) as a new LDPC code with a code length N of 69,120 bits and a coding rate r of 8 / 16.
[0327] Note that FIG. 41 is a figure following FIG. 40.
[0328] FIGS. 42 and 43 are diagrams showing examples of a (type B method) check matrix initial value table representing a check matrix H of a type B code (hereinafter also referred to as a type B code with r = 7 / 16) as a new LDPC code with a code length N of 69,120 bits and a coding rate r of 7 / 16.
[0329] Note that FIG. 43 is a figure following FIG. 42.
[0330] FIGS. 44 and 45 are diagrams showing other examples of a check matrix initial value table representing a check matrix H of a type B code with r = 7 / 16.
[0331] Note that Fig. 45 is a figure following Fig. 44. The type B code with r = 7 / 16 obtained from the check matrix initial value table (representing the check matrix H) in Fig. 44 and Fig. 45 is hereinafter also referred to as other type B codes with r = 7 / 16.
[0332] Figs. 46 and 47 are diagrams showing examples of a check matrix initial value table representing a check matrix H of a type B code (hereinafter also referred to as a type B code with r = 8 / 16) as a new LDPC code with a code length N of 69,120 bits and a coding rate r of 8 / 16.
[0333] Note that Fig. 47 is a figure following Fig. 46.
[0334] Figs. 48 and 49 are diagrams showing other examples of a check matrix initial value table representing a check matrix H of a type B code with r = 8 / 16.
[0335] Note that Fig. 49 is a figure following Fig. 48. The type B code with r = 8 / 16 obtained from the check matrix initial value tables in Fig. 48 and Fig. 49 is hereinafter also referred to as other type B codes with r = 8 / 16.
[0336] Figs. 50, 51, and 52 are diagrams showing examples of a check matrix initial value table representing a check matrix H of a type B code (hereinafter also referred to as a type B code with r = 9 / 16) as a new LDPC code with a code length N of 69,120 bits and a coding rate r of 9 / 16.
[0337] Note that Fig. 51 is a figure following Fig. 50, and Fig. 52 is a figure following Fig. 51.
[0338] Figs. 53, 54, and 55 are diagrams showing other examples of a check matrix initial value table representing a check matrix H of a type B code with r = 9 / 16.
[0339] Note that Fig. 54 is a figure following Fig. 53, and Fig. 55 is a figure following Fig. 54. The type B code with r = 9 / 16 obtained from the check matrix initial value tables in Figs. 53 to 55 is hereinafter also referred to as other type B codes with r = 9 / 16.
[0340] Figures 56, 57, and 58 are diagrams showing examples of inspection matrix initial value tables representing the inspection matrix H of a type B code (hereinafter also referred to as the type B code with r = 10 / 16) as a new LDPC code with a code length N of 69,120 bits and a coding rate r of 10 / 16.
[0341] Note that FIG. 57 is a diagram following FIG. 56, and FIG. 58 is a diagram following FIG. 57.
[0342] Figures 59, 60, and 61 are diagrams showing other examples of inspection matrix initial value tables representing the inspection matrix H of the type B code with r = 10 / 16.
[0343] Note that FIG. 60 is a diagram following FIG. 59, and FIG. 61 is a diagram following FIG. 60. The type B code with r = 10 / 16 obtained from the inspection matrix initial value tables of FIGS. 59 to 61 is hereinafter also referred to as other type B codes with r = 10 / 16.
[0344] Figures 62, 63, and 64 are diagrams showing examples of inspection matrix initial value tables representing the inspection matrix H of a type B code (hereinafter also referred to as the type B code with r = 11 / 16) as a new LDPC code with a code length N of 69,120 bits and a coding rate r of 11 / 16.
[0345] Note that FIG. 63 is a diagram following FIG. 62, and FIG. 64 is a diagram following FIG. 63.
[0346] Figures 65, 66, and 67 are diagrams showing other examples of inspection matrix initial value tables representing the inspection matrix H of the type B code with r = 11 / 16.
[0347] Note that FIG. 66 is a diagram following FIG. 65, and FIG. 67 is a diagram following FIG. 66. The type B code with r = 11 / 16 obtained from the inspection matrix initial value tables of FIGS. 65 to 67 is hereinafter also referred to as other type B codes with r = 11 / 16.
[0348] Figures 68, 69, and 70 are diagrams showing examples of inspection matrix initial value tables representing the inspection matrix H of a type B code (hereinafter also referred to as a type B code with r = 12 / 16) as a new LDPC code with a code length N of 69,120 bits and a coding rate r of 12 / 16.
[0349] Note that Figure 69 is a figure following Figure 68, and Figure 70 is a figure following Figure 69.
[0350] Figures 71, 72, and 73 are diagrams showing other examples of inspection matrix initial value tables representing the inspection matrix H of a type B code with r = 12 / 16.
[0351] Note that Figure 72 is a figure following Figure 71, and Figure 73 is a figure following Figure 72. The type B code with r = 12 / 16 obtained from the inspection matrix initial value tables of Figures 71 to 73 is hereinafter also referred to as another type B code with r = 12 / 16.
[0352] Figures 74, 75, and 76 are diagrams showing examples of inspection matrix initial value tables representing the inspection 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 with a code length N of 69,120 bits and a coding rate r of 13 / 16.
[0353] Note that Figure 75 is a figure following Figure 74, and Figure 76 is a figure following Figure 75.
[0354] Figures 77, 78, and 79 are diagrams showing other examples of inspection matrix initial value tables representing the inspection matrix H of a type B code with r = 13 / 16.
[0355] Note that Figure 78 is a figure following Figure 77, and Figure 79 is a figure following Figure 78. The type B code with r = 13 / 16 obtained from the inspection matrix initial value tables of Figures 77 to 79 is hereinafter also referred to as another type B code with r = 13 / 16.
[0356] FIG. 80, FIG. 81, and FIG. 82 are diagrams showing an example of an inspection matrix initial value table representing an inspection matrix H of a type B code (hereinafter, also referred to as a type B code with r = 14 / 16) as a new LDPC code with a code length N of 69120 bits and a coding rate r of 14 / 16.
[0357] Note that FIG. 81 is a diagram following FIG. 80, and FIG. 82 is a diagram following FIG. 81.
[0358] FIG. 83, FIG. 84, and FIG. 85 are diagrams showing another example of an inspection matrix initial value table representing an inspection matrix H of a type B code with r = 14 / 16.
[0359] Note that FIG. 84 is a diagram following FIG. 83, and FIG. 85 is a diagram following FIG. 84. The type B code with r = 14 / 16 obtained from the inspection matrix initial value tables of FIGS. 83 to 85 is hereinafter also referred to as another type B code with r = 14 / 16.
[0360] The new LDPC code has become an LDPC code with good performance.
[0361] Here, a good-performance LDPC code is an LDPC code obtained from an appropriate inspection matrix H.
[0362] An appropriate inspection matrix H is, for example, an inspection matrix that satisfies a predetermined condition such that when an LDPC code obtained from the inspection matrix H is transmitted with a low E s / N 0 or E b / N o (signal power to noise power ratio per bit), the BER (bit error rate) (and FER (frame error rate)) becomes smaller.
[0363] An appropriate inspection matrix H can be obtained, for example, by performing a simulation to measure the BER when an LDPC code obtained from various inspection matrices that satisfy a predetermined condition is transmitted with a low E s / N o .
[0364] As a predetermined condition that an appropriate check matrix H should satisfy, for example, the analysis result obtained by an analysis method of the performance of a code called Density Evolution is good, there is no loop of 1 elements called cycle 4, and so on.
[0365] Here, information matrix H A In, as in cycle 4, if the 1 elements are concentrated, it is known that the decoding performance of the LDPC code deteriorates. For this reason, it is desirable that there is no cycle 4 in the check matrix H.
[0366] In the check matrix H, the minimum value of the length of the loop (loop length) composed of 1 elements is called the girth. The fact that there is no cycle 4 means that the girth is greater than 4.
[0367] Note that the predetermined conditions that an appropriate check matrix H should satisfy can be appropriately determined from viewpoints such as improvement of the decoding performance of the LDPC code and facilitation (simplification) of the decoding process of the LDPC code.
[0368] FIG. 86 and FIG. 87 are diagrams for explaining Density Evolution from which an analysis result as a predetermined condition that an appropriate check matrix H should satisfy is obtained.
[0369] Density Evolution is an analysis method of a code for calculating the expected value of the error probability for the entire LDPC code (ensemble) with code length N = ∞ characterized by a degree sequence described later.
[0370] For example, on an AWGN channel, when the variance value of the noise is gradually increased from 0, the expected value of the error probability of a certain ensemble is initially 0, but when the variance value of the noise becomes equal to or greater than a certain threshold, it becomes non-zero.
[0371] According to density evolution, by comparing the threshold value of the variance of noise (hereinafter also referred to as the performance threshold) at which the expected value of the error probability becomes non-zero, the quality of the performance of the ensemble (the suitability of the check matrix) can be determined.
[0372] Note that for a specific LDPC code, by determining the ensemble to which the LDPC code belongs and performing density evolution on that ensemble, the approximate performance of the LDPC code can be predicted.
[0373] Therefore, a good LDPC code can be found from among the LDPC codes belonging to an ensemble with good performance if an ensemble with good performance is found.
[0374] Here, the above-mentioned degree sequence represents the proportion of variable nodes and check nodes with weights of each value for 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 the weight (column weight) of all variable nodes is 3 and the weight (row weight) of all check nodes is 6.
[0376] FIG. 86 shows a Tanner graph of such an ensemble.
[0377] In the Tanner graph of FIG. 86, there are N variable nodes indicated by circles (○) in the figure, and N / 2 check nodes indicated by squares (□) in the figure, which is equal to the multiplication value obtained by multiplying the code length N by the coding rate 1 / 2.
[0378] To each variable node, three edges equal to the column weight are connected. Therefore, there are a total of 3N edges connected to the N variable nodes.
[0379] Also, six branches equal to the row weight are connected to each check node. Therefore, there are only 3N branches in total that are connected to N / 2 check nodes.
[0380] Furthermore, in the Tanner graph of FIG. 86, there is one interleaver.
[0381] The interleaver randomly rearranges the 3N branches connected to N variable nodes, and connects each rearranged branch to one of the 3N branches connected to N / 2 check nodes.
[0382] The rearrangement pattern of the 3N branches connected to N variable nodes in the interleaver has (3N)! (=(3N)×(3N - 1)×···×1) possibilities. Therefore, the ensemble characterized by the degree sequence where 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 the simulation to find good LDPC codes (appropriate check matrices), a multi - edge type ensemble was used in density evolution.
[0384] In the multi - edge type, the interleaver through which the branches connected to variable nodes and the branches connected to check nodes pass is divided into multiple (multi - edge), and thus, the characterization of the ensemble is performed more precisely.
[0385] FIG. 87 shows an example of the Tanner graph of a multi - edge type ensemble.
[0386] In the Tanner graph of FIG. 87, there are two interleavers, the first interleaver and the second interleaver.
[0387] Also, in the Tanner graph of FIG. 87, there are only v1 variable nodes with 1 branch connected to the first interleaver and 0 branches connected to the second interleaver, only v2 variable nodes with 1 branch connected to the first interleaver and 2 branches connected to the second interleaver, and only v3 variable nodes with 0 branches connected to the first interleaver and 2 branches connected to the second interleaver, respectively.
[0388] Furthermore, in the Tanner graph of FIG. 87, there are only c1 check nodes with 2 branches connected to the first interleaver and 0 branches connected to the second interleaver, only c2 check nodes with 2 branches connected to the first interleaver and 2 branches connected to the second interleaver, and only c3 check nodes with 0 branches connected to the first interleaver and 3 branches connected to the second interleaver, respectively.
[0389] Here, for density evolution and its implementation, for example, it is described in "On the Design of Low-Density Parity-Check Codes within 0.0045 dB of the Shannon Limit", S.Y.Chung, G.D.Forney, T.J.Richardson,R.Urbanke, IEEE Communications Leggers, VOL.5, NO.2, Feb 2001.
[0390] In the simulation for obtaining a new LDPC code (check matrix), by means of density evolution of multiple edge types, an ensemble is found where the performance threshold, which is the E b / N 0 (signal power-to-noise power ratio per bit), becomes less than a predetermined value. Among the LDPC codes belonging to that ensemble, an LDPC code that reduces the BER when using one or more orthogonal modulations such as QPSK is selected as an LDPC code with good performance.
[0391] The new LDPC code (the parity-check matrix initial value table representing the parity-check matrix) was obtained by the simulation as described above.
[0392] Therefore, according to the new LDPC code, good communication quality can be ensured in data transmission.
[0393] FIG. 88 is a diagram for explaining the column weight of the parity-check matrix H of the type A code as the new LDPC code.
[0394] Regarding the parity-check matrix H of the type A code, as shown in FIG. 88, let the column weight of the first K1 columns of the A matrix be Y1, the column weight of the subsequent K2 columns of the A matrix be Y2, the column weight of the first K1 columns of the C matrix be X1, the column weight of the subsequent K2 columns of the C matrix be X2, and the column weight of the subsequent M1 columns of the C matrix be X3, respectively.
[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] Also, regarding the parity-check matrix H of the type A code, the column weight of the first M1 - 1 columns of the B matrix is 2, and the column weight of the M1-th 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 the parameters of the parity-check matrix H of the type A code (represented by the parity-check matrix initial value table) in FIGS. 30 to 41.
[0398] X1, Y1, K1, X2, Y2, K2, X3, M1, M2, and the performance threshold as the parameters of the parity-check matrix H of the type A code with r = 2 / 16, 3 / 16, 4 / 16, 5 / 16, 6 / 16, 7 / 16, 8 / 16 are as shown in FIG. 89.
[0399] Parameters X1, Y1, K1 (or K2), X2, Y2, X3, M1 (or M2) are set so that the performance of the LDPC code (e.g., error rate, etc.) is further improved.
[0400] FIG. 90 is a diagram for explaining the column weight of the check matrix H of the type B code as a new LDPC code.
[0401] For the check matrix H of the type B code, as shown in FIG. 90, the column weight of the KX1 columns from the first column 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, respectively.
[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] Also, for the check matrix H of the type B code, among the last M columns, the column weight of the 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 the parameters of the check matrix H of the type B code (represented by the check matrix initial value table) in FIGS. 42 to 85.
[0405] X1, KX1, X2, KX2, Y1, KY1, Y2, KY2, M, and the performance threshold as the parameters of the check matrix H of the type B code with 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 FIG. 91.
[0406] Parameters X1, KX1, X2, KX2, Y1, KY1, Y2, KY2 are set so that the performance of the LDPC code is further improved.
[0407] According to the new LDPC code, good BER / FER is realized, and a capacity (communication channel capacity) close to the Shannon limit is realized.
[0408] <constellation>
[0409] Figures 92 to 107 are diagrams showing examples of constellations that can be adopted in the transmission system of FIG. 7.
[0410] In the transmission system of FIG. 7, for example, for a MODCOD that is a combination of a modulation method (MODulation) and an LDPC code (CODe), the constellation used in that MODCOD can be set.
[0411] For one MODCOD, one or more constellations can be set.
[0412] Constellations include a UC (Uniform Constellation) in which the arrangement of signal points is uniform and a NUC (Non Uniform Constellation) in which the arrangement is not uniform.
[0413] Also, the NUC includes, for example, a constellation called 1D NUC (1-dimensional M 2 -QAM non-uniform constellation) and a constellation called 2D NUC (2-dimensional QQAM non-uniform constellation), etc.
[0414] Generally, the 1D NUC has a better BER than the UC, and furthermore, the 2D NUC has a better BER than the 1D NUC.
[0415] The constellation with a modulation method of QPSK becomes a UC. As constellations with modulation methods of 16QAM, 64QAM, 256QAM, etc., for example, a UC or a 2D NUC can be adopted. As constellations with modulation methods of 1024QAM, 4096QAM, etc., for example, a UC or a 1D NUC can be adopted.
[0416] In the transmission system of FIG. 7, for example, constellations defined by ATSC 3.0, DVB-C.2, etc., and various other constellations can be used.
[0417] That is, when the modulation method is QPSK, for each coding rate r of the LDPC code, for example, the same UC can be used.
[0418] Also, when the modulation method is 16QAM, 64QAM, or 256QAM, for each coding rate r of the LDPC code, for example, the same UC can be used. Furthermore, when the modulation method is 16QAM, 64QAM, or 256QAM, for example, different 2D NUCs can be used for each coding rate r of the LDPC code.
[0419] Also, when the modulation method is 1024QAM or 4096QAM, for each coding rate r of the LDPC code, for example, the same UC can be used. Furthermore, when the modulation method is 1024QAM or 4096QAM, for example, different 1D NUCs can be used for each coding rate r of the LDPC code.
[0420] Here, the UC of QPSK is also referred to as QPSK-UC, and 2 m the UC of QAM is also referred to as 2 m QAM-UC. Also, 2 m the 1D NUC and 2D NUC of QAM are respectively referred to as 2 m QAM-1D NUC and 2 m QAM-2D NUC.
[0421] Hereinafter, some of the constellations defined by ATSC 3.0 will be described.
[0422] FIG. 92 is a diagram showing the coordinates of the signal points of the QPSK-UC used for all coding rates of the LDPC code defined by ATSC 3.0 when the modulation method is QPSK.
[0423] In FIG. 92, "Input Data cell y" represents a 2-bit symbol mapped to QPSK-UC, and "Constellation point z s " represents the coordinate of signal point z s . Note that the index s of signal point z s (similarly for the index q of signal point z q described later) represents the discrete time of the symbol (the time interval between one symbol and the next symbol).
[0424] In FIG. 92, the coordinates of signal point z s are represented in the form of complex numbers, and j represents the imaginary unit (√(-1)).
[0425] FIG. 93 is a diagram showing the coordinates of the signal points of 16QAM-2D 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 defined in ATSC 3.0 when the modulation method is 16QAM.
[0426] In FIG. 93, similar to FIG. 92, the coordinates of signal point z s are represented in the form of complex numbers, and j represents the imaginary unit.
[0427] In FIG. 93, w#k represents the coordinates of the signal points 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 where the signal points in the first quadrant are symmetrically moved with respect to the Q axis, the signal points in the third quadrant of the constellation are arranged at positions where the signal points in the first quadrant are symmetrically moved with respect to the origin, and the signal points in the fourth quadrant of the constellation are arranged at positions where the signal points in the first quadrant are symmetrically moved with respect to the I axis.
[0429] Here, the modulation method is 2 mIn the case of QAM, taking m bits as one symbol, that one symbol is mapped to the signal point corresponding to that symbol.
[0430] The symbol of m bits can be represented by an integer value from 0 to 2 m -1, but now, let b = 2 m / 4, then the symbol represented by an integer value from 0 to 2 m -1, y(0), y(1), ···, y(2 m -1) can be classified into four groups: symbols y(0) to y(b - 1), y(b) to y(2b - 1), y(2b) to y(3b - 1), and y(3b) to y(4b - 1).
[0431] In FIG. 93, the suffix k of w#k takes an integer value in the range of 0 to b - 1, and w#k represents the coordinates of the signal point corresponding to the symbol y(k) in the range of symbols y(0) to y(b - 1).
[0432] And the coordinates of the signal point corresponding to the 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 the symbol y(k + 2b) in the range of symbols y(2b) to y(3b - 1) are represented by conj(w#k). Also, the coordinates of the signal point corresponding to the 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 symbols y(0), y(1), ···, y(15) of m = 4 bits are taken as b = 2 4 / 4 = 4, and are classified into four groups: symbols y(0) to y(3), y(4) to y(7), y(8) to y(11), and y(12) to y(15).
[0435] Among the symbols y(0) to y(15), for example, symbol y(12) is the symbol y(k + 3b) in the range of symbols y(3b) to y(4b - 1). Since k = 0, the coordinate of the signal point corresponding to symbol y(12) is -w#k = -w0.
[0436] Now, assuming that 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. Therefore, the coordinate -w0 of the signal point corresponding to symbol y(12) is -(0.2386 + j0.5296).
[0437] FIG. 94 is a diagram showing examples of the coordinates of the 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 defined in ATSC 3.0 when the modulation method is 1024QAM.
[0438] In FIG. 94, u#k represents the real part Re(z s ) and the imaginary part Im(z s ) of the complex number as the coordinate of the signal point z of 1D NUC. s )
[0439] FIG. 95 is a diagram showing the relationship between the 10-bit symbol y of 1024QAM and u#k as the real part Re(z s ) and the imaginary part Im(z s ) of the complex number representing the coordinate of the signal point z of 1D NUC corresponding to the symbol y. s ) respectively.
[0440] Now, for the 10-bit symbol y of 1024QAM, starting from its first bit (the most significant bit), y 0,s , y 1,s , y 2,s , y 3,s , y 4,s , y5,s , y 6,s , y 7,s , y 8,s , y 9,s shall be represented as follows.
[0441] In Fig. 95, A represents the correspondence between the even-numbered 5-bit y of symbol y 1,s , y 3,s , y 5,s , y 7,s , y 9,s and the real part Re(z s of the signal point z s ) corresponding to that symbol y, denoted as u#k.
[0442] In Fig. 95, B represents the correspondence between the odd-numbered 5-bit y of symbol y 0,s , y 2,s , y 4,s , y 6,s , y 8,s and the imaginary part Im(z s of the signal point z s ) corresponding to that symbol y, denoted as u#k.
[0443] For a 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 ) of 1024QAM, for example, when it is (0, 0, 1, 0, 0, 1, 1, 1, 0, 0), the odd-numbered 5-bit (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-bit (y 1,s , y 3,s , y 5,s , y 7,s , y 9,s ) is (0, 0, 1, 1, 0).
[0444] In A of FIG. 95, the even-numbered 5 bits (0, 0, 1, 1, 0) are associated with u11, and thus, for the signal point z corresponding to the symbol y = (0, 0, 1, 0, 0, 1, 1, 1, 0, 0) s the real part Re(z s ) is u11.
[0445] In B of FIG. 95, the odd-numbered 5 bits (0, 1, 0, 1, 0) are associated with u3, and thus, for the signal point z corresponding to the symbol y = (0, 0, 1, 0, 0, 1, 1, 1, 0, 0) s the imaginary part Im(z s ) is u3.
[0446] On the other hand, assuming that the coding rate r of the LDPC code is, for example, 6 / 15, according to FIG. 94 above, for the 1D NUC used when the modulation method is 1024QAM and the coding rate r(CR) of the LDPC code is 6 / 15, u3 is 0.1295 and u11 is 0.7196.
[0447] Therefore, for the signal point z corresponding to the symbol y = (0, 0, 1, 0, 0, 1, 1, 1, 0, 0) s the real part Re(z s ) becomes u11 = 0.7196, and the imaginary part Im(z s ) becomes u3 = 0.1295. As a result, the coordinates of the signal point z corresponding to the symbol y = (0, 0, 1, 0, 0, 1, 1, 1, 0, 0) s are represented as 0.7196 + j0.1295.
[0448] Note that the signal points of the 1D NUC are arranged in a lattice pattern on a straight line parallel to the I axis or a straight line parallel to the Q axis in the constellation. However, the intervals between the signal points are not constant. Also, when transmitting the signal points (the data mapped to them), the average power of the signal points on the constellation can be normalized. If the square mean value of the absolute values for all of the signal points (the coordinates) on the constellation is represented as P ave and the square mean value P aveThe square root √P ave The reciprocal 1 / (√P ave ) is multiplied by each signal point z s on the constellation, which can be done.
[0449] In the transmission system of FIG. 7, the constellation defined by ATSC 3.0 as described above can be used.
[0450] FIGS. 96 to 107 are diagrams showing the coordinates of the signal points of the UC defined by DVB-C.2.
[0451] That is, FIG. 96 is a diagram showing the real part Re(z q ) of the coordinates of the signal points of QPSK-UC (UC of QPSK) defined by DVB-C.2. FIG. 97 is a diagram showing the imaginary part Im(z q ) of the coordinates of the signal points of QPSK-UC defined by DVB-C.2. q of the coordinates of the signal points of QPSK-UC defined by DVB-C.2. q ) is a diagram showing.
[0452] FIG. 98 is a diagram showing the real part Re(z q ) of the coordinates of the signal points of 16QAM-UC (UC of 16QAM) defined by DVB-C.2. FIG. 99 is a diagram showing the imaginary part Im(z q ) of the coordinates of the signal points of 16QAM-UC defined by DVB-C.2. q of the coordinates of the signal points of 16QAM-UC defined by DVB-C.2. q ) is a diagram showing.
[0453] FIG. 100 is a diagram showing the real part Re(z q ) of the coordinates of the signal points of 64QAM-UC (UC of 64QAM) defined by DVB-C.2. FIG. 101 is a diagram showing the imaginary part Im(z q ) of the coordinates of the signal points of 64QAM-UC defined by DVB-C.2. q of the coordinates of the signal points of 64QAM-UC defined by DVB-C.2. q ) is a diagram showing.
[0454] FIG. 102 shows the real part Re(z q ) of the signal points of 256QAM-UC (UC of 256QAM) defined in DVB-C.2. FIG. 103 shows the imaginary part Im(z q ) of the signal points of 256QAM-UC defined in DVB-C.2. q q ) is a diagram showing.
[0455] FIG. 104 shows the real part Re(z q ) of the signal points of 1024QAM-UC (UC of 1024QAM) defined in DVB-C.2. FIG. 105 shows the imaginary part Im(z q ) of the signal points of 1024QAM-UC defined in DVB-C.2. q q ) is a diagram showing.
[0456] FIG. 106 shows the real part Re(z q ) of the signal points of 4096QAM-UC (UC of 4096QAM) defined in DVB-C.2. FIG. 107 shows the imaginary part Im(z q ) of the signal points of 4096QAM-UC defined in DVB-C.2. q q ) is a diagram showing.
[0457] In FIGS. 96 to 107, y i,q represents the (i + 1)-th bit from the start of the symbol of m bits of 2 m QAM (for example, 2 bits in QPSK). Also, when transmitting the signal points (data mapped thereto) of UC, the average power of the signal points on the constellation can be normalized. If the root mean square value of the absolute values of all the signal points (coordinates) on the constellation is represented as P ave , then the reciprocal 1 / (√P ave ) of the square root √P ave of the root mean square value P ave is applied to each signal point z q It can be performed 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 the new LDPC codes corresponding to the (check matrix initial value tables) in FIGS. 30 to 85 with a code length N of 69120 bits and code rates r of 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 respectively, the UC shown in FIGS. 96 to 107 can be used.
[0460] <Block interleaver 25>
[0461] FIG. 108 is a diagram for explaining the block interleaving performed by the block interleaver 25 of FIG. 9.
[0462] The block interleaving is performed by dividing the LDPC code of one codeword into a part called part 1 and a part called part 2 from its beginning.
[0463] Let the length (number of bits) of part 1 be represented by Npart1 and the length of part 2 be represented by Npart2. Then, Npart1 + Npart2 is equal to the code length N.
[0464] Conceptually, in block interleaving, columns as storage areas for storing Npart1 / m bits in the column (vertical) direction as one direction are arranged in the row direction orthogonal to the column direction by an equal number m of m, which is equal to the number of bits of the symbol. Each column is divided into small units of 360 bits with a unit size P from top to bottom. This small unit of the column is also called a column unit.
[0465] In block interleaving, as shown in FIG. 108, writing of part 1 of the LDPC code of one codeword is performed in the left-to-right direction of columns by writing it downward (column direction) from the top of the first column unit of the column.
[0466] Then, when the writing to the first column unit of the rightmost column is completed, as shown in FIG. 108, returning to the leftmost column, writing downward from the top of the second column unit of the column is performed in the left-to-right direction of columns, and hereinafter, in the same manner, writing of part 1 of the LDPC code of one codeword is performed.
[0467] When the writing of part 1 of the LDPC code of one codeword is completed, as shown in FIG. 108, part 1 of the LDPC code is read out in units of m bits in the row direction from the first row of all m columns.
[0468] These m-bit units of part 1 are supplied as m-bit symbols from block interleaver 25 to mapper 117 (FIG. 8).
[0469] The reading of part 1 in units of m bits is sequentially performed toward the lower row of m columns, and when the reading of part 1 is completed, part 2 is divided into units of m bits from the beginning and supplied as m-bit symbols from block interleaver 25 to mapper 117.
[0470] Therefore, part 1 is symbolized while being interleaved, and part 2 is symbolized by being sequentially divided into m bits without being interleaved.
[0471] Npart1 / m, which is the column length, is a multiple of 360, which is the unit size P, and the LDPC code of one codeword is divided into part 1 and part 2 so that Npart1 / m becomes a multiple of 360.
[0472] FIG. 109 is a diagram showing examples of Part 1 and Part 2 of an LDPC code with a code length N of 69,120 bits for each of the cases where the modulation scheme is QPSK, 16QAM, 64QAM, 256QAM, 1024QAM, and 4096QAM.
[0473] In FIG. 109, when the modulation scheme is 1024QAM, Part 1 is 68,400 bits and Part 2 is 720 bits. When the modulation scheme is QPSK, 16QAM, 64QAM, 256QAM, or 4096QAM, in each case, Part 1 is 69,120 bits and Part 2 is 0 bits.
[0474] <Group-wise interleaving>
[0475] FIG. 110 is a diagram for explaining the group-wise interleaving performed by the group-wise interleaver 24 in FIG. 9.
[0476] In group-wise interleaving, as shown in FIG. 110, an LDPC code of one codeword is divided from its beginning into 360-bit units equal to the unit size P. One 360-bit division is used 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).
[0477] Here, the (i + 1)-th bit group from the beginning when the LDPC code of one codeword is divided into bit groups is also described as bit group i hereinafter.
[0478] When the unit size P is 360, for example, an LDPC code with a code length N of 1800 bits is divided into 5 (= 1800 / 360) bit groups of bit groups 0, 1, 2, 3, and 4. Further, for example, an LDPC code with a code length N of 69,120 bits is divided into 192 (= 69,120 / 360) bit groups of bit groups 0, 1, ···, 191.
[0479] Also, hereinafter, the GW pattern shall be represented by an arrangement of numbers representing bit groups. For example, for an LDPC code with a code length N of 1800 bits, for example, the GW pattern 4, 2, 0, 3, 1 represents interleaving (rearranging) the arrangement of bit groups 0, 1, 2, 3, 4 into the arrangement of bit groups 4, 2, 0, 3, 1.
[0480] For example, now, let the (i + 1)-th code bit from the beginning of an LDPC code with a code length N of 1800 bits be represented by x i as follows.
[0481] In this case, according to the group-wise interleaving of the GW pattern 4, 2, 0, 3, 1, the 1800-bit LDPC code {x 0 , x 1 ,..., x 1799} is interleaved into the arrangement of {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}.
[0482] 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.
[0483] <Example of GW Pattern for LDPC Code>
[0484] FIG. 111 is a diagram showing a first example of a GW pattern for an LDPC code with a code length N of 69120 bits.
[0485] According to the GW pattern of FIG. 111, the arrangement of bit groups 0 to 191 of the 69120-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 is interleaved in the order of.
[0486] FIG. 112 is a diagram showing a second example of a GW pattern for an LDPC code with a code length N of 69,120 bits.
[0487] According to the GW pattern of FIG. 112, the arrangement of bit groups 0 to 191 of the 69,120-bit LDPC code is the bit group 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 with the sequence of .
[0488] FIG. 113 is a diagram showing a third example of a GW pattern for an LDPC code with a code length N of 69,120 bits.
[0489] According to the GW pattern of FIG. 113, the order of bit groups 0 to 191 of the 69120-bit LDPC code is interleaved with the order of bit group 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 of.
[0490] FIG. 114 is a diagram showing a fourth example of a GW pattern for an LDPC code with a code length N of 69,120 bits.
[0491] According to the GW pattern of FIG. 114, the arrangement of bit groups 0 to 191 of the 69,120-bit LDPC code is the bit group 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 with the following sequence.
[0492] FIG. 115 shows a fifth example of a GW pattern for an LDPC code with a code length N of 69,120 bits.
[0493] According to the GW pattern of FIG. 115, the order of bit groups 0 to 191 of the 69,120-bit LDPC code is interleaved with the order of bit group 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 of.
[0494] FIG. 116 is a diagram showing a sixth example of a GW pattern for an LDPC code with a code length N of 69,120 bits.
[0495] According to the GW pattern of FIG. 116, the arrangement of bit groups 0 to 191 of the 69,120-bit LDPC code is the bit group 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 with the sequence of
[0496] FIG. 117 shows a seventh example of a GW pattern for an LDPC code with a code length N of 69,120 bits.
[0497] According to the GW pattern of FIG. 117, the order of bit groups 0 to 191 of the 69120-bit LDPC code is interleaved with the order of bit group 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 .
[0498] FIG. 118 is a diagram showing an eighth example of a GW pattern for an LDPC code with a code length N of 69,120 bits.
[0499] According to the GW pattern of FIG. 118, the arrangement of bit groups 0 to 191 of the 69,120-bit LDPC code is the bit group 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 with the sequence of
[0500] FIG. 119 shows a ninth example of a GW pattern for an LDPC code with a code length N of 69,120 bits.
[0501] According to the GW pattern of FIG. 119, the arrangement of bit groups 0 to 191 of the 69120-bit LDPC code is interleaved with the arrangement of bit group 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 .
[0502] FIG. 120 is a diagram showing the 10th example of the GW pattern for an LDPC code with a code length N of 69,120 bits.
[0503] 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 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 with the sequence.
[0504] FIG. 121 is a diagram showing an eleventh example of a GW pattern for an LDPC code with a code length N of 69120 bits.
[0505] According to the GW pattern of FIG. 121, the arrangement of bit groups 0 to 191 of the 69120-bit LDPC code is interleaved with the arrangement of bit groups 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 .
[0506] FIG. 122 is a diagram showing a 12th example of a GW pattern for an LDPC code with a code length N of 69,120 bits.
[0507] According to the GW pattern of FIG. 122, the arrangement of bit groups 0 to 191 of the 69,120-bit LDPC code is the bit group 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 with the sequence.
[0508] FIG. 123 shows a 13th example of a GW pattern for an LDPC code with a code length N of 69,120 bits.
[0509] According to the GW pattern of FIG. 123, the arrangement of bit groups 0 to 191 of a 69120-bit LDPC code is interleaved with the arrangement of bit groups 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 as follows.
[0510] FIG. 124 is a diagram showing a 14th example of a GW pattern for an LDPC code with a code length N of 69,120 bits.
[0511] According to the GW pattern of FIG. 124, the arrangement of bit groups 0 to 191 of the 69,120-bit LDPC code is the bit group 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 with the sequence of
[0512] FIG. 125 shows the 15th example of the GW pattern for an LDPC code with a code length N of 69120 bits.
[0513] According to the GW pattern of FIG. 125, the arrangement of bit groups 0 to 191 of the 69,120-bit LDPC code is interleaved with the arrangement of bit groups 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 of.
[0514] FIG. 126 is a diagram showing the 16th example of the GW pattern for an LDPC code with a code length N of 69,120 bits.
[0515] According to the GW pattern of FIG. 126, the arrangement of bit groups 0 to 191 of the 69,120-bit LDPC code is the bit group 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 with the order of
[0516] FIG. 127 is a diagram showing the 17th example of the GW pattern for an LDPC code with a code length N of 69120 bits.
[0517] According to the GW pattern of FIG. 127, the arrangement of bit groups 0 to 191 of the 69,120-bit LDPC code is the bit group 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 is interleaved in the order of.
[0518] FIG. 128 is a diagram showing an 18th example of a GW pattern for an LDPC code with a code length N of 69,120 bits.
[0519] According to the GW pattern of FIG. 128, the arrangement of bit groups 0 to 191 of the 69,120-bit LDPC code is the bit group 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 with the order of
[0520] FIG. 129 is a diagram showing the 19th example of the GW pattern for an LDPC code with a code length N of 69120 bits.
[0521] According to the GW pattern of FIG. 129, the arrangement of bit groups 0 to 191 of a 69120-bit LDPC code is interleaved with the arrangement of bit groups 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 as follows.
[0522] FIG. 130 is a diagram showing the 20th example of the GW pattern for an LDPC code with a code length N of 69,120 bits.
[0523] According to the GW pattern of FIG. 130, the arrangement of bit groups 0 to 191 of the 69,120-bit LDPC code is the bit group 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 with the sequence of
[0524] FIG. 131 is a diagram showing a 21st example of a GW pattern for an LDPC code with a code length N of 69,120 bits.
[0525] According to the GW pattern of FIG. 131, the arrangement of bit groups 0 to 191 of a 69,120-bit LDPC code is interleaved with the arrangement of the bit group 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 as follows.
[0526] FIG. 132 is a diagram showing a 22nd example of a GW pattern for an LDPC code with a code length N of 69,120 bits.
[0527] According to the GW pattern of FIG. 132, the arrangement of bit groups 0 to 191 of the 69,120-bit LDPC code is the bit group 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 with the order of.
[0528] FIG. 133 is a diagram showing a 23rd example of a GW pattern for an LDPC code with a code length N of 69,120 bits.
[0529] According to the GW pattern of FIG. 133, the arrangement of bit groups 0 to 191 of a 69120-bit LDPC code is interleaved with the arrangement of the bit group 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 in the following order.
[0530] FIG. 134 is a diagram showing a 24th example of a GW pattern for an LDPC code with a code length N of 69,120 bits.
[0531] According to the GW pattern of FIG. 134, the arrangement of bit groups 0 to 191 of the 69,120-bit LDPC code is the bit group 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 with the following sequence.
[0532] FIG. 135 shows the 25th example of the GW pattern for an LDPC code with a code length N of 69120 bits.
[0533] According to the GW pattern of FIG. 135, the arrangement of bit groups 0 to 191 of a 69120-bit LDPC code is interleaved with the arrangement of bit groups 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 of.
[0534] FIG. 136 is a diagram showing a 26th example of a GW pattern for an LDPC code with a code length N of 69,120 bits.
[0535] According to the GW pattern of FIG. 136, the arrangement of bit groups 0 to 191 of the 69,120-bit LDPC code is the bit group 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 with the sequence of.
[0536] FIG. 137 is a diagram showing a 27th example of a GW pattern for an LDPC code with a code length N of 69,120 bits.
[0537] According to the GW pattern of FIG. 137, the arrangement of bit groups 0 to 191 of a 69120-bit LDPC code is interleaved with the arrangement of bit groups 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 in the following order.
[0538] FIG. 138 is a diagram showing the 28th example of the GW pattern for an LDPC code with a code length N of 69,120 bits.
[0539] According to the GW pattern of FIG. 138, the arrangement of bit groups 0 to 191 of the 69,120-bit LDPC code is the bit group 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 with the sequence of
[0540] FIG. 139 is a diagram showing the 29th example of the GW pattern for an LDPC code with a code length N of 69,120 bits.
[0541] According to the GW pattern of FIG. 139, the arrangement of bit groups 0 to 191 of the 69120-bit LDPC code is interleaved with the arrangement of bit group 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 .
[0542] FIG. 140 is a diagram showing a 30th example of a GW pattern for an LDPC code with a code length N of 69,120 bits.
[0543] According to the GW pattern of FIG. 140, the arrangement of bit groups 0 to 191 of the 69,120-bit LDPC code is the bit group 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 with the sequence of.
[0544] FIG. 141 is a diagram showing the 31st example of the GW pattern for an LDPC code with a code length N of 69120 bits.
[0545] According to the GW pattern of FIG. 141, the arrangement of bit groups 0 to 191 of the 69120-bit LDPC code is the bit group 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 is interleaved in the order of.
[0546] FIG. 142 is a diagram showing a 32nd example of a GW pattern for an LDPC code with a code length N of 69,120 bits.
[0547] According to the GW pattern of FIG. 142, the arrangement of bit groups 0 to 191 of the 69,120-bit LDPC code is the bit group 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 with the order of
[0548] FIG. 143 shows the 33rd example of the GW pattern for an LDPC code with a code length N of 69,120 bits.
[0549] According to the GW pattern of FIG. 143, the arrangement of bit groups 0 to 191 of a 69120-bit LDPC code is interleaved with the arrangement of bit groups 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 in the following order.
[0550] FIG. 144 is a diagram showing a 34th example of a GW pattern for an LDPC code with a code length N of 69,120 bits.
[0551] According to the GW pattern of FIG. 144, the arrangement of bit groups 0 to 191 of the 69,120-bit LDPC code is the bit group 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 with the sequence of
[0552] FIG. 145 is a diagram showing a 35th example of a GW pattern for an LDPC code with a code length N of 69120 bits.
[0553] According to the GW pattern of FIG. 145, the arrangement of bit groups 0 to 191 of a 69120-bit LDPC code is interleaved with the arrangement of bit groups 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 of.
[0554] FIG. 146 is a diagram showing the 36th example of the GW pattern for an LDPC code with a code length N of 69,120 bits.
[0555] According to the GW pattern of FIG. 146, the arrangement of bit groups 0 to 191 of the 69,120-bit LDPC code is the bit group 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 with the order of
[0556] FIG. 147 is a diagram showing the 37th example of the GW pattern for an LDPC code with a code length N of 69120 bits.
[0557] According to the GW pattern of FIG. 147, the arrangement of bit groups 0 to 191 of the 69120-bit LDPC code is interleaved with the arrangement of the bit group 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 in the following order.
[0558] FIG. 148 is a diagram showing the 38th example of the GW pattern for an LDPC code with a code length N of 69,120 bits.
[0559] According to the GW pattern of FIG. 148, the arrangement of bit groups 0 to 191 of the 69,120-bit LDPC code is the bit group 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 with the sequence of
[0560] FIG. 149 is a diagram showing the 39th example of the GW pattern for an LDPC code with a code length N of 69,120 bits.
[0561] According to the GW pattern of FIG. 149, the arrangement of bit groups 0 to 191 of the 69120-bit LDPC code is the bit group 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 is interleaved with the arrangement of.
[0562] FIG. 150 is a diagram showing a 40th example of a GW pattern for an LDPC code with a code length N of 69,120 bits.
[0563] According to the GW pattern of FIG. 150, the arrangement of bit groups 0 to 191 of the 69,120-bit LDPC code is the bit group 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 with the sequence of.
[0564] FIG. 151 is a diagram showing the 41st example of the GW pattern for an LDPC code with a code length N of 69,120 bits.
[0565] According to the GW pattern of FIG. 151, the arrangement of bit groups 0 to 191 of a 69120-bit LDPC code is the bit group 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 is interleaved with the arrangement of.
[0566] FIG. 152 is a diagram showing a 42nd example of a GW pattern for an LDPC code with a code length N of 69,120 bits.
[0567] According to the GW pattern of FIG. 152, the arrangement of bit groups 0 to 191 of the 69,120-bit LDPC code is the bit group 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 with the order of
[0568] FIG. 153 is a diagram showing the 43rd example of the GW pattern for an LDPC code with a code length N of 69,120 bits.
[0569] According to the GW pattern of FIG. 153, the arrangement of bit groups 0 to 191 of the 69120-bit LDPC code is interleaved with the arrangement of the bit group 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 in the following order.
[0570] FIG. 154 is a diagram showing the 44th example of the GW pattern for an LDPC code with a code length N of 69,120 bits.
[0571] According to the GW pattern of FIG. 154, the arrangement of bit groups 0 to 191 of the 69,120-bit LDPC code is the bit group 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 with the following sequence.
[0572] FIG. 155 is a diagram showing a 45th example of a GW pattern for an LDPC code with a code length N of 69,120 bits.
[0573] According to the GW pattern of FIG. 155, the arrangement of bit groups 0 to 191 of the 69,120-bit LDPC code is interleaved with the arrangement of bit group 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 in the following order.
[0574] The first to 45th examples of the GW pattern for the LDPC code with the code length N of 69,120 bits described above can be applied to any combination of an LDPC code with an arbitrary code rate r and a code length N of 69,120 bits, any modulation method, and any constellation.
[0575] However, for group-wise interleaving, by setting the applicable GW pattern for each combination of the code length N of the LDPC code, the code rate r of the LDPC code, the modulation method, and the constellation, the error rate can be further improved for each combination.
[0576] The GW pattern of FIG. 111 can achieve a particularly good error rate, for example, by being applied to a combination of an LDPC code with N = 69,120 and r = 2 / 16 (an LDPC code with a code length N of 69,120 and a code rate r of 2 / 16 corresponding to the initial parity-check matrix table in FIG. 30), QPSK, and QPSK-UC in FIGS. 96 and 97.
[0577] The GW pattern of FIG. 112 can achieve a particularly good error rate, for example, by being applied to a combination of an LDPC code with N = 69,120 and r = 3 / 16 in FIGS. 31 and 32, QPSK, and QPSK-UC in FIGS. 96 and 97.
[0578] The GW pattern of FIG. 113 can achieve a particularly good error rate, for example, by being applied to a combination of an LDPC code with N = 69,120 and r = 4 / 16 in FIG. 33, QPSK, and QPSK-UC in FIGS. 96 and 97.
[0579] The GW pattern of FIG. 114 can achieve a particularly good error rate, for example, by being applied to a combination of an LDPC code with N = 69,120 and r = 5 / 16 in FIGS. 34 and 35, QPSK, and QPSK-UC in FIGS. 96 and 97.
[0580] The GW pattern of FIG. 115 can achieve particularly good error rates, for example, by applying it to the combination of the LDPC code of N = 69120, r = 6 / 16 in FIGS. 36 and 37, QPSK, and QPSK-UC in FIGS. 96 and 97.
[0581] The GW pattern of FIG. 116 can achieve particularly good error rates, for example, by applying it to the combination of the LDPC code of N = 69120, r = 7 / 16 in FIGS. 38 and 39, QPSK, and QPSK-UC in FIGS. 96 and 97.
[0582] The GW pattern of FIG. 117 can achieve particularly good error rates, for example, by applying it to the combination of the LDPC code of N = 69120, r = 8 / 16 in FIGS. 46 and 47, QPSK, and QPSK-UC in FIGS. 96 and 97.
[0583] The GW pattern of FIG. 118 can achieve particularly good error rates, for example, by applying it to the combination of the LDPC code of N = 69120, r = 9 / 16 in FIGS. 50 to 52, QPSK, and QPSK-UC in FIGS. 96 and 97.
[0584] The GW pattern of FIG. 119 can achieve particularly good error rates, for example, by applying it to the combination of the LDPC code of N = 69120, r = 10 / 16 in FIGS. 56 to 58, QPSK, and QPSK-UC in FIGS. 96 and 97.
[0585] The GW pattern of FIG. 120 can achieve particularly good error rates, for example, by applying it to the combination of the LDPC code of N = 69120, r = 11 / 16 in FIGS. 62 to 64, QPSK, and QPSK-UC in FIGS. 96 and 97.
[0586] The GW pattern of FIG. 121 can achieve particularly good error rates, for example, by applying it to the combination of the LDPC code of N = 69120, r = 12 / 16 in FIGS. 68 to 70, QPSK, and QPSK-UC in FIGS. 96 and 97.
[0587] The GW pattern of FIG. 122 can achieve particularly good error rates, for example, by applying it to the combination of the LDPC code of N = 69120, r = 13 / 16 in FIGS. 74 to 76, QPSK, and QPSK-UC in FIGS. 96 and 97.
[0588] The GW pattern of FIG. 123 can achieve particularly good error rates, for example, by applying it to the combination of the LDPC code of N = 69120, r = 14 / 16 in FIGS. 80 to 82, QPSK, and QPSK-UC in FIGS. 96 and 97.
[0589] The GW pattern of FIG. 124 can achieve particularly good error rates, for example, by applying it to the combination of the LDPC code of N = 69120, r = 3 / 16 in FIGS. 31 and 32, 16QAM, and 16QAM-UC in FIGS. 98 and 99.
[0590] The GW pattern of FIG. 125 can achieve particularly good error rates, for example, by applying it to the combination of the LDPC code of N = 69120, r = 5 / 16 in FIGS. 34 and 35, 16QAM, and 16QAM-UC in FIGS. 98 and 99.
[0591] The GW pattern of FIG. 126 can achieve particularly good error rates, for example, by applying it to the combination of the LDPC code of N = 69120, r = 7 / 16 in FIGS. 38 and 39, 16QAM, and 16QAM-UC in FIGS. 98 and 99.
[0592] The GW pattern of FIG. 127 can achieve particularly good error rates, for example, by applying it to the combination of the LDPC code with N = 69120 and r = 9 / 16 in FIGS. 50 to 52, 16QAM, and 16QAM-UC in FIGS. 98 and 99.
[0593] The GW pattern of FIG. 128 can achieve particularly good error rates, for example, by applying it to the combination of the LDPC code with N = 69120 and r = 11 / 16 in FIGS. 62 to 64, 16QAM, and 16QAM-UC in FIGS. 98 and 99.
[0594] The GW pattern of FIG. 129 can achieve particularly good error rates, for example, by applying it to the combination of the LDPC code with N = 69120 and r = 13 / 16 in FIGS. 74 to 76, 16QAM, and 16QAM-UC in FIGS. 98 and 99.
[0595] The GW pattern of FIG. 130 can achieve particularly good error rates, for example, by applying it to the combination of the LDPC code with N = 69120 and r = 2 / 16 in FIG. 30, 64QAM, and 64QAM-UC in FIGS. 100 and 101.
[0596] The GW pattern of FIG. 131 can achieve particularly good error rates, for example, by applying it to the combination of the LDPC code with N = 69120 and r = 4 / 16 in FIG. 33, 64QAM, and 64QAM-UC in FIGS. 100 and 101.
[0597] The GW pattern of FIG. 132 can achieve particularly good error rates, for example, by applying it to the combination of the LDPC code with N = 69120 and r = 6 / 16 in FIGS. 36 and 37, 64QAM, and 64QAM-UC in FIGS. 100 and 101.
[0598] The GW pattern of FIG. 133 can achieve particularly good error rates, for example, by applying it to the combination of the LDPC code with N = 69120, r = 8 / 16 in FIGS. 46 and 47, 64QAM, and 64QAM-UC in FIGS. 100 and 101.
[0599] The GW pattern of FIG. 134 can achieve particularly good error rates, for example, by applying it to the combination of the LDPC code with N = 69120, r = 10 / 16 in FIGS. 56 to 58, 64QAM, and 64QAM-UC in FIGS. 100 and 101.
[0600] The GW pattern of FIG. 135 can achieve particularly good error rates, for example, by applying it to the combination of the LDPC code with N = 69120, r = 12 / 16 in FIGS. 68 to 70, 64QAM, and 64QAM-UC in FIGS. 100 and 101.
[0601] The GW pattern of FIG. 136 can achieve particularly good error rates, for example, by applying it to the combination of the LDPC code with N = 69120, r = 14 / 16 in FIGS. 80 to 82, 64QAM, and 64QAM-UC in FIGS. 100 and 101.
[0602] The GW pattern of FIG. 137 can achieve particularly good error rates, for example, by applying it to the combination of the LDPC code with N = 69120, r = 3 / 16 in FIGS. 31 and 32, 256QAM, and 256QAM-UC in FIGS. 102 and 103.
[0603] The GW pattern of FIG. 138 can achieve particularly good error rates, for example, by applying it to the combination of the LDPC code with N = 69120, r = 5 / 16 in FIGS. 34 and 35, 256QAM, and 256QAM-UC in FIGS. 102 and 103.
[0604] The GW pattern of FIG. 139 can achieve particularly good error rates, for example, by applying it to the combination of the LDPC code with N = 69120 and r = 7 / 16 in FIGS. 38 and 39, 256QAM, and 256QAM-UC in FIGS. 102 and 103.
[0605] The GW pattern of FIG. 140 can achieve particularly good error rates, for example, by applying it to the combination of the LDPC code with N = 69120 and r = 9 / 16 in FIGS. 50 to 52, 256QAM, and 256QAM-UC in FIGS. 102 and 103.
[0606] The GW pattern of FIG. 141 can achieve particularly good error rates, for example, by applying it to the combination of the LDPC code with N = 69120 and r = 11 / 16 in FIGS. 62 to 64, 256QAM, and 256QAM-UC in FIGS. 102 and 103.
[0607] The GW pattern of FIG. 142 can achieve particularly good error rates, for example, by applying it to the combination of the LDPC code with N = 69120 and r = 13 / 16 in FIGS. 74 to 76, 256QAM, and 256QAM-UC in FIGS. 102 and 103.
[0608] The GW pattern of FIG. 143 can achieve particularly good error rates, for example, by applying it to the combination of the LDPC code with N = 69120 and r = 2 / 16 in FIG. 30, 1024QAM, and 1024QAM-UC in FIGS. 104 and 105.
[0609] The GW pattern of FIG. 144 can achieve particularly good error rates, for example, by applying it to the combination of the LDPC code with N = 69120 and r = 4 / 16 in FIG. 33, 1024QAM, and 1024QAM-UC in FIGS. 104 and 105.
[0610] The GW pattern of FIG. 145 can achieve particularly good error rates, for example, by applying it to the combination of the LDPC code with N = 69120 and r = 6 / 16 in FIGS. 36 and 37, 1024QAM, and 1024QAM-UC in FIGS. 104 and 105.
[0611] The GW pattern of FIG. 146 can achieve particularly good error rates, for example, by applying it to the combination of the LDPC code with N = 69120 and r = 8 / 16 in FIGS. 46 and 47, 1024QAM, and 1024QAM-UC in FIGS. 104 and 105.
[0612] The GW pattern of FIG. 147 can achieve particularly good error rates, for example, by applying it to the combination of the LDPC code with N = 69120 and r = 10 / 16 in FIGS. 56 to 58, 1024QAM, and 1024QAM-UC in FIGS. 104 and 105.
[0613] The GW pattern of FIG. 148 can achieve particularly good error rates, for example, by applying it to the combination of the LDPC code with N = 69120 and r = 12 / 16 in FIGS. 68 to 70, 1024QAM, and 1024QAM-UC in FIGS. 104 and 105.
[0614] The GW pattern of FIG. 149 can achieve particularly good error rates, for example, by applying it to the combination of the LDPC code with N = 69120 and r = 14 / 16 in FIGS. 80 to 82, 1024QAM, and 1024QAM-UC in FIGS. 104 and 105.
[0615] The GW pattern of FIG. 150 can achieve particularly good error rates, for example, by applying it to the combination of the LDPC code with N = 69120 and r = 3 / 16 in FIGS. 31 and 32, 4096QAM, and 4096QAM-UC in FIGS. 106 and 107.
[0616] The GW pattern of FIG. 151 can achieve particularly good error rates, for example, by being applied to the combination of the LDPC code with N = 69120 and r = 5 / 16 in FIGS. 34 and 35, 4096QAM, and 4096QAM-UC in FIGS. 106 and 107.
[0617] The GW pattern of FIG. 152 can achieve particularly good error rates, for example, by being applied to the combination of the LDPC code with N = 69120 and r = 7 / 16 in FIGS. 38 and 39, 4096QAM, and 4096QAM-UC in FIGS. 106 and 107.
[0618] The GW pattern of FIG. 153 can achieve particularly good error rates, for example, by being applied to the combination of the LDPC code with N = 69120 and r = 9 / 16 in FIGS. 50 to 52, 4096QAM, and 4096QAM-UC in FIGS. 106 and 107.
[0619] The GW pattern of FIG. 154 can achieve particularly good error rates, for example, by being applied to the combination of the LDPC code with N = 69120 and r = 11 / 16 in FIGS. 62 to 64, 4096QAM, and 4096QAM-UC in FIGS. 106 and 107.
[0620] The GW pattern of FIG. 155 can achieve particularly good error rates, for example, by being applied to the combination of the LDPC code with N = 69120 and r = 13 / 16 in FIGS. 74 to 76, 4096QAM, and 4096QAM-UC in FIGS. 106 and 107.
[0621] <Configuration Example of Receiver 12>
[0622] FIG. 156 is a block diagram showing a configuration example of the receiver 12 in FIG. 7.
[0623] The OFDM processing unit (OFDM operation) 151 receives the OFDM signal from the transmission device 11 (Fig. 7) and performs signal processing on the OFDM signal. The data obtained by the OFDM processing unit 151 performing signal processing is supplied to the frame management unit (Frame Management) 152.
[0624] The frame management unit 152 performs processing (frame interpretation) on the frame composed of the data supplied from the OFDM processing unit 151, and supplies the signal of the target data and the signal of the control data obtained as a result to the frequency deinterleavers (Frequency Deinterleaver) 161 and 153, respectively.
[0625] The frequency deinterleaver 153 performs frequency deinterleaving on the data from the frame management unit 152 in symbol units and supplies it to the demapper (Demapper) 154.
[0626] The demapper 154 demaps (decodes the signal point arrangement) and performs quadrature demodulation on the data (data on the constellation) from the frequency deinterleaver 153 based on the arrangement of signal points (constellation) defined by the quadrature modulation performed on the transmission device 11 side, and supplies the data (likelihood of the LDPC code) obtained as a result to the LDPC decoder (LDPC decoder) 155.
[0627] The LDPC decoder 155 performs LDPC decoding on the LDPC code from the demapper 154, and supplies the resulting LDPC target data (here, BCH code) to the BCH decoder (BCH decoder) 156.
[0628] The BCH decoder 156 performs BCH decoding on the LDPC target data from the LDPC decoder 155, and outputs the resulting control data (signaling).
[0629] On the one hand, the frequency deinterleaver 161 performs frequency deinterleaving on a symbol-by-symbol basis for the data from the frame management unit 152 and supplies it to the SISO / MISO decoder 162.
[0630] The SISO / MISO decoder 162 performs space-time decoding of the data from the frequency deinterleaver 161 and supplies it to the Time Deinterleaver 163.
[0631] The Time Deinterleaver 163 performs time deinterleaving on a symbol-by-symbol basis for the data from the SISO / MISO decoder 162 and supplies it to the Demapper 164.
[0632] The Demapper 164 demaps (decodes the signal point arrangement) and quadrature demodulates the data (data on the constellation) from the Time Deinterleaver 163 based on the arrangement of signal points (constellation) defined by the quadrature modulation performed on the transmission device 11 side, and supplies the resulting data to the Bit Deinterleaver 165.
[0633] The Bit Deinterleaver 165 performs bit deinterleaving on the data from the Demapper 164, and supplies the LDPC code (likelihood) which is the data after the bit deinterleaving to the LDPC decoder 166.
[0634] The LDPC decoder 166 performs LDPC decoding of the LDPC code from the Bit Deinterleaver 165, and supplies the resulting LDPC target data (here, BCH code) to the BCH decoder 167.
[0635] The BCH decoder 167 performs BCH decoding of the LDPC target data from the LDPC decoder 155, and supplies the resulting data to the BB DeScrambler 168.
[0636] The BB descrambler 168 performs BB descrambling on the data from the BCH decoder 167 and supplies the resulting data to the Null Deletion section 169.
[0637] The Null Deletion section 169 deletes the Null inserted by the padding 112 in FIG. 8 from the data from the BB descrambler 168 and supplies it to the Demultiplexer 170.
[0638] The Demultiplexer 170 separates each of the one or more streams (target data) multiplexed in the data from the Null Deletion section 169, performs necessary processing, and outputs it as an Output stream.
[0639] Note that the receiving device 12 can be configured without providing a part of the blocks illustrated in FIG. 156. That is, for example, when the transmitting device 11 (FIG. 8) is configured without providing the time interleaver 118, the SISO / MISO encoder 119, the frequency interleaver 120, and the frequency interleaver 124, the receiving device 12 can be configured without providing the time deinterleaver 163, the SISO / MISO decoder 162, the frequency deinterleaver 161, and the frequency deinterleaver 153, which are the blocks corresponding to the time interleaver 118, the SISO / MISO encoder 119, the frequency interleaver 120, and the frequency interleaver 124 of the transmitting device 11, respectively.
[0640] <Configuration example of the bit deinterleaver 165>
[0641] FIG. 157 is a block diagram showing a configuration example of the bit deinterleaver 165 in FIG. 156.
[0642] The bit deinterleaver 165 is composed of a block deinterleaver 54 and a group-wise deinterleaver 55, and performs (bit) deinterleaving of the symbol bits of the symbols, which are the data from the demapper 164 (FIG. 156).
[0643] That is, the block deinterleaver 54 performs a block deinterleaving (a process reverse to the block interleaving) corresponding to the block interleaving performed by the block interleaver 25 in FIG. 9 on the symbol bits of the symbols from the demapper 164, that is, a block deinterleaving that returns the positions of the code bits (likelihoods) of the LDPC code rearranged by the block interleaving to their original positions, and supplies the resulting LDPC code to the group-wise deinterleaver 55.
[0644] The group-wise deinterleaver 55 performs a group-wise deinterleaving (a process reverse to the group-wise interleaving) corresponding to the group-wise interleaving performed by the group-wise interleaver 24 in FIG. 9 on the LDPC code from the block deinterleaver 54, that is, for example, a group-wise deinterleaving that rearranges the code bits of the LDPC code whose order has been changed in bit group units by the group-wise interleaving described in FIG. 110 in bit group units to return them to their original order.
[0645] Here, when a parity interleaving, a group-wise interleaving, and a block interleaving are applied to the LDPC code supplied from the demapper 164 to the bit deinterleaver 165, the bit deinterleaver 165 can perform all of a parity deinterleaving corresponding to the parity interleaving (a process reverse to the parity interleaving, that is, a parity deinterleaving that returns the code bits of the LDPC code whose order has been changed by the parity interleaving to their original order), a block deinterleaving corresponding to the block interleaving, and a group-wise deinterleaving corresponding to the group-wise interleaving.
[0646] However, in the bit deinterleaver 165 of FIG. 157, a block deinterleaver 54 that performs block deinterleaving corresponding to block interleaving and a groupwise deinterleaver 55 that performs groupwise deinterleaving corresponding to groupwise interleaving are provided. However, a block that performs parity deinterleaving corresponding to parity interleaving is not provided, and parity deinterleaving is not performed.
[0647] Therefore, from the bit deinterleaver 165 (the groupwise deinterleaver 55 thereof), the LDPC decoder 166 is supplied with an LDPC code in which block deinterleaving and groupwise deinterleaving are performed and parity deinterleaving is not performed.
[0648] The LDPC decoder 166 performs LDPC decoding of the LDPC code from the bit deinterleaver 165 using a conversion check matrix obtained by performing at least column permutation corresponding to parity interleaving on a type B check matrix H used by the LDPC encoder 115 of FIG. 8 for LDPC encoding, or a conversion check matrix (FIG. 29) obtained by performing row permutation on a type A check matrix (FIG. 27), and outputs the resulting data as the decoding result of the LDPC target data.
[0649] FIG. 158 is a flowchart for explaining the processing performed by the demapper 164, the bit deinterleaver 165, and the LDPC decoder 166 of FIG. 157.
[0650] In step S111, the demapper 164 demaps and quadrature demodulates the data (data on the constellation mapped to signal points) from the time deinterleaver 163, supplies it to the bit deinterleaver 165, and the process proceeds to step S112.
[0651] In step S112, the bit deinterleaver 165 performs deinterleaving (bit deinterleaving) of the data from the demapper 164, and the process proceeds to step S113.
[0652] That is, in step S112, in the bit deinterleaver 165, the block deinterleaver 54 performs block deinterleaving on the data (symbols) from the demapper 164, and supplies the resulting code bits of the LDPC code to the group-wise deinterleaver 55.
[0653] The group-wise deinterleaver 55 performs group-wise deinterleaving on the LDPC code from the block deinterleaver 54, and supplies the resulting LDPC code (likelihood) to the LDPC decoder 166.
[0654] In step S113, the LDPC decoder 166 performs LDPC decoding of the LDPC code from the group-wise deinterleaver 55 using the parity-check matrix H that the LDPC encoder 115 in FIG. 8 used for LDPC encoding, that is, for example, using the transformed parity-check matrix obtained from the parity-check matrix H, and outputs the resulting data as the decoding result of the LDPC target data to the BCH decoder 167.
[0655] Note that also in FIG. 157, for convenience of explanation, similar to the case of FIG. 9, the block deinterleaver 54 that performs block deinterleaving and the group-wise deinterleaver 55 that performs group-wise deinterleaving are configured separately, but the block deinterleaver 54 and the group-wise deinterleaver 55 can be integrally configured.
[0656] Also, in the transmission device 11, when group-wise interleaving is not performed, the reception device 12 can be configured without providing the group-wise deinterleaver 55 that performs group-wise deinterleaving.
[0657] <LDPC Decoding>
[0658] The LDPC decoding performed by the LDPC decoder 166 in FIG. 156 will be further described.
[0659] In the LDPC decoder 166 of FIG. 156, as described above, block deinterleaving and group-wise deinterleaving from the group-wise deinterleaver 55 are performed, and LDPC decoding of an LDPC code in which parity deinterleaving is not performed is performed on a transformed check matrix obtained by performing at least column permutation corresponding to parity deinterleaving on the type B check matrix H used by the LDPC encoder 115 in FIG. 8 for LDPC encoding, or a transformed check matrix (FIG. 29) obtained by performing row permutation on the type A check matrix (FIG. 27).
[0660] Here, LDPC decoding using a transformed check matrix has been previously proposed (see, for example, Japanese Patent No. 4224777) such that it is possible to suppress the circuit scale and suppress the operating frequency to a sufficiently achievable range.
[0661] Therefore, first, with reference to FIGS. 159 to 162, the previously proposed LDPC decoding using a transformed check matrix will be described.
[0662] FIG. 159 is a diagram showing an example of a check matrix H of an LDPC code with a code length N of 90 and a coding rate of 2 / 3.
[0663] In FIG. 159 (similarly in FIGS. 160 and 161 described later), 0 is represented by a period (.).
[0664] In the check matrix H of FIG. 159, the parity matrix has a staircase structure.
[0665] FIG. 160 is a diagram showing a check matrix H' obtained by performing row permutation of Equation (11) and column permutation of Equation (12) on the check matrix H of FIG. 159.
[0666] Row permutation: The (6s + t + 1)-th row → the (5t + s + 1)-th row ···(11)
[0667] Column permutation: The (6x + y + 61)-th column → the (5y + x + 61)-th column ···(12)
[0668] However, in equations (11) and (12), s, t, x, and y are integers in the ranges of 0 ≦ s < 5, 0 ≦ t < 6, 0 ≦ x < 5, and 0 ≦ t < 6, respectively.
[0669] According to the row permutation of equation (11), the 1st, 7th, 13th, 19th, and 25th rows, which have a remainder of 1 when divided by 6, are respectively replaced with the 1st, 2nd, 3rd, 4th, and 5th rows, and the 2nd, 8th, 14th, 20th, and 26th rows, which have a remainder of 2 when divided by 6, are respectively replaced with the 6th, 7th, 8th, 9th, and 10th rows, and so on for the permutation.
[0670] Also, according to the column permutation of equation (12), for the columns after the 61st column (parity matrix), the 61st, 67th, 73rd, 79th, and 85th columns, which have a remainder of 1 when divided by 6, are respectively replaced with the 61st, 62nd, 63rd, 64th, and 65th columns, and the 62nd, 68th, 74th, 80th, and 86th columns, which have a remainder of 2 when divided by 6, are respectively replaced with the 66th, 67th, 68th, 69th, and 70th columns, and so on for the permutation.
[0671] In this way, the matrix obtained by performing row and column permutations on the check matrix H in Figure 159 is the check matrix H' in Figure 160.
[0672] Here, even if the row permutation of the check matrix H is performed, it does not affect the order of the code bits of the LDPC code.
[0673] Also, the column permutation of equation (12) corresponds to the parity interleaving where the (K + qx + y + 1)-th code bit is interleaved to the position of the (K + Py + x + 1)-th code bit, with the information length K being 60, the unit size P being 5, the parity length M (here 30), and the divisor q (= M / P) being 6.
[0674] Therefore, the check matrix H' in FIG. 160 is a transformed check matrix obtained by performing at least a column replacement operation of replacing the (K + qx + y + 1)-th column of the check matrix H in FIG. 159 (hereinafter, appropriately referred to as the original check matrix) with the (K + Py + x + 1)-th column.
[0675] When multiplying the LDPC code of the original check matrix H in FIG. 159 by the same replacement as in Equation (12) for the transformed check matrix H' in FIG. 160, a zero vector is output. That is, assuming that the row vector obtained by performing the column replacement of Equation (12) on the row vector c as the LDPC code (one codeword) of the original check matrix H is represented as c', from the properties of the check matrix, Hc T is a zero vector, so H'c' T will also naturally be a zero vector.
[0676] From the above, the transformed check matrix H' in FIG. 160 is the check matrix of the LDPC code c' obtained by performing the column replaceme...
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 4096 signal points of UC (Uniform Constellation) of 4096QAM in units of 12 bits; A transmitting device comprising: a receiving device including a group-wise deinterleaving unit that returns the arrangement of the LDPC codes after the group-wise interleaving, which is obtained from the data after the mapping, 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 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 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 4096 signal points of UC (Uniform Constellation) of 4096QAM in 12-bit units; A group-wise deinterleaving step of returning the arrangement of the LDPC codes after the group-wise interleaving obtained from the data after the mapping 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 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 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
Data processor and data processing method
JP2015130602A
Data processor and data processing method
JP2015170911A
Data processing device and data processing method
WO2016114156A1