# US 10,771,190 B2 · Transmitter and signal processing method thereof

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 10,771,190 B2
- Document ID: US10771190B2
- Status: Granted
- Kind: B2
- Application number: 16/293,162
- Filed: 2019-03-05
- Published: 2019-06-27
- Granted: 2020-09-08
- Earliest claimed: 2014-12-10
- Assignees: Samsung Electronics Co., Ltd.
- Applicants: Samsung Electronics Co., Ltd.
- Inventors: Se-ho Myung; Kyung-joong Kim; Hong-sil Jeong
- Web page: https://patentgrep.com/patent/US10771190B2

## CPC

- H04L 1/0041: {Arrangements at the transmitter end}
- H03M 13/036: {Heuristic code construction methods, i.e. code construction or code search based on using trial-and-error}
- H03M 13/1165: {QC-LDPC codes as defined for the digital video broadcasting [DVB] specifications, e.g. DVB-Satellite [DVB-S2]}
- H03M 13/255: {with Low Density Parity Check [LDPC] codes}
- H03M 13/27: using interleaving techniques
- H04L 1/0057: {Block codes (H04L1/0061, H04L1/0064 take precedence)}
- H04L 1/0071: {Use of interleaving (interleaving per se H03M13/27)}
- H04L 2001/0093: {Point-to-multipoint}
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- H03M: CODING; DECODING; CODE CONVERSION IN GENERAL (using fluidic means F15C4/00; optical analogue/digital converters G02F7/00; coding, decoding or code conversion, specially adapted for particular applications, see the relevant subclasses, e.g. G01D, G01R, G06F, G06T, G09G, G10L, G11B, G11C, H04B, H04L, H04M, H04N; ciphering or deciphering for cryptography or other purposes involving the need for secrecy G09C)

## Abstract

A transmitter is provided, which includes: an encoder configured to generate a low density parity check (LDPC) codeword comprising information word bits, first parity bits and second parity bits based on a parity check matrix; an interleaver configured to interleave the LDPC codeword; and a constellation mapper configured to map the interleaved LDPC codeword on constellation points, wherein the first parity bits are generated based on one of parity submatrices constituting the parity check matrix and the second parity bits are generated based on another of the parity submatrices constituting the parity check matrix.

## Claims

### Claim 1

A broadcast signal generating and transmitting method, the method comprising:
generating a codeword comprising information bits, first parity bits and second parity bits by encoding the information bits based on a parity check matrix of a low density parity check (LDPC) code;
interleaving the codeword;
mapping bits of the interleaved codeword onto constellation points;
generating a broadcast signal based on the constellation points using an orthogonal frequency division multiplexing (OFDM) scheme; and
transmitting the broadcast signal for a receiver,
wherein the parity check matrix comprises an information matrix part and a parity matrix part,
wherein the information matrix part comprises a first information submatrix with a quasi-cyclic structure and a second information submatrix with the quasi-cyclic structure,
wherein the parity matrix part comprises a first parity submatrix with a dual diagonal matrix structure and a second parity submatrix with an identity matrix structure,
wherein the first parity bits are generated based on the first parity submatrix, and
wherein the second parity bits are generated based on the second parity submatrix.

### Claim 2 (depends on 1)

The method of claim 1, wherein each of the first and second information submatrices comprises a plurality of column groups each of which comprises M number of columns.

### Claim 3 (depends on 2)

The method of claim 2, wherein in each column group of the first information submatrix, a column is cyclic-shifted from a previous column by a first cyclic shift value, and in each column group of the second information submatrix, a column is cyclic-shifted from a previous column by a second cyclic shift value.

### Claim 4 (depends on 3)

The method of claim 3, wherein, in each of the first and second information submatrices, an index of a row having a kth 1 in a jth column in an ith column group is determined based on a number of rows having 1 in a column, a number of columns in each column group, a number of information bits, a number of the first parity bits, a number of the second parity bits, and the first and second cyclic shift values, and
wherein i, j and k are an integer value greater than or equal to 0.

### Claim 5 (depends on 4)

The method of claim 4, wherein if an index of a row in a 0th column of a given column group is less than the number of the first parity bits, indexes of rows having 1 in a next column group are determined by the first cyclic-shift value, and
wherein if the index of the row in the 0th column of the given column group is greater than or equal to the number of the first parity bits, the indexes of the rows having 1 in the next column group are determined by the second cyclic-shift value.

### Claim 6 (depends on 2)

The method of claim 2, wherein M is a common divisor of Nldpc1, Nldpc2, and Kldpc, and satisfies a following equation:
M=(Nldpc1−Kldpc)/Qldpc1=(Nldpc2−Kldpc)/Qldpc2,
where, Qldpc1 is a cyclic-shift value in one of the first and second information submatrices, Nldpc1-Kldpc is a number of rows constituting the one information submatrix, Qldpc2 is a cyclic-shift value in the other of the first and second information submatrices, and Nldpc2-Kldpc is a number of rows constituting the other information submatrix.

### Claim 7 (depends on 2)

