Receiving device and receiving method

By employing LDPC coding with specific check matrices and group-wise interleaving and mapping to 2D-NUC of 256QAM, the system ensures improved communication quality and reduces errors in data transmission.

JP7736143B2Active Publication Date: 2025-09-09SONY GROUP CORP
View PDF 2 Cites 0 Cited by

Patent Information

Application Number
JP2024189552
Authority / Receiving Office
JP · JP
Patent Type
Patents
Current Assignee / Owner
Priority Date
2017-02-20
Filing Date
2024-10-29
Publication Date
2025-09-09
Estimated Expiration
2037-03-23

AI Technical Summary

Technical Problem

Existing data transmission systems using LDPC codes face challenges in ensuring consistent communication quality, particularly due to the conversion of LDPC codes into symbols for quadrature modulation and mapping to signal points, which can lead to errors and reduced performance.

Method used

The implementation of a coding and mapping process involving LDPC coding with specific check matrices, group-wise interleaving, and mapping to 2D-Non-Uniform Constellation (NUC) of 256QAM, along with group-wise deinterleaving to restore the original arrangement of LDPC codes, ensuring accurate data transmission.

Benefits of technology

This approach enhances communication quality by minimizing errors and maintaining consistent performance in data transmission, addressing the limitations of existing LDPC code-based systems.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure 0007736143000008
    Figure 0007736143000008
  • Figure 0007736143000009
    Figure 0007736143000009
  • Figure 0007736143000010
    Figure 0007736143000010
Patent Text Reader

Abstract

To secure an excellent communication quality in a data transmission using an LDPC code.SOLUTION: In group-wise interleaving, an LDPC code having a code length N of 69120 bits is interleaved in units of bit groups of 360 bits. In group-wise deinterleaving, the group-wise interleaved LDPC code is restored to an original ordering thereof. The present technique can be applied to, for example, a case of data transmission using an LDPC code.SELECTED DRAWING: Figure 184
Need to check novelty before this filing date? Find Prior Art

Description

[Technical Field]

[0001] The present technology relates to a receiving device and a receiving method, and more particularly to a receiving device and a receiving method that can ensure good communication quality in data transmission using, for example, LDPC codes. [Background technology]

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

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

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

[0005] In data transmission using LDPC codes, for example, the LDPC codes are converted (symbolized) into symbols for quadrature modulation (digital modulation) such as QPSK (Quadrature Phase Shift Keying), and the symbols are mapped to signal points of the quadrature modulation and transmitted.

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

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

[0008] A first transmission method / apparatus of the present technology includes: a coding step / unit that performs LDPC coding based on a check matrix of an LDPC code having a code length N of 69120 bits and a coding rate r of 2 / 16; a group-wise interleaving step / unit that performs group-wise interleaving of the LDPC code in units of 360-bit bit groups; and a mapping step / unit that maps the LDPC code to one of 256 signal points of a 2D-NUC (Non-Uniform Constellation) of 256QAM in units of 8 bits, wherein in the group-wise interleaving, the (i+1)-th bit group from the beginning of the LDPC code is defined as bit group i, and a sequence of bit groups 0 to 191 of the 69120-bit LDPC code is mapped to bit group i. 18, 161, 152, 30, 91, 138, 83, 88, 127, 54, 33, 46, 125, 120, 122, 169, 51, 150, 100, 52, 95, 186, 149, 81, 11, 53, 164, 130, 19, 176, 93, 107, 29, 86, 124, 65, 75, 71, 74, 68, 44, 82, 59, 104, 118, 103, 131, 101, 8, 96, 97, 119, 166, 77, 50, 34, 158, 21, 184, 24, 165, 171, 142, 36, 181, 45, 90, 175, 99, 13, 37, 10, 140, 3, 69, 16, 133, 172, 173, 27, 132, 79, 76, 111, 123, 7, 94, 70, 116, 174, 15, 156, 187, 110, 84, 185, 14, 72, 159, 143, 78, 135, 17, 12, 139, 67, 58, 151, 177, 73, 154, 145, 179, 25, 108, 148, 137, 85, 147, 61, 20, 89, 155, 183, 134, 128, 191, 26, 121, 126, 0, 141, 112, 62, 114, 48, 182, 146, 115, 64, 113, 189, 31, 1, 39, 168, 2, 43, 163, 188, 35, 129, 153, 66, 23, 40, 6, 5, 98, 56, 9, 63, 180, 157, 167, 162, 60, 42, 49, 28, 22, 80, 87, 92, 160, 55, 136, 170, 106, 117, 178, 32, 38, 105, 102, 41, 57, 109, 144, 47, 190, 4 the parity check matrix includes an A matrix at the top left of the parity 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 of a staircase structure adjacent to the right of the A matrix, which has M1 rows and M1 columns, a Z matrix which is a zero matrix adjacent to the right of the B matrix, which has M1 rows and N-K-M1 columns, a C matrix adjacent below the A matrix and the B matrix, which has N-K-M1 rows and K+M1 columns, and a D matrix which is an identity matrix adjacent to the right of the C matrix, which has N-K-M1 rows and N-K-M1 columns, the predetermined value M1 is 1800, the A matrix and the C matrix are represented by a parity check matrix initial value table, and the parity check matrix initial value table is a table which represents positions of elements of 1 in the A matrix and the C matrix every 360 columns, 1617 1754 1768 2501 6874 12486 12872 16244 18612 19698 21649 30954 33221 33723 34495 37587 38542 41510 42268 52159 59780 206 610 991 2665 4994 5681 12371 17343 25547 26291 26678 27791 27828 32437 33153 35429 39943 45246 46732 53342 60451 119 682 963 3339 6794 7021 7295 8856 8942 10842 11318 14050 14474 27281 28637 29963 37861 42536 43865 48803 59969 175 201 355 5418 7990 10567 10642 12987 16685 18463 21861 24307 25274 27515 39631 40166 43058 47429 55512 55519 59426 117 839 1043 1960 6896 19146 24022 26586 29342 29906 33129 33647 33883 34113 34550 38720 40247 45651 51156 53053 56614 135 236 257 7505 9412 12642 19752 20201 26010 28967 31146 37156 44685 45667 50066 51283 54365 55475 56501 58763 59121 109 840 1573 5523 19968 23924 24644 27064 29410 31276 31526 32173 38175 43570 43722 46655 46660 48353 54025 57319 59818 522 1236 1573 6563 11625 13846 17570 19547 22579 22584 29338 30497 33124 33152 35407 36364 37726 41426 53800 57130 504 1330 1481 13809 15761 20050 26339 27418 29630 32073 33762 34354 36966 43315 47773 47998 48824 50535 53437 55345 348 1244 1492 9626 9655 15638 22727 22971 28357 28841 31523 37543 41100 42372 48983 50354 51434 54574 55031 58193 742 1223 1459 20477 21731 23163 23587 30829 31144 32186 32235 32593 34130 40829 42217 42294 42753 44058 49940 51993 841 860 1534 5878 7083 7113 9658 10508 12871 12964 14023 21055 22680 23927 32701 35168 40986 42139 50708 55350 657 1018 1690 6454 7645 7698 8657 9615 16462 18030 19850 19857 33265 33552 42208 44424 48965 52762 55439 58299 14 511 1376 2586 6797 9409 9599 10784 13076 18509 27363 27667 30262 34043 37043 38143 40246 53811 58872 59250 315 883 1487 2067 7537 8749 10785 11820 15702 20232 22850 23540 30247 41182 44884 50601 52140 55970 57879 58514 256 1442 1534 2342 9734 10789 15334 15356 20334 20433 22923 23521 29391 30553 35406 35643 35701 37968 39541 58097 260 1238 1557 14167 15271 18046 20588 23444 25820 26660 30619 31625 33258 38554 40401 46471 53589 54904 56455 60016 591 885 1463 3411 14043 17083 17372 23029 23365 24691 25527 26389 28621 29999 40343 40359 40394 45685 46209 54887 1119 1411 1664 7879 17732 27000 28506 32237 32445 34100 34926 36470 42848 43126 44117 48780 49519 49592 51901 56580 147 1333 1560 6045 11526 14867 15647 19496 26626 27600 28044 30446 35920 37523 42907 42974 46452 52480 57061 60152 304 591 680 5557 6948 13550 19689 19697 22417 23237 25813 31836 32736 36321 36493 36671 46756 53311 59230 59248 586 777 1018 2393 2817 4057 8068 10632 12430 13193 16433 17344 24526 24902 27693 39301 39776 42300 45215 52149 684 1425 1732 2436 4279 7375 8493 10023 14908 20703 25656 25757 27251 27316 33211 35741 38872 42908 55079 58753 962 981 1773 2814 3799 6243 8163 12655 21226 31370 32506 35372 36697 47037 49095 55400 57506 58743 59678 60422 6229 6484 8795 8981 13576 28622 35526 36922 37284 42155 43443 44080 44446 46649 50824 52987 59033 2742 5176 10231 10336 16729 17273 18474 25875 28227 34891 39826 42595 48600 52542 53023 53372 57331 3512 4163 4725 8375 8585 19795 22844 28615 28649 29481 41484 41657 53255 54222 54229 57258 57647 3358 5239 9423 10858 15636 17937 20678 22427 31220 37069 38770 42079 47256 52442 55152 56964 59169 2243 10090 12309 15437 19426 23065 24872 36192 36336 36949 41387 49915 50155 54338 54422 56561 57984 The present invention relates to a transmission method / apparatus.

[0009] A first receiving device / method of the present technology includes: a coding unit that performs LDPC coding based on a check matrix of an LDPC code having a code length N of 69120 bits and a coding rate r of 2 / 16; a group-wise interleaving unit that performs group-wise interleaving to interleave the LDPC code in units of 360-bit bit groups; and a mapping unit that maps the LDPC code to one of 256 signal points of a 2D-Non-Uniform Constellation (NUC) of 256QAM in units of 8 bits, wherein the group-wise interleaving defines an (i+1)-th bit group from the beginning of the LDPC code as bit group i, and maps a sequence of bit groups 0 to 191 of the 69120-bit LDPC code to bit group i. 18, 161, 152, 30, 91, 138, 83, 88, 127, 54, 33, 46, 125, 120, 122, 169, 51, 150, 100, 52, 95, 186, 149, 81, 11, 53, 164, 130, 19, 176, 93, 107, 29, 86, 124, 65, 75, 71, 74, 68, 44, 82, 59, 104, 118, 103, 131, 101, 8, 96, 97, 119, 166, 77, 50, 34, 158, 21, 184, 24, 165, 171, 142, 36, 181, 45, 90, 175, 99, 13, 37, 10, 140, 3, 69, 16, 133, 172, 173, 27, 132, 79, 76, 111, 123, 7, 94, 70, 116, 174, 15, 156, 187, 110, 84, 185, 14, 72, 159, 143, 78, 135, 17, 12, 139, 67, 58, 151, 177, 73, 154, 145, 179, 25, 108, 148, 137, 85, 147, 61, 20, 89, 155, 183, 134, 128, 191, 26, 121, 126, 0, 141, 112, 62, 114, 48, 182, 146, 115, 64, 113, 189, 31, 1, 39, 168, 2, 43, 163, 188, 35, 129, 153, 66, 23, 40, 6, 5, 98, 56, 9, 63, 180, 157, 167, 162, 60, 42, 49, 28, 22, 80, 87, 92, 160, 55, 136, 170, 106, 117, 178, 32, 38, 105, 102, 41, 57, 109, 144, 47, 190, 4 the parity check matrix includes an A matrix at the top left of the parity 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 of a staircase structure adjacent to the right of the A matrix, which has M1 rows and M1 columns, a Z matrix which is a zero matrix adjacent to the right of the B matrix, which has M1 rows and N-K-M1 columns, a C matrix adjacent below the A matrix and the B matrix, which has N-K-M1 rows and K+M1 columns, and a D matrix which is an identity matrix adjacent to the right of the C matrix, which has N-K-M1 rows and N-K-M1 columns, the predetermined value M1 is 1800, the A matrix and the C matrix are represented by a parity check matrix initial value table, and the parity check matrix initial value table is a table which represents positions of elements of 1 in the A matrix and the C matrix every 360 columns, 1617 1754 1768 2501 6874 12486 12872 16244 18612 19698 21649 30954 33221 33723 34495 37587 38542 41510 42268 52159 59780 206 610 991 2665 4994 5681 12371 17343 25547 26291 26678 27791 27828 32437 33153 35429 39943 45246 46732 53342 60451 119 682 963 3339 6794 7021 7295 8856 8942 10842 11318 14050 14474 27281 28637 29963 37861 42536 43865 48803 59969 175 201 355 5418 7990 10567 10642 12987 16685 18463 21861 24307 25274 27515 39631 40166 43058 47429 55512 55519 59426 117 839 1043 1960 6896 19146 24022 26586 29342 29906 33129 33647 33883 34113 34550 38720 40247 45651 51156 53053 56614 135 236 257 7505 9412 12642 19752 20201 26010 28967 31146 37156 44685 45667 50066 51283 54365 55475 56501 58763 59121 109 840 1573 5523 19968 23924 24644 27064 29410 31276 31526 32173 38175 43570 43722 46655 46660 48353 54025 57319 59818 522 1236 1573 6563 11625 13846 17570 19547 22579 22584 29338 30497 33124 33152 35407 36364 37726 41426 53800 57130 504 1330 1481 13809 15761 20050 26339 27418 29630 32073 33762 34354 36966 43315 47773 47998 48824 50535 53437 55345 348 1244 1492 9626 9655 15638 22727 22971 28357 28841 31523 37543 41100 42372 48983 50354 51434 54574 55031 58193 742 1223 1459 20477 21731 23163 23587 30829 31144 32186 32235 32593 34130 40829 42217 42294 42753 44058 49940 51993 841 860 1534 5878 7083 7113 9658 10508 12871 12964 14023 21055 22680 23927 32701 35168 40986 42139 50708 55350 657 1018 1690 6454 7645 7698 8657 9615 16462 18030 19850 19857 33265 33552 42208 44424 48965 52762 55439 58299 14 511 1376 2586 6797 9409 9599 10784 13076 18509 27363 27667 30262 34043 37043 38143 40246 53811 58872 59250 315 883 1487 2067 7537 8749 10785 11820 15702 20232 22850 23540 30247 41182 44884 50601 52140 55970 57879 58514 256 1442 1534 2342 9734 10789 15334 15356 20334 20433 22923 23521 29391 30553 35406 35643 35701 37968 39541 58097 260 1238 1557 14167 15271 18046 20588 23444 25820 26660 30619 31625 33258 38554 40401 46471 53589 54904 56455 60016 591 885 1463 3411 14043 17083 17372 23029 23365 24691 25527 26389 28621 29999 40343 40359 40394 45685 46209 54887 1119 1411 1664 7879 17732 27000 28506 32237 32445 34100 34926 36470 42848 43126 44117 48780 49519 49592 51901 56580 147 1333 1560 6045 11526 14867 15647 19496 26626 27600 28044 30446 35920 37523 42907 42974 46452 52480 57061 60152 304 591 680 5557 6948 13550 19689 19697 22417 23237 25813 31836 32736 36321 36493 36671 46756 53311 59230 59248 586 777 1018 2393 2817 4057 8068 10632 12430 13193 16433 17344 24526 24902 27693 39301 39776 42300 45215 52149 684 1425 1732 2436 4279 7375 8493 10023 14908 20703 25656 25757 27251 27316 33211 35741 38872 42908 55079 58753 962 981 1773 2814 3799 6243 8163 12655 21226 31370 32506 35372 36697 47037 49095 55400 57506 58743 59678 60422 6229 6484 8795 8981 13576 28622 35526 36922 37284 42155 43443 44080 44446 46649 50824 52987 59033 2742 5176 10231 10336 16729 17273 18474 25875 28227 34891 39826 42595 48600 52542 53023 53372 57331 3512 4163 4725 8375 8585 19795 22844 28615 28649 29481 41484 41657 53255 54222 54229 57258 57647 3358 5239 9423 10858 15636 17937 20678 22427 31220 37069 38770 42079 47256 52442 55152 56964 59169 2243 10090 12309 15437 19426 23065 24872 36192 36336 36949 41387 49915 50155 54338 54422 56561 57984 The receiving device / method includes a group-wise deinterleaving unit / step for restoring the arrangement of the LDPC codes after group-wise interleaving, obtained from data transmitted from a transmitting device, to the original arrangement.

[0010] A second transmission method / apparatus of the present technology includes: a coding step / unit that performs LDPC coding based on a check matrix of an LDPC code having a code length N of 69120 bits and a coding rate r of 4 / 16; a group-wise interleaving step / unit that performs group-wise interleaving of the LDPC code in units of 360-bit bit groups; and a mapping step / unit that maps the LDPC code to one of 256 signal points of a 2D-NUC (Non-Uniform Constellation) of 256QAM in units of 8 bits, wherein in the group-wise interleaving, the (i+1)-th bit group from the beginning of the LDPC code is defined as bit group i, and a sequence of bit groups 0 to 191 of the 69120-bit LDPC code is mapped to bit group i. 172, 48, 104, 60, 184, 162, 86, 185, 11, 132, 155, 50, 146, 178, 5, 28, 133, 169, 106, 90, 174, 95, 42, 10, 78, 177, 21, 112, 54, 153, 136, 12, 115, 108, 92, 152, 180, 151, 13, 62, 25, 51, 191, 84, 167, 139, 96, 111, 130, 150, 7, 143, 144, 117, 124, 27, 38, 72, 6, 128, 36, 39, 26, 156, 32, 127, 181, 122, 52, 131, 68, 140, 173, 182, 154, 190, 137, 61, 2, 138, 43, 110, 29, 116, 176, 30, 57, 189, 14, 4, 65, 80, 33, 75, 135, 20, 103, 98, 56, 179, 129, 105, 113, 71, 160, 85, 55, 0, 166, 59, 183, 142, 19, 22, 63, 125, 165, 88, 87, 93, 168, 77, 45, 69, 175, 100, 145, 31, 91, 141, 114, 157, 119, 16, 1, 34, 15, 147, 46, 188, 70, 74, 109, 126, 18, 64, 89, 134, 9, 161, 158, 44, 3, 47, 148, 187, 81, 164, 121, 35, 23, 24, 159, 82, 40, 94, 67, 163, 170, 58, 97, 8, 83, 53, 118, 149, 73, 107, 123, 79, 41, 99, 186, 101, 49, 120, 66, 76, 17, 171, 102, 37 the parity check matrix includes an A matrix at the top left of the parity 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 of a staircase structure adjacent to the right of the A matrix, which has M1 rows and M1 columns, a Z matrix which is a zero matrix adjacent to the right of the B matrix, which has M1 rows and N-K-M1 columns, a C matrix adjacent below the A matrix and the B matrix, which has N-K-M1 rows and K+M1 columns, and a D matrix which is an identity matrix adjacent to the right of the C matrix, which has N-K-M1 rows and N-K-M1 columns, the predetermined value M1 is 1800, the A matrix and the C matrix are represented by a parity check matrix initial value table, and the parity check matrix initial value table is a table which represents positions of elements of 1 in the A matrix and the C matrix every 360 columns, 561 825 1718 4745 7515 13041 13466 18039 19065 21821 32596 32708 35323 36399 36450 41124 43036 43218 43363 44875 49948 56 102 1779 2427 5381 8768 15336 26473 35717 38748 39066 45002 50720 694 1150 1533 2177 5801 6610 7601 16657 18949 33472 47746 49581 50668 90 1122 1472 2085 2593 4986 8200 9175 15502 44084 46057 48546 50487 521 619 708 6915 8978 14211 17426 23058 23463 27440 29822 33443 42871 449 912 1471 8058 9344 11928 20533 20600 20737 26557 26970 27616 33791 355 700 1528 6478 9588 10790 20992 33122 34283 41295 43439 46249 47763 997 1543 1679 5874 7973 7975 11113 28275 28812 29864 35070 36864 50676 85 326 1392 4186 10855 11005 12913 19263 22984 31733 33787 37567 48173 986 1144 1508 19864 28918 29117 33609 36452 47975 48432 48842 49274 51533 437 1190 1413 3814 6695 17541 22060 25845 28431 37453 38912 44170 49231 327 1171 1204 6952 11880 16469 25058 28956 31523 36770 40189 43422 46481 123 605 619 8118 8455 19550 20529 21762 21950 28485 30946 34755 34765 113 896 971 6400 27059 33383 34537 35827 38796 40582 42594 43098 48525 162 854 1015 2938 10659 12085 13040 32772 33023 35878 49674 51060 51333 100 452 1703 1932 4208 5127 12086 14549 16084 17890 20870 41364 48498 1569 1633 1666 12957 18611 22499 38418 38719 42135 46815 48274 50947 51387 119 691 1190 2457 3865 7468 12512 30782 31811 33508 36586 41789 47426 867 1117 1666 4376 13263 13466 33524 37440 38136 39800 41454 41620 42510 378 900 1754 16303 25369 27103 28360 30958 35316 44165 46682 47016 50004 1321 1549 1570 16276 17284 19431 23482 23920 27386 27517 46253 48617 50118 37 383 1418 15792 22551 28843 36532 36718 38805 39226 45671 47712 51769 150 787 1441 17828 19396 21576 21805 24048 31868 32891 42486 43020 45492 1095 1214 1744 2445 5773 10209 11526 29604 30121 36526 45786 47376 49366 412 448 1281 11164 14501 15538 15773 23305 31960 32721 40744 45731 50269 183 626 837 4491 12237 13705 15177 15973 21266 25374 41232 44147 50529 618 1550 1594 5474 9260 16552 18122 26061 30420 30922 32661 34390 43236 135 496 757 9327 15659 20738 24327 26688 29063 38993 46155 49532 50001 64 126 1714 5561 8921 11300 12688 14454 16857 19585 20528 24107 27252 528 687 1730 9735 11737 16396 19200 33712 34271 38241 42027 44471 45581 69 646 1447 8603 19706 22153 22398 23840 24638 27254 29107 30368 41419 673 845 1285 9100 11064 14804 15425 17357 27248 31223 32410 35444 48018 124 1531 1677 3672 3673 3786 8886 9557 10003 11053 13053 22458 25413 102 1154 1758 5721 6034 14567 17772 28670 33380 34284 35356 47480 48123 48 351 760 2078 9797 22956 26120 34119 39658 41039 45237 47861 49022 254 445 841 6835 18340 19021 20053 22874 32639 36679 42004 45696 49530 16 802 903 6218 16206 22068 23049 28201 30377 33947 44358 44739 49303 153 1542 1629 7992 29900 34931 36927 38651 39981 41085 41327 50185 51484 525 1291 1765 9425 20271 31229 37444 38996 39145 41711 43188 45203 51255 2 244 1648 12321 14991 17426 18456 20126 29915 32581 38880 39516 49013 23 452 705 9414 11862 13764 18179 35458 37892 40471 46041 46494 48746 509 1201 1328 8921 9867 10947 19476 22693 32636 34301 38356 39238 51797 246 249 1390 12438 13266 24060 33628 37130 42923 43298 43709 43721 45413 117 257 748 9419 9461 11350 12790 16724 33147 34168 34683 37884 42699 619 646 740 7468 7604 8152 16296 19120 27614 27748 40170 40289 49366 914 1360 1716 10817 17672 18919 26146 29631 40903 46716 49502 51576 51657 68 702 1552 10431 10925 12856 24516 26440 30834 31179 32277 35019 44108 588 880 1524 6641 9453 9653 13679 14488 20714 25865 42217 42637 48312 6380 12240 12558 12816 21460 24206 26129 28555 41616 51767 8889 16221 21629 23476 33954 40572 43494 44666 44885 49813 16938 17727 17913 18898 21754 32515 35686 36920 39898 43560 9170 11747 14681 22874 24537 24685 26989 28947 33592 34621 2427 10241 29649 30522 37700 37789 41656 44020 49801 51268 The present invention relates to a transmission method / apparatus.

