# US 2018/0323807 A1 · Method and apparatus for channel encoding and decoding in communication or broadcasting system

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

- Number: US 2018/0323807 A1
- Document ID: US20180323807A1
- Status: Published application
- Kind: A1
- Application number: 15/971,877
- Filed: 2018-05-04
- Published: 2018-11-08
- Earliest claimed: 2017-05-04
- Assignees: Samsung Electronics Co., Ltd.
- Applicants: Samsung Electronics Co., Ltd.
- Inventors: Seokki AHN; Kyungjoong KIM; Seho MYUNG; Hongsil JEONG; Min JANG
- Web page: https://patentgrep.com/patent/US20180323807A1

## CPC

- H03M 13/255: {with Low Density Parity Check [LDPC] codes}
- H03M 13/036: {Heuristic code construction methods, i.e. code construction or code search based on using trial-and-error}
- H03M 13/1111: {Soft-decision decoding, e.g. by means of message passing or belief propagation algorithms}
- H03M 13/116: {Quasi-cyclic LDPC [QC-LDPC] codes, i.e. the parity-check matrix being composed of permutation or circulant sub-matrices}
- H03M 13/1188: {wherein in the part with the double-diagonal at least one column has an odd column weight equal or greater than three}
- H03M 13/2906: {using block codes (H03M13/2957 takes precedence)}
- H03M 13/618: {Shortening and extension of codes}
- H03M 13/6356: {by repetition or insertion of dummy data, i.e. rate reduction}
- H03M 13/6393: {Rate compatible low-density parity check [LDPC] codes}
- H03M 13/6516: {Support of multiple code parameters, e.g. generalized Reed-Solomon decoder for a variety of generator polynomials or Galois fields}
- H04L 1/0009: {by adapting the channel coding (H04L1/1812 takes precedence)}
- H04L 1/0041: {Arrangements at the transmitter end}
- H04L 1/0045: {Arrangements at the receiver end}
- H04L 1/0057: {Block codes (H04L1/0061, H04L1/0064 take precedence)}
- H04L 1/0068: {by puncturing}
- H04L 1/0075: {Transmission of coding parameters to receiver (H04L1/0023 takes precedence)}
- H03M 13/09: Error detection only, e.g. using cyclic redundancy check [CRC] codes or single parity bit
- 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

The present disclosure relates to a pre-5th-Generation (5G) or 5G communication system to be provided for supporting higher data rates Beyond 4th-Generation (4G) communication system such as Long Term Evolution (LTE). A channel encoding method in a communication or broadcasting system includes identifying an input bit size, determining a block size (Z), determining an LDPC sequence for LDPC encoding, and performing the LDPC encoding based on the LDPC sequence and the block size.

## Claims

### Claim 1

A channel encoding method of a transmitter in a communication system, the method comprising:
performing low density parity check (LDPC) encoding for a bit sequence based on first information, the first information being identified based on second information and third information; and
transmitting the encoded bit sequence to a receiver, and
wherein the second information indicates information on non-zero blocks in the first information, and
wherein the third information indicates information on values associated with the non-zero blocks.

### Claim 2 (depends on 1)

The method of claim 1, further comprising:
determining a size of the bit sequence to which the LDPC encoding is to be applied;
determining a block size (Z), based on the bit sequence size.

### Claim 3 (depends on 1)

The method of claim 1, wherein the second information includes thirty-two rows corresponding to a sequence given below:
0 1 2 3 6 9 10 11
0 3 4 5 6 7 8 9 11 12
0 1 3 4 8 10 12 13
1 2 4 5 6 7 8 9 10 13
0 1 11 14
0 1 5 7 11 15
0 5 7 9 11 16
1 5 7 11 13 17
0 1 12 18
1 8 10 11 19
0 1 6 7 20
0 7 9 13 21
1 3 11 22
0 1 8 13 23
1 6 11 13 24
0 10 11 25
1 9 11 12 26
1 5 11 12 27
0 6 7 28
0 1 10 29
1 4 11 30
0 8 13 31
1 2 32
0 3 5 33
1 2 9 34
0 5 35
2 7 12 13 36
0 6 37
1 2 5 38
0 4 39
2 5 7 9 40
1 13 41.