The method of claim 2, wherein each of the first and second information submatrices defines positions of 1 in a 0th column of each of the plurality of the column groups according to a following table:
i
Indexes of rows having 1 on 0th column of ith column group
0
108 297 703 742 1345 1443 1495 1628 1812 2341 2559 2669 2810
2877 3442 3690 3755 3904 4264 7544 10480 15676 16095 17842
1
180 211 477 788 824 1090 1272 1578 1685 1948 2050 2195 2233
2546 2757 2946 3147 3299 3544 8426 11058 13722 17105 19486
2
627 741 1135 1157 1226 1333 1378 1427 1454 1696 1757 1772
2099 2208 2592 3354 3580 4066 4242 5032 5554 14994 17211
18329
3
9 795 959 989 1006 1032 1135 1209 1382 1484 1703 1855 1985
2043 2629 2845 3136 3450 3742 7591 7738 11448 15021 19919
4
230 413 801 829 1108 1170 1291 1759 1793 1827 1976 2000 2423
2466 2917 3010 3600 3782 4143 5443 10754 14142 17813 20453
5
56 142 236 381 1050 1141 1372 1627 1985 2247 2340 3023 3434
3519 3957 4013 4142 4164 4279 7097 10152 12882 14468 17279
6
298 1211 2548 3643 4875 7960 11672 16044 16878
7
73 1070 1614 1748 6216 7768 13481 15225 18512
8
1439 2141 3614 11710 14771 15515 16418 18167
9
284 1564 2629 8508 8623 9598 15713 18675
10
607 660 855 9991 10233 11029 18440 19224
11
1195 2037 2753 4972 6032 6590 6701 7448
12
49 1198 2562 10955 13383 14136 16605 19071
13
296 1145 3540 4468 16304 16899 19470 20306
14
1516 2315 2382 6031 6496 10185 12697 19527
15
154 722 4016 5940 7936 13893 14650 18952
16
759 2375 3825 8334 9484 10722 14742 14856
17
162 194 1749 7475 10487 13654 17265 19858
18
2335 2422 2632 5410 6559 12929 13570 14339 16186
19
6 1172 2583 5282 9339 11317 12459 15836 17283
20
726 1325 1428 8680 9393 13667 14092 15793 20322
21
985 2708 2769 4760 5960 13632 13942 17734 18171
22
255 2801 3181 4325 6797 7194 12085 13798 13909
23
2979 3720 4090 4341 4846 13148 13268 17081 19360
24
208 1428 4094 4582 7181 8751 12464 18669 20239
25
199 3743 3757 4834 5793 9516 10628 10959 19661
26
1229 2059 4282 7520 10884 11556 12589 14628 16017
27
458 1100 1387 6932 9777 14498 14857 16780 20040
28
1199 2481 3284 4506 5623 7940 15787 19015 19478
29
1161 1467 4060 5742 10620 11006 14891 18058 18640
30
959 3014 4144 11555 15242 16177 16754 17443 17761
31
2666 3960 4125 6679 6946 9332 10188 10469 18904
32
2809 3834 4318 7434 8130 15391 15818 16919 19181.

### Claim 8 (depends on 1)

The method of claim 1, wherein the generating generates the first parity bits based on indexes of rows having 1 in a 0th column in an 0th column group, and
wherein each of the first parity bits is generated by a binary operation between the each parity bit and an immediately previous parity bit.

### Claim 9 (depends on 1)

The method of claim 1, wherein the generating generates the first parity bits by using a following equation:
pi=pi⊕pi−1 (i=1,2, . . . ,Nldpc−Kldpc−1)
and generate the second parity bits by using a following equation:
pi=pi⊕pi−1 (i=Nldpc1−Kldpc,Nldpc1−Kldpc+1, . . . ,Nldpc−Kldpc−1)
where Nldpc is a length of the codeword, Kldpc is a length of the information bits constituting the codeword, and Nldpc1-Kldpc is a length of the first parity bits.

### Claim 10 (depends on 1)

The method of claim 1,
wherein the second parity bits are generated based on the second parity submatrix having the identity matrix structure.

### Claim 11 (depends on 1)

The method of claim 1, wherein the interleaving comprises:
interleaving the information bits and the first parity bits; and
interleaving the second parity bits.

### Claim 12 (depends on 11)

The method of claim 11, wherein the mapping comprises:
mapping the interleaved information bits and the first parity bits on first constellation points; and
mapping the interleaved second parity bits on second constellation points.

### Claim 13 (depends on 12)

The method of claim 12, further comprising:
outputting certain bits from the information bits and the first parity bits, and
wherein the certain bits from the information bits and the first parity bits, along with the second parity bits, are mapped on the second constellation points.

### Claim 14 (depends on 13)

The method of claim 13, wherein a number of the second parity bits are smaller than a number of the first parity bits.

### Claim 15 (depends on 13)

The method of claim 13, wherein the outputting comprises selecting the certain bits from the information bits and the first parity bits based on a ratio of a sum of a number of the information bits and a number of the first parity bits, to a number of the second parity bits, and outputting the selected bits.

### Claim 16 (depends on 1)

The method of claim 1, wherein the first information submatrix is based on a first parameter, the second information submatrix is based on a second parameter, and the first parameter and the second parameter are different from each other.

### Claim 17 (depends on 16)

The method of claim 16, wherein the first parameter and the second parameter are dependent upon a code rate of the LDPC code.