[0011] A second receiving apparatus / method of the present technology includes a coding unit that performs LDPC coding based on a check matrix of an LDPC code having a code length N of 69120 bits and a coding rate r of 4 / 16, a group-wise interleaving unit that performs group-wise interleaving to interleave the LDPC code in units of 360-bit bit groups, and a mapping unit that maps the LDPC code to one of 256 signal points of a 2D-NUC (Non-Uniform Constellation) of 256QAM in units of 8 bits, wherein the group-wise interleaving defines an (i+1)-th bit group from the beginning of the LDPC code as bit group i, and maps a sequence of bit groups 0 to 191 of the 69120-bit LDPC code to bit group i. 172, 48, 104, 60, 184, 162, 86, 185, 11, 132, 155, 50, 146, 178, 5, 28, 133, 169, 106, 90, 174, 95, 42, 10, 78, 177, 21, 112, 54, 153, 136, 12, 115, 108, 92, 152, 180, 151, 13, 62, 25, 51, 191, 84, 167, 139, 96, 111, 130, 150, 7, 143, 144, 117, 124, 27, 38, 72, 6, 128, 36, 39, 26, 156, 32, 127, 181, 122, 52, 131, 68, 140, 173, 182, 154, 190, 137, 61, 2, 138, 43, 110, 29, 116, 176, 30, 57, 189, 14, 4, 65, 80, 33, 75, 135, 20, 103, 98, 56, 179, 129, 105, 113, 71, 160, 85, 55, 0, 166, 59, 183, 142, 19, 22, 63, 125, 165, 88, 87, 93, 168, 77, 45, 69, 175, 100, 145, 31, 91, 141, 114, 157, 119, 16, 1, 34, 15, 147, 46, 188, 70, 74, 109, 126, 18, 64, 89, 134, 9, 161, 158, 44, 3, 47, 148, 187, 81, 164, 121, 35, 23, 24, 159, 82, 40, 94, 67, 163, 170, 58, 97, 8, 83, 53, 118, 149, 73, 107, 123, 79, 41, 99, 186, 101, 49, 120, 66, 76, 17, 171, 102, 37 the parity check matrix includes an A matrix at the top left of the parity 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 of a staircase structure adjacent to the right of the A matrix, which has M1 rows and M1 columns, a Z matrix which is a zero matrix adjacent to the right of the B matrix, which has M1 rows and N-K-M1 columns, a C matrix adjacent below the A matrix and the B matrix, which has N-K-M1 rows and K+M1 columns, and a D matrix which is an identity matrix adjacent to the right of the C matrix, which has N-K-M1 rows and N-K-M1 columns, the predetermined value M1 is 1800, the A matrix and the C matrix are represented by a parity check matrix initial value table, and the parity check matrix initial value table is a table which represents positions of elements of 1 in the A matrix and the C matrix every 360 columns, 561 825 1718 4745 7515 13041 13466 18039 19065 21821 32596 32708 35323 36399 36450 41124 43036 43218 43363 44875 49948 56 102 1779 2427 5381 8768 15336 26473 35717 38748 39066 45002 50720 694 1150 1533 2177 5801 6610 7601 16657 18949 33472 47746 49581 50668 90 1122 1472 2085 2593 4986 8200 9175 15502 44084 46057 48546 50487 521 619 708 6915 8978 14211 17426 23058 23463 27440 29822 33443 42871 449 912 1471 8058 9344 11928 20533 20600 20737 26557 26970 27616 33791 355 700 1528 6478 9588 10790 20992 33122 34283 41295 43439 46249 47763 997 1543 1679 5874 7973 7975 11113 28275 28812 29864 35070 36864 50676 85 326 1392 4186 10855 11005 12913 19263 22984 31733 33787 37567 48173 986 1144 1508 19864 28918 29117 33609 36452 47975 48432 48842 49274 51533 437 1190 1413 3814 6695 17541 22060 25845 28431 37453 38912 44170 49231 327 1171 1204 6952 11880 16469 25058 28956 31523 36770 40189 43422 46481 123 605 619 8118 8455 19550 20529 21762 21950 28485 30946 34755 34765 113 896 971 6400 27059 33383 34537 35827 38796 40582 42594 43098 48525 162 854 1015 2938 10659 12085 13040 32772 33023 35878 49674 51060 51333 100 452 1703 1932 4208 5127 12086 14549 16084 17890 20870 41364 48498 1569 1633 1666 12957 18611 22499 38418 38719 42135 46815 48274 50947 51387 119 691 1190 2457 3865 7468 12512 30782 31811 33508 36586 41789 47426 867 1117 1666 4376 13263 13466 33524 37440 38136 39800 41454 41620 42510 378 900 1754 16303 25369 27103 28360 30958 35316 44165 46682 47016 50004 1321 1549 1570 16276 17284 19431 23482 23920 27386 27517 46253 48617 50118 37 383 1418 15792 22551 28843 36532 36718 38805 39226 45671 47712 51769 150 787 1441 17828 19396 21576 21805 24048 31868 32891 42486 43020 45492 1095 1214 1744 2445 5773 10209 11526 29604 30121 36526 45786 47376 49366 412 448 1281 11164 14501 15538 15773 23305 31960 32721 40744 45731 50269 183 626 837 4491 12237 13705 15177 15973 21266 25374 41232 44147 50529 618 1550 1594 5474 9260 16552 18122 26061 30420 30922 32661 34390 43236 135 496 757 9327 15659 20738 24327 26688 29063 38993 46155 49532 50001 64 126 1714 5561 8921 11300 12688 14454 16857 19585 20528 24107 27252 528 687 1730 9735 11737 16396 19200 33712 34271 38241 42027 44471 45581 69 646 1447 8603 19706 22153 22398 23840 24638 27254 29107 30368 41419 673 845 1285 9100 11064 14804 15425 17357 27248 31223 32410 35444 48018 124 1531 1677 3672 3673 3786 8886 9557 10003 11053 13053 22458 25413 102 1154 1758 5721 6034 14567 17772 28670 33380 34284 35356 47480 48123 48 351 760 2078 9797 22956 26120 34119 39658 41039 45237 47861 49022 254 445 841 6835 18340 19021 20053 22874 32639 36679 42004 45696 49530 16 802 903 6218 16206 22068 23049 28201 30377 33947 44358 44739 49303 153 1542 1629 7992 29900 34931 36927 38651 39981 41085 41327 50185 51484 525 1291 1765 9425 20271 31229 37444 38996 39145 41711 43188 45203 51255 2 244 1648 12321 14991 17426 18456 20126 29915 32581 38880 39516 49013 23 452 705 9414 11862 13764 18179 35458 37892 40471 46041 46494 48746 509 1201 1328 8921 9867 10947 19476 22693 32636 34301 38356 39238 51797 246 249 1390 12438 13266 24060 33628 37130 42923 43298 43709 43721 45413 117 257 748 9419 9461 11350 12790 16724 33147 34168 34683 37884 42699 619 646 740 7468 7604 8152 16296 19120 27614 27748 40170 40289 49366 914 1360 1716 10817 17672 18919 26146 29631 40903 46716 49502 51576 51657 68 702 1552 10431 10925 12856 24516 26440 30834 31179 32277 35019 44108 588 880 1524 6641 9453 9653 13679 14488 20714 25865 42217 42637 48312 6380 12240 12558 12816 21460 24206 26129 28555 41616 51767 8889 16221 21629 23476 33954 40572 43494 44666 44885 49813 16938 17727 17913 18898 21754 32515 35686 36920 39898 43560 9170 11747 14681 22874 24537 24685 26989 28947 33592 34621 2427 10241 29649 30522 37700 37789 41656 44020 49801 51268 The receiving device / method includes a group-wise deinterleaving unit / step for restoring the arrangement of the LDPC codes after group-wise interleaving, obtained from data transmitted from a transmitting device, to the original arrangement.

[0012] A third transmission method / apparatus of the present technology includes: a coding step / unit that performs LDPC coding based on a check matrix of an LDPC code having a code length N of 69120 bits and a coding rate r of 6 / 16; a group-wise interleaving step / unit that performs group-wise interleaving of the LDPC code in units of 360-bit bit groups; and a mapping step / unit that maps the LDPC code to one of 256 signal points of a 2D-NUC (Non-Uniform Constellation) of 256QAM in units of 8 bits, wherein in the group-wise interleaving, the (i+1)-th bit group from the beginning of the LDPC code is defined as bit group i, and a sequence of bit groups 0 to 191 of the 69120-bit LDPC code is mapped to bit group i. 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 the parity check matrix includes an A matrix at the top left of the parity 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 of a staircase structure adjacent to the right of the A matrix, which has M1 rows and M1 columns, a Z matrix which is a zero matrix adjacent to the right of the B matrix, which has M1 rows and N-K-M1 columns, a C matrix adjacent below the A matrix and the B matrix, which has N-K-M1 rows and K+M1 columns, and a D matrix which is an identity matrix adjacent to the right of the C matrix, which has N-K-M1 rows and N-K-M1 columns, the predetermined value M1 is 1800, the A matrix and the C matrix are represented by a parity check matrix initial value table, and the parity check matrix initial value table is a table which represents positions of elements of 1 in the A matrix and the C matrix every 360 columns, 608 1394 3635 14404 15203 19848 22161 23175 26651 31945 41227 481 570 11088 11673 11866 17145 17247 17564 21607 25992 31286 1207 1257 1870 8472 8855 10511 15656 17064 22720 28352 30914 1171 1585 6218 7621 10121 11374 13184 22714 27207 27959 38572 244 548 2073 4937 7509 11840 12850 18762 25618 27902 37150 15 1352 7060 7886 8151 10574 14172 15258 24838 30827 35337 1009 1651 13300 13958 26240 29983 32340 40743 41553 42475 42873 638 1405 5544 6797 10001 14934 24766 35758 40719 41787 42342 1467 1481 3202 11324 14048 15217 17608 22544 26736 32073 33405 1274 1343 3576 4166 8712 10756 21175 26866 37021 40341 42064 1232 1590 4409 8705 13307 28481 30893 36031 36780 37697 39149 189 1678 9943 10774 11765 25520 26133 27351 27353 40664 41534 125 1421 5009 9365 12792 15933 16231 25975 27076 27997 32429 1361 1764 5376 11071 14456 16324 20318 26168 28445 30392 34235 1017 1303 3312 6738 7813 18149 25506 29032 36789 38742 43116 463 967 10876 13874 14303 16789 21656 26555 38738 39195 40668 630 1104 3029 3165 5157 12880 14175 16498 35121 38917 40944 716 1054 10011 11739 16913 19396 20892 23370 24392 27614 38467 1081 1238 2872 10259 13618 16943 17363 23570 29721 32411 38969 775 1002 2978 9202 16618 22697 30716 31750 36517 37294 40454 25 497 10687 13308 15302 17525 17539 21865 22279 24516 26992 781 878 6426 8551 12328 21375 27626 28192 29731 35423 35606 729 1734 3479 6850 14347 14776 21998 33617 34690 38597 38704 122 1378 1660 7448 7659 11900 13039 13796 19908 504 716 1551 5655 6245 8365 9825 16627 29100 88 900 1057 2620 16729 17278 17444 26106 26587 30 1697 1736 8718 11664 20885 27043 42569 42913 293 634 1188 4005 5266 6205 26756 30207 37757 254 755 1187 4631 13433 25055 28354 28583 30446 316 1381 1522 3131 4340 27284 28246 28282 43174 84 293 645 2148 7925 13104 25010 36836 39033 982 1486 1660 4287 5335 18350 26913 30774 31280 418 1028 1039 3334 4577 6553 7011 17259 31922 1324 1361 1690 5991 7740 16880 18479 25713 31823 735 1322 1727 8629 14655 15815 16762 23263 36859 19 928 1561 11161 12894 14226 21331 41128 41883 327 940 1004 13616 15894 31400 34106 34443 37957 576 953 1226 2122 4900 5002 10248 25476 30787 249 632 1240 5432 23019 29225 31719 36658 41360 980 1154 1783 4351 10245 23347 27442 28328 38555 581 863 1552 5057 7572 14544 20482 29482 31672 4 502 1450 4883 5176 6824 10430 32680 39581 81 761 1558 2269 5391 13213 24184 25523 39429 1085 1163 1244 7694 9125 17387 22223 26343 37933 204 1127 1483 18302 19939 20576 31599 32619 42911 345 387 591 8727 18080 20628 32251 34562 42821 957 1126 1133 4099 12272 15595 20906 23606 34564 409 1310 1335 2761 11952 26853 27941 29262 31647 329 818 1527 3890 5238 8742 15586 28739 43015 231 1158 1677 4314 15937 17526 18391 22963 39232 34 275 526 2975 4742 16109 17346 29145 37673 497 735 1261 7468 8769 17342 19763 32646 33497 879 1233 1633 11612 22941 23723 31969 35571 39510 886 954 1355 5532 8283 26965 29267 30820 40402 356 1199 1452 8833 14845 21722 23840 26539 27970 553 1570 1732 8249 16820 23181 23234 30754 40399 457 1304 1698 2774 11357 32906 34484 38700 41799 456 579 1155 23844 27261 29172 30980 35000 40984 301 1290 1782 6798 9735 23655 31040 35554 36366 228 483 561 12346 16698 32688 34518 38648 41677 35 184 997 4915 7077 9878 16772 26263 27270 181 193 1255 7548 17103 34511 36590 38107 42065 697 1024 1541 2164 15638 20061 32499 32667 32732 654 968 1632 3215 4901 6286 12414 13963 29636 89 150 450 5771 10863 29809 36886 37914 42983 517 1046 1153 5458 18093 25579 31084 37779 42050 345 914 1372 4548 6720 13678 13755 15422 41938 301 518 1107 3603 6076 9265 19580 41645 42621 155 1013 1441 10166 10545 22042 30084 33026 34505 899 1308 1766 22228 24520 24589 30833 32126 37147 177 230 349 6309 9642 25713 30455 34964 40524 802 1364 1703 3573 17317 20364 22849 24265 24925 3952 10609 11011 16296 31430 39995 40207 41606 42424 16548 19896 22579 23043 23126 24141 34331 34959 37990 12197 15244 22990 23110 25507 30011 37681 38902 39432 2292 11871 15562 22304 33059 35126 39158 41206 41866 3497 7847 11510 16212 19408 26780 27967 33953 34451 The present invention relates to a transmission method / apparatus.

[0013] A third receiving apparatus / method of the present technology includes a coding unit that performs LDPC coding based on a check matrix of an LDPC code having a code length N of 69120 bits and a coding rate r of 6 / 16, a group-wise interleaving unit that performs group-wise interleaving that interleaves the LDPC code in units of 360-bit bit groups, and a mapping unit that maps the LDPC code to one of 256 signal points of a 2D-Non-Uniform Constellation (NUC) of 256QAM in units of 8 bits, wherein the group-wise interleaving defines an (i+1)-th bit group from the beginning of the LDPC code as bit group i, and maps a sequence of bit groups 0 to 191 of the 69120-bit LDPC code to bit group i. 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 the parity check matrix includes an A matrix at the top left of the parity 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 of a staircase structure adjacent to the right of the A matrix, which has M1 rows and M1 columns, a Z matrix which is a zero matrix adjacent to the right of the B matrix, which has M1 rows and N-K-M1 columns, a C matrix adjacent below the A matrix and the B matrix, which has N-K-M1 rows and K+M1 columns, and a D matrix which is an identity matrix adjacent to the right of the C matrix, which has N-K-M1 rows and N-K-M1 columns, the predetermined value M1 is 1800, the A matrix and the C matrix are represented by a parity check matrix initial value table, and the parity check matrix initial value table is a table which represents positions of elements of 1 in the A matrix and the C matrix every 360 columns, 608 1394 3635 14404 15203 19848 22161 23175 26651 31945 41227 481 570 11088 11673 11866 17145 17247 17564 21607 25992 31286 1207 1257 1870 8472 8855 10511 15656 17064 22720 28352 30914 1171 1585 6218 7621 10121 11374 13184 22714 27207 27959 38572 244 548 2073 4937 7509 11840 12850 18762 25618 27902 37150 15 1352 7060 7886 8151 10574 14172 15258 24838 30827 35337 1009 1651 13300 13958 26240 29983 32340 40743 41553 42475 42873 638 1405 5544 6797 10001 14934 24766 35758 40719 41787 42342 1467 1481 3202 11324 14048 15217 17608 22544 26736 32073 33405 1274 1343 3576 4166 8712 10756 21175 26866 37021 40341 42064 1232 1590 4409 8705 13307 28481 30893 36031 36780 37697 39149 189 1678 9943 10774 11765 25520 26133 27351 27353 40664 41534 125 1421 5009 9365 12792 15933 16231 25975 27076 27997 32429 1361 1764 5376 11071 14456 16324 20318 26168 28445 30392 34235 1017 1303 3312 6738 7813 18149 25506 29032 36789 38742 43116 463 967 10876 13874 14303 16789 21656 26555 38738 39195 40668 630 1104 3029 3165 5157 12880 14175 16498 35121 38917 40944 716 1054 10011 11739 16913 19396 20892 23370 24392 27614 38467 1081 1238 2872 10259 13618 16943 17363 23570 29721 32411 38969 775 1002 2978 9202 16618 22697 30716 31750 36517 37294 40454 25 497 10687 13308 15302 17525 17539 21865 22279 24516 26992 781 878 6426 8551 12328 21375 27626 28192 29731 35423 35606 729 1734 3479 6850 14347 14776 21998 33617 34690 38597 38704 122 1378 1660 7448 7659 11900 13039 13796 19908 504 716 1551 5655 6245 8365 9825 16627 29100 88 900 1057 2620 16729 17278 17444 26106 26587 30 1697 1736 8718 11664 20885 27043 42569 42913 293 634 1188 4005 5266 6205 26756 30207 37757 254 755 1187 4631 13433 25055 28354 28583 30446 316 1381 1522 3131 4340 27284 28246 28282 43174 84 293 645 2148 7925 13104 25010 36836 39033 982 1486 1660 4287 5335 18350 26913 30774 31280 418 1028 1039 3334 4577 6553 7011 17259 31922 1324 1361 1690 5991 7740 16880 18479 25713 31823 735 1322 1727 8629 14655 15815 16762 23263 36859 19 928 1561 11161 12894 14226 21331 41128 41883 327 940 1004 13616 15894 31400 34106 34443 37957 576 953 1226 2122 4900 5002 10248 25476 30787 249 632 1240 5432 23019 29225 31719 36658 41360 980 1154 1783 4351 10245 23347 27442 28328 38555 581 863 1552 5057 7572 14544 20482 29482 31672 4 502 1450 4883 5176 6824 10430 32680 39581 81 761 1558 2269 5391 13213 24184 25523 39429 1085 1163 1244 7694 9125 17387 22223 26343 37933 204 1127 1483 18302 19939 20576 31599 32619 42911 345 387 591 8727 18080 20628 32251 34562 42821 957 1126 1133 4099 12272 15595 20906 23606 34564 409 1310 1335 2761 11952 26853 27941 29262 31647 329 818 1527 3890 5238 8742 15586 28739 43015 231 1158 1677 4314 15937 17526 18391 22963 39232 34 275 526 2975 4742 16109 17346 29145 37673 497 735 1261 7468 8769 17342 19763 32646 33497 879 1233 1633 11612 22941 23723 31969 35571 39510 886 954 1355 5532 8283 26965 29267 30820 40402 356 1199 1452 8833 14845 21722 23840 26539 27970 553 1570 1732 8249 16820 23181 23234 30754 40399 457 1304 1698 2774 11357 32906 34484 38700 41799 456 579 1155 23844 27261 29172 30980 35000 40984 301 1290 1782 6798 9735 23655 31040 35554 36366 228 483 561 12346 16698 32688 34518 38648 41677 35 184 997 4915 7077 9878 16772 26263 27270 181 193 1255 7548 17103 34511 36590 38107 42065 697 1024 1541 2164 15638 20061 32499 32667 32732 654 968 1632 3215 4901 6286 12414 13963 29636 89 150 450 5771 10863 29809 36886 37914 42983 517 1046 1153 5458 18093 25579 31084 37779 42050 345 914 1372 4548 6720 13678 13755 15422 41938 301 518 1107 3603 6076 9265 19580 41645 42621 155 1013 1441 10166 10545 22042 30084 33026 34505 899 1308 1766 22228 24520 24589 30833 32126 37147 177 230 349 6309 9642 25713 30455 34964 40524 802 1364 1703 3573 17317 20364 22849 24265 24925 3952 10609 11011 16296 31430 39995 40207 41606 42424 16548 19896 22579 23043 23126 24141 34331 34959 37990 12197 15244 22990 23110 25507 30011 37681 38902 39432 2292 11871 15562 22304 33059 35126 39158 41206 41866 3497 7847 11510 16212 19408 26780 27967 33953 34451 The receiving device / method includes a group-wise deinterleaving unit / step for restoring the arrangement of the LDPC codes after group-wise interleaving, obtained from data transmitted from a transmitting device, to the original arrangement.

[0014] A fourth transmission method / apparatus of the present technology includes: a coding step / unit that performs LDPC coding based on a check matrix of an LDPC code having a code length N of 69120 bits and a coding rate r of 8 / 16; a group-wise interleaving step / unit that performs group-wise interleaving of the LDPC code in units of 360-bit bit groups; and a mapping step / unit that maps the LDPC code to one of 256 signal points of a 2D-NUC (Non-Uniform Constellation) of 256QAM in units of 8 bits, wherein in the group-wise interleaving, the (i+1)-th bit group from the beginning of the LDPC code is defined as bit group i, and a sequence of bit groups 0 to 191 of the 69120-bit LDPC code is mapped to bit group i+1. 97, 121, 122, 73, 108, 167, 75, 156, 64, 49, 29, 18, 110, 171, 8, 27, 54, 41, 164, 15, 129, 157, 130, 111, 112, 120, 152, 12, 13, 101, 31, 69, 180, 143, 78, 125, 79, 172, 40, 116, 58, 71, 126, 55, 35, 191, 185, 159, 44, 86, 3, 80, 88, 145, 98, 144, 0, 62, 38, 150, 166, 114, 139, 60, 149, 10, 72, 155, 181, 26, 85, 128, 19, 25, 4, 170, 94, 175, 136, 117, 135, 102, 21, 89, 140, 138, 100, 33, 142, 74, 133, 56, 124, 17, 77, 65, 119, 59, 182, 105, 99, 158, 24, 96, 70, 83, 23, 81, 132, 7, 141, 61, 57, 82, 115, 162, 186, 103, 43, 148, 47, 176, 113, 151, 50, 184, 165, 109, 189, 90, 32, 20, 46, 127, 153, 161, 106, 11, 67, 36, 9, 28, 174, 160, 16, 93, 95, 6, 131, 66, 39, 14, 91, 163, 68, 48, 123, 137, 52, 5, 183, 76, 179, 22, 34, 147, 107, 168, 146, 42, 173, 53, 190, 104, 51, 118, 45, 30, 178, 134, 169, 37, 187, 177, 1, 2, 154, 87, 63, 92, 188, 84 The LDPC code includes information bits and parity bits, the check matrix includes an information matrix portion corresponding to the information bits and a parity matrix portion corresponding to the parity bits, the information matrix portion is represented by a check matrix initial value table, and the check matrix initial value table is a table that represents the position of an element of 1 in the information matrix portion for every 360 columns, 1850 4176 4190 7294 8168 8405 9258 9710 13440 16304 16600 18184 18834 19899 22513 25068 26659 27137 27232 29186 29667 30549 31428 33634 2477 2543 5094 8081 9573 10269 11276 11439 13016 13327 16717 18042 19362 19721 20089 20425 20503 21396 24677 24722 28703 32486 32759 33630 1930 2158 2315 2683 3818 4883 5252 5505 8760 9580 11867 13117 14566 15639 17273 18820 21069 24945 25667 26785 30678 31271 33003 33244 1279 1491 2038 2347 2432 4336 4905 6588 7507 7666 8775 9172 10405 12249 12270 12373 12936 13046 13364 15130 17597 22855 27548 32895 620 1897 3775 5552 6799 7621 10167 10172 10615 11367 12093 13241 15426 16623 19467 19792 22069 22370 24472 24594 25205 25954 27800 29422 582 1618 4673 5809 6318 6883 8051 12335 12409 13176 14078 15206 17580 18624 18876 19079 20786 21177 25894 26395 27377 27757 30167 31971 1157 2189 4160 4480 5055 8961 9171 9444 10533 11581 12904 14256 14620 15773 16232 17598 19756 21134 21443 22559 23258 25137 25555 28150 987 1258 1269 2394 4859 5642 5705 6093 6408 7734 8804 10657 11946 16132 20267 25402 26505 26548 27060 29767 29780 31915 31966 33590 1010 1363 1626 5283 6356 10961 12418 14332 14362 16288 16303 16592 17096 20115 20285 20478 21774 22165 22425 23198 25048 25596 31540 32841 895 2743 2912 4971 8803 11183 14500 14617 14638 16776 17901 18622 20244 20845 22214 25676 26161 26281 29978 30392 30922 31542 32038 32443 188 260 411 2823 5512 5645 10019 11856 12671 14273 14673 16091 16169 22333 22934 22945 23542 26503 27159 27279 28277 30114 31626 32722 357 516 3530 4317 8587 9491 10348 11330 13446 14533 15423 17003 17217 19127 20088 20750 21767 22386 24021 27749 29008 29376 30329 32940 2909 3036 4875 9967 10632 12069 12410 14004 14628 15605 15852 18231 18657 19705 20620 22241 29575 29656 31246 32190 32781 33489 33842 34492 4242 5461 5577 7662 11130 13663 17240 17773 18339 19400 22905 24219 25464 25890 26359 27121 27318 27840 30800 32587 32924 33427 33940 34058 421 2222 3457 5257 5600 10147 12754 17380 18854 20333 20345 20752 24578 25196 25638 25725 25822 27610 28006 28563 29632 29973 29991 34166 41 207 1043 4650 5387 6826 7261 8687 9092 10775 11446 12596 16613 19463 20923 24155 24927 25384 26064 27377 28094 32578 32639 34115 1050 5731 15820 16281 26130 29314 5980 6161 14479 22181 22537 32924 7828 9134 11297 17143 25449 29674 8299 10457 14486 21548 22510 32039 1527 7792 10424 19166 29302 29768 5823 13974 21254 21506 25658 29491 6285 9873 12846 14474 17005 29377 1740 4929 8285 20994 32271 34522 12862 16827 22427 23369 27051 30378 4787 10372 10408 12091 20349 26162 6659 22752 24697 28261 28917 32536 6788 15367 21778 28916 30324 33927 7181 12373 21912 24703 28680 34045 2238 4945 14336 19270 29574 33459 10283 15311 17440 24599 24867 28293 324 5264 5375 6581 24348 30288 3112 7656 23825 21624 22318 22633 5284 19790 22758 2700 4039 12576 17028 17520 19579 11914 17834 33989 2199 5502 7184 22 20701 26497 5551 27014 32876 4019 26547 28521 7580 10016 33855 4328 11674 34018 8491 9956 10029 6167 11267 24914 5317 9049 29657 20717 28724 33012 16841 21647 31096 11931 16278 20287 9402 10557 11008 11826 15349 34420 14369 17031 20597 19164 27947 29775 15537 18796 33662 5404 21027 26757 6269 12671 24309 8601 29048 29262 10099 20323 21457 15952 17074 30434 7597 20987 33095 11298 24182 29217 12055 16250 16971 5350 9354 31390 8168 14168 18570 5448 13141 32381 3921 21113 28176 8756 19895 27917 9391 16617 25586 3357 18527 34238 2378 16840 28948 7470 27466 32928 8366 19376 30916 3116 7267 18016 15309 18445 21799 4731 23773 34546 260 4898 5180 8897 22266 29587 2539 23717 33142 19233 28750 29724 9937 15384 16599 10234 17089 26776 8869 9425 13658 6197 24086 31929 9237 20931 27785 10403 13822 16734 20038 21196 26868 13170 27813 28875 1110 20329 24508 11844 22662 28987 2891 2918 14512 15707 27399 34135 8687 20019 26178 6847 8903 16307 23737 23775 27776 17388 27970 31983 The present invention relates to a transmission method / apparatus.