### Claim 4 (depends on 2)

The method of claim 2, wherein the block size (Z) is determined as one of values given below:
Z1′={3, 6, 12, 24, 48, 96, 192, 384}
Z2′={11, 22, 44, 88, 176, 352}
Z3′={5, 10, 20, 40, 80, 160, 320}
Z4′={9, 18, 36, 72, 144, 288}
Z5′={2, 4, 8, 16, 32, 64, 128, 256}
Z6′={15, 30, 60, 120, 240}
Z7′={7, 14, 28, 56, 112, 224}
Z8′={13, 26, 52, 104, 208}.

### Claim 5 (depends on 2)

The method of claim 2, wherein a non-zero block is a circulant permutation matrix determined based on a result of a modulo operation between the block size (Z) and an exponent value indicated by the third information.

### Claim 6 (depends on 1)

The method of claim 1, wherein the second information is capable of indicating positions of the non-zero blocks of up to 42 rows and 52 columns.

### Claim 7

A channel decoding method of a receiver in a communication system, the method comprising:
performing low density parity check (LDPC) decoding for a demodulated received signal based on first information, the first information being identified based on second information and third information, and
wherein the second information indicates information on non-zero blocks in the first information, and
wherein the third information indicates information on values associated with the non-zero blocks.

### Claim 8 (depends on 7)

The method of claim 7, further comprising:
determining a block size (Z) for the LDPC decoding.

### Claim 9 (depends on 7)

The method of claim 7, wherein the second information includes thirty-two rows corresponding to a sequence given below:
0 1 2 3 6 9 10 11
0 3 4 5 6 7 8 9 11 12
0 1 3 4 8 10 12 13
1 2 4 5 6 7 8 9 10 13
0 1 11 14
0 1 5 7 11 15
0 5 7 9 11 16
1 5 7 11 13 17
0 1 12 18
1 8 10 11 19
0 1 6 7 20
0 7 9 13 21
1 3 11 22
0 1 8 13 23
1 6 11 13 24
0 10 11 25
1 9 11 12 26
1 5 11 12 27
0 6 7 28
0 1 10 29
1 4 11 30
0 8 13 31
1 2 32
0 3 5 33
1 2 9 34
0 5 35
2 7 12 13 36
0 6 37
1 2 5 38
0 4 39
2 5 7 9 40
1 13 41.

### Claim 10 (depends on 8)

The method of claim 8, wherein the block size (Z) is determined as one of values given below:
Z1′={3, 6, 12, 24, 48, 96, 192, 384}
Z2′={11, 22, 44, 88, 176, 352}
Z3′={5, 10, 20, 40, 80, 160, 320}
Z4′={9, 18, 36, 72, 144, 288}
Z5′={2, 4, 8, 16, 32, 64, 128, 256}
Z6′={15, 30, 60, 120, 240}
Z7′={7, 14, 28, 56, 112, 224}
Z8′={13, 26, 52, 104, 208}.

### Claim 11 (depends on 8)

The method of claim 8, wherein a non-zero block is a circulant permutation matrix determined based on a result of a modulo operation between the block size (Z) and an exponent value indicated by the third information.

### Claim 12 (depends on 7)

The method of claim 7, wherein the second information is capable of indicating positions of the non-zero blocks of up to 42 rows and 52 columns.

### Claim 13

A transmitter performing channel encoding in a communication system, the transmitter comprising:
a controller configured to control to: perform low density parity check (LDPC) encoding for a bit sequence based on first information, the first information being identified based on second information and third information, and
a transceiver configured to transmit the encoded bit sequence to a receiver,
wherein the second information indicates information on non-zero blocks in the first information, and
wherein the third information indicates information on values associated with the non-zero blocks.

### Claim 14 (depends on 13)

The transmitter of claim 13, wherein the controller is further configured to control to:
determine a size of the bit sequence to which the LDPC encoding is to be applied, determine a block size (Z), based on the bit sequence size.

### Claim 15 (depends on 13)

