# US 2016/0261284 A1 · Transmitter and puncturing method thereof

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

- Number: US 2016/0261284 A1
- Document ID: US20160261284A1
- Status: Published application
- Kind: A1
- Application number: 15/058,364
- Filed: 2016-03-02
- Published: 2016-09-08
- Earliest claimed: 2015-03-02
- 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/US20160261284A1

## CPC

- H03M 13/1148: {Structural properties of the code parity-check or generator matrix}
- H03M 13/611: {Specific encoding aspects, e.g. encoding by means of decoding}
- H04L 1/0045: {Arrangements at the receiver end}
- H04L 1/0057: {Block codes (H04L1/0061, H04L1/0064 take precedence)}
- H04L 1/0065: {Serial concatenated codes}
- H04L 1/0067: {Rate matching (H04L1/0013 and H04L1/08 take precedence)}
- H04L 1/0068: {by puncturing}
- H04L 1/0071: {Use of interleaving (interleaving per se H03M13/27)}
- H03M 13/1102: {Codes on graphs and decoding on graphs, e.g. low-density parity check [LDPC] codes}
- 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/6356: {by repetition or insertion of dummy data, i.e. rate reduction}
- H03M 13/6362: {by puncturing}
- H04L 1/0041: {Arrangements at the transmitter end}
- 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)
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

A transmitter is provided. The transmitter includes: a Low Density Parity Check (LDPC) encoder configured to encode outer-encoded bits to generate an LDPC codeword including LDPC information bits and parity bits; a puncturer configured to puncture some of the parity bits included in the LDPC codeword; and a mapper configured to map the LDPC codeword except the punctured parity bits to symbols for transmission to a receiver, wherein the puncturer calculates a number of parity bits to be punctured among the parity bits included in the LDPC codeword based on a number of the outer-encoded bits, a number of the LDPC information bits, and a minimum number of parity bits to be punctured among the parity bits included in the LDPC codeword.

## Claims

### Claim 1

A transmitter, comprising:
an LDPC encoder configured to encode input bits including outer encoded bits and zero bits to generate parity bits; and
a puncturer configured to puncture some of the parity bits,
wherein the puncturer calculates the number of parity bits to be punctured based on Npunc_temp calculated based on a following equation:
Npunc_temp=└A×(Kldpc−Nouter)┘+B,
where Npunc_temp represents a temporary number of parity bits to be punctured, Nouter represents the number of the outer-encoded bits, Kldpc represents the number of LDPC information bits comprising the outer-encoded bits and zero bits, and A and B represent predetermined constants, and
at least one of the A and B is determined as different value corresponding to different robustness levels at the same modulation order.

### Claim 2 (depends on 1)

The transmitter of claim 1, wherein the at least one of A and B is changed to a different value corresponding to the different robustness level while the same modulation order is used for symbol mapping.

### Claim 3 (depends on 1)

The transmitter of claim 1, wherein the A represents a ratio of the number of parity bits to be punctured to a number of zero bits to be shortened, and the B represents the minimum number of parity bits to be punctured.

### Claim 4 (depends on 1)

The transmitter of claim 1, wherein when A and B have a modulation order of 2, A=0, B=9360, A=0, B=11460, or A=0, B=12360.

### Claim 5 (depends on 1)

The transmitter of claim 1, wherein when A and B have a modulation order of 2, A=2, B=6036 or A=11/16, B=4653.

### Claim 6 (depends on 1)

The transmitter of claim 1, wherein the puncturer calculates NFEC based on a following equation.
N
FEC
=
⌈
N
FEC


_


temp
η
MOD
⌉
×
η
MOD
,
where NFEC represents a number of bits constituting LDPC codeword after puncturing and shortening, NFEC_temp=Nouter+Nldpc_parity−Npunc_temp, Nldpc_parity represents a number of the parity bits generated by the LDPC encoder, and ηMOD represents a modulation order.

### Claim 7 (depends on 6)

The transmitter of claim 6, wherein the puncturer calculates Npunc based on a following equation:
Npunc=Npunch_temp−(NFEC−NFEC_temp),
where Npunc represents the number of parity bits to be punctured.

### Claim 8 (depends on 7)

The transmitter of claim 7, wherein the puncturer punctures the Npunc number of parity bits from a last parity bit of the parity bits.

### Claim 9

A puncturing method of a transmitter, comprising:
encoding input bits including outer encoded bits and zero bits to generate parity bits; and
puncturing some of the parity bits,
wherein the puncturing calculates the number of parity bits to be punctured based on Npunc_temp calculated based on a following equation:
Npunc_temp=└A×(Kldpc−Nouter)┘+B,
where Npunc_temp represents a temporary number of parity bits to be punctured, Nouter represents the number of the outer-encoded bits, Kldpc represents the number of the LDPC information bits comprising the outer-encoded bits and zero bits, and A and B represent predetermined constants
at least one of the A and B is determined as different value corresponding to different robustness levels at the same modulation order.

### Claim 10 (depends on 9)

The method of claim 9, wherein the at least one of A and B is changed to a different value corresponding to the different robustness level while the same modulation order is used for symbol mapping.

### Claim 11 (depends on 9)

The method of claim 9, wherein A represents a ratio of the number of parity bits to be punctured to a number of zero bits to be shortened, and B represents the minimum number of parity bits to be punctured.

### Claim 12 (depends on 9)

The method of claim 9, wherein when A and B have a modulation order of 2, A=0, B=9360, A=0, B=11460, or A=0, B=12360.

### Claim 13 (depends on 9)

The method of claim 9, wherein when A and B have a modulation order of 2, A=2, B=6036 or A=11/16, B=4653.

### Claim 14 (depends on 9)

The method of claim 9, wherein the puncturer calculates NFEC based on a following equation.
N
FEC
=
⌈
N
FEC


_


temp
η
MOD
⌉
×
η
MOD
,
where NFEC represents a number of bits constituting LDPC codeword after puncturing and shortening, NFEC_temp=Nouter+Nldpc_parity−Npunc_temp, Nldpc_parity represents a number of the parity bits generated by the encoding, and ηMOD represents a modulation order.

### Claim 15 (depends on 14)

The method of claim 14, wherein the puncturer calculates Npunc based on a following equation:
Npunc=Npunch_temp−(NFEC−NFEC_temp),
where Npunc represents the number of parity bits to be punctured.

### Claim 16 (depends on 15)

The method of claim 15, wherein the puncturing punctures the Npunc number of parity bits from a last parity bit of the parity bits.

### Claim 17

A transmitter, comprising:
an LDPC encoder configured to encode input bits including zero bits to generate parity bits; and
a puncturer configured to puncture some of the parity bits,
wherein the puncturer calculates the number of punctured parity bits based on Npunc_temp calculated based on a following equation:
Npunc_temp=B,
where the Npunc_temp represents a temporary number of parity bits to be punctured and B represents predetermined constant, and B is determined as different value at different modulation orders.

### Claim 18 (depends on 17)

The transmitter as claimed in claim 17, wherein when a modulation order is 2, B is 9360, 11460 or 12360, when the modulation order is 4, B is 12292, when the modulation order is 6, B is 12350, and when the modulation order is 8, B is 12432 or 12776.