IP Library › Granted Patent US 10,903,936
Granted Patent B2
US 10,903,936 · App. 16/730,412 · Granted Jan 26, 2021

Method and apparatus for channel encoding/decoding in a communication or broadcasting system

Inventors: Kyung-Joong Kim (Seoul, KR); Seho Myung (Seoul, KR); Min Jang (Seongnam-si, KR); Hong-Sil Jeong (Suwon-si, KR); Jae-Yoel Kim (Seongnam-si, KR); Seok-Ki Ahn (Suwon-si, KR)
Assignee: Samsung Electronics Co., Ltd.
H04L1/0041H03M13/00H03M13/05H03M13/1102H03M13/116H03M13/1165H03M13/1177H03M13/25H03M13/256H03M13/616H03M13/6393H03M13/6513H04L1/00
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 10,903,936
App. No.
16/730,412
Granted
Jan 26, 2021
Kind
B2
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 (75)

1. A method for encoding in a communication or broadcasting system supporting a low density parity check (LDPC) code, the method comprising:

identifying a block size Z;

identifying, from among a plurality of sets of block sizes, a set of block sizes associated with the block size Z;

identifying an exponent matrix including at least one integer value based on the identified set of block sizes;

obtaining a parity-check matrix based on the block size Z and the exponent matrix; and

encoding information bits based on the parity-check matrix,

wherein the parity-check matrix includes a submatrix consisting of Z×Z identity matrices and Z×Z zero matrices, and Z×Z circular permutation matrices.

2. The method of claim 1 , wherein the identifying of the block size comprises:

identifying a size of the information bits to encode; and

identifying the block size based on the size of the information bits.

3. The method of claim 1 , wherein the set of block sizes is associated with 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.

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

5. The method of claim 1 , wherein the block size is identified based on integer values in a plurality of integer number sets or a length of an information word.

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

7. 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 a modulo operation or a flooring operation.

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

9. The method of claim 1 , wherein the Z×Z circular permutation matrices are obtained by circularly shifting a Z×Z identity matrix to right once or left once.

10. An encoder in a communication or broadcasting system supporting a low density parity check (LDPC) code, the encoder comprising:

a transceiver;

a memory; and

at least one processor configured to:

identify a block size Z,

identify, from among a plurality of sets of block sizes, a set of block sizes associated with the block size Z,

identify an exponent matrix including at least one integer value based on the identified set of block sizes,

obtain a parity-check matrix based on the block size Z and the exponent matrix, and

encode information bits based on the parity-check matrix,

wherein the parity-check matrix includes a submatrix consisting of Z×Z identity matrices and Z×Z zero matrices, and Z×Z circular permutation matrices.

11. The encoder of claim 10 , wherein the at least one processor is further configured to:

identify a size of the information bits to encode, and

identify the block size based on the size of the information bits.

12. The encoder of claim 10 , wherein the set of block sizes is associated with 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.

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

14. The encoder of claim 10 , wherein the block size is identified based on integer values in a plurality of integer number sets or a length of an information word.

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

16. 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 a modulo operation or a flooring operation.

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

18. The encoder of claim 10 , wherein the Z×Z circular permutation matrices are obtained by circularly shifting a Z×Z identity matrix to right once or left once.

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 is based on an exponent matrix including at least one integer value,

wherein the exponent matrix is based on a set of block sizes from among a plurality of sets of block sizes,

wherein the set of block sizes is based on a block size Z, and

wherein the parity-check matrix includes a submatrix consisting of Z×Z identity matrices and Z×Z zero matrices, and Z×Z circular permutation matrices.

20. The method of claim 19 , wherein the block size is based on a size of information bits.

21. The method of claim 19 , wherein the set of block sizes is associated with 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.

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

23. The method of claim 19 ,

wherein the set of block sizes is based on a block size, and

wherein the block size is based on integer values in a plurality of integer number sets or a length of an information word.

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

25. 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 a modulo operation or a flooring operation.

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

27. The method of claim 19 , wherein the Z×Z circular permutation matrices are obtained by circularly shifting a Z×Z identity matrix to right once or left once.

28. A decoder in a communication or broadcasting system supporting a low density parity check (LDPC) code, the decoder comprising:

a transceiver;

a memory; and

at least one processor 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 is based on an exponent matrix including at least one integer value,

wherein the exponent matrix is based on a set of block sizes from among a plurality of sets of block sizes,

wherein the set of block sizes is based on a block size Z, and

wherein the parity-check matrix includes a submatrix consisting of Z×Z identity matrices and Z×Z zero matrices, and Z×Z circular permutation matrices.

29. The decoder of claim 28 , wherein the block size is based on a size of an information bits.

30. The decoder of claim 28 , wherein the set of block sizes is associated with 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.

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

32. The decoder of claim 28 ,

wherein the set of block sizes is based on a block size, and

wherein the block size is based on integer values in a plurality of integer number sets or a length of an information word.

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

34. 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 a modulo operation or a flooring operation.

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

Priority Claims (5)
KR 10-2015-0165114 · Nov 24, 2015 · national
KR 10-2016-0002929 · Jan 8, 2016 · national
KR 10-2016-0102635 · Aug 11, 2016 · national
KR 10-2016-0105807 · Aug 19, 2016 · national
KR 10-2016-0149882 · Nov 10, 2016 · national
Continuity (2)
Continuation 15361283 · Nov 25, 2016
Related Publication 20200136752A1 · Apr 30, 2020