The transmitter of claim 13, wherein the second information includes thirty-two rows corresponding to a sequence given below:
0 1 2 3 6 9 10 11
0 3 4 5 6 7 8 9 11 12
0 1 3 4 8 10 12 13
1 2 4 5 6 7 8 9 10 13
0 1 11 14
0 1 5 7 11 15
0 5 7 9 11 16
1 5 7 11 13 17
0 1 12 18
1 8 10 11 19
0 1 6 7 20
0 7 9 13 21
1 3 11 22
0 1 8 13 23
1 6 11 13 24
0 10 11 25
1 9 11 12 26
1 5 11 12 27
0 6 7 28
0 1 10 29
1 4 11 30
0 8 13 31
1 2 32
0 3 5 33
1 2 9 34
0 5 35
2 7 12 13 36
0 6 37
1 2 5 38
0 4 39
2 5 7 9 40
1 13 41.

### Claim 16 (depends on 14)

The transmitter of claim 14, wherein the block size (Z) is determined as one of values given below:
Z1′={3, 6, 12, 24, 48, 96, 192, 384}
Z2′={11, 22, 44, 88, 176, 352}
Z3′={5, 10, 20, 40, 80, 160, 320}
Z4′={9, 18, 36, 72, 144, 288}
Z5′={2, 4, 8, 16, 32, 64, 128, 256}
Z6′={15, 30, 60, 120, 240}
Z7′={7, 14, 28, 56, 112, 224}
Z8′={13, 26, 52, 104, 208}.

### Claim 17 (depends on 14)

The transmitter of claim 14, wherein a non-zero block is a circulant permutation matrix determined based on a result of a modulo operation between the block size (Z) and an exponent value indicated by the third information.

### Claim 18 (depends on 13)

The transmitter of claim 13, wherein the second information is capable of indicating positions of the non-zero blocks of up to 42 rows and 52 columns.

### Claim 19

A receiver performing channel decoding in a communication system, the receiver comprising:
a transceiver configured to receive a signal from a transmitter; and
a controller configured to: perform low density parity check (LDPC) decoding for a demodulated received signal based on first information, the first information being identified based on second information and third information, and
wherein the second information indicates information on non-zero blocks in the first information, and
wherein the third information indicates information on values associated with the non-zero blocks.

### Claim 20 (depends on 19)

The receiver of claim 19, wherein the controller is further configured to control to determine a block size (Z) for the LDPC decoding.

### Claim 21 (depends on 19)

The receiver of claim 19, wherein the second information includes thirty-two rows corresponding to a sequence given below:
0 1 2 3 6 9 10 11
0 3 4 5 6 7 8 9 11 12
0 1 3 4 8 10 12 13
1 2 4 5 6 7 8 9 10 13
0 1 11 14
0 1 5 7 11 15
0 5 7 9 11 16
1 5 7 11 13 17
0 1 12 18
1 8 10 11 19
0 1 6 7 20
0 7 9 13 21
1 3 11 22
0 1 8 13 23
1 6 11 13 24
0 10 11 25
1 9 11 12 26
1 5 11 12 27
0 6 7 28
0 1 10 29
1 4 11 30
0 8 13 31
1 2 32
0 3 5 33
1 2 9 34
0 5 35
2 7 12 13 36
0 6 37
1 2 5 38
0 4 39
2 5 7 9 40
1 13 41.

### Claim 22 (depends on 20)

The receiver of claim 20, wherein the block size (Z) is determined as one of values given below:
Z1′={3, 6, 12, 24, 48, 96, 192, 384}
Z2′={11, 22, 44, 88, 176, 352}
Z3′={5, 10, 20, 40, 80, 160, 320}
Z4′={9, 18, 36, 72, 144, 288}
Z5′={2, 4, 8, 16, 32, 64, 128, 256}
Z6′={15, 30, 60, 120, 240}
Z7′={7, 14, 28, 56, 112, 224}
Z8′={13, 26, 52, 104, 208}.

### Claim 23 (depends on 20)

The receiver of claim 20, wherein a non-zero block is a circulant permutation matrix determined based on a result of a modulo operation between the block size (Z) and an exponent value indicated by the third information.

### Claim 24 (depends on 19)

The receiver of claim 19, wherein the second information is capable of indicating positions of the non-zero blocks of up to 42 rows and 52 columns.