# US 2026/0086909 A1 · Automatic generation of computation kernels for approximating elementary functions

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2026/0086909 A1
- Document ID: US20260086909A1
- Status: Published application
- Kind: A1
- Application number: 19/403,066
- Filed: 2025-11-27
- Published: 2026-03-26
- Earliest claimed: 2022-01-06
- Assignees: Next Silicon Ltd
- Applicants: Next Silicon Ltd
- Inventors: Daniel KHANKIN
- Web page: https://patentgrep.com/patent/US20260086909A1

## CPC

- G06F 11/3433: {for load management (allocation of a server based on load conditions G06F9/505; load rebalancing G06F9/5083; redistributing the load in a network by a load balancer H04L67/1029)}
- G06F 11/3089: {Monitoring arrangements determined by the means or processing involved in sensing the monitored data, e.g. interfaces, connectors, sensors, probes, agents (software debugging using additional hardware using a specific debug interface G06F11/3656; performance evaluation by tracing or monitoring G06F11/3466)}
- G06F 11/3452: {Performance evaluation by statistical analysis}
- G06F 17/17: Function evaluation by approximation methods, e.g. inter- or extrapolation, smoothing, least mean square method ({G06F17/18 takes precedence } ; interpolation for numerical control G05B19/18)
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

An apparatus for computing functions using polynomial-based approximation, comprising one or more processing circuitries configured for computing a polynomial-based approximant approximating a function by executing one or more iterations. Each iteration comprising computing the polynomial-based approximant using scaled fixed-point unit(s) according to a constructed set of coefficients, minimizing an approximation error of the computed polynomial-based approximant compared to the function while complying with one or more constraints selected from a group comprising at least: an accuracy, a compute graph size, a computation complexity, and a hardware utilization of the processing circuitry(s), adjusting one or more of the coefficients in case the approximation error is incompliant with the constraint(s) and initiating another iteration. The polynomial-based approximant and its adjusted set of coefficients for which the computed polynomial-based approximant complies with the constraint(s) may be output to one or more processing circuitries configured to approximate the function by computing the polynomial-based approximant.

## Claims

### Claim 1

A system for generating polynomial-based approximants, comprising:
at least one hardware processing circuitry comprising a plurality of logical hardware elements configured to realize at least one scaled fixed-point unit;
wherein the at least one hardware processing circuitry is configured for:
computing a first polynomial-based approximant approximating a function by configuring the plurality of logical hardware elements according to a first set of coefficients corresponding to a first target interval;
collecting a plurality of statistical values comprising data-statistic values indicative of the computing of the first polynomial-based approximant by the plurality of logical hardware elements;
analyzing the plurality of statistical values to identify a second target interval based on a distribution of input argument values observed in the data-statistic values, wherein the second target interval is narrower than the first target interval;
generating a second polynomial-based approximant optimized for the second target interval by constructing a second set of coefficients for approximating the function over the second target interval; and
reconfiguring connections between the plurality of logical hardware elements to enable computation of the second polynomial-based approximant according to the second set of coefficients.

### Claim 2 (depends on 1)

The system of claim 1, wherein the data-statistic values comprise frequency distribution data indicating how frequently different input argument values within the first target interval are processed during the computing of the first polynomial-based approximant.

### Claim 3 (depends on 2)

The system of claim 2, wherein analyzing the plurality of statistical values comprises:
identifying a high-frequency subinterval within the first target interval where a majority of the input argument values are concentrated; and
defining the second target interval to encompass the high-frequency subinterval.

### Claim 4 (depends on 1)

The system of claim 1, wherein the second polynomial-based approximant achieves at least one of: a reduced approximation error compared to the first polynomial-based approximant within the second target interval, a reduced number of coefficients compared to the first polynomial-based approximant, or a reduced computation complexity compared to the first polynomial-based approximant.

### Claim 5 (depends on 1)

The system of claim 1, wherein generating the second polynomial-based approximant comprises:
minimizing an approximation error of the second polynomial-based approximant over the second target interval while complying with at least one constraint selected from: an accuracy requirement, a compute graph size constraint, a computation complexity constraint, and a hardware utilization constraint.

### Claim 6 (depends on 1)

The system of claim 1, wherein the plurality of logical hardware elements comprises:
a plurality of reconfigurable logical elements;
a plurality of configurable data routing junctions; and
at least one interconnect network connecting the plurality of reconfigurable logical elements via the plurality of configurable data routing junctions.