[0015] A fourth receiving apparatus / method of the present technology includes a coding unit that performs LDPC coding based on a check matrix of an LDPC code having a code length N of 69120 bits and a coding rate r of 8 / 16, a group-wise interleaving unit that performs group-wise interleaving that interleaves the LDPC code in units of 360-bit bit groups, and a mapping unit that maps the LDPC code to one of 256 signal points of a 2D-Non-Uniform Constellation (NUC) of 256QAM in units of 8 bits, wherein in the group-wise interleaving, the (i+1)-th bit group from the beginning of the LDPC code is defined as bit group i, and a mapping unit that maps a sequence of bit groups 0 to 191 of the 69120-bit LDPC code to bit group i+1. 97, 121, 122, 73, 108, 167, 75, 156, 64, 49, 29, 18, 110, 171, 8, 27, 54, 41, 164, 15, 129, 157, 130, 111, 112, 120, 152, 12, 13, 101, 31, 69, 180, 143, 78, 125, 79, 172, 40, 116, 58, 71, 126, 55, 35, 191, 185, 159, 44, 86, 3, 80, 88, 145, 98, 144, 0, 62, 38, 150, 166, 114, 139, 60, 149, 10, 72, 155, 181, 26, 85, 128, 19, 25, 4, 170, 94, 175, 136, 117, 135, 102, 21, 89, 140, 138, 100, 33, 142, 74, 133, 56, 124, 17, 77, 65, 119, 59, 182, 105, 99, 158, 24, 96, 70, 83, 23, 81, 132, 7, 141, 61, 57, 82, 115, 162, 186, 103, 43, 148, 47, 176, 113, 151, 50, 184, 165, 109, 189, 90, 32, 20, 46, 127, 153, 161, 106, 11, 67, 36, 9, 28, 174, 160, 16, 93, 95, 6, 131, 66, 39, 14, 91, 163, 68, 48, 123, 137, 52, 5, 183, 76, 179, 22, 34, 147, 107, 168, 146, 42, 173, 53, 190, 104, 51, 118, 45, 30, 178, 134, 169, 37, 187, 177, 1, 2, 154, 87, 63, 92, 188, 84 The LDPC code includes information bits and parity bits, the check matrix includes an information matrix portion corresponding to the information bits and a parity matrix portion corresponding to the parity bits, the information matrix portion is represented by a check matrix initial value table, and the check matrix initial value table is a table that represents the position of an element of 1 in the information matrix portion for every 360 columns, 1850 4176 4190 7294 8168 8405 9258 9710 13440 16304 16600 18184 18834 19899 22513 25068 26659 27137 27232 29186 29667 30549 31428 33634 2477 2543 5094 8081 9573 10269 11276 11439 13016 13327 16717 18042 19362 19721 20089 20425 20503 21396 24677 24722 28703 32486 32759 33630 1930 2158 2315 2683 3818 4883 5252 5505 8760 9580 11867 13117 14566 15639 17273 18820 21069 24945 25667 26785 30678 31271 33003 33244 1279 1491 2038 2347 2432 4336 4905 6588 7507 7666 8775 9172 10405 12249 12270 12373 12936 13046 13364 15130 17597 22855 27548 32895 620 1897 3775 5552 6799 7621 10167 10172 10615 11367 12093 13241 15426 16623 19467 19792 22069 22370 24472 24594 25205 25954 27800 29422 582 1618 4673 5809 6318 6883 8051 12335 12409 13176 14078 15206 17580 18624 18876 19079 20786 21177 25894 26395 27377 27757 30167 31971 1157 2189 4160 4480 5055 8961 9171 9444 10533 11581 12904 14256 14620 15773 16232 17598 19756 21134 21443 22559 23258 25137 25555 28150 987 1258 1269 2394 4859 5642 5705 6093 6408 7734 8804 10657 11946 16132 20267 25402 26505 26548 27060 29767 29780 31915 31966 33590 1010 1363 1626 5283 6356 10961 12418 14332 14362 16288 16303 16592 17096 20115 20285 20478 21774 22165 22425 23198 25048 25596 31540 32841 895 2743 2912 4971 8803 11183 14500 14617 14638 16776 17901 18622 20244 20845 22214 25676 26161 26281 29978 30392 30922 31542 32038 32443 188 260 411 2823 5512 5645 10019 11856 12671 14273 14673 16091 16169 22333 22934 22945 23542 26503 27159 27279 28277 30114 31626 32722 357 516 3530 4317 8587 9491 10348 11330 13446 14533 15423 17003 17217 19127 20088 20750 21767 22386 24021 27749 29008 29376 30329 32940 2909 3036 4875 9967 10632 12069 12410 14004 14628 15605 15852 18231 18657 19705 20620 22241 29575 29656 31246 32190 32781 33489 33842 34492 4242 5461 5577 7662 11130 13663 17240 17773 18339 19400 22905 24219 25464 25890 26359 27121 27318 27840 30800 32587 32924 33427 33940 34058 421 2222 3457 5257 5600 10147 12754 17380 18854 20333 20345 20752 24578 25196 25638 25725 25822 27610 28006 28563 29632 29973 29991 34166 41 207 1043 4650 5387 6826 7261 8687 9092 10775 11446 12596 16613 19463 20923 24155 24927 25384 26064 27377 28094 32578 32639 34115 1050 5731 15820 16281 26130 29314 5980 6161 14479 22181 22537 32924 7828 9134 11297 17143 25449 29674 8299 10457 14486 21548 22510 32039 1527 7792 10424 19166 29302 29768 5823 13974 21254 21506 25658 29491 6285 9873 12846 14474 17005 29377 1740 4929 8285 20994 32271 34522 12862 16827 22427 23369 27051 30378 4787 10372 10408 12091 20349 26162 6659 22752 24697 28261 28917 32536 6788 15367 21778 28916 30324 33927 7181 12373 21912 24703 28680 34045 2238 4945 14336 19270 29574 33459 10283 15311 17440 24599 24867 28293 324 5264 5375 6581 24348 30288 3112 7656 23825 21624 22318 22633 5284 19790 22758 2700 4039 12576 17028 17520 19579 11914 17834 33989 2199 5502 7184 22 20701 26497 5551 27014 32876 4019 26547 28521 7580 10016 33855 4328 11674 34018 8491 9956 10029 6167 11267 24914 5317 9049 29657 20717 28724 33012 16841 21647 31096 11931 16278 20287 9402 10557 11008 11826 15349 34420 14369 17031 20597 19164 27947 29775 15537 18796 33662 5404 21027 26757 6269 12671 24309 8601 29048 29262 10099 20323 21457 15952 17074 30434 7597 20987 33095 11298 24182 29217 12055 16250 16971 5350 9354 31390 8168 14168 18570 5448 13141 32381 3921 21113 28176 8756 19895 27917 9391 16617 25586 3357 18527 34238 2378 16840 28948 7470 27466 32928 8366 19376 30916 3116 7267 18016 15309 18445 21799 4731 23773 34546 260 4898 5180 8897 22266 29587 2539 23717 33142 19233 28750 29724 9937 15384 16599 10234 17089 26776 8869 9425 13658 6197 24086 31929 9237 20931 27785 10403 13822 16734 20038 21196 26868 13170 27813 28875 1110 20329 24508 11844 22662 28987 2891 2918 14512 15707 27399 34135 8687 20019 26178 6847 8903 16307 23737 23775 27776 17388 27970 31983 The receiving device / method includes a group-wise deinterleaving unit / step for restoring the arrangement of the LDPC codes after group-wise interleaving, obtained from data transmitted from a transmitting device, to the original arrangement.

[0016] A fifth transmission method / apparatus of the present technology includes: a coding step / unit that performs LDPC coding based on a check matrix of an LDPC code having a code length N of 69120 bits and a coding rate r of 10 / 16; a group-wise interleaving step / unit that performs group-wise interleaving of the LDPC code in units of 360-bit bit groups; and a mapping step / unit that maps the LDPC code to one of 256 signal points of a 2D-NUC (Non-Uniform Constellation) of 256QAM in units of 8 bits, wherein in the group-wise interleaving, the (i+1)-th bit group from the beginning of the LDPC code is defined as bit group i, and a sequence of bit groups 0 to 191 of the 69120-bit LDPC code is mapped to bit group i. 47, 85, 118, 136, 166, 98, 72, 163, 63, 116, 162, 169, 114, 124, 144, 110, 46, 152, 104, 88, 99, 106, 181, 109, 3, 10, 172, 107, 33, 100, 191, 75, 157, 79, 52, 128, 6, 12, 139, 30, 68, 111, 83, 5, 119, 1, 97, 56, 38, 117, 78, 80, 155, 141, 185, 20, 161, 123, 28, 180, 77, 50, 29, 64, 41, 121, 53, 36, 48, 127, 44, 22, 35, 165, 59, 147, 187, 153, 89, 154, 18, 55, 90, 69, 19, 148, 129, 188, 24, 8, 102, 151, 11, 74, 105, 81, 92, 70, 101, 7, 132, 120, 112, 145, 57, 96, 42, 45, 91, 71, 149, 164, 51, 130, 95, 140, 178, 9, 135, 34, 175, 21, 32, 25, 67, 17, 61, 58, 134, 43, 122, 2, 16, 183, 54, 86, 4, 39, 60, 184, 171, 94, 179, 13, 115, 49, 143, 158, 168, 159, 87, 73, 156, 15, 93, 125, 126, 131, 40, 66, 138, 76, 173, 65, 27, 170, 186, 182, 103, 108, 82, 37, 174, 167, 142, 26, 160, 84, 62, 190, 176, 31, 150, 189, 113, 137, 14, 23, 0, 146, 177, 133 The LDPC code includes information bits and parity bits, the check matrix includes an information matrix portion corresponding to the information bits and a parity matrix portion corresponding to the parity bits, the information matrix portion is represented by a check matrix initial value table, and the check matrix initial value table is a table that represents the position of an element of 1 in the information matrix portion for every 360 columns, 200 588 3305 4771 6288 8400 11092 11126 14245 14255 17022 17190 19241 20350 20451 21069 25243 80 2914 4126 5426 6129 7790 9546 12909 14660 17357 18278 19612 21168 22367 23314 24801 24907 1216 2713 4897 6540 7016 7787 8321 9717 9934 12295 18749 20344 21386 21682 21735 24205 24825 6784 8163 8691 8743 10045 10319 10767 11141 11756 12004 12463 13407 14682 15458 20771 21060 22914 463 1260 1897 2128 2908 5157 7851 14177 16187 17463 18212 18221 19212 21864 24198 25318 25450 794 835 1163 4551 4597 5792 6092 7809 8576 8862 10986 12164 13053 14459 15978 23829 25072 144 4258 4342 7326 8165 9627 11432 12552 17582 17621 18145 19201 19372 19718 21036 25147 25774 617 2639 2749 2898 3414 4305 4802 6183 8551 9850 13679 20759 22501 24244 24331 24631 25587 1622 2258 4257 6069 10343 10642 11003 12520 13993 17086 18236 18522 24679 25361 25371 25595 1826 3926 5021 5905 6192 6839 7678 9136 9188 9716 10986 11191 12551 14648 16169 16234 2175 2396 2473 8548 9753 12115 12208 13469 15438 16985 19350 20424 21357 22819 22830 25671 265 397 6675 7152 8074 13030 13161 13336 15843 16917 17930 18014 18660 19218 22236 24940 5744 6883 7780 7839 8485 10016 10548 12131 12158 16211 16793 18749 20570 21757 22255 24489 2082 4768 7025 8803 10237 10932 13885 14266 14370 14982 16411 18443 18773 19570 21420 23311 1040 1376 2823 2998 3789 6636 7755 9819 13705 13868 14176 16202 16247 24943 25196 25489 223 1967 3289 4541 7420 9881 11086 12868 13550 14760 15434 18287 19098 20909 22905 25887 1906 2049 2147 2756 2845 4773 8337 8832 9363 12375 13651 16366 17546 20486 21624 22664 1619 1955 2393 3078 3208 3593 5246 8565 10956 11335 11865 14837 15006 15544 18820 22687 2086 3409 3586 4269 6587 8650 10165 11241 15624 16728 17814 18392 18667 19859 21132 25339 382 1160 1912 3700 3783 12069 14672 16842 18053 19626 20724 21244 21792 22679 23873 24517 1217 1486 5139 6774 7413 10622 11571 11697 13406 13487 20713 22436 22610 22806 23522 23632 1225 2927 6221 6247 8197 9322 11826 11948 12230 13899 15820 16791 17444 23155 24543 24650 1056 2975 6018 7698 7736 7940 11870 12964 17498 17577 19541 20124 20705 22693 23151 25627 658 790 1559 3683 6060 9059 12347 12990 13095 16317 17801 18816 20050 20979 23584 25472 1133 3343 6895 7146 7261 8340 9115 11248 14543 16030 16291 17972 22369 22479 24388 25280 1907 4021 8277 17631 7807 8063 10076 24958 5455 8638 13801 18832 15525 24030 24978 7854 21083 21197 8416 15614 24639 9382 13998 24091 1244 19468 24804 5100 14187 21263 12267 18441 22757 185 23294 23412 5136 24218 25509 6159 12323 19472 7490 9770 19813 1457 2204 4186 14200 15609 18700 4544 6337 17759 3697 13810 14537 10853 16611 23001 504 12709 23116 1338 21523 22880 1098 8530 23846 13699 19776 25783 3299 3629 16222 1821 2402 12416 11177 20793 24292 21580 24038 24094 11769 13819 13950 5388 9428 13527 20320 23996 24752 2923 14906 18768 911 10059 17607 1535 3090 22968 3398 8243 12265 9801 10001 20184 11839 15703 16757 1834 13797 14101 4469 11503 14694 4047 8684 23737 15682 21342 21898 7345 8077 22245 4108 20676 24406 8787 19625 22194 8536 15518 20879 3339 15738 19592 2916 13483 23680 3853 12107 18338 16962 21265 25429 10181 18667 25563 2867 21873 23535 8601 19728 23807 4484 17647 22060 6457 17641 23777 17432 18680 20224 3046 14453 19429 807 2064 12639 17630 20286 21847 13703 13720 24044 8382 9588 10339 18818 23311 24714 5397 13213 24988 4077 9348 21707 10628 15352 21292 1075 7625 18287 5771 20506 20926 13545 18180 21566 12022 19203 25134 86 12306 20066 7797 10752 15305 2986 4186 9128 9099 17285 24986 3530 17904 21836 2283 20216 25272 22562 24667 25143 1673 3837 5198 4188 13181 22061 17800 20341 22591 3466 4433 24958 145 7746 23940 4718 15618 19372 2735 11877 13719 3560 6483 10536 4167 7567 8558 4511 5862 16331 3268 6965 25578 5552 20627 24489 1425 2331 4414 3352 12606 19595 4653 8383 20029 9163 22097 24174 7324 16151 20228 280 4353 25404 5173 7657 25604 6910 13531 22225 18274 19994 21778 The present invention relates to a transmission method / apparatus.

[0017] A fifth receiving apparatus / method of the present technology includes a coding unit that performs LDPC coding based on a check matrix of an LDPC code having a code length N of 69120 bits and a coding rate r of 10 / 16, a group-wise interleaving unit that performs group-wise interleaving of the LDPC code in units of 360-bit bit groups, and a mapping unit that maps the LDPC code to one of 256 signal points of a 2D-Non-Uniform Constellation (NUC) of 256QAM in units of 8 bits, wherein the group-wise interleaving defines an (i+1)-th bit group from the beginning of the LDPC code as bit group i, and maps a sequence of bit groups 0 to 191 of the 69120-bit LDPC code to bit group i. 47, 85, 118, 136, 166, 98, 72, 163, 63, 116, 162, 169, 114, 124, 144, 110, 46, 152, 104, 88, 99, 106, 181, 109, 3, 10, 172, 107, 33, 100, 191, 75, 157, 79, 52, 128, 6, 12, 139, 30, 68, 111, 83, 5, 119, 1, 97, 56, 38, 117, 78, 80, 155, 141, 185, 20, 161, 123, 28, 180, 77, 50, 29, 64, 41, 121, 53, 36, 48, 127, 44, 22, 35, 165, 59, 147, 187, 153, 89, 154, 18, 55, 90, 69, 19, 148, 129, 188, 24, 8, 102, 151, 11, 74, 105, 81, 92, 70, 101, 7, 132, 120, 112, 145, 57, 96, 42, 45, 91, 71, 149, 164, 51, 130, 95, 140, 178, 9, 135, 34, 175, 21, 32, 25, 67, 17, 61, 58, 134, 43, 122, 2, 16, 183, 54, 86, 4, 39, 60, 184, 171, 94, 179, 13, 115, 49, 143, 158, 168, 159, 87, 73, 156, 15, 93, 125, 126, 131, 40, 66, 138, 76, 173, 65, 27, 170, 186, 182, 103, 108, 82, 37, 174, 167, 142, 26, 160, 84, 62, 190, 176, 31, 150, 189, 113, 137, 14, 23, 0, 146, 177, 133 The LDPC code includes information bits and parity bits, the check matrix includes an information matrix portion corresponding to the information bits and a parity matrix portion corresponding to the parity bits, the information matrix portion is represented by a check matrix initial value table, and the check matrix initial value table is a table that represents the position of an element of 1 in the information matrix portion for every 360 columns, 200 588 3305 4771 6288 8400 11092 11126 14245 14255 17022 17190 19241 20350 20451 21069 25243 80 2914 4126 5426 6129 7790 9546 12909 14660 17357 18278 19612 21168 22367 23314 24801 24907 1216 2713 4897 6540 7016 7787 8321 9717 9934 12295 18749 20344 21386 21682 21735 24205 24825 6784 8163 8691 8743 10045 10319 10767 11141 11756 12004 12463 13407 14682 15458 20771 21060 22914 463 1260 1897 2128 2908 5157 7851 14177 16187 17463 18212 18221 19212 21864 24198 25318 25450 794 835 1163 4551 4597 5792 6092 7809 8576 8862 10986 12164 13053 14459 15978 23829 25072 144 4258 4342 7326 8165 9627 11432 12552 17582 17621 18145 19201 19372 19718 21036 25147 25774 617 2639 2749 2898 3414 4305 4802 6183 8551 9850 13679 20759 22501 24244 24331 24631 25587 1622 2258 4257 6069 10343 10642 11003 12520 13993 17086 18236 18522 24679 25361 25371 25595 1826 3926 5021 5905 6192 6839 7678 9136 9188 9716 10986 11191 12551 14648 16169 16234 2175 2396 2473 8548 9753 12115 12208 13469 15438 16985 19350 20424 21357 22819 22830 25671 265 397 6675 7152 8074 13030 13161 13336 15843 16917 17930 18014 18660 19218 22236 24940 5744 6883 7780 7839 8485 10016 10548 12131 12158 16211 16793 18749 20570 21757 22255 24489 2082 4768 7025 8803 10237 10932 13885 14266 14370 14982 16411 18443 18773 19570 21420 23311 1040 1376 2823 2998 3789 6636 7755 9819 13705 13868 14176 16202 16247 24943 25196 25489 223 1967 3289 4541 7420 9881 11086 12868 13550 14760 15434 18287 19098 20909 22905 25887 1906 2049 2147 2756 2845 4773 8337 8832 9363 12375 13651 16366 17546 20486 21624 22664 1619 1955 2393 3078 3208 3593 5246 8565 10956 11335 11865 14837 15006 15544 18820 22687 2086 3409 3586 4269 6587 8650 10165 11241 15624 16728 17814 18392 18667 19859 21132 25339 382 1160 1912 3700 3783 12069 14672 16842 18053 19626 20724 21244 21792 22679 23873 24517 1217 1486 5139 6774 7413 10622 11571 11697 13406 13487 20713 22436 22610 22806 23522 23632 1225 2927 6221 6247 8197 9322 11826 11948 12230 13899 15820 16791 17444 23155 24543 24650 1056 2975 6018 7698 7736 7940 11870 12964 17498 17577 19541 20124 20705 22693 23151 25627 658 790 1559 3683 6060 9059 12347 12990 13095 16317 17801 18816 20050 20979 23584 25472 1133 3343 6895 7146 7261 8340 9115 11248 14543 16030 16291 17972 22369 22479 24388 25280 1907 4021 8277 17631 7807 8063 10076 24958 5455 8638 13801 18832 15525 24030 24978 7854 21083 21197 8416 15614 24639 9382 13998 24091 1244 19468 24804 5100 14187 21263 12267 18441 22757 185 23294 23412 5136 24218 25509 6159 12323 19472 7490 9770 19813 1457 2204 4186 14200 15609 18700 4544 6337 17759 3697 13810 14537 10853 16611 23001 504 12709 23116 1338 21523 22880 1098 8530 23846 13699 19776 25783 3299 3629 16222 1821 2402 12416 11177 20793 24292 21580 24038 24094 11769 13819 13950 5388 9428 13527 20320 23996 24752 2923 14906 18768 911 10059 17607 1535 3090 22968 3398 8243 12265 9801 10001 20184 11839 15703 16757 1834 13797 14101 4469 11503 14694 4047 8684 23737 15682 21342 21898 7345 8077 22245 4108 20676 24406 8787 19625 22194 8536 15518 20879 3339 15738 19592 2916 13483 23680 3853 12107 18338 16962 21265 25429 10181 18667 25563 2867 21873 23535 8601 19728 23807 4484 17647 22060 6457 17641 23777 17432 18680 20224 3046 14453 19429 807 2064 12639 17630 20286 21847 13703 13720 24044 8382 9588 10339 18818 23311 24714 5397 13213 24988 4077 9348 21707 10628 15352 21292 1075 7625 18287 5771 20506 20926 13545 18180 21566 12022 19203 25134 86 12306 20066 7797 10752 15305 2986 4186 9128 9099 17285 24986 3530 17904 21836 2283 20216 25272 22562 24667 25143 1673 3837 5198 4188 13181 22061 17800 20341 22591 3466 4433 24958 145 7746 23940 4718 15618 19372 2735 11877 13719 3560 6483 10536 4167 7567 8558 4511 5862 16331 3268 6965 25578 5552 20627 24489 1425 2331 4414 3352 12606 19595 4653 8383 20029 9163 22097 24174 7324 16151 20228 280 4353 25404 5173 7657 25604 6910 13531 22225 18274 19994 21778 The receiving device / method includes a group-wise deinterleaving unit / step for restoring the arrangement of the LDPC codes after group-wise interleaving, obtained from data transmitted from a transmitting device, to the original arrangement.

