Methods for converting an n-bit number into an m-bit number for situations where n>m and also for situations where n<m, where n and m are integers. The methods use truncation or bit replication followed by the calculation of an adjustment value which is applied to the replicated number.

Methods for converting an n-bit number into an m-bit number for situations where n>m and also for situations where n<m, where n and m are integers. The methods use truncation or bit replication followed by the calculation of an adjustment value which is applied to the replicated number.

Provided is a method and system for transforming a GUID of a database entry into a reduced identifier. The transformation may be performed by a bijective function. In one example, the method may include one or more of receiving a database entry which includes a global unique identifier (GUID) which uniquely identifies the database entry, identifying a transformation function associated with the database entry, transforming the GUID into a reduced identifier based on the transformation function wherein the reduced identifier has a reduced size with respect to a size of the GUID, and storing the database entry based on the reduced identifier.

Provided is a method and system for transforming a GUID of a database entry into a reduced identifier. The transformation may be performed by a bijective function. In one example, the method may include one or more of receiving a database entry which includes a global unique identifier (GUID) which uniquely identifies the database entry, identifying a transformation function associated with the database entry, transforming the GUID into a reduced identifier based on the transformation function wherein the reduced identifier has a reduced size with respect to a size of the GUID, and storing the database entry based on the reduced identifier.

Methods for converting an n-bit number into an m-bit number for situations where n>m and also for situations where n<m, where n and m are integers. The methods use truncation or bit replication followed by the calculation of an adjustment value which is applied to the replicated number.

A primary interval for convergence of at least one power series in a transcendental function is interpolated, while selecting a number of one or more interpolation points for a truncated expansion of the at least one power series by a selected order of truncation. A function and at least one derivative of the function of the truncated expansion of the selected order of truncation is evaluated at the one or more interpolation points. Each separate value evaluated for the function and each of the at least one derivative is saved in a table, wherein the table is looked up for efficiently computing a result of the truncated expansion of the at least one power series.

A primary interval for convergence of at least one power series in a transcendental function is interpolated, while selecting a number of one or more interpolation points for a truncated expansion of the at least one power series by a selected order of truncation. A function and at least one derivative of the function of the truncated expansion of the selected order of truncation is evaluated at the one or more interpolation points. Each separate value evaluated for the function and each of the at least one derivative is saved in a table, wherein the table is looked up for efficiently computing a result of the truncated expansion of the at least one power series.

Control circuitry coupled to a multiply unit which includes a plurality of stage, each of which may be configured to perform a corresponding arithmetic function, may be configured to retrieve a given entry from a lookup table dependent upon a first portion of a binary representation of an input operand. An error value of an error function evaluated dependent upon a lookup value in a given entry of the plurality of entries is included in a predetermined error range. The control circuitry may be further configured to determine an initial approximation of a result of an iterative arithmetic operation using the first entry and initiate the iterative arithmetic operation using the initial approximation and the input operand.

A non-linear activation function may be approximated by linear functions. The input range of the activation function may be divided into input segments. One or more input segments may be selected based on statistical analysis of input data elements in the input range. A parameter of a first linear function that approximates the activation function for at least part of a selected input segment may be stored in a first portion of a first look-up table (LUT). The first portion of the first LUT is dedicated to a first group of post processing engines (PPEs). A parameter of a second linear function that approximates the activation function for at least part of an unselected input segment may be stored in a shared pool of LUT entries, which includes a second portion of the first LUT and a portion of a second LUT and is shared by multiple groups of PPEs.

A primary interval for convergence of at least one power series in a transcendental function is interpolated; while selecting a number of interpolation points for a truncated expansion of power series by a selected order of truncation. A function and at least one derivative of the function of the truncated expansion of the selected order of truncation is evaluated at the interpolation points by computing a set of scaled values for convergence boundaries of the truncated expansion for a total number of values to be stored in the table; for each index value up to a value of the number of the interpolation points, evaluating the function and the derivative of the function of the truncated expansion converging in the set of scaled values to compute separate constant values for the primary function and each at least one derivative; and for each index value, adding each separate constant value to the table with a separate index value. Each separate value evaluated for the function and each derivative is saved in a table, wherein the table is looked up for efficiently computing a result of the truncated expansion of the at least one power series.