Method and apparatus of encoding and decoding data using low density parity check code in a wireless communication system
AssigneeLG Electronics Inc.
InventorsMin Seok Oh, Ki Hyoung Cho, Kyu-Hyuk Chung
Life of this patent
Estimating the term…
Abstract
A method of encoding data using low density parity check (LDPC) code defined by a m×n parity check matrix is disclosed. More specifically, the method includes encoding input source data using the parity check matrix, wherein the parity check matrix comprises a plurality of z×z sub-matrices of which row weights and column weights are ‘0’ or ‘1’.
Claims20
A method of encoding data in an encoder using low density parity check (LDPC) code based on a first base matrix defined for a code rate, the method comprising:
- generating a parity check matrix by replacing each integer value of the first base matrix with a corresponding matrix,
- wherein the first base matrix is as follows when the code rate is ⅔:
- 2
- -
- 1
- 19
- -
- 1
- 47
- -
- 1
- 48
- -
- 1
- 36
- -
- 1
- 82
- -
- 1
- 47
- -
- 1
- -
- 1
- 69
- -
- 1
- 88
- -
- 1
- 33
- -
- 1
- 3
- -
- 1
- 16
- -
- 1
- 37
- -
- 1
- 40
- 10
- -
- 1
- 86
- -
- 1
- 62
- -
- 1
- 28
- -
- 1
- 85
- -
- 1
- 16
- -
- 1
- 34
- -
- 1
- -
- 1
- 28
- -
- 1
- 32
- -
- 1
- 81
- -
- 1
- 27
- -
- 1
- 88
- -
- 1
- 5
- -
- 1
- 56
- 23
- -
- 1
- 29
- -
- 1
- 15
- -
- 1
- 30
- -
- 1
- 66
- -
- 1
- 24
- -
- 1
- 50
- -
- 1
- -
- 1
- 30
- -
- 1
- 65
- -
- 1
- 54
- -
- 1
- 14
- -
- 1
- 0
- -
- 1
- 30
- -
- 1
- 74
- 32
- -
- 1
- 0
- -
- 1
- 15
- -
- 1
- 56
- -
- 1
- 85
- -
- 1
- 5
- -
- 1
- 6
- -
- 1
- -
- 1
- 0
- -
- 1
- 47
- -
- 1
- 13
- -
- 1
- 61
- -
- 1
- 84
- -
- 1
- 55
- -
- 1
- 78
-
-
- 15
- -
- 1
- 95
- 0
- -
- 1
- -
- 1
- -
- 1
- -
- 1
- -
- 1
- -
- 1
- -
- 1
- 48
- -
- 1
- 0
- 0
- -
- 1
- -
- 1
- -
- 1
- -
- 1
- -
- 1
- 73
- -
- 1
- -
- 1
- -
- 1
- 0
- 0
- -
- 1
- -
- 1
- -
- 1
- -
- 1
- -
- 1
- 37
- -
- 1
- -
- 1
- -
- 1
- 0
- 0
- -
- 1
- -
- 1
- -
- 1
- 62
- -
- 1
- -
- 1
- -
- 1
- -
- 1
- -
- 1
- 0
- 0
- -
- 1
- -
- 1
- -
- 1
- 0
- -
- 1
- -
- 1
- -
- 1
- -
- 1
- -
- 1
- 0
- 0
- -
- 1
- 52
- -
- 1
- 0
- -
- 1
- -
- 1
- -
- 1
- -
- 1
- -
- 1
- 0
- 0
- -
- 1
- 41
- 95
- -
- 1
- -
- 1
- -
- 1
- -
- 1
- -
- 1
- -
- 1
- 0
- where “−1” indicates a zero matrix having a zmax×zmax size, “0” indicates an identity matrix having the zmax×zmax size, and a positive integer indicates a first permutation matrix generated by circular shifting the identity matrix by the positive integer and having the zmax×zmax size;
- and
- encoding the data using the parity check matrix.
A method of decoding encoded data in a decoder using low density parity check (LDPC) code based on a first base matrix defined for a code rate, the method comprising:
- generating a parity check matrix by replacing each integer value of the first base matrix with a corresponding matrix, wherein the first base matrix is as follows when the code rate is ⅔:
- 2
- -
- 1
- 19
- -
- 1
- 47
- -
- 1
- 48
- -
- 1
- 36
- -
- 1
- 82
- -
- 1
- 47
- -
- 1
- -
- 1
- 69
- -
- 1
- 88
- -
- 1
- 33
- -
- 1
- 3
- -
- 1
- 16
- -
- 1
- 37
- -
- 1
- 40
- 10
- -
- 1
- 86
- -
- 1
- 62
- -
- 1
- 28
- -
- 1
- 85
- -
- 1
- 16
- -
- 1
- 34
- -
- 1
- -
- 1
- 28
- -
- 1
- 32
- -
- 1
- 81
- -
- 1
- 27
- -
- 1
- 88
- -
- 1
- 5
- -
- 1
- 56
- 23
- -
- 1
- 29
- -
- 1
- 15
- -
- 1
- 30
- -
- 1
- 66
- -
- 1
- 24
- -
- 1
- 50
- -
- 1
- -
- 1
- 30
- -
- 1
- 65
- -
- 1
- 54
- -
- 1
- 14
- -
- 1
- 0
- -
- 1
- 30
- -
- 1
- 74
- 32
- -
- 1
- 0
- -
- 1
- 15
- -
- 1
- 56
- -
- 1
- 85
- -
- 1
- 5
- -
- 1
- 6
- -
- 1
- -
- 1
- 0
- -
- 1
- 47
- -
- 1
- 13
- -
- 1
- 61
- -
- 1
- 84
- -
- 1
- 55
- -
- 1
- 78
-
- 15
- -
- 1
- 95
- 0
- -
- 1
- -
- 1
- -
- 1
- -
- 1
- -
- 1
- -
- 1
- -
- 1
- 48
- -
- 1
- 0
- 0
- -
- 1
- -
- 1
- -
- 1
- -
- 1
- -
- 1
- 73
- -
- 1
- -
- 1
- -
- 1
- 0
- 0
- -
- 1
- -
- 1
- -
- 1
- -
- 1
- -
- 1
- 37
- -
- 1
- -
- 1
- -
- 1
- 0
- 0
- -
- 1
- -
- 1
- -
- 1
- 62
- -
- 1
- -
- 1
- -
- 1
- -
- 1
- -
- 1
- 0
- 0
- -
- 1
- -
- 1
- -
- 1
- 0
- -
- 1
- -
- 1
- -
- 1
- -
- 1
- -
- 1
- 0
- 0
- -
- 1
- 52
- -
- 1
- 0
- -
- 1
- -
- 1
- -
- 1
- -
- 1
- -
- 1
- 0
- 0
- -
- 1
- 41
- 95
- -
- 1
- -
- 1
- -
- 1
- -
- 1
- -
- 1
- -
- 1
- 0
- where “−1” indicates a zero matrix having a zmax×zmax size, “0” indicates an identity matrix having the zmax×zmax size, and a positive integer indicates a first permutation matrix generated by circular shifting the identity matrix by the positive integer and having the zmax×zmax size;
- and
- decoding the encoded data using the parity check matrix.
Dependencies are inferred from the claim text.