[0018] A sixth transmission method / apparatus of the present technology includes: a coding step / unit that performs LDPC coding based on a check matrix of an LDPC code having a code length N of 69120 bits and a coding rate r of 12 / 16; a group-wise interleaving step / unit that performs group-wise interleaving of the LDPC code in units of 360-bit bit groups; and a mapping step / unit that maps the LDPC code to one of 256 signal points of a 2D-NUC (Non-Uniform Constellation) of 256QAM in units of 8 bits, wherein in the group-wise interleaving, the (i+1)-th bit group from the beginning of the LDPC code is defined as bit group i, and a sequence of bit groups 0 to 191 of the 69120-bit LDPC code is mapped to bit group i. 97, 39, 99, 33, 10, 6, 189, 179, 130, 172, 76, 185, 131, 40, 176, 159, 8, 17, 167, 116, 16, 160, 5, 174, 27, 115, 43, 41, 136, 175, 153, 144, 106, 29, 105, 84, 67, 35, 152, 191, 72, 56, 83, 168, 12, 184, 65, 146, 104, 80, 98, 79, 51, 26, 64, 137, 181, 165, 52, 129, 186, 48, 128, 154, 58, 141, 77, 187, 94, 109, 81, 119, 82, 38, 18, 188, 143, 170, 147, 2, 162, 95, 21, 11, 74, 151, 19, 59, 1, 138, 145, 7, 177, 30, 42, 44, 28, 20, 91, 14, 4, 70, 110, 31, 37, 61, 55, 85, 15, 183, 171, 96, 103, 101, 112, 161, 54, 178, 78, 87, 126, 57, 180, 88, 92, 113, 73, 90, 117, 93, 89, 122, 62, 25, 158, 148, 118, 45, 123, 60, 107, 173, 114, 166, 120, 13, 23, 139, 86, 135, 164, 47, 124, 149, 150, 46, 157, 100, 142, 0, 71, 50, 49, 36, 9, 127, 156, 75, 34, 163, 125, 190, 182, 155, 66, 69, 140, 32, 169, 132, 53, 68, 102, 63, 133, 111, 22, 134, 108, 3, 24, 121 The LDPC code includes information bits and parity bits, the check matrix includes an information matrix portion corresponding to the information bits and a parity matrix portion corresponding to the parity bits, the information matrix portion is represented by a check matrix initial value table, and the check matrix initial value table is a table that represents the position of an element of 1 in the information matrix portion for every 360 columns, 1507 1536 2244 4721 6374 7839 11001 12684 13196 13602 14245 14383 14398 16182 17248 623 696 1186 1370 4409 5237 5911 8278 9539 12139 12810 13422 15525 16232 16252 530 1953 3745 5512 6676 9069 9433 10683 11530 12263 12519 14931 15326 15581 16208 273 685 3132 5872 6388 7149 7316 7367 9041 11102 11211 12059 15189 15973 16435 814 1297 1896 6018 7801 8810 9701 9992 10314 13618 13771 14934 15198 16340 16742 58 803 2553 3967 6032 8374 9168 10047 10073 10909 12701 12748 13543 14111 17043 1082 1577 2108 2344 5035 5051 10038 10356 12156 12308 13815 15453 15830 16305 17234 1882 3731 5182 5554 6330 6605 7126 10195 10508 12151 12191 12241 12288 13755 16472 85 604 1278 3768 4831 6820 9471 10773 10873 12785 12973 13623 14562 14697 16811 928 1864 6027 7023 7644 8279 8580 9221 9417 9883 12032 12483 12734 14335 15842 2104 2752 4530 4820 5662 9197 9464 9972 10057 11079 12408 13005 13684 15507 16295 82 752 3374 4026 7265 8112 12236 12434 12460 13110 13495 15110 15299 15359 17221 1137 1411 1546 1614 1835 6053 6151 8618 9059 14057 14941 15670 16321 16965 447 1960 2369 2861 3047 3508 4077 4358 4370 5806 12517 13658 14371 14749 420 981 1657 2313 3353 4699 5094 5184 10076 10530 11521 13040 15960 16853 3572 3851 3870 5218 6400 6780 9167 9603 10328 10543 12892 13722 16910 16929 203 2588 4522 4692 5399 6840 7417 8896 9045 9188 10390 12507 12615 16386 543 1262 2536 4358 7658 7714 9392 11079 12283 12694 14734 16195 16317 16751 905 1059 3393 4347 4554 4758 5568 8652 9991 10717 10975 11146 12824 16373 1229 2308 4876 5329 5424 5906 6227 6667 7141 7697 12055 12969 13582 16638 697 1864 2560 4190 5097 5288 6565 9150 9282 9519 10727 12492 13292 16924 363 3152 3715 3722 4582 5050 8399 9413 9851 10305 12116 13471 15318 16018 338 2342 2404 4733 6189 6792 7251 7921 8509 8579 8729 11921 12900 15546 1630 1867 2018 3038 3202 6364 7648 8692 9496 9705 10433 13508 14583 16341 1041 2754 3015 3427 3512 4351 5174 6539 8100 8639 9912 11911 12666 14187 1134 1619 4758 5545 6842 7045 8421 10373 10390 12672 13484 15178 16697 16727 589 652 1174 2157 3951 4733 5278 5859 7619 9488 11665 12335 15516 16024 1457 1832 2525 3690 5093 6000 6276 7974 8652 9759 10434 15025 15267 16448 932 3328 3349 3511 4776 6266 6711 7761 8674 9748 11167 12134 12942 14354 1939 1979 3141 4238 6715 7148 7673 12025 12455 14829 14989 15081 16491 17242 1363 2451 1953 10230 6218 7655 9302 15856 10461 10503 9005 16075 878 14223 15181 3535 5327 14405 8116 8396 9828 2864 6306 14832 24 11009 16377 7064 11014 16139 4318 8353 14997 583 5626 10217 11196 13669 16585 6123 7518 9304 2258 8250 12082 7564 14195 15236 10104 10233 13778 2044 7801 11705 10906 11443 13227 1592 7853 14796 3054 8887 13077 6486 7003 9238 424 9055 13390 618 4077 11120 11159 13405 16070 2927 8689 17210 723 5842 12062 4817 9269 10820 208 6947 12903 2987 10116 11520 3522 6321 15637 148 3087 12764 262 1613 14121 7236 10798 11759 3193 4958 11292 7537 12439 15202 8000 9580 17269 9665 9691 15654 5946 14246 16040 4283 8145 10944 1082 1829 11267 1272 6119 13182 20 11943 14128 4591 8403 16530 2212 13724 13933 2079 10365 14633 1269 11307 16370 2467 4744 10714 6256 7915 9724 8799 11433 16880 459 6799 10102 3795 6930 13350 1295 13018 14967 3542 7310 10974 6905 15080 16105 2673 3143 12349 4698 4801 14770 7512 15844 15965 3276 4069 10099 1893 4676 6679 1985 7244 10163 6333 12760 12912 852 5954 11771 6958 9242 10613 5651 10089 12309 4124 7455 13224 503 6787 10720 10594 12717 14007 4501 5311 8067 4507 5620 13932 9133 11025 13866 5021 16201 16217 6166 7438 17185 1324 5671 11586 2266 6335 7716 512 9515 11595 869 6096 13886 10049 12536 14474 470 8286 8306 1268 5478 6424 8178 8817 14506 11460 15128 16761 6364 10121 16806 9347 15211 16915 1587 3591 15546 17 4132 17071 1677 8810 15764 3862 7633 13685 3855 11931 12792 2652 13909 17080 5581 13919 16126 7129 8976 11152 6662 7845 13424 9751 9965 13847 3662 9308 9534 4283 7474 7682 2418 8774 13433 508 3864 6859 12098 13920 15326 1129 3271 16892 5072 8819 10323 4749 4984 6390 212 13603 14893 4966 8895 9320 1012 3677 5711 6654 9969 15178 4596 5147 5905 1541 4149 15594 8005 8604 15147 2519 10882 11961 190 8417 13600 3543 4639 14618 The present invention relates to a transmission method / apparatus.

[0019] A sixth receiving apparatus / method of the present technology includes a coding unit that performs LDPC coding based on a check matrix of an LDPC code having a code length N of 69120 bits and a coding rate r of 12 / 16, a group-wise interleaving unit that performs group-wise interleaving that interleaves the LDPC code in units of 360-bit bit groups, and a mapping unit that maps the LDPC code to one of 256 signal points of a 2D-Non-Uniform Constellation (NUC) of 256QAM in units of 8 bits, wherein the group-wise interleaving defines an (i+1)-th bit group from the beginning of the LDPC code as bit group i, and maps a sequence of bit groups 0 to 191 of the 69120-bit LDPC code to bit group i. 97, 39, 99, 33, 10, 6, 189, 179, 130, 172, 76, 185, 131, 40, 176, 159, 8, 17, 167, 116, 16, 160, 5, 174, 27, 115, 43, 41, 136, 175, 153, 144, 106, 29, 105, 84, 67, 35, 152, 191, 72, 56, 83, 168, 12, 184, 65, 146, 104, 80, 98, 79, 51, 26, 64, 137, 181, 165, 52, 129, 186, 48, 128, 154, 58, 141, 77, 187, 94, 109, 81, 119, 82, 38, 18, 188, 143, 170, 147, 2, 162, 95, 21, 11, 74, 151, 19, 59, 1, 138, 145, 7, 177, 30, 42, 44, 28, 20, 91, 14, 4, 70, 110, 31, 37, 61, 55, 85, 15, 183, 171, 96, 103, 101, 112, 161, 54, 178, 78, 87, 126, 57, 180, 88, 92, 113, 73, 90, 117, 93, 89, 122, 62, 25, 158, 148, 118, 45, 123, 60, 107, 173, 114, 166, 120, 13, 23, 139, 86, 135, 164, 47, 124, 149, 150, 46, 157, 100, 142, 0, 71, 50, 49, 36, 9, 127, 156, 75, 34, 163, 125, 190, 182, 155, 66, 69, 140, 32, 169, 132, 53, 68, 102, 63, 133, 111, 22, 134, 108, 3, 24, 121 The LDPC code includes information bits and parity bits, the check matrix includes an information matrix portion corresponding to the information bits and a parity matrix portion corresponding to the parity bits, the information matrix portion is represented by a check matrix initial value table, and the check matrix initial value table is a table that represents the position of an element of 1 in the information matrix portion for every 360 columns, 1507 1536 2244 4721 6374 7839 11001 12684 13196 13602 14245 14383 14398 16182 17248 623 696 1186 1370 4409 5237 5911 8278 9539 12139 12810 13422 15525 16232 16252 530 1953 3745 5512 6676 9069 9433 10683 11530 12263 12519 14931 15326 15581 16208 273 685 3132 5872 6388 7149 7316 7367 9041 11102 11211 12059 15189 15973 16435 814 1297 1896 6018 7801 8810 9701 9992 10314 13618 13771 14934 15198 16340 16742 58 803 2553 3967 6032 8374 9168 10047 10073 10909 12701 12748 13543 14111 17043 1082 1577 2108 2344 5035 5051 10038 10356 12156 12308 13815 15453 15830 16305 17234 1882 3731 5182 5554 6330 6605 7126 10195 10508 12151 12191 12241 12288 13755 16472 85 604 1278 3768 4831 6820 9471 10773 10873 12785 12973 13623 14562 14697 16811 928 1864 6027 7023 7644 8279 8580 9221 9417 9883 12032 12483 12734 14335 15842 2104 2752 4530 4820 5662 9197 9464 9972 10057 11079 12408 13005 13684 15507 16295 82 752 3374 4026 7265 8112 12236 12434 12460 13110 13495 15110 15299 15359 17221 1137 1411 1546 1614 1835 6053 6151 8618 9059 14057 14941 15670 16321 16965 447 1960 2369 2861 3047 3508 4077 4358 4370 5806 12517 13658 14371 14749 420 981 1657 2313 3353 4699 5094 5184 10076 10530 11521 13040 15960 16853 3572 3851 3870 5218 6400 6780 9167 9603 10328 10543 12892 13722 16910 16929 203 2588 4522 4692 5399 6840 7417 8896 9045 9188 10390 12507 12615 16386 543 1262 2536 4358 7658 7714 9392 11079 12283 12694 14734 16195 16317 16751 905 1059 3393 4347 4554 4758 5568 8652 9991 10717 10975 11146 12824 16373 1229 2308 4876 5329 5424 5906 6227 6667 7141 7697 12055 12969 13582 16638 697 1864 2560 4190 5097 5288 6565 9150 9282 9519 10727 12492 13292 16924 363 3152 3715 3722 4582 5050 8399 9413 9851 10305 12116 13471 15318 16018 338 2342 2404 4733 6189 6792 7251 7921 8509 8579 8729 11921 12900 15546 1630 1867 2018 3038 3202 6364 7648 8692 9496 9705 10433 13508 14583 16341 1041 2754 3015 3427 3512 4351 5174 6539 8100 8639 9912 11911 12666 14187 1134 1619 4758 5545 6842 7045 8421 10373 10390 12672 13484 15178 16697 16727 589 652 1174 2157 3951 4733 5278 5859 7619 9488 11665 12335 15516 16024 1457 1832 2525 3690 5093 6000 6276 7974 8652 9759 10434 15025 15267 16448 932 3328 3349 3511 4776 6266 6711 7761 8674 9748 11167 12134 12942 14354 1939 1979 3141 4238 6715 7148 7673 12025 12455 14829 14989 15081 16491 17242 1363 2451 1953 10230 6218 7655 9302 15856 10461 10503 9005 16075 878 14223 15181 3535 5327 14405 8116 8396 9828 2864 6306 14832 24 11009 16377 7064 11014 16139 4318 8353 14997 583 5626 10217 11196 13669 16585 6123 7518 9304 2258 8250 12082 7564 14195 15236 10104 10233 13778 2044 7801 11705 10906 11443 13227 1592 7853 14796 3054 8887 13077 6486 7003 9238 424 9055 13390 618 4077 11120 11159 13405 16070 2927 8689 17210 723 5842 12062 4817 9269 10820 208 6947 12903 2987 10116 11520 3522 6321 15637 148 3087 12764 262 1613 14121 7236 10798 11759 3193 4958 11292 7537 12439 15202 8000 9580 17269 9665 9691 15654 5946 14246 16040 4283 8145 10944 1082 1829 11267 1272 6119 13182 20 11943 14128 4591 8403 16530 2212 13724 13933 2079 10365 14633 1269 11307 16370 2467 4744 10714 6256 7915 9724 8799 11433 16880 459 6799 10102 3795 6930 13350 1295 13018 14967 3542 7310 10974 6905 15080 16105 2673 3143 12349 4698 4801 14770 7512 15844 15965 3276 4069 10099 1893 4676 6679 1985 7244 10163 6333 12760 12912 852 5954 11771 6958 9242 10613 5651 10089 12309 4124 7455 13224 503 6787 10720 10594 12717 14007 4501 5311 8067 4507 5620 13932 9133 11025 13866 5021 16201 16217 6166 7438 17185 1324 5671 11586 2266 6335 7716 512 9515 11595 869 6096 13886 10049 12536 14474 470 8286 8306 1268 5478 6424 8178 8817 14506 11460 15128 16761 6364 10121 16806 9347 15211 16915 1587 3591 15546 17 4132 17071 1677 8810 15764 3862 7633 13685 3855 11931 12792 2652 13909 17080 5581 13919 16126 7129 8976 11152 6662 7845 13424 9751 9965 13847 3662 9308 9534 4283 7474 7682 2418 8774 13433 508 3864 6859 12098 13920 15326 1129 3271 16892 5072 8819 10323 4749 4984 6390 212 13603 14893 4966 8895 9320 1012 3677 5711 6654 9969 15178 4596 5147 5905 1541 4149 15594 8005 8604 15147 2519 10882 11961 190 8417 13600 3543 4639 14618 The receiving device / method includes a group-wise deinterleaving unit / step for restoring the arrangement of the LDPC codes after group-wise interleaving, obtained from data transmitted from a transmitting device, to the original arrangement.

[0020] A seventh transmission method / apparatus of the present technology includes: a coding step / unit that performs LDPC coding based on a check matrix of an LDPC code having a code length N of 69120 bits and a coding rate r of 14 / 16; a group-wise interleaving step / unit that performs group-wise interleaving of the LDPC code in units of 360-bit bit groups; and a mapping step / unit that maps the LDPC code to one of 256 signal points of a 2D-NUC (Non-Uniform Constellation) of 256QAM in units of 8 bits, wherein in the group-wise interleaving, the (i+1)-th bit group from the beginning of the LDPC code is defined as bit group i, and a sequence of bit groups 0 to 191 of the 69120-bit LDPC code is mapped to bit group i. 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 The LDPC code includes information bits and parity bits, the check matrix includes an information matrix portion corresponding to the information bits and a parity matrix portion corresponding to the parity bits, the information matrix portion is represented by a check matrix initial value table, and the check matrix initial value table is a table that represents the position of an element of 1 in the information matrix portion for every 360 columns, 387 648 945 3023 3889 4856 5002 5167 6868 7477 7590 8165 8354 42 406 1279 1968 3016 4196 4599 4996 5019 6350 6785 7051 8529 534 784 1034 1160 2530 5033 5171 5469 6167 6372 6913 7718 8621 944 2506 2806 3149 3559 5101 6076 6083 6092 6147 6866 7908 8155 308 1869 1888 2569 3297 4742 5232 5442 6135 6814 7284 8238 8405 34 464 667 899 2421 3425 5382 6258 6373 6399 6489 7367 7922 2276 3014 3525 3829 4135 4276 4611 4733 4738 4956 6025 7152 8155 1047 1370 2406 2819 4600 4991 5017 5590 6199 6483 6556 6834 7760 66 380 2033 3698 4068 6096 6223 6238 6757 7541 7641 7677 8595 562 697 782 808 921 1703 3032 4300 7027 7481 7839 8160 8526 236 962 1557 2023 2135 2190 2892 3072 4523 6254 6838 7209 7381 196 1167 1179 1426 1675 1763 2345 2560 2613 5024 5761 6522 7973 512 822 1778 1924 2610 3445 4570 4805 5263 5299 8439 8448 8464 1923 2270 3204 3698 4456 4522 4601 5161 5207 6260 6310 6441 6851 104 281 622 1276 2172 2334 2731 3417 3854 4698 8095 8195 8333 451 528 1269 2169 2274 2393 3853 5002 5543 6121 6351 7364 8139 1685 2675 2790 2953 3103 3560 4336 5372 5495 5568 6429 6492 8206 604 1190 1279 2427 2714 3283 3312 3855 4566 6045 6664 6788 8317 338 917 1873 2102 2561 2655 4635 4765 5370 6249 6724 7668 8456 184 1166 1583 1859 2376 2521 3093 4181 4713 4926 5146 6070 8004 175 1227 2367 3402 3628 3982 4265 4282 4355 5972 6434 7280 7765 801 922 1029 1531 1606 3170 3824 4358 4732 4849 5225 6759 8183 509 1507 1704 1765 2183 2574 3271 4050 4299 4964 5968 6324 7091 567 795 1376 2390 2767 3424 5195 6355 6726 7607 8346 8352 308 1060 1973 2364 2937 3526 4221 4745 5185 5845 6146 7762 323 590 732 917 2636 3008 3792 3990 4322 4893 5211 8014 471 1249 1674 1841 2567 3124 3130 4885 5575 7521 7648 8227 1582 1669 1772 2386 3340 3387 3881 4322 6018 6055 6488 7177 976 1003 2127 3575 3816 6225 7404 7499 7542 8237 8421 8630 675 961 1957 3825 3858 4646 5248 5801 5940 6533 7040 8037 79 639 1363 1436 1763 2570 3874 4876 6870 6886 7104 8399 20 297 1330 2264 3287 3534 4441 4746 6569 6971 6976 8179 482 1125 1589 2892 3759 3871 4635 6038 6214 6796 6816 7621 1127 3336 3867 3929 4269 4794 5054 5842 6471 6547 7039 8560 217 1521 1983 8283 3731 4402 208 6703 242 4988 4170 5038 4108 8035 3301 8543 3168 8249 5028 5838 3470 8597 2901 5264 2505 4505 934 5117 1712 5819 3165 7273 3274 6115 4576 6330 7327 5380 6732 8439 2474 3723 7782 384 2783 5846 1453 4436 6625 3220 4261 4835 163 3117 7554 502 2119 4059 2200 4263 4930 2378 6294 7713 743 5501 6809 1364 6062 7808 4680 6468 7895 3469 3602 7304 1609 5386 5647 267 2921 3206 2565 3020 6269 1651 5224 5718 1128 5058 8579 286 3396 7660 1497 5171 6519 1894 6349 7924 1306 7744 8083 3096 3438 3836 2556 7409 8570 3273 4245 7935 1633 2023 3125 584 4914 6062 2015 2915 3435 1457 6366 6461 23 3576 8132 5322 6300 6520 5715 7113 7822 2044 5053 6607 63 5432 7850 5353 6355 8637 346 590 2648 4780 5997 6991 2556 2583 6537 661 2497 8350 7610 8307 8441 671 860 5986 1133 3158 5891 4360 5802 6547 4782 5688 6955 447 5030 6268 1501 5163 7232 1133 2743 3214 959 4100 7554 5712 7643 8385 1442 3180 8008 697 3078 8421 137 922 5123 597 2879 6340 824 2071 7882 1827 4411 5941 3846 5970 6398 1561 1580 7668 4335 6936 8042 4504 5309 6737 1846 3273 3333 272 4885 6718 1835 4761 6931 2141 3760 5129 3975 5012 6504 1258 2822 6030 242 4947 7668 559 6100 8425 1655 1962 4401 2369 2476 2765 114 156 3195 1651 4154 4448 4669 6064 7317 4988 5567 6697 2963 5578 5679 2064 2286 7790 289 4639 7582 1258 4312 5340 2428 4219 7268 1752 2321 6806 118 7302 8603 4170 4280 4445 2207 5067 7257 2 55 7413 1141 4791 7149 3407 5649 8075 2773 3198 3720 6970 7222 8633 2498 4764 5281 1048 2093 5031 2500 2851 8396 1694 3795 6666 2565 3343 4688 4228 4374 5947 2267 6745 7172 175 2662 3926 90 1517 6056 4069 5439 7648 1679 3394 4707 2136 4553 8265 482 2100 2302 3306 3729 8063 5263 7710 8240 1001 1335 4500 576 6736 7250 181 3601 3755 5899 7515 7714 1181 5332 7197 542 1150 1196 1386 2156 5873 656 3019 3213 263 1117 5957 4495 5904 6462 2547 2786 4215 4954 5848 6225 940 4478 7633 2124 3347 7069 The present invention relates to a transmission method / apparatus.