### Claim 7 (depends on 6)

The system of claim 6, wherein reconfiguring connections between the plurality of logical hardware elements comprises:
adjusting at least one of the plurality of configurable data routing junctions to establish new data paths between reconfigurable logical elements according to a compute graph of the second polynomial-based approximant.

### Claim 8 (depends on 1)

The system of claim 1, wherein the at least one hardware processing circuitry further comprises at least one telemetry circuitry configured to automatically capture the data-statistic values during runtime execution of the first polynomial-based approximant.

### Claim 9 (depends on 8)

The system of claim 8, wherein the at least one telemetry circuitry comprises at least one counter configured to track frequency of input argument values within predetermined subintervals of the first target interval.

### Claim 10 (depends on 1)

The system of claim 1, wherein the at least one hardware processing circuitry is further configured for:
determining whether a degree of the second polynomial-based approximant should differ from a degree of the first polynomial-based approximant based on the second target interval being narrower than the first target interval; and
constructing the second set of coefficients according to the determined degree.

### Claim 11

A method for generating polynomial-based approximants, comprising:
using at least one hardware processing circuitry comprising a plurality of logical hardware elements configured to realize at least one scaled fixed-point unit, wherein the method comprises:
computing a first polynomial-based approximant approximating a function by configuring the plurality of logical hardware elements according to a first set of coefficients corresponding to a first target interval;
collecting a plurality of statistical values comprising data-statistic values indicative of the computing of the first polynomial-based approximant by the plurality of logical hardware elements;
analyzing the plurality of statistical values to identify a second target interval based on a distribution of input argument values observed in the data-statistic values, wherein the second target interval is narrower than the first target interval;
generating a second polynomial-based approximant optimized for the second target interval by constructing a second set of coefficients for approximating the function over the second target interval; and
reconfiguring connections between the plurality of logical hardware elements to enable computation of the second polynomial-based approximant according to the second set of coefficients.

### Claim 12 (depends on 11)

The method of claim 11, wherein the data-statistic values comprise frequency distribution data indicating how frequently different input argument values within the first target interval are processed during the computing of the first polynomial-based approximant.

### Claim 13 (depends on 12)

The method of claim 12, wherein analyzing the plurality of statistical values comprises:
identifying a high-frequency subinterval within the first target interval where a majority of the input argument values are concentrated; and
defining the second target interval to encompass the high-frequency subinterval.

### Claim 14 (depends on 11)

The method of claim 11, wherein the second polynomial-based approximant achieves at least one of: a reduced approximation error compared to the first polynomial-based approximant within the second target interval, a reduced number of coefficients compared to the first polynomial-based approximant, or a reduced computation complexity compared to the first polynomial-based approximant.

### Claim 15 (depends on 11)

The method of claim 11, wherein generating the second polynomial-based approximant comprises:
minimizing an approximation error of the second polynomial-based approximant over the second target interval while complying with at least one constraint selected from: an accuracy requirement, a compute graph size constraint, a computation complexity constraint, and a hardware utilization constraint.

### Claim 16 (depends on 11)

The method of claim 11, wherein the plurality of logical hardware elements comprises:
a plurality of reconfigurable logical elements;
a plurality of configurable data routing junctions; and
at least one interconnect network connecting the plurality of reconfigurable logical elements via the plurality of configurable data routing junctions.

### Claim 17 (depends on 16)

The method of claim 16, wherein reconfiguring connections between the plurality of logical hardware elements comprises:
adjusting at least one of the plurality of configurable data routing junctions to establish new data paths between reconfigurable logical elements according to a compute graph of the second polynomial-based approximant.

### Claim 18 (depends on 11)

The method of claim 11, wherein the at least one hardware processing circuitry further comprises at least one telemetry circuitry configured to automatically capture the data-statistic values during runtime execution of the first polynomial-based approximant.

### Claim 19 (depends on 11)

The method of claim 11, further comprising:
determining whether a degree of the second polynomial-based approximant should differ from a degree of the first polynomial-based approximant based on the second target interval being narrower than the first target interval; and
constructing the second set of coefficients according to the determined degree.

### Claim 20 (depends on 11)

The method of claim 11, wherein the function approximated by the first polynomial-based approximant and the second polynomial-based approximant is selected from: a trigonometric function, a hyperbolic function, an exponential function, a logarithmic function, a rational function, and an inverse function thereof.
