PATENT CLAIM ANALYSIS

Application Number: 15873002
Application Type: Utility
Filing Date: 2018-01
Publication Date: 2018-07
Patent Classification: ["708", "607000"]

Abstract:
A method for multiplying a first sparse matrix by a second sparse matrix in an associative memory device includes storing multiplicand information related to each non-zero element of the second sparse matrix in a computation column of the associative memory device; the multiplicand information includes at least a multiplicand value. According to a first linear algebra rule, the method associates multiplier information related to a non-zero element of the first sparse matrix with each of its associated multiplicands, the multiplier information includes at least a multiplier value. The method concurrently stores the multiplier information in the computation columns of each associated multiplicand. The method, concurrently on all computation columns, multiplies a multiplier value by its associated multiplicand value to provide a product in the computation column, and adds together products from computation columns, associated according to a second linear algebra rule, to provide a resultant matrix.

Claim (Index 15):
A method of in memory multiplication with a sparse matrix, the method comprising:\n representing each non-zero element of said sparse matrix as a value and at least one index; selecting a multiplier from said non-zero elements and fetching a multiplier-index of said selected multiplier; searching multiplicands having a matching multiplicand-index; in parallel distributing said multiplier to columns of said multiplicands; and in parallel multiplying said multipliers by said multiplicands and adding a multiplication result from all said columns.

Metadata:
- Claim Count in Document: 2.0
- Percentile: 86.0
- Lexical Diversity: 2.63333
- Patent Class: 708.0
- Transitional Phrase Type: open
- Component Type: 1
- Foreign Priority: False
- Related Applications: ['14580110', '14314750', '11673944', '14400834', '13009100']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.4023218891839727
- 35 USC 102 Novelty (BERT): 0.5101692561799127
- Combined Prediction Score: 0.4131066258835668
- Mean Citation Score: 249.427276
- Max Citation Score: 266.53076
- Similarity Product: 207.8711404288053

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

Dataset: test