[0021] A seventh receiving apparatus / method of the present technology includes a coding unit that performs LDPC coding based on a check matrix of an LDPC code having a code length N of 69120 bits and a coding rate r of 14 / 16, a group-wise interleaving unit that performs group-wise interleaving that interleaves the LDPC code in units of 360-bit bit groups, and a mapping unit that maps the LDPC code to one of 256 signal points of a 2D-Non-Uniform Constellation (NUC) of 256QAM in units of 8 bits, wherein in the group-wise interleaving, the (i+1)-th bit group from the beginning of the LDPC code is defined as bit group i, and a mapping unit that maps a sequence of bit groups 0 to 191 of the 69120-bit LDPC code to bit group i+1. 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 The LDPC code includes information bits and parity bits, the check matrix includes an information matrix portion corresponding to the information bits and a parity matrix portion corresponding to the parity bits, the information matrix portion is represented by a check matrix initial value table, and the check matrix initial value table is a table that represents the position of an element of 1 in the information matrix portion for every 360 columns, 387 648 945 3023 3889 4856 5002 5167 6868 7477 7590 8165 8354 42 406 1279 1968 3016 4196 4599 4996 5019 6350 6785 7051 8529 534 784 1034 1160 2530 5033 5171 5469 6167 6372 6913 7718 8621 944 2506 2806 3149 3559 5101 6076 6083 6092 6147 6866 7908 8155 308 1869 1888 2569 3297 4742 5232 5442 6135 6814 7284 8238 8405 34 464 667 899 2421 3425 5382 6258 6373 6399 6489 7367 7922 2276 3014 3525 3829 4135 4276 4611 4733 4738 4956 6025 7152 8155 1047 1370 2406 2819 4600 4991 5017 5590 6199 6483 6556 6834 7760 66 380 2033 3698 4068 6096 6223 6238 6757 7541 7641 7677 8595 562 697 782 808 921 1703 3032 4300 7027 7481 7839 8160 8526 236 962 1557 2023 2135 2190 2892 3072 4523 6254 6838 7209 7381 196 1167 1179 1426 1675 1763 2345 2560 2613 5024 5761 6522 7973 512 822 1778 1924 2610 3445 4570 4805 5263 5299 8439 8448 8464 1923 2270 3204 3698 4456 4522 4601 5161 5207 6260 6310 6441 6851 104 281 622 1276 2172 2334 2731 3417 3854 4698 8095 8195 8333 451 528 1269 2169 2274 2393 3853 5002 5543 6121 6351 7364 8139 1685 2675 2790 2953 3103 3560 4336 5372 5495 5568 6429 6492 8206 604 1190 1279 2427 2714 3283 3312 3855 4566 6045 6664 6788 8317 338 917 1873 2102 2561 2655 4635 4765 5370 6249 6724 7668 8456 184 1166 1583 1859 2376 2521 3093 4181 4713 4926 5146 6070 8004 175 1227 2367 3402 3628 3982 4265 4282 4355 5972 6434 7280 7765 801 922 1029 1531 1606 3170 3824 4358 4732 4849 5225 6759 8183 509 1507 1704 1765 2183 2574 3271 4050 4299 4964 5968 6324 7091 567 795 1376 2390 2767 3424 5195 6355 6726 7607 8346 8352 308 1060 1973 2364 2937 3526 4221 4745 5185 5845 6146 7762 323 590 732 917 2636 3008 3792 3990 4322 4893 5211 8014 471 1249 1674 1841 2567 3124 3130 4885 5575 7521 7648 8227 1582 1669 1772 2386 3340 3387 3881 4322 6018 6055 6488 7177 976 1003 2127 3575 3816 6225 7404 7499 7542 8237 8421 8630 675 961 1957 3825 3858 4646 5248 5801 5940 6533 7040 8037 79 639 1363 1436 1763 2570 3874 4876 6870 6886 7104 8399 20 297 1330 2264 3287 3534 4441 4746 6569 6971 6976 8179 482 1125 1589 2892 3759 3871 4635 6038 6214 6796 6816 7621 1127 3336 3867 3929 4269 4794 5054 5842 6471 6547 7039 8560 217 1521 1983 8283 3731 4402 208 6703 242 4988 4170 5038 4108 8035 3301 8543 3168 8249 5028 5838 3470 8597 2901 5264 2505 4505 934 5117 1712 5819 3165 7273 3274 6115 4576 6330 7327 5380 6732 8439 2474 3723 7782 384 2783 5846 1453 4436 6625 3220 4261 4835 163 3117 7554 502 2119 4059 2200 4263 4930 2378 6294 7713 743 5501 6809 1364 6062 7808 4680 6468 7895 3469 3602 7304 1609 5386 5647 267 2921 3206 2565 3020 6269 1651 5224 5718 1128 5058 8579 286 3396 7660 1497 5171 6519 1894 6349 7924 1306 7744 8083 3096 3438 3836 2556 7409 8570 3273 4245 7935 1633 2023 3125 584 4914 6062 2015 2915 3435 1457 6366 6461 23 3576 8132 5322 6300 6520 5715 7113 7822 2044 5053 6607 63 5432 7850 5353 6355 8637 346 590 2648 4780 5997 6991 2556 2583 6537 661 2497 8350 7610 8307 8441 671 860 5986 1133 3158 5891 4360 5802 6547 4782 5688 6955 447 5030 6268 1501 5163 7232 1133 2743 3214 959 4100 7554 5712 7643 8385 1442 3180 8008 697 3078 8421 137 922 5123 597 2879 6340 824 2071 7882 1827 4411 5941 3846 5970 6398 1561 1580 7668 4335 6936 8042 4504 5309 6737 1846 3273 3333 272 4885 6718 1835 4761 6931 2141 3760 5129 3975 5012 6504 1258 2822 6030 242 4947 7668 559 6100 8425 1655 1962 4401 2369 2476 2765 114 156 3195 1651 4154 4448 4669 6064 7317 4988 5567 6697 2963 5578 5679 2064 2286 7790 289 4639 7582 1258 4312 5340 2428 4219 7268 1752 2321 6806 118 7302 8603 4170 4280 4445 2207 5067 7257 2 55 7413 1141 4791 7149 3407 5649 8075 2773 3198 3720 6970 7222 8633 2498 4764 5281 1048 2093 5031 2500 2851 8396 1694 3795 6666 2565 3343 4688 4228 4374 5947 2267 6745 7172 175 2662 3926 90 1517 6056 4069 5439 7648 1679 3394 4707 2136 4553 8265 482 2100 2302 3306 3729 8063 5263 7710 8240 1001 1335 4500 576 6736 7250 181 3601 3755 5899 7515 7714 1181 5332 7197 542 1150 1196 1386 2156 5873 656 3019 3213 263 1117 5957 4495 5904 6462 2547 2786 4215 4954 5848 6225 940 4478 7633 2124 3347 7069 The receiving device / method includes a group-wise deinterleaving unit / step for restoring the arrangement of the LDPC codes after group-wise interleaving, obtained from data transmitted from a transmitting device, to the original arrangement.

[0022] In a first transmission method / apparatus of the present technology, LDPC coding is performed based on a check matrix of an LDPC code having a code length N of 69120 bits and a coding rate r of 2 / 16, and group-wise interleaving is performed to interleave the LDPC code in 360-bit bit group units. Then, the LDPC code is mapped in 8-bit units to one of 256 signal points of 2D-NUC (Non-Uniform Constellation) of 256QAM. In the group-wise interleaving, the (i+1)-th bit group from the beginning of the LDPC code is defined as bit group i, and the arrangement of bit groups 0 to 191 of the 69120-bit LDPC code is defined as bit group i. 18, 161, 152, 30, 91, 138, 83, 88, 127, 54, 33, 46, 125, 120, 122, 169, 51, 150, 100, 52, 95, 186, 149, 81, 11, 53, 164, 130, 19, 176, 93, 107, 29, 86, 124, 65, 75, 71, 74, 68, 44, 82, 59, 104, 118, 103, 131, 101, 8, 96, 97, 119, 166, 77, 50, 34, 158, 21, 184, 24, 165, 171, 142, 36, 181, 45, 90, 175, 99, 13, 37, 10, 140, 3, 69, 16, 133, 172, 173, 27, 132, 79, 76, 111, 123, 7, 94, 70, 116, 174, 15, 156, 187, 110, 84, 185, 14, 72, 159, 143, 78, 135, 17, 12, 139, 67, 58, 151, 177, 73, 154, 145, 179, 25, 108, 148, 137, 85, 147, 61, 20, 89, 155, 183, 134, 128, 191, 26, 121, 126, 0, 141, 112, 62, 114, 48, 182, 146, 115, 64, 113, 189, 31, 1, 39, 168, 2, 43, 163, 188, 35, 129, 153, 66, 23, 40, 6, 5, 98, 56, 9, 63, 180, 157, 167, 162, 60, 42, 49, 28, 22, 80, 87, 92, 160, 55, 136, 170, 106, 117, 178, 32, 38, 105, 102, 41, 57, 109, 144, 47, 190, 4 The check matrix initial value table that defines the check matrix is ​​as described above.

[0023] In the first receiving device / method of the present technology, the arrangement of the LDPC codes after group-wise interleaving, which is obtained from data transmitted from a first transmitting device that performs a first transmitting method, is restored to the original arrangement.

[0024] In a second transmission method / apparatus of the present technology, LDPC coding is performed based on a check matrix of an LDPC code having a code length N of 69120 bits and a coding rate r of 4 / 16, and group-wise interleaving is performed to interleave the LDPC code in 360-bit bit group units. Then, the LDPC code is mapped in 8-bit units to one of 256 signal points of 2D-NUC (Non-Uniform Constellation) of 256QAM. In the group-wise interleaving, the (i+1)-th bit group from the beginning of the LDPC code is defined as bit group i, and the arrangement of bit groups 0 to 191 of the 69120-bit LDPC code is defined as bit group i. 172, 48, 104, 60, 184, 162, 86, 185, 11, 132, 155, 50, 146, 178, 5, 28, 133, 169, 106, 90, 174, 95, 42, 10, 78, 177, 21, 112, 54, 153, 136, 12, 115, 108, 92, 152, 180, 151, 13, 62, 25, 51, 191, 84, 167, 139, 96, 111, 130, 150, 7, 143, 144, 117, 124, 27, 38, 72, 6, 128, 36, 39, 26, 156, 32, 127, 181, 122, 52, 131, 68, 140, 173, 182, 154, 190, 137, 61, 2, 138, 43, 110, 29, 116, 176, 30, 57, 189, 14, 4, 65, 80, 33, 75, 135, 20, 103, 98, 56, 179, 129, 105, 113, 71, 160, 85, 55, 0, 166, 59, 183, 142, 19, 22, 63, 125, 165, 88, 87, 93, 168, 77, 45, 69, 175, 100, 145, 31, 91, 141, 114, 157, 119, 16, 1, 34, 15, 147, 46, 188, 70, 74, 109, 126, 18, 64, 89, 134, 9, 161, 158, 44, 3, 47, 148, 187, 81, 164, 121, 35, 23, 24, 159, 82, 40, 94, 67, 163, 170, 58, 97, 8, 83, 53, 118, 149, 73, 107, 123, 79, 41, 99, 186, 101, 49, 120, 66, 76, 17, 171, 102, 37 The check matrix initial value table that defines the check matrix is ​​as described above.

[0025] In the second receiving device / method of the present technology, the arrangement of the LDPC codes after group-wise interleaving, obtained from data transmitted from a second transmitting device that implements the second transmitting method, is restored to the original arrangement.

[0026] In a third transmission method / apparatus of the present technology, LDPC coding is performed based on a check matrix of an LDPC code having a code length N of 69120 bits and a coding rate r of 6 / 16, and group-wise interleaving is performed to interleave the LDPC code in 360-bit bit group units. Then, the LDPC code is mapped in 8-bit units to one of 256 signal points of 2D-NUC (Non-Uniform Constellation) of 256QAM. In the group-wise interleaving, the (i+1)-th bit group from the beginning of the LDPC code is defined as bit group i, and the arrangement of bit groups 0 to 191 of the 69120-bit LDPC code is defined as bit group i. 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 The check matrix initial value table that defines the check matrix is ​​as described above.

[0027] In the third receiving device / method of the present technology, the arrangement of the LDPC codes after group-wise interleaving, obtained from data transmitted from a third transmitting device that implements the third transmitting method, is restored to the original arrangement.

[0028] In a fourth transmission method / apparatus of the present technology, LDPC coding is performed based on a check matrix of an LDPC code having a code length N of 69120 bits and a coding rate r of 8 / 16, and group-wise interleaving is performed to interleave the LDPC code in 360-bit bit group units. Then, the LDPC code is mapped in 8-bit units to one of 256 signal points of 2D-NUC (Non-Uniform Constellation) of 256QAM. In the group-wise interleaving, the (i+1)-th bit group from the beginning of the LDPC code is defined as bit group i, and the arrangement of bit groups 0 to 191 of the 69120-bit LDPC code is defined as bit group i. 97, 121, 122, 73, 108, 167, 75, 156, 64, 49, 29, 18, 110, 171, 8, 27, 54, 41, 164, 15, 129, 157, 130, 111, 112, 120, 152, 12, 13, 101, 31, 69, 180, 143, 78, 125, 79, 172, 40, 116, 58, 71, 126, 55, 35, 191, 185, 159, 44, 86, 3, 80, 88, 145, 98, 144, 0, 62, 38, 150, 166, 114, 139, 60, 149, 10, 72, 155, 181, 26, 85, 128, 19, 25, 4, 170, 94, 175, 136, 117, 135, 102, 21, 89, 140, 138, 100, 33, 142, 74, 133, 56, 124, 17, 77, 65, 119, 59, 182, 105, 99, 158, 24, 96, 70, 83, 23, 81, 132, 7, 141, 61, 57, 82, 115, 162, 186, 103, 43, 148, 47, 176, 113, 151, 50, 184, 165, 109, 189, 90, 32, 20, 46, 127, 153, 161, 106, 11, 67, 36, 9, 28, 174, 160, 16, 93, 95, 6, 131, 66, 39, 14, 91, 163, 68, 48, 123, 137, 52, 5, 183, 76, 179, 22, 34, 147, 107, 168, 146, 42, 173, 53, 190, 104, 51, 118, 45, 30, 178, 134, 169, 37, 187, 177, 1, 2, 154, 87, 63, 92, 188, 84 The check matrix initial value table that defines the check matrix is ​​as described above.

[0029] In the fourth receiving device / method of the present technology, the arrangement of the LDPC codes after group-wise interleaving, obtained from data transmitted from a fourth transmitting device that implements the fourth transmitting method, is restored to the original arrangement.

[0030] In a fifth transmission method / apparatus of the present technology, LDPC coding is performed based on a check matrix of an LDPC code having a code length N of 69120 bits and a coding rate r of 10 / 16, and group-wise interleaving is performed to interleave the LDPC code in 360-bit bit group units. Then, the LDPC code is mapped in 8-bit units to one of 256 signal points of 2D-NUC (Non-Uniform Constellation) of 256QAM. In the group-wise interleaving, the (i+1)-th bit group from the beginning of the LDPC code is defined as bit group i, and the arrangement of bit groups 0 to 191 of the 69120-bit LDPC code is defined as bit group i. 47, 85, 118, 136, 166, 98, 72, 163, 63, 116, 162, 169, 114, 124, 144, 110, 46, 152, 104, 88, 99, 106, 181, 109, 3, 10, 172, 107, 33, 100, 191, 75, 157, 79, 52, 128, 6, 12, 139, 30, 68, 111, 83, 5, 119, 1, 97, 56, 38, 117, 78, 80, 155, 141, 185, 20, 161, 123, 28, 180, 77, 50, 29, 64, 41, 121, 53, 36, 48, 127, 44, 22, 35, 165, 59, 147, 187, 153, 89, 154, 18, 55, 90, 69, 19, 148, 129, 188, 24, 8, 102, 151, 11, 74, 105, 81, 92, 70, 101, 7, 132, 120, 112, 145, 57, 96, 42, 45, 91, 71, 149, 164, 51, 130, 95, 140, 178, 9, 135, 34, 175, 21, 32, 25, 67, 17, 61, 58, 134, 43, 122, 2, 16, 183, 54, 86, 4, 39, 60, 184, 171, 94, 179, 13, 115, 49, 143, 158, 168, 159, 87, 73, 156, 15, 93, 125, 126, 131, 40, 66, 138, 76, 173, 65, 27, 170, 186, 182, 103, 108, 82, 37, 174, 167, 142, 26, 160, 84, 62, 190, 176, 31, 150, 189, 113, 137, 14, 23, 0, 146, 177, 133 The check matrix initial value table that defines the check matrix is ​​as described above.

[0031] In the fifth receiving device / method of the present technology, the arrangement of the LDPC codes after group-wise interleaving, obtained from data transmitted from a fifth transmitting device that implements the fifth transmitting method, is restored to the original arrangement.

[0032] In a sixth transmission method / apparatus of the present technology, LDPC coding is performed based on a check matrix of an LDPC code having a code length N of 69120 bits and a coding rate r of 12 / 16, and group-wise interleaving is performed to interleave the LDPC code in 360-bit bit group units. Then, the LDPC code is mapped in 8-bit units to one of 256 signal points of 2D-NUC (Non-Uniform Constellation) of 256QAM. In the group-wise interleaving, the (i+1)-th bit group from the beginning of the LDPC code is defined as bit group i, and the arrangement of bit groups 0 to 191 of the 69120-bit LDPC code is defined as bit group i. 97, 39, 99, 33, 10, 6, 189, 179, 130, 172, 76, 185, 131, 40, 176, 159, 8, 17, 167, 116, 16, 160, 5, 174, 27, 115, 43, 41, 136, 175, 153, 144, 106, 29, 105, 84, 67, 35, 152, 191, 72, 56, 83, 168, 12, 184, 65, 146, 104, 80, 98, 79, 51, 26, 64, 137, 181, 165, 52, 129, 186, 48, 128, 154, 58, 141, 77, 187, 94, 109, 81, 119, 82, 38, 18, 188, 143, 170, 147, 2, 162, 95, 21, 11, 74, 151, 19, 59, 1, 138, 145, 7, 177, 30, 42, 44, 28, 20, 91, 14, 4, 70, 110, 31, 37, 61, 55, 85, 15, 183, 171, 96, 103, 101, 112, 161, 54, 178, 78, 87, 126, 57, 180, 88, 92, 113, 73, 90, 117, 93, 89, 122, 62, 25, 158, 148, 118, 45, 123, 60, 107, 173, 114, 166, 120, 13, 23, 139, 86, 135, 164, 47, 124, 149, 150, 46, 157, 100, 142, 0, 71, 50, 49, 36, 9, 127, 156, 75, 34, 163, 125, 190, 182, 155, 66, 69, 140, 32, 169, 132, 53, 68, 102, 63, 133, 111, 22, 134, 108, 3, 24, 121 The check matrix initial value table that defines the check matrix is ​​as described above.

[0033] In the sixth receiving device / method of the present technology, the arrangement of the LDPC codes after group-wise interleaving, obtained from data transmitted from a sixth transmitting device implementing the sixth transmitting method, is restored to the original arrangement.

[0034] In a seventh transmission method / apparatus of the present technology, LDPC coding is performed based on a check matrix of an LDPC code having a code length N of 69120 bits and a coding rate r of 14 / 16, and group-wise interleaving is performed to interleave the LDPC code in 360-bit bit group units. Then, the LDPC code is mapped in 8-bit units to one of 256 signal points of 2D-NUC (Non-Uniform Constellation) of 256QAM. In the group-wise interleaving, the (i+1)-th bit group from the beginning of the LDPC code is defined as bit group i, and the arrangement of bit groups 0 to 191 of the 69120-bit LDPC code is defined as bit group i. 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 The check matrix initial value table that defines the check matrix is ​​as described above.

[0035] In the seventh receiving device / method of the present technology, the arrangement of the LDPC codes after group-wise interleaving, obtained from data transmitted from a seventh transmitting device that implements the seventh transmitting method, is restored to the original arrangement.

[0036] The receiving device and the transmitting device may each be an independent device, or may be an internal block constituting a single device. [Effects of the Invention]

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

[0038] The effects described here are not necessarily limited to those described herein, and may be any of the effects described in this disclosure. [Brief explanation of the drawings]

