PATENT CLAIM ANALYSIS

Application Number: 16248223
Application Type: Utility
Filing Date: 2019-01
Publication Date: 2019-08
Patent Classification: ["714", "776000"]

Abstract:
A method for performing encoding on the basis of a parity check matrix of a LDPC code, according to one embodiment of the present invention, comprises the steps of: generating, by a terminal, a parity check matrix, wherein the parity check matrix corresponds to a characteristic matrix, each element of the characteristic matrix corresponds to a shift index value determined by a modulo operation between a corresponding element in a base matrix and a lifting value, and the base matrix is a 46 x 68 matrix; and performing, by the terminal, encoding of input data by using the parity check matrix, wherein the lifting value is associated with the length of the input data.

Claim (Index 12):
A transmitting device configured to encode, based on a parity check matrix of a low-density parity-check code, information for transmission over a communication channel, the transmitting device comprising:\n a transceiver; at least one processor; and at least one computer memory operably connectable to the at least one processor and storing instructions that, when executed, cause the at least one processor to perform operations comprising: determining the parity check matrix of dimensions at least 5Z rows and 27Z columns comprising 5 rows and 27 columns of Z\u00d7Z-sized submatrices that are indexed by submatrix row index m (where 0\u2264m\u22644) and submatrix column index n (where 0\u2264n\u226426), wherein Z is a non-zero integer, and wherein:\n for submatrix row index m=0 and for submatrix column indices n={0, 1, 2, 3, 5, 6, 9, 10, 11, 12, 13, 15, 16, 18, 19, 20, 21, 22, 23}, each submatrix at submatrix index (m, n) is obtained based on a respective value among {223, 16, 94, 91, 74, 10, 0, 205, 216, 21, 215, 14, 70, 141, 198, 104, 81, 1, 0}, \n for submatrix row index m=1 and for submatrix column indices n={0, 2, 3, 4, 5, 7, 8, 9, 11, 12, 14, 15, 16, 17, 19, 21, 22, 23, 24}, each submatrix at submatrix index (m, n) is obtained based on a respective value among {141, 45, 151, 46, 119, 157, 133, 87, 206, 93, 79, 9, 118, 194, 31, 187, 0, 0, 0}, \n for submatrix row index m=2 and for submatrix column indices n={0, 1, 2, 4, 5, 6, 7, 8, 9, 10, 13, 14, 15, 17, 18, 19, 20, 24, 25}, each submatrix at submatrix index (m, n) is obtained based on a respective value among {207, 203, 31, 176, 180, 186, 95, 153, 177, 70, 77, 214, 77, 198, 117, 223, 90, 0, 0}, \n for submatrix row index m=3 and for submatrix column indices n={0, 1, 3, 4, 6, 7, 8, 10, 11, 12, 13, 14, 16, 17, 18, 20, 21, 22, 25}, each submatrix at submatrix index (m, n) is obtained based on a respective value among {201, 18, 165, 5, 45, 142, 16, 34, 155, 213, 147, 69, 96, 74, 99, 30, 158, 1, 0}, and \n for submatrix row index m=4 and for submatrix column indices n={0, 1, 26}, each submatrix at submatrix index (m, n) is obtained based on a respective value among {170, 10, 0}, \n generating encoded data based on encoding the information with the determined parity check matrix; and transmitting, through the transceiver, the encoded data over the communication channel.

Metadata:
- Claim Count in Document: 47.0
- Percentile: 99.0
- Lexical Diversity: 2.22807
- Patent Class: 714.0
- Transitional Phrase Type: open
- Component Type: 1
- Foreign Priority: False
- Related Applications: ['16247090', '12510899', '10563216', '14962077', '11004359']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.3197398497401756
- 35 USC 102 Novelty (BERT): 0.5199357398960196
- Combined Prediction Score: 0.33975943875576
- Mean Citation Score: 241.433224
- Max Citation Score: 347.93878
- Similarity Product: 287.95718372317435

Labels:
- Claim Label 101: 1
- Claim Label 102: 1
- Claim Label 103: 0
- Claim Label 112: 0
- Combined Label: 1
- Label 101 Adjusted: 1

Dataset: test