Method and apparatus for channel encoding/decoding in a communication or broadcasting system
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.
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;
identifying, from among a plurality of sets of block sizes, a set of block sizes associated with the block size;
identifying a first exponent matrix including at least one integer value based on the identified set of block sizes;
obtaining a second exponent matrix based on the block size and the first exponent matrix; and
encoding information bits based on the second exponent matrix.
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), 2 2 (A+i), . . . , 2 S (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 second exponent 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. 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,
identify, from among a plurality of sets of block sizes, a set of block sizes associated with the block size,
identify a first exponent matrix including at least one integer value based on the identified set of block sizes,
obtain a second exponent matrix based on the block size and the first exponent matrix, and
encode information bits based on the second exponent matrix.
10. The encoder of claim 9 , 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.
11. The encoder of claim 9 , wherein the set of block sizes is associated with block sizes determined among {(A+i), 2(A+i), 2 2 (A+i), . . . , 2 S (A+i)}, where i=0, 1, 2, . . . , A−1, and A and S are positive integers.
12. The encoder of claim 11 , wherein A is 8 and S is 4.
13. The encoder of claim 9 , wherein the block size is identified based on integer values in a plurality of integer number sets or a length of an information word.
14. The encoder of claim 9 , wherein the LDPC code is determined based on one of parity check matrices of at least two different sizes.
15. The encoder of claim 9 , wherein the second exponent 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.
16. The encoder of claim 9 , wherein the LDPC code is determined based on one of two or more base matrices.
17. A method for decoding in a communication or broadcasting system supporting a low density parity check (LDPC) code, the method comprising:
receiving a signal corresponding to a codeword from a transmitter; and
decoding the codeword based on the signal,
wherein the codeword is based on a second exponent matrix,
wherein the second exponent matrix is based on a first exponent matrix including at least one integer value, and
wherein the first exponent matrix is based on a set of block sizes from among a plurality of sets of block sizes.
18. The method of claim 17 ,
wherein the set of block sizes is based on a block size, and
wherein the block size is based on a size of information bits.
19. The method of claim 17 , wherein the set of block sizes is associated with block sizes determined among {(A+i), 2(A+i), 2 2 (A+i), . . . , 2 S (A+i)}, where i=0, 1, 2, . . . , A−1, and A and S are positive integers.
20. The method of claim 19 , wherein A is 8 and S is 4.
21. The method of claim 17 ,
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.
22. The method of claim 17 ,
wherein the LDPC code is based on one of parity check matrices of at least two different sizes.
23. The method of claim 17 , wherein the second exponent matrix is based on a circular permutation matrix by applying a circularly shifting operation including one of a modulo operation or a flooring operation.
24. The method of claim 17 , wherein the LDPC code is determined based on one of two or more base matrices.
25. 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:
receive a signal corresponding to a codeword from a transmitter, and
decode the codeword based on the signal,
wherein the codeword is based on a second exponent matrix,
wherein the second exponent matrix is based on a first exponent matrix including at least one integer value, and
wherein the first exponent matrix is based on a set of block sizes from among a plurality of sets of block sizes.
26. The decoder of claim 25 ,
wherein the set of block sizes is based on a block size, and
wherein the block size is based on a size of an information bits.
27. The decoder of claim 25 , wherein the set of block sizes is associated with block sizes determined among {(A+i), 2(A+i), 2 2 (A+i), . . . , 2 S (A+i)}, where i=0, 1, 2, . . . , A−1, and A and S are positive integers.
28. The decoder of claim 27 , wherein A is 8 and S is 4.
29. The decoder of claim 25 , 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.
30. The decoder of claim 25 ,
wherein the LDPC code is based on one of parity check matrices of at least two different sizes.
31. The decoder of claim 25 , wherein the second exponent matrix is based on a circular permutation matrix by applying a circularly shifting operation including one of a modulo operation or a flooring operation.
32. The decoder of claim 25 , wherein the LDPC code is determined based on one of two or more base matrices.