[0039] [Figure 1] FIG. 2 is a diagram illustrating a check matrix H of an LDPC code. [Figure 2] 10 is a flowchart illustrating a decoding procedure for an LDPC code. [Figure 3] FIG. 1 is a diagram illustrating an example of a check matrix of an LDPC code. [Figure 4] FIG. 10 is a diagram illustrating an example of a Tanner graph of a parity check matrix. [Figure 5] FIG. 10 is a diagram illustrating an example of a variable node. [Figure 6] FIG. 2 is a diagram illustrating an example of a check node. [Figure 7] 1 is a diagram illustrating an example of the configuration of an embodiment of a transmission system to which the present technology is applied. [Figure 8] FIG. 2 is a block diagram showing an example of the configuration of a transmission device 11. [Figure 9] FIG. 10 is a block diagram showing an example of the configuration of a bit interleaver 116. [Figure 10] FIG. 10 is a diagram illustrating an example of a check matrix. [Figure 11] FIG. 10 is a diagram illustrating an example of a parity matrix. [Figure 12] 1 is a diagram illustrating a check matrix of an LDPC code defined in the DVB-T.2 standard. [Figure 13] 1 is a diagram illustrating a check matrix of an LDPC code defined in the DVB-T.2 standard. [Figure 14] FIG. 1 is a diagram illustrating an example of a Tanner graph for decoding an LDPC code. [Figure 15] FIG. 1 is a diagram illustrating an example of a parity matrix H T having a staircase structure and a Tanner graph corresponding to the parity matrix H T. [Figure 16] FIG. 10 is a diagram illustrating an example of a parity matrix H T of a check matrix H corresponding to an LDPC code after parity interleaving. [Figure 17] 10 is a flowchart illustrating an example of processing performed by the bit interleaver 116 and the mapper 117. [Figure 18] FIG. 2 is a block diagram showing an example of the configuration of an LDPC encoder 115. [Figure 19] 10 is a flowchart illustrating an example of processing performed by the LDPC encoder 115. [Figure 20] FIG. 10 is a diagram illustrating an example of a check matrix initial value table for a coding rate of 1 / 4 and a code length of 16200. [Figure 21] 10 is a diagram illustrating a method for obtaining a check matrix H from a check matrix initial value table. FIG. [Figure 22] FIG. 10 is a diagram illustrating the structure of a parity check matrix. [Figure 23] FIG. 10 is a diagram illustrating an example of a check matrix initial value table. [Figure 24] FIG. 10 is a diagram illustrating matrix A generated from the check matrix initial value table. [Figure 25] FIG. 10 is a diagram illustrating parity interleaving of a B matrix. [Figure 26] FIG. 10 is a diagram illustrating a C matrix generated from a check matrix initial value table. [Figure 27] FIG. 10 is a diagram illustrating parity interleaving of a D matrix. [Figure 28]FIG. 10 is a diagram showing a parity check matrix obtained by performing column permutation on the parity check matrix as parity deinterleaving to restore parity interleaving to its original state. [Figure 29] FIG. 10 is a diagram showing a transformed check matrix obtained by performing row permutation on a check matrix. [Figure 30] FIG. 10 is a diagram showing an example of a check matrix initial value table for a Type A code where N=69120 bits and r=2 / 16. [Figure 31] FIG. 10 is a diagram showing an example of a check matrix initial value table for a Type A code where N=69120 bits and r=3 / 16. [Figure 32] FIG. 10 is a diagram showing an example of a check matrix initial value table for a Type A code where N=69120 bits and r=3 / 16. [Figure 33] FIG. 10 is a diagram showing an example of a check matrix initial value table for a Type A code where N=69120 bits and r=4 / 16. [Figure 34] FIG. 10 is a diagram showing an example of a check matrix initial value table for a Type A code where N=69120 bits and r=5 / 16. [Figure 35] FIG. 10 is a diagram showing an example of a check matrix initial value table for a Type A code where N=69120 bits and r=5 / 16. [Figure 36] FIG. 10 is a diagram showing an example of a check matrix initial value table for a Type A code where N=69120 bits and r=6 / 16. [Figure 37] FIG. 10 is a diagram showing an example of a check matrix initial value table for a Type A code where N=69120 bits and r=6 / 16. [Figure 38] FIG. 10 is a diagram showing an example of a check matrix initial value table for a Type A code where N=69120 bits and r=7 / 16. [Figure 39] FIG. 10 is a diagram showing an example of a check matrix initial value table for a Type A code where N=69120 bits and r=7 / 16. [Figure 40] FIG. 10 is a diagram showing an example of a check matrix initial value table for a Type A code where N=69120 bits and r=8 / 16. [Figure 41]FIG. 10 is a diagram showing an example of a check matrix initial value table for a Type A code where N=69120 bits and r=8 / 16. [Figure 42] FIG. 10 is a diagram showing an example of a check matrix initial value table for a Type B code where N=69120 bits and r=7 / 16. [Figure 43] FIG. 10 is a diagram showing an example of a check matrix initial value table for a Type B code where N=69120 bits and r=7 / 16. [Figure 44] FIG. 10 is a diagram showing another example of a parity check matrix initial value table for a Type B code with N=69120 bits and r=7 / 16. [Figure 45] FIG. 10 is a diagram showing another example of a parity check matrix initial value table for a Type B code with N=69120 bits and r=7 / 16. [Figure 46] FIG. 10 is a diagram showing an example of a check matrix initial value table for a Type B code where N=69120 bits and r=8 / 16. [Figure 47] FIG. 10 is a diagram showing an example of a check matrix initial value table for a Type B code where N=69120 bits and r=8 / 16. [Figure 48] FIG. 10 is a diagram showing another example of a parity check matrix initial value table for a Type B code with N=69120 bits and r=8 / 16. [Figure 49] FIG. 10 is a diagram showing another example of a parity check matrix initial value table for a Type B code with N=69120 bits and r=8 / 16. [Figure 50] FIG. 10 is a diagram showing an example of a check matrix initial value table for a Type B code where N=69120 bits and r=9 / 16. [Figure 51] FIG. 10 is a diagram showing an example of a check matrix initial value table for a Type B code where N=69120 bits and r=9 / 16. [Figure 52] FIG. 10 is a diagram showing an example of a check matrix initial value table for a Type B code where N=69120 bits and r=9 / 16. [Figure 53] FIG. 10 is a diagram showing another example of a parity check matrix initial value table for a Type B code with N=69120 bits and r=9 / 16. [Figure 54]FIG. 10 is a diagram showing another example of a parity check matrix initial value table for a Type B code with N=69120 bits and r=9 / 16. [Figure 55] FIG. 10 is a diagram showing another example of a parity check matrix initial value table for a Type B code with N=69120 bits and r=9 / 16. [Figure 56] FIG. 10 is a diagram showing an example of a check matrix initial value table for a Type B code where N=69120 bits and r=10 / 16. [Figure 57] FIG. 10 is a diagram showing an example of a check matrix initial value table for a Type B code where N=69120 bits and r=10 / 16. [Figure 58] FIG. 10 is a diagram showing an example of a check matrix initial value table for a Type B code where N=69120 bits and r=10 / 16. [Figure 59] FIG. 10 is a diagram showing another example of a parity check matrix initial value table for a Type B code with N=69120 bits and r=10 / 16. [Figure 60] FIG. 10 is a diagram showing another example of a parity check matrix initial value table for a Type B code with N=69120 bits and r=10 / 16. [Figure 61] FIG. 10 is a diagram showing another example of a parity check matrix initial value table for a Type B code with N=69120 bits and r=10 / 16. [Figure 62] FIG. 10 is a diagram showing an example of a check matrix initial value table for a Type B code with N=69120 bits and r=11 / 16. [Figure 63] FIG. 10 is a diagram showing an example of a check matrix initial value table for a Type B code with N=69120 bits and r=11 / 16. [Figure 64] FIG. 10 is a diagram showing an example of a check matrix initial value table for a Type B code with N=69120 bits and r=11 / 16. [Figure 65] FIG. 10 is a diagram showing another example of a parity check matrix initial value table for a Type B code with N=69120 bits and r=11 / 16. [Figure 66] FIG. 10 is a diagram showing another example of a parity check matrix initial value table for a Type B code with N=69120 bits and r=11 / 16. [Figure 67]FIG. 10 is a diagram showing another example of a parity check matrix initial value table for a Type B code with N=69120 bits and r=11 / 16. [Figure 68] FIG. 10 is a diagram showing an example of a check matrix initial value table for a Type B code where N=69120 bits and r=12 / 16. [Figure 69] FIG. 10 is a diagram showing an example of a check matrix initial value table for a Type B code where N=69120 bits and r=12 / 16. [Figure 70] FIG. 10 is a diagram showing an example of a check matrix initial value table for a Type B code where N=69120 bits and r=12 / 16. [Figure 71] FIG. 10 is a diagram showing another example of a parity check matrix initial value table for a Type B code with N=69120 bits and r=12 / 16. [Figure 72] FIG. 10 is a diagram showing another example of a parity check matrix initial value table for a Type B code with N=69120 bits and r=12 / 16. [Figure 73] FIG. 10 is a diagram showing another example of a parity check matrix initial value table for a Type B code with N=69120 bits and r=12 / 16. [Figure 74] FIG. 10 is a diagram showing an example of a check matrix initial value table for a Type B code with N=69120 bits and r=13 / 16. [Figure 75] FIG. 10 is a diagram showing an example of a check matrix initial value table for a Type B code with N=69120 bits and r=13 / 16. [Figure 76] FIG. 10 is a diagram showing an example of a check matrix initial value table for a Type B code with N=69120 bits and r=13 / 16. [Figure 77] FIG. 10 is a diagram showing another example of a parity check matrix initial value table for a Type B code with N=69120 bits and r=13 / 16. [Figure 78] FIG. 10 is a diagram showing another example of a parity check matrix initial value table for a Type B code with N=69120 bits and r=13 / 16. [Figure 79] FIG. 10 is a diagram showing another example of a parity check matrix initial value table for a Type B code with N=69120 bits and r=13 / 16. [Figure 80]FIG. 10 is a diagram showing an example of a check matrix initial value table for a Type B code where N=69120 bits and r=14 / 16. [Figure 81] FIG. 10 is a diagram showing an example of a check matrix initial value table for a Type B code where N=69120 bits and r=14 / 16. [Figure 82] FIG. 10 is a diagram showing an example of a check matrix initial value table for a Type B code where N=69120 bits and r=14 / 16. [Figure 83] FIG. 10 is a diagram showing another example of a parity check matrix initial value table for a Type B code with N=69120 bits and r=14 / 16. [Figure 84] FIG. 10 is a diagram showing another example of a parity check matrix initial value table for a Type B code with N=69120 bits and r=14 / 16. [Figure 85] FIG. 10 is a diagram showing another example of a parity check matrix initial value table for a Type B code with N=69120 bits and r=14 / 16. [Figure 86] FIG. 10 is a diagram illustrating an example of a Tanner graph of an ensemble of degree sequences with column weight 3 and row weight 6. [Figure 87] FIG. 10 is a diagram illustrating an example of a Tanner graph of a multi-edge type ensemble. [Figure 88] FIG. 10 is a diagram illustrating a parity check matrix of the Type A method. [Figure 89] FIG. 10 is a diagram illustrating a parity check matrix of the Type A method. [Figure 90] FIG. 10 is a diagram illustrating a parity check matrix of the Type B method. [Figure 91] FIG. 10 is a diagram illustrating a parity check matrix of the Type B method. [Figure 92] FIG. 10 is a diagram illustrating an example of coordinates of UC signal points when the modulation method is QPSK. [Figure 93] FIG. 10 is a diagram illustrating an example of the coordinates of signal points of 2D-NUC when the modulation method is 16QAM. [Figure 94] FIG. 10 is a diagram illustrating an example of the coordinates of signal points of 1D-NUC when the modulation method is 1024QAM. [Figure 95] FIG. 10 is a diagram showing the relationship between a 1024QAM symbol y and a position vector u. [Figure 96] FIG. 10 is a diagram illustrating an example of coordinates zq of a signal point of QPSK-UC. [Figure 97] FIG. 10 is a diagram illustrating an example of coordinates zq of a signal point of QPSK-UC. [Figure 98] FIG. 10 is a diagram illustrating an example of coordinates zq of a 16QAM-UC signal point. [Figure 99] FIG. 10 is a diagram illustrating an example of coordinates zq of a 16QAM-UC signal point. [Figure 100] FIG. 10 is a diagram illustrating an example of coordinates zq of a 64QAM-UC signal point. [Figure 101] FIG. 10 is a diagram illustrating an example of coordinates zq of a 64QAM-UC signal point. [Figure 102] FIG. 10 is a diagram illustrating an example of coordinates zq of a 256QAM-UC signal point. [Figure 103] FIG. 10 is a diagram illustrating an example of coordinates zq of a signal point of 256QAM-UC. [Figure 104] FIG. 10 is a diagram illustrating an example of coordinates zq of a 1024QAM-UC signal point. [Figure 105] FIG. 10 is a diagram illustrating an example of coordinates zq of a 1024QAM-UC signal point. [Figure 106] FIG. 10 is a diagram illustrating an example of coordinates zq of a 4096QAM-UC signal point. [Figure 107] FIG. 10 is a diagram illustrating an example of coordinates zq of a 4096QAM-UC signal point. [Figure 108] FIG. 10 is a diagram illustrating an example of coordinates zs of a signal point of 16QAM-2D-NUC. [Figure 109] FIG. 10 is a diagram illustrating an example of coordinates zs of a signal point of 64QAM-2D-NUC. [Figure 110] FIG. 10 is a diagram illustrating an example of the coordinates zs of a signal point of 256QAM-2D-NUC. [Figure 111] FIG. 10 is a diagram illustrating an example of the coordinates zs of a signal point of 256QAM-2D-NUC. [Figure 112] FIG. 10 is a diagram illustrating an example of coordinates zs of a signal point of 1024QAM-1D-NUC. [Figure 113] FIG. 10 is a diagram showing the relationship between a 1024QAM symbol y and a position vector u. [Figure 114] FIG. 10 is a diagram illustrating an example of coordinates zs of a signal point of 4096QAM-1D-NUC. [Figure 115] FIG. 10 is a diagram showing the relationship between a 4096QAM symbol y and a position vector u. [Figure 116] FIG. 10 is a diagram showing the relationship between a 4096QAM symbol y and a position vector u. [Figure 117] FIG. 2 is a diagram illustrating block interleaving performed by the block interleaver 25. [Figure 118] FIG. 2 is a diagram illustrating block interleaving performed by the block interleaver 25. [Figure 119] FIG. 2 is a diagram illustrating group-wise interleaving performed by group-wise interleaver 24. [Figure 120] FIG. 10 is a diagram illustrating a first example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Figure 121] FIG. 10 is a diagram illustrating a second example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Figure 122] FIG. 10 is a diagram illustrating a third example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Figure 123] FIG. 10 is a diagram illustrating a fourth example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Figure 124] FIG. 10 is a diagram illustrating a fifth example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Figure 125] FIG. 10 is a diagram illustrating a sixth example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Figure 126] FIG. 10 is a diagram illustrating a seventh example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Figure 127] FIG. 10 is a diagram illustrating an eighth example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Figure 128] FIG. 13 is a diagram illustrating a ninth example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Figure 129] FIG. 16 is a diagram illustrating a tenth example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Figure 130] FIG. 11 is a diagram illustrating an eleventh example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Figure 131] FIG. 12 is a diagram illustrating a twelfth example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Figure 132] FIG. 13 is a diagram illustrating a thirteenth example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Figure 133] FIG. 14 is a diagram illustrating a fourteenth example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Figure 134] FIG. 15 is a diagram illustrating a fifteenth example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Figure 135] FIG. 16 is a diagram illustrating a sixteenth example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Figure 136] FIG. 17 is a diagram illustrating a 17th example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Figure 137] FIG. 18 is a diagram illustrating an 18th example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Figure 138] FIG. 19 is a diagram illustrating a 19th example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Figure 139] FIG. 13 is a diagram illustrating a twentieth example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Figure 140] FIG. 21 is a diagram illustrating a 21st example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Figure 141] FIG. 22 is a diagram illustrating a 22nd example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Figure 142] FIG. 23 is a diagram illustrating a 23rd example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Figure 143] FIG. 24 is a diagram illustrating a 24th example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Figure 144] FIG. 25 is a diagram illustrating a 25th example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Figure 145] FIG. 26 is a diagram illustrating a 26th example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Figure 146] FIG. 27 is a diagram illustrating a 27th example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Figure 147] FIG. 28 is a diagram illustrating a 28th example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Figure 148] FIG. 13 is a diagram illustrating a 29th example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Figure 149] FIG. 10 is a diagram illustrating a 30th example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Figure 150] FIG. 10 is a diagram illustrating a 31st example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Figure 151] FIG. 10 is a diagram illustrating a 32nd example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Figure 152] FIG. 10 is a diagram illustrating a 33rd example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Figure 153] FIG. 10 is a diagram illustrating a 34th example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Fig. 154] FIG. 10 is a diagram illustrating a 35th example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Figure 155] FIG. 10 is a diagram illustrating a 36th example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Figure 156] FIG. 10 is a diagram illustrating a 37th example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Figure 157]FIG. 10 is a diagram illustrating a 38th example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Figure 158] FIG. 10 is a diagram illustrating a 39th example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Figure 159] FIG. 10 is a diagram illustrating a 40th example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Figure 160] FIG. 41 is a diagram showing a 41st example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Figure 161] FIG. 42 is a diagram illustrating a 42nd example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Figure 162] FIG. 10 is a diagram illustrating a 43rd example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Figure 163] FIG. 10 is a diagram illustrating a 44th example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Fig. 164] FIG. 10 is a diagram illustrating a 45th example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Figure 165] FIG. 10 is a diagram illustrating a 46th example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Figure 166] FIG. 10 is a diagram illustrating a 47th example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Figure 167] FIG. 10 is a diagram illustrating a 48th example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Figure 168] FIG. 10 is a diagram illustrating a 49th example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Figure 169] FIG. 10 is a diagram illustrating a 50th example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Figure 170] FIG. 10 is a diagram illustrating a 51st example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Figure 171]FIG. 10 is a diagram illustrating a 52nd example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Fig. 172] FIG. 10 is a diagram illustrating a 53rd example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Figure 173] FIG. 10 is a diagram illustrating a 54th example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Fig. 174] FIG. 10 is a diagram illustrating a 55th example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Figure 175] FIG. 10 is a diagram illustrating a 56th example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Figure 176] FIG. 10 is a diagram illustrating a 57th example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Figure 177] FIG. 10 is a diagram illustrating a 58th example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Figure 178] FIG. 10 is a diagram illustrating a 59th example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Figure 179] FIG. 10 is a diagram illustrating a 60th example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Figure 180] FIG. 10 is a diagram illustrating a 61st example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Figure 181] FIG. 10 is a diagram illustrating a 62nd example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Figure 182] FIG. 10 is a diagram illustrating a 63rd example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Figure 183] FIG. 10 is a diagram illustrating a 64th example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Figure 184] FIG. 10 is a diagram illustrating a 65th example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Figure 185]FIG. 10 is a diagram illustrating a 66th example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Figure 186] FIG. 10 is a diagram illustrating a 67th example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Figure 187] FIG. 10 is a diagram illustrating a 68th example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Figure 188] FIG. 10 is a diagram illustrating a 69th example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Figure 189] FIG. 10 is a diagram showing a 70th example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Figure 190] FIG. 10 is a diagram showing a 71st example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Figure 191] FIG. 10 is a diagram illustrating a 72nd example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Figure 192] FIG. 10 is a diagram illustrating a 73rd example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Figure 193] FIG. 10 is a diagram illustrating a 74th example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Figure 194] FIG. 10 is a diagram illustrating a 75th example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Figure 195] FIG. 10 is a diagram illustrating a 76th example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Figure 196] FIG. 10 is a diagram illustrating a 77th example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Figure 197] FIG. 10 is a diagram illustrating a 78th example of a GW pattern for an LDPC code having a code length N of 69120 bits. [Figure 198] FIG. 2 is a block diagram showing an example of the configuration of a receiving device 12. [Figure 199] FIG. 10 is a block diagram showing an example of the configuration of a bit deinterleaver 165. [Figure 200] It is a flowchart for explaining an example of the processing performed by the demapper 164, the bit deinterleaver 165, and the LDPC decoder 166. [Figure 201] It is a diagram showing an example of a check matrix of an LDPC code. [Figure 202] It is a diagram showing an example of a matrix (transformed check matrix) obtained by performing row permutation and column permutation on a check matrix. [Figure 203] It is a diagram showing an example of a transformed check matrix divided into 5×5 units. [Figure 204] It is a block diagram showing a configuration example of a decoding device that performs P node operations together. [Figure 205] It is a block diagram showing a configuration example of the LDPC decoder 166. [Figure 206] It is a diagram for explaining block deinterleaving performed by the block deinterleaver 54. [Figure 207] It is a block diagram showing another configuration example of the bit deinterleaver 165. [Figure 208] It is a block diagram showing a first configuration example of a reception system to which the reception device 12 can be applied. [Figure 209] It is a block diagram showing a second configuration example of a reception system to which the reception device 12 can be applied. [Figure 210] It is a block diagram showing a third configuration example of a reception system to which the reception device 12 can be applied. [Figure 211] It is a block diagram showing a configuration example of an embodiment of a computer to which this technology is applied.

Embodiments for Carrying Out the Invention

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

[0041] <LDPC Code>

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

[0043] The most notable feature of LDPC codes is that the parity check matrix that defines them is sparse. A sparse matrix is ​​one in which the number of "1" elements is very small (most of the elements are 0).

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

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

[0046] In coding using an LDPC code (LDPC coding), for example, a generator matrix G is generated based on a check matrix H, and binary information bits are multiplied by this generator matrix G to generate a codeword (LDPC code).

[0047] Specifically, the coding device that performs LDPC coding first generates a transposed matrix H of the check matrix H. T Between the equation GH T = 0. Here, if generator matrix G is a K × N matrix, the encoding device multiplies generator matrix G by a bit string (vector u) of K information bits to generate a codeword c (= uG) consisting of N bits. The codeword (LDPC code) generated by this encoding device is received at the receiving side via a predetermined communication channel.

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

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

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

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

[0052]

number

[0053]

number

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

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

[0056]

number

[0057]

number

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

[0059] If it is determined in step S13 that the variable k is greater than C, the process proceeds to step S14, where the message v i is calculated and output, and the LDPC code decoding process is completed.

[0060]

number

[0061] Here, the operation of formula (5) differs from the variable node operation of formula (1) in that it receives messages u from all edges connected to the variable node. j This is done using

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

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

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

[0065] Here, in Figure 4, check nodes are represented by plus signs "+" and variable nodes are represented by equal signs "=". Check nodes and variable nodes correspond to the rows and columns of the parity check matrix H, respectively. The connection between a check node and a variable node is an edge, which corresponds to the element "1" of the parity check matrix.

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

[0067] In a sum product algorithm, which is a decoding method for LDPC codes, variable node calculations and check node calculations are repeatedly performed.

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

[0069] At the variable node, the message v corresponding to the branch to be calculated is i is the message u1 and u2 from the remaining branches connected to the variable node, and the received value u 0i The messages corresponding to the other branches can be calculated in the same way.

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

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

[0072]

number

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

[0074]

number

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

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

[0077] The function φ(x) in equation (7) is expressed as φ(x)=ln((e x +1) / (e x -1), and for x>0, φ(x)=φ -1 (x). The functions φ(x) and φ -1 When (x) is implemented in hardware, it may be implemented using an LUT (Look Up Table), but both will be the same LUT.

[0078] <Configuration example of a transmission system applying this technology>

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

[0080] In FIG. 7, the transmission system is made up of a transmitting device 11 and a receiving device 12.

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

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

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

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

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

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

[0087] On the other hand, in decoding the LDPC code, the columns of the check matrix H, and in turn, the variable nodes corresponding to the code bits of the LDPC code, are used to decode the received values ​​u 0i Since the variable node operation of equation (1) involves the addition of (a), if an error occurs in the sign bit used in the variable node operation, the accuracy of the message obtained will decrease.

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

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

[0090] Therefore, the transmission system of FIG. 7 can improve the tolerance to burst errors and erasures while maintaining the performance on an AWGN communication path (AWGN channel).

[0091] <Configuration example of transmitter 11>

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

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

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

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

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

[0097] The BCH encoder 114 performs BCH encoding on the data from the BB scrambler 113, and supplies the resulting data to an LDPC encoder 115 as LDPC target data that is to be LDPC encoded.

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

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

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

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

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

[0103] The mapper 117 performs quadrature modulation (multi-level modulation) by mapping 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.

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

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

[0106] Here, the modulation method of the quadrature modulation performed by the mapper 117 includes, for example, modulation methods defined in the DVB-S.2 and ATSC3.0 standards, 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. Which modulation method is used for quadrature modulation in the mapper 117 is set in advance, for example, according to an operation by an operator of the transmission device 11.

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

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

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

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

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

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

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

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

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

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

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

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

[0119] <Configuration example of bit interleaver 116>

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

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

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

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

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

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

[0126] The block interleaver 25 performs block interleaving to demultiplex the LDPC codes from the group-wise interleaver 24, thereby symbolizing, for example, one code's worth of LDPC codes into m-bit symbols, which are the unit of mapping, and supplies them to the mapper 117 (Figure 8).

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

[0128] <Check matrix of LDPC code>

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

[0130] The check matrix H has an LDGM (Low-Density Generation Matrix) structure, and an information matrix H of a portion corresponding to information bits among the code bits of the LDPC code A and a parity matrix H corresponding to parity bits T such that the equation H = [H A | H T (a matrix with the elements of the information matrix H A as the left-side elements and the elements of the parity matrix H T as the right-side elements) can be represented.

[0131] Here, the number of information bits and the number of parity bits among the code bits of one LDPC code (one codeword) are referred to as information length K and parity length M, respectively, and the number of code bits of one (one codeword) LDPC code is referred to as code length N (= K + M).

[0132] 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-by-N matrix). And the information matrix H A is an M-by-K matrix, and the parity matrix H T is an M-by-M matrix.

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

[0134] 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 specified in standards such as DVB-T.2 is used. T can be adopted.

[0135] Parity matrix H of the check matrix H of the LDPC code specified in standards such as DVB-T.2 T As shown in Figure 11, the parity matrix H is a lower bidiagonal matrix in which the elements of 1 are arranged in a staircase pattern. T The row weight is 1 for the first row and 2 for all remaining rows. The column weight is 1 for the last column and 2 for all remaining columns.

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

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

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

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

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

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

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

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

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

[0145] For an LDPC code with a code length N of 64,800 bits, eleven coding rates (nominal rates) 1 / 4, 1 / 3, 2 / 5, 1 / 2, 3 / 5, 2 / 3, 3 / 4, 4 / 5, 5 / 6, 8 / 9, and 9 / 10 are specified, and for an LDPC code with a code length N of 16,200 bits, ten coding rates 1 / 4, 1 / 3, 2 / 5, 1 / 2, 3 / 5, 2 / 3, 3 / 4, 4 / 5, 5 / 6, and 8 / 9 are specified.

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

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

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

[0149] <Parity interleave>

[0150] Parity interleaving by the parity interleaver 23 of FIG. 9 will be described with reference to FIGS.

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

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

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

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

[0155] A in Figure 15 shows the parity matrix H T 15A shows an example of the parity matrix H T The Tanner graph corresponding to

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

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

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

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

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

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

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

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

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

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

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

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

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

[0169] Here, the pseudo-cyclic structure means a structure in which all but a part are cyclic structures.

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

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

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

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

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

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

[0176] 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 parity-interleaved LDPC code to the group-wise interleaver 24.

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

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

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

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

[0181] Here, in Figure 9, for the sake of convenience of explanation, the parity interleaver 23, which is a block that performs parity interleaving, and the group-wise interleaver 24, which is a block that performs group-wise interleaving, are configured separately, but the parity interleaver 23 and the group-wise interleaver 24 can be configured as an integrated unit.

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

[0183] Therefore, if a matrix is ​​obtained by multiplying a matrix representing parity interleaving by a matrix representing group-wise interleaving, the code bits can be converted using these matrices to perform parity interleaving, and the result of group-wise interleaving the LDPC code after the parity interleaving can be obtained.

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

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

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

[0187] Note that one or both of the parity interleaving and the group-wise interleaving may not be performed.

[0188] <Configuration example of LDPC encoder 115>

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

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

[0191] As described in 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.

[0192] For the LDPC code with a code length N of 64800 bits, 11 coding rates of 1 / 4, 1 / 3, 2 / 5, 1 / 2, 3 / 5, 2 / 3, 3 / 4, 4 / 5, 5 / 6, 8 / 9, and 9 / 10 are defined. For the LDPC code with a code length N of 16200 bits, 10 coding rates of ۱ / ۴, ۱ / ۳, ۲ / ۵, ۱ / ۲, ۳ / ۵, ۲ / ۳, ۳ / ۴, ۴ / ۵, ۵ / ۶, and ۸ / ۹ are defined (FIGS. 12 and 13). [[ID=2,6]]

[0193] The LDPC encoder 115 can perform encoding (error correction encoding) using LDPC codes with each coding rate having a code length N of 64800 bits or 16200 bits, for example, according to a check matrix H prepared for each code length N and each coding rate.

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

[0195] The LDPC encoder 115 is made up of an encoding processing unit 601 and a storage unit 602 .

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

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

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

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

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

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

[0202] The control unit 616 controls each block that constitutes the encoding processing unit 601 .

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

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

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

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

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

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

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

[0210] Hc T =0 ···(8)

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

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

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

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

[0215] Thereafter, in step S206, the control unit 616 determines whether or not to end the LDPC encoding. If it is determined in step S206 that the LDPC encoding should not be 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 the processes of steps S201 (or step S204) to S206 are repeated.

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

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

[0218] <Example of a check matrix initial value table>

[0219] The check matrix initial value table is, for example, an information matrix H corresponding to an information length K according to the code length N and coding rate r of the LDPC code (LDPC code defined by the check matrix H) of the check matrix H. A10 for each 360 columns (unit size P), and is created in advance for each check matrix H for each code length N and each coding rate r.

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

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

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

[0223] An LDPC code for a parity check matrix indicated by a parity check matrix initial value table of the Type A system is also called a Type A code, and an LDPC code for a parity check matrix indicated by a parity check matrix initial value table of the Type B system is also called a Type B code.

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

[0225] In addition, DVB-T.2 and the like use Type B coding.

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

[0227] That is, Figure 20 shows a check matrix initial value table (representing the check matrix H) for a Type B code (defined in the DVB-T.2 standard) with a code length N of 16,200 bits and a coding rate (the notational coding rate in DVB-T.2) r of 1 / 4.

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

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

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

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

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

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

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

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

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

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

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

[0239] The first row of the parity check matrix initial value table in Figure 21 is 0, 2084, 1613, 1548, 1286, 1460, 3196, 4297, 2481, 3369, 3451, 4620, 2622, which indicates that in the first column of parity check matrix H, the elements in 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).

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

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

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

