Abstract:
본 발명은 프레임 양자화에 기반한 분산 행렬 곱 연산 방법 및 장치에 관한 것으로, 프레임 양자화에 기반한 부호화 컴퓨팅을 이용하여 복수의 연산 노드에서 분산 행렬 곱 연산을 수행하는 방법 및 장치를 제공한다. 이로써 고차원 행렬 곱 처리 성능이 개선된다.
Abstract:
The present disclosure describes a digital signal processing (DSP) block (26) that includes a columns (102) of weight registers (104) that can receive values and inputs that can receive multiple first values and multiple second values, where the multiple first values may be stored in the weight registers (104) after being received at the inputs. Additionally, the DSP block (26) includes multipliers (108) that, in a first mode of operation, simultaneously multiply each of the first values by a value of the multiple second values. The DSP block (26), in a second mode of operation, enables a first column (102) of multipliers (108) of the multipliers (108) to multiply each of multiple third values by each of multiple fourth values, where at least one of the multiple third values or fourth values includes more bits than the first values and second values.
Abstract:
Disclosed herein includes a system, a method, and a device including shift circuitry and add circuitry for performing multiplication of a first value and a second value for a neural network. The first value has a predetermined format including a first bit, and two or more second bits to represent a value of zero or 2 n where n is an integer greater than or equal to 0. The device shifts, when the two or more second bits represent the value of 2 n , the second value by (n+1) bits via the shift circuitry to provide a first result, selectively outputs zero or the second value, based on a value of the first bit of the first value, to provide a second result, and adds the first result and the second results via the add circuitry to provide a result of the multiplication of the first and second values.
Abstract:
In one embodiment, a method includes receiving a request for an operation to be performed; determining that the operation is associated with a machine-learning algorithm, and in response, route the operation to a computing circuit; performing, at the computing circuit, the operation, including: determining a linear domain product of a first log-domain number and a second log-domain number associated with the operation based on a summation of the first log-domain number and the second log-domain number and output a third log-domain number approximating the linear domain product of the first log-domain number and the second log-domain number; converting the third log-domain number to a first linear-domain number; summing the first linear-domain number and a second linear-domain number associated with the operation, and output a third linear-domain number as the summed result.
Abstract:
A method and an apparatus optically perform matrix-matrix multiplications in real time utilizing spatially coherent input light and wavelength multiplexing. The method comprises: applying first-matrix values to amplitude of separated and spread light; applying second-matrix values to a combined and spread modulated light; filtering out light that is not part of added amplitudes of light; and separating the added amplitudes of light.
Abstract:
The inventive method for performing a cryptographic operation by a device controlled by the security application executed outside thereof consists in producing a cryptographic value (y) in the device by a calculation comprising at least one multiplication between first and second factors containing a security key (s) associated with the device and a challenge number (c) provided by the security application. The first multiplication factor comprises a determined number of bits (L) in a binary representation. The second factor is constrained in such a way that it comprises; in a binary representation, several bits at 1 with a sequence of at least L-1 bits at 0 between each pair of consecutive bits to 1 and the multiplication is carried out by assembling the binary versions of the first factor shifted according to positions of the bits at 1 of the second factor, respectively.
Abstract:
The inventive method for performing a cryptographic operation by a device controlled by the security application executed outside thereof consists in producing a cryptographic value (y) in the device by a calculation comprising at least one multiplication between first and second factors containing a security key (s) associated with the device and a challenge number (c) provided by the security application. The first multiplication factor comprises a determined number of bits (L) in a binary representation. The second factor is constrained in such a way that it comprises; in a binary representation, several bits at 1 with a sequence of at least L-1 bits at 0 between each pair of consecutive bits to 1 and the multiplication is carried out by assembling the binary versions of the first factor shifted according to positions of the bits at 1 of the second factor, respectively.
Abstract:
A multiplication logic circuit comprises array generation logic and array reduction logic. The array reduction logic comprises array reduction logic for a first level of array reduction which comprises maximal length parallel counters for reducing maximal length columns. The output of the maximal length parallel counters are then further reduced by a second level of reduction logic comprising logic circuits with asymmetric delays in order to compensate for the differential delays experienced by the outputs of the maximal length parallel counters.
Abstract:
The inventive device is used for saving chip area and increasing the processing speed of especially relatively costly multiplication devices which have a displacement device connected downstream, such as those found in video compression devices. To this end, the multiplier is split into a factor part and a displacement part and the displacement part is also taken into account in the displacement unit connected downstream.