PATENT CLAIM ANALYSIS

Application Number: 16351159
Application Type: Utility
Filing Date: 2019-03
Publication Date: 2019-07
Patent Classification: ["708", "625000"]

Abstract:
A binary logic circuit for approximating a mathematical function over a predefined range as a series of linear segments, each linear segment having one of a predetermined set of fixed gradients and a corresponding base value, the binary logic circuit comprising: an input for receiving an input variable in the predefined range; a plurality of logic chains each comprising: a binary multiplier adapted to perform multiplication by a respective one of the set of fixed gradients using h-1 binary adders, where h is the extended Hamming weight; and a binary adder adapted to add a base value to the input or output of the binary multiplier; and selection logic configured to select one of the logic chains in dependence on the input variable so as to provide, for the received input variable, an approximate value of the mathematical function.

Claim (Index 20):
A method of manufacturing a binary logic circuit in accordance with a hardware representation derived using a method configured to approximate a mathematical function over a predefined range as a series of linear segments, comprising the steps of:\n fitting a plurality of linear segments to the function over the predefined range, each linear segment extending between a pair of break points and having a gradient and a base value; and deriving a hardware representation for a binary logic circuit which comprises:\n for each of the plurality of linear segments:\n a binary multiplier configured to perform multiplication by the gradient of the segment, and \n a binary adder configured to add the base value for the segment to an input or output of the binary multiplier; and \n \n selection logic configured to select, for a given input variable in the predefined range, one of the plurality of binary multipliers in dependence on the break points, \n wherein each of the break points has a minimum extended Hamming weight which is less than or equal to a threshold value.

Metadata:
- Claim Count in Document: 50.0
- Percentile: 99.0
- Lexical Diversity: 2.11268
- Patent Class: 708.0
- Transitional Phrase Type: open
- Component Type: 1
- Foreign Priority: True
- Related Applications: ['15696385', '14701818', '14208591', '15606351', '12396720']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.4243569573566423
- 35 USC 102 Novelty (BERT): 0.5896734083775481
- Combined Prediction Score: 0.4408886024587328
- Mean Citation Score: 315.17173
- Max Citation Score: 490.05695
- Similarity Product: 456.7476439121247

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

Dataset: test