[0243] 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)).

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

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

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

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

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

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

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

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

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

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

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

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

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

[0257] In the type A check matrix H composed of the above-mentioned A matrix to D matrix and Z matrix, part of A matrix and C matrix constitutes the information matrix, and the remaining parts of B matrix, C matrix, D matrix and Z matrix constitute the parity matrix.

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

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

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

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

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

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

[0264] The Type A method check matrix initial value table is a table that represents the positions of elements of 1 in the A matrix and the C matrix for each unit size P, and in its i-th row, the row numbers of elements of 1 in the 1+P×(i-1)th column of the check matrix H (row numbers where the row number of the first row of the check matrix H is 0) are arranged as many times as the column weight of the 1+P×(i-1)th column.

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

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

[0267] 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 when determining the check matrix H, it is adjusted to a predetermined value. Here, it is assumed that 15, which is three times the unit size P=5, is adopted as M1.

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

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

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

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

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

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

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

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

[0276] That is, the first row of the check matrix initial value table in Figure 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, 18 are 1 (and the other elements are 0).

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

[0292] Each column from the 7th (=2+5×(2-1)) column to the 10th (=5+5×(2-1)) column is cyclically shifted downward by Q1=3 from the previous column.

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

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

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

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

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

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

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

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

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

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

[0303] FIG. 27 is a diagram illustrating parity interleaving of a D matrix.

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

[0305] FIG. 27 shows the parity check matrix H after D matrix parity interleaving is performed on the parity check matrix H of FIG.

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

[0307] Here, the LDPC code generated using the parity check matrix H of Fig. 27 is an LDPC code that has been parity interleaved, and therefore, for the LDPC code generated using the parity check matrix H of Fig. 27, there is no need to perform parity interleaving in the parity interleaver 23 (Fig. 9). In other words, the LDPC code generated using the parity check matrix H after parity interleaving of the D matrix is ​​an LDPC code that has been parity interleaved, and therefore, for such an LDPC code, parity interleaving in the parity interleaver 23 is skipped.

[0308] FIG. 28 is a diagram showing a check matrix H in which column permutation is performed on the B matrix, part of the C matrix (the part of the C matrix that is arranged below the B matrix), and the D matrix of the check matrix H in FIG. 27 as parity deinterleaving that restores the parity interleaving to its original state.

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

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

[0311] FIG. 29 is a diagram showing a transformed parity check matrix H obtained by performing row permutation on the parity check matrix H of FIG.

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

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

[0314] <New LDPC code>

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

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

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

[0318] The LDPC encoder 115 (FIGS. 8 and 18) can perform LDPC encoding into a new LDPC code using a check matrix initial value table (a check matrix H obtained from) of a new LDPC code in which the code length N is longer than 64 k bits, for example, 69120 bits, and the coding rate r is, for example, any 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, as shown below.

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

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

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

[0322] FIG. 32 is a continuation of FIG.

[0323] FIG. 33 is a diagram showing an example 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=4 / 16) as a new LDPC code having a code length N of 69120 bits and a coding rate r of 4 / 16.

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

[0325] FIG. 35 is a continuation of FIG.

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

[0327] FIG. 37 is a continuation of FIG.

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

[0329] FIG. 39 is a continuation of FIG.

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

[0331] FIG. 41 is a continuation of FIG.

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

[0333] FIG. 43 is a continuation of FIG.

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

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

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

[0337] FIG. 47 is a continuation of FIG.

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

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

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

[0341] 51 is a continuation of FIG. 50, and FIG. 52 is a continuation of FIG.

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

[0343] Note that Figure 54 is a continuation of Figure 53, and Figure 55 is a continuation of Figure 54. The Type B code with r=9 / 16 obtained from the check matrix initial value tables of Figures 53 to 55 will hereinafter also be referred to as other Type B code with r=9 / 16.

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

[0345] 57 is a continuation of FIG. 56, and FIG. 58 is a continuation of FIG. 57.

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

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

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

[0349] 63 is a continuation of FIG. 62, and FIG. 64 is a continuation of FIG. 63.

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

[0351] Note that Figure 66 is a diagram continuing from Figure 65, and Figure 67 is a diagram continuing from Figure 66. The Type B code with r=11 / 16 obtained from the check matrix initial value tables of Figures 65 to 67 will hereinafter also be referred to as other Type B code with r=11 / 16.

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

[0353] 69 is a continuation of FIG. 68, and FIG. 70 is a continuation of FIG. 69.

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

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

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

[0357] 75 is a continuation of FIG. 74, and FIG. 76 is a continuation of FIG.

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

[0359] Note that Figure 78 is a continuation of Figure 77, and Figure 79 is a continuation of Figure 78. The Type B code of r=13 / 16 obtained from the check matrix initial value tables of Figures 77 to 79 is also referred to as other Type B code of r=13 / 16 hereinafter.

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

[0361] It should be noted that FIG. 81 is a continuation of FIG. 80, and FIG. 82 is a continuation of FIG.

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

[0363] Note that Figure 84 is a continuation of Figure 83, and Figure 85 is a continuation of Figure 84. The Type B code of r=14 / 16 obtained from the check matrix initial value tables of Figures 83 to 85 will hereinafter also be referred to as other Type B code of r=14 / 16.

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

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

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

[0367] An appropriate check matrix H is, for example, a method for converting LDPC codes obtained from various check matrices that satisfy predetermined conditions into low E s / N o This can be obtained by performing a simulation to measure the BER when transmitting at

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

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

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

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

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

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

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

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

[0376] For a specific LDPC code, if the ensemble to which the LDPC code belongs is determined and density evolution is performed on the ensemble, the rough performance of the LDPC code can be predicted.

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

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

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

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

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

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

[0383] Each check node is connected to six edges, the number of which is equal to the row weight. Therefore, there are a total of 3N edges connected to the N / 2 check nodes.

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

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

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

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

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

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

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

[0391] In addition, in the Tanner graph of Figure 87, there are only v1 variable nodes with one branch connected to the first interleaver and zero branches connected to the second interleaver, only v2 variable nodes with one branch connected to the first interleaver and two branches connected to the second interleaver, and only v3 variable nodes with zero branches connected to the first interleaver and two branches connected to the second interleaver.

[0392] Furthermore, in the Tanner graph of Figure 87, there are only c1 check nodes with two branches connected to the first interleaver and no branches connected to the second interleaver, only c2 check nodes with two branches connected to the first interleaver and two branches connected to the second interleaver, and only c3 check nodes with no branches connected to the first interleaver and three branches connected to the second interleaver.

[0393] Here, density evolution and its implementation are described, for example, in "On the Design of Low-Density Parity-Check Codes within 0.0045 dB of the Shannon Limit," by S.Y. Chung, G.D. Forney, T.J. Richardson, and R. Urbane, IEEE Communications Leggers, Vol. 5, No. 2, February 2001.

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

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

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

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

[0398] For the check matrix H of the type A code, as shown in Figure 88, the column weight of the first K1 columns of the A matrix is ​​represented as Y1, the column weight of the subsequent K2 columns of the A matrix is ​​represented as Y2, the column weight of the first K1 columns of the C matrix is ​​represented as X1, the column weight of the subsequent K2 columns of the C matrix is ​​represented as X2, and the column weight of the further subsequent M1 columns of the C matrix is ​​represented as X3.

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

[0400] In addition, for the check matrix H of the type A code, the column weight of the first to 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.

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

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

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

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

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

[0406] It should be noted 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.

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

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

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

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

[0411] The new LDPC code not only achieves a good BER / FER but also achieves a capacity (communication channel capacity) close to the Shannon limit.

[0412] <Constellation>

[0413] 92 to 116 are diagrams showing examples of constellations that can be used in the transmission system of FIG.

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

[0415] For a MODCOD of 1, more than one constellation can be set.

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

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

[0418] In general, 1D-NUC provides a better BER than UC, and 2D-NUC provides a better BER than 1D-NUC.

[0419] The constellation for a QPSK modulation scheme is UC. For example, UC or 2D-NUC can be used as a constellation for modulation schemes such as 16QAM, 64QAM, and 256QAM, and for example, UC or 1D-NUC can be used as a constellation for modulation schemes such as 1024QAM and 4096QAM.

[0420] In the transmission system of FIG. 7, various constellations that improve the error rate, such as constellations defined in ATSC3.0, DVB-C.2, etc., can be used.

[0421] That is, when the modulation method is QPSK, for example, the same UC can be used for each coding rate r of the LDPC code.

[0422] In addition, when the modulation method is 16QAM, 64QAM, or 256QAM, for example, the same UC can be used for each coding rate r of the LDPC code.Furthermore, when the modulation method is 16QAM, 64QAM, or 256QAM, for example, different 2D-NUCs can be used for each coding rate r of the LDPC code.

[0423] In addition, when the modulation method is 1024QAM or 4096QAM, for example, the same UC can be used for each coding rate r of the LDPC code.Furthermore, when the modulation method is 1024QAM or 4096QAM, for example, different 1D-NUCs can be used for each coding rate r of the LDPC code.

[0424] Here, UC of QPSK is also written as QPSK-UC, and m QAM UC, 2 m Also referred to as QAM-UC. m QAM 1D-NUC and 2D-NUC are respectively m QAM-1D-NUC and 2 m Also written as QAM-2D-NUC.

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

[0426] FIG. 92 is a diagram showing the coordinates of QPSK-UC signal points used for all coding rates of LDPC codes specified in ATSC3.0 when the modulation scheme is QPSK.

[0427] In Figure 92, "Input Data cell y" represents a 2-bit symbol to be mapped to QPSK-UC, and "Constellation point z" represents a 2-bit symbol to be mapped to QPSK-UC. s " is the signal point zs The coordinates of the signal point z s The index s of the signal point z q The index q of the symbol sigma is also used), which represents the discrete time of the symbol (the time interval between one symbol and the next symbol).

[0428] In Figure 92, signal point z s The coordinates of are expressed in the form of complex numbers, and j represents the imaginary unit (√(-1)).

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

[0430] In Figure 93, as in Figure 92, signal point z s The coordinates of are expressed in the form of complex numbers, and j represents the imaginary unit.

[0431] In Figure 93, w#k represents the coordinates of the signal point in the first quadrant of the constellation.

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

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

[0434] An m-bit symbol can be, for example, 0 to 2 mIt can be expressed as an integer value of -1, but now, b=2 m / 4, 0 to 2 m Symbols y(0), y(1), . . . , y(2 m -1) can be classified into four 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).

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

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

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

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

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

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

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

[0442] In FIG. 94, u#k is the signal point z of 1D-NUC. s The real part of the complex number Re(z s ) and imaginary part Im(z s ) and are the components of a vector u=(u0, u1,..., u#V-1) called the position vector. The number V of components u#k of the position vector u is given by the formula V=√(2 m ) / 2.

[0443] FIG. 95 is a diagram showing the relationship between the 1024QAM symbol y and the position vector u (component u#k of the position vector u).

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

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

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

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

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

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

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

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

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

[0453] The transmission system of FIG. 7 can use the constellations defined in ATSC 3.0 as described above.

[0454] 96 to 107 are diagrams showing the coordinates of UC signal points defined in DVB-C.2.

[0455] That is, Figure 96 shows the coordinates z of the signal point of QPSK-UC (UC of QPSK) specified in DVB-C.2. q The real part of Re(z q ) is a diagram showing the coordinates z of the signal point of QPSK-UC defined in DVB-C.2. q Imaginary Part Im(z q ) is a diagram showing the same.

[0456] Figure 98 shows the coordinates z of the signal point of 16QAM-UC (UC of 16QAM) specified in DVB-C.2. q The real part of Re(z q ) is a diagram showing the coordinates z of the 16QAM-UC signal point specified in DVB-C.2. q Imaginary Part Im(z q ) is a diagram showing the same.

[0457] Figure 100 shows the coordinates z of the signal point of 64QAM-UC (UC of 64QAM) specified in DVB-C.2. q The real part of Re(z q ) is a diagram showing the coordinates z of the 64QAM-UC signal point specified in DVB-C.2. q Imaginary Part Im(z q ) is a diagram showing the same.

[0458] Figure 102 shows the coordinates z of the signal point of 256QAM-UC (UC of 256QAM) specified in DVB-C.2. q The real part of Re(z q ) is a diagram showing the coordinates z of the 256QAM-UC signal point specified in DVB-C.2. q Imaginary Part Im(z q) is a diagram showing the same.

[0459] Figure 104 shows the coordinates z of the signal point of 1024QAM-UC (UC of 1024QAM) specified in DVB-C.2. q The real part of Re(z q ) is a diagram showing the coordinates z of the 1024QAM-UC signal point specified in DVB-C.2. q Imaginary Part Im(z q ) is a diagram showing the same.

[0460] Figure 106 shows the coordinates z of the signal point of 4096QAM-UC (UC of 4096QAM) specified in DVB-C.2. q The real part of Re(z q ) is a diagram showing the coordinates z of the 4096QAM-UC signal point specified in DVB-C.2. q Imaginary Part Im(z q ) is a diagram showing the same.

[0461] In addition, in Figures 96 to 107, y i,q is 2 m It represents the (i+1)th bit from the beginning of the m-bit QAM symbol (for example, 2 bits in QPSK). In addition, when transmitting (data mapped to) a UC signal point, the average power of the signal point on the constellation can be normalized. Normalization is performed by taking the root mean square of the absolute values ​​of all of the signal points (coordinates of the signal points) on the constellation as P ave Then, the mean square value P ave Square root of √P ave The reciprocal of 1 / (√P ave ) for each signal point z on the constellation q This can be done by multiplying

[0462] In the transmission system of FIG. 7, the UC defined in DVB-C.2 as described above can be used.

[0463] That is, for the new LDPC codes (corresponding to the check matrix initial value tables) in Figures 30 to 85 where the code length N is 69120 bits and the coding rate r is 2 / 16, 3 / 16, 4 / 16, 5 / 16, 6 / 16, 7 / 16, 8 / 16, 9 / 16, 10 / 16, 11 / 16, 12 / 16, 13 / 16, and 14 / 16, the UCs shown in Figures 96 to 107 can be used.

[0464] Figures 108 to 116 are diagrams showing examples of coordinates of other NUC signal points that can be used for the new LDPC codes in Figures 30 to 85, where the code length N is 69120 bits and the coding rate r is 2 / 16, 3 / 16, 4 / 16, 5 / 16, 6 / 16, 7 / 16, 8 / 16, 9 / 16, 10 / 16, 11 / 16, 12 / 16, 13 / 16, and 14 / 16.

[0465] That is, FIG. 108 is a diagram showing examples of coordinates of signal points of 16QAM-2D-NUC that can be used for each of the new LDPC codes with a code length N of 69120 bits and a coding rate r(CR) of 2 / 16, 4 / 16, 6 / 16, 8 / 16, 10 / 16, 12 / 16, and 14 / 16, among the new LDPC codes of FIGS. 30 to 85.

[0466] FIG. 109 is a diagram showing examples of coordinates of 64QAM-2D-NUC signal points that can be used for the new LDPC codes of FIGS. 30 to 85, each having a code length N of 69120 bits and a coding rate r of 3 / 16, 5 / 16, 7 / 16, 9 / 16, 11 / 16, and 13 / 16.

[0467] 110 and 111 are diagrams showing examples of coordinates of signal points of 256QAM-2D-NUC that can be used for the new LDPC codes of FIGS. 30 to 85, each having a code length N of 69120 bits and a coding rate r of 2 / 16, 4 / 16, 6 / 16, 8 / 16, 10 / 16, 12 / 16, and 14 / 16.

[0468] Note that FIG. 111 is a continuation of FIG.

[0469] In Figures 108 to 111, similarly to Figure 93, signal point z s The coordinates of are expressed in the form of complex numbers, and j represents the imaginary unit.

[0470] 108 to 111, w#k represents the coordinates of the signal point in the first quadrant of the constellation, as in FIG. 93.

[0471] Here, as explained in FIG. 93, the m-bit symbol is divided into 0 to 2 m It is expressed as an integer value of -1, and b=2 m / 4, 0 to 2 m Symbols y(0), y(1), . . . , y(2 m -1) can be classified into four 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).

[0472] In Figures 108 to 111, as in Figure 93, the suffix k of w#k takes an integer value ranging from 0 to b-1, and w#k represents the coordinates of the signal point corresponding to symbol y(k) ranging from symbol y(0) to y(b-1).

[0473] Furthermore, in Figures 108 to 111, as in Figure 93, the coordinates of the signal point corresponding to symbol y(k+3b) in the range of symbols y(3b) to y(4b-1) are expressed as -w#k.

