# US 2023/0155724 A1 · Method and apparatus for channel encoding/decoding in a 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 2023/0155724 A1
- Document ID: US20230155724A1
- Status: Published application
- Kind: A1
- Application number: 18/156,867
- Filed: 2023-01-19
- Published: 2023-05-18
- Earliest claimed: 2015-11-24
- Assignees: Samsung Electronics Co., Ltd.
- Applicants: Samsung Electronics Co., Ltd.
- Inventors: Kyung-Joong KIM; Seho MYUNG; Min JANG; Hong-Sil JEONG; Jae-Yoel KIM; Seok-Ki AHN
- Web page: https://patentgrep.com/patent/US20230155724A1

## CPC

- H03M 13/6306: {Error control coding in combination with Automatic Repeat reQuest [ARQ] and diversity transmission, e.g. coding schemes for the multiple transmission of the same information or the transmission of incremental redundancy (H03M13/3761, H03M13/3769 and H03M13/635 take precedence)}
- H04L 1/0041: {Arrangements at the transmitter end}
- H03M 13/00: Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes (error detection or error correction for analogue/digital, digital/analogue or code conversion H03M1/00 – H03M11/00; specially adapted for digital computers G06F11/08; for information storage based on relative movement between record carrier and transducer G11B, e.g. G11B20/18; for static stores G11C)
- H03M 13/05: using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits {(H03M13/2906 takes precedence)}
- H03M 13/1102: {Codes on graphs and decoding on graphs, e.g. low-density parity check [LDPC] codes}
- 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/1165: {QC-LDPC codes as defined for the digital video broadcasting [DVB] specifications, e.g. DVB-Satellite [DVB-S2]}
- H03M 13/1177: {Regular LDPC codes with parity-check matrices wherein all rows and columns have the same row weight and column weight, respectively}
- H03M 13/1185: {wherein the parity-check matrix comprises a part with a double-diagonal}
- H03M 13/25: Error detection or forward error correction by signal space coding, i.e. adding redundancy in the signal constellation, e.g. Trellis Coded Modulation [TCM] {(modulation codes H03M13/31)}
- H03M 13/256: {with trellis coding, e.g. with convolutional codes and TCM}
- H03M 13/2703: {the interleaver involving at least two directions}
- H03M 13/616: {Matrix operations, especially for generator matrices or check matrices, e.g. column or row permutations}
- H03M 13/6393: {Rate compatible low-density parity check [LDPC] codes}
- H03M 13/6513: {Support of multiple code types, e.g. unified decoder for LDPC and turbo 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/00: Arrangements for detecting or preventing errors in the information received {(correcting synchronisation H04L7/00)}
- H04L 1/0057: {Block codes (H04L1/0061, H04L1/0064 take precedence)}
- H04L 1/0071: {Use of interleaving (interleaving per se H03M13/27)}
- H04L 1/1816: {with retransmission of the same, encoded, message}
- H04L 1/1819: {with retransmission of additional or different redundancy}
- H03M 13/09: Error detection only, e.g. using cyclic redundancy check [CRC] codes or single parity bit
- H04L 1/0067: {Rate matching (H04L1/0013 and H04L1/08 take precedence)}
- H04L 2001/0093: {Point-to-multipoint}
- 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 channel encoding method in a communication or broadcasting system is provided. The channel encoding method includes reading a first sequence corresponding to a parity check matrix, converting the first sequence to a second sequence by applying a certain rule to a block size corresponding to a parity check matrix and the first sequence, and encoding information bits based on the second sequence. The block size has at least two different integer values.

## Claims

### Claim 1

A method for encoding in a communication or broadcasting system supporting a low density parity check (LDPC) code, the method comprising:
identifying a size related to information bits to encode;
identifying a block size Z based on the size related to the information bits;
identifying, from among a plurality of sets of block sizes, a set of block sizes related to the block size Z;
identifying an exponent matrix including at least one integer value based on the set of block sizes;
identifying a parity check matrix including Z×Z zero matrix and Z×Z circular permutation matrix, based on the exponent matrix, and a modulo operation of the block size Z; and
encoding the information bits based on the parity check matrix,
wherein a first block size in the set of block sizes is multiple of two of a second block size in the set of block sizes.

### Claim 2 (depends on 1)

The method of claim 1, further comprising:
identifying a mother matrix consisting of 0 and 1; and
identifying a predetermined number based on the mother matrix,
wherein identifying the block size Z based on the size related to the information bits comprises identifying the block size Z based on the predetermined number and the size related to the information bits.

### Claim 3 (depends on 2)

The method of claim 2, wherein a multiplication of the predetermined number and the block size Z is larger than or equal to the size related to the information bits.

### Claim 4 (depends on 1)

The method of claim 1, wherein the set of block sizes is related to block sizes determined among {(A+i), 2(A+i), 22(A+i), . . . , 2S(A+i)}, where i=0, 1, 2, . . . , A−1, and A and S are positive integers.

### Claim 5 (depends on 4)

The method of claim 4, wherein A is 8 and S is 4.

### Claim 6 (depends on 1)

The method of claim 1, wherein the LDPC code is determined based on one of parity check matrices of at least two different sizes.

### Claim 7 (depends on 1)

The method of claim 1, wherein the parity check matrix is obtained based on a circular permutation matrix by applying a circularly shifting operation including one of the modulo operation or a flooring operation.

### Claim 8 (depends on 1)

The method of claim 1, wherein the LDPC code is determined based on one of two or more mother matrices.

### Claim 9 (depends on 1)

The method of claim 1, wherein at least one of the circular permutation matrices is a circularly shifted matrix of a Z×Z identity matrix.

### Claim 10

An encoder in a communication or broadcasting system supporting a low density parity check (LDPC) code, the encoder comprising:
a transceiver; and
at least one processor coupled to the transceiver and configured to:
identify a size related to information bits to encode,
identify a block size Z based on the size related to the information bits,
identify, from among a plurality of sets of block sizes, a set of block sizes related to the block size Z,
identify an exponent matrix including at least one integer value based on the set of block sizes,
identify a parity check matrix including Z×Z zero matrix and Z×Z circular permutation matrix, based on the exponent matrix, and a modulo operation of the block size Z, and
encode the information bits based on the parity check matrix,
wherein a first block size in the set of block sizes is multiple of two of a second block size in the set of block sizes.

### Claim 11 (depends on 10)

The encoder of claim 10, wherein the at least one processor is further configured to:
identify a mother matrix consisting of 0 and 1,
identify a predetermined number based on the mother matrix, and
identify the block size Z based on the predetermined number and the size related to the information bits.

### Claim 12 (depends on 11)

The encoder of claim 11, wherein a multiplication of the predetermined number and the block size Z is larger than or equal to the size related to the information bits.

### Claim 13 (depends on 10)

The encoder of claim 10, wherein the set of block sizes is related to block sizes determined among {(A+i), 2(A+i), 22(A+i), . . . , 2S(A+i)}, where i=0, 1, 2, . . . , A−1, and A and S are positive integers.

### Claim 14 (depends on 13)

The encoder of claim 13, wherein A is 8 and S is 4.

### Claim 15 (depends on 10)

The encoder of claim 10, wherein the LDPC code is determined based on one of parity check matrices of at least two different sizes.

### Claim 16 (depends on 10)

The encoder of claim 10, wherein the parity check matrix is obtained based on a circular permutation matrix by applying a circularly shifting operation including one of the modulo operation or a flooring operation.

### Claim 17 (depends on 10)

The encoder of claim 10, wherein the LDPC code is determined based on one of two or more mother matrices.

### Claim 18 (depends on 10)

The encoder of claim 10, wherein at least one of the Z X Z circular permutation matrices is a circularly shifted matrix of a Z X Z identity matrix.

### Claim 19

A method for decoding in a communication or broadcasting system supporting a low density parity check (LDPC) code, the method comprising:
receiving a signal from a transmitter; and
obtaining a bit sequence by decoding the signal,
wherein the decoding of the signal is performed based on a parity check matrix, wherein the parity check matrix including Z×Z zero matrix and Z×Z circular permutation matrix is based on an exponent matrix, and a modulo operation of block size Z,
wherein the exponent matrix including at least one integer value is based on a set of block sizes,
wherein the set of block sizes related to the block size Z is identified, from among a plurality of sets of block sizes,
wherein the block size Z is based on a size related to information bits, and
wherein a first block size in the set of block sizes is multiple of two of a second block size in the set of block sizes.

### Claim 20 (depends on 19)

The method of claim 19,
wherein the block size Z is based on a predetermined number, and
wherein the predetermined number is based on a mother matrix consisting of 0 and 1.

### Claim 21 (depends on 20)

The method of claim 20, wherein a multiplication of the predetermined number and the block size Z is larger than or equal to the size related to information bits.

### Claim 22 (depends on 19)

The method of claim 19, wherein the set of block sizes is related to block sizes determined among {(A+i), 2(A+i), 22(A+i), . . . , 2S(A+i)}, where i=0, 1, 2, . . . , A−1, and A and S are positive integers.

### Claim 23 (depends on 22)

The method of claim 22, wherein A is 8 and S is 4.

### Claim 24 (depends on 19)

The method of claim 19, wherein the LDPC code is based on one of parity check matrices of at least two different sizes.

### Claim 25 (depends on 19)

The method of claim 19, wherein the parity check matrix is based on a circular permutation matrix by applying a circularly shifting operation including one of the modulo operation or a flooring operation.

### Claim 26 (depends on 19)

The method of claim 19, wherein the LDPC code is determined based on one of two or more mother matrices.

### Claim 27 (depends on 19)

The method of claim 19, wherein at least one of the Z X Z circular permutation matrices is a circularly shifted matrix of a Z X Z identity matrix.

### Claim 28

A decoder in a communication or broadcasting system supporting a low density parity check (LDPC) code, the decoder comprising:
a transceiver; and
at least one processor coupled to the transceiver and configured to:
control the transceiver to receive a signal from a transmitter, and
obtain a bit sequence by decoding the signal,
wherein the decoding of the signal is performed based on a parity check matrix,
wherein the parity check matrix including Z×Z zero matrix and Z×Z circular permutation matrix is based on an exponent matrix, and a modulo operation of block size Z,
wherein the exponent matrix including at least one integer value is based on a set of block sizes,
wherein the set of block sizes related to the block size Z is identified, from among a plurality of sets of block sizes,
wherein the block size Z is based on a size related to information bits, and
wherein a first block size in the set of block sizes is multiple of two of a second block size in the set of block sizes.

### Claim 29 (depends on 28)

The decoder of claim 28,
wherein the block size Z is based on a predetermined number, and
wherein the predetermined number is based on a mother matrix consisting of 0 and 1.

### Claim 30 (depends on 29)

The decoder of claim 29, wherein a multiplication of the predetermined number and the block size Z is larger than or equal to the size related to information bits.

### Claim 31 (depends on 28)

The decoder of claim 28, wherein the set of block sizes is related to block sizes determined among {(A+i), 2(A+i), 22(A+i), . . . , 2S(A+i)}, where i=0, 1, 2, . . . , A−1, and A and S are positive integers.

### Claim 32 (depends on 31)

The decoder of claim 31, wherein A is 8 and S is 4.

### Claim 33 (depends on 28)

The decoder of claim 28, wherein the LDPC code is based on one of parity check matrices of at least two different sizes.

### Claim 34 (depends on 28)

The decoder of claim 28, wherein the parity check matrix is based on a circular permutation matrix by applying a circularly shifting operation including one of the modulo operation or a flooring operation.

### Claim 35 (depends on 28)

The decoder of claim 28, wherein the LDPC code is determined based on one of two or more mother matrices.

### Claim 36 (depends on 28)

The decoder of claim 28, wherein at least one of the Z×Z circular permutation matrices is a circularly shifted matrix of a Z×Z identity matrix.