[0474] However, in Figure 93, the coordinates of the signal point corresponding to symbol y(k+b) in the range of symbols y(b) to y(2b-1) are represented by -conj(w#k), and the coordinates of the signal point corresponding to symbol y(k+2b) in the range of symbols y(2b) to y(3b-1) are represented by conj(w#k), but in Figures 108 to 111, the sign of conj is reversed.

[0475] That is, in Figures 108 to 111, the coordinates of the signal point corresponding to symbol y(k+b) in the range of symbols y(b) to y(2b-1) are represented by conj(w#k), and the coordinates of the signal point corresponding to symbol y(k+2b) in the range of symbols y(2b) to y(3b-1) are represented by -conj(w#k).

[0476] FIG. 112 is a diagram showing examples of coordinates of 1024QAM-1D-NUC signal points that can be used for the new LDPC codes of FIGS. 30 to 85, each having a code length N of 69120 bits and a coding rate r of 3 / 16, 5 / 16, 7 / 16, 9 / 16, 11 / 16, and 13 / 16.

[0477] That is, FIG. 112 shows the signal point z of 1024QAM-1D-NUC. s The real part of the complex number Re(z s ) and imaginary part Im(z s ) and the position vector u (its component u#k).

[0478] FIG. 113 is a diagram showing the relationship between the 1024QAM symbol y and the position vector u (component u#k) of FIG.

[0479] That is, let us now consider a 10-bit symbol y of 1024QAM, starting from its leading bit (most significant bit), as y 0,s ,y 1,s ,y 2,s ,y 3,s ,y 4,s ,y 5,s ,y 6,s ,y 7,s ,y 8,s ,y 9,s This will be expressed as follows.

[0480] A in Figure 113 shows the odd-numbered 5 bits y of the 10-bit symbol y. 0,s ,y 2,s ,y 4,s ,y 6,s ,y 8,s and the signal point z corresponding to that symbol ys (coordinates) real part Re(z s ) and the position vector u#k.

[0481] B in Figure 113 shows the even-numbered 5 bits y of the 10-bit symbol y. 1,s ,y 3,s ,y 5,s ,y 7,s ,y 9,s and the signal point z corresponding to that symbol y s Imaginary Part Im(z s ) and the position vector u#k.

[0482] The 10-bit symbol y of 1024QAM corresponds to the signal point z of 1024QAM-1D-NUC defined in Figures 112 and 113. s When the signal point z is mapped to s The method for determining the coordinates is the same as that explained in FIGS. 94 and 95, so the explanation will be omitted.

[0483] FIG. 114 is a diagram showing examples of coordinates of 4096QAM-1D-NUC signal points that can be used for the new LDPC codes of FIGS. 30 to 85, each having a code length N of 69120 bits and a coding rate r of 2 / 16, 4 / 16, 6 / 16, 8 / 16, 10 / 16, 12 / 16, and 14 / 16.

[0484] That is, FIG. 114 shows the signal point z of 4096QAM-1D-NUC. s The real part of the complex number Re(z s ) and imaginary part Im(z s ) and the position vector u(u#k).

[0485] 115 and 116 are diagrams showing the relationship between the 4096QAM symbol y and the position vector u (component u#k) of FIG. 114.

[0486] That is, let us now consider a 12-bit symbol y of 4096QAM, starting from its leading bit (most significant bit), as y 0,s ,y 1,s ,y 2,s ,y 3,s ,y 4,s ,y 5,s ,y 6,s ,y 7,s ,y 8,s ,y 9,s ,y 10,s ,y 11,s This will be expressed as follows.

[0487] Figure 115 shows the odd-numbered 6 bits y of the 12-bit symbol y. 0,s ,y 2,s ,y 4,s ,y 6,s ,y 8,s ,y 10,s and the signal point z corresponding to that symbol y s The real part of Re(z s ) and the position vector u#k.

[0488] Figure 116 shows the even-numbered 6 bits y of the 12-bit symbol y. 1,s ,y 3,s ,y 5,s ,y 7,s ,y 9,s ,y 11,s and the signal point z corresponding to that symbol y s Imaginary Part Im(z s ) and the position vector u#k.

[0489] The 12-bit symbol y of 4096QAM corresponds to the signal point z of 4096QAM-1D-NUC defined in Figures 114 to 116. s When the signal point z is mapped to s The method for determining the coordinates is the same as that explained in FIGS. 94 and 95, so the explanation will be omitted.

[0490] When transmitting the NUC signal points (data mapped to them) in Figures 108 to 116, the average power of the signal points on the constellation can be normalized. Normalization is performed by taking the root mean square of the absolute values ​​of all the signal points (coordinates) on the constellation as P ave Then, the mean square value P ave Square root of √P ave The reciprocal of 1 / (√P ave ) for each signal point z on the constellation s In addition, in FIG. 95, odd-numbered bits of symbol y are multiplied by signal point z. s Imaginary Part Im(z s ) and the even-numbered bits of the symbol y correspond to the signal point z s The real part of Re(z s ), but in Figures 113, 115 and 116, the odd-numbered bits of the symbol y correspond to the signal point z s The real part of Re(z s ) and the even-numbered bits of the symbol y correspond to the signal point z s Imaginary Part Im(z s ) is associated with a position vector u#k representing the

[0491] <Block Interleaver 25>

[0492] FIG. 117 is a diagram for explaining the block interleaving performed by the block interleaver 25 in FIG.

[0493] Block interleaving is performed by dividing an LDPC code of one codeword into a part called part 1 and a part called part 2, starting from the beginning.

[0494] If the length (number of bits) of part 1 is represented as Npart1 and the length of part 2 is represented as Npart2, then Npart1+Npart2 is equal to the code length N.

[0495] Conceptually, in block interleaving, columns as storage areas for storing Npart1 / m bits are arranged in one direction (vertical) as a column direction, and m columns, which is equal to the number of bits m of a symbol, are arranged in a row direction perpendicular to the column direction, and each column is divided from the top into small units of 360 bits, which is the unit size P. These small units of columns are also called column units.

[0496] In block interleaving, as shown in Figure 117, part 1 of the LDPC code of one codeword is written from top to bottom (column direction) in the first column unit of the column, moving from left to right towards the column.

[0497] Then, when writing to the first column unit of the rightmost column is completed, as shown in Figure 117, it returns to the leftmost column and writing from top to bottom of the second column unit of the column is performed from left to right column, and so on, and so on, writing part 1 of one codeword LDPC code is performed.

[0498] When writing of part 1 of the LDPC code of one codeword is completed, part 1 of the LDPC code is read out in m-bit units in the row direction from the first row of all m columns, as shown in FIG.

[0499] The m-bit units of part 1 are supplied as m-bit symbols from block interleaver 25 to mapper 117 (FIG. 8).

[0500] Part 1 is read out in m-bit units sequentially moving down the m columns, and when reading of part 1 is completed, part 2 is divided into m-bit units from the beginning and supplied as m-bit symbols from block interleaver 25 to mapper 117.

[0501] Therefore, part 1 is symbolized while being interleaved, and part 2 is symbolized sequentially, separated into m bits, without being interleaved.

[0502] The length of the column, Npart1 / m, is a multiple of 360, which is the unit size P, and an LDPC code of one code word is divided into part 1 and part 2 so that Npart1 / m is a multiple of 360.

[0503] FIG. 118 is a diagram showing examples of part 1 and part 2 of an LDPC code with a code length N of 69120 bits when the modulation scheme is QPSK, 16QAM, 64QAM, 256QAM, 1024QAM, and 4096QAM.

[0504] In Figure 118, when the modulation method is 1024QAM, part 1 is 68,400 bits and part 2 is 720 bits, and when the modulation method is QPSK, 16QAM, 64QAM, 256QAM, or 4096QAM, in all cases part 1 is 69,120 bits and part 2 is 0 bits.

[0505] <Group-wise interleaving>

[0506] FIG. 119 is a diagram for explaining group-wise interleaving performed by the group-wise interleaver 24 in FIG.

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

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

[0509] 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: bit groups 0, 1, 2, 3, and 4. Furthermore, for example, an LDPC code with a code length N of 69120 bits is divided into 192 (=69120 / 360) bit groups: bit groups 0, 1, . . . , 191.

[0510] In the following, the GW pattern will be represented by a sequence of numbers representing the bit group. For example, for an LDPC code with a code length N of 1800 bits, a GW pattern of 4,2,0,3,1 indicates that the sequence of bit groups 0,1,2,3,4 is interleaved (rearranged) into the sequence of bit groups 4,2,0,3,1.

[0511] For example, let us consider the i+1th code bit from the beginning of an LDPC code whose code length N is 1800 bits as x i Let us express it as:

[0512] In this case, according to the group-wise interleaving of GW pattern 4,2,0,3,1, the 1800-bit LDPC code {x0,x1,...,x 1799} is {x 1440 ,x 1441 ,...,x 1799},{x 720 ,x 721 ,...,x 1079},{x0,x1,...,x 359},{x 1080 ,x 1081 ,...,x 1439},{x 360 ,x 361 ,...,x 719} are interleaved.

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

[0514] <Example of GW Pattern for LDPC Code>

[0515] FIG. 120 is a diagram showing a first example of the GW pattern for an LDPC code with a code length N of 69,120 bits.

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

[0517] FIG. 121 is a diagram showing a second example of a GW pattern for an LDPC code having a code length N of 69120 bits.

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

[0519] FIG. 122 is a diagram illustrating a third example of a GW pattern for an LDPC code having a code length N of 69120 bits.

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

[0521] FIG. 123 is a diagram showing a fourth example of a GW pattern for an LDPC code having a code length N of 69120 bits.

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

[0523] FIG. 124 is a diagram illustrating a fifth example of a GW pattern for an LDPC code having a code length N of 69120 bits.

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

[0525] FIG. 125 is a diagram illustrating a sixth example of a GW pattern for an LDPC code having a code length N of 69120 bits.

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

[0527] FIG. 126 is a diagram illustrating a seventh example of a GW pattern for an LDPC code having a code length N of 69120 bits.

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

[0529] FIG. 127 is a diagram illustrating an eighth example of a GW pattern for an LDPC code having a code length N of 69120 bits.

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

[0531] FIG. 128 is a diagram illustrating a ninth example of a GW pattern for an LDPC code having a code length N of 69120 bits.

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

[0533] FIG. 129 is a diagram illustrating a tenth example of a GW pattern for an LDPC code having a code length N of 69120 bits.

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

[0535] FIG. 130 is a diagram showing an eleventh example of a GW pattern for an LDPC code with a code length N of 69120 bits.

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

[0537] FIG. 131 is a diagram illustrating a twelfth example of a GW pattern for an LDPC code having a code length N of 69120 bits.

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

[0539] FIG. 132 is a diagram illustrating a thirteenth example of a GW pattern for an LDPC code having a code length N of 69120 bits.

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

[0541] FIG. 133 is a diagram illustrating a fourteenth example of a GW pattern for an LDPC code having a code length N of 69120 bits.

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

[0543] FIG. 134 is a diagram illustrating a fifteenth example of a GW pattern for an LDPC code having a code length N of 69120 bits.

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

[0545] FIG. 135 is a diagram illustrating a 16th example of a GW pattern for an LDPC code having a code length N of 69120 bits.

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

[0547] FIG. 136 is a diagram illustrating a 17th example of a GW pattern for an LDPC code having a code length N of 69120 bits.

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

[0549] FIG. 137 is a diagram illustrating an 18th example of a GW pattern for an LDPC code having a code length N of 69120 bits.

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

[0551] FIG. 138 is a diagram illustrating a 19th example of a GW pattern for an LDPC code having a code length N of 69120 bits.

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

[0553] FIG. 139 is a diagram showing a twentieth example of a GW pattern for an LDPC code having a code length N of 69120 bits.

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

[0555] FIG. 140 is a diagram showing a 21st example of a GW pattern for an LDPC code with a code length N of 69120 bits.

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

[0557] FIG. 141 is a diagram illustrating a 22nd example of a GW pattern for an LDPC code having a code length N of 69120 bits.

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

[0559] FIG. 142 is a diagram illustrating a 23rd example of a GW pattern for an LDPC code having a code length N of 69120 bits.

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

[0561] FIG. 143 is a diagram illustrating a 24th example of a GW pattern for an LDPC code having a code length N of 69120 bits.

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

[0563] FIG. 144 is a diagram illustrating a 25th example of a GW pattern for an LDPC code having a code length N of 69120 bits.

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

[0565] FIG. 145 is a diagram illustrating a 26th example of a GW pattern for an LDPC code having a code length N of 69120 bits.

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

[0567] FIG. 146 is a diagram illustrating a 27th example of a GW pattern for an LDPC code having a code length N of 69120 bits.

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

[0569] FIG. 147 is a diagram illustrating a 28th example of a GW pattern for an LDPC code having a code length N of 69120 bits.

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

[0571] FIG. 148 is a diagram illustrating a 29th example of a GW pattern for an LDPC code having a code length N of 69120 bits.

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

[0573] FIG. 149 is a diagram showing a 30th example of a GW pattern for an LDPC code having a code length N of 69120 bits.

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

[0575] FIG. 150 is a diagram showing a 31st example of a GW pattern for an LDPC code with a code length N of 69120 bits.

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

[0577] FIG. 151 is a diagram illustrating a 32nd example of a GW pattern for an LDPC code having a code length N of 69120 bits.

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

[0579] FIG. 152 is a diagram illustrating a 33rd example of a GW pattern for an LDPC code having a code length N of 69120 bits.

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

[0581] FIG. 153 is a diagram illustrating a 34th example of a GW pattern for an LDPC code having a code length N of 69120 bits.

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

[0583] FIG. 154 is a diagram illustrating a 35th example of a GW pattern for an LDPC code having a code length N of 69120 bits.

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

[0585] FIG. 155 is a diagram illustrating a 36th example of a GW pattern for an LDPC code having a code length N of 69120 bits.

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

[0587] FIG. 156 is a diagram illustrating a 37th example of a GW pattern for an LDPC code having a code length N of 69120 bits.

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

[0589] FIG. 157 is a diagram illustrating a 38th example of a GW pattern for an LDPC code having a code length N of 69120 bits.

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

[0591] FIG. 158 is a diagram illustrating a 39th example of a GW pattern for an LDPC code having a code length N of 69120 bits.

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

[0593] FIG. 159 is a diagram showing a 40th example of a GW pattern for an LDPC code having a code length N of 69120 bits.

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

[0595] FIG. 160 is a diagram showing a 41st example of a GW pattern for an LDPC code having a code length N of 69120 bits.

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

[0597] FIG. 161 is a diagram showing a 42nd example of a GW pattern for an LDPC code having a code length N of 69120 bits.

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

[0599] FIG. 162 is a diagram showing a 43rd example of a GW pattern for an LDPC code having a code length N of 69120 bits.

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

[0601] FIG. 163 is a diagram showing a 44th example of a GW pattern for an LDPC code having a code length N of 69120 bits.

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

[0603] FIG. 164 is a diagram illustrating a 45th example of a GW pattern for an LDPC code having a code length N of 69120 bits.

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

[0605] FIG. 165 is a diagram showing a 46th example of a GW pattern for an LDPC code having a code length N of 69120 bits.

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

[0607] FIG. 166 is a diagram showing a 47th example of a GW pattern for an LDPC code having a code length N of 69120 bits.

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

[0609] FIG. 167 is a diagram showing a 48th example of a GW pattern for an LDPC code having a code length N of 69120 bits.

[0610] According to the GW pattern in Figure 167, the sequence of bit groups 0 to 191 of the 69120-bit LDPC code is 31, 178, 143, 125, 159, 168, 34, 127, 158, 157, 21, 124, 153, 162, 59, 156, 165, 40, 108, 43, 98, 119, 33, 13, 175, 166, 117, 25, 63, 111, 74, 1, 38, 169, 131, 100, 164, 0, 171, 101, 151, 113, 20, 185, 17, 86, 146, 11, 12, 19, 145, 85, 3, 80, 133, 93, 10, 72, 152, 172, 140, 45, 115, 79, 161, 39, 99, 5, 37, 110, 155, 170, 123, 70, 52, 81, 65, 160, 132, 103, 9, 88, 15, 130, 71, 129, 177, 128, 121, 150, 36, 35, 163, 83, 142, 105, 48, 64, 82, 46, 148, 138, 147, 149, 27, 56, 47, 50, 42, 54, 182, 23, 97, 89, 167, 141, 75, 32, 118, 44, 96, 66, 73, 190, 181, 191, 92, 53, 87, 176,...

Claims

1. a coding unit that performs LDPC coding based on a check matrix of an LDPC code having a code length N of 69120 bits and a coding rate r of 14 / 16; a group-wise interleaving unit that performs group-wise interleaving of the LDPC code in units of 360-bit bit groups; a mapping unit that maps the LDPC code to one of 256 signal points of 2D-NUC (Non-Uniform Constellation) of 256QAM in 8-bit units; 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 i. 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 Interleaved in a sequence of the LDPC code includes information bits and parity bits; the check matrix includes an information matrix portion corresponding to the information bits and a parity matrix portion corresponding to the parity bits, the information matrix section is represented by a check matrix initial value table, The parity check matrix initial value table is a table representing positions of elements of 1 in the information matrix section for every 360 columns, 387 648 945 3023 3889 4856 5002 5167 6868 7477 7590 8165 8354 42 406 1279 1968 3016 4196 4599 4996 5019 6350 6785 7051 8529 534 784 1034 1160 2530 5033 5171 5469 6167 6372 6913 7718 8621 944 2506 2806 3149 3559 5101 6076 6083 6092 6147 6866 7908 8155 308 1869 1888 2569 3297 4742 5232 5442 6135 6814 7284 8238 8405 34 464 667 899 2421 3425 5382 6258 6373 6399 6489 7367 7922 2276 3014 3525 3829 4135 4276 4611 4733 4738 4956 6025 7152 8155 1047 1370 2406 2819 4600 4991 5017 5590 6199 6483 6556 6834 7760 66 380 2033 3698 4068 6096 6223 6238 6757 7541 7641 7677 8595 562 697 782 808 921 1703 3032 4300 7027 7481 7839 8160 8526 236 962 1557 2023 2135 2190 2892 3072 4523 6254 6838 7209 7381 196 1167 1179 1426 1675 1763 2345 2560 2613 5024 5761 6522 7973 512 822 1778 1924 2610 3445 4570 4805 5263 5299 8439 8448 8464 1923 2270 3204 3698 4456 4522 4601 5161 5207 6260 6310 6441 6851 104 281 622 1276 2172 2334 2731 3417 3854 4698 8095 8195 8333 451 528 1269 2169 2274 2393 3853 5002 5543 6121 6351 7364 8139 1685 2675 2790 2953 3103 3560 4336 5372 5495 5568 6429 6492 8206 604 1190 1279 2427 2714 3283 3312 3855 4566 6045 6664 6788 8317 338 917 1873 2102 2561 2655 4635 4765 5370 6249 6724 7668 8456 184 1166 1583 1859 2376 2521 3093 4181 4713 4926 5146 6070 8004 175 1227 2367 3402 3628 3982 4265 4282 4355 5972 6434 7280 7765 801 922 1029 1531 1606 3170 3824 4358 4732 4849 5225 6759 8183 509 1507 1704 1765 2183 2574 3271 4050 4299 4964 5968 6324 7091 567 795 1376 2390 2767 3424 5195 6355 6726 7607 8346 8352 308 1060 1973 2364 2937 3526 4221 4745 5185 5845 6146 7762 323 590 732 917 2636 3008 3792 3990 4322 4893 5211 8014 471 1249 1674 1841 2567 3124 3130 4885 5575 7521 7648 8227 1582 1669 1772 2386 3340 3387 3881 4322 6018 6055 6488 7177 976 1003 2127 3575 3816 6225 7404 7499 7542 8237 8421 8630 675 961 1957 3825 3858 4646 5248 5801 5940 6533 7040 8037 79 639 1363 1436 1763 2570 3874 4876 6870 6886 7104 8399 20 297 1330 2264 3287 3534 4441 4746 6569 6971 6976 8179 482 1125 1589 2892 3759 3871 4635 6038 6214 6796 6816 7621 1127 3336 3867 3929 4269 4794 5054 5842 6471 6547 7039 8560 217 1521 1983 8283 3731 4402 208 6703 242 4988 4170 5038 4108 8035 3301 8543 3168 8249 5028 5838 3470 8597 2901 5264 2505 4505 934 5117 1712 5819 3165 7273 3274 6115 4576 6330 7327 5380 6732 8439 2474 3723 7782 384 2783 5846 1453 4436 6625 3220 4261 4835 163 3117 7554 502 2119 4059 2200 4263 4930 2378 6294 7713 743 5501 6809 1364 6062 7808 4680 6468 7895 3469 3602 7304 1609 5386 5647 267 2921 3206 2565 3020 6269 1651 5224 5718 1128 5058 8579 286 3396 7660 1497 5171 6519 1894 6349 7924 1306 7744 8083 3096 3438 3836 2556 7409 8570 3273 4245 7935 1633 2023 3125 584 4914 6062 2015 2915 3435 1457 6366 6461 23 3576 8132 5322 6300 6520 5715 7113 7822 2044 5053 6607 63 5432 7850 5353 6355 8637 346 590 2648 4780 5997 6991 2556 2583 6537 661 2497 8350 7610 8307 8441 671 860 5986 1133 3158 5891 4360 5802 6547 4782 5688 6955 447 5030 6268 1501 5163 7232 1133 2743 3214 959 4100 7554 5712 7643 8385 1442 3180 8008 697 3078 8421 137 922 5123 597 2879 6340 824 2071 7882 1827 4411 5941 3846 5970 6398 1561 1580 7668 4335 6936 8042 4504 5309 6737 1846 3273 3333 272 4885 6718 1835 4761 6931 2141 3760 5129 3975 5012 6504 1258 2822 6030 242 4947 7668 559 6100 8425 1655 1962 4401 2369 2476 2765 114 156 3195 1651 4154 4448 4669 6064 7317 4988 5567 6697 2963 5578 5679 2064 2286 7790 289 4639 7582 1258 4312 5340 2428 4219 7268 1752 2321 6806 118 7302 8603 4170 4280 4445 2207 5067 7257 2 55 7413 1141 4791 7149 3407 5649 8075 2773 3198 3720 6970 7222 8633 2498 4764 5281 1048 2093 5031 2500 2851 8396 1694 3795 6666 2565 3343 4688 4228 4374 5947 2267 6745 7172 175 2662 3926 90 1517 6056 4069 5439 7648 1679 3394 4707 2136 4553 8265 482 2100 2302 3306 3729 8063 5263 7710 8240 1001 1335 4500 576 6736 7250 181 3601 3755 5899 7515 7714 1181 5332 7197 542 1150 1196 1386 2156 5873 656 3019 3213 263 1117 5957 4495 5904 6462 2547 2786 4215 4954 5848 6225 940 4478 7633 2124 3347 7069 is Transmitting device A group-wise deinterleaving unit is provided which returns the arrangement of the LDPC codes after group-wise interleaving obtained from the data transmitted from Receiving device.

2. a coding unit that performs LDPC coding based on a check matrix of an LDPC code having a code length N of 69120 bits and a coding rate r of 14 / 16; a group-wise interleaving unit that performs group-wise interleaving of the LDPC code in units of 360-bit bit groups; a mapping unit that maps the LDPC code to one of 256 signal points of 2D-NUC (Non-Uniform Constellation) of 256QAM in 8-bit units; 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 i. 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 Interleaved in a sequence of the LDPC code includes information bits and parity bits; the check matrix includes an information matrix portion corresponding to the information bits and a parity matrix portion corresponding to the parity bits, the information matrix section is represented by a check matrix initial value table, The parity check matrix initial value table is a table representing positions of elements of 1 in the information matrix section for every 360 columns, 387 648 945 3023 3889 4856 5002 5167 6868 7477 7590 8165 8354 42 406 1279 1968 3016 4196 4599 4996 5019 6350 6785 7051 8529 534 784 1034 1160 2530 5033 5171 5469 6167 6372 6913 7718 8621 944 2506 2806 3149 3559 5101 6076 6083 6092 6147 6866 7908 8155 308 1869 1888 2569 3297 4742 5232 5442 6135 6814 7284 8238 8405 34 464 667 899 2421 3425 5382 6258 6373 6399 6489 7367 7922 2276 3014 3525 3829 4135 4276 4611 4733 4738 4956 6025 7152 8155 1047 1370 2406 2819 4600 4991 5017 5590 6199 6483 6556 6834 7760 66 380 2033 3698 4068 6096 6223 6238 6757 7541 7641 7677 8595 562 697 782 808 921 1703 3032 4300 7027 7481 7839 8160 8526 236 962 1557 2023 2135 2190 2892 3072 4523 6254 6838 7209 7381 196 1167 1179 1426 1675 1763 2345 2560 2613 5024 5761 6522 7973 512 822 1778 1924 2610 3445 4570 4805 5263 5299 8439 8448 8464 1923 2270 3204 3698 4456 4522 4601 5161 5207 6260 6310 6441 6851 104 281 622 1276 2172 2334 2731 3417 3854 4698 8095 8195 8333 451 528 1269 2169 2274 2393 3853 5002 5543 6121 6351 7364 8139 1685 2675 2790 2953 3103 3560 4336 5372 5495 5568 6429 6492 8206 604 1190 1279 2427 2714 3283 3312 3855 4566 6045 6664 6788 8317 338 917 1873 2102 2561 2655 4635 4765 5370 6249 6724 7668 8456 184 1166 1583 1859 2376 2521 3093 4181 4713 4926 5146 6070 8004 175 1227 2367 3402 3628 3982 4265 4282 4355 5972 6434 7280 7765 801 922 1029 1531 1606 3170 3824 4358 4732 4849 5225 6759 8183 509 1507 1704 1765 2183 2574 3271 4050 4299 4964 5968 6324 7091 567 795 1376 2390 2767 3424 5195 6355 6726 7607 8346 8352 308 1060 1973 2364 2937 3526 4221 4745 5185 5845 6146 7762 323 590 732 917 2636 3008 3792 3990 4322 4893 5211 8014 471 1249 1674 1841 2567 3124 3130 4885 5575 7521 7648 8227 1582 1669 1772 2386 3340 3387 3881 4322 6018 6055 6488 7177 976 1003 2127 3575 3816 6225 7404 7499 7542 8237 8421 8630 675 961 1957 3825 3858 4646 5248 5801 5940 6533 7040 8037 79 639 1363 1436 1763 2570 3874 4876 6870 6886 7104 8399 20 297 1330 2264 3287 3534 4441 4746 6569 6971 6976 8179 482 1125 1589 2892 3759 3871 4635 6038 6214 6796 6816 7621 1127 3336 3867 3929 4269 4794 5054 5842 6471 6547 7039 8560 217 1521 1983 8283 3731 4402 208 6703 242 4988 4170 5038 4108 8035 3301 8543 3168 8249 5028 5838 3470 8597 2901 5264 2505 4505 934 5117 1712 5819 3165 7273 3274 6115 4576 6330 7327 5380 6732 8439 2474 3723 7782 384 2783 5846 1453 4436 6625 3220 4261 4835 163 3117 7554 502 2119 4059 2200 4263 4930 2378 6294 7713 743 5501 6809 1364 6062 7808 4680 6468 7895 3469 3602 7304 1609 5386 5647 267 2921 3206 2565 3020 6269 1651 5224 5718 1128 5058 8579 286 3396 7660 1497 5171 6519 1894 6349 7924 1306 7744 8083 3096 3438 3836 2556 7409 8570 3273 4245 7935 1633 2023 3125 584 4914 6062 2015 2915 3435 1457 6366 6461 23 3576 8132 5322 6300 6520 5715 7113 7822 2044 5053 6607 63 5432 7850 5353 6355 8637 346 590 2648 4780 5997 6991 2556 2583 6537 661 2497 8350 7610 8307 8441 671 860 5986 1133 3158 5891 4360 5802 6547 4782 5688 6955 447 5030 6268 1501 5163 7232 1133 2743 3214 959 4100 7554 5712 7643 8385 1442 3180 8008 697 3078 8421 137 922 5123 597 2879 6340 824 2071 7882 1827 4411 5941 3846 5970 6398 1561 1580 7668 4335 6936 8042 4504 5309 6737 1846 3273 3333 272 4885 6718 1835 4761 6931 2141 3760 5129 3975 5012 6504 1258 2822 6030 242 4947 7668 559 6100 8425 1655 1962 4401 2369 2476 2765 114 156 3195 1651 4154 4448 4669 6064 7317 4988 5567 6697 2963 5578 5679 2064 2286 7790 289 4639 7582 1258 4312 5340 2428 4219 7268 1752 2321 6806 118 7302 8603 4170 4280 4445 2207 5067 7257 2 55 7413 1141 4791 7149 3407 5649 8075 2773 3198 3720 6970 7222 8633 2498 4764 5281 1048 2093 5031 2500 2851 8396 1694 3795 6666 2565 3343 4688 4228 4374 5947 2267 6745 7172 175 2662 3926 90 1517 6056 4069 5439 7648 1679 3394 4707 2136 4553 8265 482 2100 2302 3306 3729 8063 5263 7710 8240 1001 1335 4500 576 6736 7250 181 3601 3755 5899 7515 7714 1181 5332 7197 542 1150 1196 1386 2156 5873 656 3019 3213 263 1117 5957 4495 5904 6462 2547 2786 4215 4954 5848 6225 940 4478 7633 2124 3347 7069 is Transmitting device A group-wise deinterleaving step is provided for returning the arrangement of the LDPC codes after group-wise interleaving obtained from the data transmitted from Receiving method.

Citation Information

Patent Citations

  • Transmitter apparatus and interleaving method thereof

    US20150236816A1

  • Data processing device and data processing method

    WO2016114156A1